{"lang": "GNU C++", "source_code": "#include<stdio.h>\n#include<iostream>\nusing namespace std;\n\nvoid fun(int x, int a, int b, int c, int& count){\n if(a!=x||b!=x||c!=x){\n \t if(c!=x){\n \t\t if(a+b>x){\n \t\t\tc=x;\n\t\t }\n\t\t else c=b+a-1;\n \t\tcount++;\n\t }\n\t //printf(\"%d %d %d\\n\",a,b,c);\n\t fun(x,c,a,b,count);\n }\t\t \n}\n \n \n int main(){\n \tint x,y,count=0;\n \tscanf(\"%d%d\",&x, &y);\n \tfun(x,y,y,y,count);\n \tprintf(\"%d\\n\",count);\n \treturn 0;\n }\n\t \t    \t\t\t \t\t\t \t\t\t   \t \t\t    \t", "lang_cluster": "C++", "tags": ["math", "greedy"], "code_uid": "74c62948aedf421df687a52aaf640f82", "src_uid": "8edf64f5838b19f9a8b19a14977f5615", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++", "source_code": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nconst int dx[]={1,-1,0,0};\nconst int dy[]={0,0,1,-1};\nconst int INF=1000000000;\nint n,m,sx,sy,tx[10],ty[10],tp[10],tn,bx[10],by[10],bn;\nint f[21][21][256][256],pr[256],ans;\nint qx[2000010],qy[2000010],qt[2000010],qb[2000010],l,r;\nchar a[51][51];\nint main()\n{\n\tscanf(\"%d%d\",&n,&m);\n\tfor(int i=1;i<=n;i++) scanf(\"%s\",a[i]+1);\n\tfor(int i=1;i<=n;i++)\n\t\tfor(int j=1;j<=m;j++)\n\t\t{\n\t\t\tif(a[i][j]=='S') sx=i,sy=j;\n\t\t\tif(a[i][j]>='0'&&a[i][j]<='9') tx[a[i][j]-'0']=i,ty[a[i][j]-'0']=j,tn++;\n\t\t\tif(a[i][j]=='B') bx[++bn]=i,by[bn]=j;\n\t\t}\n\tfor(int i=1;i<=tn;i++) scanf(\"%d\",&tp[i]);\n\tfor(int i=1;i<=n;i++)\n\t\tfor(int j=1;j<=m;j++)\n\t\t\tfor(int k=0;k<(1<<tn);k++)\n\t\t\t\tfor(int l=0;l<(1<<bn);l++)\n\t\t\t\t\tf[i][j][k][l]=INF;\n\tl=r=1;\n\tqx[1]=sx,qy[1]=sy,qt[1]=0,qb[1]=0;\n\tf[sx][sy][0][0]=0;\n\twhile(l<=r)\n\t{\n\t\tint ox=qx[l],oy=qy[l],ot=qt[l],ob=qb[l++];\n\t\tfor(int k=0;k<4;k++)\n\t\t{\n\t\t\tint nx=ox+dx[k],ny=oy+dy[k],nt=ot,nb=ob;\n\t\t\tif(a[nx][ny]!='.'&&a[nx][ny]!='S') continue;\n\t\t\tfor(int i=1;i<=tn;i++)\n\t\t\t{\n\t\t\t\tif(ny<=ty[i]) continue;\n\t\t\t\tif(nx==tx[i]-1&&ox==tx[i]) nt^=(1<<(i-1));\n\t\t\t\tif(ox==tx[i]-1&&nx==tx[i]) nt^=(1<<(i-1));\n\t\t\t}\n\t\t\tfor(int i=1;i<=bn;i++)\n\t\t\t{\n\t\t\t\tif(ny<=by[i]) continue;\n\t\t\t\tif(nx==bx[i]-1&&ox==bx[i]) nb^=(1<<(i-1));\n\t\t\t\tif(ox==bx[i]-1&&nx==bx[i]) nb^=(1<<(i-1));\n\t\t\t}\n\t\t\tif(f[nx][ny][nt][nb]>f[ox][oy][ot][ob]+1)\n\t\t\t\tf[nx][ny][nt][nb]=f[ox][oy][ot][ob]+1,qx[++r]=nx,qy[r]=ny,qt[r]=nt,qb[r]=nb;\n\t\t}\n\t}\n\tfor(int i=0;i<(1<<tn);i++)\n\t\tfor(int j=1;j<=tn;j++)\n\t\t\tif(i&(1<<(j-1))) pr[i]+=tp[j];\n\tfor(int i=0;i<(1<<tn);i++)\n\t\tans=max(ans,pr[i]-f[sx][sy][i][0]);\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["shortest paths", "bitmasks"], "code_uid": "947613b2d3b8e128f33077a31c78e49f", "src_uid": "624a0d6cf305fcf67d3f1cdc1c5fef8d", "difficulty": 2600.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include <bits/stdc++.h>\nusing namespace  std;\n#define ll __int64\n#define ull unsigned long long   \nconst int N = 5e6+10;  \n\nint vis[110][110];\nint f[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};\n\nstruct node {\n\tint x, y, step;\n\tfriend bool operator < (const node n1, const node n2) {\n\t\treturn n1.step > n2.step;\n\t}\n}t, e;\npriority_queue<node>q;\n\nint bfs(int l, int u, int xi, int yi) {\n\te.x=l, e.y=u, e.step=0;\n\tq.push(e);\n\tvis[e.x][e.y] = 1;\n\twhile(!q.empty()) {\n\t\te = q.top(); q.pop();\n\t\tif(e.x == xi && e.y == yi) return e.step;\n\t\tfor(int i = 0; i < 4; i++) {\n\t\t\tt.x = e.x + f[i][0];\n\t\t\tt.y = e.y + f[i][1];\n\t\t\tt.step = e.step + 1;\n\t\t\tif(t.x<0 || t.y<0) continue;\n\t\t\tif(vis[t.x][t.y]) continue;\n\t\t\tvis[t.x][t.y] = 1;\n\t\t\tq.push(t);\n\t\t}\n\t}\n}\n\n\nint main() {\n\tstring s;\n\tcin>>s;\n\tint len = (int)s.size();\n\tint x=0, y=0, xx=0, yy=0;\n\tfor(int i = 0; i < len; i++) {\n\t\tif(s[i] == 'L') y--;\n\t\tif(s[i] == 'R') y++;\n\t\tif(s[i] == 'U') x--;\n\t\tif(s[i] == 'D') x++;\n\t\txx = min(xx, x);\n\t\tyy = min(yy, y);\n\t}\n\txx = -xx, yy = -yy;\n\tfor(int i=0; i<110; i++) {\n\t\tfor(int j=0; j<110; j++) vis[i][j] = 1;\n\t}\n\tx=xx, y=yy;\n\tfor(int i=0; i<len; i++) {\n\t\t\n\t\tif(s[i] == 'L') y--;\n\t\tif(s[i] == 'R') y++;\n\t\tif(s[i] == 'U') x--;\n\t\tif(s[i] == 'D') x++;\n\t\tvis[x][y] = 0;\n\t\t\n\t}\n\tint ans = bfs(xx, yy, x, y);\n\t\n\tif(ans == len) printf(\"OK\\n\");\n\telse printf(\"BUG\\n\");\n\treturn 0;\n} \n", "lang_cluster": "C++", "tags": ["constructive algorithms", "implementation", "graphs"], "code_uid": "603b4f8ad60429a481026c7f71090297", "src_uid": "bb7805cc9d1cc907b64371b209c564b3", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++17", "source_code": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n    int n,m,a=1;\n    cin>>n>>m;\n    while (m>=a)\n    {\n        m-=a;\n        a++;\n        if (a==n+1)\n        {\n            a=1;\n        }\n    }\n    cout<<m;\n    return 0;\n}\n", "lang_cluster": "C++", "tags": ["math", "implementation"], "code_uid": "b4f3975e5d71c4b853c3c3dcc421c603", "src_uid": "5dd5ee90606d37cae5926eb8b8d250bb", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include <bits/stdc++.h>\n\nint main() {\n\tint a, b, y{0};\n\tstd::cin>>a>>b;\n\twhile(a<=b){\n\t\ta *= 3;\n\t    b *= 2;\n\t    y++;\n\t}\n\tstd::cout<<y<<'\\n';\n}", "lang_cluster": "C++", "tags": ["implementation"], "code_uid": "75ba885a1fdae8c6788736a43999cb46", "src_uid": "a1583b07a9d093e887f73cc5c29e444a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include<bits/stdc++.h>\nusing namespace std;\nlong long int i,j=0,n,c,sum=0,x,a,b,f=0;\nint base(int k,int l)\n{\n    sum=0;\n    while(k!=0)\n    {\n        sum+=k%l;\n        k/=l;\n\n    }\n    return sum;\n}\nint gcd(int a,int b)\n{\n    return(b==0?a:gcd(b,a%b));\n}\nint main()\n{   f=0;\n    cin>>n;\n    for(i=2;i<n;i++)\n        f+=base(n,i);\n        j=gcd(f,n-2);\n       cout<<(f/j)<<\"/\"<<(n-2)/j<<endl;\n}\n", "lang_cluster": "C++", "tags": ["math", "implementation"], "code_uid": "c535a398d0d027358e55b75a7f3a5268", "src_uid": "1366732dddecba26db232d6ca8f35fdc", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++17", "source_code": "#include <bits/stdc++.h>\nusing namespace std;\nint A[81][81];\nstruct Edge{\n\tint to, cap, cost, next;\n};\nEdge E[30000];\nint head[7000], ne = 1;\nint NV;\ninline void addEdge(int from, int to, int cap, int cost) {\n\tE[++ne] = {to, cap, cost, head[from]}, head[from] = ne;\n\tE[++ne] = {from, 0, -cost, head[to]}, head[to] = ne;\n}\nint d[7000], p[7000];\nbool inqueue[7000];\npair<int, int> mcmf(int S, int T) {\n\tint f = 0, c = 0;\n\twhile(1) {\n\t\tfor(int i = 0; i < NV; ++i) d[i] = 1e9;\n\t\tqueue<int> Q;\n\t\tQ.push(S); d[S] = 0;\n\t\twhile(!Q.empty()) {\n\t\t\tauto v = Q.front(); Q.pop();\n\t\t\tinqueue[v] = 0;\n\t\t\tfor(int x = head[v]; x; x = E[x].next) {\n\t\t\t\tint &u = E[x].to, &cap = E[x].cap, &cost = E[x].cost;\n\t\t\t\tif(cap > 0 and d[v] + cost < d[u]) {\n\t\t\t\t\td[u] = d[v] + cost;\n\t\t\t\t\tp[u] = x;\n\t\t\t\t\tif(!inqueue[u]) Q.push(u), inqueue[u] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(d[T] == 1e9) break;\n\t\tint df = 1e9;\n\t\tfor(int i = T; i != S; i = E[p[i]^1].to)\n\t\t\tdf = min(df, E[p[i]].cap);\n\t\tfor(int i = T; i != S; i = E[p[i]^1].to)\n\t\t\tE[p[i]].cap -= df, E[p[i]^1].cap += df;\n\t\tf += df, c += df * d[T];\n\t}\n\treturn {f, c};\n}\nint n, m;\ninline int group(int i, int j) {\n\treturn (i + j) & 1;\n}\ninline int id(int i, int j) {\n\treturn (i-1)*m+j;\n}\nint main() {\n\tios::sync_with_stdio(0); cin.tie(0);\n\tcin >> n >> m;\n\tfor(int i = 1; i <= n; ++i)\n\t\tfor(int j = 1; j <= m; ++j)\n\t\t\tcin >> A[i][j];\n\tint S = 0, T = 6789;\n\tNV = 6790;\n\tfor(int i = 1; i <= n; ++i)\n\t\tfor(int j = 1; j <= m; ++j) {\n\t\t\tif(group(i, j) == 0)\n\t\t\t\taddEdge(S, id(i, j), 1, 0);\n\t\t\telse\n\t\t\t\taddEdge(id(i, j), T, 1, 0);\n\t\t}\n\tfor(int i = 1; i <= n; ++i) {\n\t\tfor(int j = 1; j <= m; ++j) {\n\t\t\tif(group(i, j) == 0) {\n\t\t\t\tif(i-1 >= 1)\n\t\t\t\t\taddEdge(id(i, j), id(i-1, j), 1, A[i][j] != A[i-1][j]);\n\t\t\t\tif(i+1 <= n)\n\t\t\t\t\taddEdge(id(i, j), id(i+1, j), 1, A[i][j] != A[i+1][j]);\n\t\t\t\tif(j-1 >= 1)\n\t\t\t\t\taddEdge(id(i, j), id(i, j-1), 1, A[i][j] != A[i][j-1]);\n\t\t\t\tif(j+1 <= m)\n\t\t\t\t\taddEdge(id(i, j), id(i, j+1), 1, A[i][j] != A[i][j+1]);\n\t\t\t}\n\t\t}\n\t}\n\tauto ans = mcmf(S, T);\n\tcout << ans.second << endl;\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["flows"], "code_uid": "884181d8a1f0e980adfd3aae9523994e", "src_uid": "1f0e8bbd5bf4fcdea927fbb505a8949b", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++17", "source_code": "#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> veci;\ntypedef vector<long long> vecll;\ntypedef stack<int> stki;\ntypedef stack<long long> stkll;\ntypedef queue<int> qi;\ntypedef queue<long long> qll;\ntypedef deque<int> dqi;\ntypedef deque<long long> dqll;\ntypedef pair<int,int> pii;\ntypedef pair<long long,long long> pll;\ntypedef priority_queue<int> pqi;\ntypedef priority_queue<long long> pqll;\ntypedef string st;\n\nvector <string> ar;\nint solved = 0;\nvoid moveStatues(vector <pii> &v) {\n    for(int i = 0;i<v.size();i++){\n        v[i].first++;\n    }\n}\n\nint checkOnStatue(int i,int j,vector <pii> v){\n    for(int k = 0;k<v.size();k++){\n        if(i==v[k].first && j == v[k].second){\n            return 1;\n        }\n    }\n    return 0;\n}\n\nint dfs (int i ,int j,vector <pii> v,vector<veci> used) {\n    if(i<0 || j < 0 || j >= 8 || i >= 8 || used[i][j]) {\n        return 0;\n    }\n    if (checkOnStatue(i,j,v)) {\n        return 0;\n    }\n    if(i == 0 && j == 7){\n        solved = 1;\n        return 1;\n    }\n    moveStatues(v);\n    if (checkOnStatue(i,j,v)) {\n        return 0;\n    }\n    int x = 0;\n    used[i][j] = 1;\n\n    x = max(dfs(i-1,j,v,used),x);if(solved) return 1;\n     x = max(dfs(i,j+1,v,used),x);if(solved) return 1;\n    x = max(dfs(i,j-1,v,used),x);if(solved) return 1;\n   x = max(dfs(i+1,j,v,used),x); if(solved) return 1;\n    x = max(dfs(i+1,j+1,v,used),x);if(solved) return 1;\n    x = max(dfs(i+1,j-1,v,used),x);if(solved) return 1;\n    x = max(dfs(i-1,j+1,v,used),x);if(solved) return 1;\n    x = max(dfs(i-1,j-1,v,used),x);if(solved) return 1;\n    x = max(dfs(i,j,v,used),x);if(solved) return 1;\n    return x;\n}\nint main()\n{\n   ios_base::sync_with_stdio(0),cin.tie(0);\n   int n,m,k,r,i,j,temp,temp1,temp2,temp3,x,x1,x2,x3;\n   st str;\n   vector <veci> used;\n   veci asd(8);\n   for(i = 0;i<8;i++){\n        used.push_back(asd);\n   }\n    vector <pii> v;\n   for ( i = 0;i<8;i++) {\n    cin>>str;\n    ar.push_back(str);\n    for(j = 0;j<8;j++) {\n            if(str[j] == 'S') {\n                v.push_back(make_pair(i,j));\n\n            }\n        }\n   }\n\nx = 0;\n  x = dfs(7,0,v,used);\n    if (x == 1) {cout<<\"WIN\"<<endl; return 0;}\n  x =  dfs(6,0,v,used);\n     if (x == 1) {cout<<\"WIN\"<<endl; return 0;}\n  x = dfs(6,1,v,used);\n      if (x == 1) {cout<<\"WIN\"<<endl; return 0;}\n  x = dfs(7,1,v,used);\n      if (x == 1) {cout<<\"WIN\"<<endl; return 0;}\n      else {\n        cout<<\"LOSE\"<<endl;\n      }\n}\n\n", "lang_cluster": "C++", "tags": ["dfs and similar"], "code_uid": "b9524bc34dc38cb98fa842f51e5a475a", "src_uid": "f47e4ab041288ba9567c19930eb9a090", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int ar[3][3];\n    \n    for(int i=0;i<3;i++)\n    {\n        for(int j=0;j<3;j++)\n        cin>>ar[i][j];\n    }\n    ar[0][0]=(-ar[0][1]-ar[0][2]+ar[1][0]+ar[1][2]+ar[2][0]+ar[2][1])/2;   \n    ar[1][1]=(ar[0][1]+ar[0][2]-ar[1][0]-ar[1][2]+ar[2][0]+ar[2][1])/2;\n    ar[2][2]=(ar[0][1]+ar[0][2]+ar[1][0]+ar[1][2]-ar[2][0]-ar[2][1])/2;\n     for(int i=0;i<3;i++)\n    {\n        for(int j=0;j<3;j++)\n        cout<<ar[i][j]<<\" \";\n        cout<<endl;\n    }\n    return 0;\n}\n", "lang_cluster": "C++", "tags": ["brute force", "implementation"], "code_uid": "252de595d007d5ec9628fa8ceec05d7d", "src_uid": "0c42eafb73d1e30f168958a06a0f9bca", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++", "source_code": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <string>\n#include <sstream>\n#include <cmath>\n#include <stdio.h>\n#include <iomanip>\n#include <queue>\n#include <map>\n\n#define pb push_back\n#define mp make_pair\n#define f1 first\n#define f2 second\n#define X first\n#define Y second\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair <int, int> PII; \ntypedef vector <int> VINT;\n\nconst int maxn = 1000 * 100 + 5;\nconst int mod = 1000 * 1000 * 1000 + 7;\n\nVINT adj[maxn], adjr[maxn];\nint mark[maxn], ans[maxn];\nint st[maxn];\n\nvoid dfs1(int x)\n{\n\tmark[x] = 1;\n\tans[x]++;\n//\tif (st[x] == 2)\n//\t\treturn;\n\tfor (int i = 0; i < (int)adj[x].size(); i++)\n\t{\n\t\tint u = adj[x][i];\n\t\tif (!mark[u])\n\t\t\tdfs1(u);\n\t}\n}\nvoid dfs2(int x)\n{\n\tmark[x] = 1;\n\tans[x]++;\n\tif (st[x] == 1)\n\t\treturn;\n\tfor (int i = 0; i < (int)adjr[x].size(); i++)\n\t{\n\t\tint u = adjr[x][i];\n\t\tif (!mark[u])\n\t\t\tdfs2(u);\n\t}\n}\n\nint main()\n{\n\tios_base::sync_with_stdio(false);\n\tint n, m;\n\tcin >> n >> m;\n\tfor (int i = 0; i < n; i++)\n\t\tcin >> st[i];\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\tu--; v--;\n\t\tadj[u].pb(v);\n\t\tadjr[v].pb(u);\n\t}\n\tfor (int i = 0; i < n; i++)\n\t\tif (!mark[i] && st[i] == 1)\n\t\t\tdfs1(i);\n\tfor (int i = 0; i < n; i++)\n\t\tmark[i] = 0;\n\tfor (int i = 0; i < n; i++)\n\t\tif (!mark[i] && st[i] == 2)\n\t\t\tdfs2(i);\n\tfor (int i = 0; i < n; i++)\n\t\tif (ans[i] == 2)\n\t\t\tcout << 1 << endl;\n\t\telse\n\t\t\tcout << 0 << endl;\n\treturn 0;\n}\n\n", "lang_cluster": "C++", "tags": ["graphs"], "code_uid": "bee4580572cdc7078eef8c4574797964", "src_uid": "87d869a0fd4a510c5e7e310886b86a57", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include<iostream>\n#define ll long long\n#define MOD ((ll)1e9+7)\nusing namespace std;\nll dp[2020][2020];\nint main()\n{\n    int n,m,k;\n    cin>>n>>m>>k;\n    for(int i=0;i<max(n,m);i++)\n        for(int j=0;j<=i;j++)\n            dp[j][i]=j?(dp[j][i-1]+dp[j-1][i-1])%MOD:1;\n    cout<<(dp[2*k][n-1]*dp[2*k][m-1])%MOD<<endl;\n    return 0;\n}", "lang_cluster": "C++", "tags": ["dp", "combinatorics"], "code_uid": "6d3d94dad4e801ab3de13aa9dad0e0a2", "src_uid": "309d2d46086d526d160292717dfef308", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include <bits/stdc++.h>\n\nusing namespace std ;\nint main()\n{\n    long long  a  , b , m  , c = 0;\n    cin >> a >> b >> m ;\n    if (a > b )\n        swap(a,b);\n    if (a <= 0 && b <= 0 && b < m )\n    {\n            cout << -1 ; return 0 ;\n    }\n    else if (b < m)\n    {\n        if (a < 0 )\n        {\n            c += (-a) / b ;\n            if ((-a) % b != 0 ) c++;\n            a = b - ( (-a) % b );\n            if (a == b) a = 0 ;\n        }\n        // cout << a << \" \" << c << endl;\n        while( b < m)\n        {\n            long long d = b;\n            a += b ; // a1 = 2\n            b = a; // a2 = 2\n            a = d;\n            c++;\n        }\n    }\n\n    cout << c;\n}\n", "lang_cluster": "C++", "tags": ["math", "greedy"], "code_uid": "0016a92cb5efd0901ccbd1fed6465f25", "src_uid": "82026a3c3d9a6bda2e2ac6e14979d821", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nvector<long long> divisors(long long num)\n{\n    vector<long long>ret;\n    long long i;\n    for(i=2;i*i<num;i++)\n        if(num%i==0)\n        {\n            ret.push_back(i);\n            ret.push_back(num/i);\n        }\n    if(i*i==num)\n        ret.push_back(i);\n    return ret;\n}\n\nint main()\n{\n    #ifndef ONLINE_JUDGE\n    freopen(\"input.in\",\"r\",stdin);\n    freopen(\"output.out\",\"w\",stdout);\n    #endif\n    long long n,m,k;\n    while(scanf(\"%lld%lld%lld\",&n,&m,&k)!=EOF)\n    {\n    \tif(n%2==0)\n    \t{\n    \t\tprintf(\"Marsel\\n\");\n    \t\tcontinue;\n    \t}\n    \tvector<long long>div=divisors(m);\n    \tbool flag=false;\n    \tif(m>1)\n    \t\tdiv.push_back(1);\n    \tfor(int i=0;i<div.size()&&!flag;i++)\n    \t\tif(div[i]>=k)\n    \t\t\tflag=true;\n    \tif(flag)\n    \t\tprintf(\"Timur\\n\");\n    \telse\n    \t\tprintf(\"Marsel\\n\");\n    }\n    return 0;\n}", "lang_cluster": "C++", "tags": ["dp", "number theory", "games"], "code_uid": "aeecd512458febcbabe88a2f902c2f81", "src_uid": "4a3767011ddac874efa021fff7c94432", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define pb push_back\n#define pi 3.14159265358979323846\nconst ll INF=1<<28;\n#define MOD 1000000007\nusing namespace std;\n\nll POWER(ll base,ll expo)\n{\n    ll num=1;\n    ll i=expo;\n    while(i)\n    {\n        num=num*base;\n        i--;\n    }\n    return num;\n}\nint main()\n{\n    ll t=1; //cin>>t;\n    while(t--)\n    {\n       ll n,m,k; cin>>n>>m>>k;\n       ll a[n];\n       for(ll i=0;i<n;i++)\n        cin>>a[i];\n       sort(a,a+n);\n       if(m<=k)cout<<0;\n       else\n       {\n           ll sum=0,i=n,devices=m,soc=k;\n           while(sum<m && devices>soc &&i>=1)\n           {\n               i--;\n               sum+=a[i];\n               devices-=a[i];\n               soc--;\n           }\n           if(devices<=soc)cout<<n-i;\n           else\n           {\n               ll i=n,used=0,ss=0,j=0;\n               while(i>=1 && ss<m)\n               {\n                 i--;\n                 if(used>=k*j && j>=1)\n                    ss--;\n                 ss+=a[i];\n                 used++;\n                 if(used%k==0 && used!=0)\n                    j++;\n               }\n               if(ss>=m)cout<<used;\n               else cout<<-1;\n           }\n       }\n    }\n    return 0;\n}\n", "lang_cluster": "C++", "tags": ["sortings", "implementation", "greedy"], "code_uid": "676a04e16c47f99e3c47da1a9f0dfed5", "src_uid": "b32ab27503ee3c4196d6f0d0f133d13c", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include<iostream>\n#include<queue>\n#include<set>\n#include<map>\nusing namespace std;\n\nconst int UP = 0 , DOWN = 1 , LEFT = 2 , RIGHT = 3;\nconst int UPLEFT = 4 , UPRIGHT = 5, DOWNLEFT = 6 , DOWNRIGHT = 7;\n\nint dx[] = {0 , 0,  -1, 1, -1 , 1 , -1 , 1};\nint dy[] = {1 , -1, 0 , 0, 1 ,  1 , -1 , -1};\n\nconst int MAX = 5 * 30 + 5;\nbool marked[2 * MAX][2 * MAX][8][32][6];\n\nmap<pair<int, int>, bool > mp;\nint t[100];\n\npair<int, int> rot(int dir)\n{\n  if(dir == UP)\n    return make_pair(UPLEFT , UPRIGHT);\n  if(dir == DOWN)\n    return make_pair(DOWNLEFT , DOWNRIGHT);\n  if(dir == LEFT)\n    return make_pair(UPLEFT, DOWNLEFT);\n  if(dir == RIGHT)\n    return make_pair(UPRIGHT , DOWNRIGHT);\n  if(dir == UPLEFT)\n    return make_pair(UP , LEFT);\n  if(dir == UPRIGHT)\n    return make_pair(UP , RIGHT);\n  if(dir == DOWNLEFT)\n    return make_pair(DOWN , LEFT);\n  if(dir == DOWNRIGHT)\n    return make_pair(DOWN, RIGHT);\n}\nstruct node\n{\n  int x , y, dir;\n  int lev , far;\n  node(int _x, int _y , int _dir , int _lev , int _far)\n  {\n    x = _x , y = _y , dir = _dir , lev = _lev , far = _far;\n  }\n};\nqueue<node> Q;\n\nint main()\n{\n  int n;\n  cin >> n;\n  for(int i = 1;i <= n;i ++)\n    cin >> t[i];\n\n  int ans = 0;\n  Q.push(node(MAX , MAX , UP , 1 , 1));\n\n  marked[MAX][MAX][UP][1][1] = true;\n  mp[pair<int, int>(MAX , MAX)] = true;\n  ans ++;\n  while(!Q.empty())\n  {\n      node v = Q.front();\n      Q.pop();\n\n      if(!mp[pair<int, int>(v.x , v.y)])\n      {\n        mp[pair<int, int>(v.x , v.y)] = true;\n        ans ++;\n      }\n\n      int lev = v.lev;\n      int far = v.far;\n\n      int x2 = v.x , y2 = v.y;\n\n      if(lev == n + 1)\n        continue;\n\n      if(far != t[lev])\n      {\n        x2 += dx[v.dir] , y2 += dy[v.dir];\n        if(marked[x2][y2][v.dir][lev][far + 1]) continue;\n        marked[x2][y2][v.dir][lev][far + 1] = true;\n        Q.push(node(x2 , y2 , v.dir , lev , far + 1));\n      }\n      else\n      {\n        pair<int, int> dirs = rot(v.dir);\n        if(!marked[v.x][v.y][dirs.first][lev + 1][0])\n        {\n            marked[v.x][v.y][dirs.first][lev + 1][0] = true;\n            Q.push(node(v.x, v.y , dirs.first, lev + 1, 0));\n        }\n        if(!marked[v.x][v.y][dirs.second][lev + 1][0])\n        {\n            marked[v.x][v.y][dirs.second][lev + 1][0] = true;\n            Q.push(node(v.x, v.y , dirs.second, lev + 1, 0));\n        }\n      }\n  }\n  cout << ans << endl;\n\n  return 0;\n}\n", "lang_cluster": "C++", "tags": ["dfs and similar", "brute force", "dp", "data structures", "implementation"], "code_uid": "1f2ff3464c703c905c365968165aa48d", "src_uid": "a96bc7f93fe9d9d4b78018b49bbc68d9", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "MS C++", "source_code": "#include <iostream>\nusing namespace std;\n\nint gcd(int a, int b)\n{\n    if (b == 0) return a;\n    return gcd(b, a%b);\n}\n\nint main()\n{\n    int a, b, x, y;\n    cin >> a >> b >> x >> y;\n\n    int d = gcd(x, y);\n    x /= d; y /= d;\n    int k1 = a / x;\n    int k2 = b / y;\n    int k = min(k1, k2);\n    \n    cout << x * k << \" \" << y * k << endl;\n}", "lang_cluster": "C++", "tags": ["binary search", "number theory"], "code_uid": "9b9a1e4fad246298de49a76910e74537", "src_uid": "97999cd7c6de79a4e39f56a41ff59e7a", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++", "source_code": "#include <algorithm>\n#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <cassert>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n#include <ctime>\n#include <set>\n#include <map>\n#include <queue>\n#include <stack>\n#include <deque>\n\n#define F first\n#define S second\n#define eps 1e-8\n#define pb push_back\n#define ppb pop_back\n#define mp make_pair\n#define lb lower_bound\n#define ub upper_bound\n#define INF 2000000000\n\ntypedef long long ll;\n\nusing namespace std;\nll l, r, ans;\nint q, Q, p; \nbool w[99], W[99];\nint main()\n{\n\tios::sync_with_stdio(0);\n\tcin >> l >> r;\n\twhile(l){\n\t\tw[q++] = l % 2;\n\t\tl >>= 1;\n\t}\n\twhile(r){\n\t\tW[Q++] = r % 2;\n\t\tr >>= 1;\n\t}\n\tfor(int i = Q; i >= 0; i--)\n\t\tif(w[i] != W[i]){\n\t\t\tp = i + 1;\n\t\t\tbreak;\n\t\t}\n\tans = (1ll << p) - 1ll;\n\tcout << ans;\n\t\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["math", "dp", "bitmasks", "greedy", "implementation"], "code_uid": "323c6bb0d06ecb72d1723b85d77867ec", "src_uid": "d90e99d539b16590c17328d79a5921e0", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++17", "source_code": "//hey Stalker\n#include<bits/stdc++.h>\n#define ll long long\n#define vect vector<ll>\n#define pb push_back\n#define f(n) for(i=0;i<n;i++)\n#define F(n) for(i=1;i<=n;i++)\n#define s second\n#define mod 1000000007\n#define Map map<ll , ll >\nusing namespace std;\nmain()\n{ll t;\ncin>>t;\nwhile(t--)\n{\n\tll n,k,d;\n\tcin>>n>>k>>d;\n\tll i;\n\tMap m;\n\tll a[n];\n\tf(n)\n\t\tcin>>a[i];\n\tf(d)\n\t\t\tm[a[i]]+=1;\n\tll ans=m.size();\n//\tcout<<ans<<endl;\n\tfor(i=d;i<n;i++)\n\t{\n//\t\tif(m.find(a[i])==m.end())\n\t\t\tm[a[i]]+=1;\n\t\tm[a[i-d]]--;\n\t\tif(m[a[i-d]]==0)\n\t\t\tm.erase(a[i-d]);\n\t\tans=min(ans,(ll)m.size());\n\t\n\t}\n\tcout<<ans<<endl;\n}\n}\n\t\t\n\t\t\n", "lang_cluster": "C++", "tags": ["implementation"], "code_uid": "b23db983c8c9d75fc9468152b1e1a71f", "src_uid": "56da4ec7cd849c4330d188d8c9bd6094", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include <iostream>\n#include <cstdio>\n#include <cctype>\n#define il inline\n#define vd void\n#define rep(i,x,y) for(register int i=x;i<=y;++i)\n#define drp(i,x,y) for(register int i=x;i>=y;--i)\nusing namespace std;\nconst int Len=2333333;\nchar buf[Len],*p1=buf,*p2=buf,duf[Len],*q1=duf;\nil char gc(); il int rd(); il vd pc(char c); il vd rt(int x); il vd flush();\nint n,s;\nint main(){//sjn AK IOI\n\tcin>>n>>s;\n\tint ans=s/n;\n\tif(s%n) ++ans;\n\tcout<<ans;\n\treturn flush(),0;\n}\n\nil char gc(){return p1==p2&&(p2=(p1=buf)+fread(buf,1,Len,stdin),p1==p2)?-1:*p1++;}\nil int rd(){char c;\n\twhile(!isdigit(c=gc())&&c!='-');\n\tint f=c=='-'?c=gc(),1:0,x=c^48;\n\twhile(isdigit(c=gc())) x=((x+(x<<2))<<1)+(c^48);\n\treturn f?-x:x;\n}\nil vd pc(char c){q1==duf+Len&&fwrite(q1=duf,1,Len,stdout),*q1++=c;}\nil vd rt(int x){x<0?pc('-'),x=-x:0,pc((x>=10?rt(x/10),x%10:x)+48);}\nil vd flush(){fwrite(duf,1,q1-duf,stdout);}", "lang_cluster": "C++", "tags": ["math", "greedy", "implementation"], "code_uid": "96808c606ce3c68d14d0602564b333a1", "src_uid": "04c067326ec897091c3dbcf4d134df96", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++17", "source_code": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tchar a, b;\n\tint h1, h2, m1, m2;\n\tcin >> h1 >> a >> m1 >> h2 >> b >> m2;\n\tint t1 = h1*60 + m1;\n\tint t2 = h2*60 + m2;\n\tint mid = (t1+t2)/2;\n\tint hAns = mid/60;\n\tint mAns = mid%60;\n\tif(hAns < 10) cout << \"0\" << hAns << \":\";\n\telse cout << hAns << \":\";\n\tif(mAns < 10) cout << \"0\" << mAns << endl;\n\telse cout << mAns << endl;\t\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["implementation"], "code_uid": "88a1c5cb6d1fb00c98739b1be92996a0", "src_uid": "f7a32a8325ce97c4c50ce3a5c282ec50", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++", "source_code": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tchar str[510];\n\tscanf(\"%s\",str);\n\tint t=0,i;\n\tfor(i=0;i<strlen(str);i++) \n\t{\n\t\tif(str[i]-'a'>t)\n\t\t{\n\t\t  printf(\"NO\\n\");\n\t\t  break;\n\t    }\n\t\tif(str[i]-'a'==t)\n\t\tt++;\n\t}\n\tif(i==strlen(str))\n\tprintf(\"YES\\n\");\n\treturn 0;\n}", "lang_cluster": "C++", "tags": ["greedy", "strings", "implementation"], "code_uid": "f8e3972f7276aa47c9cdaa3c42345391", "src_uid": "c4551f66a781b174f95865fa254ca972", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++0x", "source_code": "#include<iostream>\nusing namespace std;\n#include<algorithm>\n\nint main()\n{\n    int a, b;\n    cin >> a >> b;\n    int x, y;\n    int c1 = 0, c2 = 0, c3 = 0;\n\n    for (int i = 6; i > 0; i--)\n    {\n        x = max(i, a) - min(i, a);\n        y = max(i, b) - min(i, b);\n        \n        \n        if (x < y)\n            c1++;\n        else{\n            if (x>y)\n                c2++;\n            else c3++;\n        }\n\n    }\n    cout << c1 << \" \" << c3 << \" \" << c2;\n        \n}", "lang_cluster": "C++", "tags": ["brute force"], "code_uid": "200daa9cba78583b07349262feb2295b", "src_uid": "504b8aae3a3abedf873a3b8b127c5dd8", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "\n#include <iostream>\n#include <algorithm>\n#include <string.h>\n#include <math.h>\n#include <vector>\n\nusing namespace std;\n\n#define pb push_back\n#define mp make_pair\n#define ll long long\n#define ull unsigned ll\n#define db double\n#define INF 0x3f3f3f3f\n#define MOD 1000000007\n#define PII pair<int, int>\n\nll l,r;\nint num[10],keep[10];\nvector<int> lv,rv;\n\ninline bool any(int l,int r) {\n    for (int i=l;i<=r;i++) {\n        if (num[i]>0) return true;\n    }\n    return false;\n}\n\nbool dfs(int idx,bool lf,bool rf) {\n    if (idx==rv.size()) return true;\n    int l=lv[idx],r=rv[idx];\n    if (lf&&rf) {\n        if (l==r) {\n            if (num[l]>0) {\n                num[l]--;\n                if (dfs(idx+1,1,1)) return true;\n                num[l]++;\n            }\n            return false;\n        }\n        if (any(l+1,r-1)) return true;\n        if (num[l]>0) {\n            num[l]--;\n            if (dfs(idx+1,1,0)) return true;\n            num[l]++;\n        }\n        if (num[r]>0) {\n            num[r]--;\n            if (dfs(idx+1,0,1)) return true;\n            num[r]++;\n        }\n        return false;\n    } else {\n        if (lf) {\n            if (any(l+1,9)) return true;\n            if (num[l]>0) {\n                num[l]--;\n                if (dfs(idx+1,1,0)) return true;\n                num[l]++;\n            }\n            return false;\n        } \n        if (rf) {\n            if (any(0,r-1)) return true;\n            if (num[r]>0) {\n                num[r]--;\n                if (dfs(idx+1,0,1)) return true;\n                num[r]++;\n            }\n            return false;\n        }\n    }\n    return false;\n}\n\nint ans=0;\nvoid go(int idx,int rem) {\n    if (idx==10) {\n        memcpy(num,keep,sizeof(keep));\n        num[0]+=rem;\n        if (dfs(0,1,1)) ans++;\n        return;\n    }\n    for (int i=0;i<=rem;i++) {\n        keep[idx]=i;\n        go(idx+1,rem-i);\n    }\n}\n\nint main()\n{\n    scanf(\"%lld%lld\",&l,&r);\n\n    while (l>0) {\n        lv.pb(l%10);\n        l/=10;\n    }\n    while (r>0) {\n        rv.pb(r%10);\n        r/=10;\n    }\n    while (lv.size()<rv.size()) lv.pb(0);\n    reverse(lv.begin(),lv.end());\n    reverse(rv.begin(),rv.end());\n\n    go(1,lv.size());\n    printf(\"%d\\n\",ans);\n}\n", "lang_cluster": "C++", "tags": ["math", "greedy", "combinatorics", "brute force"], "code_uid": "9c09694802918e7e8989feb3c9d48e8c", "src_uid": "adfa5f280eefbacdbaa4ad605402b57a", "difficulty": 2700.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++17", "source_code": "#include <bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\nconst int INF = 0x3f3f3f3f;\n\nvoid solve() {\n        int n;\n        cin >> n;\n        int a[3], b[3];\n        for (int i = 0; i < 3; ++i)\n                cin >> a[i];\n        for (int i = 0; i < 3; ++i)\n                cin >> b[i];\n\n        cout << max({0, a[0] - b[0] - b[2], a[1] - b[0] - b[1], a[2] - b[2] - b[1]}) << ' ' <<\n                min(a[0], b[1]) + min(a[1], b[2]) + min(a[2], b[0]) << endl;\n}\n\nint main() {\n        solve();\n        return 0;\n}\n\n", "lang_cluster": "C++", "tags": ["brute force", "constructive algorithms", "flows", "math", "greedy"], "code_uid": "17376885fe5cc023c3c7dd86f4c30f14", "src_uid": "e6dc3bc64fc66b6127e2b32cacc06402", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++", "source_code": "#include<iostream>\n#include<iomanip>\n#include<fstream>\n#include<algorithm>\nusing namespace std;\nint a,b,c;\nint sum;\nint main()\n{\n\tstring s,st,stt;\n\tcin>>s;\n\tcin>>stt;\n\tint len=s.size();\n\tfor(int i=len-1;i>-1;i--)\n\t{\n\t\tst+=s[i];\n\t}\n\tfor(int i=0;i<len;i++)\n\t{\n\t\tif(stt[i]==st[i])\n\t\t{\n\t\t\tsum++;\n\t\t}\n\t}\n\tif(sum==len)\n\tcout<<\"YES\";\n\telse\n\tcout<<\"NO\";\n    return 0;\n}", "lang_cluster": "C++", "tags": ["strings", "implementation"], "code_uid": "bcf79ee784c8f578ed349fc78138324e", "src_uid": "35a4be326690b58bf9add547fb63a5a5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++17", "source_code": "#include <iostream>\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vec;\ntypedef vector<vec> mat;\nmat mul(mat a,mat b,ll mod)\n{\n    mat c(a.size(),vec(b[0].size()));\n    for(int i=0;i<a.size();i++)\n    {\n        for(int k=0;k<a[0].size();k++)\n        {\n            for(int j=0;j<b[0].size();j++)\n            {\n                c[i][j]=(c[i][j]+a[i][k]*b[k][j]%mod)%mod;\n            }\n        }\n    }\n    return c;\n}\nmat q_pow(mat base,ll n,ll mod)\n{\n    mat ans(base.size(),vec(base.size()));\n    for(int i=0;i<ans.size();i++)ans[i][i]=1;\n    while(n)\n    {\n        if(n&1)ans=mul(ans,base,mod);\n        base=mul(base,base,mod);\n        n>>=1;\n    }\n    return ans;\n}\nint main()\n{\n    ll n,sx,sy,dx,dy,t;\n    while(~scanf(\"%lld%lld%lld%lld%lld%lld\",&n,&sx,&sy,&dx,&dy,&t))\n    {\n        sx--;\n        sy--;\n        mat a(6,vec(6));\n        a={\n            {2,1,1,0,1,2},\n            {1,2,0,1,1,2},\n            {1,1,1,0,1,2},\n            {1,1,0,1,1,2},\n            {0,0,0,0,1,1},\n            {0,0,0,0,0,1}\n          };\n          a=q_pow(a,t,n);\n          mat b(6,vec(1));\n          b[0][0]=sx;\n          b[1][0]=sy;\n          b[2][0]=(dx%n+n)%n;\n          b[3][0]=(dy%n+n)%n;\n          b[4][0]=0;\n          b[5][0]=1;\n          a=mul(a,b,n);\n          printf(\"%lld %lld\\n\",a[0][0]+1,a[1][0]+1);\n    }\n    return 0;\n}\n", "lang_cluster": "C++", "tags": ["math", "matrices"], "code_uid": "b6ce9f81de149ebdbb5e137f513fee08", "src_uid": "ee9fa8be2ae05a4e831a4f608c0cc785", "difficulty": 2300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "\n\n#include<iostream>\nusing namespace std;\n\n\nint main (void){\n\n    int a[100]={ 1,2,4,6,9,12,16,20,25,30,36,42,49,56,64,72,81,90,100,110,121,132,144,156,169,182,196,210,225,240,256,272,289,306,324,342,361,380,400,420,441,462,484,506,529,552,576,600,625,650,676,702,729,756,784,812,841,870,900,930,961,992,1024,1056,1089,1122,1156,1190,1225,1260,1296,1332,1369,1406,1444,1482,1521,1560,1600,1640,1681,1722,1764,1806,1849,1892,1936,1980,2025,2070,2116,2162,2209,2256,2304,2352,2401,2450,2500,2550};\n    int i;\n    cin>>i;\n    cout<<a[i-1];\n    \n    \n    \n    \n    \n    \n}", "lang_cluster": "C++", "tags": ["math", "constructive algorithms"], "code_uid": "df0ff5fbe29767cea0c4e286521ddf0d", "src_uid": "f8af5dfcf841a7f105ac4c144eb51319", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++0x", "source_code": "#include <iostream>\nusing namespace std;\nlong long n;\nint main()\n{\n    cin>>n;\n    if(n%2==1)\n    {\n        cout<<\"black\";\n        return 0;\n    }\n    cout<<\"white\"<<endl;\n    cout<<1<<\" \"<<2;\n    return 0;\n}\n", "lang_cluster": "C++", "tags": ["math", "constructive algorithms", "games"], "code_uid": "63a2f00f330f3de621082d04b3f0c1c1", "src_uid": "52e07d176aa1d370788f94ee2e61df93", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include<iostream>\n#include<algorithm>\n#include<string>\n#include<vector>\n#include<cstring>\n#include<algorithm>\n\n//#include<bits/stdc++.h>\n\nusing namespace std;\n\n\n#ifdef ONLINE_JUDGE\n\t#define WAIT\n#else\n\t#define WAIT cout<<flush, system(\"PAUSE\")\n#endif\n\n#define FOR(IN,N) for(int I = IN;I < N;++I)\n#define FORR(END,N) for(int I = N-1;I >= END;--I)\n#define foreach(arr) for(auto item : arr)\n#define REP(I,A,B) for(int I = A;I < B;++I)\n\n#define CONTAINS(m,x) m.find(x) != m.end()\n#define clr(x) memset((x),0,sizeof(x))\n#define PB push_back\n#define remove erase\n#define ALL(v) v.begin(),v.end()\n#define sz(a) a.size();\n#define endl '\\n'\n#define MAX 10010\n\ntypedef long long i64;\ntypedef pair<int,int> pii;\n\n//const int MOD = ;\n\nstring solve,s; int N;\n\nvoid Check(){\n\n\tif(solve[0] == '.'){\n\t\tsolve.remove(0,1);\n\t\tsolve = \"dot\" + solve;\n\t}\n\telse if(solve[0] == '@'){\n\t\tsolve.remove(0,1);\n\t\tsolve = \"at\" + solve;\n\t}\n\n\tif(solve[solve.size() - 1] == '.'){\n\t\tsolve.remove(solve.size() - 1,1);\n\t\tsolve += \"dot\";\n\t}\n\telse if(solve[solve.size() - 1] == '@'){\n\t\tsolve.remove(solve.size() - 1,1);\n\t\tsolve += \"at\";\n\t}\n\n}\n\nint main()\n{\n\tios_base :: sync_with_stdio(0);\n\tcin.tie(0);\n\n\tcin >> s;\n\t\n\tN = sz(s);\n\t\n\tsolve = \"\";\n\t\n\tfor(int I = 0;I < N;++I){\n\t\t\n\t\tif(I + 3 <= N){\n\t\t\tif(s.substr(I,3) == \"dot\"){\n\t\t\t\tsolve += \".\";\n\t\t\t\tI+=2;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(I + 2 <= N){\n\t\t\t\t\tif(s.substr(I,2) == \"at\"){\n\t\t\t\t\t\tsolve += \"@\";\n\t\t\t\t\t\tI+=1;\n\t\t\t\t\t}\n\t\t\t\t\telse solve += s[I];\n\t\t\t\t}\n\t\t\t\telse solve += s[I];\n\t\t\t}\n\t\t}\n\t\telse if(I + 2 <= N){\n\t\t\tif(s.substr(I,2) == \"at\"){\n\t\t\t\tsolve += \"@\";\n\t\t\t\tI+=1;\n\t\t\t}\n\t\t\telse solve += s[I];\n\t\t}\n\t\telse solve += s[I];\n\t}\n\n\tCheck();\n\n\tint cont = 0;\n\n\tfor(int I = 0;I < solve.size();++I){\n\t\t\n\t\tif(solve[I] == '@') ++cont;\n\t\n\t}\n\n\tif(cont == 1) cout << solve << endl;\n\n\telse{\n\t\n\t\tbool ok = 1;\n\n\t\tfor(int I = 0;I < solve.size();++I){\n\t\t\n\t\t\tif(solve[I] == '@'){\n\t\t\t\tif(ok){\n\t\t\t\t\tcout << '@';\n\t\t\t\t\tok = false;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tcout << \"at\";\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcout << solve[I];\n\t\t}\n\t\tcout << endl;\n\t}\n}", "lang_cluster": "C++", "tags": ["expression parsing", "implementation"], "code_uid": "622c45753340876893e6c92b6ded456e", "src_uid": "a11c9679d8e2dca51be17d466202df6e", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "#include <bits/stdc++.h>\n#include <vector>\nusing namespace std;\nint freq[26];\nint main()\n{\n\tint n;string s;\n\tcin>>n>>s;\n\tlong long int maxi=0;\n\tset<char>c;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(isupper(s[i]))\n\t\t{\n\t\t\tlong long int size=c.size();\n\t\t\tmaxi=max(maxi,size);\n\t\t\tc.clear();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tc.insert(s[i]);\n\t\t\t// freq[s[i]-'a']++;\n\t\t}\n\t}\n\tlong long int size=c.size();\n\t//cout<<size<<endl;\n\t\t\tmaxi=max(maxi,size);\n\t\t\tc.clear();\n\tcout<<maxi;\n\n\treturn 0;\n}", "lang_cluster": "C++", "tags": ["brute force", "strings", "implementation"], "code_uid": "186d6034c74679a837912ac2cec9eed1", "src_uid": "567ce65f87d2fb922b0f7e0957fbada3", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "#include <iostream>\nusing namespace std;\n//Karswrmepl\nint main ()\n{\nlong long n;\ncin>>n;\nif (n%2){\n\tcout<<1;\n}\nelse {\n\tcout<<2;\n}\n}\n", "lang_cluster": "C++", "tags": ["math", "games"], "code_uid": "d49f36da1a8edf02fef17e127cd071fa", "src_uid": "816ec4cd9736f3113333ef05405b8e81", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "// In the name of GOD!\n// 1396 / 03 / 23\n\n#include <iostream>\n#include <map>\n\nusing namespace std;\n\nmap<string, int> d;\n\nvoid pre();\nstring chrd(string x, string y, string z);\n\nint main() {\n\tstring x, y, z;\n\tcin >> x >> y >> z;\n\tpre();\n\tif (chrd(x, y, z) != \"0\") cout << chrd(x, y, z) << '\\n';\n\telse if (chrd(x, z, y) != \"0\") cout << chrd(x, z, y) << '\\n';\n\telse if (chrd(y, x, z) != \"0\") cout << chrd(y, x, z) << '\\n';\n\telse if (chrd(y, z, x) != \"0\") cout << chrd(y, z, x) << '\\n';\n\telse if (chrd(z, x, y) != \"0\") cout << chrd(z, x, y) << '\\n';\n\telse if (chrd(z, y, x) != \"0\") cout << chrd(z, y, x) << '\\n';\n\telse cout << \"strange\\n\";\n}\n\nvoid pre() {\n\td[\"C\"] = 0;\n\td[\"C#\"] = 1;\n\td[\"D\"] = 2;\n\td[\"D#\"] = 3;\n\td[\"E\"] = 4;\n\td[\"F\"] = 5;\n\td[\"F#\"] = 6;\n\td[\"G\"] = 7;\n\td[\"G#\"] = 8;\n\td[\"A\"] = 9;\n\td[\"B\"] = 10;\n\td[\"H\"] = 11;\n}\n\nstring chrd(string x, string y, string z) {\n\tint a, b;\n\ta = (d[y] - d[x] + 12) % 12;\n\tb = (d[z] - d[y] + 12) % 12;\n\tif (a == 4 && b == 3) return \"major\";\n\tif (a == 3 && b == 4) return \"minor\";\n\treturn \"0\";\n}\n", "lang_cluster": "C++", "tags": ["brute force", "implementation"], "code_uid": "5378d5ae212c39d92799f46c7d1f6ef7", "src_uid": "6aa83c2f6e095848bc63aba7d013aa58", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "#include<bits/stdc++.h>;\nusing namespace std ;\nint main ()\n{\n    int h,m,ans=0;\n    char x;\n    cin>>h>>x>>m;\n    //while((h*10!=m)&&(h==10&&m==1)&&(h==11&&m==11)&&(h==10&&m==1))\n    if(h==0)\n    {\n        if(m==0)cout<<0<<endl;\n        else cout<<(60-m)+10<<endl;\n        //cout<<m==0 ? 0 : (60-m)+10<<endl;\n    }\n    else if(h==1)\n    {\n        if(m>10)cout<<(60-m)+20<<endl;\n        else cout<<10-m<<endl;\n        //cout<<m>10 ? (60-m)+20 : 10-m<<endl;\n    }\n    else if(h==2)\n    {\n        if(m>20)cout<<(60-m)+30<<endl;\n        else cout<<20-m<<endl;\n    //    cout<<m>20 ? (60-m)+30 : 20-m<<endl;\n    }\n    else if(h==3)\n    {\n        if(m>30)cout<<(60-m)+40<<endl;\n        else cout<<30-m<<endl;\n      //  cout<<m>30 ? (60-m)+40 : 30-m<<endl;\n    }\n    else if(h==4)\n    {\n        if(m>40)cout<<(60-m)+50<<endl;\n        else cout<<40-m<<endl;\n        //cout<<m>40 ? (60-m)+50 : 40-m<<endl;\n    }\n    else if(h==5)\n    {\n        if(m>50)cout<<(60-m)+241<<endl;\n        else cout<<50-m<<endl;\n       // cout<<m>50 ? (60-m)+241 : 50-m<<endl;\n    }\n    else if(h==6||h==7||h==8||h==9)\n    {\n        cout<<(60-m)+(60*(9-h))+1<<endl;\n    }\n    else if(h==10)\n    {\n        if(m>1)cout<<(60-m)+11<<endl;\n        else cout<<1-m<<endl;\n        //cout<<m>1 ? (60-m)+11 : 1-m<<endl;\n    }\n    else if(h==11)\n    {\n        if(m>11)cout<<(60-m)+21<<endl;\n        else cout<<11-m<<endl;\n        //cout<<m>11 ? (60-m)+21 : 11-m<<endl;\n    }\n    else if(h==12)\n    {\n        if(m>21)cout<<(60-m)+31<<endl;\n        else cout<<21-m<<endl;\n        //cout<<m>21 ? (60-m)+31 : 21-m<<endl;\n    }\n    else if(h==13)\n    {\n        if(m>31)cout<<(60-m)+41<<endl;\n        else cout<<31-m<<endl;\n        //cout<<m>31 ? (60-m)+41 : 31-m<<endl;\n    }\n    else if(h==14)\n    {\n        if(m>41)cout<<(60-m)+51<<endl;\n        else cout<<41-m<<endl;\n        //cout<<m>41 ? (60-m)+51 : 41-m<<endl;\n    }\n    else if(h==15)\n    {\n        if(m>51)cout<<(60-m)+(60*(19-h)+2)<<endl;\n        else cout<<51-m<<endl;\n        //cout<<m>51 ? (60-m)+(8*60) : 51-m<<endl;\n    }\n    else if (h==20)\n    {\n        if(m>2)cout<<(60-m)+12<<endl;\n        else cout<<2-m<<endl;\n    }\n    else if(h==21)\n    {\n        if(m>12)cout<<(60-m)+22<<endl;\n        else cout<<12-m<<endl;\n    }\n    else if(h==22)\n    {\n        if(m>22)cout<<(60-m)+32<<endl;\n        else cout<<22-m<<endl;\n    }\n    else if(h==23)\n    {\n        if(m>32)cout<<60-m<<endl;\n        else cout<<32-m<<endl;\n    }\n    else\n    {\n        cout<<(60-m)+(60*(19-h)+2)<<endl;\n    }\n}\n", "lang_cluster": "C++", "tags": ["brute force", "implementation"], "code_uid": "4831cc08719905f6402215ba6b6c6aaa", "src_uid": "3ad3b8b700f6f34b3a53fdb63af351a5", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int MaxN = 2e3 + 23;\n\nconst int MOD = 998244353;\n\nint pless, pgreater;\nint CP[MaxN][MaxN];\nint STRONG[MaxN];\nint ans[MaxN];\n\nint bpow(int a, int b)\n{\n    if(!b)\n        return 1;\n    int res = bpow(a, b >> 1);\n    res = (res * 1ll * res) % MOD;\n    if(b & 1)\n        res = (res * 1ll * a) % MOD;\n    return res;\n}\n\nvoid calcCP(int n, int s)\n{\n    if(!s)\n        CP[n][s] = 1;\n    else\n    {\n        CP[n][s] = (CP[n - 1][s - 1] * 1ll * bpow(pgreater, n - s)) % MOD + (CP[n - 1][s] * 1ll * bpow(pless, s)) % MOD;\n        if(CP[n][s] >= MOD)\n            CP[n][s] -= MOD;\n    }\n}\n\nvoid calcStrong(int n)\n{\n    STRONG[n] = 1;\n    if(n > 1)\n    {\n        for(int i = 1; i < n; ++i)\n        {\n            STRONG[n] -= (STRONG[i] * 1ll * CP[n][i]) % MOD;\n            if(STRONG[n] < 0)\n                STRONG[n] += MOD;\n        }\n    }\n}\n\nvoid calcAns(int n)\n{\n    if(n < 2)\n        ans[n] = 0;\n    else\n    {\n        for(int i = 1; i <= n; ++i)\n        {\n            ans[n] += STRONG[i] * 1ll * CP[n][i] % MOD * 1ll * (i * (n - i) + (i * (i - 1)) / 2 + (long long) (i < n ? ans[i] : 0) + ans[n - i]) % MOD;\n            if(ans[n] >= MOD)\n                ans[n] -= MOD;\n        }\n        int coef = 1 - (STRONG[n] * 1ll * CP[n][n]) % MOD;\n\n        if(coef < 0)\n            coef += MOD;\n\n        ans[n] = (ans[n] * 1ll * bpow(coef, MOD - 2)) % MOD;\n    }\n}\n\nmain()\n{\n//    freopen(\"input.txt\", \"r\", stdin);\n    ios_base :: sync_with_stdio(false);\n    cin.tie(NULL);\n\n    int n, a, b;\n    cin >> n >> a >> b;\n\n    pless = (a * 1ll * bpow(b, MOD - 2)) % MOD;\n    pgreater = ((b - a) * 1ll * bpow(b, MOD - 2)) % MOD;\n\n    for(int i = 0; i <= n; ++i)\n        for(int j = 0; j <= i; ++j)\n            calcCP(i, j);\n\n    for(int i = 0; i <= n; ++i)\n        calcStrong(i);\n\n    for(int i = 0; i <= n; ++i)\n        calcAns(i);\n\n    cout << ans[n] << '\\n';\n\n    return 0;\n}\n", "lang_cluster": "C++", "tags": ["math", "dp", "probabilities", "graphs"], "code_uid": "e96cac66ca28473ae8a4ddc00d4f83c1", "src_uid": "67e599530203060c17f692f2624d0f99", "difficulty": 2800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++14", "source_code": "#include <bits/stdc++.h>\n#define len(x) ((int)(x).size())\n#define x first\n#define y second\nusing namespace std;\n\nconst int K = 1010, MOD = 1e9 + 7;\n\nint powmod(int a, int x){\n\tif(x == 0) return 1;\n\tif(x%2 == 0) return powmod(a*1LL*a%MOD, x/2);\n\treturn a*1LL*powmod(a, x - 1)%MOD;\n}\n\nint dp[K][K];\n\nint main(){\n\tint k, va, vb;\n\tscanf(\"%d %d %d\", &k, &va, &vb);\n\t\n\tint den = powmod(va + vb, MOD - 2);\n\tint pa = va*1LL*den%MOD;\n\tint pb = vb*1LL*den%MOD;\n\tint one_b = pa*1LL*powmod(pb, MOD - 2)%MOD;\n\t\n\tfor(int i = k - 1; i >= 0; i--){\n\t\tfor(int j = k; j >= 1; j--){\n\t\t\tif(i + j >= k){\n\t\t\t\tdp[i][j] = (i + j + one_b)%MOD;\n\t\t\t}else{\n\t\t\t\tdp[i][j] = (pa*1LL*dp[i][j + 1] + pb*1LL*dp[i + j][j])%MOD;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\", dp[0][1]);\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["math", "dp", "probabilities"], "code_uid": "c27ab626d8c4dee0a2244b83df870ee6", "src_uid": "0dc9f5d75143a2bc744480de859188b4", "difficulty": 2200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "// Author : Mohamed Sameh\n#include<bits/stdc++.h>\nusing namespace std ;\n\ntypedef long long ll ;\n////////////////////////////////////////////////////////////////////\n#define pb push_back\n#define f first\n#define s second\n#define all(v) v.begin(),v.end()\n#define rall(v) v.rbegin(),v.rend()\n///#Read And Write  From File\n/*\n\n  freopen(\"in.txt\",\"r\",stdin);\n  freopen(\"out.txt\",\"w\",stdout);\n\n*/\nint ReadInt ()\n{\n    int t ;\n    cin >> t ;\n    return t ;\n}\nll ReadLong ()\n{\n    ll t ;\n    cin >> t ;\n    return t ;\n}\nbool Check (string t )\n{\n    int l = 0 ;\n    int r = t.size() -1 ;\n    while (l <= r )\n    {\n        if ( t[l] != t[r]) return false ;\n        l++;\n        r--;\n    }\n    return true ;\n}\nbool check_User (string t )\n{\n    int c = 0, C = 0;\n    bool Next = 0 ;\n    int sc = 0 ;\n    for (int i = 0 ; i < t.size() ; i ++ )\n    {\n        if ( t[i] == '@' )\n        {\n            if (i+1 == t.size() ) return false ;\n            Next =  (c > 0 && c < 17 );\n            sc = i+1 ;\n            break ;\n        }\n        if (   !( ( t[i] >= 'a' && t[i] <= 'z' ) || ( t[i] >= 'A' && t[i] <= 'Z' ) ||  ( t[i] >= '0' && t[i] <= '9' )|| t[i] == '_'    ) )\n            return false ;\n        c++;\n    }\n\n    if ( Next )\n    {\n        Next = 0;\n        bool SNext = 0 ;\n        c = 0 ;\n        C = 0 ;\n        bool Turn = 0 ;\n        bool Slash = 0;\n        for (int i = sc ; i < t.size() ; i++)\n        {\n            if ( i+1 == t.size() && t[i] == '.')return false ;\n            if ( t[i] == '/')\n            {\n                if ( i-1 > 0 && t[ i-1 ] == '.') return false ;\n                Slash = 1;\n                if ( Turn == 0 )\n                    SNext = 1 ;\n                sc = i+1 ;\n                break ;\n            }\n\n\n            if (t[i] == '.'  )\n            {\n                Turn = 1 ;\n                if (c >0 && c < 17 )\n                {\n                    c=0;\n                    continue ;\n                }else\n                return false ;\n\n            }\n\n            if (!( ( t[i] >= 'a' && t[i] <= 'z' ) || ( t[i] >= 'A' && t[i] <= 'Z' ) ||  ( t[i] >= '0' && t[i] <= '9' )|| (t[i] == '_')    ) )\n                return false ;\n            c++;\n\n\n        }\n\n        ///\n        if (!SNext && Slash )\n        {\n\n            c = 0 ;\n            for (int i =sc ; i < t.size() ; i++)\n            {\n\n                if (!( ( t[i] >= 'a' && t[i] <= 'z' ) || ( t[i] >= 'A' && t[i] <= 'Z' ) ||  ( t[i] >= '0' && t[i] <= '9' )|| (t[i] == '_')    ) )\n                    return false ;\n                c++;\n            }\n            if ( c>0 && c < 17  ) return true ;\n            return false ;\n\n        }\n        else\n        {\n            if (Slash)\n            {\n                c = 0 ;\n                for (int i =sc ; i < t.size() ; i++)\n                {\n\n                    if (!( ( t[i] >= 'a' && t[i] <= 'z' ) || ( t[i] >= 'A' && t[i] <= 'Z' ) ||  ( t[i] >= '0' && t[i] <= '9' )|| (t[i] == '_')    ) )\n                        return false ;\n                    c++;\n                }\n\n                if ( c>0 && c < 17  ) return true ;\n                return false ;\n            }\n            return true ;\n        }\n\n\n    }\n    else\n    {\n\n        return false  ;\n    }\n\n}\nint main ()\n{\n\n\n    string Id ;\n    cin >> Id ;\n    if ( check_User(Id))\n        cout <<\"YES\\n\";\n    else\n        cout <<\"NO\\n\";\n\n    return 0 ;\n}\n\n\n", "lang_cluster": "C++", "tags": ["strings", "implementation"], "code_uid": "455103076e559f3321cd3eac07cc24e2", "src_uid": "2a68157e327f92415067f127feb31e24", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include<bits/stdc++.h>\nusing namespace std;\n#define REP(i,a,b) for(int i=(a),_ed=(b);i<=_ed;++i)\n#define DREP(i,a,b) for(int i=(a),_ed=(b);i>=_ed;--i)\n#define mp(x,y) make_pair((x),(y))\n#define sz(x) (int)(x).size()\n#define pb push_back\ntypedef long long ll;\ntypedef pair<int,int> pii;\ninline int read(){\n    register int x=0,f=1;register char ch=getchar();\n    while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}\n    while(isdigit(ch)){x=x*10+(ch^'0');ch=getchar();}\n    return f?x:-x;\n}\n\nconst int N=2e5+5,M=2e6+5,mod=1e9+7;\nint n,p[N],num[M],cnt[M],a[N];\ninline int power(int b,int n){int ans=1;for(;n;n>>=1,b=1ll*b*b%mod)if(n&1)ans=1ll*ans*b%mod;return ans;}\n\nint insert(int p){\n\tif(!num[p])return num[p]=cnt[p]=1,0;\n\t--p;\n\tfor(int i=2;i<=sqrt(p);++i){\n\t\tif(p%i)continue;\n\t\tint c=0;\n\t\twhile(p%i==0)p/=i,++c;\n\t\tif(num[i]<c)num[i]=c,cnt[i]=1;\n\t\telse if(num[i]==c)++cnt[i];\n\t}\n\tif(p^1){\n\t\tint c=1;\n\t\tif(num[p]<c)num[p]=c,cnt[p]=1;\n\t\telse if(num[p]==c)++cnt[p];\n\t}\n\treturn 1;\n}\n\nbool check(int x){\n\tfor(int i=2;i<=sqrt(x);++i){\n\t\tif(x%i)continue;\n\t\tint c=0;\n\t\twhile(x%i==0)x/=i,++c;\n\t\tif(c==num[i]&&cnt[i]==1)return 0;\n\t}\n\tif(x^1&&num[x]==1&&cnt[x]==1)return 0;\n\treturn 1;\n}\n\nint main(){\n\t//fruitea\n\tn=read();\n\tREP(i,1,n)p[i]=read();\n\tsort(p+1,p+n+1,[&](int a,int b){return a>b;});\n\tREP(i,1,n)a[i]=p[i]-insert(p[i]);\n\tint ans=1;\n\tREP(i,2,M-1)ans=1ll*ans*power(i,num[i])%mod;\n\tREP(i,1,n)if(check(a[i])){ans=(ans+1)%mod;break;}\n\tprintf(\"%d\\n\",ans);\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["number theory"], "code_uid": "2ebe9a7128c31d85a7814c5c1abe1072", "src_uid": "816a82bee65cf79ba8e4d61babcd0301", "difficulty": 2900.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<iostream>\n#define rep(i,l,r) for (int i=(l); i<=(r); i++)\ntypedef long long ll;\nusing namespace std;\n\nconst int N=510,mod=1e9+7;\nint n,m,a[N],b[N],c[N],z[N],A[N],B[N];\nll K;\n\nvoid inc(int &x,int y){ x=x+y>=mod ? x+y-mod : x+y;}\nvoid dec(int &x,int y){ x=x-y<0 ? x-y+mod : x-y;}\n\nvoid mult(int u[],int v[]){\n\tmemset(z,0,sizeof(z));\n\trep(i,0,249) rep(j,0,249) z[i+j]=(z[i+j]+1LL*u[i]*v[j])%mod;\n\tfor(int i=498; i>=250; i--)\n\t\trep(j,1,m) inc(z[i-b[j]],z[i]);\n\trep(i,0,249) u[i]=z[i];\n}\n\nvoid ksm(int c[],ll n){\n\tmemset(A,0,sizeof(A));\n\tA[0]=1;\n\twhile(n){\n\t\tif(n&1) mult(A,c);\n\t\tn>>=1,mult(c,c);\n\t}\n}\n\nint main(){\n\tcin>>n>>m>>K;\n\trep(i,1,n) scanf(\"%d\",&a[i]);\n\trep(i,1,m) scanf(\"%d\",&b[i]);\n\trep(i,1,n){\n\t\tmemset(c,0,sizeof(c));\n\t\tc[1]=1; ksm(c,a[i]);\n\t\trep(j,0,249) inc(B[j],A[j]);\n\t}\n\tksm(B,K);\n\trep(i,0,249) B[i]=A[i];\n\tfor(int i=249; i>0; i--) rep(j,1,m) if(i>=b[j]) inc(B[i-b[j]],B[i]);\n\tcout<<B[0]<<endl;\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["math", "matrices", "combinatorics"], "code_uid": "d545e39ebbd872e980d74b9ae55d30ae", "src_uid": "c3a4c109080f49b88be5fb13157d1af0", "difficulty": 3300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C++11", "source_code": "//CLOCKS_PER_SEC\nusing namespace std;\n#include<bits/stdc++.h>\n#define sqr(x) (x)*(x)\n//#define sort stable_sort\n#define ll long long\n#define mk make_pair\n#define pb push_back\n#define in insert\n#define mtr(x,y,z) mk(mk(x,y),z)\n#define fi first\n#define se second\n#define lch(x) ((x)<<1)\n#define rch(x) (((x)<<1)|1)\n#define all(x) (x).begin(),(x).end()\n#define titose CLOCKS_PER_SEC\n#define fpi(x) freopen(x,\"r\",stdin);\n#define fpo(x) freopen(x,\"w\",stdout);\n#define fprio fpi(\"in.txt\");fpo(\"out.txt\");\n#define fast ios_base::sync_with_stdio(false);\ninline void read(int &x){int v=0,f=1;char c=getchar();while (!isdigit(c)&&c!='-') c=getchar();if (c=='-') f=-1; else v=(c&15);while (isdigit(c=getchar())) v=(v<<1)+(v<<3)+(c&15);x=v*f;}\ninline void read(ll &x){ll v=0ll,f=1ll;char c=getchar();while (!isdigit(c)&&c!='-') c=getchar();if (c=='-') f=-1; else v=(c&15);while (isdigit(c=getchar())) v=(v<<1)+(v<<3)+(c&15);x=v*f;}\ninline void readc(char &x){char c;while (((c=getchar())==' ')||c=='\\n');x=c;}\ninline void writes(string s){puts(s.c_str());}\ninline void writeln(){writes(\"\");}\ninline void writei(int x){if (x<0){putchar('-');x=abs(x);}if (!x) putchar('0');char a[25];int top=0;while (x){a[++top]=(x%10)+'0';x/=10;}while (top){putchar(a[top]);top--;}}\ninline void writell(ll x){if (x<0){putchar('-');x=abs(x);}if (!x) putchar('0');char a[25];int top=0;while (x){a[++top]=(x%10)+'0';x/=10;}while (top){putchar(a[top]);top--;}}\n#define pii pair<int,int>\n#define pll pair<ll,ll>\n#define vi vector<int>\n#define vl vector<ll>\n#define si set<int>\n#define sl set<ll>\n#define mii map<int,int>\n#define mll map<ll,ll>\n#define msi map<string,int>\n#define msl map<string,ll>\n#define piii pair<int,pii >\n#define piipi pair<pii,int>\n#define plll pair<ll,pll >\n#define pllpl pair<pll,ll>\n#define pqi priority_queue<int>\n#define pql priority_queue<ll>\n#define npqi priority_queue<int,vector<int>,greater<int> >\n#define npql priority_queue<ll,vector<ll>,greater<ll> >\n#define forup(i,a,b) for ((i)=(a);(i)<=(b);(i)++)\n#define fordo(i,a,b) for ((i)=(a);(i)>=(b);(i)--)\n#define rep(i,x) forup ((i),1,(x))\n#define repd(i,x) fordo ((i),(x),1)\n#define itr iterator\n#define fe(itcalc,c) for(__typeof((c).begin()) itcalc=(c).begin();itcalc!=(c).end();itcalc++)\n#define NO {cout<<\"NO\";return 0;}\n#define YES {cout<<\"YES\";return 0;}\n#define y0 y000000000000000000000000000\n#define y1 y111111111111111111111111111\n#define j0 j000000000000000000000000000\n#define j1 j111111111111111111111111111\n#define cl0(a) memset((a),(0),(sizeof((a))))\n#define clz(a) memset((a),(0x16),(sizeof((a))))\n#define clf(a) memset((a),(-(0x16)),(sizeof((a))))\n#define inf 0x3bbbbbbb\n#define lnf 0x1bbbbbbbbbbbbbbbll\n#define sqrt divi\n#define p2(i) (1ll<<(i))\n#define readi read\n#define readll read\n/*************************************************/\nint mod=998244353;\nvoid add(int &x,int y)\n{\n\tx+=y;\n\tif(x>=mod) x-=mod;\n}\nint n,m,i,j,msk,cpx,cnx,cpy,cny,bx,by,dp[31][21][21][21][21][2][2],x[15],y[15],px[1<<5],py[1<<5],nx[1<<5],ny[1<<5];\nint main()\n{\n\tread(n);read(m);\n\trep(i,n){\n\t\tread(x[i]);\n\t\tread(y[i]);\n\t}\n\tforup(i,0,(1<<n)-1){\n\t\trep(j,n){\n\t\t\tif((i>>(j-1))&1){\n\t\t\t\t(x[j]>0?px[i]:nx[i])+=abs(x[j]);\n\t\t\t\t(y[j]>0?py[i]:ny[i])+=abs(y[j]);\n\t\t\t}\n\t\t}\n\t}\n\tdp[0][0][0][0][0][0][0]=1;\n\tforup(i,0,29){\n\t\tforup(cpx,0,19)forup(cnx,0,19)forup(cpy,0,19)forup(cny,0,19){\n\t\t\tforup(bx,0,1)forup(by,0,1)if(dp[i][cpx][cnx][cpy][cny][bx][by]){\n\t\t\t\tforup(msk,0,(1<<n)-1){\n\t\t\t\t\tint npx=cpx+px[msk];\n\t\t\t\t\tint npy=cpy+py[msk];\n\t\t\t\t\tint nnx=cnx+nx[msk];\n\t\t\t\t\tint nny=cny+ny[msk];\n\t\t\t\t\tif((npx&1)!=(nnx&1)) continue;\n\t\t\t\t\tif((npy&1)!=(nny&1)) continue;\n\t\t\t\t\tint cx=(npx&1),cy=(npy&1);\n\t\t\t\t\tint mx=((m>>i)&1),my=mx;\n\t\t\t\t\tadd(dp[i+1][npx>>1][nnx>>1][npy>>1][nny>>1][(cx==mx)?bx:(cx>mx)][(cy==my)?by:(cy>my)],dp[i][cpx][cnx][cpy][cny][bx][by]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<(dp[30][0][0][0][0][0][0]+mod-1)%mod;\n\treturn 0;\n}", "lang_cluster": "C++", "tags": ["dp"], "code_uid": "f9b8768433486cc4a6e151f2c35329dc", "src_uid": "fba104bc43111a6f2692216a4edea2bc", "difficulty": 3500.0, "exec_outcome": "PASSED"}
{"lang": "MS C++", "source_code": "#pragma comment(linker, \"/STACK:102400000,102400000\")\n#include <functional>\n#include <algorithm>\n#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <iomanip>\n#include <bitset>\n#include <string>\n#include <vector>\n#include <ctime>\n#include <queue>\n#include <cmath>\n#include <set>\n#define CLR(a,v)        memset(a,v,sizeof(a))\n#define ReadFile(file)  freopen(file,\"r\",stdin)  \n#define WriteFile(file) freopen(file,\"w\",stdout)\nusing namespace std;\ntypedef long long       ll;\ntypedef pair<int,int>   pii;\ntypedef unsigned int    uint;\ntypedef unsigned long long    ull;\n\nconst double eps = 1e-6;\nconst double PI  = acos(-1.0);\nconst double EPS = eps;\nconst double pi  = PI;\nconst int N = 1e2+10;\n\nstruct Point{\n\tdouble x,y;\n\tPoint(){}\n\tPoint(const Point& Val){x=Val.x;y=Val.y;}\n\tPoint(double x,double y):x(x),y(y){}\n\tvoid set(double x,double y){\n\t\tthis->x = x;this->y = y;\n\t}\n\tvoid read(){\n\t\tscanf(\"%lf%lf\",&x,&y);\n\t}\n\tvoid print(char end[]){\n\t\tif(end==NULL) end[0]='\\0';\n\t\tprintf(\"%.6f %.6f%s\",x,y,end);\n\t}\n\tPoint rot90(){\n\t\treturn Point(-y,x);\n\t}\n\tPoint operator + (const Point& Val)const{\n\t\treturn Point(x+Val.x, y+Val.y);\n\t}\n\tPoint operator - (const Point& Val)const{\n\t\treturn Point(x-Val.x, y-Val.y);\n\t}\n\tPoint operator * (double Val)const{\n\t\treturn Point(x*Val, y*Val);\n\t}\n\tPoint operator / (double Val)const{\n\t\treturn (*this) * (1.0/Val);\n\t}\n};\ntypedef Point Vec;\nistream& operator >> (istream &io, Point& p){\n\tio >> p.x >> p.y;\n\treturn io;\n}\nostream& operator << (ostream &io, Point& p){\n\tio << \"(\" << (fabs(p.x-0)<eps?0:p.x) << \",\" << (fabs(p.y-0)<eps?0:p.y) << \")\" ;\n\treturn io;\n}\n\n//--------向量运算---------\nVec PtoV(Point a,Point b){ \n\t// 两点 所示 向量\n\treturn Vec(b.x - a.x , b.y - a.y );\n}\ndouble dMult(Vec a,Vec b){\n\t// 点乘\n\treturn (a.x*b.x) + (a.y*b.y) ;\n}\ndouble xMult(Vec a,Vec b){\n\t// 叉积，有向面积|a||b|形成的平行四边形\n\treturn a.x*b.y-a.y*b.x;\n}\ndouble VecMod(Vec a){\n\t// 模\n\treturn sqrt(dMult(a,a));\n}\ndouble VecMod2(Vec a){\n\t// 模平方\n\treturn dMult(a,a);\n}\ndouble Corner2V(Vec a,Vec b){\n\t//两向量夹角 返回弧度 debuged\n\treturn fabs( acos( dMult(a,b)/VecMod(a)/VecMod(b) ) );\n}\nVec VecUnit(Vec a){\n\t// a的单位向量\n\treturn a / VecMod(a);\n}\nVec VRotate(Vec v,double alph){\n\t// 获得v向量的逆时针旋转alph角度的向量\n\tdouble sa = sin(alph),ca = cos(alph);\n\treturn Vec(v.x*ca - v.y*sa , v.x*sa + v.y*ca);\n}\n   Point PRotate(Point p,Point o,double alph){\n\t// wait for debug...\n\treturn Point(o+VRotate(PtoV(o,p),alph));\n}\nVec GetVV(Vec v){\n\t// 获得v向量的垂直向量 wait for test ...\n\treturn VRotate(v,pi/2);\n}\nPoint ShadowPOnLine(Point p,Point a,Point b){\n\t// p在直线|ab|上的垂足\n\tVec ab = PtoV(a,b) , ap = PtoV(a,p);\n\tVec alph = VecUnit(ab) * dMult(ab,ap) / VecMod(ab);\n\treturn a + alph;\n}\nvector<Point> LineCrossCircle(Point a,Point b,Point o,double r){\n\t// 直线与圆的交点\n\tvector<Point> ret;\n\tPoint t = ShadowPOnLine(o,a,b); // o到直线|ab|的垂足\n\tVec ot = PtoV(o,t);\n\tif(VecMod(ot)-r>eps)return ret; // 没有交点\n\tif(fabs(VecMod(ot)-r)<eps){ // 如果相切\n\t\tret.push_back(t);\n\t\treturn ret;\n\t}\n\tdouble lr = sqrt(r*r-VecMod2(ot));\n\tVec ta = t + VecUnit(PtoV(t,a))*lr , tb = t + VecUnit(PtoV(t,b))*lr;\n\tret.push_back(ta);\n\tret.push_back(tb);\n\treturn ret;\t\n}\n\nvector<Point> PointTangentCircle(Point p,Point o,double r){\n\t// 圆外一点作两个切线 返回切点\n\tdouble x2 = VecMod2(p-o);\n\tdouble d2 = x2 - r*r;\n\tvector<Point> ret;\n\tif(d2 < -eps)return ret; // 点在圆内\n\tif(r <= eps){ // 圆退化为点\n\t\tret.push_back(o);\n\t\tret.push_back(o);\n\t\treturn ret;\n\t}\n\td2 = max(d2,0.);\n\tPoint q1 = o + (p-o) * (r*r/x2);\n\tPoint q2 = (p-o).rot90() * (-r*sqrt(d2) / x2);\n\tret.push_back(q1 - q2);\n\tret.push_back(q1 + q2);\n\treturn ret;\n\t//double x2 = (p - c).abs2(); // x * x + y * y\n\t//double d2 = x2 - r * r;\n\t//vector<Point> ret;\n\t//if (d2 < -EPS)\n\t//\treturn ret;\n\t//if (r <= EPS) {\n\t//\tret.push_back(c);\n\t//\tret.push_back(c);\n\t//\treturn ret;\n\t//}\n\t//d2 = max(d2, 0.);\n\t//Point q1 = c + (p - c) * (r * r / x2);\n\t//Point q2 = (p - c).rot90() * (-r * sqrt(d2) / x2);\n\t//ret.push_back(q1 - q2);\n\t//ret.push_back(q1 + q2);\n\t//return ret;\n\n\t//vector<Point> ret;\n\t//Vec po = PtoV(p,o);\n\t//if(VecMod(po)-r < eps) return ret;\n\t//if(fabs(VecMod(po)-r) < eps){\n\t//\tret.push_back(p);\n\t//\treturn ret;\n\t//}\n\t//double alph = asin(r/VecMod(po));\n\t//cout << \"alpha===>\" << alph*180/pi << \"  r=>\" << r << \"  |po|=>\" << VecMod(po) << endl;\n\t//cout << \"circle o==>\" << o << \" p===>\" << p << endl;\n\t//cout << \"|p,T2|==>\" << VRotate(VecUnit(po),alph) * sqrt(VecMod2(po)+r*r) << endl;\n\t//cout << \"单位向量|p.T2|\" << VRotate(VecUnit(po),alph) << \"  长度|pT2|\" << sqrt(VecMod2(po)+r*r) << endl;\n\t//\n\t//ret.push_back(p + VRotate(VecUnit(po),alph) * sqrt(VecMod2(po)+r*r));\n\t//ret.push_back(p + VRotate(VecUnit(po),2*pi-alph) * sqrt(VecMod2(po)+r*r));\n\t//return ret;\n\n\t//Vec pt = VecUnit(VRotate(po,asin(r/VecMod(po))))*sqrt(VecMod2(po)+r*r);\n\t//ret.push_back(p+pt);\n\t//Point tot = ShadowPOnLine(p+pt,p,o);\n\t//ret.push_back(tot + PtoV(tot,o));\n\t//return ret;\n}\nbool POnSeg(Point p, Point a, Point b){\n\t// 点在线段上\n\tif(fabs(xMult(PtoV(a,b), PtoV(a,p))) > eps)return false;\n\tif(min(a.x,b.x) > p.x || p.x > max(a.x,b.x))return false;\n\tif(min(a.y,b.y) > p.y || p.y > max(a.y,b.y))return false;\n\treturn true;\n}\n\n\ndouble PDisLine(Point p,Point a, Point b){\n\t// p点到直线|ab| 的距离\n\treturn VecMod(ShadowPOnLine(p,a,b) - p);\n}\n//--------向量运算---------End\n\n\nvoid debug_function(){\n\tPoint h(25,45),j(30,30),i(15,35),k(5,45);\n\t//cout.setf(ios::fixed); cout.setf(ios::showpoint); cout.precision(9); \n\tPoint aaa(0,0), bbb(0,5), ppp(0,-1);\n\tcout << \"p in |ab| ? => \" << POnSeg(ppp,aaa,bbb) << endl;\n\n\tcout << \"π:\" << pi << \"\\t\\tπ checked\" << endl;\n\tcout << i << h << j << \"\\tio checked\" << endl;\n\tcout << Corner2V(PtoV(i,h),PtoV(i,j))*(180/pi) << \"\\t\\t\\tCorner2V() checked\" << endl;\n\ti.set(0,0);k.set(-10,4);\n\tcout << VRotate(PtoV(i,k),pi/2) << \" \" << PtoV(i,k) << PtoV(i,Point(-4,-10)) << \"VRotate() checked\" << endl;\n\tPoint p(10,2) , a(-6,6) , b(10,-10);\n\tcout << ShadowPOnLine(p,a,b) << \"\\t\\t\\tShadowPOnLine() checked\" << endl;\n\t\n\tdouble r = 6.64;\n\tvector<Point> CP = LineCrossCircle(a,b,Point(0,0),r);\n\tcout << \"cross point:\" << CP.size() << \" \";\n\tfor(int i = 0 ; i < CP.size() ; i++) cout << CP[i] << \" \" ;\n\tcout << \"\\tchecked\" << endl;\n\n\tp.set(10,2); r = 6.64;\n\tvector<Point> CT = PointTangentCircle(p,Point(0,0),r);\n\tcout << \"tangent point:\" << CT.size() << \" \";\n\tfor(int i = 0 ; i < CT.size() ; i++) cout << CT[i] << \" \" ;\n\tcout << endl;\n\n\n\texit(0);\n}\n\nPoint p,s;\ndouble vp,vs,r , sita;\nbool check(double t){\n\tdouble len_or = VecMod(p);\n\tPoint e(len_or * cos(sita+t*vp/len_or) , len_or * sin(sita+t*vp/len_or)); // 终点\n\t//printf(\"t:%lf (%lf,%lf) \\t\\t\",t,e.x,e.y);\n\tvector<Point> ccp;\n\tccp = LineCrossCircle(s,e, Point(0,0), r);\n\tif(ccp.size() != 2 || (!POnSeg(ccp[0], s, e) && !POnSeg(ccp[1], s, e)) ){\n\t\t//cout << \"| |len = \" << VecMod(e-s) << endl;\n\t\treturn vs*t > VecMod(e-s); // 如果没有交点路径就是直线\t\n\t}\n\tvector<Point> ttp1 = PointTangentCircle(s,Point(0,0),r);\n\tif( PDisLine(ttp1[0],s,e) > PDisLine(ttp1[1],s,e) ) \n\t\tswap(ttp1[0],ttp1[1]);\n\tdouble l1 = VecMod(PtoV(s,ttp1[0]));\n\t\n\tvector<Point> ttp2 = PointTangentCircle(e,Point(0,0),r);\n\tif( PDisLine(ttp2[0],s,e) > PDisLine(ttp2[1],s,e) ) \n\t\tswap(ttp2[0],ttp2[1]);\n\tdouble l2 = VecMod(PtoV(e,ttp2[0]));\n\n\tdouble alph = Corner2V(PtoV(Point(0,0),ttp1[0]) , PtoV(Point(0,0),ttp2[0]));\n\t//cout << \"tangent:\" <<  ttp1[0] << \" \" << ttp2[0] << endl;\n\t//cout << \"|-|alph = \" << alph << \", \" << VecMod( PtoV(s,ttp1[0]) )   << \",\" << VecMod( PtoV(e,ttp2[0]) ) << endl;\n\treturn VecMod( PtoV(s,ttp1[0]) )\n\t\t+  VecMod( PtoV(e,ttp2[0]) )\n\t\t+ alph * r < vs*t;\n}\nint main(){\n\tios::sync_with_stdio(false);\n\t//debug_function();\n\t//freopen(\"d:\\\\Program Files (x86)\\\\Microsoft Visual Studio 9.0\\\\por\\\\20130820\\\\20130820\\\\in.txt\",\"r\",stdin);\n//\tfreopen(\"out.txt\",\"w\",stdout);\n\t//cout.setf(ios::fixed); cout.setf(ios::showpoint); cout.precision(2); \n\t//cout << fixed << setprecision(2) << (*it).first << endl;\n\twhile(cin >> p >> vp >> s >> vs >> r){\n\t\t//cout << p << vp << s << vs << \" \" << r << endl;\n\t\t//check(9.584544103);exit(0);\n\t\tsita = acos(p.x/VecMod(p));\n\t\tif(p.y<0)sita = -sita; // 跨过了180度\n\t\t\n\t\tdouble  left = 0, right = 1e+10;\n\t\twhile( fabs(left-right) > 1e-12 ){\n\t\t\tdouble mid = (left+right)*0.5;\n \t\t\tif(check(mid))\n\t\t\t\tright = mid;\n\t\t\telse \n\t\t\t\tleft = mid;\n\t\t}\n\t\tcout << fixed << setprecision(9) << left << endl;\n\t}\n\treturn 0;\n}\n", "lang_cluster": "C++", "tags": ["geometry", "binary search"], "code_uid": "7a844bea1b7ef8be568d42b3ec928a80", "src_uid": "e8471556906e5fa3a701842570fa4ee2", "difficulty": 2400.0, "exec_outcome": "PASSED"}