{"lang": "GNU C", "source_code": "#include <stdio.h>\nint main() {\n    int a, b, c, d, x, y, i, j;\n    scanf(\"%d%d%d%d\", &a,&b,&c,&d);\n    int max = a;\n    if(c<max)\n        max = c;\n    if(d<max)\n        max = d;\n\n    x = 256*max;\n\n    a = a - max;\n    c = c - max;\n    d = d - max;\n\n    max = a;\n    if(b<max)\n        max = b;\n\n    x = x + 32*max;\n\n    printf(\"%d\\n\", x);\n}\n", "lang_cluster": "C", "tags": ["math", "greedy", "implementation", "brute force"], "code_uid": "0f09c2251d96df54c1657cdeffa02f6c", "src_uid": "082b31cc156a7ba1e0a982f07ecc207e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\nint main()\n{\n    char c[4][4];\n    int i,j;\n    for(i=0; i<3; i++)\n    {\n        for(j=0; j<=3; j++)\n        {\n            scanf(\"%c\",&c[i][j]);\n        }\n    }\n    if(c[0][0]==c[2][2] && c[0][1]==c[2][1] && c[0][2]==c[2][0] && c[1][0]==c[1][2] && c[1][1]==c[1][1] && c[1][2]==c[1][0])\n    {\n        printf(\"YES\\n\");\n    }\n    else\n        printf(\"NO\\n\");\n    return 0;\n}\n", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "7b28e8a79cb8aafc6c5d634821d65632", "src_uid": "6a5fe5fac8a4e3993dc3423180cdd6a9", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int n,k,b[105],flag=0;\n    char s[105];\n    memset(b,0,sizeof(b));\n    scanf(\"%d%d%s\",&n,&k,s);\n    for(int i=0;i<n;i++)\n    {\n        b[s[i]-'0']++;\n    }\n        for(int i=40;i<=100;i++)\n            if(b[i]>k)\n                flag=1;\n        if(flag==1) printf(\"NO\\n\");\n        else printf(\"YES\\n\");\n\n    return 0;\n}\n", "lang_cluster": "C", "tags": ["brute force", "implementation"], "code_uid": "1738902b1b63f39f8c259433c6377a27", "src_uid": "ceb3807aaffef60bcdbcc9a17a1391be", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include <stdio.h>\n#include <stdlib.h>\n\nint max(int a, int b)\n{\n    return a>b ? a : b;\n}\n\nint a[100], count;\n\nint main()\n{\n    int n;\n    scanf(\"%d\", &n);\n\n    int i, j, temp;\n\n    for (i=0; i<n; i++)\n    {\n        scanf(\"%d\", &a[i]);\n        count += a[i];\n    }\n\n    ///printf(\"count : %d\\n\", count);\n\n    temp = a[0];\n\n    if (n>1)\n    {\n        for (i=0; i<n; i++)\n        {\n            temp = max(temp, a[i]);\n        }\n    }\n\n    ///printf(\"temp : %d\\n\", temp);\n\n    int k;\n\n    int ans;\n\n    for (i=0; ; i++)\n    {\n        k = temp+i;\n        if (((n*k)-count)>count)\n        {\n            ans = k;\n            break;\n        }\n    }\n\n    printf(\"%d\", ans);\n\n    return 0;\n}\n", "lang_cluster": "C", "tags": ["math", "implementation"], "code_uid": "6ddefdd202b3123509b11cc371f6b643", "src_uid": "d215b3541d6d728ad01b166aae64faa2", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "/* P11- A DIFFERENCE ROW\n\t Mauricio Tulio\n      Jose Garcete  */\n\n#include<stdio.h>\n#include <stdlib.h>\n\n\nint funcion (const void * a, const void * b);\t//prototipo de la funcion\n\nint main()\n{\n\t\n    int v[1000],i,n,aux;\n    scanf(\"%d\",&n);\n    for(i=0;i<n;i++)\n        scanf(\"%d\",&v[i]);\n        qsort(v,n,sizeof(int),&funcion); // a=elemento inicial   n=tamano del arreglo\tsizeof(int)= tamano de los datos de ese arreglo   funcion donde se compara\n  \t   \n\t    aux=v[n-1];\t\t//cambio de posiciones variables una vez que se haya ordenado, segun pide el problema\n        v[n-1]=v[0];\n        v[0]=aux;\n\n    for(i=0;i<n;i++)\n        printf(\"%d \",v[i]);\n        return 0;\n}\nint funcion (const void * a, const void * b)\n{\n  \n   return ( *(int*)a - *(int*)b );   //retorna la diferencia de los valores de los punteros tipo entero a y b\n    \n}\n", "lang_cluster": "C", "tags": ["sortings", "constructive algorithms", "implementation"], "code_uid": "7a688028ffd1845d4b54399c204c42c6", "src_uid": "4408eba2c5c0693e6b70bdcbe2dda2f4", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n\nint main()\n{\n    int n;\n    while (scanf(\"%d\",&n) != EOF)\n    {\n\n        if(n % 2 != 0)\n            printf(\"Ehab\\n\");\n        else\n            printf(\"Mahmoud\\n\");\n    }\n    return 0;\n}", "lang_cluster": "C", "tags": ["math", "games"], "code_uid": "df428b663dcdbf7d103b64d6ed675250", "src_uid": "5e74750f44142624e6da41d4b35beb9a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\nint main()\n{\n    char str[100];\n    int i, count = 0, n;\n    scanf(\"%d\", &n);\n    scanf(\"%s\", str);\n    for(i = 0; i < n; i++)\n    {\n        if(str[i] == 'x' && str[i+1] == 'x' && str[i+2] == 'x')\n            count++;\n    }\n    printf(\"%d\", count);\n}\n", "lang_cluster": "C", "tags": ["greedy", "strings"], "code_uid": "9a271369b5ff091a0774831dd472b695", "src_uid": "8de14db41d0acee116bd5d8079cb2b02", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n\nint main()\n{\n    int total;\n\n    scanf(\"%d\",&total);\n\n    if( total<=10 || total>=22) // 10+11 is max\n        printf(\"0\\n\");\n    else\n    {\n        if( total == 20)\n        {\n                printf(\"15\\n\");\n        }\n        else\n        {\n            printf(\"4\\n\");\n        }\n    }\n    return 0;\n\n}\n/****** PCCA -Fri Oct 07 12:57:29 GMT 2011 *******/", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "28e2e30aa9e4cc317267ae61734ecb94", "src_uid": "5802f52caff6015f21b80872274ab16c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int l1,l2,c=0,j,k;\n    char s1[101],s2[101];\n    scanf(\"%s %s\",s1,s2);\n    l1=strlen(s1);\n    l2=strlen(s2);\n    for(j=0,k=l2-1; j<l1,k>=0; j++,k--) {\n        if(s1[j]==s2[k]) {\n            c++;\n        }\n    }\n    if(l1==c) {\n        printf(\"YES\\n\");\n    }\n    else {\n        printf(\"NO\\n\");\n    }\n}", "lang_cluster": "C", "tags": ["strings", "implementation"], "code_uid": "a819236c3acc81a26c9f68745b4b86fe", "src_uid": "35a4be326690b58bf9add547fb63a5a5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\nmain()\n{\n\tint a,b,c,i,y;\n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tfor(i=0;i<=c/a;i++)\n\t{\n\t\ty=(c-a*i);\n\t\tif(y%b==0)\n\t\t{\n\t\t\tprintf(\"Yes\");\n\t\t\texit(0);\n\t\t}\n\t\t\n\t}\t\n\tprintf(\"No\");\n}", "lang_cluster": "C", "tags": ["brute force", "math", "number theory"], "code_uid": "f8e58aff2a2fad48c1705a3cc9ac56d6", "src_uid": "e66ecb0021a34042885442b336f3d911", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nint main()\n{\n\tchar s[101];\n\tscanf(\"%s\",s);\n\tint len = strlen(s);\n\tint i;\n\tint flag = 0;\n\tchar *ans;\n\tans = \"CODEFORCES\";\n\tfor(i=0;i<len;i++)\n\t{\n\t\tchar val[10];\n\t\tint j;\n\t\tint k;\n\t\tfor(j=0;j<i;j++)\n\t\t\tval[j] = s[j];\n\t\tk = i;\n\t\tfor(j=len - 10 +i;j<len;j++){\n\t\t\tval[k] = s[j];\n\t\t\tk++;\n\t\t}\n\t\tfor(j=0;j<10;j++){\n\t\t\tif(val[j]== ans[j])\n\t\t\t\tflag = 1;\n\t\t\telse{\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\tbreak;\n\t}\n\tif(flag == 0)\n\t\tprintf(\"NO\\n\");\n\telse\n\t\tprintf(\"YES\\n\");\n\treturn 0;\n}", "lang_cluster": "C", "tags": ["brute force", "implementation"], "code_uid": "f1213c5712d31eb2001e8ec9a90971e0", "src_uid": "bda4b15827c94b526643dfefc4bc36e7", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n\nint main(void) {\n\tint n, d;\n\tscanf(\"%d%d\", &n, &d);\n\n\tint arr[n];\n\tint maxn = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &arr[i]);\n\t\tmaxn = arr[i] > maxn ? arr[i] : maxn;\n\t}\n\n\tint maxgrp = 1;\n\tfor (int i = 0; i < n; i++) {\n\t\tint cur = 0;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tif (arr[j] - arr[i] <= d && arr[j]-arr[i] >= 0) {\n\t\t\t\tcur++;\n\t\t\t}\n\t\t}\n\t\tmaxgrp = cur > maxgrp ? cur : maxgrp;\n\t}\n\n\tprintf(\"%d\\n\", n-maxgrp);\n}\n", "lang_cluster": "C", "tags": ["brute force", "sortings", "greedy"], "code_uid": "c749bfe99a501998b7e280ff63be7a4f", "src_uid": "6bcb324c072f796f4d50bafea5f624b2", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\n\nint isLeap(year)\n{\n\tif(year%4==0 && year%100!=0 || year%400==0)\n\t\treturn 29;\n\telse\n\t\treturn 28;\n}\n\nint no_of_days_remaining(int mon,int year)\n{\n\tint days=0;\n\tswitch(mon)\n\t\t{\n\t\t\tcase 1:days+=31;\n\t\t\tcase 2:days+=isLeap(year);\n\t\t\tcase 3:days+=31;\n\t\t\tcase 4:days+=30;\n\t\t\tcase 5:days+=31;\n\t\t\tcase 6:days+=30;\n\t\t\tcase 7:days+=31;\n\t\t\tcase 8:days+=31;\n\t\t\tcase 9:days+=30;\n\t\t\tcase 10:days+=31;\n\t\t\tcase 11:days+=30;\n\t\t\tcase 12:days+=31;\n\t\t}\n\treturn days;\n}\n\nint no_of_days_passed(int mon, int year)\n\t{\n\t\tint days=0;\n\t\tswitch(mon)\n\t\t\t{\n\t\t\tcase 12:days+=31;\n\t\t\tcase 11:days+=30;\n\t\t\tcase 10:days+=31;\n\t\t\tcase 9:days+=30;\n\t\t\tcase 8:days+=31;\n\t\t\tcase 7:days+=31;\n\t\t\tcase 6:days+=30;\n\t\t\tcase 5:days+=31;\n\t\t\tcase 4:days+=30;\n\t\t\tcase 3:days+=31;\n\t\t\tcase 2:days+=isLeap(year);\n\t\t\tcase 1:days+=31;\n\t\t\t}\n\t\treturn days;\n\t}\n\nint no_of_days(int year)\n{\n\tint k=31*7+30*4+isLeap(year);\n\treturn k;\n}\n\nint main()\n{\n\tint mm1,dd1,yy1,mm2,dd2,yy2,i,j,k,nodA,nodC,nodB=0,nod,start,end,m1,d1,y1,m2,d2,y2;\n\tscanf(\"%d:%d:%d\",&yy1,&mm1,&dd1);\n\tscanf(\"%d:%d:%d\",&yy2,&mm2,&dd2);\n\tif(yy2>yy1)\n\t\t{\n\t\t\tm1=mm1;\n\t\t\ty1=yy1;\n\t\t\td1=dd1;\n\t\t\tm2=mm2;\n\t\t\ty2=yy2;\n\t\t\td2=dd2;\n\t\t}\n\telse\n\t\t{\n\t\t\tm1=mm2;\n\t\t\ty1=yy2;\n\t\t\td1=dd2;\n\t\t\tm2=mm1;\n\t\t\ty2=yy1;\n\t\t\td2=dd1;\n\t\t}\n\t\tnodA=no_of_days_remaining(m1,y1);\n\t\tnodC=no_of_days_passed(m2-1,y2);\n\t\tif(yy2>yy1)\n\t\t{\n\t\t\tstart=yy1;\n\t\t\tend=yy2;\n\t\t}\n\telse\n\t\t{\n\t\t\tstart=yy2;\n\t\t\tend=yy1;\n\t\t}\n\tfor(i=y1+1;i<=y2-1;i++)\n\t{\n\t\tnodB+=no_of_days(i);\n\t}\n\tnod=(nodA-d1+1) + (nodC+d2) + nodB-1;\n\tif(yy1==yy2)\n\t\t{\n\t\t\tif(mm2>mm1)\n\t\t\t   //nod=-1*(365-nod+1)+1;\t\n\t\t\t   nod=(no_of_days_remaining(mm1,yy1)-dd1+1)-(no_of_days_remaining(mm2,yy2)-dd2+1);\n\t\t\telse if(mm2<mm1)\n\t\t\t\t//nod=365-nod+1;\n\t\t\t\tnod=(no_of_days_remaining(mm2,yy2)-dd2+1)-(no_of_days_remaining(mm1,yy1)-dd1+1);\n\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(dd1>dd2)\n\t\t\t\t\t\tnod=dd1-dd2;\n\t\t\t\t\telse\n\t\t\t\t\t\tnod=dd2-dd1;\n\t\t\t\t}\n\t\t}\n\tprintf(\"%d\",nod);\n}", "lang_cluster": "C", "tags": ["brute force", "implementation"], "code_uid": "39722c47fc900ce934cf6438d77c071b", "src_uid": "bdf99d78dc291758fa09ec133fff1e9c", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\nmain()\n{\n    int n,p,r,r2,t;\n    scanf(\"%d\",&n);\n    if (n%2==0)\n    {\n        r=n/2*n/2;\n        r2=n/2*n/2;\n    }\n    else\n    {\n        r=((n+1)/2)*((n+1)/2);\n        r2=((n-1)/2)*((n-1)/2);\n    }\n\n    t=r+r2;\n    if (t%2==0)\n    {\n        printf(\"2\");\n    }\n    else\n    {\n        printf(\"1\");\n    }\n\n}\n", "lang_cluster": "C", "tags": ["math", "games"], "code_uid": "787f9cf314e2417907ed00b9a47e4caf", "src_uid": "816ec4cd9736f3113333ef05405b8e81", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\n#define m 1000000007\n\nlong int power(long int a,long int b)\n{\n    long int ans=1;\n    if(b==0)\n        return 1;\n    while(b>0) {\n        if (b % 2 != 0)\n            ans= ans * a;\n        a = a * a;\n        b = b / 2;\n    }\n    return ans;\n}\n\nint main()\n{\n    long int n,i=0,index=0;\n    scanf(\"%ld\",&n);\n    while(n>0)\n    {\n        int rem=n%10;\n        if(rem==4)\n            index+=power(2,i);\n        else\n            index+=power(2,i+1);\n        n=n/10;\n        i++;\n    }\n    printf(\"%ld\\n\",index);\n}", "lang_cluster": "C", "tags": ["brute force", "implementation", "combinatorics", "bitmasks"], "code_uid": "51111ec64c1360592d2ce290b6c77eaa", "src_uid": "6a10bfe8b3da9c11167e136b3c6fb2a3", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n    long long int X, f;\n    scanf(\"%lld\",&X);\n    if(X%2 == 0)\n    {\n        f = X/2;\n        printf(\"%lld\\n\",f);\n    }\n    else\n    { f = (- X - 1)/2 ;\n        printf(\"%lld\\n\",f);}\n    return 0;\n}\n// 1461347183703", "lang_cluster": "C", "tags": ["math", "implementation"], "code_uid": "d1e8edc5d964f349d3e2a8e89b12d380", "src_uid": "689e7876048ee4eb7479e838c981f068", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\n#include <math.h>\nint main()\n{\n\tint n,i,j,s,t,f,w,mini,min,maxi,max;\n\tscanf(\"%d\",&n);\n\tint ara[10][4];\n\tfor (i=0;i<n;i++){\n\t\tfor (j=0;j<4;j++){\n\t\t\tscanf(\"%d\",&ara[i][j]);\n\t\t}\n\t}\n\tf=0;\n\tfor (i=0;i<n;i++){\n\t\ts=abs(ara[i][0]-ara[i][2]);\n\t\tt=abs(ara[i][1]-ara[i][3]);\n\t\tf=f+(s*t);\n\t\t//printf(\"%d\\n\",f);\n\t}\n\tmini=100000;\n\tmin=100000;\n\tmaxi=0;\n\tmax=0;\n\tfor(i=0;i<n;i++){\n\t\tif (ara[i][0]<mini){\n\t\t\tmini=ara[i][0];\n\t\t}\n\t\tif (ara[i][1]<min){\n\t\t\tmin=ara[i][1];\n\t\t}\n\t\tif (ara[i][2]>maxi){\n\t\t\tmaxi=ara[i][2];\n\t\t}\n\t\tif (ara[i][3]>max){\n\t\t\tmax=ara[i][3];\n\t\t}\n\t}\n\t//printf(\"%d\",maxi);\n\tw=(maxi-mini)*(max-min);\n\t//printf(\"%d\",f);\n\tif (f==w && (maxi-mini)==(max-min)){\n\t\tprintf(\"YES\");\n\t}\n\telse{\n\t\tprintf(\"NO\");\n\t}\n\treturn 0;\n}\n", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "9cdfc8f9d1f3ae8a76a5cd096d277763", "src_uid": "f63fc2d97fd88273241fce206cc217f2", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\nint main()\n{\n    char myarray[1000];\n    scanf(\"%s\",&myarray);\n    int i,cnt=0,j,k,l,len=0;\n    len=strlen(myarray);\n    for(i=0; i<len; i++)\n    {\n        if(myarray[i]=='Q')\n        {\n            for(j=i+1; j<len; j++)\n            {\n                if(myarray[j]=='A')\n                {\n                    for(l=j+1; l<len; l++)\n                    {\n                        if(myarray[l]=='Q')\n                        {\n                            cnt++;\n                        }\n                    }\n                }\n            }\n        }\n    }\n    printf(\"%d\",cnt);\n    return 0;\n}", "lang_cluster": "C", "tags": ["brute force", "dp"], "code_uid": "d269e020ed015cd2345122de6f5dc57b", "src_uid": "8aef4947322438664bd8610632fe0947", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\"%d\",&n);\n    int a[110]={0};\n    int i;\n    for(i=1;;i++)\n    {\n        if(n==1) {break;}\n        int yushu,deshu;\n        yushu=n%2;\n        n=n/2;\n        a[i]=yushu;\n        if(n==1) {i++;break;}\n    }\n    printf(\"%d\",i);\n    i--;\n    for(;i>=0;i--)\n        if(a[i]) printf(\" %d\",i);\n    printf(\"\\n\");\n}\n", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "4f02fa2ddd80bf305cd42540824b572d", "src_uid": "757cd804aba01dc4bc108cb0722f68dc", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\ntypedef struct abc\n{\n\tint a;\n\tint b;\n}abc;\n\nabc ar[8];\n\nstatic int compare(const void *i1,const void *i2)\n{\n\t        const abc *p1=(const abc *)i1;\n\t\tconst abc *p2=(const abc *)i2;\n\t\treturn (p1->a-p2->a);\n}\n\n\nint main()\n{\n\tint x,y,z,min,max;\n\t\n\tfor(x=0;x<8;x++)\n\t{\n\t\tscanf(\"%d %d\",&ar[x].a,&ar[x].b);\n\t}\n        qsort(&ar[0],8,sizeof(abc),compare);\n\t\n\tif(ar[0].a != ar[1].a || ar[0].a != ar[2].a)\n\t\tprintf(\"ugly\\n\");\n\telse if(ar[5].a != ar[6].a || ar[5].a != ar[7].a)\n\t\tprintf(\"ugly\\n\");\n\telse if(ar[3].a != ar[4].a)\n\t\tprintf(\"ugly\\n\");\n\telse if(ar[0].a == ar[7].a)\n\t\tprintf(\"ugly\\n\");\n\telse if(ar[0].a == ar[3].a)\n\t\tprintf(\"ugly\\n\");\n\telse\n\t{\n\t\tx=ar[0].b;y=ar[1].b;z=ar[2].b;\n\t\tif(x==y || x==z)\n\t\t\tprintf(\"ugly\\n\");\n\t\telse\n\t\t{\n\t\t\tmin=10000000;max=-1;\n\t\t\tfor(x=5;x<8;x++)\n\t\t\t{\n\t\t\t\tif(ar[x].b<min)\n\t\t\t\t\tmin=ar[x].b;\n\t\t\t\tif(ar[x].b>max)\n\t\t\t\t\tmax=ar[x].b;\n\t\t\t\tfor(y=0;y<=2;y++)\n\t\t\t\t{\n\t\t\t\t\tif(ar[x].b==ar[y].b)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(y==3)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(y==3)\n\t\t\t\tprintf(\"ugly\\n\");\n\t\t\telse\n\t\t\t{\n\t\t\t\tx=ar[5].b;y=ar[6].b;z=ar[7].b;\n\t\t\t\tif(x==y || x==z)\n\t\t\t\t\tprintf(\"ugly\\n\");\n\t\t\t\telse if(!(ar[3].b == min || ar[3].b ==max))\n\t\t\t\t\tprintf(\"ugly\\n\");\n\t\t\t\telse if(!(ar[4].b == min || ar[4].b ==max))\n\t\t\t\t\tprintf(\"ugly\\n\");\n\t\t\t\telse if(ar[3].b == ar[4].b)\n\t\t\t\t\tprintf(\"ugly\\n\");\n\t\t\t\telse\n\t\t\t\t\tprintf(\"respectable\\n\");\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\n", "lang_cluster": "C", "tags": ["sortings"], "code_uid": "b1fd7206391905ad217646c031d67b83", "src_uid": "f3c96123334534056f26b96f90886807", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n#include<string.h>\nchar s[220];\nlong n,len;\nlong check(long a)\n{\n    long i;\n    for(i=1;i<=a-n;i++)\n        if(s[len-i]!=s[len-i-a])\n            return 0;\n    return 1;\n}\nint main()\n{\n    long i,k,j,ans=0,key,max,min,temp=0;\n    scanf(\"%s\",s);\n    len=strlen(s);\n    scanf(\"%ld\",&n);\n\n    if(n>len)\n        min=(len+n)/2;\n    else min=n;\n\n    max=(len+n)/2;\n    for(i=0;i<len;i++)\n        for(j=1;j*2+i<=len;j++)\n            {   key=1;\n                for(k=1;k<=j;k++)\n                    if(s[i+k-1]!=s[i+k+j-1])\n                    key=0;\n                if(key==1)\n                    if(j>temp)\n                        temp=j;\n            }\n\n\n    for(i=max;(i>=min)&&(ans==0);i--)\n        if(check(i)==1)\n            ans=i;\n    if(min>ans)\n        ans=min;\n    if(temp>ans)\n        ans=temp;\n    printf(\"%ld\",2*ans);\n\nreturn 0;\n}\n", "lang_cluster": "C", "tags": ["brute force", "strings", "implementation"], "code_uid": "f49d066df970d313cc66df54d8a4f5e1", "src_uid": "bb65667b65ff069a9c0c9e8fe31da8ab", "difficulty": 1500.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\n#include <limits.h>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\n#define REP(i, n) for((i) = 0; (i) < (n); (i)++)\n#define REP1(i, n) for((i) = 1; (i) <= (n); (i)++)\n\n#define SIZE 1000002\n\nstatic int s[SIZE], p[SIZE], np, min;\n\nstatic void sieve(void)\n{\n  int i, j;\n\n  for (i = 2; i < SIZE; i++) {\n    if (s[i] == 0) {\n      p[np++] = i;\n\n      for (j = 2; i * j < SIZE; j++) {\n        s[i * j] = 1;\n      }\n    }\n  }\n}\n\n#define MAX(x, y) ((x) > (y) ? (x) : (y))\n\nstatic void solve(int x, int l)\n{\n  int i, d, lf = -1, ox = x;\n\n  if (x < min) {\n    min = x;\n  }\n\n  if (l == 0) {\n    return;\n  }\n\n  for (i = 0; p[i] * p[i] <= x; i++) {\n    if (ox % p[i] == 0) {\n      lf = MAX(lf, p[i]);\n      while (ox % p[i] == 0)\n        ox /= p[i];\n    }\n  }\n  if (ox > 1 && ox != x)\n    lf = MAX(lf, ox);\n\n  if (lf == -1) {\n    return;\n  }\n  \n  if (l == 1) {\n    x = x - lf + 1;\n    if(x < min)\n      min = x;\n    return;\n  }\n\n  for (d = x - lf + 1; d < lf * (x / lf); d++) {\n    solve(d, l - 1);\n  }\n}\n\nint main(void)\n{\n  int x2;\n\n  s[0] = s[1] = 1;\n  sieve();\n  min = INT_MAX;\n\n  scanf(\"%d\", &x2);\n  solve(x2, 2);\n  printf(\"%d\", min);\n\n  return 0;\n}\n", "lang_cluster": "C", "tags": ["brute force", "math", "number theory"], "code_uid": "8555eecd49e7f3e6be95a2131a19bc16", "src_uid": "43ff6a223c68551eff793ba170110438", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n\nint main()\n{\n    int x, y;\n    scanf (\"%d %d\", &x, &y);\n    if (x == y) {\n        printf (\"No\\n\");\n        return 0;\n    }\n    else if (x < y) {\n        if (y - x == 1) {\n            printf (\"Yes\\n\");\n            return 0;\n        }\n        else {\n            printf (\"No\\n\");\n            return 0;\n        }\n    }\n    else {\n        if (y == 0 || y == 1) {\n            printf (\"No\\n\");\n            return 0;\n        }\n        y = y - 1;\n        x = x - y;\n        if (x & 1) {\n            printf (\"No\\n\");\n            return 0;\n        }\n        else {\n            printf (\"Yes\\n\");\n            return 0;\n        }\n    }\n    return 0;\n}\n", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "b013cce57e192bfba346c95350eb8297", "src_uid": "1527171297a0b9c5adf356a549f313b9", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include <math.h>\n\nint main()\n{\n    int k,a,b,x,y,m;\n    scanf(\" %d %d %d\",&k,&a,&b);\n\n    if((a<k && b<k) || (a<k && b%k!=0) || (b<k && a%k!=0)){\n        printf(\"-1\\n\");\n    }\n    else{\n        printf(\"%d\\n\",(a/k)+(b/k));\n    }\n\n\n\n    return 0;\n}\n", "lang_cluster": "C", "tags": ["math"], "code_uid": "6a9e34fb6e1ff558a9ba66a99511243b", "src_uid": "6e3b8193d1ca1a1d449dc7a4ad45b8f2", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include <stdio.h>\n#include <stdbool.h>\n\nint main()\n{\n    int board[4][4] = {0};\n    for (int i = 0; i < 4; i++)\n        for (int j = 0; j < 4; j++) {\n            char c;\n            scanf(\"%c \", &c);\n            if (c == 'x') board[i][j] = 1;\n            else if (c == 'o') board[i][j] = -3;\n            else board[i][j] = 0;\n        }\n    bool can_win = false;\n    for (int i = 0; !can_win && i < 4; i++) {\n        for (int j = 0; j < 4; j++) {\n            if (board[i][j] >= 0) { /* 'x' or '.' */\n                int sum_hor = 0, sum_dia_up = 0, sum_dia_down = 0, sum_ver = 0;\n                if (j < 2)\n                    sum_hor = board[i][j] + board[i][j+1] + board[i][j+2];\n                if (i < 2)\n                    sum_ver = board[i][j] + board[i+1][j] + board[i+2][j];\n                if (i < 2 && j < 2)\n                    sum_dia_up = board[i][j] + board[i+1][j+1] + board[i+2][j+2];\n                if (i >= 2 && j < 2)\n                    sum_dia_down = board[i][j] + board[i-1][j+1] + board[i-2][j+2];\n\n                if (sum_hor == 2 || sum_dia_up == 2 || sum_dia_down == 2 || sum_ver == 2) {\n                    can_win = true;\n                    break;\n                }\n            }\n        }\n    }\n    if (can_win)\n        puts(\"YES\");\n    else\n        puts(\"NO\");\n    return 0;\n}\n", "lang_cluster": "C", "tags": ["brute force", "implementation"], "code_uid": "764da4e62b638467806af12b92ac4f97", "src_uid": "ca4a77fe9718b8bd0b3cc3d956e22917", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\nint main()\n{\n\tchar s[10],s1[10];\n\tint a,b,sum=0;\n\tscanf(\"%s%s\",s,s1);\n\tif(s[0]=='m')\n\t\ta=1;\n\telse if(s[0]=='t' && s[1]=='u')\n\t\ta=2;\n\telse if(s[0]=='w')\n\t\ta=3;\n\telse if(s[0]=='t' && s[1]=='h')\n\t\ta=4;\n\telse if(s[0]=='f')\n\t\ta=5;\n\telse if(s[0]=='s' && s[1]=='a')\n\t\ta=6;\n\telse if(s[0]=='s' && s[1]=='u')\n\t\ta=7;\n\n\tif(s1[0]=='m')\n\t\tb=1;\n\telse if(s1[0]=='t' && s1[1]=='u')\n\t\tb=2;\n\telse if(s1[0]=='w')\n\t\tb=3;\n\telse if(s1[0]=='t' && s1[1]=='h')\n\t\tb=4;\n\telse if(s1[0]=='f')\n\t\tb=5;\n\telse if(s1[0]=='s' && s1[1]=='a')\n\t\tb=6;\n\telse if(s1[0]=='s' && s1[1]=='u')\n\t\tb=7;\n//\tprintf(\"%d %d\\n\",a,b);\n\n/*\tif(a==b)\n\t\tprintf(\"YES\\n\");\n\telse if(b>a)\n\t{\n\t\tsum=b-a;\n\t\tif(29+sum==31 || 29+sum==32)\n\t\t\tprintf(\"YES\\n\");\n\t\telse\n\t\t\tprintf(\"NO\\n\");\n\t}\n\telse if(a>b)\n\t{\n\t\tsum=7-a+b;\n//\t\tprintf(\"%d\\n\",sum);\n\t\tif(29+sum==31 || 29+sum==32)\n\t\t\tprintf(\"YES\\n\");\n\t\telse\n\t\t\tprintf(\"NO\\n\");\n\t}*/\n\tint k=0,l=0;\n\tk=a-b;\n\tl=b-a;\n\tif(l==0 || l==2 || l==3 || k==4 || k==5)\n\t\tprintf(\"YES\\n\");\n\telse\n\t\tprintf(\"NO\\n\");\n\treturn 0;\n}\n", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "91fecbda94cb5930da83c019b07b9e36", "src_uid": "2a75f68a7374b90b80bb362c6ead9a35", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int count=0,t=0,n,m,i;\n    char a[10000];\n    scanf(\"%s\",a);\n    m=strlen(a);\n    for(i=0;i<m&&m!=1;i++)\n    {\n        if(a[i]<=92)\n            count++;\n    }\n        for(i=1;i<m;i++)\n    {\n        if(a[0]>92)\n        {\n            if(a[i]<=92)\n                t++;\n        }\n    }\n\n    if(m==1)\n    {\n        if(a[0]<=92)\n            a[0]=a[0]+32;\n        else\n            a[0]=a[0]-32;\n    }\n\n    else if(count==m)\n    {\n        for(i=0;i<m;i++)\n        {a[i]+=32;}\n    }\n    else  if(t==m-1)\n    {\n        a[0]=a[0]-32;\n        for(i=1;i<m;i++)\n        {\n            a[i]=a[i]+32;\n        }\n    }\n\n    for(i=0;i<m;i++)\n    {\n        printf(\"%c\",a[i]);\n    }\n\n}\n", "lang_cluster": "C", "tags": ["strings", "implementation"], "code_uid": "374846299d5c6d77abb891ee847b9bc9", "src_uid": "db0eb44d8cd8f293da407ba3adee10cf", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\nint main() {\n    int n,min1,min2,min3,max1,max2,max3, left = 0, first = 0, second = 0, third = 0;\n    scanf(\"%d\",&n);\n    scanf(\"%d\",&min1);\n    scanf(\"%d\",&max1);\n    scanf(\"%d\",&min2);\n    scanf(\"%d\",&max2);\n    scanf(\"%d\",&min3);\n    scanf(\"%d\",&max3);\n    left = n;\n    first = min1;second = min2;third = min3;\n    while(first < (left -(min2+min3)) && first < max1) first++; \n    left -= first;\n    while(second < (left -min3) && second < max2) second++;\n    left -= second;\n    while(third < left && third < max3) third++;\n\n    printf(\"%d %d %d\\n\", first, second, third);\n    return 0;\n}", "lang_cluster": "C", "tags": ["math", "greedy", "implementation"], "code_uid": "3403ee80256df8c3ee2f81be25592674", "src_uid": "3cd092b6507079518cf206deab21cf97", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\n#include<string.h>\n#define N 300\n//1+1+100+3\n//1+1+100+100\nint main() {\n    char d[N];\n    scanf(\"%s\",d);\n    int n=strlen(d);\n    int i,j;\n    int dot=0;\n    int e=0;\n    for(i=0;i<n;i++){\n        if(d[i]=='.'){\n            dot=i;\n        }\n        if(d[i]=='e'){\n            e=i;\n            break;\n        }\n    }\n    char b[4];\n    int nb=0;\n    for(j=e+1;j<n;j++){\n        b[nb]=d[j];\n        nb++;\n    }\n    b[nb]='\\0';\n    int xb=0;\n    for(i=0;i<nb;i++){\n        xb=xb*10+b[i]-'0';\n    }\n    /*\n    printf(\"b=%s\\n\",b);\n    printf(\"dot = %d\\n\",dot);\n    printf(\"xb = %d\\n\",xb);\n    printf(\"e = %d\\n\",e);\n    */\n    //8.549e2\n    //0123456\n    //8.54.9\n    //1+3\n    for(i=0;i<n;i++){\n        if(d[i]=='.'){\n            //不打印！\n            if(e-dot==2 && d[dot+1]=='0'){\n                break;\n            }\n        }else if(d[i]=='e'){\n            break;\n        }else{\n            if(i==dot+xb+1){\n                printf(\".\");\n            }\n            printf(\"%c\",d[i]);\n        }\n    }\n    //如果有零，我们必须补上零\n    int zero=xb-(e-dot-1);\n    if(e-dot==2 && d[dot+1]=='0'){\n        zero=xb;\n    }\n    for(i=0;i<zero;i++){\n        printf(\"0\");\n    }\n    printf(\"\\n\");\n\treturn 0;\n}\n", "lang_cluster": "C", "tags": ["brute force", "math", "strings", "implementation"], "code_uid": "aff3723c14161473c9f628e3a3e2136c", "src_uid": "a79358099f08f3ec50c013d47d910eef", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\nint main()\n{ int t,i;\n scanf(\"%d\",&t);\nfor(i=0;i<t;i++)\n{ int n,k,d,p;\nscanf(\"%d %d %d\",&n,&k,&d);\nint b[k];\nfor(p=0;p<k;p++)\n{ b[p]=0;}\nint a[n],j,l,s=0,y,z,m,min=d;\nfor(j=0;j<n;j++)\n{ scanf(\"%d\",&a[j]);}\nfor(y=0;y<=n-d;y++)\n{ for(l=y;l<y+d;l++)\n {z=a[l];\nif(b[z-1]==0)\n{s++;\n b[z-1]=1;}\nelse\ns=s;}\nif(s<min)\n{ min=s;\ns=0;}\nelse\n{ s=0;}\nfor(m=0;m<k;m++)\n{ b[m]=0;}\n}\nprintf(\"%d\\n\",min);\n}\n    return 0;\n}", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "a4a002a83d6f9078ead949b0fe4fe9ba", "src_uid": "56da4ec7cd849c4330d188d8c9bd6094", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "/*  AUTHOR:AKASH JAIN\n*   USERNAME:akash19jain    \n*   DATE:21/07/2019 \n*/\n#include<stdio.h>\n#include<math.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#define MOD 1000000007\nint cmp(const void * a,const void * b);\n\nint main()\n{\n    long long t=1,i=0;\n    //scanf(\"%lld\",&t);\n    while(t--)\n    {\n        long long n,k;\n        scanf(\"%lld%lld\",&n,&k);\n        long long l=-1,r=n+1;\n        while(r-l>1)\n        {\n            long long m=(l+r)/2;\n            if((n-m)*(n-m+1)/2-m>k)\n                l=m;\n            else\n                r=m;\n        }\n        printf(\"%lld\\n\",r);\n    }\n}\n\n//qsort(arr,n,sizeof(arr[0]),cmp);\nint cmp(const void * a,const void * b)\n{\n    return (*(int*)a - *(int*)b);\n}", "lang_cluster": "C", "tags": ["brute force", "math", "binary search"], "code_uid": "3cb184e88d9f9397410858a99f47ffb1", "src_uid": "17b5ec1c6263ef63c668c2b903db1d77", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include<stdio.h>\n#include<stdlib.h>\n\nint cf(void const *a, void const *b)\n{\n\treturn (*(int*)a - *(int*)b);\n}\nint main()\n{\n\tint n, m, c=1, x=0, y=0, s=0, r=0, i, h;\n\t\n\tscanf(\"%d %d\", &n, &m);\n\tint a[m+1], b[m+1];\n\t\n\tfor(i=0; i<m; i++)\n\t{\n\t\tscanf(\"%d\", &a[i]);\n\t}\n\tqsort(a, m, 4, cf);\n\t\n\tif(n>m){ printf(\"0\");\n\t}\n\telse if(n==m){ printf(\"1\");\n\t}\n\telse{\n\tfor(i=0; i<m-1; i++)\n\t{\n\t\tif(a[i]==a[i+1])\n\t\t{\n\t\t\tc++;\n\t\t\ty=1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tb[r]=c;\n\t\t\tr++;\n\t\t\tc=1; y=0;\n\t\t}\n\t}\n\tif(y==1)\n\t{\n\t\tb[r]=c; r++;\n\t}\n\tqsort(b, r, 4, cf);\n\t\n\tfor(i=1; i<=101; i++)\n\t{\n\t\tfor(h=0; h<r; h++)\n\t\t{\n\t\t\ts+=b[h]/i;\n\t\t}\n\t\tif(s>=n)\n\t\t{\n\t\t\tx=i;\n\t\t}\n\t\ts=0;\n\t}\n\tprintf(\"%d\", x);\n\t}\n\treturn 0;\n}", "lang_cluster": "C", "tags": ["brute force", "implementation", "binary search"], "code_uid": "243828ff8f899eb57bb83e7d7b6f6353", "src_uid": "b7ef696a11ff96f2e9c31becc2ff50fe", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\nint main()\n{\n\tint a,ta;\n\tscanf(\"%d%d\",&a,&ta);\n\tint b,tb;\n\tscanf(\"%d%d\",&b,&tb);\n\tint h,m;\n\tscanf(\"%d:%d\",&h,&m);\n\tint x,y,w=0,z=300;\n\tx=60*h+m;\n\ty=60*h+m+ta;\n\tjump:\n\t\tif(z+tb<x)\n\t\t{\n\t\t\tz=z+b;\n\t\t\tgoto jump;\n\t\t}\n\t\telse if(z+tb>x && z<y && z<1440)\n\t\t{\n\t\t\tw+=1;\n\t\t\tz=z+b;\n\t\t\tgoto jump;\n\t\t}\n\t\telse if(z>y)\n\t\t{\n\t\t\tgoto temp;\n\t\t}\n\t\telse if(z+tb==x || z==y)\n\t\t{\n\t\t\tz=z+b;\n\t\t\tgoto jump;\n\t\t}\n\t\ttemp:\n\t\tprintf(\"%d\\n\",w);\n\treturn 0;\n}", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "e83dc1a0f06ecbf461ed86962eef38d9", "src_uid": "1c4cf1c3cb464a483511a8a61f8685a7", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\nint main()\n{\n\tlong long int n,m,x;\n\tscanf(\"%lld%lld%lld\",&n,&m,&x);\n\n\t\n\tn=n-((x-1)*2);\n\tm=m-((x-1)*2);\n\tif(n<=0 || m<=0)\n\t\tprintf(\"0\\n\");\n\telse if(n==1 && m==1)\n\t\tprintf(\"1\\n\");\n\telse\n\t{\n\tlong long int c=n+m-2;\n\tif(n==1)\n\t\tc=(m+1)/2;\n\tif(m==1)\n\t\tc=(n+1)/2;\n\tprintf(\"%lld\\n\",c);\n\t}\n\treturn 0;\n\t\n}\n", "lang_cluster": "C", "tags": ["math"], "code_uid": "2901174c063b326fa059d401a5b0c2f3", "src_uid": "fa1ef5f9bceeb7266cc597ba8f2161cb", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\n\nlong long int GCD(long long int a,long long int b){\n\tif(b==0)return a;\n\tif(a==0)return b;\n\tif(a<b)return(GCD(a,b%a));\n\telse return(GCD(b,a%b));\n}\n\nlong long int LCM(long long int a,long long int b){\n\tlong long int c=GCD(a,b);\n\treturn((a/c)*(b/c)*c);\n}\n\nint bfs(int i,int visited[],int count,int index,int A[]){\n\tif(i==index){\n\t\tif(count%2)return count;\n\t\telse return(count/2);\n\t}\n\tif(visited[i]==0){\n\t\tvisited[i]=1;\n\t\treturn(bfs(A[i],visited,count+1,index,A));\n\t}\n\treturn(-1);\n}\n\nint main(){\n\tint i,n,A[105],cycle,visited[105];\n\tlong long int ans;\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++){\n\t\tscanf(\"%d\",&A[i]);\n\t\tA[i]--;\n\t}\n\tfor(i=0;i<n;i++)visited[i]=0;\n\tans=1;\n\tfor(i=0;i<n;i++){\n\t\tif(visited[i]==0){\n\t\t\tvisited[i]=1;\n\t\t\tcycle=bfs(A[i],visited,1,i,A);\n\t\t\tif(cycle==-1){\n\t\t\t\tans=-1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse ans=LCM(ans,(long long int)cycle);\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}", "lang_cluster": "C", "tags": ["dfs and similar", "math"], "code_uid": "7c623c925f27abdb0e9ed3db76ac0052", "src_uid": "149221131a978298ac56b58438df46c9", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\n\nint tran(int a, int b){\n   int t;\n   int res = 0;\n   int pow = 1;\n   do {\n      t = a/b;\n      res += pow *(a-(a/b)*b);\n      a = t;\n      pow*=10;\n   } while(t>=b);\n   res +=pow*t;\n   return res;\n}\n\nint main(){\n   int b,i,j;\n   scanf(\"%d\",&b);\n   for(i = 1; i<b; i++){\n      for(j = 1; j<b; j++){\n\t printf(\"%d \",tran(i*j,b));\n      }\n      printf(\"\\n\");\n   }\n   return 0;\n}\n\n", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "d35cee21519ef67532da37b92bf06310", "src_uid": "a705144ace798d6b41068aa284d99050", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include<stdio.h>\nint main()\n{\n    long long n,a,b,c,i,j,k,diff,min=10000000000,max;\n    scanf(\"%lld\",&n);\n    for(i=1;i*i*i<=n;i++)\n    {\n        if(n%i==0)\n        {\n            for(j=i;j*j<=n/i;j++)\n            {\n                if(n%j==0)\n                k=n/(i*j);\n                a=i+1;b=j+2;c=k+2;\n                if((a-1)*(b-2)*(c-2)==n)\n                diff=(a*b*c)-n;\n                if(min>diff)\n                min=diff;\n                \n        }\n        }\n    }\n    max=9*(n+1)-n;\n    printf(\"%lld %lld\",min,max);\n    return 0;\n}", "lang_cluster": "C", "tags": ["math", "implementation"], "code_uid": "f1ca167442c543c1f95a74c265335893", "src_uid": "2468eead8acc5b8f5ddc51bfa2bd4fb7", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "GNU C", "source_code": "#include <stdio.h>\n\n#define mod 1000000007\nlong long dp[55][55][205]={};\nlong long c[55][55]={};\nint n,lim,A=0,B=0,i,j,k,ii,jj;\nint min(int a,int b){return a<b?a:b;}\nint max(int a,int b){return a<b?b:a;}\nint main(){\n\tscanf(\"%d %d\",&n,&lim);\n\tfor(i=0;i<n;i++){\n\t\tint fk; scanf(\"%d\",&fk);\n\t\tif(fk==50) A++;\n\t\telse B++;\n\t}\n\tdp[A][B][0]=1;\n\tc[0][0]=1;\n\tfor(i=1;i<=50;i++){\n\t\tfor(j=0;j<=i;j++){\n\t\t\tc[i][j]=c[i-1][j-1]+c[i-1][j];\n\t\t}\n\t}\n\tfor(k=1;k<=4*n;k++){\n\t\tfor(i=A;i>=0;i--){\n\t\t\tfor(j=B;j>=0;j--){\n\t\t\t\tint s=k%2;\n\t\t\t\tdp[i][j][k]=0;\n\t\t\t\tif(s){\n\t\t\t\t\tfor(ii=i;ii<=A;ii++){\n\t\t\t\t\t\tint f=lim-(ii-i)*50;\n\t\t\t\t\t\tif(f>=0){\n\t\t\t\t\t\t\tf/=100;\n\t\t\t\t\t\t\tf+=j; f=min(f,B);\n\t\t\t\t\t\t\tfor(jj=j;jj<=f;jj++){\n\t\t\t\t\t\t\t\tif((i!=ii || j!=jj)){\n\t\t\t\t\t\t\t\t\tdp[i][j][k]+=(dp[ii][jj][k-1]*c[ii][ii-i]*c[jj][jj-j])%mod;\n\t\t\t\t\t\t\t\t\tdp[i][j][k]%=mod;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tfor(ii=0;ii<=i;ii++){\n\t\t\t\t\t\tint f=lim-(i-ii)*50;\n\t\t\t\t\t\tif(f>=0){\n\t\t\t\t\t\t\tf/=100; f=max(j-f,0);\n\t\t\t\t\t\t\tfor(jj=f;jj<=j;jj++){\n\t\t\t\t\t\t\t\tif((i!=ii || j!=jj)){\n\t\t\t\t\t\t\t\t\tdp[i][j][k]+=(dp[ii][jj][k-1]*c[A-ii][i-ii]*c[B-jj][j-jj])%mod;\n\t\t\t\t\t\t\t\t\tdp[i][j][k]%=mod;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(dp[0][0][k]){\n\t\t\t\t\tprintf(\"%d\\n\",k);\n\t\t\t\t\tprintf(\"%lld\\n\",dp[0][0][k]);\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tputs(\"-1\\n0\");\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//                                                                                ", "lang_cluster": "C", "tags": ["dp", "combinatorics", "graphs", "shortest paths"], "code_uid": "15725813c7099eaa9e96d5898472bb70", "src_uid": "ebb0323a854e19794c79ab559792a1f7", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "/* practice with Dukkha */\n#include <stdio.h>\n\n#define N\t100\n#define X\t100\n#define MD\t1000000007\n\nlong long power(int a, int k) {\n\tlong long p;\n\n\tif (k == 0)\n\t\treturn 1;\n\tp = power(a, k >> 1);\n\tp = p * p % MD;\n\tif (k & 1)\n\t\tp = p * a % MD;\n\treturn p;\n}\n\nint main() {\n\tstatic int ff[X + 1], ds[X + 1][N][N + 1], dp[X + 1][N], dq[X + 1][N], dr[X + 1];\n\tstatic char cc[N + 1];\n\tint n, x, i, l, r, m;\n\n\tscanf(\"%d%d%s\", &n, &x, cc);\n\tif (x == 0) {\n\t\tprintf(\"%d\\n\", n == 1 && cc[0] == '0');\n\t\treturn 0;\n\t}\n\tff[0] = ff[1] = 1;\n\tfor (i = 2; i <= x; i++)\n\t\tff[i] = (ff[i - 1] + ff[i - 2]) % (MD - 1);\n\tfor (i = 0; i <= x; i++)\n\t\tff[i] = power(2, ff[i]);\n\tfor (l = 0; l < n; l++) {\n\t\tds[0][l][l] = ds[1][l][l] = 1;\n\t\tds[0][l][l + 1] = cc[l] == '0' ? 1 : 0;\n\t\tds[1][l][l + 1] = cc[l] == '1' ? 1 : 0;\n\t}\n\tfor (i = 2; i <= x; i++)\n\t\tfor (l = 0; l < n; l++)\n\t\t\tfor (r = l; r < n; r++) {\n\t\t\t\tlong long z = 0;\n\n\t\t\t\tfor (m = l; m <= r; m++)\n\t\t\t\t\tz = (z + (long long) ds[i - 1][l][m] * ds[i - 2][m][r]) % MD;\n\t\t\t\tds[i][l][r] = z;\n\t\t\t}\n\tif (n > 1) {\n\t\tdp[0][n - 1] = ds[0][n - 1][n];\n\t\tdp[1][n - 1] = ds[1][n - 1][n];\n\t\tfor (i = 2; i <= x; i++)\n\t\t\tfor (l = 1; l < n; l++) {\n\t\t\t\tlong long z = (long long) dp[i - 1][l] * ff[i - 2] % MD;\n\n\t\t\t\tfor (m = l; m < n; m++)\n\t\t\t\t\tz = (z + (long long) ds[i - 1][l][m] * dp[i - 2][m]) % MD;\n\t\t\t\tdp[i][l] = z;\n\t\t\t}\n\t\tdq[0][1] = ds[0][0][1];\n\t\tdq[1][1] = ds[1][0][1];\n\t\tfor (i = 2; i <= x; i++)\n\t\t\tfor (r = 1; r < n; r++) {\n\t\t\t\tlong long z = (long long) ff[i - 1] * dq[i - 2][r] % MD;\n\n\t\t\t\tfor (m = r; m > 0; m--)\n\t\t\t\t\tz = (z + (long long) dq[i - 1][m] * ds[i - 2][m][r]) % MD;\n\t\t\t\tdq[i][r] = z;\n\t\t\t}\n\t}\n\tdr[0] = ds[0][0][n];\n\tdr[1] = ds[1][0][n];\n\tfor (i = 2; i <= x; i++) {\n\t\tlong long z = ((long long) dr[i - 1] * ff[i - 2] + (long long) ff[i - 1] * dr[i - 2]) % MD;\n\n\t\tfor (m = 1; m < n; m++)\n\t\t\tz = (z + (long long) dq[i - 1][m] * dp[i - 2][m]) % MD;\n\t\tdr[i] = z;\n\t}\n\tprintf(\"%d\\n\", dr[x]);\n\treturn 0;\n}\n", "lang_cluster": "C", "tags": ["matrices", "dp", "combinatorics"], "code_uid": "b2823626c78a06f78db16578e8fe2bd1", "src_uid": "52c6aa73ff4460799402c646c6263630", "difficulty": 2400.0, "exec_outcome": "PASSED"}
{"lang": "GNU C11", "source_code": "#include <stdio.h>\n\nlong long min(long long a, long long b) {\n\treturn a < b ? a : b;\n}\n\nlong long max(long long a, long long b) {\n\treturn a > b ? a : b;\n}\n\nlong long lucky(int i) {\n\treturn i == 1 ? 0 : lucky(i / 2) * 10 + (i % 2 == 0 ? 4 : 7);\n}\n\nint main() {\n\tstatic long long aa[2047];\n\tint l, r, i;\n\tlong long x, y, ans;\n\n\tscanf(\"%d%d\", &l, &r);\n\taa[0] = 4;\n\tfor (i = 1; i < 2047; i++)\n\t\taa[i] = lucky(i + 1);\n\tans = 0;\n\tfor (i = 0; i < 2047; i++) {\n\t\tx = max(aa[i - 1] + 1, l);\n\t\ty = min(aa[i], r);\n\t\tif (x <= y)\n\t\t\tans += (y - x + 1) * aa[i];\n\t}\n\tprintf(\"%lld\\n\", ans);\n\treturn 0;\n}\n", "lang_cluster": "C", "tags": ["implementation"], "code_uid": "fa3e2118bb6c8870cacd3850cdd9670f", "src_uid": "8a45fe8956d3ac9d501f4a13b55638dd", "difficulty": 1100.0, "exec_outcome": "PASSED"}