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 | u057415180 | 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, i = map(int, input().split())\nif n%k == 0:\n print(0)\nelse:\n print(1)', 'n, i = map(int, input().split())\nif n%i == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s607434647', 's740396113'] | [2940.0, 2940.0] | [17.0, 17.0] | [77, 77] |
p03284 | u058592821 | 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(i) for in input().split())\nprint(0) if n % k == 0 else print(1)', 'n, k = (int(i) for i in input().split())\nprint(0) if n%k == 0 else print(1)'] | ['Runtime Error', 'Accepted'] | ['s013203659', 's210079694'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 75] |
p03284 | u059210959 | 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\n\nn, m = map(int, input().split())\na = [int(i)%m for i in input().split()]\n\ncount = 0\nfor i in range(n):\n candy = a[i]\n if candy % m == 0:\n count += 1\n for rest in range(1,n-i):\n candy += a[i+rest]\n if candy % m == 0:\n count += 1\n\nprint(count)\n', '#encoding utf-8\n\nn, k = map(int, input().split())\n\nif n % k == 0:\n print("0")\nelse:\n print("1")\n'] | ['Runtime Error', 'Accepted'] | ['s472090582', 's730933330'] | [3060.0, 2940.0] | [17.0, 17.0] | [300, 102] |
p03284 | u060432908 | 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())\nrem=0 if n%k!=0 else 1\nprint(rem)', 'n,k=map(int,input().split())\nrem=0 if n%k==0 else 1\nprint(rem)'] | ['Wrong Answer', 'Accepted'] | ['s197649912', 's353186923'] | [9048.0, 9060.0] | [29.0, 29.0] | [62, 62] |
p03284 | u066455063 | 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 bisect\n\nN = int(input())\nroot = [4, 7]\n\nif bisect.bisect_right(root, N):\n print("Yes")\nelse:\n print("No")\n', 'N, K = map(int, input().split())\n\nif N % K == 0:\n print(0)\n\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s894069046', 's965689005'] | [2940.0, 2940.0] | [18.0, 17.0] | [119, 82] |
p03284 | u067267880 | 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(input().split())\n\nif N % K > 1:\n print(1)\nelse:\n print(0)\n\n ', 'N, K = map(int, input().split())\n\nif N % K >= 1:\n print(1)\nelse:\n print(0)\n\n'] | ['Runtime Error', 'Accepted'] | ['s216131513', 's023108844'] | [2940.0, 2940.0] | [18.0, 18.0] | [80, 82] |
p03284 | u068862866 | 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(N%K!=0)', 'N,K = map(int,input().split())\n \nprint(int(N%K!=0))'] | ['Wrong Answer', 'Accepted'] | ['s152952017', 's658528324'] | [9160.0, 9152.0] | [26.0, 24.0] | [45, 51] |
p03284 | u070561949 | 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(abs(n//k - (n-(n//k)*k))', 'n,k = map(int,input().split())\nprint(n-(n//k)*k - n//k)', 'n,k = map(int,input().split())\nif n < k:\n print(1)\nelse:\n if n%k == 0:\n print(0)\n else:\n if k >= n%k:\n print(1)\n else : \n print(k - n%k)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s044004097', 's227382981', 's375713758'] | [2940.0, 3064.0, 2940.0] | [18.0, 18.0, 18.0] | [61, 55, 188] |
p03284 | u079022116 | 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)', 'a,b=map(int,input().split())\nif a%b==0:print(0)\nelse:print(1)'] | ['Runtime Error', 'Accepted'] | ['s190982193', 's574293831'] | [2940.0, 2940.0] | [18.0, 18.0] | [37, 61] |
p03284 | u088488125 | 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")\n'] | ['Runtime Error', 'Accepted'] | ['s164401031', 's401284654'] | [9152.0, 9108.0] | [24.0, 27.0] | [64, 73] |
p03284 | u089376182 | 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 - n//k*k - n//k)\n', 'n, k = map(int, input().split())\nprint(1 if n%k else 0)'] | ['Wrong Answer', 'Accepted'] | ['s809749453', 's039054427'] | [2940.0, 2940.0] | [17.0, 17.0] | [58, 55] |
p03284 | u090001078 | 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 = (int(i) for i in input().split()) \nprint(a)\nprint(b)\nif a % b == 0:\n print(0)\nelse:\n print(1)\n', 'a, b = (int(i) for i in input().split()) \n\nif a % b == 0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Accepted'] | ['s040949358', 's293247785'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 87] |
p03284 | u102902647 | 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 comb1(n, r):\n if n == 0 or r == 0: return 1\n return comb1(n, r-1) * (n-r+1) / r \nN, M = map(int, input().split())\nA = [int(i) for i in input().split()]\n# N, M = 10, 400000000\n\nsurplus = {0:0}\nres = 0\ntmp = 0\nB = []\nfor i in range(0, N):\n tmp += A[i] % M\n B.append(tmp)\n surplus[tmp] = 0\nfor i in B:\n surplus[i] += 1\nfor tmp_key in surplus.keys():\n res += comb1(surplus[tmp_key], 2)\n\ncorner = surplus[0]\nif corner == 0:\n res -= 1\nelse:\n res += corner\nprint(int(res))', 'N, K = map(int, input().split())\nif N % K==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s323621194', 's018983517'] | [3064.0, 2940.0] | [17.0, 17.0] | [639, 77] |
p03284 | u102960641 | 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())\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 if (n - i*7) % 4 == 0:\n ans == "Yes"\nprint(ans)\n', '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', 'import math\nn,k = map(int, input().split())\nprint(math.ceil(n/k)-n//k)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s024190438', 's057161556', 's388225937', 's788934787'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0] | [118, 109, 119, 70] |
p03284 | u106103668 | 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())\nprint(0 if a%b==0 else 1)', 'a,b=map(int,input().split())\nprint(0 if a%b==0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s271141598', 's353676348'] | [2940.0, 2940.0] | [18.0, 17.0] | [46, 54] |
p03284 | u107091170 | 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 ', 'N,K=map(int,input().split())\nif N%K==0:\n print(0)\nelse:\n print(1)\n \n'] | ['Runtime Error', 'Accepted'] | ['s409500865', 's848246235'] | [3060.0, 2940.0] | [18.0, 19.0] | [62, 71] |
p03284 | u118019047 | 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())\namari = ""\n\nif n == 0:\n print(0)\n exit()\n\nwhile n :\n if n%2 == 1:\n amari += "1"\n n -= 1\n else:\n amari += "0"\n n = n//-2\n \nprint(amari[::-1])', 'n,k = list(map(int,input().split()))\n\nif n%k == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s104135890', 's017873606'] | [2940.0, 2940.0] | [17.0, 17.0] | [196, 82] |
p03284 | u122195031 | 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 prinnt(1)', 'n,k = map(int,input().split())\nif n%k == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s590804834', 's735373474'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 75] |
p03284 | u124592621 | 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())\nmax = n / k\nmin = n % k\nprint(max - min)', 'n, k = map(int, input().split())\nif (n % k == 0):\n print(0)\nelse:\n print(1)'] | ['Wrong Answer', 'Accepted'] | ['s361778323', 's288453124'] | [2940.0, 2940.0] | [17.0, 17.0] | [73, 77] |
p03284 | u128740947 | 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())\nif n % k ==0:\n ans =0\nelse :\n ans =1\n \nprnt(ans)', '\nn, k = map(int,input().split())\nif n % k ==0:\n ans =0\nelse :\n ans =1\n \nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s957993192', 's558360079'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 91] |
p03284 | u131405882 | 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(str, input().split())\nif N % K != 0:\n print(1)\nelse:\n print(0)', 'N,K = list(map(str, input().split()))\nif N % K != 0:\n print(1)\nelse:\n print(0)', 'N,K = map(int, input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s684068267', 's746239150', 's911884425'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [74, 80, 74] |
p03284 | u134387396 | 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 numpy as np\n\n\nn,m = input().split()\n\nn = int(n)\nm = int(m)\n\na = input().split()\na = [int(i) for i in a]\n\nans = 0\n\nsumlist = list(np.cumsum(a))\nfor i in range(n):\n # print(sumlist)\n # for j in range(len(sumlist)):\n # if sumlist[j] % m == 0:\n # ans += 1\n tmp = [x for x in sumlist if x % m == 0]\n ans += len(tmp)\n\n sumlist = list(map(lambda x:x - sumlist[0],sumlist))\n sumlist.pop(0)\nprint(ans)\n', 'n,k = input().split()\nn = int(n)\nk = int(k)\n\namari = n % k\n\nif amari == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s055021119', 's038638791'] | [20832.0, 2940.0] | [300.0, 18.0] | [436, 107] |
p03284 | u135197221 | 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 mapt(fn, *args):\n return list(map(fn, *args))\n\n\ndef Input():\n return mapt(int, input().split(" "))\n\n\ndef main():\n n, k = Input()\n if n % k == 0:\n print(0)\n else:\n max_n = math.ceil(k/n)\n min_n = math.floor(k/n)\n print(max_n - min_n)\n\n\nmain()', 'def mapt(fn, *args):\n return list(map(fn, *args))\n\n\ndef Input():\n return mapt(int, input().split(" "))\n\n\ndef main():\n n, k = Input()\n if n % k == 0:\n print(0)\n else:\n print(1)\n\n\nmain()'] | ['Runtime Error', 'Accepted'] | ['s017873289', 's831851330'] | [9120.0, 9196.0] | [25.0, 29.0] | [288, 213] |
p03284 | u136811344 | 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 ', 'N, K = map(int, input().split())\nif N%K == 0:\n print(0)\nelse:\n print(1)\n '] | ['Runtime Error', 'Accepted'] | ['s704817582', 's298520409'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 76] |
p03284 | u143509139 | 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('YNeos'[int(input()) in[1,2,3,5,6,9,10,13,17]::2])\n", "print(0 if eval(input().replace(' ','%'))==0 else 1)"] | ['Runtime Error', 'Accepted'] | ['s450772570', 's340047689'] | [2940.0, 2940.0] | [17.0, 21.0] | [57, 52] |
p03284 | u159994501 | 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'] | ['s133832569', 's738360259'] | [2940.0, 2940.0] | [18.0, 18.0] | [75, 83] |
p03284 | u160659351 | 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. | ['#105\n\nN, K = map(int, input().rstrip().split())\n if N%K == 0:\n print(0)\n else:\n print(1)', '#105\n\nN, K = map(int, input().rstrip().split()):\n if N%K == 0:\n print(0)\n else:\n print(1)', '#105\n\nN, K = map(int, input().rstrip().split())\nif N%K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s391537045', 's850356561', 's435141832'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [108, 109, 92] |
p03284 | u160861278 | 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)\nelse:\n\tpritn(1)', 'n, k = map(int, input().split())\n\nif n%0==0:\n\tprint(0)\nelse:\n\tprint(1)', 'n, k = map(int, input().split())\n\nif n%k!=0:\n\tprint(0)\nelse:\n\tpritn(1)', 'n, k = map(int, input().split())\n\nif n%k!=0:\n\tprint(1)\nelse:\n\tprint(0)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s719336706', 's747219614', 's924727092', 's191468728'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [70, 70, 70, 70] |
p03284 | u167161639 | 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())\nstring=""\n\nwhile n!=0:\n if n%2==1:\n string="1"+string\n n=n-1\n else:\n string="0"+string\n n=n/(-2)\nif n==0:\n string="0"+string\n \nprint(string)', 'n=int(input())\nstring=""\n\nif n==0:\n string="0"\nwhile n!=0:\n if n%2==1:\n string="1"+string\n n=n-1\n else:\n string="0"+string\n n=n/(-2)\n \nprint(string)', 'n=int(input())\nstring=""\n\nwhile n!=0:\n if n%2==1:\n string="1"+string\n n=n-1\n else:\n string="0"+string\n n=n/(-2)\nif n==0:\n string="0"\n \nprint(string)', 'n=int(input())\nstring=""\n\nif n==0:\n string="0"\nwhile n!=0:\n if n%2==1:\n string="1"+string\n n=n-1\n else:\n string="0"+string\n n=n//(-2)\n \nprint(string)', 'n,k=(int(i) for i in input().split())\nif n%k==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s568677548', 's582398518', 's776278842', 's962685474', 's205583236'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [191, 184, 184, 185, 80] |
p03284 | u167908302 | 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(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, k = map(int, input().split())\n\n\nif n % k == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s646231728', 's520982520'] | [2940.0, 3060.0] | [17.0, 20.0] | [175, 142] |
p03284 | u168416324 | 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 int(input())%3==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'] | ['s130477297', 's219596396'] | [9096.0, 8988.0] | [24.0, 29.0] | [49, 68] |
p03284 | u170324846 | 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:\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', 'Runtime Error', 'Accepted'] | ['s584042076', 's855551617', 's405391767'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [74, 70, 75] |
p03284 | u178432859 | 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())\nfor i in range(n):\n for j in range(n):\n if i*4+j*7 == n:\n print("Yes")\n quit()\n if i*4+j*7 >= n:\n break\nprint("No")', 'a, b = map(int, input().split())\nif a%b == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s533235126', 's124055581'] | [2940.0, 2940.0] | [18.0, 17.0] | [194, 77] |
p03284 | u183200783 | 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, K = map(int, input().split())\n\nif N%K == 0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Accepted'] | ['s664328569', 's658971519'] | [2940.0, 2940.0] | [17.0, 17.0] | [44, 75] |
p03284 | u189404681 | 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\nif A == 0:\n print(0)\nelse:\n else(1)', 'N, K = map(int, input().split())\nA = N % K\nif A == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s129067107', 's022889520'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 85] |
p03284 | u197300773 | 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("No" if N in [1,2,3,5,6,9,10,13,17] else "Yes")', 'N,K=map(int,input().split())\nprint(0 if N%K==0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s758377289', 's597264827'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 54] |
p03284 | u198062737 | 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())\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'] | ['s196813333', 's890386342'] | [2940.0, 2940.0] | [18.0, 18.0] | [47, 63] |
p03284 | u203995947 | 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', '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', 'Accepted'] | ['s185713415', 's318206232', 's780226397'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [82, 82, 83] |
p03284 | u204260373 | 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>=1 and 100>=K and N%K==0:\n print(0)\nelif N>=1 and 100>=K and N%K == !0:\n print(N%K)', "n,k = map(int,input().split())\n\nif n % k == 0:\n print(0)\nelse:\n print('1')\n"] | ['Runtime Error', 'Accepted'] | ['s229971504', 's448888416'] | [3060.0, 2940.0] | [18.0, 17.0] | [119, 81] |
p03284 | u209275335 | 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())\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'] | ['s745418696', 's352801021'] | [2940.0, 2940.0] | [18.0, 18.0] | [65, 77] |
p03284 | u209619667 | 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 = int(input())\nif (A%4 == 3 or A%4 == 0 or A%7 == 4 or A%7== 0) and A != 3:\n print('Yes')\nelse:\n print('No')", 'a,b = map(int,input().split())\nc = a % b == 0\nif c:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s835338123', 's469083292'] | [2940.0, 3064.0] | [18.0, 17.0] | [112, 79] |
p03284 | u219197917 | 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(i) - 1 for i in input().split()]\nprint(int(n % k != 0))', 'n, k = [int(i) for i in input().split()]\nprint(int(n % k != 0))'] | ['Runtime Error', 'Accepted'] | ['s210056991', 's462221037'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 63] |
p03284 | u224050758 | 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\ndef main():\n l = [x + y for x in range(N + 1) if x % 4 == 0\n for y in range(N + 1) if y % 7 == 0]\n l = list(set(l))\n ans = "Yes" if l.count(N) else "No"\n print(ans)\n\nif __name__ == "__main__":\n main()', 'N, K = [int(x) for x in input().split()]\nans = 0 if N % K == 0 else 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s328474868', 's404808632'] | [3060.0, 2940.0] | [18.0, 18.0] | [247, 80] |
p03284 | u226912938 | 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\ndef get_ans(x):\n if x == 0:\n return ['0']\n d = []\n i = 0\n div = 1\n while x != 0:\n if x % (div*2) == 0:\n d.append('0')\n else:\n d.append('1')\n x -= div\n i += 1\n div = div * (-2)\n return d\n\na = get_ans(N)\nb = list(reversed(a))\nans = ''.join(b)\nprint(ans)", 'N, K = map(int, input().split())\n\nif N % K == 0:\n ans = 0\nelse:\n ans = 1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s217668120', 's206795455'] | [3064.0, 2940.0] | [17.0, 17.0] | [355, 90] |
p03284 | u228294553 | 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.k=map(int,input().split())\nprint(n%k)', 'n,k=map(int,input().split())\n\nif n%k==0:\n print("0")\nelse:\n print("1")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s158783772', 's321497260', 's494877159'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [75, 39, 76] |
p03284 | u231685196 | 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(list(map(int,input().split()))[0]%list(map(int,input().split()))[1])', 'm,k = map(int,input().split())\nif m%k==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s445525134', 's939354181'] | [2940.0, 2940.0] | [17.0, 18.0] | [74, 69] |
p03284 | u248670337 | 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(0 if eval(input().replace(" ","%")) else 1)', 'print(0 if eval(input().replace(" ","%"))==0 else 1)'] | ['Wrong Answer', 'Accepted'] | ['s746185790', 's353768558'] | [2940.0, 2940.0] | [17.0, 17.0] | [49, 52] |
p03284 | u250944591 | 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 print(0)\nelse:\n print(1)', 'n,k=map(int,input().split())\nif n%k:\n print(1)\nelse:\n print(0)'] | ['Wrong Answer', 'Accepted'] | ['s369698157', 's460044095'] | [9024.0, 9160.0] | [32.0, 28.0] | [64, 64] |
p03284 | u259580411 | 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 = str(input())\nlist_n = n.split(" ")\nn = list_n[0]\nk = list_n[1]\nif n % k == 0:\n print(0)\nelse:\n print(1)', 'n = str(input())\n[n, k] = list(n.split(" "))\nif n % k == 0:\n print(0)\nelse:\n print(1)', 'n = str(input())\n[n, k] = list(map(int,n.split(" ")))\nif n % k == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s040109306', 's092223282', 's414455688'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [113, 91, 101] |
p03284 | u275934251 | 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 in [1, 2, 3, 5, 6, 7, 9, 10, 13, 17]:\n print("Yes")\nelse:\n print("No")\n', 'N = input()\nK = input()\n\nif N % K == 0:\n print(0)\nelse:\n print(1)', 'N = int(input())\n \nif N in [1, 2, 3, 5, 6, 7, 9, 10, 13, 17]:\n print("Yes")\nelse:\n print("No")\n', 'N, K = map(int, input().split())\n\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s044485865', 's194436643', 's849661576', 's176267883'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0] | [98, 71, 99, 80] |
p03284 | u277641173 | 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(0,30):\n for j in range(0,30):\n if i*4+j+7==30:\n print("Yes")\n break\n else:\n count+=1\nif count==900:\n print("No")', 'n,k=map(int,input().split())\nif n%k==0:\n print("0")\nelse:\n print("1")'] | ['Runtime Error', 'Accepted'] | ['s137509766', 's939341628'] | [2940.0, 2940.0] | [18.0, 17.0] | [173, 71] |
p03284 | u277802731 | 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. | ["#105b\nn=int(input())\nx = n//4\nif n%4==0 or n%11==0:\n print('Yes')\n exit()\nelse:\n for i in range(x):\n for j in range(x):\n temp=4*i+7*j\n if temp==n:\n print('Yes')\n exit()\nprint('No')", '#105a\nn,k=map(int,input().split())\nprint(0 if n%k==0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s218967915', 's621905184'] | [2940.0, 2940.0] | [17.0, 17.0] | [248, 60] |
p03284 | u283751459 | 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,k = map(int,input().split())\n\nif n%k == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s711787968', 's945952273'] | [8996.0, 9072.0] | [28.0, 28.0] | [71, 73] |
p03284 | u288430479 | 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 = int(input())\nwhile s >0:\n s = s-4\n if s%7 == 0:\n print('Yes')\n break\n \nif s<=0:\n print('No')", "s = int(input())\nwhile s >0:\n if s%7 == 0:\n print('Yes')\n break\n s -= 4\n \nif s<0:\n print('No')", 'N,K = map(int,input().split())\nif N%K == 0:\n print(0)\n \nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s895875738', 's922901064', 's962579383'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [108, 106, 74] |
p03284 | u290211456 | 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()))\nif n%k != 0:\n\tprint(n//k + 1)\nelse:\n\tprint(n//k)', 'n, k = list(map(int, input().split()))\nif n%k != 0:\n\tprint(1)\nelse:\n\tprint(0)'] | ['Wrong Answer', 'Accepted'] | ['s976420437', 's550481805'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 77] |
p03284 | u293992530 | 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 return 0\nelse:\n return 1', 'N, K = map(int, input().split())\nif(N%K==0):\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s472222795', 's776146211'] | [2940.0, 2940.0] | [17.0, 19.0] | [76, 76] |
p03284 | u294385082 | 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)\nelif n < k:\n print((1)\nelse:\n print((n//k) - 1)', 'n,k = map(int,input().split())\nif n%k ==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s813856294', 's405715691'] | [2940.0, 2940.0] | [17.0, 17.0] | [103, 70] |
p03284 | u295457032 | 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, inpu().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,K=map(int, input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s135324531', 's722723149', 's711668958'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [68, 69, 70] |
p03284 | u314050667 | 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, k = map(int, input().split())\n\nif n % k == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s180766964', 's694515975'] | [2940.0, 2940.0] | [17.0, 18.0] | [80, 80] |
p03284 | u320763652 | 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)\nelse:\n print(0)\n\n', 'n,k= map(int, input().split())\n\nif n%k == 0:\n print(0)\nelse:\n print(1)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s607239787', 's768188998'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 78] |
p03284 | u324139341 | 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")'] | ['Runtime Error', 'Accepted'] | ['s262427549', 's055415219'] | [2940.0, 2940.0] | [17.0, 17.0] | [82, 80] |
p03284 | u327532412 | 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(1)'] | ['Wrong Answer', 'Accepted'] | ['s972146883', 's551461126'] | [2940.0, 2940.0] | [18.0, 17.0] | [90, 75] |
p03284 | u331036636 | 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([1,0][a%b==0]))', 'a,b=map(int,input().split());print([1,0][a%b==0])'] | ['Runtime Error', 'Accepted'] | ['s938755244', 's123569546'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 49] |
p03284 | u331381193 | 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. | ["t=int(input())\n\nres='No'\n\nif t>3 and (t%4==0 or t%7==0 or t%4==3 or t%7==4):\n\tres='Yes'\n\nprint(res)", 'n,k=map(int,input().split())\n\nres=1\n\nif n%k==0:\n\tres=0\n\nprint(res)'] | ['Runtime Error', 'Accepted'] | ['s053274134', 's432807079'] | [2940.0, 2940.0] | [17.0, 17.0] | [99, 66] |
p03284 | u333731247 | 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==1:\n print(0)\nelse:\n print(int(N/K)+1-int(N/K))', 'N,K=map(int,input().split())\n\nif N%K==1:\n print(0)\nelse:\n print(int(N/K)+1-int(N/K))', 'N,K=map(int,input().split())\n\nif N%K==0:\n print(0)\nelse:\n print(int(N/K)+1-int(N/K))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s173050676', 's700030006', 's088518906'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [60, 90, 90] |
p03284 | u339199690 | 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\nres = "No"\nfor cake in range(0, int(n/4) + 1):\n for dornut in range(0, int(n/7) + 1):\n if 4 * cake + 7 * dornut == n:\n res = "Yes"\n break\n else:\n continue\n break\n\nprint(res)', 'N, K = map(int, input().split())\n\nprint(int(N % K != 0))'] | ['Runtime Error', 'Accepted'] | ['s798226702', 's602343954'] | [2940.0, 2940.0] | [17.0, 17.0] | [236, 56] |
p03284 | u339503988 | 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!=0)', 'a,b=map(int,input().split())\nprint(int(a%b!=0))'] | ['Wrong Answer', 'Accepted'] | ['s747337898', 's994338659'] | [2940.0, 2940.0] | [17.0, 17.0] | [42, 47] |
p03284 | u339922532 | 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 2)', 'n, k = map(int, input().split())\nprint(0 if n % k == 0 else 1)'] | ['Wrong Answer', 'Accepted'] | ['s717855092', 's550373736'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 62] |
p03284 | u342563578 | 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())\nAlist = list(map(int, input().strip().split()))\nr = [0]*N\nr[0] = Alist[0]\nfor i in range(1,len(Alist)):\n r[i] = r[i-1] + Alist[i]\nfor i in range(len(r)):\n r[i] = r[i]%M\nr.sort()\np = []\nm = 0\nfor i in range(1,len(r)):\n m = m+1\n if r[i-1] != r[i]:\n p.append(m)\n m = 0\nm = m+1\np.append(m)\ndef combi(n):\n if n == 0:\n return 0\n if n == 1:\n return 0\n else:\n return (n*(n-1))/2\ns = 0\nfor i in range(len(p)):\n s = s + combi(p[i])\ns = s + p[0]\nprint(int(s))', "N = int(input())\np = []\nif N > 0:\n for i in range(500):\n if (2**(2*i)-1)/3 < N <= (2**(2*(i+1))-1)/3:\n q = 2*i + 1\nif N < 0:\n for i in range(1,500):\n if -(2**(2*i+1)-2)/3 <= N < -(2**(2*i-1)-2)/3:\n q = 2*i\nif N == 0:\n q = 1\ndef cal(n,i):\n if i % 2 != 0:\n if (2**(i-1)-1)/3 < n <= (2**(i+1)-1)/3:\n p.append(1)\n n = n - (-2)**(i-1)\n i = i-1\n if i > 0:\n cal(n,i)\n else:\n p.append(0)\n i = i-1\n if i > 0:\n cal(n,i)\n elif n == 0:\n p.append(0)\n i = i-1\n if i > 0:\n cal(n,i)\n else:\n if -(2**(i+1)-2)/3 <= n < -(2**(i-1)-2)/3:\n p.append(1)\n n = n - (-2)**(i-1)\n i = i-1\n if i > 0:\n cal(n,i)\n else:\n p.append(0)\n i = i-1\n if i > 0:\n cal(n,i)\n \n return p\nans = cal(N,q)\nfor i in range(len(ans)):\n ans[i] = str(ans[i])\nprint(''.join(ans))", 'N, K = map(int,input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s312618084', 's421901958', 's541591978'] | [3064.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [538, 1071, 78] |
p03284 | u350049649 | 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 K-N%K )', 'N,K=map(int,input().split())\nprint(0 if N%K==0 else 1)'] | ['Wrong Answer', 'Accepted'] | ['s782989506', 's931157916'] | [3060.0, 2940.0] | [20.0, 17.0] | [59, 54] |
p03284 | u350412774 | 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())\nres = 'No'\nfor i in range(int(100/7)+1):\n\tfor j in range(int(100/4)+1):\n\t\ta = i*7 + j*4\n\t\tif int(N) == a:\n\t\t\tres='Yes'\nprint(res)\n", 'N, K = map(int, input().split())\n\na = [0] * K\n\nfor i in range(N):\n a[i%K] +=1\n\nprint(max(a) - min(a))'] | ['Runtime Error', 'Accepted'] | ['s494654385', 's814356618'] | [3064.0, 2940.0] | [17.0, 17.0] | [147, 102] |
p03284 | u363610900 | 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())\nres = N//K\ncnt = N%2\nprint(res - cnt if N//K == 0 else 0)', 'N, K = map(int, input().split())\nprint(0 if N%K == 0 else 1)'] | ['Wrong Answer', 'Accepted'] | ['s147568823', 's888334555'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 60] |
p03284 | u366959492 | 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=list(map(int,input().split()))\nfrom collections import Counter\nc=[0]\nfor i in a:\n c.append((c[-1]+i)%m)\ncc=Counter(c)\nans=0\nfor i in cc.values():\n ans+=i*(i-1)//2\nprint(ans)\n', 'n,k=map(int,input().split())\nif n%k==0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s592834348', 's078586095'] | [3060.0, 2940.0] | [17.0, 17.0] | [211, 72] |
p03284 | u368796742 | 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())\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'] | ['s716412184', 's363940539'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 74] |
p03284 | u371132735 | 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,inpuit())\nprint(N%K)', 'N ,K = map(int,inpuit())\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)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s876660093', 's940724492', 's185899396'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [35, 66, 72] |
p03284 | u371467115 | 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(1)\nelse:\n print(0)\n', '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', 'Wrong Answer', 'Accepted'] | ['s859854558', 's987172882', 's669036879'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [72, 79, 72] |
p03284 | u371530330 | 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 or k%n == 0:\n print(0)\n \nelse:\n print(1)', 'N,K = map(int,input().split())\nif N % K == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s355783999', 's316440748'] | [2940.0, 2940.0] | [17.0, 17.0] | [88, 73] |
p03284 | u373047809 | 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(1 if evac(input().replace(" ", "%")) else 0)', 'print(eval(input().replace(" ","%"))%2)'] | ['Runtime Error', 'Accepted'] | ['s162751035', 's181233584'] | [2940.0, 2940.0] | [17.0, 17.0] | [50, 39] |
p03284 | u374051158 | 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(n%k!=0)', 'n, k = map(int, input().split())\nprint(int(n%k!=0))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s004784925', 's507959960', 's974064338'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [45, 46, 51] |
p03284 | u377158682 | 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 B():\n n = int(input())\n mul4 = n % 4\n mul8 = n % 8\n mul7 = n % 7\n mul6 = n % 6\n mul11 = n % 11\n\n YES='Yes'\n NO='No'\n\n if mul4==0 or mul7==0 or mul11==0:\n print(YES)\n elif mul7 % 4==0:\n print(YES)\n elif mul8 % 7==0:\n print(YES)\n elif n==30 or n==60 or n==90:\n print(YES)\n else:\n print(NO)\n \n\nif __name__ =='__main__':\n B()", "def A():\n a = input().split()\n if len(a) ==2: \n n = int(a[0])\n k = int(a[1])\n if n % k != 0:\n print(1)\n else:\n print(0)\n\n\nif __name__ =='__main__':\n A()"] | ['Runtime Error', 'Accepted'] | ['s906327927', 's435208331'] | [3064.0, 2940.0] | [17.0, 17.0] | [409, 222] |
p03284 | u377219748 | 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: \n print("No")\n\nif n % 4 == 0 or n % 7 == 0: \n print("Yes")\n\nfour_max = n // 4\n\nm = 1\nans = False\nwhile m < four_max + 1:\n if (n - (4*m)) % 7 == 0:\n ans = True\n break\n m = m+1\n\nif ans:\n print("Yes")\nelse:\n print("No")\n ', 'n, k = map(int, input().split())\nif n % k != 0:\n print(1)\nelse:\n print(0)\n'] | ['Runtime Error', 'Accepted'] | ['s561498075', 's329857359'] | [3060.0, 2940.0] | [18.0, 17.0] | [291, 76] |
p03284 | u377989038 | 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'] | ['s137188651', 's789305203'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 79] |
p03284 | u379629675 | 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\ndef main():\n \n return\n\nif __name__ == "__main__":\n main()\n', 'import sys\n\ndef main():\n n, k = map(int, input().split())\n if n % k == 0:\n print(0)\n else:\n print(1)\n return\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s812260392', 's754860650'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 174] |
p03284 | u380284234 | 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("1" if n%k == 0 else "0")', 'n,k=map(int,input().split())\nprint("0" if n%k == 0 else "1")'] | ['Wrong Answer', 'Accepted'] | ['s270746262', 's493176882'] | [2940.0, 3316.0] | [17.0, 21.0] | [60, 60] |
p03284 | u390618988 | 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\n\nN, K = [int(x) for x in stdin.readline().rstrip()]\n\nif N % K == 0:\n print('0')\nelse:\n print('1')\n", "from sys import stdin\n\nN, K = [int(x) for x in stdin.readline().rstrip().split()]\n\nif N % K == 0:\n print('0')\nelse:\n print('1')\n"] | ['Runtime Error', 'Accepted'] | ['s878956975', 's428419320'] | [2940.0, 2940.0] | [18.0, 17.0] | [126, 134] |
p03284 | u390958150 | 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 = int(input()).split()\n\nif a % b == 0:\n print(0)\nelse:\n print(1)', 'a,b = [int(i) for i in input().split()]\n\nif a % b == 0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s567618827', 's077428424'] | [2940.0, 2940.0] | [18.0, 18.0] | [70, 83] |
p03284 | u391328897 | 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)', 'n, k = int(input()).split()\nprint(n%k - 1)', 'n, k = map(int, input().split())\nif n % k == 0:\n print(0)\nelse:\n print(1)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s008642657', 's481488243', 's894492244'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [47, 42, 80] |
p03284 | u393881437 | 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 = list(map(int,input()))\n\nprint(0 if a%b==0 else 1)', 'a,b = list(map(int,input().split()))\n\nprint(0 if a%b==0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s644921088', 's660927059'] | [2940.0, 2940.0] | [17.0, 17.0] | [55, 63] |
p03284 | u396495667 | 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(m%k)\nelse:\n print(0)', 'n,k = map(int, input().split())\n\nif n %k !=0:\n print(0)\nelse:\n print(1)', 'n,k = map(int, input().split())\nprint(1 if n%k !=0 else 0)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s467180995', 's693051980', 's553909086'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [75, 73, 58] |
p03284 | u415325136 | 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)\n'] | ['Runtime Error', 'Accepted'] | ['s948835383', 's557420290'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 76] |
p03284 | u418527037 | 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 N % K => 1:\n print(1)\nelse:\n print(0)', 'N, K = map(int, input().split())\n \nif N % K >= 1:\n print(1)\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s785708141', 's768803238'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 77] |
p03284 | u419963262 | 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(1)\nelse:\n print(0)', 'N,K=map(int,input().split())\nif N%K==0:\n print(0)\nelse:\n print(1)'] | ['Wrong Answer', 'Accepted'] | ['s200188087', 's057061084'] | [2940.0, 2940.0] | [17.0, 17.0] | [67, 67] |
p03284 | u430537811 | 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. | ['# cook your dish here\nn,k=list(map(int,input().split()))\nx=int(n/k)\nr=n-(k*x)\nprint(abs(r-k))', '# cook your dish here\nn,k=list(map(int,input().split()))\nif n%k==0:\n print(0)\nelse:\n print(1)\n \n '] | ['Wrong Answer', 'Accepted'] | ['s002260159', 's474308213'] | [2940.0, 2940.0] | [18.0, 17.0] | [93, 109] |
p03284 | u432805419 | 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().split()))\na.sort()\nprint(a[0] % a[1])', 'a = map(int,input().split())\nif a%b == 0:\n print(0)\nelse:\n print(1)', 'a,b = list(map(int,input().split()))\n\nif a % b == 0:\n print(0)\nelse:\n print(1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s209018541', 's921958588', 's983758975'] | [2940.0, 2940.0, 3316.0] | [17.0, 17.0, 18.0] | [62, 69, 80] |
p03284 | u435314001 | 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()))\na = -(-N//K) - (N//K)\nprint(a)', 'N, K = list(map(int, input()))\nprint(-(-N//K) - (N//K))', 'N, K = list(map(int, input().split()))\nprint(-(-N//K) - (N//K))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s066509775', 's351506499', 's114618356'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [61, 55, 63] |
p03284 | u444732068 | 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\ncounter = 0\nfor number_cake in range(0,N):\n\tfor number_donut in range(0,N):\n\t\tif(N == number_cake*4+number_donut*7):\n\t\t\tcounter += 1\n\nif(counter > 0):\n\tprint("Yes")\nelse:\n\tprint("No")\n', 'N,K = list(map(int,input().split()))\n\nif N % K == 0:\n\tprint("0")\n\texit()\nprint("1")\n'] | ['Runtime Error', 'Accepted'] | ['s153547286', 's513538686'] | [2940.0, 2940.0] | [18.0, 17.0] | [202, 84] |
p03284 | u448720391 | 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,k = map(int,input().split())\n\nif n%k == 0:\n print(0)\nelse:\n print(1)\n'] | ['Runtime Error', 'Accepted'] | ['s202825716', 's492035090'] | [2940.0, 2940.0] | [17.0, 17.0] | [71, 73] |
p03284 | u460386402 | 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(27):\n for j in range(27):\n if 4*i+7*j==n:\n print('Yes')\n exit()\nprint('No')", 'n,k=map(int,input().split())\nif n%k==0:\n print(0)\nelse:\n print(1)'] | ['Runtime Error', 'Accepted'] | ['s522332708', 's974973959'] | [2940.0, 2940.0] | [17.0, 17.0] | [119, 67] |
p03284 | u474270503 | 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())\nis_ans=0\nfor i in range(25):\n if is_ans:\n break\n for j in range(14):\n if 4*i+7*j==N:\n is_ans=1\n break\nprint("Yes" if is_ans else "No")', 'N, K=list(map(int,input().split()))\nprint(0 if N%K==0 else 1)'] | ['Runtime Error', 'Accepted'] | ['s641747279', 's032925684'] | [2940.0, 2940.0] | [17.0, 17.0] | [191, 61] |
p03284 | u475675023 | 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()\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'] | ['s353673232', 's209739227'] | [2940.0, 2940.0] | [20.0, 17.0] | [54, 71] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.