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 | u484216426 | 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 = list(map(int, input().split()))\nprint(n)\n\nif(n[0] % n[1] == 0):\n print("0")\nelse:\n print("1")\n', 'import sys\nN = int(input())\n\ns = 0\n\nwhile(s <= N):\n if((N - s) % 4 == 0):\n print("Yes")\n sw = 1\n sys.exit()\n s += 7\n\n\nprint("No")', 'n = int(input())\nk = int(input())\n\nif(n % k == 0):\n print("0")\nelse:\n print("1")', 'n = list(map(int, input().split()))\n\nif(n[0] % n[1] == 0):\n print("0")\nelse:\n print("1")'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s496823861', 's524696507', 's709458455', 's904250956'] | [2940.0, 3060.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0, 18.0] | [104, 156, 86, 94] |
p03284 | u485566817 | 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'] | ['s994494920', 's015379811'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 83] |
p03284 | u487288850 | 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(min(a%b,0))', 'a,b = map(int,input().split())\nprint(min(a%b,1))'] | ['Wrong Answer', 'Accepted'] | ['s760025246', 's444974494'] | [9048.0, 9032.0] | [30.0, 28.0] | [48, 48] |
p03284 | u488178971 | 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())\n\ncnt =0\n\nfor i in range(26):\n for j in range(15):\n if i * 4 + j * 7 == n:\n cnt +=1\nif cnt >0:\n print('Yes')\nelse:\n print('No')", "n = int(input()1\nfor i in range(26):\n for j in range(15):\n if i * 4 + j * 7 == n:\n cnt +=1\nif cnt >0:\n print('Yes')\nelse:\n print('No')", '#105 A\nimport math\nN,K= map(int,input().split())\nprint(abs(math.ceil(N/K)- N//K))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s505133405', 's685347533', 's733113287'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [170, 161, 81] |
p03284 | u490553751 | 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\ninput = sys.stdin.readline\nN,K = [int(i) for i in input().split()]\nprint(N//K)', 'import sys\ninput = sys.stdin.readline\nN,K = [int(i) for i in input().split()]\nif N % K == 0 :\n print(0)\nelse :\n print(1)'] | ['Wrong Answer', 'Accepted'] | ['s072959709', 's472040043'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 126] |
p03284 | u498486375 | 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=a[0]\nk=a[1]\nif n%k==0:\n print('0')\nelse:\n print('1')", "a=list(map(int, input().split()))\nn=a[0]\nk=a[1]\nif n%k==0:\n print('0')\nelse:\n print('1')"] | ['Runtime Error', 'Accepted'] | ['s562393911', 's282864465'] | [2940.0, 2940.0] | [17.0, 17.0] | [60, 94] |
p03284 | u499267715 | 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. | ['s = input("number of senbei:")\np = input("number of people:")\nN = int(s)\nK = int(p)\n\nmember = []\nfor i in range(K):\n member.append(0)\n\nn = N\n\nif N <= K:\n for j in range(N):\n member[j] += 1\n print(member[0] - member[-1])\nelse:\n while n > 0:\n for l in range(K):\n member[l] += 1\n n = n - K\n if n >= K:\n continue\n elif 0 < n < K:\n for l in range(n):\n member[l] += 1\n print(member[0] - member[-1])', 's = input("number of senbei:")\np = input("number of people:")\nN = int(s)\nK = int(p)\n\nif N % K == 0:\n print(0)\nelse:\n print(1)', 'N,M = (int(i) for i in input().split())\na = input()\ns = a.split()\nA = []\nfor i in range(N):\n A.append(int(s[i]))\n\ncount = 0\ntotal = 0\n\nfor r in range(N):\n for j in range(int(r+1)):\n l = j\n total = 0\n while l <= r:\n total += A[l]\n if l == r:\n if total % M == 0:\n count += 1\n break\n else:\n break\n else:\n l += 1\nprint(count)', 'N,K = (int(i) for i in input().split())\n\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s358608016', 's565682706', 's587794522', 's395957631'] | [3064.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [490, 131, 483, 87] |
p03284 | u501163846 | 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())\nl=[]\ntmp=n\ni=0\nwhile abs(tmp)>=(2**(i)):\n if tmp%(2**(i+1))!=0:\n l.append(1)\n tmp=tmp-(-2)**i\n i+=1\n else:\n l.append(0)\n i+=1\nl=l[::-1]\nl=map(str,l)\nl="".join(l)\nprint(l)\n', 'n,k=map(int,input().split())\nif n%k==0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s231566091', 's356763104'] | [3060.0, 2940.0] | [18.0, 17.0] | [227, 72] |
p03284 | u502389123 | 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())\n\nif N % K:\n print(1)\nelse:\n print(0)', 'N, K = map(int, input().split())\n\nif N % K:\n print(1)\nelse:\n print(0)\n'] | ['Runtime Error', 'Accepted'] | ['s495807039', 's988557723'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 76] |
p03284 | u503901534 | 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(k - n% k)', 'n, k = map(int,input().split())\nif n % k == 0:\n print(0)\nelse:\n print(1)'] | ['Wrong Answer', 'Accepted'] | ['s879346954', 's445565217'] | [3316.0, 2940.0] | [19.0, 17.0] | [85, 78] |
p03284 | u514894322 | 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'] | ['s457840767', 's090523500'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 70] |
p03284 | u516242950 | 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(n // k)\nelse:\n print(n // k + 1)', 'n, k = map(int, input().split())\nif n % k == 0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Accepted'] | ['s026253772', 's569031685'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 76] |
p03284 | u521240302 | 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\n[N, M] = [int(x) for x in input().split(" ")]\nA = [int(x) for x in input().split(" ")]\n\nret = 0\nfor l in range(0, N):\n Sum = 0\n for r in range(l, N):\n Sum += A[r]\n if Sum % M == 0:\n ret += 1\nprint(ret)\n', '#!/usr/bin/env python3\n\n[N, K] = [int(x) for x in input().split(" ")]\nprint(0 if (N % K == 0) else 1)'] | ['Runtime Error', 'Accepted'] | ['s919554924', 's243614013'] | [3060.0, 2940.0] | [17.0, 18.0] | [257, 101] |
p03284 | u528748570 | 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 = input().split()\nif N % K == 0:\n print("0")\nelse:\n print("1") \n', 'N, K = int(input().split())\nif N % K == 0:\n print("0")\nelse:\n print("1")\n', 'N, K = map(int(input().split()))\nif N % K == 0:\n print("0")\nelse:\n print("1")\n', 'N, K = map(int, (input().split()))\nif N % K == 0:\n print("0")\nelse:\n print("1")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s071154695', 's481230995', 's928688987', 's791481637'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [75, 79, 84, 86] |
p03284 | u533482278 | 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(a//b if a>b else b//a)\n', 'a,b = map(int,input().split())\nprint(1 if a<b or a%b!=0 else 0)\n'] | ['Wrong Answer', 'Accepted'] | ['s040208951', 's371685822'] | [2940.0, 3064.0] | [17.0, 17.0] | [60, 64] |
p03284 | u533885955 | 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(" "))\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'] | ['s361393004', 's926040981'] | [2940.0, 2940.0] | [17.0, 18.0] | [71, 74] |
p03284 | u534504780 | 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. | ['num = [int(e) for e in input().split()]\nN=num[0]\nK=num[1]\nif B%A==0:\n print(0)\nelse:\n print(1)', 'num = [int(e) for e in input().split()]\nN=num[0]\nK=num[1]\nif N%K==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s967560490', 's377959492'] | [2940.0, 2940.0] | [17.0, 17.0] | [100, 100] |
p03284 | u535827181 | 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 % 4 == 3 or n % 4 == 0:\n print('Yes')\nelse:\n print('No')", 'N, K = (int(i) for i in input().split())\nif N % K == 0:\n print(int(0))\nelse :\n print(int(1))'] | ['Runtime Error', 'Accepted'] | ['s297234722', 's861913859'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 96] |
p03284 | u535907456 | 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())\n\nif N % K == 0:\n print(0)\nelse:\n print(1)', 'N,K = map(int,input().split())\n\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s465889889', 's317542904'] | [2940.0, 2940.0] | [18.0, 18.0] | [70, 78] |
p03284 | u537859408 | 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, K = map(int, input().split())\nprint(0 if N % K == 0 else 1)'] | ['Wrong Answer', 'Accepted'] | ['s909579660', 's377682211'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 62] |
p03284 | u538739837 | 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(int(n/4)+1):\n for j in range(int(n/7)+1):\n if(i*4+j*7==n):\n flag=True\n\nif(flag==True):\n print("Yes")\nelse:\n print("No")\n', 'n=int(input())\nflag=False\nfor i in range(int(n/4)):\n for j in range(int(n/7)):\n if(i*4+j*7==n):\n flag=True\n\nif(flag==True):\n print("Yes")\nelse:\n print("No")\n', 'n,k=map(int,input().split())\nif(n%k==0):\n print("0")\nelse:\n print("1")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s072621034', 's436161318', 's432584909'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [188, 184, 76] |
p03284 | u544050502 | 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)', 'print((eval(input().replace(" ","%"))>0)+0)'] | ['Wrong Answer', 'Accepted'] | ['s551224402', 's181289481'] | [2940.0, 2940.0] | [17.0, 18.0] | [40, 43] |
p03284 | u548624367 | 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((int(input())%int(input())+99)/100)', 'print((int(input())%int(input())+99)//100)', 'n,k=map(int,input().split())\nprint((n%k+99)//100)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s467179472', 's706240545', 's217013848'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [41, 42, 49] |
p03284 | u552502395 | 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\nN = int(input())\nfor i4 in range(N):\n for i7 in range(N):\n if i4 * 4 + i7 * 7 == N:\n print("Yes")\n sys.exit(0)\nprint("No")', 'N, K=map(int, input().split())\nprint(0 if N%K==0 else 1);\n'] | ['Runtime Error', 'Accepted'] | ['s209862503', 's018615172'] | [2940.0, 2940.0] | [17.0, 17.0] | [147, 58] |
p03284 | u556225812 | 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. | ['from itertools import accumulate\nN, M = map(int, input().split())\nA = list(map(int, input().split()))\n\nB = [0] + A\nC = {}\nB = list(accumulate(B))\nfor i in range(1, len(B)):\n if B[i]%M not in C:\n C[B[i]%M] = 1\n else:\n C[B[i]%M] += 1\nans = 0\nfor i in C.values():\n ans += i*(i-1)//2\nif 0 in C:\n ans += C[0]\nprint(ans)', 'N, K = map(int, input().split())\nif N%K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s387114356', 's327855760'] | [3064.0, 2940.0] | [17.0, 18.0] | [340, 73] |
p03284 | u557168336 | 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+1)//k)', 'n,k=map(int,input().split())\nprint((n+k-1)//k)\n', 'n,k=map(int,input().split())\nprint(int(n%k>0))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s159053638', 's553465890', 's676394618'] | [2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0] | [46, 47, 46] |
p03284 | u559103167 | 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)', 'n,k = map(int, input().split())\nprint(1 if n%k else 0)'] | ['Wrong Answer', 'Accepted'] | ['s145622206', 's370067250'] | [2940.0, 2940.0] | [18.0, 17.0] | [43, 54] |
p03284 | u564700790 | 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 = input().split()\n\nif N%M ==0:\n print(0)\nelse:\n print(1)', 'N,M = map(int,input().split())\n\nif N%M == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s411429476', 's130934593'] | [2940.0, 2940.0] | [19.0, 17.0] | [66, 76] |
p03284 | u566428756 | 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())\nd,m=divmod(n,k)\nprint(d,m)\nif m==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)'] | ['Wrong Answer', 'Accepted'] | ['s786354512', 's204669331'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 71] |
p03284 | u569117803 | 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())\n\nc = n // 4\n\nans = 0\n\nfor i in range(c+1):\n d = (n - i*4) // 7\n for v in range(d+1):\n buy = i*4 + v*7\n check = buy - n\n \n if check == 0:\n ans = "Yes"\n break\n if ans == "Yes":\n break\n \n\nif ans == "Yes":\n print("Yes")\nelse:\n print("No")', 'n = int(input())\n\nc = n // 4\n\nans = 0\n\nfor i in range(c+1):\n d = (n - i*4) // 7\n for v in range(d+1):\n buy = i*4 + v*7\n check = buy - n\n \n if check == 0:\n ans = "Yes"\n break\n if ans == "Yes":\n break\n \n\nif ans == "Yes":\n print("Yes")\nelse:\n print("No")', 'n = int(input())\n\nc = n // 4\n\nans = 0\n\nfor i in range(c+1):\n d = (n - i*4) // 7\n for v in range(d+1):\n buy = i*4 + v*7\n check = buy - n\n \n if check == 0:\n ans = "Yes"\n \nif ans == "Yes":\n print("Yes")\nelse:\n print("No")', 'n, k = list(map(int, input().split(" ")))\nans = n % k\nif ans > 0:\n print(1)\nelse:\n print(0)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s080333218', 's156570551', 's448775051', 's067434283'] | [3060.0, 3060.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [330, 330, 276, 97] |
p03284 | u571444155 | 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 print("1")\n', 'N, M = list(map(int, input().split()))\n\nD = list(map(int, input().split()))\n\nS = {0 : 1}\nt = 0\nfor i in range(N):\n t = (t + D[i]) % M\n if t in S:\n S[t] += 1\n else:\n S[t] = 1\n\nr = 0\n\nfor i in S.values():\n r += i * (i - 1) // 2\n \nprint(r)', 'n , k = map(int, input().split())\n\nif n % k == 0:\n print("0")\nelse:\n print("1")\n\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s711910910', 's946378689', 's176268044'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [87, 247, 87] |
p03284 | u571445182 | 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. | ['\nN, K=map(int,input().split())\n\nA = N % K\n\nif A==0:\n print(1)\nelse:\n print(0)\n\n', 'N, K=map(int,input().split())\n \nA = N % K\n \nif A==0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Accepted'] | ['s897723877', 's044516214'] | [2940.0, 2940.0] | [21.0, 17.0] | [81, 81] |
p03284 | u575101291 | 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()\nK = input()\nmod = N%K\nif mod=0:\n print('0')\nelse:\n print('1')\n", 'N=int(input())\nK=int(input())\nif N%K =0:\n print("0")\nelse:\n print("1")\n', 'N=int(input())\nK=int(input())\nif N%K == 0:\n print(0)\nelse:\n print(1)\n', 'N = int(input())\nK = int(input())\nmod=N%K\nif mod=0:\n print("0")\nelse:\n print("1")\n', 'N = input()\nK = input()\nmod = N%K\nif mod=0:\n print"0"\nelse:\n print"1"\n', 'N=int(input())\nK=int(input())\nif N%K =0:\n print("0")\n else:\n print("1")\n', 'N = input()\nK = input()\nmod = N%K\nif mod=0:\n print("0")\nelse:\n print("1")\n', 'N=int(input())\nK=int(input())\nif N%K == 0:\n print("0")\nelse:\n print("1")\n', 'N = int(input())\nK = int(input())\nif N%K == 0:\n print("0")\nelse:\n print("1")\n', 'N=int(input())\nK=int(input())\nif N%K =0:\n print(0)\nelse:\n print(1)\n', 'N=int(imput())\nK=int(imput())\nif N%K =0:\n print("0")\n else:\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', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s171879806', 's394696596', 's448624432', 's580138260', 's628150175', 's684956031', 's703032778', 's850415459', 's908424057', 's981643256', 's989951031', 's288398431'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [76, 73, 71, 84, 72, 77, 76, 75, 79, 69, 76, 74] |
p03284 | u580093517 | 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())\nprint("Yes" if any([4*i+7*j == n for i in range(n//4+1) for j in range(n//7+1)]) else "No")', 'print("1" if eval(input().replace(" ","%")) else "0")'] | ['Runtime Error', 'Accepted'] | ['s504893696', 's678884043'] | [2940.0, 2940.0] | [17.0, 18.0] | [108, 53] |
p03284 | u580362735 | 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())\n\nif N%4 == 0 or N%7 == 0 or N%11 == 0 or (N%4)%7 == 0 or (N%7)%4 == 0 or (N%11)%4 == 0 or (N%11)%7 == 0:\n print('Yes')\nelse:\n print('No')", "N,K = map(int,input().split())\n\nif N%K == 0:\n print('0')\nelse:\n print('1')"] | ['Runtime Error', 'Accepted'] | ['s044616236', 's189107856'] | [2940.0, 2940.0] | [17.0, 17.0] | [156, 76] |
p03284 | u581603131 | 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(N//K - N%K)', 'N, K = map(int, input().split()))\nif N%K==0:\n print(0)\nelse :\n print(N/K - N%K)', 'N, K = map(int, input().split()))\nif N%K==0:\n print(0)\nelse :\n print(N%K)', 'N, K = map(int, input().split())\nprint(0 if N%K==0 else 1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s055700477', 's581841046', 's732760621', 's627667356'] | [2940.0, 2940.0, 2940.0, 2940.0] | [16.0, 17.0, 17.0, 17.0] | [86, 85, 79, 58] |
p03284 | u585482323 | 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())\nfor i in range(16):\n if n%4 == 0:\n print("Yes")\n quit()\n n -= 7\n if n < 0:\n break\nprint("No")', 'n,k = map(int, input().split())\nprint(0 if n%k == 0 else 1) '] | ['Runtime Error', 'Accepted'] | ['s811709090', 's841272045'] | [3188.0, 2940.0] | [18.0, 18.0] | [140, 60] |
p03284 | u589726284 | 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())\nif N % K == 0:\n print("0")\nelse :\n print("1")\n', 'N, K = 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'] | ['s051018551', 's155499934', 's594997210'] | [2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0] | [76, 71, 81] |
p03284 | u591855033 | 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())\n \nfor i in range(n//4+1):\n for j in range(n//7+1):\n if n == 4*i+7*j:\n print('Yes')\n exit(0)\nprint('No')", 'n,k = map(int,input().split())\n\nans = 0\nif n % k == 0:\n ans = 0\nelse:\n ans = 1\n\nprint(str(ans))'] | ['Runtime Error', 'Accepted'] | ['s082575055', 's497074573'] | [2940.0, 2940.0] | [17.0, 17.0] | [152, 101] |
p03284 | u595372947 | 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())\ncake = int(N/4)\ndonuts = int(N/7)\n\nfor i in range(donuts+1):\n for m in range(cake+1):\n sum_price = i*7 + m*4\n if N == sum_price:\n print('Yes')\n exit()\n\nprint('No')", "N, K = [int(i) for i in input().split()]\n\nif N % K != 0:\n print('1')\n exit()\nprint('0')\n"] | ['Runtime Error', 'Accepted'] | ['s390541173', 's669140846'] | [3060.0, 2940.0] | [17.0, 17.0] | [219, 94] |
p03284 | u597455618 | 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 = 0\nfor i in range(15):\n for j in range(26):\n if 7*i + 4*j == n:\n flag = 1\n exit\n\nif flag == 1:\n print("Yes")\nelse :\n print("No")', 'n, k = map(int, input().split())\nif n%k != 0:\n print((n//k)+1 - (n//k))\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s275263373', 's701895979'] | [2940.0, 2940.0] | [17.0, 17.0] | [167, 89] |
p03284 | u598009172 | 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())\na = N//7\nAA = [(N-7*i)%4 for i in range(a+1)]\nif 0 in AA:\n print("Yes")\nelse:\n print("No")', 'N,K=(int(i) for i in input().split())\nif N%K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s665557559', 's509606690'] | [2940.0, 2940.0] | [17.0, 17.0] | [113, 82] |
p03284 | u601082779 | 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());print(a%b<1)', 'a,b=map(int,input().split());print(a%b>0)', 'a,b=map(int,input().split());print((a%b>0)+0)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s194997289', 's834604710', 's412824226'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [41, 41, 45] |
p03284 | u604412462 | 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'] | ['s164306823', 's515828724'] | [3060.0, 2940.0] | [19.0, 17.0] | [76, 74] |
p03284 | u604896914 | 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. | ["result = 0\n\nN, K=map(int,input().strip().split(' '))\n\nif N mod K != 0:\n result = 1\n\nprint(result)", "result = 0\n\nN, K=map(int,input().strip().split(' '))\n\nif N % K != 0:\n result = 1\n\nprint(result)\n"] | ['Runtime Error', 'Accepted'] | ['s950933460', 's416744004'] | [2940.0, 2940.0] | [17.0, 17.0] | [98, 97] |
p03284 | u607729897 | 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,print().split())\nif n%k==0:\n print(0)\nelse:\n print(1)\n \n ', "N=int(input())\nif N%4==0 or N%7==0:\n print('Yes')\nelse:\n while 0<N:\n N-=7\n if N%4==0:\n print('Yes')\n break\n else:\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'] | ['s722871158', 's917803632', 's934982776'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [77, 148, 67] |
p03284 | u620755587 | 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 k == 1:\n print(0)\nprint(int(k % n == 0))', 'n, k = map(int, input().split())\nif k == 1:\n print(0)\n exit()\nprint(int(n % k != 0))'] | ['Wrong Answer', 'Accepted'] | ['s669692122', 's495187673'] | [2940.0, 2940.0] | [17.0, 17.0] | [77, 86] |
p03284 | u626468554 | 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 n%k==0:\n print(0)\nelse:\n print(1)', 'n,k = map(int,input().split())\n\nif n%k==0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s769442971', 's527509717'] | [2940.0, 2940.0] | [17.0, 17.0] | [42, 75] |
p03284 | u636775911 | 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. | ['#coding:utf-8\nn=[int(i) for i in input().split()]\nif(n[0]%n[1]=0):\n print(0)\nelse:\n print(1)', '#coding:utf-8\nn=[int(i) for i in input().split()]\nif(n[0]%n[1]==0):\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s602634923', 's895682611'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 96] |
p03284 | u652656291 | 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(ont,input().split())\nif a % b == 0:\n print(0)\nelse:\n print(1)', 'a,b = map(int,input().split())\nif a % b == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s543852147', 's617768902'] | [2940.0, 2940.0] | [20.0, 17.0] | [73, 74] |
p03284 | u655135177 | 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())\n print(a % b)', 'A, B = map(int, raw_input().split())\nprint(A % B)', 'N,K = map(int,input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s393514132', 's619843540', 's349838926'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [66, 49, 73] |
p03284 | u659640418 | 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())\nfor i in range(n):\n if (n-i)%4==0 and i%7==0:\n print("Yes")\n exit()\n else:\n print("No")', 'n,k=map(int, input().split())\nif n%k==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s517887845', 's617081901'] | [2940.0, 2940.0] | [17.0, 17.0] | [129, 72] |
p03284 | u659646849 | 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'] | ['s163553443', 's214990795'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 78] |
p03284 | u661576386 | 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\na, b = map(int, input().split())\n\nif a % b == 0:\n print(0)\nelif b % a == 0:\n print(0)\nelif abs(a-b) == 1:\n print(1)\nelif a > b:\n c = a % b\n d = math.floor(a/b)\n print(abs(d-c)+1)\nelse:\n c = b % a\n d = math.floor(b/a)\n print(abs(d-c)+1)\n', 'import math\na, b = map(int, input().split())\n\nif a % b == 0:\n print(0)\nelif abs(a-b) == 1:\n print(1)\nelif a > b:\n c = a % b\n d = math.floor(a/b)\n print(abs(d-c)+1)\nelse:\n c = b % a\n d = math.floor(b/a)\n print(abs(d-c)+1)\n', 'import math\na, b = map(int, input().split())\n\nif a % b == 0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s169305192', 's462512247', 's903251091'] | [3060.0, 3060.0, 3316.0] | [17.0, 17.0, 21.0] | [275, 245, 93] |
p03284 | u667949809 | 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'] | ['s365547614', 's821821501'] | [2940.0, 2940.0] | [17.0, 17.0] | [71, 74] |
p03284 | u672882146 | 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(k-n%k)', 'n,k=map(int, input().split()) \nif n%k ==0:\n print(0)\nelse:\n print(1)'] | ['Wrong Answer', 'Accepted'] | ['s579076973', 's719868499'] | [2940.0, 2940.0] | [17.0, 18.0] | [78, 74] |
p03284 | u672898046 | 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(abs(n-(n%K)))', 'n, k = map(int, input().split())\nif n % k == 0:\n print(0)\nelse:\n print(abs(n-(n%k)))', 'n, k = map(int, input().split()) \nif n % k == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s132804380', 's735455741', 's859902689'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [86, 86, 95] |
p03284 | u673217098 | 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(1)\nelse:\n print(0)\n', 'n,k = map(int,input().split())\n\nif(n % k > 0):\n print(1)\nelse:\n print(0)\n'] | ['Runtime Error', 'Accepted'] | ['s035168571', 's579540483'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 79] |
p03284 | u685263709 | 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:\n ans = N % K\nelse:\n ans = 1\nprint(b)', 'N, K = map(int, input().split())\nif N % K == 0:\n ans = 0\nelse:\n ans = 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s284584280', 's861867662'] | [3064.0, 2940.0] | [19.0, 18.0] | [86, 88] |
p03284 | u685662874 | 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(K - (N % K))', 'N,K=map(int, input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Wrong Answer', 'Accepted'] | ['s819796723', 's517156258'] | [2940.0, 2940.0] | [17.0, 17.0] | [48, 76] |
p03284 | u693933222 | 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,k = map(int, input().split())\nprint(int(n%k!=0))'] | ['Wrong Answer', 'Accepted'] | ['s486142151', 's476752125'] | [2940.0, 2940.0] | [17.0, 17.0] | [45, 50] |
p03284 | u698771758 | 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())\na=""\nwhile n:\n a+=str(n%2)\n n//=-2\nprint(a[::-1] if a else 0)', 'a,b=map(int,input().split())\nprint("0"if a%b == 0 else "1")'] | ['Runtime Error', 'Accepted'] | ['s640060981', 's783405332'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 59] |
p03284 | u706695185 | 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 = list(map(int, input().split()))\nprint(0 if n%k else 1)\n\n', 'n, k = list(map(int, input().split()))\nprint(0 if n%k==0 else 1)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s939849541', 's731845575'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 66] |
p03284 | u709304134 | 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. | ['#coding:utf-8\nn,k = map(int,input().split())\nprint (int(n%k==0))\n', '#coding:utf-8\nn,k = map(int,input().split())\nprint (int(n%k!=0))\n'] | ['Wrong Answer', 'Accepted'] | ['s968595749', 's514313534'] | [2940.0, 2940.0] | [17.0, 17.0] | [65, 65] |
p03284 | u721316601 | 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 = list(map(int, input().split()))\n\nprint(str(N // K * N % K))\n', 'N, K = list(map(int, input().split()))\n\nif N % K != 0:\n print(1)\nelse:\n print(0)'] | ['Wrong Answer', 'Accepted'] | ['s175891765', 's666306406'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 86] |
p03284 | u724742135 | 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. | ['from sys import stdin\nn, k=[int(x) for x in stdin.readlint().rstrip().split()]\nif n%k == 1:\n print(1)\nelse:\n print(0)', 'from sys import stdin\nn, k=[int(x) for x in stdin.readline().rstrip().split()]\nif n%k >= 1:\n print(1)\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s194168285', 's329379704'] | [2940.0, 2940.0] | [17.0, 17.0] | [119, 119] |
p03284 | u725406838 | 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\n', 'N=int(input())\nK=int(input())\nif N%K==0:\n print(0)\nelse :\n print(1)', '#1<=int(N)\n\nN=int(input())\nK=int(input())\nif N/K==0:\n print(1)\nelse :\n print(0)\n\n', 'N=int(input())\nK=int(input())\nif N%K==0:\n print(0)\nelse :\n print(1)', 'N=int(input())\nK=int(input())\nif N%K==0:\n print(0)\nelse :\n print(1)', '#1<=int(N)\n\nN=int(input())\nK=int(input())\nif N/K==0:\n print(0)\nelse :\n print(1)\n', 'N, K = input().split()\nN=int()\nK=int()\nif N % K == 0:\n print(0)\nelse :\n print(1)', 'N, K = input().split()\nif N%K == 0:\n print(0)\nelse :\n print(1)', 'N, K = input().split()\nif int(N) % int(K) == 0:\n print(0)\nelse :\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s067811833', 's154514584', 's190913558', 's247190948', 's431313436', 's559578846', 's835489889', 's837468767', 's408591992'] | [2940.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [75, 73, 99, 73, 73, 98, 86, 68, 80] |
p03284 | u726615467 | 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. | ['# encoding: utf-8\nN, M = list(map(int, input().split()))\n\n# TLE\nAmod = [A for A in map(lambda x: int(x) % M ,filter(lambda x: int(x) % M > 0, input().split()))]\nans = 0\nfor l in range(len(Amod)):\n acm = 0\n for r in range(l, len(Amod)):\n acm = (acm + Amod[r]) % M\n if acm == 0: ans += 1\n\nprint(ans)', '# encoding: utf-8\nN, M = list(map(int, input().split()))\n\n# TLE\n# Amod = [A for A in map(lambda x: int(x) % M , input().split())]\n# ans = 0\n# for l in range(len(Amod)):\n# acm = 0\n# for r in range(l, len(Amod)):\n# acm = (acm + Amod[r]) % M\n# if acm == 0: ans += 1\n\nAsym = []\n\nsym = 0\ncnt_zero = 0\nfor i, A in enumerate(map(int, input().split())):\n sym = (sym + A) % M\n if sym > 0: Asym.append(sym)\n else: cnt_zero += 1\n \nans = cnt_zero * (cnt_zero + 1)\n# for sym in set(Asym):\n# cnt = Asym.count(sym)\n# ans += cnt * (cnt - 1)\n \nprint(int(ans / 2))\n\n# speed test\n\n\n\n# for A in map(int, input().split()):\n\n# Acnt[sym] += 1\n\n# print(int(Acnt[0] + sum([cnt * (cnt - 1) for cnt in Acnt]) / 2))\n', '# encoding: utf-8\nN, M = list(map(int, input().split()))\n\n# TLE\nAmod = [A for A in map(lambda x: int(x) % M ,filter(lambda x: int(x) % M > 0, input().split()))]\nans = 0\nfor l in range(len(Amod)):\n acm = 0\n for r in range(l, len(Amod)):\n acm = (acm + Amod[r]) % M\n if acm == 0: ans += 1\n', '# encoding: utf-8\n\nn, k = input().split()\n\nif int(n) % int(k) == 0: print(0)\nelse: print(1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s397222012', 's482157424', 's773206347', 's658213427'] | [3060.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [317, 812, 306, 91] |
p03284 | u727412592 | 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. | ['text=input()\nN=text\n\ntemp4=[4*i for i in range(25)]\ntemp7=[7*i for i in range(14)]\n\ntemp=list()\nflg=False\nfor i in temp4:\n for j in temp7:\n temp.append(i+j)\n if int(N)==i+j:\n flg=True\n print("Yes")\n\nif flg:\n pass\nelse:\n print("No")', 'text=input()\nN=int(text.split(" ")[0])\nK=int(text.split(" ")[1])\n\nif (N%K)!=0:\n print(1)\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s696705743', 's818528846'] | [3188.0, 2940.0] | [20.0, 17.0] | [276, 110] |
p03284 | u729133443 | 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(' ','%'))", "print(eval(input().replace(*' %'))%2)"] | ['Runtime Error', 'Accepted'] | ['s595669878', 's982666959'] | [2940.0, 9092.0] | [16.0, 26.0] | [36, 37] |
p03284 | u732870425 | 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())\n\nfor i in range(1, n//4+1):\n for j in range(1, n//7+1):\n if i*4 + j*7 == n:\n print("Yes")\n break\n elif i == n//4 and j == n//7:\n print("No")\n break\n else:\n continue\n break', 'n,k = map(int,input().split())\nif n%k>0:\n print(1)\nelif n%k==0:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s707555563', 's729031915'] | [2940.0, 2940.0] | [17.0, 17.0] | [262, 75] |
p03284 | u733774002 | 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())\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 ', 'N, K = map(int, input().split())\nprint(-(-N//K) - N//K)'] | ['Runtime Error', 'Accepted'] | ['s117424062', 's483585523'] | [2940.0, 2940.0] | [18.0, 17.0] | [161, 55] |
p03284 | u739798900 | 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 = input()\nn = int(nk.split([1]))\nk = int(nk.split([2]))\n\nif n % k == 0 :\n print(0)\nelif n % k > 0:\n print(1)', 'nk = input()\nnk_lis = nk.split()\nn = int(nk_lis[0])\nk = int(nk_lis[1])\n\nif n % k == 0 :\n print(0)\nelif n % k > 0:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s536579616', 's545216867'] | [2940.0, 2940.0] | [18.0, 17.0] | [113, 125] |
p03284 | u739843002 | 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. | ['tmp = input().split(" ")\nN = int(tmp[0])\nK = int(tmp[1])\nprint(N % K)\nprint(1) if N % K else print(0)', 'tmp = input().split(" ")\nN = int(tmp[0])\nK = int(tmp[1])\n\nprint(0) if N % K else print(1)', 'tmp = input().split(" ")\nN = int(tmp[0])\nK = int(tmp[1])\n\nprint(1) if N % K else print(0)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s510120903', 's730519608', 's659786764'] | [8928.0, 8920.0, 9144.0] | [28.0, 26.0, 33.0] | [101, 89, 89] |
p03284 | u740047492 | 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 (n/k)+(n%k))', 'n, k=map(int, input().split());print(0 if n%k==o else 1)', 'n, k=map(int,input().split());print(0 if n%k==o else 1)', 'n, k = map(int, input().split())\nprint(0 if n%k==0 else int((n/k))+(n%k))', 'n, k = map(int, input().split())\nprint(0 if n%k==0 else int((n/k))+int((n%k)))', 'n, k=map(int, input().split());print(0 if n%k==0 else 1)'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s154232064', 's381625108', 's411290915', 's550258849', 's822784991', 's377936048'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [68, 56, 55, 73, 78, 56] |
p03284 | u740284863 | 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. | ['\nSum = int(input())\n\nr = 0\nfor i in range(26):\n for k in range(15):\n if 4*i+7*k == Sum:\n r = r +1\n else:\n r = r\nif r > 0:\n print("Yes")\nelse:\n print("No")\n', 'N, K = map(int, input().split(" "))\n\nq = N//K\nmod = N % K\nif mod > 0:\n print(1)\nelse:\n print(0)\n'] | ['Runtime Error', 'Accepted'] | ['s713179725', 's535175878'] | [2940.0, 2940.0] | [17.0, 17.0] | [200, 102] |
p03284 | u748311048 | 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(K*bool(N%K!==0)-N%K)', 'N,K=map(int,input().split())\nprint(K*bool(N%K!=0)-N%K)', 'N,K=map(int,input().split())\nprint(0 if N%K==0 else 1)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s586758138', 's710600845', 's332832620'] | [2940.0, 3060.0, 2940.0] | [17.0, 19.0, 17.0] | [55, 54, 54] |
p03284 | u759412327 | 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 = list(map(int,input()))\n\nif a[0]%a[1]==0:\n print(0)\nelse:\n print(1)', 'N,K = map(int,input().split())\nprint(N%K%2)'] | ['Runtime Error', 'Accepted'] | ['s962897949', 's551057934'] | [2940.0, 9084.0] | [17.0, 30.0] | [72, 43] |
p03284 | u759651152 | 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())\nprint(n % k)', "#-*-coding:utf-8-*-\n\ndef main():\n n, k = map(int, input().split())\n\n if n % k == 0:\n print(0)\n else:\n print(1)\n\nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s458133262', 's457293796'] | [3064.0, 2940.0] | [17.0, 17.0] | [42, 172] |
p03284 | u760794812 | 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. | ['100 10', 'N, K = (int(i) for i in input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s037037565', 's791989939'] | [2940.0, 2940.0] | [17.0, 17.0] | [6, 83] |
p03284 | u765325669 | 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. | ["def canbuy(n):\n for i in range(int(100/7)):\n tmp = (n-7*i)\n if tmp==0 or (tmp>3 and tmp%4==0):\n return 'Yes'\n return 'No'\n\nn=int(input())\nprint(canbuy(n))\n", 'def diff(n,k):\n if n%k==0:\n return 0\n else:\n return 1\n\nn,k=[int(i) for i in input().split()]\nprint(diff(n,k))'] | ['Runtime Error', 'Accepted'] | ['s411229140', 's596296416'] | [3064.0, 3064.0] | [17.0, 17.0] | [186, 129] |
p03284 | u766566560 | 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(N // K - N % K)\nelse:\n\tprint(N % K)', 'N, K = map(int, input().split())\n\nif N % K != 0:\n\tprint(1)\nelse:\n\tprint(0)'] | ['Runtime Error', 'Accepted'] | ['s710319152', 's177923870'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 74] |
p03284 | u768559443 | 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())\na=n//k\nb=n%k\nprint(a+b)-a', 'n,k=map(int,input().split())\nif n%k!=0:\n print("1")\nelse:\n print("0")'] | ['Runtime Error', 'Accepted'] | ['s568337441', 's412515782'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 71] |
p03284 | u768993705 | 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 else 1)', 'n,k = map(int, input().split())\nprint(1 if n%k else 0)'] | ['Wrong Answer', 'Accepted'] | ['s641138513', 's380967762'] | [2940.0, 2940.0] | [18.0, 17.0] | [54, 54] |
p03284 | u771406607 | 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)'] | ['Wrong Answer', 'Accepted'] | ['s700898111', 's991870298'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 75] |
p03284 | u777394984 | 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', 'a,b = map(int,input().split())\nif a % b == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s605948593', 's458389561'] | [2940.0, 2940.0] | [17.0, 18.0] | [40, 73] |
p03284 | u778700306 | 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. | ['\nn,k=map(int,input().split())\n\nprint("1" if n % k == 0 else "0")', '\nn,k=map(int,input().split())\n\nprint("0" if n % k == 0 else "1")'] | ['Wrong Answer', 'Accepted'] | ['s782595734', 's062943423'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 64] |
p03284 | u780913793 | 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\nprint(0 if n%k == 0 else 1)', 'n,k=map(int,input().split())\n\nprint(0 if n%k == 0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s142873882', 's203667676'] | [2940.0, 2940.0] | [18.0, 17.0] | [62, 57] |
p03284 | u787383401 | 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\tprint(0)\nelse:\n\tprint(1)\n', 'N, K=map(int, input(), split())\nif N%K==0:\n\tprint(0)\nelse:\n\tprint(1)\n', 'N, K=map(int, input(), split())\nif N%K==0:\n\tprint(0)\nelse:\n\tprint(1)\n', 'N=int(input()) K=int(input))\nif N%K==0:\n\tprint(0)\nelse:\n\tprint(1)\n', 'N=int(input()) K=int(input())\nif N%K==0:\n\tprint(0)\nelse:\n\tprint(1)\n', 'N, K=map(int, input(). split())\nif N%K==0:\n\tprint(0)\nelse:\n\tprint(1)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s001825026', 's273570073', 's373465457', 's457169434', 's586590861', 's359373067'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [16.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [66, 69, 70, 66, 67, 69] |
p03284 | u788137651 | 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 not in [1, 2, 3, 5, 6, 9, 10, 13, 17, 20]:\n print("Yes")\nelse:\n print("No")\n', 'N, K = map(int, input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s974245555', 's491980027'] | [2940.0, 2940.0] | [17.0, 18.0] | [104, 80] |
p03284 | u790877102 | 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())\n\nfor i in range(n//7+1):\n\tif n%4==0:\n\t\tprint("Yes")\n\t\tbreak\n\tn -=7\nelse:\n\tprint("No")\n', 'N, K = map(int,input().split())\n\nif N%K=0:\n print(0)\nelse:\n print(1)', 'N, K = map(int,input().split())\n\nif N%K==0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s643594935', 's985902796', 's189553436'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [103, 72, 74] |
p03284 | u794173881 | 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(0 if n%k=0 else 1)', 'n,k= 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', 'Runtime Error', 'Accepted'] | ['s072401765', 's890923614', 's385642798'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [50, 51, 55] |
p03284 | u801274036 | 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 = input()\nnum = a.split(' ')\nN = num[0]\nK = num[1]\nj = N % K\n\nif j == 0:\n\tprint(0)\nelse:\n\tprint(1)\n", "a = input()\nnum = a.split(' ')\nN = int(num[0])\nK = int(num[1])\nj = N % K\nif j == 0:\n\tprint(0)\nelse:\n\tprint(1)\n"] | ['Runtime Error', 'Accepted'] | ['s208388504', 's362421446'] | [2940.0, 2940.0] | [18.0, 17.0] | [101, 110] |
p03284 | u801359367 | 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 collections\nfrom collections import defaultdict\nimport numpy as np\n\nN,M = list(map(int,input().split()))\nA = input().split()\n\nA = np.array(A,dtype='int64')\nC = np.append([0],np.cumsum(A))\n\nL = [i%M for i in C]\n\nd = defaultdict(int)\nfor i in L:\n d[i] +=1\n\n\nans = 0\nfor i in d.values():\n S = i * (i-1) / 2\n ans+=S\n \nprint(int(ans))", 'A,B = list(map(int,input().split()))\nprint(1) if A%B!=0 else print(0)'] | ['Runtime Error', 'Accepted'] | ['s159885060', 's707515178'] | [12384.0, 2940.0] | [149.0, 17.0] | [516, 69] |
p03284 | u801512570 | 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, inpur().split())\n\nif K%N==0:\n print(0)\nelse:\n print(1)', 'N,K=map(int, input().split())\n\nif N%K==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s793893840', 's319493828'] | [2940.0, 2940.0] | [18.0, 18.0] | [69, 69] |
p03284 | u821271186 | 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()\na=[]\nb=0\nfor i in range(25):\n for j in range(13):\n a.append(4*i+7*j)\nprint(a)\nfor i in range(len(a)):\n if N==a[i]:\n print("Yes")\n b=1\n \nif b!=1:\n print("No")', 'N,K = map(int,input().split())\nif N%K==0:\n print(0)\nelse:\n print(', 'N,K = map(int,input().split())\nif N%K==0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s190286893', 's234480846', 's731280395'] | [3064.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [204, 71, 74] |
p03284 | u824237520 | 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())\n\na = []\n\nif n > 0:\n while n > 0:\n a.append(n % 2)\n n //= 2\n\n a.append(0)\n a.append(0)\n for i in range(len(a) - 1):\n if i % 2 == 1:\n if a[i] == 1:\n a[i + 1] += 1\n elif a[i] == 2:\n a[i + 1] += 1\n a[i] = 0\n else:\n if a[i] == 2:\n a[i + 1] += 1\n a[i] = 0\n a[i] = str(a[i])\n\n for i in range(len(a) - 1, -1, -1):\n if a[i] == 0 or a[i] == '0':\n a[i] = ''\n else:\n break\n print(''.join(reversed(a)))\nelif n == 0:\n print('0')\nelse:\n n = 0 - n\n while n > 0:\n a.append(n % 2)\n n //= 2\n\n a.append(0)\n a.append(0)\n for i in range(len(a) - 1):\n if i % 2 != 1:\n if a[i] == 1:\n a[i + 1] += 1\n elif a[i] == 2:\n a[i + 1] += 1\n a[i] = 0\n else:\n if a[i] == 2:\n a[i + 1] += 1\n a[i] = 0\n a[i] = str(a[i])\n\n for i in range(len(a) - 1, -1, -1):\n if a[i] == 0 or a[i] == '0':\n a[i] = ''\n else:\n break\n print(''.join(reversed(a)))", "if n % k == 0:\n print('0')\nelse:\n print('1')", "n, k = map(int, input().split())\n\nif n % k == 0:\n print('0')\nelse:\n print('1')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s342777863', 's717260781', 's240301336'] | [3188.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [1219, 50, 84] |
p03284 | u827141374 | 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 = 0\nfor i in range(0, n+1, 4):\n if (n - i) % 7 == 0:\n x = 1\nprint(('No','Yes')[x])", 'n, k = map(int, input().split())\nprint(0 if n % k == 0 else 1)\n'] | ['Runtime Error', 'Accepted'] | ['s183623470', 's479054430'] | [2940.0, 3060.0] | [17.0, 19.0] | [111, 63] |
p03284 | u827659975 | 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(1)\n \nelse:\n print(0)', '# -*- coding: utf-8 -*-\n\nN, K = map(int, input().split())\n\nif(N = 0):\n min = 0\n \nelif(N >= K):\n min = N % K\n\nelse:\n min = 1\n\nprint(abs(min))', 'N, K = map(int, input().split())\n\nif N % K == 0:\n print(0)\n \nelse:\n print(1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s219864874', 's741089460', 's432398499'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [79, 152, 79] |
p03284 | u838674605 | 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. | ['res = 1\nif N % K == 0:\n res = 0\nprint(res)', 'import sys\nN , K = map(int,input().split())\n\nres = 1\nif N % K == 0:\n res = 0\nprint(res)'] | ['Runtime Error', 'Accepted'] | ['s573098705', 's209187847'] | [2940.0, 2940.0] | [17.0, 17.0] | [45, 90] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.