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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02783 | u799428010 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A=map(int, input().split())\nprint(math.ceil(H/A))', 'N,A=map(int, input().split())\nprint(N//A)', 'import math\nH,A=map(int, input().split())\nprint(math.ceil(H/A))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s823812096', 's967646942', 's462036594'] | [9152.0, 9024.0, 9116.0] | [24.0, 25.0, 23.0] | [51, 41, 63] |
p02783 | u799635973 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, N = map(int, input().split())\nA = [int(x) for x in input().split()]\nlist2 = sorted(A, reverse=True) \nif N>0:\n del list2[0:N]\n print(sum(list2))\nelif N<0:\n print(sum(A))', 'H, A= map(int, input().split())\ncount=0\n\nwhile H>0:\n H=H-A\n count=count+1\n print(count)\n\nprint(count)', 'H, N = map(int, input().split())\nA = [int(x) for x in input().split()]\nlist2 = sorted(A, reverse=True) \nif N>0:\n del list2[0:N]\n print(sum(list2))\nelif N<0:\n print(sum(A))', 'H, A= map(int, input().split())\ncount=0\nwhile H>0:\n H=H-A\n count=count+1\n\n\nprint(count)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s096051775', 's598449156', 's776881762', 's059567005'] | [3060.0, 3408.0, 3060.0, 2940.0] | [17.0, 25.0, 17.0, 19.0] | [200, 110, 200, 93] |
p02783 | u803684095 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\n\n#define MOD (long long)(1e9+7)\n#define INF (1LL<<60)\n\n\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n\n// 最大公約数\nll gcd(ll a, ll b)\n{\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\n// mod m におけるa の逆元\nll modinv(ll a, ll m) {\n ll b = m, u = 1, v = 0;\n while (b) {\n ll t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n u %= m;\n if (u < 0) u += m;\n return u;\n}\n\n// 素因数分解\nvector<pair<ll, ll>> prim;\nvoid pf(ll n)\n{\n ll s = sqrt(n);\n ll r = 0;\n for(ll i = 2; i <= s; i++) {\n if((n % i) == 0) {\n r = 0;\n do {\n\tr++;\n\tn = n / i;\n } while((n % i) == 0);\n prim.push_back({i, r});\n }\n }\n if(n > s) {\n prim.push_back({n, 1});\n }\n}\n\nvoid solve()\n{\n // ll N; cin >> N;\n // ll N, K; cin >> N >> K;\n // ll x, y, z; cin >> x >> y >> z;\n // ll a, b, c; cin >> a >> b >> c;\n // string s; cin >> s;\n // vector<ll> a(N); rep(i, N) cin >> a[i];\n \n // ll ans = 0;\n // bool ok = false;\n\n // cout << ans << endl;\n // cout << (ok?"Yes":"No") << endl;\n}\n\n\nint main(void)\n{\n // ll t; cin >> t; rep(i, t)\n solve();\n}\n', 'h,a=map(int, input().split())\nprint((h-1)//a+1)\n'] | ['Runtime Error', 'Accepted'] | ['s987818486', 's749839622'] | [8916.0, 9048.0] | [28.0, 26.0] | [1444, 48] |
p02783 | u804455323 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ["H A = [int(i) for i in input().split(' ')]\nprint(H // A + 1)", "H A = input().split(' ')\nprint(H // A + 1)", "H, A = [int(i) for i in input().split(' ')]\nprint(H // A + min(H % A, 1))"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s186991221', 's565906921', 's967330521'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [60, 42, 73] |
p02783 | u809541036 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = int(input().split())\n\nx = 1\nwhile True:\n if 0 =< H/(A*x):\n H -= A\n a += 1\n else:\n break\nprint(x)\n ', 'from sys import stdin\nH, A = map(int,stdin.readline().rstrip().split)\n\na = 0\nwhile True\n if x <= H/A:\n H - A\n a += 1\n else:\n break\nprint(a)', 'H, A = int(input().split())\n\nx = 1\nwhile True:\n if 0 <= H/(A*x):\n H -= A\n a += 1\n else:\n break\nprint(x)', 'from sys import stdin\nH, A = map(int,stdin.readline().rstrip().split)\n\na = 0\nwhile True:\n if x <= H/A:\n H - A\n a += 1\n else:\n break\nprint(a)', 'H, A = map(int, input().split())\n\nx = 0\nwhile True:\n if H < 0:\n break\n else:\n x += 1\nprint(x)', 'H, A = map(int, input().split())\n\nprint((H+A-1)/A)', 'H, A = map(int, input().split())\n\nx = 0\nwhile True:\nH = H - A\n if H < 0:\n break\n else:\n x += 1\nprint(x)', 'H, A = map(int, input().split())\n\nx = 0\nwhile True:\n H = H - A\n if H <= 0:\n break\n if H > 0:\n x += 1\nprint(x)', 'from sys import stdin\nH, A = map(int,stdin.readline().rstrip().split)\n\nx = 1\nwhile True:\n if 0 <= H/(A*x):\n H -= A\n a += 1\n else:\n break\nprint(x)', 'H, A = map(int, input().split())\n\nprint((H+A-1)//A)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Time Limit Exceeded', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s003905973', 's054441352', 's151615511', 's184625325', 's204284787', 's398925756', 's512503474', 's676618393', 's907604580', 's829919548'] | [2940.0, 2940.0, 3068.0, 2940.0, 2940.0, 3060.0, 2940.0, 3064.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 18.0, 2104.0, 19.0, 17.0, 19.0, 17.0, 17.0] | [117, 150, 114, 151, 101, 50, 111, 118, 156, 51] |
p02783 | u809819902 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,n= map(int, input().split())\na = sum(list(map(int,input().split())))\nprint("Yes" if h-a <=0 else "No")', 'h,a=map(int,input().split())\nprint(0--h//a)'] | ['Runtime Error', 'Accepted'] | ['s042494050', 's544122916'] | [9056.0, 9148.0] | [31.0, 32.0] | [104, 43] |
p02783 | u811967730 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import sys\n\ninput = sys.stdin.readline\nH, N = map(int, input().split())\nmagic = [list(map(int, input().split())) for _ in range(N)]\n\nmax_damage = max(damage for damage, cost in magic)\ndp = [0] * (H + max_damage)\n\nfor x in range(1, H + max_damage):\n dp[x] = min(dp[x - damage] + cost for damage, cost in magic)\n\nans = min(dp[H:])\n\nprint(ans)\n', 'H, A = map(int, input().split())\n\nans = (H + (A - 1)) // A\n\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s469584368', 's274307999'] | [4340.0, 2940.0] | [63.0, 17.0] | [344, 71] |
p02783 | u816488327 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['from sys import stdin\nf_i = stdin\n\nH, N = map(int, f_i.readline().split())\n\nC = [10 ** 8] * (H * 2)\nC[0] = 0\nfor line in f_i:\n A, B = map(int, line.split())\n for i, vals in enumerate(zip(C, C[A:]), start=A):\n v1, v2 = vals\n C[i] = min(v1 + B, v2)\n if i > H:\n break\n\nprint(min(C[H:]))', 'H, A = map(int, input().split())\n\nif H % A:\n print(H // A + 1)\nelse:\n print(H // A)'] | ['Wrong Answer', 'Accepted'] | ['s231878652', 's434176207'] | [3188.0, 2940.0] | [18.0, 17.0] | [321, 89] |
p02783 | u816631826 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['health = int(input())\ndecrease = int(input())\nattack = 0\nwhile health > 0:\n health = health - decrease\n attack += 1\nprint(attack)', 'import math\n\nH,A= list(map(int,input().split()))\n\nprint(math.ceil(H/A))'] | ['Runtime Error', 'Accepted'] | ['s834521833', 's275814450'] | [2940.0, 2940.0] | [17.0, 17.0] | [135, 71] |
p02783 | u821588465 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = map(int,input().split())\nprint(H//A + 1 if H//A == 0 else H//A)', 'H, A = map(int,input().split())\nprint(H//A if H%A == 0 else H//A + 1)\n'] | ['Wrong Answer', 'Accepted'] | ['s833258566', 's201138869'] | [3060.0, 2940.0] | [19.0, 17.0] | [71, 70] |
p02783 | u821969418 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h, a = map(int, input().split())\n\nans = 0\nwhile h > 0:\n h = h - a\n ans += 1\n \n', 'h, a = map(int, input().split())\n\nans = 0\nwhile h > 0:\n h = h - a\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s313415685', 's721308583'] | [2940.0, 2940.0] | [19.0, 19.0] | [87, 93] |
p02783 | u824237520 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['# = int(input())\n# = map(int, input().split())\n# = list(map(int, input().split()))\n# = list(input())\n# = [tuple(map(int, input().split())) for _ in range(n)]\n\nh, a = map(int, input().split())\n\nprint(h // a)\n\n', '# = int(input())\n# = map(int, input().split())\n# = list(map(int, input().split()))\n# = list(input())\n# = [tuple(map(int, input().split())) for _ in range(n)]\n\nh, a = map(int, input().split())\n\nans = h // a\nif h % a > 0:\n ans += 1\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s894958586', 's978525212'] | [2940.0, 2940.0] | [17.0, 19.0] | [208, 248] |
p02783 | u824734140 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h, r = map(int, input().split())\n\nprint(max(h // r + (1 if h // r == 0 else 0), 1))\n', 'a, b = map(int, input().split())\na_b = -a // b\nprint(0 - a_b)\n'] | ['Wrong Answer', 'Accepted'] | ['s066216045', 's445599622'] | [3316.0, 3316.0] | [19.0, 19.0] | [84, 62] |
p02783 | u828139046 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A = map(int,input())\n\ncount = 0\n\nwhile H > 0:\n\tH -= A\n\tcount += 1\n \nprint(count)\n', 'H,A = map(int,input().split())\ncount=0\nwhile H>0:\n\tH -= A\n\tcount +=1\nprint(count)\n'] | ['Runtime Error', 'Accepted'] | ['s241398080', 's841005722'] | [2940.0, 2940.0] | [17.0, 20.0] | [86, 82] |
p02783 | u828261239 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | [' h,a = map(int,input().split()) \n print(h,a)\n\n if(h<a):\n print("1")\n elif(h%a != 0):\n print(h/a+1)\n else:\n print(h/a)', 'h,a = map(int,input().split()) \n\nif(h<a):\n print("1")\nelif(h%a != 0):\n print(h/a+1)\nelse:\n print(h/a)', 'h,a = map(int,input().split()) \n\nif(h<a):\n print("1")\nelif(h%a != 0):\n print(h//a+1)\nelse:\n print(h//a)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s231057538', 's820739373', 's019018765'] | [2940.0, 2940.0, 3316.0] | [17.0, 17.0, 20.0] | [153, 104, 110] |
p02783 | u830616191 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['x,y = map(int,input().split())', 'H,A = map(int,input().split())\nans = int(H/A)\nif(H <= ans * A):\n print(ans)\nelse:\n print(ans + 1)'] | ['Wrong Answer', 'Accepted'] | ['s752652851', 's180511522'] | [2940.0, 2940.0] | [18.0, 18.0] | [30, 103] |
p02783 | u835090251 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a=map(int,input.split())\nif h%a==0:\n print(h//a)\nelse:\n print(h//a+1)', 'h,a=map(int,input().split())\nif h%a==0:\n print(h//a)\nelse:\n print(h//a+1)\n'] | ['Runtime Error', 'Accepted'] | ['s747951612', 's410472827'] | [8936.0, 9136.0] | [21.0, 28.0] | [73, 76] |
p02783 | u841021102 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h, a = map(int, input().split())\nhits = 0\nwhile h-a > 0:\n h = h - a\n hits += 1 \nprint(hits)', 'h, a = map(int, input().split())\nhits = 0\nwhile h-a > 0:\n hits += 1 \nprint(hits)', 'h, a = map(int, input().split())\nhits = 0\nwhile h-a > 0:\n h = h - a\n hits += 1 \nprint(hits + 1)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s423558002', 's931439559', 's388647115'] | [9132.0, 9168.0, 9084.0] | [25.0, 2205.0, 27.0] | [93, 81, 97] |
p02783 | u845847173 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import math\n\nH,A = map(int, input().split)\nfloat_ver = H / A\nprint(math.ceil(float_ver))', 'H,A = map(int, input().split)\nif H % A == 0:\n print(H // A)\nelse:\n print(H // A + 1)', 'H,A = map(int, input().split)\nanswer_1 = H // A\nanswer_2 = H % A\nif answer_2 == 0:\n print(answer_1)\nelse:\n print(answer_1 + 1)', 'H,A = map(int, input().split())\nif H % A == 0:\n print(H // A)\nelse:\n print(H // A + 1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s037812364', 's355590596', 's483974925', 's743536433'] | [2940.0, 2940.0, 2940.0, 2940.0] | [21.0, 17.0, 17.0, 17.0] | [88, 90, 132, 92] |
p02783 | u852613820 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A = map(int,input.split())\nq,mod= divmod(H,A)\n\nif mod >0:\n q +=1\n \nprint(q)', 'H,A = map(int,input().split())\n\nq,mod= divmod(H,A)\n\nif mod > 0:\n q += 1\n \nprint(int(q))'] | ['Runtime Error', 'Accepted'] | ['s836086021', 's524212759'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 89] |
p02783 | u857070771 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ["h,j = map(int,input().split())\na = list(int(x) for x in input().split())\nif sum(a) < h:\n\tprint('No')\nelse:\n\tprint('Yes')", 'n,k=map(int,input().split())\na=list(int(x) for x in input().split())\na.sort()\ns=0\nif k <= n:\n\tprint(0)\nelse:\n\t\ts = sum(a[:n-k])\n\t\tprint(s)', 'h=int(input())\ncount=0\nwhile h>1:\n\th = h // 2\n\tcount += 1\nprint(2 ** (count+1) - 1)\n', 'h=int(input())\ncount=0\nwhile h>1:\n\th = h // 2\n\tconut += 1\nprint(2 ** (count+1) - 1)', 'n,k=map(int,input().split())\na=list(int(x) for x in input().split())\na.sort(reverse = True)\ns=0\nif k <= n:\n\tprint(0)\nelse:\n\t\ts = sum(a[:n-k])\n\t\tprint(s)', 'h,a=map(int,input().split())\nif h % a ==0:\n\tprint(h // a)\nelse:\n\tprint((h // a ) + 1)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s064846095', 's336917614', 's600181942', 's691875389', 's955097399', 's638027768'] | [2940.0, 3060.0, 2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 19.0, 17.0] | [120, 138, 85, 84, 152, 85] |
p02783 | u863721754 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a = map(int,input().split())\nif a>h:\n att = 1\nelse:\n if h%a==0:\n att = h/a\n elif h%a!=0:\n att = h/a+1\nprint(att)', 'h,a = map(int,input().split())\nif a>h:\n att = 1\nelse:\n if h%a==0:\n att = h/a\n elif h%a!=0:\n att = (h//a)+1\nprint(round(att))'] | ['Wrong Answer', 'Accepted'] | ['s228930030', 's244259932'] | [2940.0, 2940.0] | [17.0, 17.0] | [123, 133] |
p02783 | u870559097 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A=map(int, input().split)\nif H % A == 0:\n print(H / A)\nelse:\n print(H // A + 1)', 'H, A=map(int, input().split())\nif H % A == 0:\n print(H // A)\nelse:\n print(H // A + 1)'] | ['Runtime Error', 'Accepted'] | ['s626078173', 's279597661'] | [2940.0, 2940.0] | [18.0, 17.0] | [84, 87] |
p02783 | u872657955 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['input_1 = input("")\nmylist = list(map(int, input_1.split(" ")))\nH = mylist[0]\nA = mylist[1]\nif H % A =! 0:\n answer = H//A + 1\nelse:\n anser = H//A\nprint(answer)', 'input_1 = input()\nmylist = list(map(int, input_1.split(" ")))\nH = mylist[0]\nA = mylist[1]\nif H % A =! 0:\n answer = H//A + 1\nelse:\n anser = H//A\nprint(answer)\n', 'mylist = list(map(int, myinput.split(" ")))\nH = mylist[0]\nA = mylist[1]\nH // A = C\nprint(C)\n ', 'mylist = list(map(int, myinput.split(" ")))\nH = mylist[0]\nA = mylist[1]\nx = 0\nwhile H >0:\n H -= A\n x += 1\nprint(x)', 'myinput = input()\nmylist = list(map(int, myinput.split(" ")))\nH = mylist[0]\nA = mylist[1]\nx = 0\nwhile H > 0:\n H -= A\n x += 1\nprint(x)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s070375516', 's226392842', 's727587697', 's755196353', 's484808628'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0, 18.0, 19.0] | [161, 160, 100, 116, 135] |
p02783 | u873736356 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = map(int,input().split())\n\nif(h % A != 0):\n print(H // A + 1)\nelse:\n print(H // A)\n', 'H, A = map(int,input().split())\n\nif(H % A != 0):\n print(H // A + 1)\nelse:\n print(H // A)\n'] | ['Runtime Error', 'Accepted'] | ['s341471949', 's271295769'] | [3064.0, 2940.0] | [17.0, 17.0] | [95, 95] |
p02783 | u874301476 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h, a = map(int, input().split())\nprint(h // a + boll(h % a))', 'h, a = map(int, input().split())\nprint(h // a + bool(h % a))\n'] | ['Runtime Error', 'Accepted'] | ['s518709323', 's663175018'] | [2940.0, 2940.0] | [17.0, 17.0] | [60, 61] |
p02783 | u878545651 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A = map(int, input())\nfor i in range(H):\n H = H-4\n i += 1\n if H<= 0:\n break\nprint(i)', 'h, a = map(int, input().split())\n\ni = 0\n\nwhile h > 0:\n h = h - a\n i += 1\n\nprint(i)'] | ['Runtime Error', 'Accepted'] | ['s321679305', 's657480327'] | [2940.0, 2940.0] | [18.0, 18.0] | [97, 88] |
p02783 | u879478232 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,n = map(int,input().split())\ni = list(map(int,input().split()))\nans = 0\nfor j in range(n):\n ans+=i[j]\n if ans >= h:\n print("Yes")\n exit()\nprint("No")', 'h,a = map(int,input().split())\nans = h//a\nif h % a == 0:\n print(ans)\nelse:\n print(ans+1)'] | ['Runtime Error', 'Accepted'] | ['s919339864', 's561886385'] | [2940.0, 2940.0] | [17.0, 17.0] | [171, 94] |
p02783 | u881214802 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['a,b=map(int,imput().split())\nprint(a//b+(1-int(a%b==0)))', 'a,b=map(int,input().split())\nprint(a//b+(1-int(a%b==0)))'] | ['Runtime Error', 'Accepted'] | ['s642046318', 's392170049'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 56] |
p02783 | u883040023 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,n = map(int,input().split())\na = sum(map(int,input().split()))\nprint(["Yes","No"][h>a])', 'h,a = map(int,input().split())\nprint(-(-h//a))'] | ['Runtime Error', 'Accepted'] | ['s956064412', 's093298169'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 46] |
p02783 | u886478505 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['n, k = map(int, input().split())\nh = input().split()\nif (k >= len(h)):\n h.clear()\nelse:\n for i in range(k):\n m = max(h)\n h.remove(m)\nb = 0\nsum(h)\nprint(b)', 'h, n = map(int, input().split())\na = input().split()\nb = 0\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nfor i in range(n):\n b += int(a[i])\nif (h > b):\n print("No")\nelse:\n print("Yes")', 'h, n = map(int, input().split())\na = input().split()\nb = 0\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nfor i in range(n):\n b += int(a[i])\nif (h > b or has_duplicates(a) or len(a) > n ):\n print("No")\nelse:\n print("Yes")', 'n, k = map(int, input().split())\nh = input().split()\nif (k > len(h)):\n h.clear()\nelse:\n for i in range(k):\n m = max(h)\n h.remove(m)\nb = 0\nfor i in range(len(h)):\n b += int(h[i])\n\nprint(b)', 'a, b = map(int, input().split())\nc = a//b\nif (a%b == 0):\n d = c\nelse :\n d = c+1\nprint(d)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s396965518', 's405733472', 's436848726', 's773481189', 's469466370'] | [2940.0, 3060.0, 3060.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [174, 210, 246, 210, 95] |
p02783 | u888092736 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = map(isn’t, input().split())\nprint((H + A - 1) // A)', 'H, A = map(int, input().split())\nprint((H + A - 1) // A)\n'] | ['Runtime Error', 'Accepted'] | ['s500983755', 's531373759'] | [8888.0, 9044.0] | [21.0, 26.0] | [60, 57] |
p02783 | u890461092 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import fractions\n\nh,a=map(int,input().split())\n\nprint(fractions.ceil(h,a))', 'n=list(map(int,input().split()))\nt = 0\n\nif n[0] % n[1] != 0:\n t = 1\n\nprint(n[0] // n[1] + t)'] | ['Runtime Error', 'Accepted'] | ['s923687037', 's296144120'] | [5432.0, 2940.0] | [38.0, 17.0] | [74, 93] |
p02783 | u891438775 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import math\nl = input().split()\nprint(math.ceil(l[0]/l[1]))\n', 'from math import ceil\nH, A = map(int, input().split())\nprint(ceil(H/A))'] | ['Runtime Error', 'Accepted'] | ['s526915361', 's376733209'] | [2940.0, 2940.0] | [17.0, 17.0] | [60, 71] |
p02783 | u893418950 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['INPUT = list(input().split())\nH = INT(INPUT[0])\nA = INT(INPUT[1])\nif H%A == 0:\n print(H//A)\nelse:\n print(H//A + 1)', 'INPUT = input().split()\nH = INT(INPUT[0])\nA = INT(INPUT[1])\nprint(H//A)', 'INPUT = list(input().split())\nH = int(INPUT[0])\nA = int(INPUT[1])\nif H%A == 0:\n print(H//A)\nelse:\n print(H//A + 1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s136967206', 's827056151', 's705703294'] | [8984.0, 8956.0, 9052.0] | [24.0, 25.0, 27.0] | [116, 71, 116] |
p02783 | u896941378 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = map(int, input().split())\ncnt = 0\nwhile H<=0:\n H //= A\n cnt += 1\n\nprint(cnt+1)', 'H, A = map(int, input().split())\ncnt = 0\nwhile H<=0:\n H //= A\n cnt += 1\n\nprint(cnt+1)', 'H, A = map(int, input().split())\ncnt = 0\nwhile H<=0:\n H //= A\n cnt += 1\n\nprint(cnt+1)', 'H, A = map(int, input().split())\ncnt = 0\nwhile H<=0:\n H //= A\n cnt += 1\n\nprint(cnt+1)', 'H, A = map(int, input().split())\ncnt = 0\nwhile H<=0:\n H //= A\n cnt += 1\n\nprint(cnt+1)', 'H, A = map(int, input().split())\n\nprint((H+A-1)//A)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s071677718', 's311744070', 's558288244', 's863306738', 's989981900', 's184839008'] | [9108.0, 9104.0, 9100.0, 9100.0, 9068.0, 9092.0] | [29.0, 31.0, 32.0, 29.0, 27.0, 27.0] | [91, 91, 91, 91, 91, 51] |
p02783 | u898058223 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,N=map(int,input().split())\nA=list(map(int,input().split()))\nMax_A=0\nfor i in range(len(A)):\n Max_A=Max_A+A[i]\nif Max_A>=H:\n print("YES")\nelse:\n print("NO")', 'H,A=map(int,input().split())\na=H%A\nprint((H+a)/A)', 'H,A=map(int,input().split())\ncount=0\nwhile H>0:\n H=H-A\n count=count+1\nprint(count)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s179384494', 's205625548', 's755462566'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 19.0] | [160, 49, 84] |
p02783 | u898923576 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['[H, A] = input().split(" ")\nreturn int(H/A)', 'H, A = map(int, input().split())\nprint(int(H/A))\n', 'H, A = map(int, input().split())\nprint(int(H/A) if H % A == 0 else int(H/A)+1)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s907554576', 's916110750', 's093231320'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [43, 49, 79] |
p02783 | u901341592 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,N = list(map(int,input().split()))\nalist = list(map(int,input().split()))\nif H <= sum(alist):\n print("Yes")\nelse:\n print("No")', 'h,d = list(map(int, input().split()))\nc,m = divmod(h,d)\nif 0 != m:\n m = 1\nprint(c+m)'] | ['Runtime Error', 'Accepted'] | ['s272194969', 's606837119'] | [2940.0, 2940.0] | [17.0, 17.0] | [130, 85] |
p02783 | u901598613 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['n.m=map(int,input().split())\nprint(round(n/m))', 'n,m=map(int,input().split())\nprint(round(n/m))', 'import math\nn,m=map(int,input().split())\nprint(math.ceil(n/m))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s765009329', 's879091570', 's015684158'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [46, 46, 62] |
p02783 | u904804404 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['from math import ceil\n(lambda H,A : print( ceil(H/A) ))(map(int,input().split()))', 'from math import ceil\n(lambda H,A : print( ceil(H/A) ))(*map(int,input().split()))\n'] | ['Runtime Error', 'Accepted'] | ['s523752426', 's418028898'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 83] |
p02783 | u905974390 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h, a=map(int, input().split())\ncount=0\nwhile h<=0:\n h-=a\n count+=1\nprint(count)', 'h, a=map(int, input().split())\ncount=0\nwhile True:\n h = h-a\n count+=1\n if h<=0:\n break\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s269611663', 's657784630'] | [2940.0, 2940.0] | [17.0, 19.0] | [81, 105] |
p02783 | u906769651 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import numpy as np\nN,K=input().split()\nK=int(K)\n\nA=list(map(int, input().split()))\nA=np.array(A)\nsort_A=np.sort(A)[::-1]\nsort_A=sort_A[K:]\n\nprint(np.sum(sort_A))\n', 'import numpy as np\nN,K=input().split()\nN=int(N)\nK=int(K)\n\nA=list(map(int, input().split()))\nA=np.array(A)\nsort_A=np.sort(A)[::-1]\nsort_A=sort_A[K:]\n\nprint(np.sum(sort_A))', '# coding: utf-8\n# Your code here!\n\n\nh,a=map(int,input().split())\n\nif h%a!=0:\n print(h//a+1)\n\nelse:\n print(int(h/a))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s070034408', 's343725620', 's447512915'] | [12488.0, 12484.0, 9024.0] | [149.0, 153.0, 26.0] | [162, 170, 121] |
p02783 | u907223098 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a=int(input().split())\nif h//a==h/a:\n prinnt(h//a)\nelse:\n print(h//a+1)', 'h,a=(int(i) for i in input().split())\nif h//a==h/a:\n print(h//a)\nelse:\n print(h//a+1)'] | ['Runtime Error', 'Accepted'] | ['s580093766', 's984569113'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 87] |
p02783 | u910270473 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import sys\n\nI = list(map(int, input().split()))\nH = I[0]\nA = I[1]\ncount = 0\n\nif not 1 <= H or not H <= 10**4 or not 1 <= A or not A <= 10**4:\n print("error:1≤H≤10000,1≤A≤10000である必要があります")\n sys.exit()\n# print("H =",H, "A =",A)\n\nwhile True:\n H -= A\n count += 1\n print("H =",H, "A =",A)\n if H < 0:\n break\nprint(count)', 'import sys\nimport math\n\nH = int(input())\ncount = 0\n\nif not 1 <= H or not H <= 10**12:\n print("error:1≤H≤10^12である必要があります")\n sys.exit()\n\nwhile True:\n if H <= 0:\n break\n H = math.floor(H / 2)\n count = 1 + 2*count\nprint(count)\n', 'import sys\n\nI = list(map(int, input().split()))\nH = I[0]\nA = I[1]\ncount = 0\n\nif not 1 <= H or not H <= 10**4 or not 1 <= A or not A <= 10**4:\n print("error:1≤H≤10000,1≤A≤10000である必要があります")\n sys.exit()\n# print("H =",H, "A =",A)\n\nwhile True:\n H -= A\n count += 1\n # print("H =",H, "A =",A)\n if H <= 0:\n break\nprint(count)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s731282234', 's917297541', 's900359052'] | [3612.0, 2940.0, 3064.0] | [36.0, 18.0, 18.0] | [367, 269, 370] |
p02783 | u911449886 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a = map(int,input().split())\nprint(str(h//a))', 'import math\nh,a = map(int,input().split())\nprint(str(math.ceil(h/a)))'] | ['Wrong Answer', 'Accepted'] | ['s533028482', 's116485000'] | [9132.0, 9148.0] | [27.0, 28.0] | [47, 69] |
p02783 | u912359563 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = list(map(int, input().split))\nprint((H + A-1)//A)', 'H, A = map(int, input().split())\nprint((H + A-1)//A)\n'] | ['Runtime Error', 'Accepted'] | ['s473969561', 's125103040'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 53] |
p02783 | u914802579 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a = map(int,input().split())\nprint(h//a+not not h%a)', 'h,a = map(int,input().split())\nprint(h//a+(not not h%a))'] | ['Runtime Error', 'Accepted'] | ['s182043317', 's399593497'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 56] |
p02783 | u915879510 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import math\nh, a = list(map(int, input().split())) \nprint(math.floor(h/a))', 'import math\nh, a = list(map(int, input().split())) \nprint(int(math.floor(h/a)))', 'import math\nh, a = list(map(int, input().split())) \nprint(int(math.ceil(h/a)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s022951876', 's047473189', 's318058777'] | [2940.0, 2940.0, 3188.0] | [17.0, 18.0, 18.0] | [74, 79, 78] |
p02783 | u916389247 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H = int(input()) \nA = int(input()) \nsum = 0\nwhile H > 0 : \n H = H - A\n sum = sum + 1\nprint(sum)', 'n = list(int(map(int,input().split()))) \nH = n[0] \nA = n[1] \nsum = 0 \nwhile H > 0 : \n H = H - A \n sum = sum + 1 \nprint(sum)', 'n = list(map(int,input().split()))\nH = n[0] \nA = n[1] \nsum = 0 \nwhile H > 0 : \n H = H - A \n sum = sum + 1 \nprint(sum)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s090751119', 's768339119', 's019481679'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0] | [97, 129, 123] |
p02783 | u917066681 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['a, h = map(int , input().split())\ncount = 0\n\nwhile(h < 0){\n h -= a;\n count++\n}\nprint(count)', 'h, a = list(map(int , input().split()))\ncount = 0\nwhile h > 0:\n h = h - a\n count += 1\n\nprint(count)\n'] | ['Runtime Error', 'Accepted'] | ['s933371835', 's250311180'] | [2940.0, 2940.0] | [17.0, 18.0] | [97, 106] |
p02783 | u920032768 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import math\nh, a = map(int, input().split())\nprint(math.ceil(h//a))', 'import math\nh, a = map(int, input().split())\nprint(1 if h<a else math.ceil(h/a))'] | ['Wrong Answer', 'Accepted'] | ['s392723792', 's218382796'] | [2940.0, 2940.0] | [17.0, 17.0] | [68, 80] |
p02783 | u922790134 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import numpy as np\nimport math\nH,N = (int(x) for x in input().split())\nA = np.array([0]*N)\nB = np.array([0]*N)\nC = np.array([0.]*N)\nfor i in range(N):\n A[i],B[i] = (int(x) for x in input().split())\n C[i] = float(A[i]) / float(B[i])\n\nindexs = np.argsort(-C)\nA=A[indexs]\nB=B[indexs]\nC=C[indexs]\n\nV=[[0]*(H+1) for i in range(N+1)]\nfor h in range(H+1):\n V[0][h] = B[0]*math.ceil(h/A[0])\n\nfor i in range(N):\n for h in range(H+1):\n if h < A[i]:\n V[i+1][h] = V[i][h]\n elif V[i][h] > (V[i][h-A[i]]+B[i]):\n V[i+1][h] = (V[i][h-A[i]]+B[i])\n else:\n V[i+1][h] = V[i][h]\n\nprint(V[N][H])', 'import math\n\nH,A = (float(x) for x in input().split())\nprint(math.ceil(H/A))\n'] | ['Runtime Error', 'Accepted'] | ['s215353504', 's412486696'] | [21568.0, 2940.0] | [404.0, 17.0] | [640, 77] |
p02783 | u923010184 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A = map(int,input().split())\nif H % A == 0:\n print(H/A)\nelse:\n print(H/A + 1)', 'H,A = map(int,input().split())\nif H % A == 0:\n print(int(H/A))\nelse:\n print(int(H/A + 1))\n'] | ['Wrong Answer', 'Accepted'] | ['s713904264', 's737906859'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 92] |
p02783 | u923270446 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a = map(int, input().split)\nans = 0\nif h % a == 0:\n ans = h // a\nelse:\n ans = h // a + 1\nprint(ans)', 'h,a = int(input())\nans = 0\nif h % a == 0:\n ans = h // a\nelse:\n ans = h // a + 1\nprint(ans)', 'h,a = map(int, input().split())\nans = 0\nif h % a == 0:\n ans = h // a\nelse:\n ans = h // a + 1\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s407046051', 's472496818', 's902253486'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [103, 92, 105] |
p02783 | u927807968 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['A,B map(int,input().split())\nprint(int(A/B))', 'A,B = map(int,input().split())\nprint(int(A/B))', 'A,B = map(int,input().split())\nC=A/B\nif(C>int(A/B)):\n D=int(A/B)+1\nelse:\n D=int(A/B)\nprint(D)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s027984012', 's307539756', 's947373792'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [44, 46, 95] |
p02783 | u928480992 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h = int(input()) \na = int(input()) # Servant attack\nx = a\nattack = 1\n\nwhile h > x :\n h -= x\n attack += 1\n\nprint(attack)\n', '\nmonsterHP, attackDamage = map(int, input().split())\nattack = 1\n\n# Calculating the number of attacks serval needs to make to win.\nwhile monsterHP > attackDamage :\n monsterHP -= attackDamage\n attack += 1\nprint(attack)\n\n# Check out my Youtube channel! https://www.youtube.com/channel/UCMOKVyAbTZOpKikTrX5dy_A\n'] | ['Runtime Error', 'Accepted'] | ['s514023585', 's345575487'] | [2940.0, 2940.0] | [17.0, 19.0] | [144, 337] |
p02783 | u928784113 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a = map(int,input().split())\nprint(h//a+1 if h%a == 0 else h//a)', 'h,a = map(int,input().split())\nprint(h//a+1 if h%a != 0 else h//a)'] | ['Wrong Answer', 'Accepted'] | ['s180445876', 's929177842'] | [2940.0, 3060.0] | [17.0, 19.0] | [66, 66] |
p02783 | u931029251 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ["import numpy as np\nH, N = map(int, input().split())\nA = np.array([int(num) for num in input().split()])\nif H <= A.sum():\n print('Yes')\nelse:\n print('No')", 'import numpy as np\nH, A = map(int, input().split())\nnum = int(np.ceil(H/A))\nprint(num)'] | ['Runtime Error', 'Accepted'] | ['s838512436', 's786874853'] | [12492.0, 20384.0] | [155.0, 279.0] | [159, 86] |
p02783 | u934052933 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['\ndef main():\n import math\n\n H = int(input())\n if H == 1:\n print(1)\n else:\n count = int(math.log(H, 2))\n ans = 0\n for i in range(count+1):\n ans += 2 ** (i)\n print(ans)\n\nif __name__ == "__main__":\n main()', 'import math\n\ndef main():\n H = int(input())\n if H == 1:\n print(1)\n else:\n count = int(math.log(H, 2))\n ans = 0\n for i in range(count+1):\n ans += 2 ** (i)\n print(ans)\n\nif __name__ == "__main__":\n main()', '\ndef main():\n H, A = map(int, input().split())\n count = 0\n while True:\n H -= A\n count += 1\n if H <= 0:\n break\n\n print(count)\n\n\n\n\n\nif __name__ == "__main__":\n main()'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s909519079', 's918480483', 's270274675'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0] | [267, 262, 211] |
p02783 | u938486382 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ["h, a = list(map(int, input().split(' ')))\nans = 0\nwhile h > 0:\n h -= a\n ans =+ 1\nprint(ans)", "h, a = list(map(int, input().split(' ')))\nans = 0\nwhile h > 0:\n h -= a\n ans += 1\nprint(ans)\n"] | ['Wrong Answer', 'Accepted'] | ['s959289983', 's300280267'] | [9112.0, 9104.0] | [29.0, 30.0] | [93, 94] |
p02783 | u939633554 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h = int(input())\nresult, i = 0, 1\nwhile h > 0:\n h //= 2\n result += i\n i *= 2\n \nprint(result)', 'N, K = map(int, input().split())\nHs = map(int,input().split())\nprint(sum(sorted(Hs, reverse=True)[K::]))', 'import math\n\nH, A = [int(x) for x in input().split()]\nprint(math.ceil(H/A))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s009871912', 's770698789', 's408392169'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [104, 104, 75] |
p02783 | u940831163 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import math\nh, a = map(int, input().split())\nprint(math.ceil(h//a))\n', 'import math\nh, a = map(int, input().split())\nprint(math.ceil(h/a))\n'] | ['Wrong Answer', 'Accepted'] | ['s962515973', 's172604178'] | [3064.0, 2940.0] | [17.0, 17.0] | [68, 67] |
p02783 | u941679604 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['userinput = input("")\nuserlist = userinput.split(" ")\nH = int(user[0])\nA = int(user[1])\nnumberkill = 0\nif H <= 10000 and A <= 1000:\n while H > 0:\n H = H - A\n numberkill = +1\n if H < 0:\n numberkill = +1\n print(numberkill)\n else:\n print(numberkill)\nelse:\n print("")', 'firstinput = input("")\nfirstinputsplit = firstinput.split(" ")\nH = int(firstinputsplit[0])\nN = int(firstinputsplit[1])\nkill = 0\nif H <= 10000 and N <= 10000:\n while H > 0:\n H = H - N\n kill = kill + 1\n print(kill)\nelse:\n print(H)\n'] | ['Runtime Error', 'Accepted'] | ['s956975904', 's577810020'] | [3060.0, 2940.0] | [17.0, 18.0] | [282, 252] |
p02783 | u942018172 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h = int(input())\na = int(input())\nprint(h // a + 1)', 'h = input()\na = input()\nprint(h // a + 1)', 'nums = input().strip().split()\nh = int(nums[0])\na = int(nums[1])\nif h % a == 0:\n print(h // a)\nelse:\n print(h // a + 1)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s134660176', 's579139314', 's841882803'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [51, 41, 126] |
p02783 | u945870410 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import math\nh= int(input())\na= int(input())\nresult = math.ceil(h/a)\nprint(result)\n\n\n', 'import math\nh,a = map(float,input().split())\nresult = math.ceil(h/a)\nprint(result)\n'] | ['Runtime Error', 'Accepted'] | ['s680949689', 's000265312'] | [2940.0, 2940.0] | [18.0, 17.0] | [84, 83] |
p02783 | u948698724 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ["H,N = map(int, input().split())\nlists = [] \nlists.append(int, input().split())\nlists = lists.sort()\nif N>=2 and lists[N-1]+lists[N-2]>=H:\n print('Yes')\nIf N==1 and lists[0]>=H:\n print('Yes')\nif N==1 and lists[0]<H:\n print('No')\nelse:\n print('No')", 'N, K= map(int, input().split())\nlists = list(map(int, input().split()))\nlists.sort()\nif K>=N:\n print(0)\nelse:\n del lists[-K:]\n SUM = sum(lists)\n print(SUM)', "H,N = map(int, input().split())\nlists = list(map(int, input().split()))\nlists.sort()\nif N>=2:\n if lists[N-1]+lists[N-2]>=H:\n print('Yes')\n else:\n print('No')\nelse:\n if lists[0]>=H:\n print('Yes')\n else:\n print('No')", 'N, K= map(int, input().split())\nlists = list(map(int, input().split()))\nlists.sort()\nif K>=N:\n print(0)\nelse:\n if K==0:\n print(SUM)\n else:\n del lists[-K:-1]\n SUM = sum(lists)\n print(SUM)', 'N, K= map(int, input().split())\nlists = list(map(int, input().split()))\nlists.sort()\nif K>=N:\n print(0)\nelse:\n if K==0:\n SUM = sum(lists)\n print(SUM)\n else:\n del lists[-K:]\n SUM = sum(lists)\n print(SUM)', "H,N = map(int, input().split())\nlists = list(map(int, input().split())\nlists.sort()\nif N>=2 and lists[N-1]+lists[N-2]>=H:\n print('Yes')\nIf N==1 and lists[0]>=H:\n print('Yes')\nif N==1 and lists[0]<H:\n print('No')\nelse:\n print('No')", "H,N = map(int, input().split())\nlists = list(map(int, input().split()))\nlists.sort()\nif N>=2:\n if lists[-2]+lists[-1]>=H:\n print('Yes')\n else:\n print('No')\nelse:\n if lists[0]>=H:\n print('Yes')\n else:\n print('No')", 'N, K= map(int, input().split())\nlists = list(map(int, input().split()))\nlists.sort()\nif K>=N:\n print(0)\nelse:\n del lists[-K:]\n SUM = sum(lists)\n print(SUM)', 'H, A = map(int,input().split())\na = int(H/A)\nb = H/A\nif a==b:\n print(a)\nelse:\n c = a+1\n print(c)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s314009727', 's432777151', 's444114663', 's532459944', 's627362856', 's657191392', 's724156292', 's810405211', 's316284906'] | [8912.0, 9192.0, 9168.0, 9164.0, 8960.0, 8840.0, 8972.0, 9096.0, 8996.0] | [27.0, 24.0, 25.0, 25.0, 25.0, 27.0, 26.0, 27.0, 27.0] | [250, 159, 230, 207, 226, 234, 228, 159, 99] |
p02783 | u956811090 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, N = map(int, input().split())\nA = map(int, input().split())\nsum = 0\n\nfor val in A:\n\tsum = sum + val\n\nif sum >= H \n\tprint("Yes")\n \nprint("No")\n', 'H, A = map(int, input().split())\n\nprint(int((H + A - 1) / A))\n'] | ['Runtime Error', 'Accepted'] | ['s008338477', 's278311154'] | [2940.0, 2940.0] | [17.0, 17.0] | [146, 62] |
p02783 | u957843607 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = map(int, input().spit())\ntimes = 0\ncrack = Fasle\nwhile True:\n H -= A\n times += 1\n if H < 0:\n crack = True\n if crack:\n break\nprint(times)\n', 'H, A = map(int, input().split())\ntimes = 0\ncrack = Fasle\nwhile True:\n H -= A\n times += 1\n if H <= 0:\n crack = True\n if crack:\n break\nprint(times)', 'H, A = map(int, input().split())\ntimes = 0\ncrack = False\nwhile True:\n H -= A\n times += 1\n if H <= 0:\n break\nprint(times)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s182805759', 's406969332', 's355725766'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [154, 155, 126] |
p02783 | u958053648 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['X=list(map(int, input().split()))\nY=(X[0]+X[1]-1)/X[1]\n\nprint(Y)', 'X=list(map(int, input().split()))\nY=(X[0]+X[1]-1)/X[1]\n\nprint(int(Y))'] | ['Wrong Answer', 'Accepted'] | ['s803212237', 's249338703'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 69] |
p02783 | u960250266 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import math\nH, A= [int(i) for i in input().split()]\nprint(math.ceil(H,A))', 'a,b = map(int,input().split())\nprint(a//b if a%b ==0 else a//b+1)'] | ['Runtime Error', 'Accepted'] | ['s196532825', 's785309666'] | [2940.0, 2940.0] | [18.0, 17.0] | [73, 65] |
p02783 | u962718741 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A=map(int,input().split())\nans=(H-0.5)//A+1\nprint(ans)', 'H,A=map(int,input().split())\nans=((H-1)//A)+1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s711110571', 's690529651'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 57] |
p02783 | u962858258 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A = map(int,input().split())\nif H%A == 0:\n print(H/A)\nelse:\n print((H/A)+1)', 'H,A = map(int,input().split())\nif H%A == 0:\n print(int(H/A))\nelse:\n print(int(H/A)+1)'] | ['Wrong Answer', 'Accepted'] | ['s508281451', 's695354654'] | [2940.0, 2940.0] | [18.0, 17.0] | [91, 99] |
p02783 | u966546644 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = map(int, input().split())\n \nif A > H:\n print(1)\n \nelse:\n if H % A = 0:\n answer = H // A\n else:\n answer = H // A + 1\n \n print(answer)', 'H, A = map(int, input().split())\n\nif A > H:\n print(1)\n \nelse:\n answer = H // A\n print(answer)', 'H, A = map(int, input().split())\n \nif A > H:\n print(1)\n \nelse:\n if H % A == 0:\n answer = H // A\n else:\n answer = H // A + 1\n \n print(answer)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s406688407', 's739352032', 's645882084'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [151, 97, 152] |
p02783 | u969848070 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h, a = map(int, input().split())\nh1 = h\nx = 0\nwhile h1 <= 0:\n h1 -= a\n x++\nprint(x)', 'h, a = map(int, input().split())\nx = 0\nwhile h > 0:\n h -= a\n x += 1\n\nelse:\n print(x)'] | ['Runtime Error', 'Accepted'] | ['s179657426', 's339017057'] | [2940.0, 2940.0] | [17.0, 19.0] | [85, 87] |
p02783 | u971096161 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H, A = map(int, input().split())\nprint(int(H/A))', 'H, A = map(int, input().split())\n\nprint(-(-H//A))'] | ['Wrong Answer', 'Accepted'] | ['s554622611', 's888383530'] | [2940.0, 2940.0] | [17.0, 17.0] | [48, 49] |
p02783 | u973744316 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H = int(input())\n\ncnt = 0\nans = 0\n\nwhile H >= 1:\n H = H / 2\n if cnt == 0:\n cnt += 1\n ans += 1\n else:\n ans += cnt * 2\n cnt = cnt * 2\n\nprint(ans)\n', 'H, A = map(int, input().split())\n\ncnt = 0\n\nwhile H > 0:\n H = H - A\n cnt += 1\nprint(cnt)\n'] | ['Runtime Error', 'Accepted'] | ['s882313228', 's145361004'] | [2940.0, 2940.0] | [17.0, 18.0] | [181, 94] |
p02783 | u974792613 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a = map(int, input().split())\n\nprint(math.ceil(h/a))', 'import math\n\nh, a = map(int, input().split())\n\nprint(math.ceil(h / a))\n\n'] | ['Runtime Error', 'Accepted'] | ['s524575835', 's400341159'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 72] |
p02783 | u981693103 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['N, K = map(int, input().split())\nH = list(map(int, input().split()))\nif N <= K:\n print(0)\nelif K == 0:\n print(sum(H))\nelse:\n\tH = sort(H)\n\tprint(sum(H[:-K]))', 'def serveal_monter(input):\n H, A = input.split(" ")\n if H % A > 0:\n return (H // A) + 1\n return H // A', 'def serveal_monter(input):\n H, A = input.split(" ")\n H = int(H)\n A = int(A)\n if H % A > 0:\n return (H // A) + 1\n return H // A', 'S = input()\nH, A = S.split(" ")\nH = int(H)\nA = int(A)\nif H%A == 0:\n print(H/A)\nelse:\n print(H/A + 1)', 'S = input()\nH, A = S.split()\nH = int(H)\nA = int(A)\nif H%A == 0:\n print(int(H/A))\nelse:\n print(int(H/A) + 1)'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s066562928', 's456446336', 's611834099', 's754599854', 's863414804'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 23.0, 17.0, 20.0, 17.0] | [158, 108, 134, 102, 109] |
p02783 | u981758672 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h, a = [int(i) for i in input("").split(" ")]\nprint((h+a-1)/a)', 'h, a = [int(i) for i in input("").split(" ")]\nprint((h+a-1)//a)'] | ['Wrong Answer', 'Accepted'] | ['s479388125', 's510396563'] | [9036.0, 9056.0] | [26.0, 30.0] | [62, 63] |
p02783 | u982749462 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H = input()\nA = input()\nc = 0\nwhile true:\n H = H - A\n c = c+1\n if H < 0:\n print(c)\n ', 'H,A = map(int, input().split())\nc = 0\nwhile True:\n H = H - A\n c = c+1\n if H <= 0:\n print(c)\n break\n \n'] | ['Runtime Error', 'Accepted'] | ['s242000142', 's366349287'] | [2940.0, 2940.0] | [17.0, 18.0] | [93, 113] |
p02783 | u983460293 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['x = [int(x) for x in input().split()]\n\nimport math\n\nprint(math.ceil(x[0]/x[1])', 'x = [int(x) for x in input().split()]\n\nimport math\n\nprint(math.ceil(x[0]/x[1]))'] | ['Runtime Error', 'Accepted'] | ['s946026501', 's278878812'] | [2940.0, 2940.0] | [17.0, 19.0] | [78, 79] |
p02783 | u984989720 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A = map(int,input().split())\nprint(H // A)', 'H,A = map(int,input().split())\nif (H % A) == 0:\n print(H // A)\nelse:\n print((H // A) + 1)\n '] | ['Wrong Answer', 'Accepted'] | ['s496043425', 's772525299'] | [2940.0, 2940.0] | [17.0, 17.0] | [44, 98] |
p02783 | u985279906 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['import itertools\n\nH,N = map(int,input().split())\nA = list(map(int,input().split()))\nl = list(itertools.permutations(A,N))\n\nans = []\nfor i in l:\n if sum(i) >= H:\n ans.append("Yes")\n else:\n ans.append("No")\n\nif "Yes" in ans:\n print("Yes")\nelse:\n print("No")', 'H,A = map(int,input().split())\n\nif H % A >= 1:\n ans = (H//A) +1\n print(ans)\nelse:\n ans = (H//A)\n print(ans)'] | ['Runtime Error', 'Accepted'] | ['s462095733', 's780495675'] | [3060.0, 2940.0] | [18.0, 17.0] | [281, 119] |
p02783 | u987637902 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['\nh, a = map(int, input().split())\nans = 0\nwhile True:\n if h > 0:\n h = h - a\n ans += 0\n else:\n print(ans)\n exit()\n', 'h, a = map(int, input().split())\nans = 0\nwhile True:\n if h > 0:\n h = h - a\n ans += 1\n else:\n print(ans)\n exit()\n'] | ['Wrong Answer', 'Accepted'] | ['s336940476', 's035830062'] | [9168.0, 8920.0] | [34.0, 27.0] | [147, 146] |
p02783 | u991619971 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A=map(int,input().split())\na=int(H/A)\nif H>=A:\n print(H)\nelse:\n print(a+1)\n', 'H,A=map(int,input().split())\n\nif H%A==0:\n print(int(H/A))\nelse:\n print(int(H/A)+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s836323270', 's691167225'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 89] |
p02783 | u993090205 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['from math import floor\nh,a = map(int,input().split())\nprint(floor(h//a))', 'from math import ceil\na,b = map(int,input().split())\n\nprint(ceil(a,b))', 'from math import ceil\nh,a = map(int,input().split())\n\nprint(ceil(h//a))', 'from math import ceil\n\na,b = map(int,input().split())\n\nprint(ceil(a/b))'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s024579813', 's746066624', 's747533829', 's285217484'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [72, 70, 71, 71] |
p02783 | u995109095 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['\na,b=map(int,input().split())\nprint(a//b if a>=b else (a//b) +1)', 'import math\na,b=map(int,input().split())\nprint(math.ceil(a/b))'] | ['Wrong Answer', 'Accepted'] | ['s921699305', 's446433931'] | [2940.0, 3060.0] | [17.0, 19.0] | [64, 62] |
p02783 | u995163736 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a = map(int,input().split())\nans = 0\nfor h >0:\n h -= a\n ans += 1\nprint(ans)', 'h,a = map(int,input().split())\nans = 0\nwhile h >0:\n h -= a\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s267482146', 's388214226'] | [8924.0, 9144.0] | [21.0, 30.0] | [79, 81] |
p02783 | u996731299 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['H,A=map(int,input().spkit())\nif H%A==0:\n print(H//A)\nelse:\n print((H//A)+1)', 'H,N=map(int,input().split())\nif H%N==0:\n print(H//N)\nelse:\n print((H//N)+1)'] | ['Runtime Error', 'Accepted'] | ['s028083934', 's554427444'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 81] |
p02783 | u998008108 | 2,000 | 1,048,576 | Serval is fighting with a monster. The _health_ of the monster is H. In one attack, Serval can decrease the monster's health by A. There is no other way to decrease the monster's health. Serval wins when the monster's health becomes 0 or below. Find the number of attacks Serval needs to make before winning. | ['h,a=map(int,input().split())\ncnt=1\nwhile(h>=0):\n h=h-a\n cnt+=1\nprint(cnt)', 'h,a=map(int,input().split())\ncnt=0\nwhile(h>0):\n h=h-a\n cnt+=1\nprint(cnt)\n'] | ['Wrong Answer', 'Accepted'] | ['s198423921', 's018556996'] | [2940.0, 2940.0] | [19.0, 18.0] | [75, 75] |
p02784 | u005317312 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ['import numpy as np\nH,N = map(int,input().split())\nA = list(map(int,input().split()))\nif np.sum(A)>=H:\n print("yes")\nelse:\n print("no")', 'import numpy as np\nH,N = map(int,input().split())\nA = list(map(int,input().split()))\nif np.sum(A)>=H:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s736887926', 's343047693'] | [23020.0, 23020.0] | [176.0, 186.0] | [140, 140] |
p02784 | u005977014 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ['H,N=map(int,input().split())\nA=list(map(int, input().split()))\nif sum(A)>=H:\n print("YES")\nelse:\n print("NO")', 'H,N=map(int,input().split())\nA=list(map(int, input().split()))\nif sum(A)>=H:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s369568893', 's789128442'] | [20480.0, 20456.0] | [50.0, 51.0] | [111, 111] |
p02784 | u016753669 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ['H,N=[int(x)for x in input().split()] attack=[int(x) for x in input().split()]\nprint("Yes"if H- sum(attack)<= 0 else "No")', 'H,N=[int(x)for x in input().split()]\nattack=[int(x) for x in input().split()]\nprint("Yes"if H- sum(attack)<= 0 else "No")'] | ['Runtime Error', 'Accepted'] | ['s368651604', 's655461700'] | [2940.0, 13964.0] | [17.0, 46.0] | [121, 121] |
p02784 | u019355060 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ['H,N=map(int, input().split())\nv = list(input().split())\nv = [int(x) for x in v]\nprint(sum(v))\nif H <= sum(v):\n print("Yes")\nelse:\n print("No")', 'H,N=map(int, input().split())\nv = list(input().split())\nv = [int(x) for x in v]\nif H <= sum(v):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s576698785', 's278738033'] | [13492.0, 13308.0] | [46.0, 46.0] | [148, 134] |
p02784 | u026002792 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ["h,n = map(int,input().split())\nans = sum([int(i) for i in input().split()])\n\nprint(ans)\nif ans >= h:\n print('Yes')\nelse:\n print('No')", "h,n = map(int,input().split())\nans = sum([int(i) for i in input().split()])\n\nif ans >= h:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s065552896', 's464145056'] | [13788.0, 13788.0] | [46.0, 44.0] | [135, 124] |
p02784 | u026862065 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ['h, a = map(int, input().split())\ncount = 0\nwhile h > 0:\n h -= a\n count += 1\nprint(count)', 'h, n = map(int, input().split())\nl = list(map(int, input().split()))\nif h > sum(l):\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s360216544', 's992185892'] | [3060.0, 14092.0] | [42.0, 41.0] | [94, 122] |
p02784 | u032955959 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ["h,n=map(int,input().split())\na=list(map(int,input().spliy()))\nsum=0\nfor i in a:\n sum=sum+i\n \nif sum >=h:\n print('Yes')\nelse:\n print('No')", "h,n=map(int,input().split())\na=list(map(int,input().spliy()))\nsum=0\nfor i in n:\n sum=sum+a[i]\n \nif sum >=h:\n print('Yes')\nelse:\n print('No')\n", "h,n=map(int,input().split())\na=list(map(int,input().split()))\nsum=0\nfor i in a:\n sum=sum+i\n \nif sum >=h:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s360174446', 's986925964', 's519342441'] | [4468.0, 4468.0, 13964.0] | [18.0, 18.0, 49.0] | [141, 145, 141] |
p02784 | u034459102 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ["h, n = (int(x) for x in input().split())\nA = list(map(int, input().split()))\n\nif n == len(A):\n if sum(A) > h:\n print('yes')\n else:\n print('No')", "h, n = (int(x) for x in input().split())\nA = list(map(int, input().split()))\n\nif n == len(A):\n if sum(A) >= h:\n print('yes')\n else:\n print('No')", "h, n = (int(x) for x in input().split())\nA = list(map(int, input().split()))\n\nif n == len(A):\n if sum(A) >= h:\n print('Yes')\n else:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s195679415', 's247924431', 's453177085'] | [13964.0, 13964.0, 13964.0] | [44.0, 42.0, 42.0] | [163, 164, 164] |
p02784 | u036340997 | 2,000 | 1,048,576 | Raccoon is fighting with a monster. The _health_ of the monster is H. Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health. Raccoon wins when the monster's health becomes 0 or below. If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`. | ["print('No' if int(input().split()[0])<sum(list(map(int, input().split()))) else 'Yes')", "print('No' if int(input().split()[0])>sum(list(map(int, input().split()))) else 'Yes')"] | ['Wrong Answer', 'Accepted'] | ['s214661322', 's450761249'] | [13960.0, 13964.0] | [43.0, 40.0] | [86, 86] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.