problem_id
stringlengths 6
6
| user_id
stringlengths 10
10
| time_limit
float64 1k
8k
| memory_limit
float64 262k
1.05M
| problem_description
stringlengths 48
1.55k
| codes
stringlengths 35
98.9k
| status
stringlengths 28
1.7k
| submission_ids
stringlengths 28
1.41k
| memories
stringlengths 13
808
| cpu_times
stringlengths 11
610
| code_sizes
stringlengths 7
505
|
|---|---|---|---|---|---|---|---|---|---|---|
p03285 | u796708718 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\n\nfor i in (26):\n\tfor j in(16):\n \t\tif j*4+J*7 == N:\n \t\tprint("Yes")\n else:\n print("No")', 'N = int(input())\n\nfor i in (26)\n\tfor j in(16)\n \t\tif j*4+J*7 == N:\n \t\tprint("Yes")\n else:\n print("No")\n', 'N = int(input())\n\nflag = 0\n\nfor i in range(26):\n for j in range(16):\n if j*4+j*7 == N:\n flag = 1\n\nif flag == 1:\n print("Yes")\nelse\n print("No")\n', 'N = int(input())\n\nflag = 0\n\nfor i in range(26):\n for j in range(16):\n if i*4+j*7 == N:\n flag = 1\n\nif flag == 1:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s264635544', 's454859290', 's718423775', 's259389494'] | [3064.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0, 18.0] | [125, 124, 165, 166] |
p03285 | u798316285 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n=int(input())\nans="No"\nwhile n>=0\n if n%4==0:\n ans="Yes"\n break\n else:\n n-=7\nprint(ans)', 'n=int(input())\nans="No"\nwhile n>=0:\n if n%4==0:\n ans="Yes"\n break\n else:\n n-=7\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s201095878', 's055865112'] | [2940.0, 2940.0] | [17.0, 17.0] | [99, 100] |
p03285 | u799479335 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\n\n#4*a + 7*b == N ???\n\ncounter = 0\nfor a in range(N//4+1):\n for b in range(N//7+1):\n if 4*a + 7*b == N:\n counter += 1\nprint(counter)\n', 'N = int(input())\n\n#4*a + 7*b == N ???\n\ncounter = 0\nfor a in range(N//4):\n for b in range(N//7):\n if 4*a + 7*b == N:\n counter += 1\nprint(counter)', "N = int(input())\n\n#4*a + 7*b == N ???\n\ncounter = 0\nfor a in range(N//4+1):\n for b in range(N//7+1):\n if 4*a + 7*b == N:\n counter += 1\n\nif counter > 0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s356385800', 's616738617', 's305702905'] | [2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0] | [158, 153, 194] |
p03285 | u801274036 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\n\nif N % 4 == 0 or N % 7 == 0:\n\tprint('Yes')\nelse:\n\ti = N // 7\n\tfor count in range(i):\n\t\ttemp = N - 7*count\n\t\tif temp % 4 == 0:\n\t\t\tprint('Yes')\n\t\t\texit()\n\tprint('No')", "N = int(input())\n\nif N % 4 == 0 or N % 7 == 0:\n\tprint('Yes')\nelse:\n\ti = N // 7\n\tfor count in range(i):\n\t\ttemp = N - 7*(count+1)\n\t\tif temp % 4 == 0:\n\t\t\tprint('Yes')\n\t\t\texit()\n\tprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s915027598', 's737791233'] | [2940.0, 2940.0] | [17.0, 17.0] | [182, 186] |
p03285 | u802963389 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\nfor i in range(0, 101):\n for j in range(0, 101):\n if i * 4 + j * 7 = N:\n print("Yes")\n exit()\nprint("No")', 'N = int(input())\nfor i in range(0, 101):\n for j in range(0, 101):\n if i * 4 + j * 7 == N:\n print("Yes")\n exit()\nprint("No")'] | ['Runtime Error', 'Accepted'] | ['s276027617', 's585928425'] | [2940.0, 2940.0] | [17.0, 19.0] | [136, 137] |
p03285 | u802977614 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n=int(input())\nwhile True:\n if n%4==0:\n print("YES")\n break\n n-=7\n if n<0:\n print("NO")\n break', 'n=input()\nwhile True:\n if n%4==0:\n print("YES")\n exit()\n n-=7\n if n<0:\n print("NO")\n exit()', 'n=input()\nwhile True:\n if n%4==0:\n print("YES")\n break\n n-=7\n if n<0:\n print("NO")\n break', 'n=int(input())\nwhile True:\n if n%4==0:\n print("Yes")\n break\n n-=7\n if n<0:\n print("No")\n break'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s090823126', 's440860488', 's837295220', 's569995014'] | [3064.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 17.0] | [109, 106, 104, 109] |
p03285 | u806855121 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\n\ni = 0\nj = 0\nfor i in range(N//4):\n for j in range(N//7):\n if 4 * i + 7 *j == N:\n print('Yes')\n\nprint('No')", "N = int(input())\n\ni = 0\nj = 0\nfor i in range(N//4+1):\n for j in range(N//7+1):\n if 4 * i + 7 * j == N:\n print('Yes')\n quit()\n\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s223418525', 's267714045'] | [2940.0, 2940.0] | [17.0, 17.0] | [145, 169] |
p03285 | u810066979 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['import sys\nn=int(input())\na=n\nb=n\nif n%4==0 or n%7==0:\n\tprint("Yes")\n\tsys.exit()\t\nfor k in range(0,n,4):\n\tprint(k)\n\ta-=k\n\tif a%7==0:\n\t\tprint("Yes")\n\t\tsys.exit()\nfor d in range(0,n,7):\n\tb-=d\n\tif b%4==0:\n\t\tprint("Yes")\n\t\tsys.exit()\nprint("No")', 'import sys\nn=int(input())\na=n\nb=n\nif n%4==0 or n%7==0:\n\tprint("Yes")\n\tsys.exit()\t\nfor k in range(1,n,4):\n\ta-=k\n\tif a%7==0:\n\t\tprint("Yes")\n\t\tsys.exit()\nfor d in range(1,n,7):\n\tb-=d\n\tif b%4==0:\n\t\tprint("Yes")\n\t\tsys.exit()\nprint("No")', 'n=int(input())\nans="No"\na=0\n\nfor i in range(15):\n for j in range(26):\n a=7*i+4*j\n if a==n:\n ans="Yes"\n break\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s128980052', 's194909762', 's852824478'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [241, 231, 137] |
p03285 | u814171899 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n=int(input())\nfor i in range(n//4+1):\n for j in range((n-4*i)//7+1):\n print(4*i, 7*j)\n if 4*i+7*j==n:\n print('Yes')\n exit()\nprint('No')", "n=int(input())\nfor i in range(n//4+1):\n for j in range((n-4*i)//7+1):\n if 4*i+7*j==n:\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s285233581', 's011745457'] | [3068.0, 3064.0] | [17.0, 17.0] | [175, 151] |
p03285 | u820180033 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["def main():\n N = int(input())\n i = 0\n while 4*i <= N:\n j = 0\n while (4*i + 7*j) <=N:\n print(4*i + 7*j)\n if (4*i+7*j == N):\n print('Yes')\n return\n j = j+1\n i = i+1\n print('No')\n return\nmain()", "def main():\n N = int(input())\n i = 0\n while 4*i <= N:\n j = 0\n while (4*i + 7*j) <=N:\n print(4*i + 7*j)\n if (4*i+7*j == N):\n print('Yes')\n return\n j = j+1\n i = i+1\n print('No')\n return\nmain()", "n = int(input())\nquotient = n // 4\nrep = [4*i for i in range(quotient+1)]\nflag = False\nwhile rep[0] <= n:\n if n in rep:\n print('Yes')\n flag = True\n break\n rep = [7+ele for ele in rep]\n\nif not flag:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s186502345', 's570712047', 's539073494'] | [2940.0, 3060.0, 9176.0] | [17.0, 17.0, 30.0] | [289, 289, 222] |
p03285 | u822044226 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["import itertools\n\nN = int(input())\n\nif N%4 ==0 or N%7 ==0:\n print('Yes')\n exit()\nelse:\n i = itertools.product(range(1,N//4),range(1,N//7))\n\nc = [a for a in i]\n\nfor i in c:\n if i[0]*4+i[1]*7 == N:\n print('Yes')\n exit()\n else:\n continue\n\nprint('No') \n ", "N = int(input())\n\nif (N%7)%4 == 0 or (N%4)%7 == 0\n print('Yes')\nelse:\n print('No')", "import itertools\n\nN = int(input())\n\nif N%4 ==0 or N%7 ==0:\n print('Yes')\n exit()\nelse:\n i = itertools.product(range(N//4),range(N//7))\n \nc = [a for a in i]\n\nfor i in c:\n if i[0]*4+i[1]*7 == N:\n print('Yes')\n exit()\n else:\n continue\n\nprint('No') \n ", "import itertools\n\nN = int(input())\n\nif N%4 ==0 or N%7 ==0:\n print('Yes')\n exit()\nelse:\n i = itertools.product(range(N//4+1),range(N//7+1))\n \n\nc = [a for a in i]\nfor i in c:\n if i[0]*4+i[1]*7 == N:\n print('Yes')\n exit()\n else:\n continue\n\nprint('No') \n"] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s568306826', 's570551415', 's895295071', 's678062450'] | [3060.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 18.0] | [268, 84, 266, 268] |
p03285 | u824647593 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["def cakes_and_donuts(N=N):\n max_7_num = N//7\n max_4_num = N//4\n for i in range(max_7_num):\n for j in range(max_4_num):\n if 7*(i+1) + 4*(j+1) == N:\n return 'Yes'\n return 'No'\n\nN = int(input())\ns = cakes_and_donuts(N)\nprint(''.format(s))", "N = int(input())\n\ndef cakes_and_donuts(N=N):\n max_7_num = N//7\n max_4_num = N//4\n for i in range(max_7_num):\n for j in range(max_4_num):\n if 7*(i+1) + 4*(j+1) == N:\n print(i+1, j+1)\n return 'Yes'\n return 'No'\n\ns = cakes_and_donuts(N)\nprint('{}'.format(s))", "def cakes_and_donuts(N=N):\n max_7_num = N//7\n max_4_num = N//4\n for i in range(max_7_num):\n for j in range(max_4_num):\n if 7*(i+1) + 4*(j+1) == N:\n return 'Yes'\n return 'No'\n\nN = int(input())\ncakes_and_donuts(N)\n", "N = int(input())\n\ndef cakes_and_donuts(N=N):\n if N % 4 ==0 or N % 7 ==0:\n return 'Yes' \n max_7_num = N//7\n max_4_num = N//4\n for i in range(max_7_num):\n for j in range(max_4_num):\n if 7*(i+1) + 4*(j+1) == N:\n return 'Yes'\n return 'No'\n\ns = cakes_and_donuts(N)\nprint('{}'.format(s))"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s002416732', 's321874545', 's518943349', 's320590504'] | [3060.0, 3064.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0, 17.0] | [254, 281, 231, 305] |
p03285 | u829094246 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['def check_pay(N):\n for i in range(0,int(N/4)):\n for j in range(0,int(N/7)):\n if i*4+j*7 == N:\n print("Yes")\n return\n print("No")\ncheck_pay(int(input()))\n', 'def check_pay(N):\n for i in range(int(N/4)+1):\n for j in range(0,int(N/7)+1):\n if i*4+j*7 == N:\n print("Yes")\n return\n print("No")\ncheck_pay(int(input()))\n'] | ['Wrong Answer', 'Accepted'] | ['s705622060', 's452481371'] | [2940.0, 2940.0] | [18.0, 18.0] | [207, 209] |
p03285 | u829796346 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\nfor n4 in range(N//4+1):\n if (N-n4)%7 == 0:\n print("Yes")\n exit()\nprint("No")', 'N = int(input())\nfor n4 in range(N//4+1):\n if (N-n4*4)%7 == 0:\n print("Yes")\n exit()\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s375292724', 's023502885'] | [3060.0, 2940.0] | [17.0, 17.0] | [101, 103] |
p03285 | u833829751 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\n\ncake = 4\ndonut = 7\nac = False\n\nfor i in range(25):\n for j in range(14):\n if N == (cake * i + donut * j):\n ac = True\n break\n \nif ac:\n print('Yes')\nelse:\n print('No')", 'N = int(input())\n\nflg = False\n\nfor i in range(25):\n for j in range(15):\n if 4 * i + 7 * j == N:\n flg = True\n continue\n if flg:\n break\n\nprint("Yes" if flg else "No")'] | ['Wrong Answer', 'Accepted'] | ['s154838004', 's334526412'] | [2940.0, 2940.0] | [17.0, 17.0] | [223, 206] |
p03285 | u835482198 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\ncnt = 0\nfor i in range(int((100 + 4) / 4)):\n for j in range(int((100 + 7) / 7)):\n if i * 4 + j * 7 == n:\n cnt += 1\nif cnt > 0:\n print(cnt)\nelse:\n print("No")\n', 'N = int(input())\ncnt = 0\nfor i in range(26):\n for j in range(16):\n if 4 * i + 7 * j == N:\n cnt += 1\nprint(cnt)\n', 'n = int(input())\ncnt = 0\nfor i in range(int((100 + 4) / 4)):\n for j in range(int((100 + 7) / 7)):\n if i * 4 + j * 7 == n:\n cnt += 1\nif cnt > 0:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s292790949', 's376764512', 's771398873'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [202, 132, 204] |
p03285 | u842170774 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["#B\nN=int(input())\nA=[4,8,12,16,20,24,7,14,21,11,19,25]\nif N>=28:\n print('YES')\nelif N in A:\n print('YES')\nelse:\n print('NO')", "#B\nN=int(input())\nA=[4,8,12,16,20,24,7,14,21,11,19,25,15,23,27]\nif N>=28:\n print('Yes')\nelif N in A:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s499861683', 's611541918'] | [3060.0, 3060.0] | [18.0, 17.0] | [133, 142] |
p03285 | u843318346 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\nif (n%7)%4==0:\n print('Yes')\n break\nelif (n%4)%7==0:\n print('Yes')\n break\nelse:\n print('No')", "n = int(input())\nkouho = []\nfor i in range(26):\n for j in range(15):\n kouho.append(i*4+j*7)\nif n in kouho:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s911439621', 's538309007'] | [2940.0, 2940.0] | [17.0, 17.0] | [114, 156] |
p03285 | u844005364 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\n\ncake = n // 4\n\nfor i in range(cake + 1):\n cake_money = i * 4\n donut_money = n - cake_money\n if donut_money <= 0 and donut_money % 7 == 0:\n print("Yes")\n break\nelse:\n print("No")', 'n = int(input())\n\ncake = n // 4\n\nfor i in range(cake + 1):\n cake_money = i * 4\n donut_money = n - cake_money\n if donut_money >= 0 and donut_money % 7 == 0:\n print("Yes")\n break\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s128881882', 's661128613'] | [3064.0, 2940.0] | [17.0, 17.0] | [205, 206] |
p03285 | u844881438 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = map(int, input())\nif n >= 20 or n % 7==0 or n%4==0 or n == 19 or n == 18 or n == 15 or n == 11 or n == 1:\n print("Yes")\nelse:\n print("No")', 'n = input()\nif n >= 20 or n % 7==0 or n%4==0 or n == 19 or n == 18 or n == 15 or n == 11:\n print("Yes")\nelse:\n print("No")', 'n = input()\nn = int(n)\nif n >= 20 or n % 7==0 or n%4==0 or n == 19 or n == 18 or n == 15 or n == 11:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s227342044', 's814389402', 's829919410'] | [2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [148, 128, 139] |
p03285 | u846150137 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n=int(input())\nfor i in range(100//4):\n for j in range((100-i*4)//7):\n if n == i*4 +j*7:\n print("Yes")\n break\nelse:\n print("No")', 'n=int(input())\nfor i in range(100):\n for j in range(100):\n if n == i*4 +j*7:\n print("Yes")\n break\nelse:\n print("No")', 'n=int(input())\nfor i in range(100):\n for j in range(100):\n if n == i*4 +j*7:\n print("Yes")\n exit()\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s645508233', 's933234494', 's978261617'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 19.0] | [143, 131, 132] |
p03285 | u848647227 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['a = int(input())\nif a > 3:\n\tif a % 4 == 0 or a % 7 == 0 or a % 7 == 4 or a % 7 == 1 or a % 4 == 3:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")\n ', 'a = int(input())\nif a > 3:\n\tif a % 4 == 0 or a % 7 == 0 or a % 7 == 4 or a % 7 == 1 or a % 4 == 3:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")\n \n \n ', 'a = int(input())\nfor i in range(a//4+1):\n for j in range(a//7+1):\n if i * 4 + j * 7 == a:\n print("Yes")\n exit()\nprint("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s434819623', 's864361123', 's292552586'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [172, 174, 155] |
p03285 | u851704997 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\nX = N // 4\nZ = N // 7\nY = sum(4*a + 7*b == N for a in range(X) for b in range(Z))\nif (Y != 0):\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nfor i in range(30):\n for j in range(20):\n if(N == i*4+j*7):\n print("Yes")\n exit()\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s168768702', 's227149759'] | [2940.0, 8876.0] | [17.0, 30.0] | [146, 142] |
p03285 | u853900545 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\nif 1 <= N <= 100:\n for i in range(0,25):\n for v in range(0,14):\n if (4 * i) + (7 * v) == N:\n print('Yes')\n break\n else:\n print('No')\nelse:\n print('No')", "N = int(input())\nif 1 <= N <= 100:\n for i in range(0,25):\n for v in range(0,14):\n if (4 * i) + (7 * v) == N:\n print('Yes')\n break\n break\n else:\n print('No')\nelse:\n print('No')", "N = int(input())\nif 1 <= N <= 100:\n for i in range(0,25):\n for v in range(0,14):\n if (4 * i) + (7 * v) == N:\n print('Yes')\n break\n else:\n print('No')\nelse:\n print('No')", "N = int(input())\nif 1 <= N <= 100:\n for i in range(0,25):\n for v in range(0,14):\n if (4 * i) + (7 * v) == N:\n print('Yes')\n break\n if (4 * i) + (7 * v) == N:\n break\n else:\n print('No')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s075757722', 's112330555', 's722457417', 's749341702'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [232, 250, 228, 285] |
p03285 | u854992222 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\n\nif n % 4 == 0 or n % 7 == 0\n print('Yes')\n\nelif (n % 7) % 4 == 0:\n print('Yes')\n\nelse:\n print('No')", "n = int(input())\n\nans = []\nfor i in range(n//4+1):\n for j in range(n//7+1):\n if 4*i+7*j <= n:\n ans.append(4*i+7*j)\nif ans.count(n) != 0:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s276943200', 's172824100'] | [9036.0, 9176.0] | [31.0, 29.0] | [126, 196] |
p03285 | u855057563 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n=int(input())\n\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j==n:\n print("Yes")\n else:\n print("No")\n', 'n=int(input())\n\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j=n:\n print("Yes")\n else:\n print("No")', 'n=int(input())\n\ns="No"\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j==n:\n s="Yes"\nprint(s)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s591813334', 's987891294', 's333048624'] | [9060.0, 8992.0, 9132.0] | [27.0, 24.0, 28.0] | [124, 122, 107] |
p03285 | u855380359 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\nif n%4 ==0\u3000or n%7 == 0:\n print('Yes')\n exit()\n \nfor _ in range(n//7):\n n -=7\nif n == 4:\n print('Yes')\nelse:\n print('No')", "n = int(input())\nif n%4 == 0\u3000or n%7 == 0:\n print('Yes')\n exit()\n \nfor _ in range(n//7):\n n -=7\nif n == 4:\n print('Yes')\nelse:\n print('No')", "n = int(input())\na = n//4\nb = n//7\nans = False\n\nfor i in range(a+1):\n for j in range(b+1):\n if i*4+j*7 == n:\n ans = True\n\nif ans == True:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s633401869', 's740731147', 's228733719'] | [3064.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [144, 145, 181] |
p03285 | u858670323 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['buy = [false]*1000\nbuy[0] = true\nfor i in range(100):\n if buy[i]:\n buy[i+4] = true\n buy[i+7] = true\n \nn = int(input())\nif buy[n]:\n print("Yes")\nelse:\n print("No")', 'buy = [False]*1000\nbuy[0] = True\nfor i in range(100):\n if buy[i]:\n buy[i+4] = True\n buy[i+7] = True\n \nn = int(input())\nif buy[n]:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s152487338', 's891033088'] | [9068.0, 9184.0] | [26.0, 31.0] | [174, 174] |
p03285 | u860657719 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\nwhile(N>0):\n if N%4 == 0:\n print("Yes")\n return\n else:\n N = N - 7\nif N ==0:\n print("Yes")\nelse:\n print("No")', "N = int(input())\nif N % 7 == 0:\n\tprint('Yes')\nelse:\n\twhile(N>0):\n\t\tif N%4 == 0:\n\t\t\tprint('Yes')\n\t\t\tbreak\n else:\n\t\tN = N - 7\n\telse:\n\t\tprint('No')\n", "N = int(input())\nif N % 7 == 0:\n print('Yes')\nelse:\n while(N>0):\n \tif N%4 == 0:\n print('Yes')\n break\n \telse:\n \tN = N - 7\n else:\n \tprint('No')\n", "N = int(input())\nwhile(N>0):\n if N%4 == 0:\n print('Yes')\n return None\n else:\n N = N - 7\nif N ==0:\n print('Yes')\nelse:\n print('No')\n", "N = int(input())\nif N % 7 == 0:\n print('Yes')\nelse:\n while(N>0):\n \tif N%4 == 0:\n \tprint('Yes')\n \tbreak\n \telse:\n \tN = N - 7\n else:\n \tprint('No')\n", "N = int(input())\nif N % 7 == 0:\n print('Yes')\nelse:\n while(N>0):\n if N%4 == 0:\n print('Yes')\n break\n else:\n N = N - 7\n else:\n print('No')\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s040317590', 's428295647', 's429346548', 's484548605', 's772852955', 's251546856'] | [2940.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [138, 156, 161, 144, 159, 165] |
p03285 | u865383026 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['import sys\n\nN = int(input())\n\nfor i in range(15):\n if (N - 7 * i) % 4 == 0 and (N - 7 * i) / 4 >= 0:\n print("Yes")\n print(int((N - 7 * i) / 4), i)\n sys.exit()\n \nprint("No")', 'import sys\n\nN = int(input())\n\nfor i in range(15):\n if (N - 7 * i) % 4 == 0 and (N - 7 * i) / 4 >= 0:\n print("Yes")\n sys.exit()\n \nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s535619014', 's150426502'] | [3060.0, 2940.0] | [17.0, 18.0] | [185, 150] |
p03285 | u870297120 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n=int(input())\na=-(-n//4)\nans = 'No'\nif n%4==0:\n ans = 'Yes'\nelse:\n for i in range(a):\n print((n-4*i), 4*i)\n if (n-4*i)%7==0:\n ans = 'Yes'\n break\nprint(ans)", "n=int(input())\na=-(-n//4)\nans = 'No'\nif n%4==0:\n ans = 'Yes'\nelse:\n for i in range(a):\n if (n-4*i)%7==0:\n ans = 'Yes'\n break\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s552014698', 's278779868'] | [2940.0, 3060.0] | [18.0, 17.0] | [198, 170] |
p03285 | u870518235 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\n\nlst = []\n\nfor i in range(1,26):\n for j in range(1,15):\n if i*4+j*7 >= 100:\n lst.append(i*4+j*7)\n\nif N in lst:\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\n\nlst = []\n\nfor i in range(26):\n for j in range(15):\n if i*4+j*7 > 100:\n break\n else:\n lst.append(i*4+j*7)\n\n\nif N in lst:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s127405740', 's416420087'] | [9144.0, 9084.0] | [25.0, 27.0] | [188, 216] |
p03285 | u871303155 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\ndiv4 = int(N/4) + 1\ndiv7 = int(N/7) + 1\n\nflg = False\nfor i in range(div4):\n sum = i * 4\n for t in range(div7):\n sum += t * 7\n if(N == sum):\n flg = True\n \n \nif(flg):\n print("YES")\nelse:\n print("NO")', 'N = int(input())\ndiv4 = int(N/4) + 1\ndiv7 = int(N/7) + 1\n\nflg = False\nfor i in range(div4):\n sum = i * 4\n for t in range(div7):\n sum += t * 7\n if(N == sum):\n flg = True\n \n \nif(flg):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s387415190', 's547873835'] | [3060.0, 3064.0] | [18.0, 18.0] | [239, 239] |
p03285 | u873269440 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['\n\ndef main():\n\n\n N = int(input())\n\n for i in range(int(N/4)):\n for j in range(int(N/7)):\n if i*4+j*7==N:\n print(\'Yes\')\n exit()\n \n print(\'No\')\n\n\n \nif __name__== "__main__":\n main() \n\n\n\n\n\n\n\n\n\n', '\n\ndef main():\n\n \n N = int(input())\n\n for i in range(N//4+1):\n for j in range(N//7+1):\n if i*4+j*7==N:\n print(\'Yes\')\n exit()\n print(\'No\')\n\n\nif __name__== "__main__":\n main() \n\n\n\n\n\n\n\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s208380053', 's719192751'] | [2940.0, 2940.0] | [17.0, 17.0] | [256, 246] |
p03285 | u876742094 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N=int(input())\nres=False\nfor i in range(N//7):\n if (N-7*i)%4==0:\n res=True\n break\n\nif res:\n print("Yes")\nelse:\n print("No")\n', 'N=int(input())\nres=False\nfor i in range(N//7+1):\n if (N-7*i)%4==0:\n res=True\n break\n\nif res:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s440035967', 's893588461'] | [9104.0, 9100.0] | [28.0, 28.0] | [147, 149] |
p03285 | u886655280 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\n\ncake_price = 4\ndonut_price = 7\n\nmax_cake = N // cake_price\nmax_donut = N // donut_price\n\nisJustN = False\nif max_cake * cake_price == N or max_donut * donut_price == N:\n isJustN = True\nelse:\n for c in range(1, max_cake + 1):\n for d in range(1, max_donut + 1):\n total_price = cake_price * c + donut_price * d\n if total_price == N:\n isJustN = True\n break\n\nResult = ''\nResult = 'Yes' if isJustN == True else Result = 'No'\nprint(Result)\n", "\nN = int(input())\n\ncake_price = 4\ndonut_price = 7\n\nmax_cake = N // cake_price\nmax_donut = N // donut_price\n\nisJustN = False\nif max_cake * cake_price == N or max_donut * donut_price == N:\n isJustN = True\nelse:\n for c in range(1, max_cake + 1):\n for d in range(1, max_donut + 1):\n total_price = cake_price * c + donut_price * d\n if total_price == N:\n isJustN = True\n break\n\nResult = ''\nResult = 'Yes' if isJustN == True else 'No'\nprint(Result)\n"] | ['Runtime Error', 'Accepted'] | ['s697651800', 's261916319'] | [3064.0, 3064.0] | [17.0, 17.0] | [515, 507] |
p03285 | u887207211 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\n\nfor i in range(26):\n for j in range(16):\n if(4*i + 7*j == N):\n print("Yes")\n break\nelse:\n print("No")', 'N = int(input())\nans = "No"\nfor i in range(26):\n for j in range(16):\n if(i*4+j*7 == N):\n ans = "Yes"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s716746816', 's279442807'] | [2940.0, 2940.0] | [17.0, 17.0] | [134, 120] |
p03285 | u890183245 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['import math\ncounter = False\nfor n in range (0,10):\n for i in range (math.ceil((n+1) / 4) ):\n for j in range (math.ceil((n+1) / 7) ):\n #print(n, i,j)\n if i*4 + j*7 == n:\n counter = True\n if counter == True:\n print("Yes")\n else:\n print("No")\n counter=False', 'import math\nn = int(input())\ncounter = False\n#for n in range (0,100):\n for i in range (math.ceil((n+1) / 4) ):\n for j in range (math.ceil((n+1) / 7) ):\n #print(n, i,j)\n if i*4 + j*7 == n:\n counter = True\n if counter == True:\n print("Yes")\n else:\n print("No")', 'import math\nn = int(input())\ncounter = False\n#for n in range (0,100):\n for i in range (math.ceil((n+1) / 4) ):\n for j in range (math.ceil((n+1) / 7) ):\n #print(n, i,j)\n if i*4 + j*7 == n:\n counter = True\n if counter == True:\n print("Yes")\n else:\n \tprint("No")', 'import math\nn = int(input())\ncounter = False\n#for n in range (0,100):\nfor i in range (math.ceil((n+1) / 4) ):\n for j in range (math.ceil((n+1) / 7) ):\n #print(n, i,j)\n if i*4 + j*7 == n:\n counter = True\nif counter == True:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s125310971', 's176441373', 's479985931', 's267922078'] | [3060.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [282, 287, 287, 270] |
p03285 | u890807039 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\ntemp = n\nwhile temp > 0:\n temp -= 7\n if temp%4 == 0:\n temp = 0\n break\nprint(temp)\nif n>=4 and (n%4 == 0 or n%7 == 0 or temp == 0):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nif n in [1,2,3,5,6,9,10,13,17]:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s778788031', 's929991095'] | [2940.0, 3060.0] | [17.0, 19.0] | [206, 87] |
p03285 | u891217808 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['#ABC 105 B\ndivisors = [4+i*7 for i in range(4)]\nbound_num = max(divisors)\nn = int(input())\nyes=[i*4 + j*7 for i in range(6) for j in range(6)]\nif n >= bound_num or n in yes:\n print("Yes")\nelse:\n print("No")\n \nprint(yes)\n', '#ABC 105 B\ndivisors = [4+i*7 for i in range(4)]\nbound_num = max(divisors)\nn = int(input())\nyes=[i*4 + j*7 for i in range(6) for j in range(6)]\nif n >= bound_num or n in yes:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s666566005', 's548845275'] | [2940.0, 2940.0] | [17.0, 17.0] | [229, 213] |
p03285 | u896791216 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\nans = "No"\nfor i in range(n // 4):\n for j in range(n // 7):\n if 4 * i + 7 * j == n:\n ans = "Yes"\n break\nprint(ans)', 'n = int(input())\nans = "No"\nfor i in range(n // 4 + 1):\n for j in range(n // 7 + 1):\n if 4 * i + 7 * j == n:\n ans = "Yes"\n break\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s944384692', 's041888808'] | [2940.0, 2940.0] | [17.0, 17.0] | [163, 171] |
p03285 | u902151549 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['import math\nn=int(input())\nfor a in range(math.floor(n/4)+1):\n if (n-a*4)%7==0:\n print("Yes")\n break\nprint("No")\n', 'import math\nn=int(input())\nfor a in range(math.floor(100/4)+1):\n for b in range(math.floor((100-a*4)/7)+1):\n if n==a*4+b*7:\n print("Yes")\n else:\n print("No")\n', 'import math\nn=int(input())\ncount=0\nwhile cakes*4+donuts*7<n:\n for a in range(math.floor(n/4)+1):\n if (n-a*4)%7==0:\n count+=1\nprint(count)\n', 'import math\nn=int(input())\nfor a in range(math.floor(n/4)+1):\n if (n-a*4)%7==0:\n print("Yes")\n quit()\nprint("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s032504408', 's153086208', 's361180731', 's998399700'] | [2940.0, 3060.0, 3188.0, 2940.0] | [17.0, 18.0, 18.0, 17.0] | [130, 197, 159, 131] |
p03285 | u903596281 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N=int(input())\nd=N//4\nfor i in range(d+1):\n if N-4*i%7==0:\n print("Yes")\n break\nelse:\n print("No")', 'N=int(input())\nd=N//4\nfor i in range(d+1):\n if (N-4*i)%7==0:\n print("Yes")\n break\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s296677761', 's560165656'] | [2940.0, 2940.0] | [17.0, 17.0] | [106, 108] |
p03285 | u903948194 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\n\ndef func(n):\n for k in range(N//4):\n for d in range(N//7):\n if 4 * k + 7 * d == N:\n return 'Yes'\n return 'No'\n\nprint(func(N))", "N = int(input())\n\ndef func(n):\n for k in range(N//4 + 1):\n for d in range(N//7 + 1):\n if 4 * k + 7 * d == N:\n return 'Yes'\n return 'No'\n\nprint(func(N))"] | ['Wrong Answer', 'Accepted'] | ['s114140670', 's103477392'] | [2940.0, 2940.0] | [18.0, 20.0] | [182, 190] |
p03285 | u909162870 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\na = 0\nwhile n >= 0:\n if n % 7 == 0:\n a += 1\n break\n n -= 4\n print(n)\nif a == 1:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\na = 0\nwhile n >= 0:\n if n % 7 == 0:\n a += 1\n break\n n -= 4\nif a == 1:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s682227050', 's724005492'] | [2940.0, 2940.0] | [17.0, 17.0] | [158, 145] |
p03285 | u911575040 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\nans="No"\nfor i in range(n+1):\n for j in range(n+1):\n if n-4*i-7*j == 0:\n ans+="Yes"\nprint(ans)', 'n = int(input())\nans="No"\nfor i in range(n+1):\n for j in range(n+1):\n if n-4*i-7*j == 0:\n ans="Yes"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s535525686', 's655065860'] | [2940.0, 2940.0] | [19.0, 19.0] | [132, 131] |
p03285 | u912650255 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\nans = 0\n\nfor i in range(N//4 + 1):\n for j in range(N//7 + 1):\n if i * 4 + j * 7 == N:\n ans += 1\nprint(ans)\n', "N = int(input())\nans = 0\n\nfor i in range(N//4 + 1):\n for j in range(N//7 + 1):\n if i * 4 + j * 7 == N:\n ans += 1\n\nif ans == 0:\n print('No')\nelse:\n print('Yes')\n"] | ['Wrong Answer', 'Accepted'] | ['s464636447', 's608847520'] | [2940.0, 2940.0] | [17.0, 17.0] | [145, 187] |
p03285 | u914797917 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\n\nM=N//7\n\nfor i in range(M):\n #print(N-i)\n if (N-i*7)%4==0:\n print('Yes')\n break\nelse:\n print('No')", "N = int(input())\n\nM=N//7\n\nflag=0\nfor i in range(M):\n #print(N-i)\n if (N-i*7)%4==0:\n flag=1\n break\nelse:\n if N==4 or N==7:\n flag=1\n\nprint('Yes' if flag==1 else 'No')", "N = int(input())\n\nM=N//7\n\nflag=0\nfor i in range(M+1):\n #print(N-i*7)\n if (N-i*7)%4==0:\n flag=1\n break\nelse:\n if N==4 or N==7:\n flag=1\n\nprint('Yes' if flag==1 else 'No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s440965865', 's473512056', 's212692178'] | [3060.0, 3060.0, 3060.0] | [19.0, 17.0, 17.0] | [124, 176, 180] |
p03285 | u919235786 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['x=int(input())\nt=0\nwhile x>0:\n if x%7==0:\n t+=1\n x-=4\nprint(t)', "x=int(input())\nt=0\nwhile x>=0:\n if x%7==0:\n t=1\n x-=4\nif t==0:\n print('No')\nelse: print('yes')", 'x=int(input())\nt=0\nwhile x>=0:\n if x%7==0:\n t+=1\n x-=4\nprint(t)', "x=int(input())\nt=0\nwhile x>=0:\n if x%7==0:\n t=1\n x-=4\nif t==0:\n print('No')\nelse: print('Yes')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s267714518', 's328514838', 's691706244', 's104891281'] | [2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 19.0] | [67, 100, 68, 100] |
p03285 | u920299620 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['import sys\nn=int(input())\nwhile(1):\n if(n%4=0):\n print("Yes")\n sys.exit()\n n-=7\n if(n<=3):\n break\nprint("No")', 'n=int(input())\nif(n==3):\n print("No")\nelif(n%4==0 or n%4==3):\n print("Yes"):\nelse:\n print("No")', 'import sys\nn=int(input())\nif(n%7==0):\n print("Yes")\n sys.exit(0)\nwhile(1):\n if(n%4==0):\n print("Yes")\n sys.exit(0)\n n-=7\n if(n<=3):\n break\nprint("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s440870346', 's836960500', 's246669778'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0] | [139, 98, 182] |
p03285 | u925567828 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\nans =0\nfor i in range(25):\n for j in range(int(100/7)):\n if(i*4+j*7 ==N):\n ans +=1\nprint(ans)\n ', 'N = int(input())\nans =0\nfor i in range(25):\n for j in range(int(100/7)):\n if(i*4+j*7 ==N):\n ans +=1\nif(ans >0):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s382685270', 's997933904'] | [2940.0, 2940.0] | [17.0, 18.0] | [140, 171] |
p03285 | u928385607 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\n\nk = 'NO'\n\nfor a in range(int(n/4)+1):\n\tfor b in range(int(n/7)+1):\n\t\tif 4*a + 7*b == n:\n\t\t\tk = 'YES'\n\t\t\tbreak\n\nprint(k)", "n = int(input())\n\nif n%4 != 0:\n\tn = int(n%7)\n\nif n != 0:\n\tn = int(n%4)\n\nif n == 0:\n\tprint('YES')\nelse:\n\tprint('NO')", "n = int(input())\n\nk = 'No'\n\na = 0\nb = 0\n\nwhile a < int(n/4):\n\twhile b < int(n/7):\n\t\tif 4*a + 7*b == n:\n\t\t\tk = 'Yes'\n\t\t\tbreak\n\t\tb += 1\n\ta += 1\n\na = 0\nb = 0\n\nif k == 'No':\n\twhile b < int(n/7):\n\t\twhile a < int(n/4):\n\t\t\tif 4*a + 7*b == n:\n\t\t\t\tk = 'Yes'\n\t\t\t\tbreak\n\t\t\ta += 1\n\t\tb += 1\n\n\nprint(k)", "n = int(input())\n\na = n % 11\nb = n % 7\nc = n % 4\n\nif n <= 3:\n\tprint('NO')\nelif a == 0 or a == 3 or b == 0 or b == 4 or c == 0 or c == 3:\n\tprint('YES')\nelse:\n\tprint('NO')", "n = int(input())\n\nans = 'No'\n\na = 0\nb = 0\n\nfor i in range(int(n/4)+1):\n\tfor i in range(int(n/7)+1):\n\t\tif 4*a + 7*b == n:\n\t\t\tans = 'Yes'\n\t\t\tbreak\n\nprint(ans)", "n = int(input())\n\nans = 'No'\n\na = 0\nb = 0\n\nfor a in range(int(n/4)+1):\n\tfor b in range(int(n/7)+1):\n\t\tif 4*a + 7*b == n:\n\t\t\tans = 'Yes'\n\t\t\tbreak\n\nprint(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s395871811', 's423282734', 's510306003', 's510916218', 's520695148', 's538142265'] | [2940.0, 3316.0, 3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 21.0, 17.0, 17.0, 17.0, 18.0] | [137, 115, 288, 169, 156, 156] |
p03285 | u928784113 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['# -*- coding: utf-8 -*-\nN = int(input())\ni = 1\nwhile N>4:\n N = N - i*7\n if N % 4 == 0:\n print("Yes")\n else:\n i = i+1\n continue\nprint("No")\n ', 'N = int(input())\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j == N:\n print("Yes")\n exit()\n\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s886669467', 's144863979'] | [2940.0, 2940.0] | [18.0, 20.0] | [153, 142] |
p03285 | u931462344 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['# coding: utf-8\n\nn = int(input())\nif n%4 == 0 or n%7 == 0 or n%4%7 == 0:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nif n%4%7 == 0:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nfor c in range(0, 100//4):\n for d in range(0, 100//7):\n if n == 4*c + 7*d:\n print("Yes")\n exit(0)\nprint("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s224507177', 's834974471', 's540439845'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [111, 66, 158] |
p03285 | u933723514 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\nif n % 7 == 0 or n % 4 == 0:\n print("Yes")\nelif (n % 28) % 4 == 0 or (n % 28) % 7 == 0:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nfor x in range (0, int(n/7)):\n if (n - 7*x)%4 == 0:\n print("Yes")\n exit()\nprint("No")', 'n = int(input())\na = n//7 +1\nfor x in range (0, a):\n if (n - 7*x)%4 == 0:\n print("Yes")\n exit()\nprint("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s053396230', 's288210696', 's981198260'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [143, 119, 124] |
p03285 | u934529721 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\n\nfor x in range(0,n):\n for y in range(0,n):\n if 4*x + 7*y == n:\n result="Yes"\n else:\n result="No"\n \n \nprint(result)\n ', 'N = int(input())\n\nfor x in range(N):\n for y in range(N):\n if x*4 + y*7 == N:\n flag = True\n else:\n flag = False\n \n\nprint("Yes") if flag else print("No")', 'N = int(input())\n\nfor x in range(N//2):\n for y in range(N//2):\n if x*4 + y*7 == N:\n flag = True\n else:\n flag = False\n \n\nprint("Yes") if flag else print("No")', 'N = int(input())\n\ncount = 0\n\nfor x in range(0,N):\n for y in range(0,N):\n if x*4 + y*7 == N:\n count += 1\n \n \n \n\nprint("No") if count == 0 else print("Yes")'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s138565560', 's229852074', 's581514739', 's631162377'] | [2940.0, 2940.0, 3064.0, 3060.0] | [19.0, 19.0, 18.0, 18.0] | [202, 201, 207, 207] |
p03285 | u935470283 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\n\ncount = 0\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j == N:\n print("Yes")\n print(i,j)\n count += 1\nif count == 0:\n print("No")\n', 'N = int(input())\n\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j == N:\n print("Yes")\n else:\n print("No")\n\n', 'N = int(input())\n\ncount = 0\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j == N:\n \tcount = 1\nif count == 1:\n print("Yes")\nelse:\n\tprint("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s068467066', 's468006107', 's663405747'] | [2940.0, 3060.0, 2940.0] | [17.0, 18.0, 18.0] | [199, 129, 167] |
p03285 | u936985471 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n=int(input())\nm=n//4+1\nans=False\nif m%7==0:\n ans=True\nelse:\n for i in range(1,m):\n if (i*4)%7==0:\n ans=True\n break\nprint(("No","Yes")[ans])', 'n=int(input())\nans=False\nfor i in range(100//4+1):\n if 4*i>n:\n break\n for j in range(100//7+1):\n if 4*i+7*j>n:\n break\n elif 4*i+7*j==n:\n ans=True\n break\n \nprint(("No","Yes")[ans])'] | ['Wrong Answer', 'Accepted'] | ['s507853811', 's296962048'] | [3060.0, 2940.0] | [17.0, 17.0] | [155, 208] |
p03285 | u938486382 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["a = int(input())\nflag = True\nwhile a > 7 and flag:\n if a % 4 == 0:\n print('YES')\n flag = False\n a -= 7\nif flag:\n print('YES' if a == 4 or a == 7 else 'NO')", "a = int(input())\nflag = False\nfor nana in range(15):\n for yon in range(26):\n if 7 * nana + 4 * yon == a:\n flag = True\nprint('Yes' if flag else 'No')"] | ['Wrong Answer', 'Accepted'] | ['s356571876', 's381904907'] | [2940.0, 2940.0] | [17.0, 17.0] | [178, 169] |
p03285 | u940102677 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n=int(input())\nprint("YES" if n>=7*((-n)%4) else "NO")', 'n=int(input())\nprint("Yes" if n>=7*((-n)%4) else "No")'] | ['Wrong Answer', 'Accepted'] | ['s846100529', 's702388078'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 54] |
p03285 | u940117191 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\nfor x in range(100 // 4 + 1):\n answer = 'no'\n for y in range(100 // 7 + 1):\n if 4 * x + 7 * y == N:\n print('yes')\n answer = 'yes'\n break\n if answer == 'yes':\n break\nprint('no')", "N = int(input())\nfor x in range(N // 4 + 1):\n if (N - 4 * x) % 7 == 0:\n print('Yes')\n break\nprint('No')", "N = int(input())\nfor x in range(N // 4 + 1):\n answer = 'no'\n for y in range(N // 7 + 1):\n if 4 * x + 7 * y == N:\n answer = 'yes'\n break\n if answer == 'yes':\n break\nprint(answer)", "N = int(input())\nanswer = 'No'\nfor x in range(N // 4 + 1):\n if (N - 4 * x) % 7 == 0:\n answer = 'Yes'\n break\nprint(answer)"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s167593167', 's240021126', 's317751961', 's408662185'] | [2940.0, 2940.0, 3064.0, 2940.0] | [18.0, 17.0, 18.0, 17.0] | [217, 110, 196, 138] |
p03285 | u941047297 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\nfor i in range(n + 1, 4):\n if (n - i) % 7 == 0:\n print('Yes')\n exit()\nprint('No')", "n = int(input())\nfor i in range(0, n + 1, 4):\n print(i)\n if (n - i) % 7 == 0:\n print('Yes')\n exit()\nprint('No')", "def main():\n n = int(input())\n for i in range(0, n + 1, 7):\n if (n - i) % 4 == 0:\n print('Yes')\n break\n else:\n print('No')\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s167611559', 's736922948', 's257764777'] | [2940.0, 2940.0, 9076.0] | [19.0, 18.0, 28.0] | [115, 131, 208] |
p03285 | u941644149 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['def Cakes_and_Donuts(N):\n CP = 4\n DP = 7\n \n if N <= 3:\n return f"No"\n \n for i in range(26):\n for j in range(15):\n if (CP * i + DP * j) == N:\n return f"Yes"\n \n return f"No"\n \n N = int(input())\n Cakes_and_Donuts(N)', 'def Cakes_and_Donuts(N):\n CP = 4\n DP = 7\n \n if N <= 3:\n return f"No"\n \n for i in range(26):\n for j in range(15):\n if (CP * i + DP * j) == N:\n return f"Yes"\n \n return f"No"', 'def Cakes_and_Donuts(N):\n \n CP = 4\n DP = 7\n \n if N <= 3:\n return "No"\n \n for i in range(26):\n for j in range(15):\n if (CP * i + DP * j) == N:\n return "Yes"\n return "No"\n \n \nN = int(input())\nCakes_and_Donuts(N)', 'def main(N):\n \n CP = 4\n DP = 7\n \n if N <= 3:\n return "No"\n \n for i in range(100):\n for j in range(100):\n if (CP * i + DP * j) == N:\n print(i,j)\n return "Yes"\n return "No"\n\nN = int(input())\nprint(main(N))\n', 'def main(N):\n CP = 4\n DP = 7\n \n if N <= 3:\n return f"No"\n \n for i in range(26):\n for j in range(15):\n if (CP * i + DP * j) == N:\n return f"Yes"\n \n return f"No"\n ', 'def main(N):\n \n CP = 4\n DP = 7\n \n if N <= 3:\n return "No"\n \n for i in range(100):\n for j in range(100):\n if (CP * i + DP * j) == N:\n return "Yes"\n return "No"\nN = int(input())\nprint(main(N))'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s092493184', 's452514368', 's633851131', 's815407673', 's983040457', 's376719051'] | [2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 18.0] | [279, 235, 273, 281, 226, 252] |
p03285 | u953794676 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["import sys\n\n\nCAKE = 4\nDOUNAT = 7\n\n\ndef check_amount(i, j, n):\n return i*4 + j*7 == n\n\n\nn = int(input())\ncount = 0\nfor i in range(int(n/CAKE+1)):\n for j in range(int(n/DOUNAT+1)):\n print(i, j)\n if check_amount(i, j, n):\n print('Yes')\n sys.exit()\nprint('No')", "import sys\n\n\nCAKE = 4\nDOUNAT = 7\n\n\ndef check_amount(i, j, n):\n return i*4 + j*7 == n\n\n\nn = int(input())\ncount = 0\nfor i in range(int(n/CAKE+1)):\n for j in range(int(n/DOUNAT+1)):\n if check_amount(i, j, n):\n print('Yes')\n sys.exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s383169228', 's748568893'] | [3060.0, 3060.0] | [17.0, 17.0] | [298, 278] |
p03285 | u955251526 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\nx = n // 7\ny = n //4\nfor i in range(x+1):\n for j in range(y+1):\n if i*7 + j*4 == n:\n print('YES')\n exit()\nprint('NO')\n", "n = int(input())\nx = n // 7\ny = n //4\nfor i in range(x+1):\n for j in range(y+1):\n if i*7 + j*4 == n:\n print('Yes')\n exit()\nprint('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s746340009', 's563589458'] | [2940.0, 2940.0] | [17.0, 18.0] | [167, 167] |
p03285 | u959981943 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\n\nif N in [1, 2, 3, 5, 6, 9, 10, 13, 17]:\n print('Yes')\nelse:\n print('No')\n", "N = int(input())\n\nif N in [1, 2, 3, 5, 6, 9, 10, 13, 17]:\n print('No')\nelse:\n print('Yes')\n"] | ['Wrong Answer', 'Accepted'] | ['s751380373', 's913611266'] | [2940.0, 2940.0] | [17.0, 17.0] | [97, 97] |
p03285 | u960171798 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\ns = (N//4 +1)\nfor i in range(s):\n for j in range(s):\n if 4*i+7*j == N:\n print("Yes")\n else:\n print("No")', 'N = int(input())\nans = 0\nbuy = N//4 + 1\nfor i in range(buy):\n for j in range(buy):\n if 4*i+7*j == N:\n ans += 1\nprint("Yes" if ans!=0 else "No")'] | ['Wrong Answer', 'Accepted'] | ['s292519125', 's874377922'] | [3060.0, 3060.0] | [19.0, 18.0] | [138, 152] |
p03285 | u964494353 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\nm = n // 7\na = n % 7\nif a == 0:\n print('Yes')\nelse:\n if m == 0 and n == 4:\n print('Yes')\n for i in range(m):\n if (n - (i + 1) * 7) % 4 == 0:\n print('Yes')\n print('No')", "n = int(input())\nm = n // 7\na = n % 7\nif a == 0:\n print('Yes')\n exit()\nelse:\n for i in range(m+1):\n if (n - i * 7) % 4 == 0:\n print('Yes')\n exit()\n print('No')", "n = int(input())\nm = n // 7\na = n % 7\nif a == 0:\n print('Yes')\n exit()\nelse:\n for i in range(m+1):\n if (n - i * 7) % 4 == 0:\n print('Yes')\n exit()\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s803885971', 's867849497', 's523990045'] | [3060.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [221, 196, 200] |
p03285 | u969848070 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["a = int(input())\nb = a%7\nb = a%4\n\nc = a%4\nc = c%7\nif b == 0:\n print('Yes')\nelif c ==0:\n print('Yes')\nelse:\n print('No')", "a = int(input())\na = a%4\na = a%7\nif a == 0:\n print('Yes')\nelse:\n print('No')", "n = int(input())\nfor i in range(n//4 +1):\n if (n - 4 * i) % 7 == 0:\n print('Yes')\n exit()\nprint('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s495770465', 's779081685', 's294013449'] | [9128.0, 9072.0, 9088.0] | [41.0, 30.0, 27.0] | [122, 78, 108] |
p03285 | u970197315 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\n\nif n%4 == 0 or n%7 == 0:\n print("Yes")\nelse:\n print("No")', '# ABC105 B - Cakes and Donuts\nn = int(input())\n \ncount = 0\n\nfor x in range(0,n):\n for y in range(0,n):\n if x*4 + y*7 == n:\n count += 1\n\nprint("No") if count == 0 else print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s100471875', 's381354774'] | [2940.0, 2940.0] | [17.0, 18.0] | [81, 200] |
p03285 | u972658925 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\n\nC = N//4\nD = N//7\ncount = 0\nfor c in range(1,C):\n for d in range(1,D):\n if (4*c) + (7*d) == N:\n count += 1\n\nif count > 0:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\n\nC = N//4\nD = N//7\ncount = 0\nfor c in range(0,C+1):\n for d in range(0,D+1):\n if (4*c) + (7*d) == N:\n count += 1\n\nif count > 0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s658767906', 's621944836'] | [3064.0, 3060.0] | [17.0, 17.0] | [199, 203] |
p03285 | u973046188 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["N = int(input())\nimport numpy as np\na = np.array((26,15))\nfor i in range(26):\n for j in range(15):\n a[i][j] = 4 * i + 7 * j\n\nif N in a:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nimport numpy as np\na = np.empty((26,15))\nfor i in range(26):\n for j in range(15):\n a[i][j] = 4 * i + 7 * j\n\nif N in a:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s129000194', 's281684546'] | [18892.0, 22564.0] | [1332.0, 1698.0] | [174, 174] |
p03285 | u975966195 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n = int(input())\n\nfor i in range(n // 4):\n for j in range(n // 7):\n if i * 4 + j * 7 == n:\n print('Yes')\n exit()\nprint('No')\n", "n = int(input())\n\nfor i in range(n // 4 + 1):\n for j in range(n // 7 + 1):\n if i * 4 + j * 7 == n:\n print('Yes')\n exit()\nprint('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s053411678', 's011612964'] | [2940.0, 2940.0] | [17.0, 17.0] | [157, 165] |
p03285 | u976162616 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['if __name__ == "__main__":\n N = input()\n for x in range(0, 100):\n y = N - 4 * x\n if y % 7 == 0:\n print ("Yes")\n exit(0)\n print ("No")', 'if __name__ == "__main__":\n N = int(input())\n for x in range(0, 100):\n y = N - 4 * x\n if y < 0:\n break\n if y % 7 == 0:\n print ("Yes")\n exit(0)\n print ("No")'] | ['Runtime Error', 'Accepted'] | ['s558956257', 's708085350'] | [2940.0, 3060.0] | [17.0, 17.0] | [178, 219] |
p03285 | u977349332 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\nanswer = "No"\n\nfor x in range(N/4+1):\n\tfor y in range(N/7+1):\n \t\tif(4*x + 7*y == N):\n \t\tanswer = "Yes"\n \t\tbreak\n ', 'N = int(input())\n\nfor x in range(N/4)\n\tfor y in range(N/7)\n \t\tif(4*x + 7*y ==)\n \t\tprint("Yes")\n \t\tbreak\n ', 'N = int(input())\nanswer = "No"\ncake = N//4\nnut = N//7\n\nfor x in range(cake+1):\n for y in range(nut+1):\n if 4*x + 7*y == N:\n answer = "Yes"', 'N = int(input())\nanswer = "No"\ncake = N//4 + 1\nnut = N//7 + 1\n\nfor x in range(cake):\n for y in range(nut):\n if 4*x + 7*y == N:\n answer = "Yes"', 'N = int(input())\nanswer = "No"\ncake = N//4\nnut = N//7\n\nfor x in range(cake+1):\n for y in range(nut+1):\n if 4*x + 7*y == N:\n answer = "Yes"\n\nprint(answer)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s123711232', 's421855784', 's685147344', 's872247902', 's115939659'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [18.0, 18.0, 18.0, 17.0, 17.0] | [141, 116, 147, 151, 162] |
p03285 | u983918956 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['N = int(input())\n# N = 4n+7m \nif N % 4 == 0 or N % 7 ==0 or N % == 4:\n print("Yes")\nelse:\n print("No")\n\n', 'N = int(input())\n# N = 4n+7m \nif N % 4 == 0 or N % 7 ==\u30000 or N % 7 == 4:\n print("Yes")\nelse:\n print("No")\n\n', 'N = int(input())\nm = 0\nfor i in range(15):\n n = N-7*m\n if n < 0:\n print("No")\n break\n elif n % 4 == 0:\n print("Yes")\n break\n elif m == 14:\n print("No")\n m += 1'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s690486974', 's993391495', 's231988617'] | [2940.0, 3188.0, 2940.0] | [17.0, 19.0, 17.0] | [106, 111, 179] |
p03285 | u989345508 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['\n\nfrom itertools import dropwhile\nfrom collections import deque\nn=int(input())\nans=deque([["",n]])\ndef bfs(d):\n global ans\n l=len(ans)\n for i in range(l):\n x=ans.popleft()\n new1=[x[0]+"0",x[1]]\n if abs(new1[1])<abs((-2)**d):\n ans.append(new1)\n new2=[x[0]+"1",x[1]-(-2)**d]\n if abs(new2[1])<abs((-2)**d):\n ans.append(new2)\n if d!=0:\n bfs(d-1)\nbfs(30)\n\n\nfor i in ans:\n if i[1]==0:\n ans=list(dropwhile(lambda x:x=="0",i[0]))\n if len(ans)==0:\n print(0)\n else:\n print("".join(ans))\n break', 'n=int(input())\nfor i in range(n//7+1):\n if (n-i*7)%4==0:\n print("Yes")\n break\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s236585236', 's819632657'] | [3316.0, 2940.0] | [23.0, 17.0] | [681, 116] |
p03285 | u994521204 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ["n=int(input())\nfor i in range(n//4+1):\n for j in range(n//7+1):\n if 4*i+7*j==n:\n print('Yes')\n else:\n print('No')", "n=int(input())\nflag=0\nfor i in range(n//4+2):\n for j in range(n//7+2):\n if 4*i+7*j==n:\n flag+=1\n else:\n flag+=0\nif flag!=0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s380873530', 's785512097'] | [3060.0, 2940.0] | [17.0, 17.0] | [130, 175] |
p03285 | u995062424 | 2,000 | 1,048,576 | _La Confiserie d'ABC_ sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes. | ['n = int(input())\n\nfor i in range(1, 26):\n for j in range(1, 16):\n if(4*i+7*j==n):\n print("Yes")\n break\nelse:\n print("No")', 'n = int(input())\nflg=False\n\nfor i in range(0, 26):\n for j in range(0, 16):\n if(4*i+7*j==n):\n flg = True\n break\nprint("Yes" if flg else "No")'] | ['Wrong Answer', 'Accepted'] | ['s266425377', 's975640763'] | [3064.0, 3060.0] | [17.0, 18.0] | [156, 172] |
p03286 | u004025573 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ["N = int(input())\n\nif N==0:\n print(0)\nelse:\n ans = []\n \n while N!=0:\n now = str(N%2)\n ans.append(now)\n N = -1*(N//2)\n \n print(''.join(ans))", "N = int(input())\n\nif N==0:\n print(0)\nelse:\n ans = []\n \n while N!=0:\n now = str(N%2)\n ans.append(now)\n N = -1*(N//2)\n ans.reverse()\n print(''.join(ans))"] | ['Wrong Answer', 'Accepted'] | ['s126630959', 's186105475'] | [3060.0, 2940.0] | [17.0, 18.0] | [177, 190] |
p03286 | u006425112 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['n = int(input())\n\nans = ""\nwhile n != 0:\n rest = n % 2\n if rest == 1:\n ans += "1"\n else:\n ans += "0"\n\n n = (n - rest) // -2\n\nif ans == "":\n ans += "0"\n\nprint(ans)', 'n = int(input())\n\nans = ""\nwhile n != 0:\n rest = n % 2\n if rest == 1:\n ans += "1"\n else:\n ans += "0"\n\n n = (n - rest) // -2\n\nif ans == "":\n ans += "0"\n\nprint(reversed(ans))', 'n = int(input())\n\nans = ""\nwhile n != 0:\n rest = n % 2\n if rest == 1:\n ans += "1"\n else:\n ans += "0"\n\n n = (n - rest) // -2\n\nif ans == "":\n ans += "0"\n\nprint(ans[::-1])'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s570203625', 's855619611', 's500588522'] | [3060.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [191, 201, 197] |
p03286 | u020373088 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['n = int(input())\ns = ""\n\nwhile n != 0:\n s = str(n%(-2)) + s\n n = n // (-2)\n \nif s == "":\n print("0")\nelse:\n print(s)', 'n = int(input())\ns = ""\n\nwhile n != 0:\n if n % (-2) == 0:\n s = "0" + s\n else:\n s = "1" + s\n n -= 1\n n = n / (-2)\n \nif s == "":\n print("0")\nelse:\n print(s)'] | ['Wrong Answer', 'Accepted'] | ['s950012352', 's452653311'] | [2940.0, 2940.0] | [20.0, 19.0] | [121, 169] |
p03286 | u020390084 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['import math\n\nn = int(input())\nnn = math.floor(math.log2(abs(n)))\nketa = 0\nunder = 0\ns = ""\n\nif n > 0:\n if n <= sum([2**i for i in range(0,nn+1,2)]):\n keta = nn+1\n under = sum([2**i for i in range(0,nn,2)])\n else:\n keta = nn+3\n under = sum([2**i for i in range(0,nn+1,2)])\n\n for i in range(1,keta):\n remainder = (n-under)%(2**i)\n if remainder in range(1,2**(i-1)+1):\n s += "0" if i%2==1 else "1"\n else:\n s += "1" if i%2==1 else "0"\n else:\n s+="1"\n print(s[::-1])\n\nelif n < 0:\n if n >= sum([(-2)**i for i in range(1,nn+1,2)]):\n keta = 2*(nn)\n under = sum([(-2)**i for i in range(1,nn-1,2)])\n else:\n keta = 2*(nn+1)\n under = sum([(-2)**i for i in range(1,nn+1,2)])\n for i in range(1,keta):\n remainder = abs(n-under)%(2**i)\n if remainder in range(1,2**(i-1)+1):\n s += "1" if i%2==1 else "0"\n else:\n s += "0" if i%2==1 else "1"\n else:\n s+="1"\n print(s[::-1])\n\nelse:\n print(0)\n\n\n', "n = int(input())\nfor i in range(2**n):\n a = list(format(i,'b'))[::-1]\n \n summ = 0\n for index,aa in enumerate(a):\n summ += int(aa)*((-2)**index)\n\n if summ == n:\n print(format(i,'b'))\n break\n", '#!/usr/bin/env python3\nimport sys\nfrom math import ceil\n\ndef solve(N: int):\n if N == 0:\n print(0)\n return \n\n answer = ""\n while N != 0:\n syou = ceil(N/-2) \n amari = N-syou*-2\n\n answer+= str(amari)\n N = syou\n \n print(answer[::-1])\n\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) # type: int\n solve(N)\n\nif __name__ == \'__main__\':\n main()\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s019587228', 's139001923', 's830426299'] | [3188.0, 193840.0, 3060.0] | [18.0, 2106.0, 17.0] | [1062, 225, 556] |
p03286 | u021548497 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['from collections import deque\nimport sys\nn = int(input())\nk = 1\nif n < 0:\n k = 0\n n = -n\nif n == 0:\n print(0)\n sys.exit()\nans = deque([])\nwhile n > 0:\n if n % 2 == 0:\n ans.appendleft("0")\n else:\n ans.appendleft("1")\n n = n // 2\nif k:\n print(int("".join(ans)))\nelse:\n print(int("-"+"".join(ans)))', 'from collections import deque\nn = int(input())\nans = deque([])\nwhile n > 0:\n if n % 2 == 0:\n ans.appendleft(0)\n else:\n ans.appendleft(1)\n n = n // 2\nprint("".join(ans))', 'n = int(input())\nkey = []\nif n%2:\n key.append("1")\n n -= 1\nelse:\n key.append("0")\n\nbef_p, bef_q = 0, 0\nn //= 2\nwhile n:\n k_p, k_q = (n//2)%2, n%2\n if k_p == 0:\n if k_q == 0:\n key.append("0")\n key.append("0")\n bef_p, bef_q = 0, 0\n else: \n key.append("1")\n key.append("1")\n bef_p, bef_q = 0, 0 \n else:\n if k_q == 0:\n key.append("0")\n key.append("1")\n bef_p, bef_q = 0, 0\n else:\n key.append("1")\n key.append("0")\n bef_p, bef_q = 1, 1\n n //= 4\n n = n + bef_p*2-bef_q\nkey.reverse()\nprint(int("".join(key)))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s454106338', 's582172768', 's264602531'] | [3316.0, 3316.0, 3064.0] | [21.0, 21.0, 18.0] | [336, 191, 592] |
p03286 | u028973125 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['import sys\n \nN = int(sys.stdin.readline())\nif N == 0:\n print(0)\n sys.exit()\nbinN = ""\npN = abs(N)\nwhile N != 0:\n if abs(N % -2) == 1:\n binN += "1"\n else:\n binN += "0"\n N //= -2\nprint(binN[::-1])', 'import sys\n \nN = int(sys.stdin.readline())\nif N == 0:\n print(0)\n sys.exit()\nbinN = ""\npN = abs(N)\nwhile N != 0:\n if abs(N % -2) == 1:\n binN += "1"\n else:\n binN += "0"\n N += N%(-2)\n N //= -2\nprint(binN[::-1])'] | ['Wrong Answer', 'Accepted'] | ['s327967347', 's564888357'] | [9176.0, 9176.0] | [31.0, 30.0] | [223, 239] |
p03286 | u033183216 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['def base2_number(n):\n result = ""\n while True:\n print(n)\n rem = n % 2\n if rem:\n n -= 1\n n = n // -2\n result += str(abs(rem))\n if n == 0:\n break\n return int(result[::-1])\nn = int(input())\nprint(base2_number(n))\n', 'def base2_number(n):\n result = ""\n while True:\n rem = n % 2\n if rem:\n n -= 1\n n = n // -2\n result += str(abs(rem))\n if n == 0:\n break\n return int(result[::-1])\nn = int(input())\nprint(base2_number(n))\n'] | ['Wrong Answer', 'Accepted'] | ['s933913862', 's334844537'] | [3060.0, 2940.0] | [17.0, 17.0] | [283, 266] |
p03286 | u037430802 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['def getBaseM2Num(n):\n if n == 0:\n return 0\n \n \n base = 1\n b2 = []\n while n != 0:\n if n % (2*base) == 0:\n \n b2.insert(0,"0")\n else:\n \n b2.insert(0,"1")\n n -= base\n \n base *= -2\n print(b2) \n return "".join(b2)\n\nn = int(input())\nprint(getBaseM2Num(n))', 'N = int(input())\n\nans = ""\n\nif N == 0:\n print(0)\n exit()\n\nwhile N != 0:\n \n if N % -2 == 0:\n ans = "0" + ans\n else:\n ans = "1" + ans\n tmp = abs(N % -2)\n #print(N, tmp)\n N = (N-tmp) // -2\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s324797436', 's768272668'] | [3064.0, 2940.0] | [17.0, 20.0] | [433, 236] |
p03286 | u044635590 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['n = int(input())\nk = 1\nkotae = []\nkotae2 = []\n\nif n != 0:\n while n != 0:\n if n % ((-2) ** k) == 0:\n kotae.append(0)\n else:\n kotae.append(1)\n n = n - ((-2) ** (k - 1))\n k = k + 1\n\n for i in kotae[::-1]:\n kotae2.append(i)\n\n print("".join(kotae2))\nelse:\n print(0)', 'n = int(input())\nk = 1\nkotae = []\nkotae2 = []\n\nif n != 0:\n while n != 0:\n if n % ((-2) ** k) == 0:\n kotae.append(0)\n else:\n kotae.append(1)\n n = n - ((-2) ** (k - 1))\n k = k + 1\n\n for i in kotae[::-1]:\n kotae2.append(str(i))\n\n print("".join(kotae2))\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s845701923', 's778239408'] | [3060.0, 3064.0] | [17.0, 17.0] | [333, 338] |
p03286 | u055941944 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ["n = int(input())\nx = ''\n\nwhile n!=0:\n\tx=str(n%2)+x\n\tn = -(n//2)\n\tprint(x)\nif x=='':\n\tprint(0)\nelse:\n\tprint(x)", "n = int(input())\nx = ''\n\nwhile n!=0:\n\tx=str(n%2)+x\n\tn = -(n//2)\nif x=='':\n\tprint(0)\nelse:\n\tprint(x)"] | ['Wrong Answer', 'Accepted'] | ['s749393293', 's235088464'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 99] |
p03286 | u057109575 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ["x = int(input())\nans = []\nwhile abs(x) > 1:\n ans.append(abs(x % -2))\n x //= -2\nprint(''.join([str(i) for i in ans + [abs(x)]]))", "N = int(input())\nans = ''\nwhile abs(N) > 0:\n ans = str(N % 2) + ans\n N = -(N // 2)\nprint(ans or 0)"] | ['Wrong Answer', 'Accepted'] | ['s480416225', 's281183350'] | [2940.0, 2940.0] | [17.0, 17.0] | [133, 104] |
p03286 | u059210959 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['#encoding utf-8\n\nn = int(input())\nanswer = ""\n\ndef kenzan(ans):\n val = 0\n ans.reverse()\n for i in range(len(ans)):\n val += answer[i]*(-2)**i\n return int(val)\n\ni = 1\n\nwhile(n != 0):\n if n % 2 == 0:\n answer = "0" + answer\n else:\n answer = "1" + answer\n n -= 1\n n /= 2\nif answer == "":\n answer = 0\nprint(answer)\n\n', '#encoding utf-8\n\nn = int(input())\nm=n\nanswer = []\n\ndef kenzan(ans):\n val = 0\n for i in range(len(ans)):\n val += answer[i]*(-2)**i\n return int(val)\n\ni = 1\nwhile(n != 0):\n print(n)\n if n % (2**i) == 0:\n answer.append(0)\n else:\n answer.append(1)\n n = n-((-2)**(i-1))\n i += 1\nanswer.reverse()\nprint("".join(str(i) for i in answer))', '#encoding utf-8\n\nn = int(input())\nanswer = ""\n\ndef kenzan(ans):\n val = 0\n ans.reverse()\n for i in range(len(ans)):\n val += answer[i]*(-2)**i\n return int(val)\n\ni = 1\n\nwhile(n != 0):\n if n % 2 == 0:\n answer = "0" + answer\n else:\n answer = "1" + answer\n n -= 1\n n /= -2\nif answer == "":\n answer = 0\nprint(answer)\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s303310011', 's784544494', 's231704642'] | [3764.0, 3064.0, 3060.0] | [2104.0, 17.0, 17.0] | [385, 376, 386] |
p03286 | u069838609 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ["from math import floor, ceil, log\n\nN = int(input())\n\n# O(logN)\ndef base10to(n, b):\n if n // b > 0:\n return base10to(n // b, b) + str(n % b)\n else:\n return str(n % b)\n\ndef calc_base_for_pos_N(N):\n S_base4 = base10to(N, 4) # str\n\n S_raw = list(map(int, tuple(''.join([digit + '0' for digit in S_base4])[:-1])))[::-1]\n\n # transformation. takes O(logN)\n position = 0\n while position <= len(S_raw) - 3:\n digit = S_raw[position]\n \n if position % 2 == 1:\n position += 1\n continue\n if digit in {0, 1}:\n position += 1\n continue\n elif digit == 2:\n S_raw[position] = 0\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n elif digit == 3:\n S_raw[position] = 1\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n else: #4\n S_raw[position] = 0\n S_raw[position + 2] += 1\n position += 2\n\n # postprocessing\n if S_raw[-1] == 2:\n S_raw[-1] = 0\n S_raw += [1, 1]\n elif S_raw[-1] == 3:\n S_raw[-1] = 1\n S_raw += [1, 1]\n elif S_raw[-1] == 4:\n S_raw[-1] = 0\n S_raw += [0, 1]\n\n S = ''.join([str(digit) for digit in S_raw])[::-1]\n return S\n\nif N >= 0:\n print(calc_base_for_pos_N(N))\nelse:\n pos_N = abs(N)\n pos_S = list(map(int, list(calc_base_for_pos_N(pos_N))))\n print(pos_S)\n pos_S = pos_S[::-1]\n shifted_S = [0] + pos_S\n pos_S = pos_S + [0]\n assert len(pos_S) == len(shifted_S)\n S_raw = [shifted_S[i] + pos_S[i] for i in range(len(pos_S))]\n position = 0\n while position <= len(S_raw) - 3:\n digit = S_raw[position]\n if digit in {0, 1}:\n position += 1\n continue\n elif digit == 2:\n S_raw[position] = 0\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n elif digit == 3:\n S_raw[position] = 1\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n else: #4\n S_raw[position] = 0\n S_raw[position + 2] = 1\n position += 1\n # postprocessing\n last_two_digits = S_raw[-2:]\n if last_two_digits == [2, 1]:\n S_raw = S_raw[:-2]\n elif last_two_digits == [3, 1]:\n S_raw[-2:] = [1]\n elif last_two_digits == [1, 2]:\n S_raw[-2:] = [1, 0, 1, 1]\n elif last_two_digits == [2, 2]:\n S_raw[-2:] = [0, 1]\n elif last_two_digits == [3, 2]:\n S_raw[-2:] = [1, 1]\n elif last_two_digits == [4, 1]:\n S_raw[-2:] = [0, 0, 1]\n elif last_two_digits == [4, 2]:\n S_raw = S_raw[:-2]\n S = ''.join([str(digit) for digit in S_raw])[::-1]\n print(S)\n", "from math import floor, ceil, log\n\nN = int(input())\n\n# O(logN)\ndef base10to(n, b):\n if n // b > 0:\n return base10to(n // b, b) + str(n % b)\n else:\n return str(n % b)\n\ndef calc_base_for_pos_N(N):\n S_base4 = base10to(N, 4) # str\n\n S_raw = list(map(int, tuple(''.join([digit + '0' for digit in S_base4])[:-1])))[::-1]\n\n # transformation. takes O(logN)\n position = 0\n while position <= len(S_raw) - 3:\n digit = S_raw[position]\n \n if position % 2 == 1:\n position += 1\n continue\n if digit in {0, 1}:\n position += 1\n continue\n elif digit == 2:\n S_raw[position] = 0\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n elif digit == 3:\n S_raw[position] = 1\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n else: #4\n S_raw[position] = 0\n S_raw[position + 2] += 1\n position += 2\n\n # postprocessing\n if S_raw[-1] == 2:\n S_raw[-1] = 0\n S_raw += [1, 1]\n elif S_raw[-1] == 3:\n S_raw[-1] = 1\n S_raw += [1, 1]\n elif S_raw[-1] == 4:\n S_raw[-1] = 0\n S_raw += [0, 1]\n\n S = ''.join([str(digit) for digit in S_raw])[::-1]\n return S\n\nif N >= 0:\n print(calc_base_for_pos_N(N))\nelse:\n pos_N = abs(N)\n pos_S = list(map(int, list(calc_base_for_pos_N(pos_N))))\n pos_S = pos_S[::-1]\n shifted_S = [0] + pos_S\n pos_S = pos_S + [0]\n assert len(pos_S) == len(shifted_S)\n S_raw = [shifted_S[i] + pos_S[i] for i in range(len(pos_S))]\n position = 0\n while position <= len(S_raw) - 3:\n digit = S_raw[position]\n if digit in {0, 1}:\n position += 1\n continue\n elif digit == 2:\n S_raw[position] = 0\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n elif digit == 3:\n S_raw[position] = 1\n S_raw[position + 1] += 1\n S_raw[position + 2] += 1\n else: #4\n S_raw[position] = 0\n S_raw[position + 2] += 1\n position += 1\n # postprocessing\n last_two_digits = S_raw[-2:]\n if last_two_digits == [2, 1]:\n S_raw = S_raw[:-2]\n elif last_two_digits == [3, 1]:\n S_raw[-2:] = [1]\n elif last_two_digits == [1, 2]:\n S_raw[-2:] = [1, 0, 1, 1]\n elif last_two_digits == [2, 2]:\n S_raw[-2:] = [0, 1]\n elif last_two_digits == [3, 2]:\n S_raw[-2:] = [1, 1]\n elif last_two_digits == [4, 1]:\n S_raw[-2:] = [0, 0, 1]\n elif last_two_digits == [4, 2]:\n S_raw = S_raw[:-2]\n S = ''.join([str(digit) for digit in S_raw])[::-1]\n print(S)\n "] | ['Wrong Answer', 'Accepted'] | ['s245877555', 's400509305'] | [3320.0, 3192.0] | [19.0, 18.0] | [2759, 2747] |
p03286 | u076764813 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['n=int(input())\nx=""\nwhile n!=0:\n x= x+str(n%2)\n n=-(n//2)\n\nif x=="":\n print(0)\nelse:\n print(x)\n', 'n=int(input())\nx=""\nwhile n!=0:\n x=str(n%2)+x\n n=-(n//2)\nprint(0 if x=="" else x)'] | ['Wrong Answer', 'Accepted'] | ['s213890868', 's337064522'] | [2940.0, 2940.0] | [17.0, 17.0] | [107, 87] |
p03286 | u077337864 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ["n = int(input())\n\ni = 1\nans = ''\nwhile n != 0:\n pi = pow(-1, i-1) * pow(2, i)\n if n % pi == pi // 2:\n ans += '1'\n n -= pi // 2\n else:\n ans += '0'\n i += 1\nif n == 0:\n print(0)\nelse:\n print(ans[::-1])\n", "n = int(input())\n\nif n == 0:\n print(0)\nelse:\n i = 1\n ans = ''\n while n != 0:\n pi = pow(-1, i-1) * pow(2, i)\n if n % pi == pi // 2:\n ans += '1'\n n -= pi // 2\n else:\n ans += '0'\n i += 1\n print(ans[::-1])\n"] | ['Wrong Answer', 'Accepted'] | ['s085003012', 's904210613'] | [3060.0, 3060.0] | [19.0, 17.0] | [214, 234] |
p03286 | u089032001 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['import sys\n\nN = int(input())\n\nif(N == 0):\n print(0)\n sys.exit()\n\nans = ""\nwhile(N != 0):\n if(N % 2 == 0):\n ans = "0" + ans\n else:\n ans = "1" + ans\n N = N // (-2)\n # N = -1 * k\n\nprint(ans)', 'import sys\n\nN = int(input())\n\nif(N == 0):\n print(0)\n sys.exit()\n\nans = ""\nwhile(N != 0):\n if(N % 2 == 0):\n ans = "0" + ans\n else:\n ans = "1" + ans\n k = N // 2\n N = -1 * k\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s253858909', 's200334913'] | [3060.0, 3060.0] | [19.0, 17.0] | [219, 214] |
p03286 | u089376182 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ["n = int(input())\nx = ''\n\nwhile n!=0:\n print((n//2))\n x = str(n%2) + x\n n = -(n//2)\n\nprint(x)", "n = int(input())\nx = ''\n\nwhile n!=0:\n x = str(n%2) + x\n n = -(n//2)\n\nprint(0 if x == '' else x)"] | ['Wrong Answer', 'Accepted'] | ['s677117715', 's802606058'] | [2940.0, 3064.0] | [17.0, 17.0] | [95, 97] |
p03286 | u094565093 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['N=int(input())\nans=""\nwhile N!=0:\n if N%2!=0:\n \n ans="1"+ans\n N-=1\n else:\n ans="0"+ans\n N=N/-2\nif ans="":\n ans="0"\nprint(ans)\n', 'N=int(input())\nans=""\nwhile N!=0:\n if N%2!=0:\n \n ans="1"+ans\n N-=1\n else:\n ans="0"+ans\n N=N/-2 \nif ans="":\n ans="0"\nprint(ans)\n', 'N=int(input())\nans=""\nwhile N!=0:\n if N%2!=0:\n \n ans="1"+ans\n N-=1\n else:\n ans="0"+ans\n N=N/-2 \nif ans=="":\n ans="0"\nprint(ans)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s358005715', 's791549816', 's050200044'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [166, 169, 170] |
p03286 | u096616343 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['N = int(input())\nans = ""\nwhile N:\n if N % 2:\n ans += "1"\n N = -((N - 1) // 2)\n else:\n ans += "0"\n N = -(N // 2)\nprint(ans)', 'N = int(input())\nans = ""\nwhile N:\n if N % 2:\n ans += "1"\n N = -((N - 1) // 2)\n else:\n ans += "0"\n N = -(N // 2)\nif len(ans) == 0:\n ans = "0"\nprint(ans[::-1])'] | ['Wrong Answer', 'Accepted'] | ['s152337421', 's447031222'] | [2940.0, 2940.0] | [18.0, 18.0] | [157, 195] |
p03286 | u099918199 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ['n = int(input())\ndef divminus2(n):\n if n%2 == 1:\n q = n // -2 + 1\n r = n % 2 + 2\n else:\n q = n // -2\n r = 0\n return q,r\n\nans_list = []\nwhile n != 0:\n q,r = divminus2(n)\n n = q\n ans_list.append(str(r))\n\nans_list.reverse()\nif ans_list == []:\n print("0")\nelse:\n print("".join(ans_list))\n', 'n = int(input())\ndef divminus2(n):\n if n%2 == 1:\n q = n // -2 + 1\n r = n % 2\n else:\n q = n // -2\n r = 0\n return q,r\n\nans_list = []\nwhile n != 0:\n q,r = divminus2(n)\n n = q\n ans_list.append(str(r))\n\nans_list.reverse()\nif ans_list == []:\n print("0")\nelse:\n print("".join(ans_list))\n'] | ['Wrong Answer', 'Accepted'] | ['s828411362', 's921480321'] | [3060.0, 3060.0] | [17.0, 17.0] | [336, 332] |
p03286 | u102902647 | 2,000 | 1,048,576 | Given an integer N, find the base -2 representation of N. Here, S is the base -2 representation of N when the following are all satisfied: * S is a string consisting of `0` and `1`. * Unless S = `0`, the initial character of S is `1`. * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N. It can be proved that, for any integer M, the base -2 representation of M is uniquely determined. | ["N = int(input())\ns = ''\n\nwhile N != 0:\n print(N, s, N % (-2) == 0)\n if N % (-2) == 0:\n s = '0' + s\n else:\n s = '1' + s\n N -= 1\n N /= (-2)\n\nif s =='':\n s = '0'\nprint(s)", 'import numpy as np\nN, M = map(int, input().split())\nA = [int(i) for i in input().split()]\nar = np.eye(N) * A\n\nfor h in range(0, N):\n for w in range(1, h+1):\n ar[-h-1, -h-1+w] = ar[-h, -h-1+w] + ar[-h-1, -h-2+w] - ar[-h, -h-2+w]\nprint(int(sum(sum(ar % M == 0)) - sum(np.linspace(1, N-1, N-1))))', "N = int(input())\ns = ''\n\nwhile N != 0:\n# print(N, s, N % (-2) == 0)\n if N % (-2) == 0:\n s = '0' + s\n else:\n s = '1' + s\n N -= 1\n N /= (-2)\n\nif s =='':\n s = '0'\nprint(s)"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s567171152', 's892161964', 's306552364'] | [3060.0, 16264.0, 3060.0] | [17.0, 262.0, 17.0] | [203, 303, 204] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.