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
|
|---|---|---|---|---|---|---|---|---|---|---|
p03284 | u840958781 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N,K(int,input().split())\nprint(N%K)', 'n,k=map(int(input().split()))\nif n%k==0:\n print(0)\nelse:\n print(1)', 'n,k=map(int,input().split())\nif n%k==0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s233154156', 's393376160', 's741038809'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [35, 72, 72] |
p03284 | u844646164 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N, K = map(int, input().split())\ndiv = N // K\nmod = N % K\n\nif mod == 0:\n print(0)\nelse:\n print(abs(K-mod))\n', 'N, K = map(int, input().split())\ndiv = N // K\nmod = N % K\n\nif mod == 0:\n print(0)\nelse:\n print(K-mod)\n', 'N, K = map(int, input().split())\ndiv = N // K\nmod = N % K\n\nif mod == 0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s192832378', 's221485632', 's074751283'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [113, 108, 104] |
p03284 | u851704997 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N = int(input())\nX = N // 4 + 1\nZ = N // 7 + 1\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,K = map(int,input().split())\nif(N%K == 0):\n print("0")\nelse:\n print("1")'] | ['Runtime Error', 'Accepted'] | ['s147764163', 's958869953'] | [2940.0, 9076.0] | [18.0, 28.0] | [154, 76] |
p03284 | u853900545 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N,K = map(int,input())\nif N % K = 0:\n print(0)\nelse:\n print(1)', 'N,K = map(int,input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s779244572', 's748286578'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 77] |
p03284 | u859897687 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['print(1if eval("%".join(input()))>0else 0)', 'print(1if eval(input().replace(" ","%"))>0else 0)'] | ['Runtime Error', 'Accepted'] | ['s648294997', 's573270957'] | [2940.0, 2940.0] | [17.0, 18.0] | [42, 49] |
p03284 | u860657719 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['numbers = input()\nnumber_list = numbers.splist(" ")\nN = int(number_list[0])\nK = int(number_list[1])\nif N%K == 0:\n print(0)\nelse:\n print(1)\n \n', 'numbers = input()\nnumber_list = numbers.splist(" ")\nN = int(number_list[0])\nK = int(number_list[1])\nif N%K == 0:\n print 0\nelse:\n print 1\n ', 'numbers = input()\nnumber_list = numbers.split(" ")\nN = int(number_list[0])\nK = int(number_list[1])\nif N%K == 0:\n print(0)\nelse:\n print(1)\n \n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s033119091', 's339351939', 's901122634'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [144, 141, 143] |
p03284 | u864197622 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N, M = map(int, input().split(" "))\nA = [int(a) for a in input().split()]\n \ntmp=0\nB=[0]\nfor i in A:\n tmp += A[i]\n tmp = tmp % M\n B.append(tmp)\n \nB.sort()\ncnt=0\nret=0\nfor i in range(len(B)):\n if i ==0:\n cnt += 1\n prev=B[0]\n \n else:\n if B[i] == prev:\n cnt += 1\n \n else:\n ret += int(cnt*(cnt-1)/2)\n prev = B[i]\n cnt = 1\n \nret += int(cnt*(cnt-1)/2)\n \nprint (ret)', 'N, M = map(int, input().split(" "))\nA = [int(a) for a in input().split()]\n\ntmp=0\nB=[0]\nfor i in A:\n tmp += A[i]\n tmp = tmp % M\n B.append(tmp)\n\nB.sort()\nprint (B)\ncnt=0\nret=0\nfor i in range(len(B)):\n if i ==0:\n cnt += 1\n prev=B[0]\n \n else:\n if B[i] == prev:\n cnt += 1\n \n else:\n ret += int(cnt*(cnt-1)/2)\n prev = B[i]\n cnt = 1\n\nret += int(cnt*(cnt-1)/2)\n\nprint (ret)', "print((eval('%'.join(input().split()))>0)+0)"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s615510161', 's732722728', 's353917897'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [463, 469, 44] |
p03284 | u865383026 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['I = input().split()\n\nN = int(I[0])\nK = int(I[1])\n\nif K != N:\n print(1)\nelif K = N:\n print(0)', 'I = input().split()\n\nN = int(I[0])\nK = int(I[1])\n\nif N % K == 0:\n print(1)\nelse:\n print(0)', 'I = input().split()\n\nN = int(I[0])\nK = int(I[1])\n\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s664393225', 's907429586', 's468437069'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [94, 92, 92] |
p03284 | u865413330 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n, k = map(int, input().split())\n\nprint(k % n)\n\n', 'n, k = map(int, input().split())\n\nif n % k > 0:\n print(1)\nelse:\n print(0)\n'] | ['Wrong Answer', 'Accepted'] | ['s438061540', 's668536869'] | [2940.0, 2940.0] | [17.0, 18.0] | [48, 80] |
p03284 | u868418093 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['a,b = map(int,input().split())\nprint(abs(a-b))', 'a,b = map(int,input().split())\nprint(int(a/b)-a//b)', 'a,b = map(int,input().split())\nprint(int(a/b-a//b))\n', 'a,b = map(int,input().split())\nif a%b != 0:\n print(1)\nelse:\n print(0)\n '] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s084737227', 's094161519', 's531857000', 's590611524'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [46, 51, 52, 74] |
p03284 | u869154953 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N,K=map(int,input().split())\n\nif N%K==0:\n\tprint(0)\n\telif N%K!=0:\n\t\tprint(1)', 'N,K=map(int,input().split())\n\nif N%K==0:\n\tprint(0)\n\telse:\n\t\tprint(1)', 'N,K=map(int,input().split())\n\nif N%5==0:\n\tprint(0)\n\telif N%5!=0:\n\t\tprint(1)', 'N,K=map(int,input().split())\n\nif N%K==0:\n\tprint("0")\nelse:\n\tprint("1")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s183651824', 's463903939', 's862844947', 's503920127'] | [8912.0, 8952.0, 8996.0, 9136.0] | [25.0, 23.0, 29.0, 27.0] | [75, 68, 75, 70] |
p03284 | u875541682 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n = int(input())\nk = int(input())\nif n % k == 0:\n print(0)\nelse:\n print(1)', 'n,k=map(int,input().split()) \nif n%k == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s181137863', 's072478843'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 77] |
p03284 | u879870653 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N = int(input())\nS = ""\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)\nif len(S) == 0 :\n print(0)\nelse :\n print(S)\n \n ', 'N,K = map(int,input().split())\nif N < K :\n print(1)\nelif N % K == 0 :\n print(0)\nelse :\n print(1)\n\n'] | ['Runtime Error', 'Accepted'] | ['s666268525', 's061489721'] | [2940.0, 2940.0] | [17.0, 17.0] | [204, 107] |
p03284 | u883574098 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['import math as ma\nimport sys\nfrom sys import exit\nfrom decimal import Decimal as dec\nfrom itertools import permutations\n\ndef li():\n\treturn list(map(int , input().split()))\n\ndef num():\n\treturn map(int , input().split())\n\ndef nu():\n\treturn int(input())\n\ndef find_gcd(x , y):\n\twhile (y):\n\t\tx , y = y , x % y\n\treturn x\n\nn,k=num()\nif(n%k==0):\n\tprint(n//k,n//k)\nelse:\n\tprint((n-n%k)//k,(n-n%k)//k+1)', 'import math as ma\nimport sys\nfrom sys import exit\nfrom decimal import Decimal as dec\nfrom itertools import permutations\n\ndef li():\n\treturn list(map(int , input().split()))\n\ndef num():\n\treturn map(int , input().split())\n\ndef nu():\n\treturn int(input())\n\ndef find_gcd(x , y):\n\twhile (y):\n\t\tx , y = y , x % y\n\treturn x\n\nn,k=num()\nif(n%k==0):\n\tprint(0)\nelse:\n\tprint(1)'] | ['Wrong Answer', 'Accepted'] | ['s072868886', 's292635362'] | [5076.0, 5204.0] | [34.0, 41.0] | [393, 363] |
p03284 | u887207211 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N, K = map(int,input().split())\nif(N%K == 0)\n print(0)\nelse:\n print(1)', 'N, K = map(int,input().split())\nif(N%K == 0):\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s381584651', 's380192568'] | [2940.0, 2940.0] | [17.0, 18.0] | [72, 74] |
p03284 | u899645116 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n,k = map(int,input().split())\nprint((int)(n % k) != 0)\n', 'n,k = map(int,input().split())\nprint((n % k) != 0)', 'n,k = map(int,input().split())\nprint(int((n % k) != 0))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s207505699', 's281350533', 's526123698'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [56, 50, 56] |
p03284 | u902151549 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['import math\nn=int(input())\ncount=0\nfor a in range(math.floor(n/4)+1):\n if (n-a*4)%7==0:\n count+=1\nprint(count)\n', 'n,k=map(int,input().split())\nif n%k:\n print(1)\nelse:\n print(0)\n'] | ['Runtime Error', 'Accepted'] | ['s742704063', 's071267517'] | [2940.0, 2940.0] | [17.0, 17.0] | [121, 69] |
p03284 | u905895868 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['if snacks_num % persons == 0:\n print(0)\nelse:\n print(1)', 'm, k = map(int, input().split())\n\nprint(0 if m % k == 0 else 1)\n'] | ['Runtime Error', 'Accepted'] | ['s475635955', 's037673671'] | [8988.0, 8968.0] | [23.0, 25.0] | [61, 64] |
p03284 | u909643606 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['#import sys\n#input = sys.stdin.readline\n#template input\nimport bisect\n\ndef IT():\n return int(input())\ndef IL():\n return [int(_) for _ in input().split()]\ndef SL():\n return [int(_) for _ in input().split()]\ndef ILS(n):\n return [int(input()) for _ in range(n)]\ndef SLS(n):\n return [input() for _ in range(n)]\ndef ILSS(n):\n return [[int(_) for _ in input().split()] for j in range(n)]\n\n\ndef bit_full_search(ss):\n n = len(ss)\n for i in range(1 << n):\n s = ""\n for j in range(n + 1):\n if ((1 & i >> j) == 1):\n s += ss[j]\n print(s)\n\ndef bit_full_search2(A):\n #https://blog.rossywhite.com/2018/08/06/bit-search/\n value = []\n for i in range(1 << len(A)):\n output = []\n\n for j in range(len(A)):\n if ((i >> j) & 1) == 1:\n #output.append(A[j])\n output.append(A[j])\n #print(output)\n value.append([format(i, \'b\'), sum(output)])\n# print(value)\n return value\n\n\n\ndef main():\n n = IT()\n \n list1 = [(-2) ** i for i in range(17)]\n list2 = [(-2) ** (i + 17) for i in range(17)]\n\n list1 = bit_full_search2(list1)\n list1.sort(key=lambda x:x[1])\n list1_bin = [list1[i][0] for i in range(len(list1))]\n list1_val = [list1[i][1] for i in range(len(list1))]\n\n list2 = bit_full_search2(list2)\n list2.sort(key=lambda x:x[1])\n list2_bin = [list2[i][0] for i in range(len(list2))]\n list2_val = [list2[i][1] for i in range(len(list2))]\n\n for i in range(len(list1_val)):\n j = bisect.bisect_left(list2_val, n - list1_val[i])\n if j < len(list2_val):\n if list1_val[i] + list2_val[j] == n:\n ans = list2_bin[j] +list1_bin[i]\n break\n\n print(int(ans))\n\nmain()\n\n', 'n,k=[int(i) for i in input().split()]\n\nif n%k==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s548057567', 's429663793'] | [3192.0, 2940.0] | [19.0, 17.0] | [1857, 77] |
p03284 | u919633157 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ["n=int(input())\nflag=False\nfor i in range(n//4+1):\n for j in range(n//7+1):\n sum=4*i+7*j\n if sum==n:\n flag=True\nprint('Yes' if flag else'No')\n ", 'n,k=map(int,input().split())\nprint(0 if n%k==0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s612776597', 's458387023'] | [2940.0, 2940.0] | [17.0, 17.0] | [173, 54] |
p03284 | u922449550 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N, K = map(int, input().split())\nprint(int(N%K==0))', 'N, K = map(int, input().split())\nprint(int(N%K!=0))'] | ['Wrong Answer', 'Accepted'] | ['s673700495', 's132279191'] | [2940.0, 2940.0] | [17.0, 18.0] | [51, 51] |
p03284 | u924652196 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | [' inp = list(map(int, input().split()))\n n = inp[0]\n k = inp[1]\n print(str(abs(n%k)))', "inp = list(map(int, input().split()))\nn = inp[0]\nk = inp[1]\nif n % k == 0:\n print('0')\nelse:\n print('1')"] | ['Runtime Error', 'Accepted'] | ['s958475388', 's666424120'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 106] |
p03284 | u924671994 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n,k = map(int, input(), split())\n\nif n%k==0:\n print(0)\n \nelse:\n print(1)', 'n,k = map(int, input().split())\n\nif n%k==0:\n print(str(0))\n\nelse:\n print(str(1))'] | ['Runtime Error', 'Accepted'] | ['s360349598', 's458087916'] | [3060.0, 2940.0] | [19.0, 17.0] | [75, 82] |
p03284 | u933129390 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n, k = map(int, input())\nif n%k:\n print(0)\nelse:\n print(1)\n', 'n, k = map(int, input().split())\nif n%k:\n print(0)\nelse:\n print(1)\n', 'n, k = map(int, input().split())\nif n%k:\n print(1)\nelse:\n print(0)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s333880793', 's855980446', 's667840999'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [65, 73, 73] |
p03284 | u933723514 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['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,k = map(int, input().split())\nif n%k == 0:\n print("0")\nelse: \n print("1")'] | ['Runtime Error', 'Accepted'] | ['s104098022', 's482525411'] | [2940.0, 2940.0] | [17.0, 17.0] | [143, 84] |
p03284 | u941284420 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ["#!/usr/bin/env python3\n\ndef solve(N: int, K: int):\n d = int(N % K)\n if d == 0:\n print(d)\n elif:\n print(1)\n return\n\ndef main():\n N, K = map(int, input().split())\n solve(N, K)\n\nif __name__ == '__main__':\n main()", "#!/usr/bin/env python3\n\ndef solve(N: int, K: int):\n d = int(N % K)\n if d == 0:\n print(d)\n else:\n print(1)\n return\n\ndef main():\n N, K = map(int, input().split())\n solve(N, K)\n\nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s694095961', 's965377950'] | [2940.0, 2940.0] | [17.0, 17.0] | [240, 240] |
p03284 | u951601135 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ["N = int(input())\ncount=0\nfor i in range(26):\n for j in range((100-4*i)//7+1):\n M = N-4*i-7*j\n if(M==0):\n print('Yes')\n count+=1\n break\n if(count==1):\n break\nif(count==0):\n print('No')\n\n", "N = int(input())\nflag=False\nmax_i = N//4+1\nfor i in range(max_i):\n if((N-4*i)%7==0):\n \tflag=True\n \tbreak\nprint('Yes' if flag else 'No')\n\n", 'N,K=map(int,input().split())\nprint(0 if (N%K==0) else 1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s143705003', 's779558947', 's160306688'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [212, 140, 56] |
p03284 | u951980350 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['nk = map(int,input().split(" "))\nprint(nk[0] % nk[1]) ', 'nk = list(map(int,input().split(" ")))\nl = [(nk[0] + i) // nk[1] for i in range(nk[1])]\nprint(max(l) - min(l))'] | ['Runtime Error', 'Accepted'] | ['s407809514', 's600132629'] | [2940.0, 2940.0] | [18.0, 18.0] | [54, 110] |
p03284 | u952491523 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n = int(input())\nk = int(input())\n\nif n % k == 0 :\n print(0)\nelse:\n print(1)\n\n', 'nums = [int(i) for i in input().split()]\n\nif nums[0] % nums[1] == 0 :\n print(0)\nelse:\n print(1)\n\n'] | ['Runtime Error', 'Accepted'] | ['s942615695', 's107207664'] | [2940.0, 2940.0] | [17.0, 18.0] | [84, 103] |
p03284 | u957872856 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['print((eval(input().replace(" ","%")>0)+0)', 'print((eval(input().replace(" ","%"))>0)+0)'] | ['Runtime Error', 'Accepted'] | ['s793736439', 's526848396'] | [2940.0, 2940.0] | [17.0, 18.0] | [42, 43] |
p03284 | u969190727 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n,k=map(int,input().split())\nprint(0 if n%k=0 else 1)', 'n,k=map(int,input().split())\nprint(0 if n%k==0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s818800113', 's682559238'] | [2940.0, 2940.0] | [17.0, 18.0] | [53, 54] |
p03284 | u970809473 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['a = sorted(list(map(int, input().split())))\nprint(a[-1] - a[0])', 'a, b = map(int, input().split())\nif a % b == 0:\n print(0)\nelse:\n print(1)'] | ['Wrong Answer', 'Accepted'] | ['s758319538', 's844349344'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 75] |
p03284 | u971672726 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['numSenbei, numPeople = [int(i) for i in str(input()).split()]\n\nif numSenbei % numPeople == 0:\n print(1)\nelse:\n print(0)', '(numSenbei, numPeople) = input().split()\n\nif numSenbei % numPeople == 0:\n print(1)\nelse:\n print(0)\n', 'import sys\n\ntargetPrice = int(input())\ncakePrice = 4\ndonutPrice = 7\nmaxDonutCount = int(targetPrice / 7)\n\nfor i in range(maxDonutCount + 1):\n targetCakePrice = targetPrice - (donutPrice * i)\n if targetCakePrice % cakePrice == 0:\n print("Yes")\n sys.exit()\nprint("No")\n', 'numSenbei, numPeople = [int(i) for i in str(input()).split()]\n\nif numSenbei % numPeople == 0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s101463281', 's122237530', 's964680163', 's434680383'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 19.0] | [125, 105, 287, 126] |
p03284 | u973046188 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N = float(input())\nq = N\nwhile q!=1:\n hoge = (q-1) / (-2)\n if hoge.is_integer():\n r = int(1)\n q = float(hoge)\n else:\n r = int(0)\n q = float(q/(-2))\n r_s.append(r)\nr_s.append(1)\nr_s = r_s[::-1]\nfor i in range(len(r_s)):\n print(r_s[i], end="")', 'N, M = map(int, input().split())\nA_s = list(map(int,input().split()))\n\n\nx = 0\nfor l in range(N):\n for r in range(N-l):\n hoge = float(sum(A_s[l:l+r+1]) / M)\n if hoge.is_integer():\n x += 1\n \nprint(x)', 'N = float(input())\n\nq = N\nr_s = []\nwhile q!=1:\n hoge = (q-1) / (-2)\n if hoge.is_integer():\n r = int(1)\n q = float(hoge)\n else:\n r = int(0)\n q = float(q/(-2))\n \n r_s.append(r)\nr_s.append(1)\nr_s = r_s[::-1]\n\nfor i in range(len(r_s)):\n print(r_s[i], end="")', "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')", 'N, K = map(int, raw_input().split())\nr = N % K\nif r == 0:\n print(0)\nelse:\n print(1)\n', 'N, K = map(int, input().split())\nr = N % K\nif r == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s160161803', 's502786303', 's776174961', 's909386204', 's999420480', 's502502928'] | [3064.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0, 17.0, 17.0, 17.0] | [258, 214, 272, 174, 86, 82] |
p03284 | u983918956 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ["N=input(':')\n\nK=input(':')\n\nN=int(N)\n\nK=int(K)\n\nif N%K==0 :\n print(0)\n\nelse :\n print(1)", 'N = int(input())\n# N = 4n+7m \nif (N % 4 == 0) or (N % 7 == 0) or (N % 7 == 4):\n print("Yes")\nelse:\n print("No")', 'N,K = map(int,input().split())\nif N%K == 0:\n print(0)\nelse :\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s704649716', 's827759381', 's559253296'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [93, 113, 72] |
p03284 | u989326345 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['N,K=map(int,input().split())\nif N%k==0:\n print(0)\nelse:\n print(1)', 'N,K=map(int,input().split())\nif N%K==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s189461445', 's693177525'] | [2940.0, 2940.0] | [17.0, 19.0] | [71, 71] |
p03284 | u989345508 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n,k=map(int,input().split())\nprint(n%k==0:\n print(0)\nelse:\n print(1)\n', 'n,k=map(int,input().split())\nprint(1 if n%k!=0 else 0)'] | ['Runtime Error', 'Accepted'] | ['s424584020', 's533828140'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 54] |
p03284 | u999893056 | 2,000 | 1,048,576 | Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user. | ['n , k = map(int, input().split())\n\nif n & k == 0:\n print(0)\nelse:\n num_ave = n % k\n num_max = n - num_ave * (k - 1)\n answer = num_max - num_ave\n print(answer)', 'a, b = map(int, input().split())\n\nprint(0 if a % b == 0 else 1)'] | ['Wrong Answer', 'Accepted'] | ['s029687547', 's631694470'] | [2940.0, 2940.0] | [18.0, 19.0] | [173, 63] |
p03285 | u003501233 | 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"\n\nfor i in range(N+1):\n if i % 4 == 0 and (N-1) % 7 == 0:\n ans = "Yes"\nprint(ans)\n', 'N=int(input())\nans="No"\n\nfor i in range(N+1):\n if i % 4 == 0 and (N-i) % 7 == 0:\n ans = "Yes"\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s784907251', 's027670679'] | [2940.0, 2940.0] | [17.0, 17.0] | [109, 109] |
p03285 | u009219947 | 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(26):\n for j in range(16):\n if N == i * 4 + j * 7:\n print('YES')\n sys.exit()\nprint('NO')", "import sys\n \nN = int(input())\n \nfor i in range(26):\n for j in range(16):\n if N == i * 4 + j * 7:\n print('Yes')\n sys.exit()\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s170383120', 's378724734'] | [2940.0, 2940.0] | [17.0, 17.0] | [146, 148] |
p03285 | u015467545 | 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=int(n/4)+1\nb=int(n/7)+1\nans=0\nfor i in range(a+1):\n for j in range(b+1):\n if 4*i+7*j=n:\n ans+=1\nif ans==0:\n print("No")\nelse:\n print("Yes")', 'n = int(input())\na=int(n/4)+1\nb=int(n/7)+1\nans=0\nfor i in range(a+1):\n for j in range(b+1):\n if 4*i+7*j==n:\n ans+=1\nif ans==0:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s797430385', 's377987656'] | [2940.0, 3060.0] | [18.0, 17.0] | [169, 170] |
p03285 | u017415492 | 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())\nflag=0\nfor i in range(int(n//4)):\n for j in range(int(n//7)):\n if n==i*4+j*7:\n print("Yes")\n flag=1\n break\nif flag==0:\n print("No")', 'n=int(input())\nflag=0\nfor i in range(int(n//4)+1):\n for j in range(int(n//7)+1):\n print(i,j)\n if n==(i*4+j*7):\n print("Yes")\n flag=1\n break\nif flag==0:\n print("No")', 'n=int(input())\nflag=0\nfor i in range(int(n//4)+1):\n for j in range(int(n//7)+1):\n if n==(i*4+j*7):\n print("Yes")\n print(i,j)\n flag=1\n break\n if flag==1:\n break\nif flag==0:\n print("No")', 'n=int(input())\nflag=0\nfor i in range(int(n//4)+1):\n for j in range(int(n//7)+1):\n if n==(i*4+j*7):\n print("Yes")\n flag=1\n break\n if flag==1:\n break\nif flag==0:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s055856545', 's235652323', 's679361638', 's160881568'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 18.0, 17.0] | [166, 187, 213, 196] |
p03285 | u023229441 | 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())\nfor i in range(26):\n for l in range(15):\n if 4*i+7*j==100:\n print("Yes")\n exit()\nprint("No")', 'a=int(input())\nfor i in range(26):\n for j in range(15):\n if 4*i+7*j==a:\n print("Yes")\n exit()\nprint("No")'] | ['Runtime Error', 'Accepted'] | ['s979332598', 's875107536'] | [2940.0, 2940.0] | [18.0, 17.0] | [121, 119] |
p03285 | u024245528 | 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\nlist_aaa =[]\n\nfor i in range(26):\n for j in range(26):\n list_aaa.append((i*4)+(j*7))\nlist_aaa = sorted(list_aaa)\n\nprint(list_aaa)\n\nif N in list_aaa:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\n\nlist_aaa =[]\n\nfor i in range(26):\n for j in range(26):\n list_aaa.append((i*4)+(j*7))\nlist_aaa = sorted(list_aaa)\n\n# print(list_aaa)\n\nif N in list_aaa:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s258688544', 's846751427'] | [3060.0, 3060.0] | [17.0, 17.0] | [215, 217] |
p03285 | u027403702 | 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())\ncount = 0\nfor i in range(26):\n for j in range(16):\n if 4 * i + 7 * j == N:\n count +=1\nprint(count)', '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()\nprint("No")', 'N = int(input())\ncount = 0\nfor i in range(26):\n for j in range(16):\n if 4 * i + 7 * j == N:\n print("Yes")\n exit()\nprint("No")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s820167676', 's837900954', 's469902238'] | [3064.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0] | [136, 134, 157] |
p03285 | u029169777 | 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%7==0 or N%4==0 or N%7==4 or N%4==7 N%11==0 or N%11==4 or N%11==7:\n print('Yes')\nelse:\n print('No')", "N=int(input())\n\nN4=N\nN7=N\nwhile(N4>=0):\n if N4%7==0:\n print('Yes')\n exit()\n N4-=4\nwhile(N7>=0):\n if N7%4==0:\n print('Yes')\n exit()\n N7-=7\nprint('No')"] | ['Runtime Error', 'Accepted'] | ['s982898059', 's094469522'] | [2940.0, 3060.0] | [17.0, 17.0] | [121, 165] |
p03285 | u031146664 | 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())\ncount = 0\nfor cake in range(0,n+1,4):\n for donatsu in range(0,n+1,7):\n print("Yes") if cake+donatsu == n else print("No")\n', 'n = int(input())\ncount = 0\nfor cake in range(0,n+1,4):\n for donatsu in range(0,n+1,7):\n if donatsu + cake == n:\n count += 1\nprint("Yes") if count >= 1 else print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s950239189', 's558860473'] | [3060.0, 2940.0] | [17.0, 18.0] | [149, 189] |
p03285 | u031358594 | 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(N)\ncostC=4\ncostD=7\nFlag=False\nfor i in range(0,100):\n if Flag:\n break\n\n for j in range(0,100):\n \n costSum=i*costC+j*costD\n if N==costSum:\n Flag=True\n\nif Flag:\n print("Yes")\nelse :\n print("No")', 'N=int(input())\ncostC=4\ncostD=7\nFlag=False\nfor i in range(0,100):\n if Flag:\n break\n\n for j in range(0,100):\n \n costSum=i*costC+j*costD\n if N==costSum:\n Flag=True\n\nif Flag:\n print("Yes")\nelse :\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s249818533', 's633613349'] | [3060.0, 3060.0] | [19.0, 19.0] | [261, 252] |
p03285 | u033606236 | 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\ncakes = 4\ndonuts = 7\namount = int(input())\ni = 0\n\nwhile amount >= i * donuts:\n i += 1\n x = 0\n\n if amount == i * donuts:\n print('yes')\n sys.exit()\n\n while amount - ( i * donuts ) >= x * cakes:\n if amount - ( i * donuts ) == x * cakes:\n print('yes')\n sys.exit()\n\nprint('No')", "import sys\ncakes = 4\ndonuts = 7\namount = int(input())\n\nif amount < 4 :\n print('No')\n sys.exit()\n\nfor i in range( int( amount / 4 ) +1 ):\n if amount == i * cakes:\n print('Yes')\n sys.exit()\n\n for x in range( int( amount / 7 ) +1 ):\n if amount - (i * cakes ) == x * donuts:\n print('Yes')\n sys.exit()\n\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s302566395', 's100550874'] | [3064.0, 3064.0] | [2104.0, 17.0] | [338, 364] |
p03285 | u034369223 | 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())\nfor i in range(int(N/4) + 1):\n amount = i * 4\n for j in range(int(N/7) + 1):\n amount += 7\n if(amount == 100):\n print('Yes')\n sys.exit()\nprint('No')\n", "import sys\nN = int(input())\nfor i in range(int(N/4)):\n amount = (i + 1) * 4\n for j in range(int(N/7)):\n amount += 7\n if(amount == 100):\n print('Yes')\n sys.exit()\nprint('No')\n", "import sys\nN = int(input())\nfor i in range(int(N/4) + 1):\n amount = (i + 1) * 4\n for j in range(int(N/7) + 1):\n amount += 7\n if(amount == 100):\n print('Yes')\n sys.exit()\nprint('No')\n", "import sys\nN = int(input())\nfor i in range(int(N/4)):\n amount = i * 4\n for j in range(int(N/7)):\n if(j == 0):\n pass\n else:\n amount += 7\n if(amount == N):\n print('Yes')\n sys.exit()\nprint('No')\n", "import sys\nN = int(input())\nfor i in range(int(N/4) + 1):\n amount = i * 4\n for j in range(int(N/7) + 1):\n if(j == 0):\n pass\n else:\n amount += 7\n if(amount == N):\n print('Yes')\n sys.exit()\nprint('No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s564452265', 's587328774', 's681699598', 's893908237', 's241292673'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [218, 216, 224, 263, 271] |
p03285 | u037221289 | 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())\ndonuts = 7\ncakes = 4\nanswer = 0\ndef calc1():\n for a in range(0,26):\n for b in range(0,26):\n if donuts * a + cakes * b == N:\n return 'Yes'\n elif donuts * a + cakes * b > N:\n break\n return 'No'\n\ncalc1()", "N = int(input())\ndonuts = 7\ncakes = 4\nanswer = 0\ndef calc1():\n for a in range(0,26):\n for b in range(0,26):\n if donuts * a + cakes * b == N:\n return 'Yes'\n elif donuts * a + cakes * b > N:\n break\n return 'No'\n\nprint(calc1())"] | ['Wrong Answer', 'Accepted'] | ['s872180814', 's020016364'] | [2940.0, 2940.0] | [17.0, 17.0] | [247, 254] |
p03285 | u038027079 | 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:\n\tif n % 4 == 0 or n % 7 == 0 or n % 28 == 0 or n % 11 == 0:\n \t\tprint("Yes")\n else:\n print("No")\nelse:\n\tprint("No")', 'def ans():\n n = int(input())\n for a in range(n // 4 + 1):\n for b in range(n // 7+ 1):\n if 4 * a + 7 * b == n:\n print("Yes")\n return\n print("No")\n\nans()'] | ['Runtime Error', 'Accepted'] | ['s255265866', 's884554329'] | [3064.0, 2940.0] | [18.0, 17.0] | [150, 176] |
p03285 | u038216098 | 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):\n for j in range(N//7):\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//7+1):\n if 4*i+7*j==N :\n print("Yes")\n exit()\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s898100901', 's728374484'] | [9100.0, 9200.0] | [26.0, 31.0] | [124, 128] |
p03285 | u043010113 | 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 fits(N):\n answer = 'No'\n for cake in range(0,100,4):\n for donut in range(0,100,7):\n if cake + donut is N:\n answer = 'yYs'\n return answer\nif __name__ == '__main__':\n N = int(input())\n print(fits(N))", "#!/usr/bin/env python3\ndef fits(N):\n if N < 4:\n return 'no'\n else:\n for cake in range(0,100,4):\n for donut in range(0,100,7):\n if cake + donut is N:\n return 'yes'\nif __name__ == '__main__':\n N = int(input())\n print(fits(int(N)))", "def fits(N):\n answer = 'no'\n for cake in range(0,100,4):\n for donut in range(0,100,7):\n if cake + donut is N:\n answer = 'yes'\n return answer\nif __name__ == '__main__':\n N = int(input())\n print(fits(N))", "def fits(N):\n if N < 4:\n return 'no'\n else:\n for cake in range(0,100,4):\n for donut in range(0,100,7):\n if cake + donut is N:\n return 'yes'\n\nif __name__ == '__main__':\n print(fits(int(N)))", "def fits(N):\n answer = 'No'\n for cake in range(0,100,4):\n for donut in range(0,100,7):\n if cake + donut is N:\n answer = 'Yes'\n return answer\nif __name__ == '__main__':\n N = int(input())\n print(fits(N))"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s006932666', 's141439877', 's270391148', 's359797211', 's127033381'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 20.0, 17.0, 17.0] | [249, 299, 249, 256, 249] |
p03285 | u045270305 | 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\namount = 0\nj = False\n\nfor i in range(1, 101) :\n for j in range(1, 101) :\n amount = 4 * i + 7 * j\n\n if amount == N:\n j = True\n break\n\n\nif j == True :\n print('Yes')\nelse :\n print('No')\n ", "N = int(input())\n\namount = 0\nresult = False\n\ni_max = int(N/4) + 1\ny_max = int(N/7) + 1\n\n\nfor i in range(0, i_max) :\n for j in range(0, y_max) :\n cake = 4 * i\n donuts = 7 * j\n amount = cake + donuts\n\n if amount == N:\n result = True\n break\n\n else:\n continue\n break\n\n \nif result == True :\n print('Yes')\nelse :\n print('No')\n \n "] | ['Wrong Answer', 'Accepted'] | ['s282322382', 's614979406'] | [2940.0, 3060.0] | [20.0, 18.0] | [255, 406] |
p03285 | u050121913 | 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 = 1+n//4\nq = ['No','Yes']\ns = 0\nfor a in range(x):\n\tif (n-a*4)%7==0:\n \ts = 1\n \nprint(q[s])", "n = int(input())\nx = 1+n//4\nq = ['No','Yes']\ns = 0\nfor a in range(x):\n if (n-a*4)%7==0:\n s += 1\n break\n \nprint(q[s])"] | ['Runtime Error', 'Accepted'] | ['s560898447', 's313949168'] | [2940.0, 2940.0] | [17.0, 17.0] | [119, 130] |
p03285 | u052347048 | 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. | ['num = int(input())\nfor i in range(11):\n if num - (4*i +7*(10-i)) == 0:\n print("Yes")\n exit()\nelse:\n print("No")', 'num = int(input())\nlis = []\nfor i in range(26):\n for m in range(15):\n lis.append((4*i)+(7*m))\nprint("Yes" if num in lis else "No")'] | ['Wrong Answer', 'Accepted'] | ['s594255155', 's670104125'] | [2940.0, 3064.0] | [17.0, 18.0] | [131, 140] |
p03285 | u055506972 | 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 = list(map(int, input().split()))\nS = N%4\n\nif S == 0 or S == 3:\n print("Yes")\nelse:\n print("No")', 'N = list(map(int, input().split()))\nS = N%4\n\nif S == 0:\n print("Yes")\nelif S == 3::\n print("Yes")\nelse:\n print("No")', 'N = input()\n\nif N%4 == 0:\n print("Yes")\n exit()\n\nif N%7 == 0:\n print("Yes")\n exit()\n\nS = N%7\nK = (S%4)%2\n\nif K == 0:\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\n\nif N%4 == 0:\n print("Yes")\n\nif N%7 == 0:\n print("Yes")\n\nif N%4 == 1:\n if N < 29:\n print("No")\n else:\n print("Yes")\n\nif N%4 == 2:\n if N < 11:\n print("No")\n elif N < 15:\n print("No")\n else:\n print("Yes")\n\n \nif N%4 == 3:\n if N > 10:\n print("Yes")\n else:\n print("N', 'N = list(map(int, input().split()))\n\nif N%4 == 0:\n print("Yes")\n exit()\n\nif N%7 == 0:\n print("Yes")\n exit()\n\nS = N%7\nK = (S%4)%2\n\nif K == 0:\n print("Yes")\nelse:\n print("No")\n', 'N = list(map(int, input().split()))\nS = N%4\n\nif S == 0:\n print("Yes")\nelif S == 3:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\n\nif N%4 == 0:\n print("Yes")\n\nif N%4 == 1:\n if N < 21:\n print("No")\n else:\n print("Yes")\n\nif N%4 == 2:\n if N < 14:\n print("No")\n else:\n print("Yes")\n\n\nif N%4 == 3:\n if N < 7:\n print("No")\n else:\n print("Yes")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s052723514', 's202416771', 's793533067', 's806891000', 's814381174', 's848074190', 's866269189'] | [2940.0, 2940.0, 2940.0, 3064.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [104, 125, 168, 357, 192, 124, 288] |
p03285 | u063550903 | 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())\nmaxcake = N // 4\nmaxdonut = N //7\nfor i in range(maxcake):\n for j in range(maxdonut):\n if i*4 + j*7 == N:\n print("Yes")\n exit()\nprint("No")', 'N = int(input())\nmaxcake = N // 4 +1\nmaxdonut = N //7 +1\nfor i in range(maxcake):\n for j in range(maxdonut):\n if i*4 + j*7 == N:\n print("Yes")\n exit()\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s848552883', 's430032141'] | [2940.0, 3060.0] | [17.0, 17.0] | [188, 194] |
p03285 | u063614215 | 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())\nflg = 0\n\nfor i in range(N//7):\n for j in range(N//4):\n money = 7*i + 4*j\n if money == N:\n flg = 1\n break\n \nif flg == 1:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nflg = 0\n\nfor i in range(N//7+1):\n for j in range(N//4+1):\n money = 7*i + 4*j\n print(money)\n if money == N:\n flg = 1\n break\n \nif flg == 1:\n print('Yes')\nelse:\n print('No')\n", "N = int(input())\nflg = 0\n\nfor i in range(N//7+1):\n for j in range(N//4+1):\n money = 7*i + 4*j\n if money == N:\n flg = 1\n break\n \nif flg == 1:\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s713717457', 's936346235', 's879630608'] | [3064.0, 3060.0, 2940.0] | [18.0, 17.0, 18.0] | [193, 241, 220] |
p03285 | u067267880 | 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())\nl = []\n\nfor i in range(int(N/4)):\n for j in range(int(N/7)):\n if i * 4 + j * 7 <= 100:\n l.append(i * 4 + j * 7)\n\nif N in l:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\nl = []\n\n\nfor i in range(int(N/4 + 1)):\n for j in range(int(N/7 + 1)):\n if i * 4 + j * 7 <= 100:\n l.append(i * 4 + j * 7)\n\nif N in l:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s080311826', 's102092497'] | [3060.0, 3060.0] | [17.0, 17.0] | [200, 229] |
p03285 | u075303794 | 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 range(101):\n for j in range(101):\n if 4*i + 7*j == N:\n print('Yes')\n sys.exit()\nelse:\n print('No')", "import sys\n \nN=int(input())\n \nfor i in range(101):\n for j in range(101):\n if 4*i + 7*j == N:\n print('Yes')\n sys.exit()\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s441954620', 's333234398'] | [8932.0, 9072.0] | [28.0, 29.0] | [147, 152] |
p03285 | u077291787 | 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. | ['# ABC105B - Cakes and Donuts\ndef main():\n N = int(input())\n flg = N % 4 == 0 or N % 7 == 0\n if flg:\n print("Yes")\n elif N < 4:\n print("No")\n else:\n while N > 7:\n N -= 4\n if flg:\n print("Yes")\n return\n print("No")\n\n\nif __name__ == "__main__":\n main()', '# ABC105B - Cakes and Donuts\ndef main():\n N = int(input())\n if N % 4 == 0 or N % 7 == 0:\n print("Yes")\n elif N < 4:\n print("No")\n else:\n while N > 7:\n N -= 4\n if N % 4 == 0 or N % 7 == 0:\n print("Yes")\n return\n print("No")\n\n\nif __name__ == "__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s677815308', 's525264907'] | [3060.0, 3060.0] | [17.0, 18.0] | [347, 354] |
p03285 | u079022116 | 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 a in range(n//4):\n for b in range(n//7):\n if n == 4*a+7*b:\n print('Yes')\n break\nprint('No')\n ", "n = int(input())\nfor a in range(n//4+1):\n for b in range(n//7+1):\n if n == 4*a+7*b:\n print('Yes')\n exit()\nprint('No')\n "] | ['Wrong Answer', 'Accepted'] | ['s248863071', 's938872312'] | [2940.0, 2940.0] | [17.0, 17.0] | [131, 136] |
p03285 | u089142196 | 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+1):\n for j in range(N//7+1):\n if 4*i+7*j==N:\n print("Yes")\n break\nelse:\n print("No")', 'N=int(input())\n\nfor i in range(N//4+1):\n for i in range(N//7+1):\n if 4*i+7*j==N:\n print("Yes")\n break\nelse:\n print("No")', 'N=int(input())\nflag=False\n\nfor i in range(N//4+1):\n if flag==False:\n for j in range(N//7+1):\n if 4*i+7*j==N:\n print("Yes")\n flag=True\n break\n\n\nif flag==False:\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s010561875', 's392775668', 's033189079'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [135, 135, 202] |
p03285 | u093033848 | 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\ntorf = False\n\nfor i in range(0, n//4 + 1):\n print(n-i*4)\n if (n - i * 4) % 7 == 0:\n torf = True\n break\n \nif torf:\n print("Yes")\nelse :\n print("No")\n\n', 'n = int(input())\n\ntorf = False\n\nfor i in range(0, n//4 + 1):\n if (n - i * 4) % 7 == 0:\n torf = True\n break\n \nif torf:\n print("Yes")\nelse :\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s962947199', 's743899893'] | [2940.0, 2940.0] | [17.0, 17.0] | [200, 182] |
p03285 | u094778153 | 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 cal_ans(num):\n for num1 in range(25):\n for num2 in range(15):\n if num1 * 4 + num2 * 7 == num:\n return "yes"\n return "no"\n\n\nif __name__ == \'__main__\':\n N = int(input())\n print(cal_ans(N))\n', 'def cal_ans(_N):\n for num1 in range(25):\n for num2 in range(15):\n if num1 * 4 + num2 * 7 == _N:\n return "yes"\n return "no"\n\n\nif __name__ == \'__main__\':\n array = list(map(int, input().split()))\n N = array[0]\n print(cal_ans(N))\n', 'def cal_ans(num):\n for num1 in range(25):\n for num2 in range(15):\n if num1 * 4 + num2 * 7 == num:\n return "Yes"\n return "No"\n\n\nif __name__ == \'__main__\':\n N = int(input())\n print(cal_ans(N))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s278848459', 's776660799', 's509657899'] | [3068.0, 3064.0, 3068.0] | [17.0, 17.0, 17.0] | [236, 274, 236] |
p03285 | u100800700 | 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. | ["#Cakes and Donuts\nn = int(input())\nprint('Yes' if[1 for a in range(n//7+1) for b in range(n//4+1) if a*7+b*4=n] else 'No')", 'n = int(input())\nprint("Yes" if [1 for a in range(n//7+1) for b in range(n//4+1) if a*7+b*4 == n] else "No")'] | ['Runtime Error', 'Accepted'] | ['s885793513', 's212569068'] | [2940.0, 2940.0] | [18.0, 17.0] | [122, 108] |
p03285 | u102126195 | 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())\nkey = 0\nfor i in range(int(N / 4)):\n if (N - 4 * N) % 7 == 0:\n key = 1\n break\nif key == 1:\n print("Yes")\nelse:\n print("No")\n', 'N = int(input())\nkey = 0\nfor i in range(int(N / 4) + 1):\n if (N - 4 * i) % 7 == 0:\n key = 1\n break\nif key == 1:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s919699596', 's735757118'] | [2940.0, 2940.0] | [17.0, 17.0] | [164, 168] |
p03285 | u102960641 | 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 // 7 + 1):\n if (n - i*7) % 4 == 0:\n ans == "Yes"\n break\nprint(ans)\n', 'n = int(input())\nans = "No"\nfor i in range(n // 7 + 1):\n print(n - i*7)\n if (n - i*7) % 4 == 0:\n ans = "Yes"\nprint(ans)\n', 'n = int(input())\nans = "No"\nfor i in range(n // 7):\n if (n - (i+1)*7) % 4 == 0:\n ans == "Yes"\nprint(ans)', 'n = int(input())\nans = "No"\nfor i in range(n // 7 + 1):\n if (n - i*7) % 4 == 0:\n ans = "Yes"\n break\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s222627145', 's316242010', 's829503592', 's867598006'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0, 25.0] | [119, 125, 108, 118] |
p03285 | u106778233 | 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(30):\n for j in range(20):\n if 4*i + 7*j == n :\n ans +=1 \nprint(ans)', 'n = int(input())\nans = 0\nfor i in range(30):\n for j in range(20):\n if 4*i + 7*j == n :\n ans +=1 \nif ans:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s640683364', 's027048193'] | [9124.0, 8968.0] | [32.0, 28.0] | [128, 164] |
p03285 | u111652094 | 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((N+1)//4):\n for j in range((N+1)//7):\n if N == 4*i+7*j:\n print ("Yes")\n sys.exit()\n \nprint("N0")', 'import sys\n\nN = int(input())\n\nfor i in range(N+1):\n for j in range(N+1):\n if N == 4*i+7*j:\n print ("Yes")\n sys.exit()\n \nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s114622807', 's226664925'] | [2940.0, 2940.0] | [17.0, 17.0] | [176, 166] |
p03285 | u117348081 | 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==0:\n print(0)\n exit()\nx = n\nans = []\nwhile x!=1:\n if x%2==0:\n ans.append("0")\n else:\n ans.append("1")\n x -= 1\n x = x//(-2)\nans.append("1")\nprint("".join(ans[::-1]))', 'n = int(input())\ni = 0\nwhile n-4*i>=0:\n if (n-4*i)%7==0:\n print("Yes")\n exit()\n else:\n i+=1\nprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s685911154', 's242985796'] | [3064.0, 2940.0] | [17.0, 17.0] | [222, 130] |
p03285 | u117545210 | 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=4\nb=7\nd= n//a\nif n % b ==0 or n % a ==0:\n print("Yes")\nelif n < a:\n print("No")\nelse:\n for x in range(d+1):\n for y in range(d+1):\n nn= a*int(x) + b*int(y)\n if nn == n:\n print("Yes")\n break\n else:\n continue\n\n if nn > n:\n print("No")\n break\n else:\n continue\n\n if nn == n:\n break\n elif nn > n:\n print("No")\n break\n else:\n continue', 'n=int(input())\n\np=0\nfor y in range(n//7+1):\n x=n/4 - 7*y/4\n if x.is_integer() == True and x>-1:\n p += 1\n break\n else:\n continue\nif p == 1:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s315792752', 's820942226'] | [3064.0, 2940.0] | [17.0, 17.0] | [571, 185] |
p03285 | u121921603 | 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())\ni=0\nwhile True:\n j=0\n while True:\n if i*4+j*7==n:\n print("Yes")\n exit()\n j+=1\n if i*4+j*7>n:\n break\n i+=1\n if i*4+j*7>n:\n break\nprint("No")\n', 'n=int(input())\ni=0\nwhile True:\n j=0\n if i*4+j*7>n:\n break\n while True:\n if i*4+j*7==n:\n print("Yes")\n exit()\n j+=1\n if i*4+j*7>n:\n break\n i+=1\n\nprint("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s554947831', 's782898323'] | [2940.0, 2940.0] | [18.0, 17.0] | [228, 229] |
p03285 | u123135189 | 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. | ['c = 4 * 7\nn = int(input()) % c\ni = n\nwhile 0 < i:\n j = i\n while 0 < j:\n print(i, j)\n j -= 7\n if j == 0:\n print("Yes")\n exit()\n i -= 4\n if i == 0:\n print("Yes")\n exit()\nprint("No")\n', 'c = 4 * 7\nn = int(input())\nif n == c:\n print("Yes")\n exit()\nm = n % c\ni = n\nwhile 0 < i:\n j = i\n while 0 < j:\n j -= 7\n if j == 0:\n print("Yes")\n exit()\n i -= 4\n if i == 0:\n print("Yes")\n exit()\nprint("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s710412630', 's734120132'] | [3060.0, 3060.0] | [17.0, 17.0] | [249, 274] |
p03285 | u124592621 | 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\nisExist = False\nfor i in range(int(n / 7)):\n for j in range(int(n / 4)):\n if (7 * i + 4 * j == n):\n isExist = True\n break\nif isExist:\n print("Yes")\nelse:\n print("No")', 'n = int(input())\nif (n % 11 % 4 % 7):\n print("Yes")\nelse:\n print("No")', 'n = int(input())\n \nisExist = False\n\nfor i in range(int(n / 7) + 1):\n for j in range(int(n / 4) + 1):\n if (7 * i + 4 * j == n):\n isExist = True\n break\n\nif isExist:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s320343574', 's789129182', 's571773093'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [200, 72, 212] |
p03285 | u125505541 | 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())\nflag = False\nfor x in range(100):\n for y in range(100):\n flag = (4*x+7*y==n)\nif flag:\n print("Yes")\nelse\n print("No")', 'n = int(input())\nflag = False\nfor x in range(100):\n for y in range(100):\n if 4*x+7*y==n:\n flag = True\nif flag:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s882689978', 's446311516'] | [2940.0, 2940.0] | [17.0, 19.0] | [150, 170] |
p03285 | u126844573 | 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 q in range(0, n, 7):\n if q == 0:\n continue\n if q % 4 == 0:\n print("Yes")\n exit(0)\nprint("No" if (n % 4 != 0) and (n % 7 != 0) else "Yes")', 'n = int(input())\nfor q in range(0, n, 7):\n if q == 0:\n continue\n if (n - q) % 4 == 0:\n print("Yes")\n exit(0)\nprint("No" if (n % 4 != 0) and (n % 7 != 0) else "Yes")'] | ['Wrong Answer', 'Accepted'] | ['s088288737', 's315681537'] | [2940.0, 3060.0] | [17.0, 19.0] | [185, 191] |
p03285 | u128908475 | 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\ncount = 0\nfor i in range(x+1):\n y = N - 7*i\n print(y)\n if y % 4 == 0:\n count += 1\nif count != 0:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nx = N//7\ncount = 0\nfor i in range(x+1):\n y = N - 7*i\n if y % 4 == 0:\n count += 1\nif count != 0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s116883317', 's941401136'] | [2940.0, 3060.0] | [17.0, 18.0] | [163, 152] |
p03285 | u131411061 | 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())\nans = 0\ndef dfs(n):\n print(n)\n if n == N:\n sys.exit()\n if n > N:\n return\n\n dfs(n+4)\n dfs(n+7)\n\ndfs(0)\nprint('No')", "import sys\nN = int(input())\nans = 0\ndef dfs(n):\n if n == N:\n sys.exit()\n if n > N:\n return\n\n dfs(n+4)\n dfs(n+7)\n\ndfs(0)\nprint('No')", "import sys\nN = int(input())\nans = 0\ndef dfs(n):\n if n == N:\n print('Yes')\n sys.exit()\n if n > N:\n return\n\n dfs(n+4)\n dfs(n+7)\n\ndfs(0)\nprint('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s194670208', 's210979188', 's324069664'] | [2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0] | [170, 157, 178] |
p03285 | u133886644 | 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\nsys.setrecursionlimit(200000)\ninput = sys.stdin.readline\n\nN, = map(int, input().split())\n\nfor i in range(100):\n for j in range(100):\n if i == 0 and j == 0:\n continue\n if N == i * 4 + j * 7:\n print("YES")\n exit()\n\nprint("NO")', 'import sys\nsys.setrecursionlimit(200000)\ninput = sys.stdin.readline\n\nN, = map(int, input().split())\n\nfor i in range(100):\n for j in range(100):\n if N == i * 4 + j * 7:\n print("YES")\n exit()\n\nprint("NO")', 'import sys\nsys.setrecursionlimit(200000)\ninput = sys.stdin.readline\n\nN, = map(int, input().split())\n\nfor i in range(100):\n for j in range(100):\n if i == 0 and j == 0:\n continue\n if N == i * 4 + j * 7:\n print("Yes")\n exit()\n\nprint("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s412692182', 's902686601', 's545079042'] | [3060.0, 3060.0, 3060.0] | [19.0, 19.0, 20.0] | [285, 234, 285] |
p03285 | u135282263 | 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 exit(0)\n\nn=N%7\nwhile(n<N):\n if(n%4==0):\n print('YES')\n exit(0)\n else:\n n+=7\n\nprint('No')", "N = int(input())\n\nif(N%4==0 or N%7==0):\n print('Yes')\n exit(0)\n\nn=N%7\nwhile(n<N):\n if(n%4==0):\n print('Yes')\n exit(0)\n else:\n n+=7\n\nprint('No')"] | ['Wrong Answer', 'Accepted'] | ['s144011148', 's908590707'] | [3060.0, 3060.0] | [17.0, 18.0] | [177, 177] |
p03285 | u135572611 | 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 or n % 7 == 0:\n print("Yes");\nelse:\n while n > 0:\n n -= 4\n if n % 7 == 0:\n print("Yes")\n return\n print("No")', 'n=int(input())\nif n % 4 == 0 or n % 7 == 0:\n print("Yes");\nelse:\n while n > 0:\n n -= 4\n if n % 7 == 0:\n print("Yes");\n return\n print("No");\n \n', 'n=int(input())\nif n % 4 == 0 or n % 7 == 0:\n\tprint("Yes");\nelse:\n\twhile n > 0:\n\t\tn -= 4\n\t\tif n % 7 == 0:\n\t\t\tprint("Yes")\n\t\t\texit()\n\tprint("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s438752429', 's538442778', 's325602856'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [156, 164, 143] |
p03285 | u136090046 | 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())\narray = []\nfor i in range(1, 101, 4):\n for j in range(1, 101, 7):\n array.append(i)\n array.append(j)\nif n in array:\n print("Yes")\nelse:\n print("No")\n', 'n = int(input())\narray = []\nfor i in range(0, 101, 4):\n for j in range(0, 101, 7):\n array.append(i)\n array.append(i+j)\nif n in array:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s872055535', 's393594139'] | [2940.0, 2940.0] | [17.0, 18.0] | [188, 190] |
p03285 | u139112865 | 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. | ["#105_B\nN=int(input())\nflg=False\nfor i in range(0,N//7+1):\n x=N\n x=x-7*i\n if N%4==0:\n flg=True\n break\nprint('Yes' if flg else 'No')", "#105_B\nN=int(input())\nflg=False\nfor i in range(0,N//7+1):\n x=N\n x=x-7*i\n if x%4==0:\n flg=True\n break\nprint('Yes' if flg else 'No')"] | ['Wrong Answer', 'Accepted'] | ['s153145318', 's357950691'] | [2940.0, 3064.0] | [17.0, 17.0] | [153, 153] |
p03285 | u142903114 | 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())\nis_equal = 'No'\nfor r_1 in range(n//4 + 1):\n sum_4 = r * 4\n for r_2 in range(n//7 + 1):\n sum_7 = r2 * 7\n if sum_4 + sum_7 == n:\n is_equal = 'Yes'\nprint(is_equal)", "n = int(input())\nfor r_1 in range(n//4 + 1):\n sum_4 = r_1 * 4\n for r_2 in range(n//7 + 1):\n sum_7 = r_2 * 7\n if sum_4 + sum_7 == n:\n print('Yes')\n exit()\nprint('No')"] | ['Runtime Error', 'Accepted'] | ['s047050500', 's798894686'] | [2940.0, 2940.0] | [17.0, 17.0] | [209, 207] |
p03285 | u143051858 | 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(1,(n//4)):\n for j in range(1,(n//7)):\n if (i*4)+(j*7)==n:\n print('Yes')\n exit()\nprint('No')", "n=int(input())\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')"] | ['Wrong Answer', 'Accepted'] | ['s192697900', 's747422577'] | [2940.0, 3060.0] | [17.0, 17.0] | [153, 153] |
p03285 | u143100985 | 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()) \ni = 0 \nj = 0\nwhile(i < 100):\n while(j < 100):\n if 7* i + 4 * j == n:\n print("Yes")\n sys.exit()\n j+= 1\n i+= 1\n\nprint("No")\n', 'import sys\nn = int(input()) \nfor i in range(100):\n for j in range(100):\n if 7* i + 4 * j == n:\n print("Yes")\n sys.exit()\n\nprint("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s759575562', 's930750859'] | [2940.0, 2940.0] | [17.0, 18.0] | [193, 166] |
p03285 | u143509139 | 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. | ["print('YNeos'[int(input()) in[1,2,3,5,6,9,10,13,17]])", "print('YNeos'[int(input()) in[1,2,3,5,6,9,10,13,17]::2])\n"] | ['Wrong Answer', 'Accepted'] | ['s534545589', 's616432994'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 57] |
p03285 | u148953667 | 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:\n print("Yes")\n break\nelif(N%7)==0:\n print("Yes")\n break\nelif(N%11)==0:\n print("Yes")\n break\nwhile N>0:\n i=1\n N=N-11*i\n if(N%4)==0 or (N%7)==0:\n print("Yes")\n break\n i=i+1\nelse:\n print("No")', 'N=int(input())\n\nif (N%4)==0:\n print("Yes")\nelif(N%7)==0:\n print("Yes")\nelif(N%11)==0:\n print("Yes")\nwhile N>0:\n i=1\n N=N-11*i\n if(N%4)==0 or (N%7)==0:\n print("Yes")\n break\n i=i+1\nelse:\n print("No")', 'N=int(input())\n\nif (N%4)==0:\n print("Yes")\nelif(N%7)==0:\n print("Yes")\nelif(N%11)==0:\n print("Yes")\nelif(1):\n while N>0:\n i=1\n N=N-11*i\n if(N<0):\n print("No")\n break\n if(N%4)==0 or (N%7)==0:\n print("Yes")\n break\n i=i+1'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s130488642', 's937784279', 's258072819'] | [3064.0, 3064.0, 3060.0] | [18.0, 17.0, 17.0] | [265, 235, 309] |
p03285 | u150603590 | 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())\nupper=N//7\nflag=False\nfor i in range(upper):\n for j in range(upper):\n if 7*i+4*j==N:\n flag=True\n break\n\nif flag:\n print('Yes')\nelse:\n print('No')\n\n\n\n", "N=int(input())\nupper_cake=N//7\nupper_d=N//4\nflag=False\nfor i in range(upper_cake+1):\n for j in range(upper_d+1):\n if 7*i+4*j==N:\n flag=True\n break\n\nif flag:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s282547925', 's770326854'] | [2940.0, 2940.0] | [18.0, 17.0] | [246, 271] |
p03285 | u151365505 | 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 N % 4 == 0 or N % 7 == 0 or N % 11 == 0 or N % 4 == 7 or N % 7 == 4 or N % 11 == 7 or N % 11 == 4:\n print('Yes') \nelse :\n print('No')", "N =int(input())\n\nfor i in range(0, 100//7):\n for j in range(0, 100//4):\n if 7*i + 4*j == N:\n print('Yes')\n exit()\n\nprint('No')"] | ['Runtime Error', 'Accepted'] | ['s310771998', 's298255246'] | [2940.0, 2940.0] | [17.0, 17.0] | [144, 158] |
p03285 | u156383602 | 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:\n print("Yes")\nelif (n-4*(n//4))%7==0:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nok=False\nif n%4==0:\n print("Yes")\nelse:\n while n>0:\n if n%7==0:\n ok=True\n break\n n-=4\n if ok:\n print("Yes")\n else:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s553557354', 's175626560'] | [2940.0, 2940.0] | [17.0, 17.0] | [105, 204] |
p03285 | u162893962 | 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\nmoney = False\nif N % 4 == 0 or N % 7 == 0:\n money = True\n\nfor i in range(1, N+1):\n if N % 4 * i / 7 == 0:\n money = True\n break\n\nif money:\n print('Yes')\nelse:\n print('No')", "N = int(input())\n\ncombi = False\nfor i in range(N//4+1):\n if (N - 4 * i) % 7 == 0:\n combi = True\nif combi:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s224636487', 's601589385'] | [2940.0, 2940.0] | [17.0, 17.0] | [210, 154] |
p03285 | u163874353 | 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(26):\n for j in range(16):\n if 4 *i + 7 *j == n:\n cnt += 1\n print(i, j)\nif cnt >= 1:\n print("Yes")\nelse:\n print("No")', '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\n \nif cnt >= 1:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s346723550', 's695900446'] | [3064.0, 2940.0] | [17.0, 18.0] | [194, 184] |
p03285 | u165268875 | 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. | ['\nN = int(input())\n\nfor i in range(N//4) :\n for j in range(N//7) :\n if N == 4*i + 7*j :\n print("Yes")\n else :\n print("No")\n \n', '\nN = int(input())\n\nA = []\nfor i in range((N//4)+1) :\n for j in range((N//7)+1) :\n if N == 4*i + 7*j :\n A.append("Yes")\n else :\n A.append("No")\n\nif "Yes" in A :\n print("Yes")\nelse :\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s555774026', 's206039798'] | [3060.0, 2940.0] | [17.0, 17.0] | [174, 239] |
p03285 | u167908302 | 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())\n\n\nfor i in range(n//4):\n for j in range(n//7):\n if 4*i + 7*j == n:\n print('Yes')\n exit()\n\nprint('No')\n", "#coding:utf-8\nn = int(input())\n\n\nfor i in range(n//7):\n for j in range(n//4):\n if 7*i + 4*j == n:\n print('Yes')\n exit()\n\nprint('No')\n", "#coding:utf-8\nn = int(input())\n\n\nfor i in range(1 + n//4):\n for j in range(1 + n//7):\n if 4*i + 7*j == n:\n print('Yes')\n exit()\n\nprint('No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s544437068', 's955648053', 's580709825'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [175, 175, 183] |
p03285 | u170077602 | 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())\nmax_4 = int(N/4)\nmax_7 = int(N/7)\nFlag = 0\nfor i in range(max_4):\n for j in range(max_7):\n if N == i*4 + j*7:\n Flag = 1\n break\n if Flag == 1:\n break\nif Flag == 1:\n print("Yes")\nelse:\n print("No")\n ', 'N = int(input())\nmax_4 = int(N/4)+1\nmax_7 = int(N/7)+1\nFlag = 0\nfor i in range(max_4):\n for j in range(max_7):\n if N == i*4 + j*7:\n Flag = 1\n break\n if Flag == 1:\n break\nif Flag == 1:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s057675338', 's275018927'] | [3064.0, 3060.0] | [17.0, 17.0] | [269, 264] |
p03285 | u174273188 | 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 solve():\n n = int(input())\n max_cake = n // 4\n max_donut = n // 7\n for c in range(max_cake + 1):\n for d in range(max_donut + 1):\n if n == 4 * c + 7 * d:\n return "Yes"\n return "No"\n\n\nif __name__ == "__main__":\n solve()\n', 'def solve():\n n = int(input())\n max_cake = n // 4\n max_donut = n // 7\n for c in range(max_cake + 1):\n for d in range(max_donut + 1):\n if n == 4 * c + 7 * d:\n return "Yes"\n return "No"\n\n\nif __name__ == "__main__":\n print(solve())\n'] | ['Wrong Answer', 'Accepted'] | ['s096237536', 's306187551'] | [2940.0, 2940.0] | [17.0, 17.0] | [273, 280] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.