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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02699 | u875049118 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["S=input()\ncount=0\n#S3=''\n\n\n# S3+=str(int(S[i])%3)\nfor i in range(0,len(S)-4):\n check3=int(S[i])+int(S[i+1])+int(S[i+2])+int(S[i+3])\n for j in range(i+5,len(S)+1):\n check3+=int(S[j-1])\n check3%=3\n if check3==0:\n if int(S[i:j])%673==0:\n count+=1\n \nprint(str(count))", 'S=[str(input()) for i in range(2*10^1-1)]\nS.pop(0)\nprint(len(set(S)))', "S,W=map(int,input().split()) \nif S<=W:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s875571297', 's928165830', 's958196585'] | [9132.0, 9108.0, 9160.0] | [21.0, 21.0, 20.0] | [358, 69, 82] |
p02699 | u875756191 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["S = input(str())\nW = input(str())\n\nif S > W:\n print('safe')\n\nelif S < W:\n print('unsafe')\n", "python3 make.py abc 999 --num 6\n\nS, W = [int(x) for x in input().split()]\n\nif S > W:\n print('safe')\nelse:\n print('unsafe')", 's, w = list(map(int, input().split()))\n\nif w >= s:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s654640895', 's963103560', 's652836887'] | [9008.0, 8992.0, 9164.0] | [23.0, 22.0, 22.0] | [96, 124, 94] |
p02699 | u876169782 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['n = int(input())\n\nl = []\nfor i in range(n):\n l.append(input())\n \n\nL = []\nfor i in l:\n if i not in L:\n L.append(i)\n \nprint(len(L))', 'a,b = map(int,input().split())\n\nif a > b:\n print("safe")\nelse:\n print("unsafe")\n '] | ['Runtime Error', 'Accepted'] | ['s959922228', 's592224657'] | [9156.0, 9144.0] | [22.0, 23.0] | [135, 84] |
p02699 | u876616721 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s = input().split()\n#print(s)\nif s[0] => s[1]:\n print(unsafe)\n\telse:\n print(safe)\n ', "s = list(map(int, input().split()))\n#print(s)\nif s[0] >= s[1]:\n print('unsafe')\nelse:\n print('safe')", "s = list(map(int, input().split()))\n#print(s)\nif s[0] <= s[1]:\n print('unsafe')\nelse:\n print('safe')\n"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s592762786', 's748137576', 's339490187'] | [8944.0, 9144.0, 9148.0] | [20.0, 20.0, 21.0] | [94, 102, 103] |
p02699 | u880400515 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["S, W = list(map(int, input().split()))\n\nif (W >= S){\n print('unsafe')\n} else{\n print('safe')\n}", "S, W = list(map(int, input().split()))\n\nif (W >= S):\n print('unsafe')\nelse:\n print('safe')\n"] | ['Runtime Error', 'Accepted'] | ['s507368604', 's701399735'] | [8884.0, 9152.0] | [22.0, 22.0] | [100, 97] |
p02699 | u881816188 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s=str(input())\n\nans=0\nfor i in range(len(s)):\n for j in range(i+1, len(s)+1):\n if int(s[i:j])%2019==0:\n ans+=1\nprint(ans)', "s,w=map(int, input().split())\nif s<=w:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s536803134', 's160493429'] | [9024.0, 9156.0] | [25.0, 21.0] | [142, 82] |
p02699 | u884323674 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S = input()\n\nans = 0\nfor i in range(len(S)-3):\n for j in range(i+3, len(S)):\n if int(S[i:j+1]) % 2019 == 0:\n ans += 1\nprint(ans)', 'S, W = map(int, input().split())\n\nif W >= S:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s253226811', 's863804485'] | [9156.0, 9100.0] | [29.0, 25.0] | [149, 88] |
p02699 | u886545507 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["#abc164a\n\na,b,c,d=map(int,input().split())\nx=(a+d-1)//d\ny=(c+b-1)//b\nif x>=y:\n print('Yes')\nelse:\n print('No')\n", "#abc164a\n\na,b,c,d=map(int,input().split())\nx=(a+d-1)/d\ny=(c+b-1)/b\nif x>=y:\n print('Yes')\nelse:\n print('No')\n", "#abc164a\n\ns,w=map(int,input().split())\nif s<=w:\n print('unsafe')\nelse:\n print('safe')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s263224745', 's621874671', 's511033257'] | [8940.0, 9108.0, 9084.0] | [23.0, 23.0, 23.0] | [111, 109, 86] |
p02699 | u887222798 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["S = int(input())\nW = int(input())\nprint('unsafe') if W>= S else print('safe')", "S, W = map(int, input().split())\nprint('unsafe') if W>= S else print('safe')"] | ['Runtime Error', 'Accepted'] | ['s848151831', 's543403313'] | [9164.0, 9152.0] | [25.0, 22.0] | [77, 76] |
p02699 | u890570193 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S, W = map(int,input.split())\nif S <= W:\n print("unsafe")\nelse:print("safe")', 'S, W = map(int,input().split())\nif S <= W:\n print("unsafe")\nelse:print("safe")'] | ['Runtime Error', 'Accepted'] | ['s989245417', 's981136646'] | [8960.0, 9080.0] | [20.0, 21.0] | [77, 79] |
p02699 | u891202624 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S,W=map(int,input().split())\nif W<=S:\n print("unsafe")\nelse:\n print("safe")', 'S,W=map(int,input().split())\nif W>=S:\n print("unsafe")\nelse:\n print("safe")'] | ['Wrong Answer', 'Accepted'] | ['s571533885', 's681696486'] | [9156.0, 8956.0] | [29.0, 27.0] | [81, 81] |
p02699 | u894798465 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['from collections import Counter\nN = list(input())\nM = [0]\nS = 0\nK = 1\nans = 0\n\nfor i in range(len(N)):\n S += int(N[-i-1])*K\n S %= 2019\n\n K *= 10\n K %= 2019\n M.append(S)\n\nP = Counter(M)\nfor i in range(2020):ans+=P[i]*(P[i]-1)//2\nprint(ans)\n', "a,b = map(int,input().split())\n\nif b-a>=0:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s132758223', 's487996742'] | [9376.0, 9016.0] | [25.0, 25.0] | [254, 86] |
p02699 | u901757711 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['a = input("羊の数")\nb = input("狼の数")\n\nS = int(a)\nW = int(b)\n\nif S <= W:\n print("unsafe")\nelse:\n print("safe")\n ', 's, w = map(int, input().split())\n\nif s <= w:\n print("unsafe")\nelse:\n print("safe")\n'] | ['Runtime Error', 'Accepted'] | ['s621909993', 's791577663'] | [8964.0, 9152.0] | [20.0, 24.0] | [123, 89] |
p02699 | u905793676 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['list = input().split()\na = int(list[0])\nb = int(list[1]) \nc = int(list[2])\nd = int(list[3])\n\n\nwhile c>0 and a>0:\n c = c - b\n if c <= 0:\n print("Yes")\n break\n else:\n pass\n\n a = a -d\n if a<= 0:\n print("No")\n break\n else:\n pass\n', 'list = input().split()\ns = list[0]\nw = list[1]\nins = int(s)\ninw = int(w)\nif inw >= ins:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s644116020', 's388319453'] | [9120.0, 9168.0] | [24.0, 22.0] | [326, 131] |
p02699 | u906024886 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S = int(input())\nW = int(input())\nif S <= W : print("unsafe")\nelse: print("safe")', "S = int(input())\nW = int(input())\nif S >= W : print('safe')\nelse: print('unsafe')", 'S = int(input())\nW = int(input())\nif S <= W : print("safe")\nelse: print("unsafe")', 'S = int(input())\nW = int(input())\nif S >= W : print("safe")\nelse: print("unsafe")', 'S = int(input())\nW = int(input())\nif S <= W :\n print("unsafe")\nelse:\n print("safe")', 'S,W = int(input())\nif S <= W : print("unsafe")\nelse: print("safe")', 'S, W = map(int,input().split())\nif S <= W :\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s059328074', 's064265647', 's205757036', 's761651925', 's809382884', 's988465473', 's470542962'] | [9120.0, 9072.0, 9124.0, 9144.0, 9136.0, 9140.0, 9136.0] | [20.0, 21.0, 21.0, 22.0, 22.0, 27.0, 20.0] | [81, 81, 81, 81, 85, 66, 83] |
p02699 | u906057003 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S=int(input("羊の数を入力"))\nW=inr(input("狼の数を入力"))\nif W>=S:\n print("unsafe")\nelse:\n print("safe")\n', 's, w = map(int, input().split())\nif w >= s:\n print("unsafe")\nelse:\n print("safe")\n'] | ['Runtime Error', 'Accepted'] | ['s203026495', 's924202161'] | [9156.0, 9116.0] | [23.0, 22.0] | [121, 82] |
p02699 | u906195369 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s, w = map(int, input().split())\nprint(w>=s)', "a, b, c, d = map(int, input().split())\ntakahashi = [a, b] if a>b else [b, a]\naoki = [c, d] if c>d else [d, c]\nattackers = [takahashi, aoki]\nattacker = 0\n\nwhile 0 not in takahashi and 0 not in aoki:\n attackers[attacker^1][1] = max(0, attackers[attacker^1][1]-attackers[attacker][0])\n attackers[attacker^1].sort(reverse=True)\n attacker = attacker^1\n\nif 0 in attackers[0]:\n print('No')\nelse:\n print('Yes')", "s, w = map(int, input().split())\nprint('unsafe' if w>=s else 'safe')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s121625095', 's292535939', 's685612562'] | [9168.0, 9208.0, 9156.0] | [21.0, 23.0, 20.0] | [44, 407, 69] |
p02699 | u907414670 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s, w = map(int, input())\nif w >= s:\n print('unsafe')\nelse:\n print('safe')", "s, w = map(int, input().split())\nif w >= s:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s929796540', 's443813095'] | [9088.0, 9092.0] | [23.0, 23.0] | [79, 87] |
p02699 | u910536093 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['q = input().split()\nq = [int(i) for i in q]\n\nt = [q[0], q[1]]\na = [q[2], q[3]]\n\nwhile True:\n a[0] = a[0] - t[1]\n if (a[0] <= 0):\n print("Yes")\n break\n\n t[0] = t[0] - a[1]\n if (t[0] <= 0):\n print("No")\n break\n\n', 'q = input().split()\nq = [int(i) for i in q]\n\ns = q[0]\nw = q[1]\n\nif (s <= w):\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s843239785', 's694356727'] | [9196.0, 9164.0] | [25.0, 23.0] | [249, 120] |
p02699 | u912867658 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s,w = input().split()\nprint("safe") if s < w else print("unsafe")', 's,w = input().split()\nprint("safe") if int(s) > int(w) else print("unsafe")'] | ['Wrong Answer', 'Accepted'] | ['s020923192', 's242589989'] | [9108.0, 9160.0] | [22.0, 24.0] | [65, 75] |
p02699 | u917444023 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s.w=map(int,input().split())\nif s<=w:\n print('unsafe')\nelse:\n print('safe')", "def main():\n s,w=map(int,input().split())\n if s<=w:\n print('unsafe')\n else:\n print('safe')\nmain()"] | ['Runtime Error', 'Accepted'] | ['s072128224', 's297021330'] | [9004.0, 9156.0] | [22.0, 21.0] | [77, 116] |
p02699 | u919730120 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s=list(map(int,list(input())))\nn=len(s)\nm=[[0]*(n+1) for _ in range(n+1)]\nans=0\nfor i in range(1,n+1):\n for j in range(i,n+1):\n m[i][j]=(m[i][j-1]*10+s[j-1])%2019\n if m[i][j]==0:\n ans+=1\nprint(ans)', "s,w=map(int,input().split())\nif w>=s:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s825523779', 's006320355'] | [9196.0, 9152.0] | [22.0, 22.0] | [225, 81] |
p02699 | u922952729 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S,W=[int(i) for i in input().split(" ")]\nif W>=S:\n print("unsage")\nelse:\n print("safe")', 'S,W=[int(i) for i in input().split(" ")]\nif W>=S:\n print("unsafe")\nelse:\n print("safe")\n'] | ['Wrong Answer', 'Accepted'] | ['s950544554', 's984449261'] | [9160.0, 9152.0] | [23.0, 23.0] | [93, 94] |
p02699 | u924783770 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['import re\nS=input()\n\nx=[i*2019 for i in range(1,10000)]\n\n\nans=0\n\nfor i in x:\n t=len(re.findall("(?={})".format(i),S))\n ans+=t\n\nprint(ans)\n', 'import re\nS=input()\n\nx=[i for i in range(1,10000)]\nx=map(lambda i:str(i*2019),x)\n\n\n\nans=0\n\nfor i in x:\n t=len(re.findall("(?={})".format(i),S))\n ans+=t\n\nprint(ans)\n', 'S,W=map(int,input().split())\nif W>=S:\n print("unsafe")\nelse:\n print("safe")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s086242116', 's724076486', 's447772000'] | [10396.0, 10380.0, 9180.0] | [333.0, 338.0, 22.0] | [144, 170, 81] |
p02699 | u927373043 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S, W = int(input().split())\n\nif(S > W):\n print("safe")\nelse:\n print("unsafe")', 'S, W = map(int, input().split())\n\nif(S > W):\n print("safe")\nelse:\n print("unsafe")\n'] | ['Runtime Error', 'Accepted'] | ['s181760103', 's624609814'] | [9096.0, 9152.0] | [22.0, 23.0] | [79, 85] |
p02699 | u929768294 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['import collections\nN = int(input())\nS = [input() for i in range(N)]\nprint(len(collections.Counter(S)))', "S,W = map(int,input().split())\nif W>=S:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s045893747', 's693352448'] | [9464.0, 9104.0] | [26.0, 23.0] | [102, 83] |
p02699 | u931173291 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["# import math\n# import numpy as np\n# import itertools\n# import heapq\n# =map(int,input().split())\nw=int(input())\ns=int(input())\nif w>=s:\n print('unsafe')\nelse:\n print('safe')\n\n", "# import math\n# import numpy as np\n# import itertools\n# import heapq\n# =map(int,input().split())\ns,w=map(int,input().split())\nif w>=s:\n print('unsafe')\nelse:\n print('safe')\n\n"] | ['Runtime Error', 'Accepted'] | ['s948124451', 's153236483'] | [9152.0, 9148.0] | [25.0, 21.0] | [181, 180] |
p02699 | u932868243 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["a,b,c,d=map(int,input().split())\nn=1\nwhile c-b*n>0 and a-d*n>0:\n n+=1\nif c-b*(n+1)<=a-d*(n+1):\n print('Yes')\nelse:\n print('No')", "s=int(input())\nw=int(input())\nprint('unsafe' if w>=s else 'safe')", "s,w=map(int,input().split())\nprint('unsafe' if w>=s else 'safe')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s233476475', 's471858937', 's036306254'] | [9168.0, 9156.0, 9156.0] | [20.0, 18.0, 24.0] | [136, 65, 64] |
p02699 | u935089856 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['N = int(input())\na = []\n\nfor i in range(N):\n a.append(input())\n \nb = set(a)\nprint(len(b))', 'N = input().split(" ")\nTL = int(N[0])\nTA = int(N[1])\nAL = int(N[2])\nAA = int(N[3])\na = 0\n\nwhile a == 0:\n AL = AL - TA\n if AL <= 0:\n a = 1\n break\n TL = TL - AA\n if TL <= 0:\n a = 2\n break\nif a == 1:\n print("Yes")\nelif a == 2:\n print("No")\n', 'a = input().split(" ")\ns = int(a[0])\nw = int(a[1])\n\nif w >= s:\n print("unsafe")\nelse:\n print("safe")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s466110041', 's821608312', 's938936698'] | [9160.0, 9188.0, 9160.0] | [21.0, 25.0, 19.0] | [91, 255, 103] |
p02699 | u935840914 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s, w = map(int, input().split())\nif s >= w:\n print("unsafe")\nelse:\n print("safe")\n', 's, w = map(int, input().split())\nif s > w:\n print("safe")\nelse:\n print("unsafe")\n'] | ['Wrong Answer', 'Accepted'] | ['s975886205', 's611511669'] | [9152.0, 9152.0] | [21.0, 22.0] | [88, 87] |
p02699 | u937706062 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S, W = map(int, input().split())\nif W >= S:\n\tprint(unsafe)\nelse:\n\tprint(safe)', "S, W = map(int, input().split())\nif W >= S:\n\tprint('unsafe')\nelse:\n\tprint('safe')"] | ['Runtime Error', 'Accepted'] | ['s683150547', 's185008574'] | [9056.0, 9056.0] | [22.0, 21.0] | [77, 81] |
p02699 | u938051273 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['n, s = map(int, input().split())\n\nif n>s:\n\tprint("sefe")\nelse:\n\tprint("aunsafe")', 'n, s = map(int, input().split())\nprint("safe") if n>s else print("unsafe")'] | ['Wrong Answer', 'Accepted'] | ['s995330608', 's674497211'] | [9132.0, 8932.0] | [23.0, 22.0] | [80, 74] |
p02699 | u940592576 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s = int(input())\nw = int(input())\nif w>=s:\n print("unsafe")\nelse:\n print("safe")', "s,w=map(int,input().split())\nif w>=s:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s946695473', 's309443263'] | [9164.0, 9164.0] | [21.0, 22.0] | [82, 77] |
p02699 | u942356554 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['a,b=map(int,input().split)\nif a=<b:\n print("unsafe")\nelse:\n print("safe")', 'a,b=map(int,input().split())\nif a=<b:\n print("unsafe")\nelse:\n print("safe")', 'a,b=map(int,input().split())\nif a<=b:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s276446986', 's756748991', 's668868527'] | [9012.0, 8960.0, 9160.0] | [20.0, 24.0, 21.0] | [79, 81, 81] |
p02699 | u944886577 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s,w =map(input().split())\n \nif s>w:\n print("safe")\nelse:\n print("unsafe")', 's,w =map(input().stlip())\n\nif s>w:\n print("safe")\nelse:\n print("unsafe")\n ', 's,w =map(int,input().split())\n \nif s>w:\n print("safe")\nelse:\n print("unsafe")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s307439976', 's719936073', 's851910886'] | [9120.0, 9028.0, 9164.0] | [24.0, 29.0, 27.0] | [75, 77, 79] |
p02699 | u948875995 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['a = input()\nb = input()\nif b>=a:\n print("unsafe")\nelse:\n print("safe")', 'a,b = map(int,input().split())\nif b>=a:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s095062023', 's542602829'] | [9028.0, 9096.0] | [25.0, 23.0] | [76, 83] |
p02699 | u948911484 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s = input()\nn = len(s)\nif n < 4:\n quit()\nl,r = 0,4\nans = [[[],[]] for _ in range(n+3)]\nfor i in range(4,8):\n l = 0\n while l+i <= n:\n if int(s[l:(l+i)])%2019 == 0:\n ans[l+1][0].append(l+i)\n ans[l+i+1][1].append(l+1)\n l += 1\nfinal = 0\ncnt = 1\nfor i in range(n+1):\n if ans[i][0] and ans[i][1]:\n cnt += 1\n final += cnt\n elif ans[i][0]:\n final += 1\n cnt = 1\nprint(final)', 's,w = map(int,input().split())\nif w >= s:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s711131053', 's880700530'] | [9136.0, 9096.0] | [24.0, 21.0] | [398, 81] |
p02699 | u952245863 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s,w=map(int.input().split())\nif s<=w:\n print('unsafe')\nelse:\n print('safe')", 's,w=map(int.input().split())\nif s<=w:\n print(unsafe)\nelse:\n print(safe)', "s,w=map(int.input().split());\nif s<=w:\n print('unsafe');\nelse:\n print('safe');\n", 's,w=map(int.input().split());\nif s<=w:\n print(unsafe);\nelse:\n print(safe);\n', "s,w=map(int,input().split())\nif s<=w:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s407143382', 's511624573', 's662084005', 's692382323', 's851784277'] | [9024.0, 9092.0, 9084.0, 9016.0, 8972.0] | [22.0, 21.0, 21.0, 20.0, 25.0] | [77, 73, 81, 77, 77] |
p02699 | u952976920 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['a = input().spolit()\n\nif int(a[0]) > int(a[1]):\n print("safe")\nelse:\n print("unsafe")', 'a = input().split()\n\nif int(a[0]) <= int(a[1]):\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s099706608', 's169599446'] | [8940.0, 9084.0] | [27.0, 28.0] | [87, 87] |
p02699 | u953753178 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s, w = input().split()\nif s <= w:\n print('safe')\nelse:\n print('unsafe')", "s, w = map(int, input().split())\nif s <= w:\n print('unsafe')\nelse:\n print('safe')"] | ['Wrong Answer', 'Accepted'] | ['s484641045', 's554009902'] | [9104.0, 9036.0] | [22.0, 24.0] | [77, 87] |
p02699 | u955125992 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s, w = map(int, input().split())\n\nif s =< w:\n print('unsafe')\nelse:\n print('safe')", "s, w = map(int, input().split())\n\nif s <= w:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s525529757', 's736220873'] | [8944.0, 9164.0] | [22.0, 23.0] | [88, 88] |
p02699 | u956910277 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s, w = list( map( int ,input() )) \nif w >= s:\n\tprint('unsafe')\nelse:\n\tprint('safe')", "s, w = list( map( int , input().split() )) \nif w >= s:\n\tprint('unsafe')\nelse:\n\tprint('safe')"] | ['Runtime Error', 'Accepted'] | ['s708915015', 's377103199'] | [9096.0, 9160.0] | [22.0, 23.0] | [83, 92] |
p02699 | u960046508 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s = int(input())\nw = int(input())\n\nif w >= s:\n print('unsafe')\nelse:\n print('safe')", "s, w = map(int, input().split())\n\nif w >= s:\n print('unsafe')\nelse:\n print('safe')"] | ['Runtime Error', 'Accepted'] | ['s940154251', 's957276605'] | [9148.0, 9192.0] | [22.0, 21.0] | [89, 88] |
p02699 | u961683878 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['import sys\nint1 = lambda x: int(x) - 1\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(500000)\n\nS = read().decode().rstrip()\n\nprod = [str(2019 * i) for i in range(1, 100)]\n\ncnt = 0\nfor p in prod:\n cnt += sum(S.startswith(p, i) for i in range(len(S)))\n\nprint(cnt)\n', 'import sys\nint1 = lambda x: int(x) - 1\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(500000)\n\nS, W = map(int, read())\n\nif W >= S:\n print("unsafe")\nelse:\n print("safe")\n\n\n ', 'import sys\nint1 = lambda x: int(x) - 1\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(500000)\n\nS, W = map(int, read().split())\n\nif W >= S:\n print("unsafe")\nelse:\n print("safe")\n\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s031201480', 's375636021', 's042118165'] | [9120.0, 9104.0, 9172.0] | [21.0, 23.0, 22.0] | [345, 261, 264] |
p02699 | u969080040 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s,w=input().split()\nif s<=w:\n print(unsafe)\nif s>w:\n print(safe)', 'S,W=input().split()\nif S<=W:\n print(unsafe)\nelse:\n print(safe)', 's,w=input().split()\nif s<=w:\n print(unsafe)\nelse:\n print(safe)', 's,w=map(int, input().split())\nif s<=w:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s089786842', 's435370397', 's454475007', 's671891861'] | [9096.0, 9096.0, 8940.0, 9160.0] | [24.0, 25.0, 23.0, 21.0] | [66, 64, 64, 78] |
p02699 | u969190727 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['\nimport sys\ninput=lambda: sys.stdin.readline().rstrip()\n\ndef f(x,y):\n left,right=0,10**9\n while right-left>1:\n mid=(left+right)//2\n if x*mid+mid*(mid-1)//2<=y:\n left=mid\n else:\n right=mid\n return left\n\ndef f1(x,y):\n left,right=0,10**9\n while right-left>1:\n mid=(left+right)//2\n if x*mid+mid**2<=y:\n left=mid\n else:\n right=mid\n return left\n\ndef f2(x,y):\n left,right=0,10**9\n while right-left>1:\n mid=(left+right)//2\n if x*mid+mid*(mid+1)<=y:\n left=mid\n else:\n right=mid\n return left\n\nt=int(input())\nfor _ in range(t):\n l,r=map(int,input().split())\n if l>=r:\n d=l-r\n ct=f(1,d)\n l-=ct*(ct+1)//2\n ct1=f1(ct,l)\n ct2=f2(ct,r)\n if ct1<=ct2:\n ans1=ct+2*ct1\n ans2=l-ct*ct1-ct1**2\n ans3=r-ct*ct1-ct1*(ct1+1)\n else:\n ans1=ct+2*ct2+1\n ans2=l-ct*(ct2+1)-(ct2+1)**2\n ans3=r-ct*ct2-ct2*(ct2+1) \n print("Case #"+str(_+1)+": "+str(ans1)+" "+str(ans2)+" "+str(ans3))\n else:\n d=r-l\n ct=f(1,d)\n r-=ct*(ct+1)//2\n if l==r:\n ct1=f1(ct,l)\n ct2=f2(ct,r)\n if ct1<=ct2:\n ans1=ct+2*ct1\n ans2=l-ct*ct1-ct1**2\n ans3=r-ct*ct1-ct1*(ct1+1)\n else:\n ans1=ct+2*ct2+1\n ans2=l-ct*(ct2+1)-(ct2+1)**2\n ans3=r-ct*ct2-ct2*(ct2+1) \n print("Case #"+str(_+1)+": "+str(ans1)+" "+str(ans2)+" "+str(ans3))\n \n else:\n ct1=f1(ct,r)\n ct2=f2(ct,l)\n if ct1<=ct2:\n ans1=ct+2*ct1\n ans3=r-ct*ct1-ct1**2\n ans2=l-ct*ct1-ct1*(ct1+1)\n else:\n ans1=ct+2*ct2+1\n ans3=r-ct*(ct2+1)-(ct2+1)**2\n ans2=l-ct*ct2-ct2*(ct2+1) \n print("Case #"+str(_+1)+": "+str(ans1)+" "+str(ans2)+" "+str(ans3))', '\nimport sys\ninput=lambda: sys.stdin.readline().rstrip()\nt=int(input())\nfor _ in range(t):\n c,d=map(int,input().split())\n X=[0]+[-int(i) for i in input().split()]\n edge=[[] for i in range(c)]\n E=[0]*d\n for i in range(d):\n u,v=map(int,input().split())\n edge[u-1].append([v-1,i])\n edge[v-1].append([u-1,i])\n \n D=[[] for i in range(c)]\n for i in range(1,c):\n D[X[i]].append(i)\n for i in range(1,c):\n if not D[i]:\n continue\n else:\n for goal in D[i]:\n t_root=0\n dist=float("inf")\n t_ind=0\n for root,ind in edge[goal]:\n if X[root]<dist:\n t_root=root\n dist=X[root]\n t_ind=ind\n E[t_ind]=i-dist\n for i in range(d):\n if E[i]==0:\n E[i]=str(10**6)\n else:\n E[i]=str(E[i])\n ans=" ".join(E)\n print("Case #"+str(_+1)+": "+ans)\n\n', 'import sys\ninput=lambda: sys.stdin.readline().rstrip()\nt=int(input())\nfor _ in range(t):\n c,d=map(int,input().split())\n XX=[int(i) for i in input().split()]\n Y=[]\n YY=[]\n X=[0]*c\n for i,x in enumerate(XX):\n if x>0:\n Y.append(x)\n X[i+1]=x\n else:\n YY.append((-x,i+1))\n\n Y.sort()\n Y=[0]+Y\n YY.sort()\n for x,i in YY:\n X[i]=Y[x-1]+1\n Y=Y[:x]+[Y[x-1]+1]+Y[x:]\n\n\n\n edge=[[] for i in range(c)]\n E=[0]*d\n for i in range(d):\n u,v=map(int,input().split())\n edge[u-1].append([v-1,i])\n edge[v-1].append([u-1,i])\n \n D=[[] for i in range(1000)]\n for i in range(1,c):\n D[X[i]].append(i)\n for i in range(1,1000):\n if not D[i]:\n continue\n else:\n for goal in D[i]:\n t_root=0\n dist=float("inf")\n t_ind=0\n for root,ind in edge[goal]:\n if X[root]<dist:\n t_root=root\n dist=X[root]\n t_ind=ind\n E[t_ind]=i-dist\n for i in range(d):\n if E[i]==0:\n E[i]=str(10**6)\n else:\n E[i]=str(E[i])\n ans=" ".join(E)\n print("Case #"+str(_+1)+": "+ans)\n\n', 'import sys\ninput=lambda: sys.stdin.readline().rstrip()\ns,w=map(int,input().split())\nif w>=s:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s066839080', 's536491673', 's869954540', 's559973132'] | [9364.0, 9228.0, 9284.0, 9060.0] | [24.0, 23.0, 24.0, 27.0] | [1706, 852, 1080, 132] |
p02699 | u970490119 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['n = int(input())\ny = []\nfor x in range(n):\n y.append(input())\nprint(len(set(y)))', "S, W = map(int, input().split())\nprint('Unsafe' if S <= W else 'Safe')\n", "S, W = map(int, input().split())\nprint('Unsafe' if W >= S else 'Safe')\n", "S, W = map(int, input().split())\nprint('unsafe' if W >= S else 'safe')\n"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s541797869', 's558509783', 's881922803', 's329286988'] | [9164.0, 9144.0, 9052.0, 9148.0] | [19.0, 19.0, 24.0, 22.0] | [83, 71, 71, 71] |
p02699 | u972991614 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["S = int(input())\nW = int(input())\n\nif S<W:\n print('unsafe')\nelif S>W :\n print('safe')", "\nA,B,C,D=map(int,input().split())\nwhile True:\n C -= B\n if C<=0:\n print('Yes')\n break\n A -= D\n if A<=0:\n print('No')\n break", "S,W = map(int,input().split())\nif S<=W:\n print('unsafe')\nelif S>W:\n print('safe')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s190776643', 's854344797', 's633089131'] | [9080.0, 9024.0, 9140.0] | [21.0, 24.0, 22.0] | [91, 172, 87] |
p02699 | u973840289 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['a,b=map(int,input().split())\nif b>=a:\n print("unsafe")\n else:\n print("safe")', 'a,b=map(int,input().split())\nif b>=a:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s289199825', 's966106736'] | [8948.0, 9156.0] | [22.0, 22.0] | [78, 81] |
p02699 | u975719989 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['A, B, C, D = map(int, input().split())\n\nfor _ in range(10000):\n C -= B\n if C <= 0:\n print("Yes")\n exit()\n\n A -= D\n if A <= 0:\n print("No")\n exit()\n', 's, w = map(int, input().split())\n\nif s > w:\n print("safe")\nelse:\n print("unsafe")'] | ['Runtime Error', 'Accepted'] | ['s175735311', 's468945279'] | [9108.0, 9100.0] | [24.0, 22.0] | [163, 83] |
p02699 | u976282379 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S, W = map(int, input().split())\nif W>=S:\n print("unsafe")\n else:\n print("safe")', 's = input()\nb = len(s)\nc = 0\nf = 0\nwhile True:\n if f == b:\n break\n elif b - f <= 2:\n f = 0\n b -= 1\n else:\n if int(s[f:b]) % 2019 == 0:\n c += 1\n f += 1\n else:\n f += 1\nprint(c)\n', 'S, W = map(int, input().split())\nif W >= S:\n print("unsafe")\nelse:\n print("safe")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s731692916', 's850981231', 's112712747'] | [9004.0, 9004.0, 9136.0] | [21.0, 20.0, 22.0] | [82, 252, 88] |
p02699 | u982591663 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['A, B = map(int, input().split())\n\nif A <= W:\n print("unsafe")\nelse:\n print("safe")', 'A, B = map(int, input().split())\n\nif A <= B:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Accepted'] | ['s948162869', 's351333835'] | [9156.0, 9160.0] | [24.0, 22.0] | [88, 88] |
p02699 | u982749462 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s, w = map(int, input().split())\nif w > s:\n print('unsafe')\nelse:\n print('safe;)", "s, w = map(int, input().split())\nif w >= s:\n print('unsafe')\nelse:\n print('safe')\n"] | ['Runtime Error', 'Accepted'] | ['s576270796', 's002475681'] | [9020.0, 9104.0] | [23.0, 21.0] | [82, 84] |
p02699 | u984989720 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["a, b, c, d = map(int,input().split())\n\n\nif -(-c // b) <= -(-a // d):\n print('Yes')\nelse:\n print('No')\n", "s,w = map(int,input().split())\n\nif s > w:\n print('safe')\nelif s =< w:\n print('unsafe')", "s,w = map(int,input().split())\n\nif s =< w:\n print('unsafe')\nelif s > w:\n print('safe')\n ", "s,w = map(int,input().split())\n\nif s <= w:\n print('unsafe')\nelif s > w:\n print('safe')\n \n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s625638641', 's649009930', 's901163505', 's660337101'] | [9156.0, 9016.0, 9000.0, 9100.0] | [25.0, 20.0, 20.0, 22.0] | [108, 92, 97, 98] |
p02699 | u985419292 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["a,b= map(int,imput().split())\nc = 'unsafe'\nif a>b:\n c = 'safe'\nprint(c)", "S,W = map(int,input().split())\nif S > W:\n print('safe')\nelse:\n print('unsafe')"] | ['Runtime Error', 'Accepted'] | ['s691445549', 's904954124'] | [9016.0, 9160.0] | [24.0, 24.0] | [72, 80] |
p02699 | u987164499 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['from sys import stdin\nfrom sys import setrecursionlimit\nsetrecursionlimit(10 ** 7)\n\na,b = map(int,stdin.readline().rstrip().split())\n\nif b <= a:\n print("unsafe")\nelse:\n print("safe")\n', 'from sys import stdin\nfrom sys import setrecursionlimit\nsetrecursionlimit(10 ** 7)\n\na,b = map(int,stdin.readline().rstrip().split())\n\nif b >= a:\n print("unsafe")\nelse:\n print("safe")'] | ['Wrong Answer', 'Accepted'] | ['s491059767', 's759517164'] | [9152.0, 9164.0] | [23.0, 22.0] | [189, 188] |
p02699 | u993642190 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S = int(input())\nW = int(input())\n\nif (S <= W) :\n print("unsafe")\nelse :\n print("safe")\n\n', 'S,W = map(int,input().split())\n\nif (S <= W) :\n print("unsafe")\nelse :\n print("safe")\n\n'] | ['Runtime Error', 'Accepted'] | ['s601367048', 's795853744'] | [9092.0, 9152.0] | [21.0, 22.0] | [95, 92] |
p02699 | u993656019 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s = int(input())\nw = int(input())\n \nif w>=s :\n print("unsafe")\nelse : \n print("safe")', 's = int(input())\nw = int(input())\n\nif w>=s :\n print("unsafe")\nelse : \n print("safe")', "s, w = map(int, input().split())\nprint('safe') if s > w else print('unsafe')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s473885795', 's537779725', 's482702051'] | [9104.0, 9176.0, 9152.0] | [23.0, 23.0, 24.0] | [87, 86, 76] |
p02699 | u994502918 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s, w = map(int, input().split())\n\nif w >= s:\n print("unsage")\nelse:\n print("sage")', 's, w = map(int, input().split())\n\nif w >= s:\n print("unsafe")\nelse:\n print("safe")'] | ['Wrong Answer', 'Accepted'] | ['s838333576', 's782462339'] | [9160.0, 9124.0] | [23.0, 22.0] | [88, 88] |
p02699 | u995163736 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s, w = map(int, input().split())\nif s > w:\n print(safe)\nelse:\n print(unsafe)', 's, w = map(int, input().split())\nif s > w:\n print("safe")\nelse:\n print("unsafe")'] | ['Runtime Error', 'Accepted'] | ['s580750627', 's810356744'] | [8848.0, 9144.0] | [26.0, 27.0] | [78, 82] |
p02699 | u996150140 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['S, W = list(map(int, input().split()))\nif W >= S :\n print("Unsafe")\nelse:\n print("Safe")', 'S, W = map(int.input(" ")) \nif W >= S :\n print("Unsafe")\nelse:\n print("Safe")', 'S, W = list(map(int, input().split()))\nif W >= S :\n print("unsafe")\nelse:\n print("safe")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s109590784', 's938229490', 's124228185'] | [9160.0, 9036.0, 9164.0] | [23.0, 23.0, 22.0] | [94, 83, 94] |
p02699 | u996434204 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['s,w = map(int,input().split())\nif s >= w:\n print("unsafe")\nelse:\n print("safe")\n', 's,w = map(int,input().split())\nif s > w:\n print("unsafe")\nelse:\n print("safe")\n', 's,w = map(int,input().split())\nif s > w:\n print("safe")\nelse:\n print("unsafe")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s341013125', 's587215500', 's788952821'] | [9040.0, 9104.0, 9056.0] | [23.0, 20.0, 21.0] | [86, 85, 85] |
p02699 | u997393081 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ["s,w = map(int,input().split())\n\nif s>=w:\n print('unsafe')\nelse:\n print('safe')\n", "s,w = map(int,input().split())\n \nif w>=s:\n print('unsafe')\nelse:\n print('safe')"] | ['Wrong Answer', 'Accepted'] | ['s039198301', 's039913492'] | [9180.0, 9088.0] | [23.0, 22.0] | [81, 81] |
p02699 | u997927785 | 2,000 | 1,048,576 | There are S sheep and W wolves. If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep. If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`. | ['\nA, B, C, D = map(int, input().split())\n\n\n\nif C % B == 0:\n aokiDeath = C // B\nelse:\n aokiDeath = C // B + 1 \n\n\nif A % D == 0:\n takahashiDeath = A // D\nelse:\n takahashiDeath = A // D + 1\n\nif aokiDeath <= takahashiDeath:\n print("Yes")\nelse:\n print("No")', '\nHPlist = list(map(int, input().split()))\nHPlist[0] = A\nHPlist[1] = B\nHPlist[2] = C\nHPlist[3] = D\n\n\n\nif C % B == 0:\n aokiDeath = C // B\nelse:\n aokiDeath = C // B + 1 \n\n\nif A % D == 0:\n takahashiDeath = A // D\nelse:\n takahashiDeath = A // D + 1\n\nif aokiDeath <= takahashiDeath:\n print("Yes")\nelse:\n print("No")', 'N = int(input())\n\nkeihin = []\n\n\nfor i in range(N):\n if keihin.count(input()) == 0:\n keihin.append(input())\n\n\nprint(len(keihin))\n', '\nHPlist = list(map(int, input().split()))\nHPlist[0] = A\nHPlist[1] = B\nHPlist[2] = C\nHPlist[3] = D\n\nint aokiDeath\nint takahashiDeath\n\n\nif C % B == 0:\n aokiDeath = C // B\nelse:\n aokiDeath = C // B + 1 \n\n\nif A % D == 0:\n takahashiDeath = A // D\nelse:\n takahashiDeath = A // D + 1\n\nif aokiDeath <= takahashiDeath:\n print("Yes")\nelse:\n print("No")', '\nS, W = map(int, input().split())\n\nif W >= S:\n print("unsafe")\nelse:\n print("safe")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s046171999', 's366629731', 's524366374', 's815116718', 's261375605'] | [9160.0, 9184.0, 9092.0, 8996.0, 9168.0] | [20.0, 24.0, 21.0, 22.0, 24.0] | [332, 390, 198, 423, 96] |
p02700 | u000037600 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['import sys\na,b,c,d=map(int,input().split())\nwhile a>0 or c>0:\n c-=b\n if c<1:\n print("Yes")\n sys.exit()\n a-=d\nprint("No")', 'import sys\na,b,c,d=map(int,input().split())\nwhile a>0 or c>0:\n c-=b\n if c<1:\n print("Yes")\n sys.exit()\n a-=d\nprint("NO")', 'import sys\na,b,c,d=map(int,input().split())\nwhile a>0:\n c-=b\n if c<1:\n print("Yes")\n sys.exit()\n a-=d\nprint("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s795500724', 's956421043', 's575709076'] | [9156.0, 9060.0, 9092.0] | [28.0, 28.0, 29.0] | [129, 129, 122] |
p02700 | u001207097 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["a , b , c , d = input().split()\n\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\n\nwhile True:\n c -= b\n if c < 0:\n print('Yes')\n break\n a -= d\n if a < 0:\n print('No')\n break\n\n", "a , b , c , d = input().split()\n\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\n\nwhile True:\n c -= b\n if c <= 0:\n print('Yes')\n break\n a -= d\n if a <= 0:\n print('No')\n break\n\n"] | ['Wrong Answer', 'Accepted'] | ['s833493676', 's010400786'] | [9180.0, 9044.0] | [22.0, 23.0] | [178, 180] |
p02700 | u002459665 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["A, B, C, D = list(map(int, input().split()))\n\nc1 = (C+B-1) // B \nc2 = (A+D-1) // D\n\nprint(c2, c2)\n\nif c1 == c2:\n ans = 'Yes'\nelif c1 < c2:\n ans = 'Yes'\nelse:\n ans = 'No'\n\nprint(ans)", "A, B, C, D = list(map(int, input().split()))\n\nc1 = (C+B-1) // B \nc2 = (A+D-1) // D\n\n# print(c2, c2)\n\nif c1 == c2:\n ans = 'Yes'\nelif c1 < c2:\n ans = 'Yes'\nelse:\n ans = 'No'\n\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s449146869', 's683169962'] | [9176.0, 9160.0] | [20.0, 21.0] | [258, 260] |
p02700 | u004062344 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['t_hp, t_pwr, a_hp, a_pwr = map(int, input().split())\n\nwhile True:\n a_hp -= t_pwr\n t_hp -= a_pwr\n\n if a_hp < 0:\n print("Yes")\n break\n elif t_hp < 0:\n print("No")\n break', 't_hp, t_pwr, a_hp, a_pwr = map(int, input().split())\n\nwhile True:\n a_hp -= t_pwr\n t_hp -= a_pwr\n\n if a_hp <= 0:\n print("Yes")\n break\n elif t_hp <= 0:\n print("No")\n break'] | ['Wrong Answer', 'Accepted'] | ['s003560539', 's805367027'] | [9116.0, 9124.0] | [22.0, 21.0] | [207, 209] |
p02700 | u004482945 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["import math\na, b, c, d = map(int, input().split())\nif math.ceil(a//d) + 1 >= math.ceil(c//b) :\n print('Yes')\nelse:\n print('No')\n", "a, b, c, d = map(int, input().split())\nif a//d + 1 >= c//b :\n print('Yes')\nelse:\n print('No')", "import math\na, b, c, d = map(int, input().split())\nif math.ceil(a/d) + 1 >= math.ceil(c/b) :\n print('Yes')\nelse:\n print('No')\n", "import math\na, b, c, d = map(int, input().split())\nif math.ceil(a/d) + 1 > math.ceil(c/b) :\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s092776841', 's181052633', 's922210411', 's952937826'] | [9156.0, 9164.0, 9156.0, 9136.0] | [22.0, 22.0, 20.0, 18.0] | [130, 95, 128, 127] |
p02700 | u006817280 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['\n[a,b,c,d] = list(map(int, input().strip().split()))\n\nx = (a+d-1)//d\ny = (b+c-1)//b\n\nif x >= y:\n\tprint("yes")\nelse:\n\tprint("no")', '\n[a,b,c,d] = list(map(int, input().strip().split()))\n\nx = (a+d-1)//d\ny = (b+c-1)//b\n\nif x >= y:\n\tprint("Yes")\nelse:\n\tprint("No")'] | ['Wrong Answer', 'Accepted'] | ['s250484482', 's476918197'] | [9016.0, 9124.0] | [20.0, 21.0] | [128, 128] |
p02700 | u010777300 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['a,b,c,d=map(int,input().split())\nif a%d>0:\n a=a//d+1\nelif a%d==0:\n a=a//d\nif c%b>0:\n c=c//b+1\nelif c%b==0\nif a>=c:\n print("yes")\nelse:\n print("no")', 'a,b,c,d=map(int,input().split())\nif a%d>0:\n a=a//d+1\nelif a%d==0:\n a=a//d\nif c%b>0:\n c=c//b+1\nelif c%b==0:\n c=c//b\nif a>=c:\n print("YES")\nelse:\n print("NO")', 'a,b,c,d=map(int,input().split())\nif a%d>0:\n a=a//d+1\nelif a%d==0:\n a=a//d\nif c%b>0:\n c=c//b+1\nelif c%b==0:\n c=c//b\nif a>=c:\n print("Yes")\nelse:\n print("No")\n \n \n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s236477616', 's979378332', 's578258019'] | [8912.0, 9120.0, 9040.0] | [22.0, 27.0, 27.0] | [157, 162, 171] |
p02700 | u014139588 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["A,B,C,D = map(int,input().split())\nwhile True:\n if C > 0:\n C -= B\n if C > 0 and A > 0:\n A -= D\n elif C <= 0:\n print('Yes')\n break\n else:\n print('No')\n break\n else:\n print('Yes')\n break", "A,B,C,D = map(int,input().split())\nwhile True:\n if C > 0 and A > 0:\n C -= B\n if C > 0 and A > 0:\n A -= D\n elif C <= 0:\n print('Yes')\n break\n else:\n print('No')\n break"] | ['Wrong Answer', 'Accepted'] | ['s081536356', 's875716035'] | [9100.0, 9104.0] | [21.0, 19.0] | [287, 240] |
p02700 | u015993380 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["a,b,c,d = map(int,input().split())\nturn = 0\nwhile a > 0 or c > 0:\n if turn%2 == 0:\n c -= b\n else:\n a -= d\nprint('Yes' if a > 0 else 'No')", "a,b,c,d = map(int,input().split())\nturn = 0\nwhile a > 0 and c > 0:\n if turn%2 == 0:\n c -= b\n else:\n a -= d\n turn += 1\nprint('Yes' if a > 0 else 'No')"] | ['Time Limit Exceeded', 'Accepted'] | ['s636447032', 's966584812'] | [9076.0, 9172.0] | [2206.0, 22.0] | [145, 158] |
p02700 | u017624958 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["import math\n\nA, B, C, D = list(map(int, input().split()))\n\nnumber_of_turns_takahsi = math.ceil(C / B)\nnumber_of_turns_aoki = math.ceil(A / D)\nprint(number_of_turns_takahsi, number_of_turns_aoki)\n\nanswer = 'Yes' if number_of_turns_takahsi <= number_of_turns_aoki else 'No'\n\nprint(answer)\n", "import math\n\nA, B, C, D = list(map(int, input().split()))\n\nnumber_of_turns_takahsi = math.ceil(C / B)\nnumber_of_turns_aoki = math.ceil(A / D)\n# print(number_of_turns_takahsi, number_of_turns_aoki)\n\nanswer = 'Yes' if number_of_turns_takahsi <= number_of_turns_aoki else 'No'\n\nprint(answer)\n"] | ['Wrong Answer', 'Accepted'] | ['s746085399', 's899611633'] | [9164.0, 9100.0] | [23.0, 23.0] | [287, 289] |
p02700 | u018597853 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | [' import math\n A,B,C,D = map(int,input().split())\n turn = math.ceil(A/D)\n if turn*B >= C:\n print("Yes")\nelse:\n print("No") ', 'import math\nA,B,C,D = map(int,input().split())\nturn = math.ceil(A/D)\nif turn*B >= C:\n print("Yes")\nelse:\n print("No") '] | ['Runtime Error', 'Accepted'] | ['s000414513', 's191408497'] | [8908.0, 9128.0] | [23.0, 20.0] | [133, 128] |
p02700 | u019075898 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['A, B, C, D = [int(x) for x in input().split()]\nrun = True\nwhile run:\n C -= B\n if C <= 0:\n run = False\n result = "Yes"\n continue\n A -= D\n if A <= 0:\n run = False\n result = "No"\n continue', 'A, B, C, D = [int(x) for x in input().split()]\nt = A // D\na = C // B\nif t >= a:\n print("yes")\nelse:\n print("no")', 'A, B, C, D = [int(x) for x in input().split()]\nt = A // D\na = C // B\nif t >= a:\n print("Yes")\nelse:\n print("No")', 'A, B, C, D = [int(x) for x in input().split()]\nt = A // D\na = C // B\nif t >＝ a:\n print("Yes")\nelse:\n print("No")', 'A, B, C, D = [int(x) for x in input().split()]\nwhile True:\n C -= B\n if C <= 0:\n result = "yes"\n break\n A -= D\n if D <= 0:\n result = "no"\n break\nprint(result)', 'A, B, C, D = [int(x) for x in input().split()]\nt = A // D\na = C // B\nif t >= a:\n print("Yes")\nelse:\n print("No")', 'A, B, C, D = [int(x) for x in input().split()]\nrun = True\nwhile run:\n C -= B\n if C <= 0:\n run = False\n result = "Yes"\n continue\n A -= D\n if A <= 0:\n run = False\n result = "No"\n continue\nprint(result)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s054987281', 's057322806', 's313053532', 's477538710', 's710650748', 's971713426', 's949831608'] | [9012.0, 9160.0, 9164.0, 8996.0, 9108.0, 9004.0, 9108.0] | [20.0, 20.0, 24.0, 23.0, 22.0, 22.0, 20.0] | [239, 169, 297, 299, 197, 169, 253] |
p02700 | u021019433 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["a, b, c, d = map(int, input().split())\nprint('YNeos'[-(-a//d) < --(c//b)::2])\n", "a, b, c, d = map(int, input().split())\nprint('YNeos'[a//d < c//b::2])\n", "a, b, c, d = map(int, input().split())\nprint('YNeos'[-(-a//d) < -(-c//b)::2])\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s019425852', 's862541668', 's493845694'] | [9156.0, 9156.0, 9000.0] | [25.0, 21.0, 24.0] | [78, 70, 78] |
p02700 | u021387650 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["A,B,C,D = map(int,input().split())\n \nTakahashi = A\nAoki = B\n \nwhile Takahashi >= 0 or Aoki >=0:\n Aoki -= B\n if Aoki <= 0:\n print('Yes')\n break\n Takahashi -= D\n if Takahashi <= 0:\n print('No')\n break", "A,B,C,D = map(int,input().split())\n \nTakahashi = A\nAoki = C\n \nwhile Takahashi >= 0 or Aoki >=0:\n Aoki -= B\n if Aoki <= 0:\n print('Yes')\n break\n Takahashi -= D\n if Takahashi <= 0:\n print('No')\n break"] | ['Wrong Answer', 'Accepted'] | ['s954077403', 's340387317'] | [9080.0, 9116.0] | [20.0, 20.0] | [214, 214] |
p02700 | u021877437 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["a, b, c, d = list(map(int, input().rstrip().split()))\n\ni = 0\nresult = None\n\nwhile not result:\n if i % 2 == 0:\n d = d - b\n if d <= 0:\n result = 'Yes'\n else:\n a = a - c\n if a <= 0:\n result = 'No'\n\nprint(result)\n\n", "a, b, c, d = list(map(int, input().rstrip().split()))\n\ni = 0\nresult = None\n\nwhile not result:\n if i % 2 == 0:\n c = c - b\n if c <= 0:\n result = 'Yes'\n else:\n a = a - d\n if a <= 0:\n result = 'No'\n\n i = i + 1\n\nprint(result)\n\n"] | ['Wrong Answer', 'Accepted'] | ['s479557955', 's327394547'] | [8980.0, 9072.0] | [19.0, 22.0] | [266, 281] |
p02700 | u022843632 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['N=list(map(int,input().split()))\ntakahashi=N[2]/N[1]\naoki=N[0]/N[3]\n\nprint(takahashi)\nprint(aoki)\n\nif aoki%1!=0:\n aoki=aoki+1 \n\nif takahashi<aoki:\n print("Yes")\nelse:\n print("No")', '\nN=list(map(int,input().split()))\nif N[2]<=N[1]:\n print("Yes")\n exit()\n\ntakahashi=N[2]/N[1]\naoki=N[0]/N[3]\n\nif aoki%1!=0:\n aoki=aoki+1 \n\nif takahashi%1!=0:\n takahashi=takahashi+1\n \n\nif takahashi<=aoki:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s101541773', 's547866838'] | [9248.0, 9176.0] | [23.0, 25.0] | [183, 250] |
p02700 | u023762741 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['input_line = input()\nLine = input_line.split()\nLine = [int(s) for s in Line]\n\n\nprint(-1*(-1*Line[2] // Line[1]))\nprint(-1*(-1*Line[0] // Line[3]))\n\nif -1*(-1*Line[2] // Line[1]) <= -1*(-1*Line[0] // Line[3]):\n print("Yes")\nelse:\n print("No")', 'input_line = input()\nLine = input_line.split()\nLine = [int(s) for s in Line]\n\n\n# print(-1*(-1*Line[2] // Line[1]))\n# print(-1*(-1*Line[0] // Line[3]))\n\nif -1*(-1*Line[2] // Line[1]) <= -1*(-1*Line[0] // Line[3]):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s398788806', 's363135979'] | [9196.0, 9180.0] | [24.0, 22.0] | [247, 251] |
p02700 | u025501820 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['A, B, C, D = map(int, input().split())\n\nwhile True:\n C -= B\n if C <= 0:\n print("Yes")\n exit()\n A -= D\n if A < 0:\n print("No")\n exit()', 'A, B, C, D = map(int, input().split())\n\nwhile True:\n C -= B\n if C <= 0:\n print("Yes")\n exit()\n A -= D\n if A <= 0:\n print("No")\n exit()'] | ['Wrong Answer', 'Accepted'] | ['s081591326', 's616013263'] | [9168.0, 9172.0] | [23.0, 22.0] | [173, 174] |
p02700 | u028014940 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['\nA,B,C,D = map(int,input().split())\n\nif A // D == 0:\n A_zero_num = A // D\nelse:\n A_zero_num = A // D +1\n\nif C // B == 0:\n C_zero_num = C // B\nelse:\n C_zero_num = C // B +1\n\nif A_zero_num == C_zero_num:\n print("Yes")\n\nelif A_zero_num > C_zero_num:\n print("No")\n\nelse:\n print("Yes")', '\nA,B,C,D = map(int,input().split())\n\nfor i in range(100):\n A = A - D\n C = C - B\n\n if C <= 0:\n print("Yes")\n break\n\n elif A <= 0:\n print("No")\n break\n\n else:\n continue'] | ['Wrong Answer', 'Accepted'] | ['s166290055', 's340411669'] | [9184.0, 9176.0] | [22.0, 21.0] | [301, 216] |
p02700 | u032955959 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["a,b,c,d=map(int,input().split())\n\ne=a//d\nf=c//b\n\nif e+1>=f:\n print('Yes')\nelse:\n print('No')", "a,b,c,d=map(int,input().split())\n\ne=a//d\nf=c//b\n\nif a%d>0 and c-(e+1)*b<=0:\n print('Yes')\nelif a%d==0 and c-e*b<=0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s591414487', 's130178687'] | [9164.0, 9172.0] | [20.0, 22.0] | [94, 151] |
p02700 | u034128150 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['from math import ceil\na, b, c, d = map(int, input().split())\nif ceil(a/d) >= ceil(c/d):\n print("Yes")\nelse:\n print("No")', 'from math import ceil\na, b, c, d = map(int, input().split())\nif ceil(a/d) >= ceil(c/b):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s647209687', 's771341476'] | [9160.0, 9100.0] | [20.0, 23.0] | [122, 122] |
p02700 | u035453792 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['a,b,c,d=map(int,input().split())\n\nwhile a>0:\n c-=b\n if c>0:\n a-=d\n else:\n break \nif a<0:\n print("No")\nelse:\n print("Yes")', 'a,b,c,d=map(int,input().split())\n\nwhile a>0:\n c-=b\n if c>0:\n a-=d\n else:\n break \nif a<=0:\n print("No")\nelif a>0:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s263217958', 's941171368'] | [9204.0, 9172.0] | [24.0, 21.0] | [157, 162] |
p02700 | u036514535 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['A, B, C, D = [int(n) for n in input().split()]\ntakahasi_turn = C / B\naoki_turn = A / D\nif int(takahasi_turn) == int(aoki_turn):\n print("Yes")\nelif takahasi_turn >= aoki_turn:\n print("Yes")\nelse:\n print("No")\n', 'A, B, C, D = [int(n) for n in input().split()]\nwhile True:\n C -= B\n if C <= 0:\n print("Yes")\n break\n A -= D\n if A <= 0:\n print("No")\n break\n'] | ['Wrong Answer', 'Accepted'] | ['s469081598', 's039958931'] | [9172.0, 9160.0] | [20.0, 20.0] | [217, 180] |
p02700 | u036693958 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['x = list(map(int, input("Enter a multiple value: ").split()))\nfor i in x:\n x[1] -= x[2]\n x[0] -= x[3]\nif x[0]<0:\n print("No")\nelse:\n print("Yes")', 'A, B, C, D = map(int, input().split())\nwhile A > 0 and C >0:\n C -= B\n A -= D\nprint("Yes" if C <= 0 else "No")'] | ['Wrong Answer', 'Accepted'] | ['s786552628', 's530171333'] | [9176.0, 9000.0] | [22.0, 21.0] | [157, 115] |
p02700 | u037601040 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['a, b, c, d = list(map(int, input().split()))\ni = 1\nwhile a>=0 and c>=0:\n if i % 2 == 0:\n a -= d\n else:\n c -= b\nelse: \n if a > c:\n print("Yes")\n else:\n print("No")\n', 'a, b, c, d = list(map(int, input().split()))\ni = 1\nwhile a>0 and c>0:\n if i % 2 == 0:\n a -= d\n else:\n c -= b\nelse:\n if a > c:\n print("Yes")\n else:\n print("No")\n', 'a, b, c, d = list(map(int, input().split()))\ni = 1\nwhile a>0 and c>0:\n if i % 2 == 0:\n a -= d\n else:\n c -= b\n i += 1\nelse:\n if a > c:\n print("Yes")\n else:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s343998053', 's645476567', 's230559690'] | [9168.0, 9168.0, 9172.0] | [21.0, 22.0, 22.0] | [203, 200, 211] |
p02700 | u038408819 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["a, b, c, d = map(int, input().split())\nimport math\nao = math.ceil(a / d)\ntaka = math.ceil(c / b)\n\nif taka == ao:\n print('YES')\nelse:\n if taka > ao:\n print('NO')\n else:\n print('YES')", "a, b, c, d = map(int, input().split())\nimport math\nao = math.ceil(a / d)\ntaka = math.ceil(c / b)\n\nif taka == ao:\n print('Yes')\nelse:\n if taka > ao:\n print('No')\n else:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s119071351', 's167105401'] | [9180.0, 9176.0] | [23.0, 24.0] | [220, 220] |
p02700 | u039065404 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["a,b,c,d=map(int, input().split())\nwhile a>0 or c>0:\n c=c-b\n if c<=0:\n break\n a=a-d\nif c<=0:\n print('Yes')\nelse:\n print('No')", "a,b,c,d=map(int, input().split())\nwhile a>0 and c>0:\n c=c-b\n if c<=0:\n break\n a=a-d\nif c<=0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s621253737', 's830084889'] | [9172.0, 9160.0] | [20.0, 21.0] | [132, 133] |
p02700 | u045939752 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["A, B, C, D = map(int,input().split())\n\nwhile True:\n C -= B\n if C <= 0:\n ans = 'Yes'\n break\n A -= D\n if C <= 0:\n ans = 'No'\n break\nprint(ans)", "A, B, C, D = map(int,input().split())\n\nwhile True:\n C -= B\n if C <= 0:\n ans = 'Yes'\n break\n A -= D\n if A <= 0:\n ans = 'No'\n break\nprint(ans)\n"] | ['Wrong Answer', 'Accepted'] | ['s632310999', 's448467619'] | [9168.0, 9164.0] | [20.0, 21.0] | [156, 157] |
p02700 | u046247133 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['def Next(): return input()\ndef NextInt(): return int(Next())\ndef NextInts(): return map(int,input().split())\ndef Nexts(): return map(str,input().split())\ndef NextIntList(): return list(map(int,input().split()))\ndef RowInts(n): return [input() for i in range(n)]\n\na,b,c,d= NextInts() \n\nwhile((a>0) or (c>0)):\n\tc-=b\n\tif c<=0:\n\t\tbreak\n\ta-=d\nif a<c:\n\tprint("No")\nelse:\n\tprint("Yes")', 'def Next(): return input()\ndef NextInt(): return int(Next())\ndef NextInts(): return map(int,input().split())\ndef Nexts(): return map(str,input().split())\ndef NextIntList(): return list(map(int,input().split()))\ndef RowInts(n): return [input() for i in range(n)]\n\na,b,c,d= NextInts() \n\nwhile((a>0) and (c>0)):\n\tc-=b\n\tif c<=0:\n\t\tbreak\n\ta-=d\nif a<c:\n\tprint("No")\nelse:\n\tprint("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s501597316', 's455593039'] | [9176.0, 9096.0] | [21.0, 22.0] | [406, 407] |
p02700 | u047485390 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['a, b, c, d = [int(tmp) for tmp in input().split()]\nwhile(a > 0 and c > 0 ) :\n c -= b\n if(c < 0 ) :\n print("Yes")\n break\n else :\n a-=d\n if(a<0) :\n print("No")', 'a, b, c, d = [int(tmp) for tmp in input().split()]\nwhile(a > 0 and c > 0 ) :\n c -= b\n if(c <= 0 ) :\n print("Yes")\n break\n else :\n a-=d\n if(a<=0) :\n print("No")\n break'] | ['Wrong Answer', 'Accepted'] | ['s609685029', 's440234200'] | [9176.0, 9176.0] | [22.0, 23.0] | [177, 191] |
p02700 | u047719604 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['a,b,c,d = map(int,input().split())\nwhile True:\n a -= d\n c -= b\n if a <= 0:\n print("Yes")\n break\n if c <= 0:\n print("No")\n break\n\n', 'a,b,c,d = map(int,input().split())\nwhile True:\n \n c -= b \n if c <= 0:\n print("Yes")\n break\n a -= d\n if a <= 0:\n print("No")\n break\n\n'] | ['Wrong Answer', 'Accepted'] | ['s768753177', 's854679832'] | [9096.0, 9076.0] | [20.0, 23.0] | [145, 149] |
p02700 | u048872153 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['a,b,c,d = map(int,input().split())\n\nwhile b<1 or d<1:\n a -= d\n c -= b\n \nif a<1:\n print("No")\nelse:\n print("Yes")', 'a,b,c,d = map(int,input().split())\n\n\n \nwhile a>0 or c>0:\n c = c - b\n print(c)\n if c<1:\n \n break\n \n a = a - d\n print(a)\n if a < 1:\n\n break\n \n print(a,c)\n\n \nprint(a,c)\n\nif a<0 or a==0:\n print("No")\nelse:\n print("Yes")\n ', 'a,b,c,d = map(int,input().split())\n \nwhile b<1 or d<1:\n a = a - d\n if a<1:\n break\n c = c - b\n \tif c < 1:\n break\n \nif a<0 or a==0:\n print("No")\nelse:\n print("Yes")', 'a,b,c,d = map(int,input().split())\n \nwhile b<1 or d<1:\n a = a - d\n c = c - b\n \nif a<0 or a==0:\n print("No")\nelse:\n print("Yes")', 'a,b,c,d = map(int,input().split())\n \nwhile b<1 or d<1:\n a -= d\n c -= b\n \nif a<0 or a==0:\n print("No")\nelse:\n print("Yes")', 'a,b,c,d = map(int,input().split())\n \nwhile b<1 or d<1:\n a = a - d\n if a<1:\n break\n c = c - b\n if c < 1:\n break\n \nif a<0 or a==0:\n print("No")\nelse:\n print("Yes")', 'a,b,c,d = map(int,input().split())\n\n\n \nwhile a>0 or c>0:\n c = c - b\n \n if c<1:\n \n break\n \n a = a - d\n \n if a < 1:\n\n break\n \n \n\n \n\n\nif a<0 or a==0:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s112137002', 's241551974', 's420411933', 's585876111', 's786701080', 's807960998', 's102956284'] | [9080.0, 9164.0, 8904.0, 8992.0, 9000.0, 9176.0, 9108.0] | [19.0, 20.0, 20.0, 21.0, 22.0, 20.0, 20.0] | [117, 268, 180, 132, 126, 178, 229] |
p02700 | u049483705 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["i = list(map(int, input().split()))\n\nwhile (i[0] > 0 or i[2] > 0):\n\ti[2] = i[2] - i[1]\n\tprint(i[2])\n\tif (i[2] <= 0):\n\t\tprint('Yes')\n\t\tbreak\n\ti[0] = i[0] - i[3]\n\tif (i[0] <= 0):\n\t\tprint('No')\n\t\tbreak\n\t", "i = list(map(int, input().split()))\n\nwhile (i[0] > 0 or i[2] > 0):\n\ti[2] = i[2] - i[1]\n\tif (i[2] <= 0):\n\t\tprint('Yes')\n\t\tbreak\n\ti[0] = i[0] - i[3]\n\tif (i[0] <= 0):\n\t\tprint('No')\n\t\tbreak\n\t"] | ['Wrong Answer', 'Accepted'] | ['s585435176', 's090920597'] | [9188.0, 9164.0] | [22.0, 20.0] | [200, 187] |
p02700 | u050641473 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ['A, B, C, D = map(int, input().split())\n\ntakahashi = 0\naoki = 0\n\nwhile A > 0:\n A = A - D\n takahashi += 1\n\nwhile C > 0:\n C = C - B\n aoki += 1\n\nprint(takahashi)\nprint(aoki)\n\nif aoki <= takahashi:\n print("Yes")\nelse:\n print("No")', 'A, B, C, D = map(int, input().split())\n\ntakahashi = 0\naoki = 0\n\nwhile A > 0:\n A = A - D\n takahashi += 1\n\nwhile C > 0:\n C = C - B\n aoki += 1\n\n# print(takahashi)\n# print(aoki)\n\nif aoki <= takahashi:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s610173871', 's975865704'] | [9192.0, 9120.0] | [22.0, 24.0] | [231, 235] |
p02700 | u051613269 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["A,B,C,D = list(map(int,input().split()))\na=0\nc=0\nwhile A > 0:\n A -= D\n a += 1\nwhile C > 0:\n C -= B\n c += 1\nif a < c:\n print('No')\nelif a >= c:\n print('Yes')\nprint(A,C,a,c)", "A,B,C,D = list(map(int,input().split()))\nwhile A > 0 or B > 0:\n A -= D\n C -= B\nif A <= 0:\n print('No')\nelif B <= 0:\n print('Yes')\n \n ", "A,B,C,D = list(map(int,input().split()))\na=0\nc=0\nwhile A > 0:\n A -= D\n a += 1\nwhile C > 0:\n C -=B\n c += 1\nif a > c:\n print('No')\nelif a <= c:\n print('Yes')\n\n ", "A,B,C,D = list(map(int,input().split()))\na=0\nc=0\nwhile A > 0:\n A -= D\n a += 1\nwhile C > 0:\n C -= B\n c += 1\nif a < c:\n print('No')\nelif a >= c:\n print('Yes')\n"] | ['Wrong Answer', 'Time Limit Exceeded', 'Wrong Answer', 'Accepted'] | ['s364049346', 's832210202', 's863752285', 's177112986'] | [9136.0, 8988.0, 9068.0, 9144.0] | [20.0, 2205.0, 23.0, 20.0] | [224, 145, 165, 210] |
p02700 | u052838115 | 2,000 | 1,048,576 | Takahashi and Aoki will have a battle using their monsters. The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively. The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ... Here, an attack decreases the opponent's health by the value equal to the attacker's strength. The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins. If Takahashi will win, print `Yes`; if he will lose, print `No`. | ["A,B,C,D=map(int,input().split())\ncount1=0\ncount2=0\nfor i in range(A<=0):\n A=A-D*i\n count1+=1\nfor i in range(C<=0):\n C=C-B*i\n count2+=1\nif count1<=count2:\n print('Yes')\nelse:\n print('No')", "A,B,C,D=map(int,input().split())\nt=0\na=0\nfor i in range(A<=0):\n A-=D*i\n t+=1\nfor n in range(C<=0):\n C-=B*n\n a+=1\nif t<=a:\n print('Yes')\nelse:\n print('No')", "A,B,C,D=map(int,input().split())\ncount1=0\ncount2=0\nfor i in range(A<=0):\n A=A-D*i\n count1+=1\nfor n in range(C<=0):\n C=C-B*n\n count2+=1\nif count1<=count2:\n print('Yes')\nelse:\n print('No')", "A,B,C,D=map(int,input().split())\nt=0\na=0\nwhile A>0:\n A-=D\n t+=1\nwhile C>0:\n C-=B\n a+=1\nif t>=a:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s343886221', 's879558623', 's982652553', 's447471203'] | [9104.0, 9128.0, 9196.0, 9128.0] | [26.0, 26.0, 29.0, 30.0] | [204, 172, 204, 146] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.