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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02700 | u906195369 | 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())\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(reversed=True)\n attacker = attacker^1\n\nif 0 in attackers[0]:\n print('No')\nelse:\n print('Yes')", "a, b, c, d = map(int, input().split())\ntakahashi = [a, b]\naoki = [c, d]\nattackers = [takahashi, aoki]\nattacker = 0\n\nwhile attackers[0][0]!=0 and attackers[1][0]!=0:\n attackers[attacker^1][0] = max(0, attackers[attacker^1][0]-attackers[attacker][1])\n attacker = attacker^1\n\nif attackers[0][0]==0:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s506214759', 's481394587'] | [9184.0, 9212.0] | [22.0, 22.0] | [408, 332] |
p02700 | u912045252 | 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`. | ['th,ts,ah,ae=map(int,input().split())\nwhile(th>0 && ah>0):\n ah=ah-ts\n if(ah<=0):\n break\n else:\n th=th-ae\nif(th>0):\n print("Yes")\nelse:\n print("No")', 'th,ts,ah,ae=map(int,input().split())\nwhile(th>0 and ah>0):\n ah=ah-ts\n if(ah<=0):\n break\n else:\n th=th-ae\nif(th>0):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s681335885', 's581248318'] | [9012.0, 9176.0] | [19.0, 22.0] | [157, 158] |
p02700 | u912650255 | 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())\n\nif math.ceil(C/B) >= math.ceil(D/A):\n print('Yes')\nelse:\n print('No')", "A,B,C,D = map(int,input().split())\n\nif C//B >= D//B:\n print('Yes')\nelse:\n print('No')", "import math\nA,B,C,D = map(int,input().split())\n\nif math.ceil(A/D) >= math.ceil(C/B):\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s501808048', 's790026390', 's864480679'] | [9160.0, 9168.0, 9072.0] | [23.0, 22.0, 22.0] | [123, 91, 123] |
p02700 | u912867658 | 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_at,a_hp,a_at=input().split()\nwhile(int(t_hp) > 0 and int(a_hp) > 0):\n int(a_hp) -= int(t_at)\n if int(a_hp) <= 0:\n print("Yes")\n break\n int(t_hp) -= int(a_at)\n if int(t_hp <= 0:\n print("No")\n break', 't_hp,t_at,a_hp,a_at=map(int,input().split())\nwhile(t_hp > 0 and a_hp > 0):\n a_hp -= t_at\n if a_hp <= 0:\n print("Yes")\n break\n t_hp -= a_at\n if t_hp <= 0:\n print("No")\n break'] | ['Runtime Error', 'Accepted'] | ['s075093231', 's979957226'] | [8972.0, 9164.0] | [19.0, 20.0] | [229, 199] |
p02700 | u914948583 | 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\ntaka = a // d\nao = c // b\n\nprint("Yes") if ao >= taka else print("No")', 'a, b, c, d = map(int, input().split())\n\nwhile True:\n c -= b\n a -= d\n if c <= 0:\n print("Yes")\n break\n if a <= 0:\n print("No")\n break'] | ['Wrong Answer', 'Accepted'] | ['s657478606', 's212645080'] | [9168.0, 9164.0] | [23.0, 20.0] | [110, 172] |
p02700 | u916242112 | 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\nwhile 1:\n\tC -= B\n\tif C<=0\n\t\tprint("Yes")\n\t\tbreak\n\tA -= D \n\tif A<=0\n\t\tprint("No")\n\t\tbreak', 'A,B,C,D = list(map(int,input().split()))\n\nwhile 1:\n\tC -= B\n\tif C<=0:\n\t\tprint("Yes")\n\t\tbreak\n\tA -= D \n\tif A<=0:\n\t\tprint("No")\n\t\tbreak'] | ['Runtime Error', 'Accepted'] | ['s576370912', 's395919961'] | [8952.0, 9164.0] | [21.0, 24.0] | [130, 132] |
p02700 | u917558625 | 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`. | ["s=list(map(int,input().split()))\na=s[0]\nb=s[2]\nc=0\nfor i in range():\n if a<=0 or b<=0:\n break\n if c==0:\n b=b-s[1]\n c=1\n else:\n a=a-s[3]\nif a<=0:\n print('No')\nelse:\n print('Yes')", "s=list(map(int,input().split()))\na=s[0]\nb=s[2]\nfor i in range(200):\n if a<=0:\n break\n if b<=0:\n break\n b=b-s[1]\n a=a-s[3]\nif a<=0:\n if b<=0:\n print('Yes')\n else:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s531784490', 's065826000'] | [9184.0, 9208.0] | [22.0, 19.0] | [194, 213] |
p02700 | u918373199 | 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 C = C - B\n\n if C <= 0:\n print("YES")\n exit()\n A = A - D\n\n if A <= 0:\n print("NO")\n exit()', 'A,B,C,D = map(int, input().split())\nwhile True:\n\n A = A - D\n \n if A <= 0:\n print("NO")\n exit()\n C = C - B\n \n if C <= 0:\n print("YES")\n exit()', 'A,B,C,D = map(int, input().split())\nwhile True:\n C = C - B\n\n if C <= 0:\n print("Yes")\n exit()\n A = A - D\n\n if A <= 0:\n print("No")\n exit()'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s211156453', 's286269790', 's438127322'] | [9108.0, 9060.0, 9096.0] | [26.0, 26.0, 27.0] | [178, 185, 178] |
p02700 | u921632705 | 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\nprint("yes" if math.ceil(a/d) >= math.ceil(c/b) else "no")', 'a,b,c,d = map(int,input().split())\nimport math\nprint("Yes" if math.ceil(a/d) >= math.ceil(c/b) else "No")'] | ['Wrong Answer', 'Accepted'] | ['s361319197', 's744089245'] | [8844.0, 8988.0] | [27.0, 32.0] | [105, 105] |
p02700 | u924182136 | 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 and C >= 0:\n C -= B\n if C <= 0:\n break\n A -= D\n\nif A <= 0:\n print('No')\nif C <= 0:\n print('Yes')\n# else:\n# print(A,C)", "A,B,C,D = map(int,input().split())\n\nwhile A > 0 and C > 0:\n C -= B\n if C <= 0:\n break\n A -= D\n \n\nif A <= 0:\n print('No')\nif C <= 0:\n print('Yes')\n# else:\n# print(A,C)"] | ['Wrong Answer', 'Accepted'] | ['s639573857', 's412041670'] | [9164.0, 9124.0] | [24.0, 21.0] | [188, 191] |
p02700 | u924717835 | 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\nif A%C == 0:\n turn = A/D\nelse:\n turn = (A//D) +1\nif B * (turn+1) > C:\n print("Yes")\nelse:\n print("No")', 'A ,B ,C ,D = map(int,input().split())\nturn = 0\nif A%D == 0 :\n turn = A/D -1\nelse:\n turn = A//D\nif B * (turn+1) >= C:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s403981501', 's917278701'] | [9200.0, 9160.0] | [22.0, 23.0] | [161, 162] |
p02700 | u925353288 | 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\nm = A // D \nn = C // B \n\nif m >= n:\n print('Yes')\nelse:\n print('No')\n", "A, B, C, D = map(int, input().split())\n\nm = A//D\nn = B//C\n\nif m>n :\n print('Yes')\nelse:\n print('No')", "\nA, B, C, D = map(int, input().split())\n\nm = C // B \nif C % B != 0:\n m = m + 1\n\nn = A // D \nif A % D != 0:\n n = n + 1\n\nif n >= m:\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s792952923', 's798466834', 's561381372'] | [9156.0, 9140.0, 9100.0] | [25.0, 28.0, 28.0] | [183, 106, 247] |
p02700 | u925658709 | 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`. | ["P = list(map(int,input().split()))\nA = P[0]\nB = P[1]\nC = P[2]\nD = P[3]\n\ni = 0\nj = 0\nwhile C <= 0:\n C-=B\n i +=1\n \nwhile A <= 0: \n A-=D\n j+=1\nif i > j:\n print('No')\nelse:\n print('Yes')\n ", "import math\nP = list(map(int,input().split()))\nA = P[0]\nB = P[1]\nC = P[2]\nD = P[3]\n\np = math.ceil(C/B)\nq = math.ceil(A/D)\n \n\nif p <= q:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s313745207', 's002084149'] | [9128.0, 9176.0] | [25.0, 23.0] | [212, 178] |
p02700 | u926046014 | 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 or c<=0:\n a -= d\n c -= b\n\nif a<=0 and c<=0:\n print("Yes")\n\nelif a<=0:\n print("No")\n\nelse:\n print("Yes")', 'a, b, c, d = map(int, input().split())\n\nwhile a>0 and c>0:\n a -= d\n c -= b\n\nif a<=0 and c<=0:\n print("Yes")\n\nelif a<=0:\n print("No")\n\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s105772081', 's914682009'] | [9176.0, 9184.0] | [25.0, 26.0] | [169, 168] |
p02700 | u927357863 | 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`. | ['# -*- coding: utf-8 -*-\nA, B, C, D = map(int, input().split())\nlifeT = A\nlifeA = C\nbattle_num = 0\n\nwhile lifeA > 0 or lifeT > 0:\n battle_num = battle_num + 1\n if battle_num % 2 != 0:\n lifeA = lifeA - B\n else:\n lifeT = lifeT - D\n\n if lifeA == 0 or lifeT == 0:\n break\n\nelse:\n if battle_num % 2 != 0:\n print("Yes")\n else:\n print("No")\n', '# -*- coding: utf-8 -*-\nA, B, C, D = map(int, input().split())\nlifeT = A\nlifeA = C\n\nfor battle_num in range(1, 100):\n if battle_num % 2 != 0:\n lifeA = lifeA - B\n else:\n lifeT = lifeT - D\n\n if lifeA <= 0 or lifeT <= 0:\n break\n\nif battle_num % 2 != 0:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s792187181', 's867407252'] | [9180.0, 9164.0] | [23.0, 21.0] | [385, 319] |
p02700 | u929217794 | 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`. | ['# B Battle\n\nimport math\n\nA, B, C, D = map(int, input().split())\n\nt_kill_a = math.ceil(C / B)\na_kill_t = math.ceil(A / D)\n\nif t_kill_a >= a_kill_t:\n print("Yes")\nelse:\n print("No")', '# B Battle\n\nA, B, C, D = map(int, input().split())\n\nt_kill_a = C // B\na_kill_t = A // D\n\nif C % B != 0:\n t_kill_a += 1\nif A % D != 0:\n a_kill_t += 1\n\nif t_kill_a <= a_kill_t:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s290583119', 's836884236'] | [8980.0, 8984.0] | [24.0, 27.0] | [181, 211] |
p02700 | u930574673 | 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()]\ns = C // B\nt = A // D\nif s <= t:\n print("Yes")\nelse:\n print("No")', 'A, B, C, D = [int(x) for x in input().split()]\ns = C // B\nif C % B != 0:\n s += 1\nt = A // D\nif A % D != 0:\n t += 1\nif s <= t:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s005569011', 's599439020'] | [9164.0, 9176.0] | [21.0, 21.0] | [114, 162] |
p02700 | u932370518 | 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`. | ['\nif __name__ == "__main__":\n A, B, C, D = map(int, input().split())\n ret = "No"\n while A > 0 and C > 0:\n A = A - D\n print(A)\n C = C - B\n print(C)\n if C <= 0:\n ret = "Yes"\n print(ret)', 'if __name__ == "__main__":\n A, B, C, D = map(int, input().split())\n ret = "No"\n while A > 0 and C > 0:\n A = A - D\n C = C - B\n if C <= 0:\n ret = "Yes"\n print(ret)\n'] | ['Wrong Answer', 'Accepted'] | ['s931425042', 's042025372'] | [9168.0, 9156.0] | [24.0, 23.0] | [232, 198] |
p02700 | u932868243 | 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())\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')", "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-bn<=0:\n print('Yes')\nelse:\n print('No')", "a,b,c,d=map(int,input().split())\nn=1\nwhile c-n*b>0 and a-n*d>0:\n n+=1\nprint('Yes' if c-n*b<=0 else 'No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s117149321', 's982563514', 's344272734'] | [8888.0, 8988.0, 9164.0] | [20.0, 21.0, 24.0] | [135, 123, 105] |
p02700 | u935089856 | 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 = 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 TA = TA - AA\n if TL <= 0:\n a = 2\n break\nif a == 1:\n print("Yes")\nelif a == 2:\n print("No")\n', '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 brake\n TA = TA - AA\n if TA <= 0:\n a = 2\n brake\nif a = 1:\n print("Yes")\nif a = 2:\n print("No")', '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'] | ['Time Limit Exceeded', 'Runtime Error', 'Accepted'] | ['s308028701', 's427792579', 's939674714'] | [9104.0, 8968.0, 9172.0] | [2205.0, 24.0, 20.0] | [255, 249, 255] |
p02700 | u936885469 | 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())\nac = int(a / d + 1)\nbc = int(c / b + 1)\n \nif ac >= bc:\n print('Yes')\nelse:\n print('No')", "a, b, c, d = map(int, input().split())\nac = int(a / d + 1)\nbc = int(c / b + 1)\n\nprint(ac, bc)\nif ac >= bc:\n print('Yes')\nelse:\n print('No')\n", "a, b, c, d = map(int, input().split())\nac = int(a / d + 1)\nbc = int(c / b + 1)\n\nif ac <= bc:\n print('Yes')\nelse:\n print('No')\n", "a, b, c, d = map(int, input().split())\nac = int(a / d)\nbc = int(c / b)\n\nif a % d != 0:\n ac += 1\nif c % b != 0:\n bc += 1\n\nif ac >= bc:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s270363109', 's375104577', 's440394690', 's618827275'] | [9164.0, 9160.0, 9100.0, 9180.0] | [20.0, 20.0, 20.0, 24.0] | [132, 146, 132, 178] |
p02700 | u939585142 | 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\nfor i in range(100):\n C -= B\n if C <= 0:\n print('Yes')\n exit()\n A -= D\n if A <= 0:\n print('No')", "A, B, C, D = map(int, input().split())\n\nfor i in range(100):\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'] | ['s183437788', 's733911121'] | [9172.0, 9192.0] | [23.0, 26.0] | [148, 159] |
p02700 | u939847032 | 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 main():\n A, B, C, D = map(int, input().split(' '))\n if C - B * (int(A / D) + 1) <= 0:\n print('Yes')\n else:\n print('No')\nmain()", "def main():\n A, B, C, D = map(int, input().split(' '))\n while B > 0:\n C -= B\n if C <= 0:\n print('Yes')\n break\n A -= D\n if A <= 0:\n print('No')\n break\nmain()"] | ['Wrong Answer', 'Accepted'] | ['s777143544', 's856590799'] | [9088.0, 8988.0] | [27.0, 27.0] | [153, 234] |
p02700 | u940592576 | 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())\ntak=c/b\nai=a/d\nif tak>=ai:\n print("Yes")\nelse:\n print("No")\n', 'a,b,c,d=map(int,input().split())\nif c%b==0:\n tak = c/b\nelif c/b<1:\n tak = 1\nelse:\n tak = c//b +1\nif a%d ==0:\n ai = a/d\nelif a/d<1:\n ai = 1\nelse:\n ai=a//d +1\nif tak<=ai:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s434305511', 's234398897'] | [9012.0, 9180.0] | [21.0, 22.0] | [95, 210] |
p02700 | u941438707 | 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("Yes" if c//b<=a//d else "No")', 'a,b,c,d=map(int,input().split())\nprint("Yes" if c//b+c%b>0<=a//d+a%d>0 else "No")', 'a,b,c,d=map(int,input().split())\nprint("Yes" if -c//b>=-a//d else "No")a,b,c,d=map(int,input().split())\nprint("Yes" if -c//b>=-a//d else "No")', 'a,b,c,d=map(int,input().split())\nprint("Yes" if (c//b+c%b>0)<=(a//d+a%d>0) else "No")', 'a,b,c,d=map(int,input().split())\nprint("Yes" if c/b<=a/d+1 else "No")', 'a,b,c,d=map(int,input().split())\nprint("Yes" if c//b<=a//d+1 else "No")', 'a,b,c,d=map(int,input().split())\nfor _ in range(100):\n a,c-=d,b\n if b<1:\n print("Yes")\n exit()\n if a<1:\n print("No")\n exit()', 'a,b,c,d=map(int,input().split())\nprint("Yes" if -c//b>=-a//d else "No")'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s077862943', 's090898044', 's100825797', 's209597818', 's498021821', 's502851042', 's758059993', 's028306347'] | [9156.0, 9172.0, 8888.0, 9160.0, 9144.0, 9168.0, 9020.0, 9156.0] | [22.0, 20.0, 21.0, 20.0, 20.0, 20.0, 20.0, 19.0] | [69, 81, 142, 85, 69, 71, 161, 71] |
p02700 | u942356554 | 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 b<=0:\n a=a-d\n c=c-b\nif a<=0:\n print("No")\nelse:\n print("Yes")', 'a,b,c,d=map(int,input().split())\ns=0\nwhile (a>0 and c>0) or s==1:\n c=c-b\n if c<=0:\n s+=1\n else:\n a=a-d\nif a<=0:\n print("No")\nelif c<=0:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s241306949', 's273648933'] | [9164.0, 9160.0] | [22.0, 21.0] | [120, 178] |
p02700 | u944886577 | 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`. | ['tt,ta,at,aa=map(int,input().split())\n \nfor i in range(100):\n if at-ta>0:\n at-=ta\n elif at-ta<=0:\n print("Yes")\n elif tt-aa>0:\n tt=-aa\n elif tt-aa<=0:\n print("No")', 'tt,ta,at,aa=map(int,input().split())\n \nfor i in range(100):\n at-=ta \n if at-ta>0:\n pass\n elif at-ta<=0:\n print("Yes")\n exit()\n tt-=aa\n if tt-aa>0:\n pass\n elif tt-aa<=0:\n print("No")\n exit()', 'tt,ta,at,aa=map(int,input().split())\n \nfor i in range(100):\n at-=ta \n if at-ta>0:\n pass\n elif at-ta<=0:\n print("Yes")\n exit\n tt-=aa\n elif tt-aa>0:\n pass\n elif tt-aa<=0:\n print("No")', 'ta,tt,aa,at=map(int,input().split())\n \nfor i in range(100):\n if at-tt>0:\n at-=tt\n elif at-tt=<0:\n print("Yes")\n elif tt-aa>0:\n tt=-aa\n elif tt-aa=<0:\n print("No")', 'tt,ta,at,aa=map(int,input().split())\n \nfor i in range(100):\n at-=ta \n if at-ta>0:\n pass\n elif at-ta<=0:\n print("Yes")\n exit()\n tt-=aa\n elif tt-aa>0:\n pass\n elif tt-aa<=0:\n print("No")\n exit()', 'ta,tt,aa,at=map(int,input().split())\n\nwhile True:\n if at-tt>0:\n at-=tt\n elif at-tt<0:\n print("Yes")\n elif tt-aa>0:\n tt=-aa\n elif tt-aa<0:\n print("No")', 'ta,tt,aa,at=map(int,input().split())\n \nfor i in range(100):\n if at-tt>0:\n at-=tt\n elif at-tt<=0:\n print("Yes")\n elif tt-aa>0:\n tt=-aa\n elif tt-aa<=0:\n print("No")', 'ta,tt,aa,at=map(int,input().split())\n \nfor i in range(100):\n if at-tt>0:\n at-=tt\n elif at-tt<=0:\n print("Yes")\n elif tt-aa>0:\n tt-=aa\n elif tt-aa<=0:\n print("No")', 'tt,ta,at,aa=map(int,input().split())\n \nfor i in range(100):\n at-=ta \n if at>0:\n pass\n elif at<=0:\n print("Yes")\n exit()\n tt-=aa\n if tt>0:\n pass\n elif tt<=0:\n print("No")\n exit()'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Time Limit Exceeded', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s091379266', 's135880321', 's481763321', 's488399869', 's657020954', 's764383906', 's936267724', 's944555141', 's833066672'] | [9124.0, 9112.0, 8976.0, 8876.0, 8940.0, 33772.0, 9092.0, 9148.0, 9128.0] | [27.0, 29.0, 24.0, 21.0, 27.0, 2254.0, 32.0, 28.0, 26.0] | [175, 207, 196, 175, 209, 163, 175, 175, 195] |
p02700 | u947047288 | 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 break\n A -=D\n if A<= 0:\n print ("no")\n break', 'import sys\nsys.setrecursionlimit(10**6)\nA, B, C, D = map(int, input().split())\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', 'import sys\nsys.setrecursionlimit(10**6)\nA, B, C, D = map(int, input().split())\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'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s124947105', 's281070658', 's620461741'] | [9104.0, 9172.0, 9172.0] | [24.0, 21.0, 22.0] | [173, 212, 213] |
p02700 | u951582245 | 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 (C//B) + 1> (A//D)+1:\n print('No')\nelse:\n print('Yes')", "import math\nA, B, C, D = map(int, input().split())\nif math.ceil(C/B) > math.ceil(A/D):\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s602865948', 's395712570'] | [9104.0, 9156.0] | [20.0, 23.0] | [98, 121] |
p02700 | u953020348 | 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_s,B_s,C_s,D_s=input().split()\nA=int(A_s)\nB=int(B_s)\nC=int(C_s)\nD=int(D_s)\n\nansA=C/B\nansC=A/D\n\nif C%B!=0:\n ansA=ansA+1\nif A%D!=0:\n ansC=ansC+1\n\nif ansA>=ansC:\n print("Yes")\nelse:\n print("No")', 'A_s,B_s,C_s,D_s=input().split()\nA=int(A_s)\nB=int(B_s)\nC=int(C_s)\nD=int(D_s)\n\nansA=int(C/B)\nansC=int(A/D)\n\nif C%B!=0:\n ansA=ansA+1\nif A%D!=0:\n ansC=ansC+1\n \nif ansA<=ansC:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s689665944', 's771842434'] | [9188.0, 9164.0] | [20.0, 20.0] | [204, 218] |
p02700 | u955135274 | 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 a -= d\n if a <= 0:\n print("Yes")\n break\n else:\n c -= b\n if c <= 0:\n print("No")\n break\n\n\n', 'a, b, c, d = map(int, input().split())\n\nwhile True:\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\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s710952256', 's035762700'] | [9160.0, 9160.0] | [22.0, 22.0] | [201, 201] |
p02700 | u957872856 | 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())\ncnt = 0\nwhile a < 0 or c < 0:\n if cnt%2==0:\n c -= a\n else:\n b -= d\n cnt += 1\nif a < 0:\n print("No")\nelse:\n print("Yes")', 'a, b, c, d = map(int,input().split())\ncnt = 0\nwhile a > 0 and c > 0:\n if cnt%2==0:\n c -= b\n else:\n a -= d\n cnt += 1\nif a < 0:\n print("No")\nelse:\n print("Yes")\n', 'a, b, c, d = map(int,input().split())\ncnt = 0\nwhile a > 0 and c > 0:\n if cnt%2==0:\n c -= b\n else:\n a -= d\n cnt += 1\nif a <= 0:\n print("No")\nelse:\n print("Yes")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s263740791', 's677879902', 's786537027'] | [9036.0, 9068.0, 9160.0] | [21.0, 21.0, 22.0] | [168, 170, 171] |
p02700 | u957957759 | 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>c/b:\n print('Yes')\nelif a/d+1=c/b:\n if c%d==0:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')", "a,b,c,d=map(int,input().split())\n\nif a/d>c/b:\n print('Yes')\nelif a/d==c/b:\n\tif c/b>0 and a/d==0\n\t\tprint('No')\n\telse:\n \tprint('Yes')\nelif a/d+1==c/b:\n if c%b==0 and a%d!=0:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')", "a,b,c,d=map(int,input().split())\nif a/d>c/b:\n print('Yes')\nelif a/d==c/b:\n if c/b>0 and a/d==0\n print('No')\n else:\n print('Yes')\nelif a/d+1==c/b:\n if c%b==0 and a%d!=0:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')", ",b,c,d=map(int,input().split())\nif a/d>c/b:\n print('Yes')\nelif a/d==c/b:\n\tif c/b>0 and a/d==0\n\t\tprint('No')\n\telse:\n \tprint('Yes')\nelif a/d+1==c/b:\n if c%b==0 and a%d!=0:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')", "a,b,c,d=map(int,input().split())\nx=a//d\ny=c//b\nif y<x:\n print('Yes')\nelif y==x:\n if c%b==0:\n print('Yes')\n else:\n if a%d==0:\n print('No')\n else:\n print('Yes')\n \nelif y==x+1:\n if c%b==0:\n print('Yes')\n else:\n print('No')\n \nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s205055331', 's411566110', 's420506173', 's663768338', 's871167537'] | [9024.0, 8900.0, 9028.0, 8900.0, 9096.0] | [21.0, 22.0, 22.0, 21.0, 26.0] | [165, 253, 253, 251, 337] |
p02700 | u960570220 | 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 or C > 0:\n aoki_hitpoint = C - B\n if aoki_hitpoint <= 0:\n print("Yes")\n else:\n C = aoki_hitpoint\n\n takahashi_hitpoint = A - D\n if takahashi_hitpoint <= 0:\n print("No")\n else:\n A = takahashi_hitpoint', 'A, B, C, D = map(int, input().split())\n\nwhile A or C > 0:\n aoki_hitpoint = C - B\n if aoki_hitpoint <= 0:\n C = 0\n print("Yes")\n exit()\n else:\n C = aoki_hitpoint\n\n takahashi_hitpoint = A - D\n if takahashi_hitpoint <= 0:\n print("No")\n A = 0\n exit()\n else:\n A = takahashi_hitpoint'] | ['Time Limit Exceeded', 'Accepted'] | ['s539669627', 's951935182'] | [30676.0, 9188.0] | [2236.0, 28.0] | [292, 350] |
p02700 | u960611411 | 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`. | ["ABCD = list(map(int, input().split()))\nA = ABCD[0]\nB = ABCD[1]\nC = ABCD[2]\nD = ABCD[3]\nif B%C != 0:\n if D*(B//C) >= A:\n print('No')\n else:\n print('Yes')\nelse:\n if D*(B//C - 1) >= A:\n print('No')\n else:\n print('Yes')", "ABCD = list(map(int, input().split()))\nA = ABCD[0]\nB = ABCD[1]\nC = ABCD[2]\nD = ABCD[3]\nif C%B != 0:\n if D*(C//B) >= A:\n print('No')\n else:\n print('Yes')\nelse:\n if D*(B//C - 1) >= A:\n print('No')\n else:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s594904161', 's090215392'] | [9124.0, 9188.0] | [22.0, 19.0] | [255, 255] |
p02700 | u962330718 | 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 round_up(x):\n if x>int(x):\n return int(x)+1\n else:\n return int(x)\na,b,c,d=map(int,input().split())\nm,n=round_up(a/b),round_up(c/d)\nprint('No' if m<n else 'Yes')", "def round_up(x):\n if x>int(x):\n return int(x)+1\n else:\n return int(x)\na,b,c,d=map(int,input().split())\nm,n=round_up(c/b),round_up(a/d)\nprint(m)\nprint(n)\nprint('No' if m>n else 'Yes')", "def round_up(x):\n if x>int(x):\n return int(x)+1\n else:\n return int(x)\na,b,c,d=map(int,input().split())\nm,n=round_up(c/b),round_up(a/d)\n\nprint('No' if m>n else 'Yes')\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s105958549', 's251911126', 's991033159'] | [9040.0, 9188.0, 9108.0] | [25.0, 21.0, 23.0] | [184, 202, 186] |
p02700 | u962423738 | 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 \nwhile True:\n\tc-=b\n if c<=0:\n\t\tprint("Yes")\n\t\tbreak\n a-=d\n\tif a<=0:\n\t\tprint("No")\n\t\tbreak', 'a,b,c,d=list(map(int,input().split()))\n\ntcnt=c//b\nacnt=a//d\n\nif tcnt<=acnt:\n\tprint("Yes")\nelse:\n\tprint("No")', 'a,b,c,d=list(map(int,input().split()))\n \nwhile True:\n\tc-=b\n\tif c<=0:\n\t\tprint("Yes")\n\t\tbreak\n\ta-=d\n\tif a<=0:\n\t\tprint("No")\n\t\tbreak'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s465460123', 's528423162', 's553829748'] | [8928.0, 9124.0, 9076.0] | [20.0, 26.0, 31.0] | [135, 108, 129] |
p02700 | u963747475 | 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 and C !=0:\n C= abs(C-B)\n if C==0:\n print("YES")\n A= abs(A-D)\n if A==0:\n print("NO")', 'A,B,C,D=map(int,input().split())\n \nwhile True:\n C= abs(C-B)\n if C<=0:\n print("YES")\n break\n A= abs(A-D)\n if A<=0:\n print("NO")\n break', 'A,B,C,D=map(int,input().split())\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', 'A,B,C,D=map(int,input().split())\n\nwhile A and C !=0:\n C= abs(C-B)\n if C==0:\n print("YES")\n A= abs(A-D)\n if A==0:\n print("NO")', 'A,B,C,D=map(int,input().split( ))\n\nwhile A and C !=0:\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', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s310443822', 's420760283', 's504274344', 's820845069', 's594198945'] | [9172.0, 9048.0, 9144.0, 9156.0, 9160.0] | [2207.0, 2205.0, 20.0, 2205.0, 22.0] | [152, 173, 161, 151, 169] |
p02700 | u964521959 | 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`. | ['\ntairyoku_A, kougeki_B,tairyoku_C,kougeki_D = map(int, input().split())\n\none = int(tairyoku_A /kougeki_D)\ntwo = int(tairyoku_C /kougeki_B)\n\n\nif(one>two):\n print("Yes")\nelif(one<two):\n print("No")\nelse:\n print("Yes")', '\nA, B,C,D = map(int, input().split())\n\nans_a = A\nans_c = C\ncount_a = 0\ncount_c = 0\nwhile(ans_a<=0):\n ans_a = ans_a - D\n count_a = count_a +1\n\nwhile(ans_c<=0):\n ans_c = ans_a - B\n count_c = count_c +1\n \nif(count_a>=count_c):\n print("Yes")\nelse:\n print("No")', '\ntairyoku_A, kougeki_B,tairyoku_C,kougeki_D = map(int, input().split())\n\none = int(tairyoku_A /kougeki_D)\ntwo = int(tairyoku_C /kougeki_B)\n\n\nif(one>two):\n print("Yes")\nelif:\n print("No")\nelse:\n print("Yes")', '\nA, B,C,D = map(int, input().split())\n\nans_a = A\nans_c = C\ncount_a = 0\ncount_c = 0\n\nwhile(ans_a>0):\n ans_a = ans_a - D\n count_a = count_a +1\n #print(count_a,":",ans_a)\n\nwhile(ans_c>0):\n ans_c = ans_c - B\n count_c = count_c +1\n #print(count_c,":",ans_c)\n \nif(count_a>=count_c):\n print("Yes")\nelse:\n print("No")\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s218618607', 's404028816', 's425185819', 's074382867'] | [9172.0, 9128.0, 8956.0, 9180.0] | [23.0, 21.0, 21.0, 22.0] | [258, 303, 249, 360] |
p02700 | u965581346 | 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 = C - A\n\n if C <= 0:\n print('Yes')\n break\n\n B = B - D\n\n if B <= 0:\n print('No')\n break\n", "A, B, C, D = map(int, input().split())\n\nwhile True:\n C = C - B\n\n if C <= 0:\n print('Yes')\n break\n\n A = A - D\n\n if A <= 0:\n print('No')\n break\n"] | ['Wrong Answer', 'Accepted'] | ['s395049693', 's820658786'] | [9156.0, 9156.0] | [21.0, 24.0] | [182, 182] |
p02700 | u966311314 | 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(\' \')]\n\nwhile True:\n C -= B\n if C <=0:\n print("Yes")\n break\n A-=D\n if A<=:\n print("No")\n break', 'A, B, C, D = [int(n) for n in input().split(\' \')]\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'] | ['Runtime Error', 'Accepted'] | ['s583260789', 's962349483'] | [8964.0, 9184.0] | [21.0, 24.0] | [153, 155] |
p02700 | u966891144 | 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 main():\n a, b, c, d = map(int, input().split())\n\n aoki_hp = a\n takahashi_hp = c\n while aoki_hp > 0 and takahashi_hp > 0:\n aoki_hp -= d\n takahashi_hp -= b\n # print(aoki_hp,takahashi_hp)\n\n if aoki_hp > takahashi_hp:\n print('No')\n elif aoki_hp < takahashi_hp:\n print('Yes')\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n a, b, c, d = map(int, input().split())\n\n takahashi_hp = a\n aoki_hp = c\n while True:\n aoki_hp -= b\n if aoki_hp <= 0:\n print('Yes')\n break\n\n takahashi_hp -= d\n if takahashi_hp <= 0:\n print('No')\n break\n\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s665938614', 's119097371'] | [9168.0, 9168.0] | [22.0, 21.0] | [334, 288] |
p02700 | u970198631 | 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 and C > 0:\n C -= B\n if C <= 0:\n break\n A -= D\n print(A,C)\nif A <= 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 if C <= 0:\n break\n A -= C\nif A <= 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 if C <= 0:\n break\n A -= D\n \nif A <= 0:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s746102725', 's770850038', 's000197346'] | [9100.0, 9000.0, 9116.0] | [28.0, 27.0, 28.0] | [157, 143, 147] |
p02700 | u970809473 | 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())\ni = 0\nwhile a > 0 and c > 0:\n if i % 2 == 0:\n c -= b\n else:\n a -= d\nif a <= 0:\n print('No')\nelse:\n print('Yes')", "a,b,c,d = map(int, input().split())\ni = 0\nwhile a > 0 and c > 0:\n if i % 2 == 0:\n c -= b\n i += 1\n else:\n a -= d\n i += 1\nif a <= 0:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s858745780', 's127137849'] | [9172.0, 9116.0] | [26.0, 23.0] | [157, 179] |
p02700 | u972991614 | 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`. | ["while True:\n C -= B\n A -= D\n if A<=0:\n print('No')\n break\n elif C<=0:\n print('Yes')\n break", "\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"] | ['Runtime Error', 'Accepted'] | ['s377853470', 's083639666'] | [9060.0, 9164.0] | [22.0, 18.0] | [130, 162] |
p02700 | u975719989 | 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 \n c-=b\n if c <= 0:\n print("Yes")\n exit()\n \n a-=d\n if d <= 0:\n print("No")\n exit()\n ', 'a, b, c, d = map(int, input().split())\n\nwhile True:\n \n c-=b\n if c <= 0:\n print("Yes")\n exit()\n \n a-=d\n if d <= 0:\n print("No")\n exit()\n \n', "A,B,C,D=map(int,input().split())\nwhile True:\n C=C-B\n if(C<=0):\n print('Yes')\n exit()\n A=A-D\n if(A<=0):\n print('No')\n exit()\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s393509949', 's896021921', 's423173060'] | [9168.0, 9160.0, 9132.0] | [21.0, 24.0, 21.0] | [157, 158, 164] |
p02700 | u976169012 | 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`. | ['LI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("Yes")\nno = lambda: print("No")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\na,b,c,d = MI()\nyes() if c//b<=a//d else no()', 'LI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("YES")\nno = lambda: print("NO")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\na,b,c,d = MI()\nyes() if d//a<=b//c else no()', 'LI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("Yes")\nno = lambda: print("No")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\na,b,c,d = MI()\nyes() if d//b<=a//c else no()', 'LI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("YES")\nno = lambda: print("NO")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\na,b,c,d = MI()\nif a>c:\n\tyes()\nelif a == c:\n\tif b>d:\n\t\tyes()\n\telse:\n\t\tno()\nelse:\n\tno()', 'LI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("Yes")\nno = lambda: print("No")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\na,b,c,d = MI()\nwhile(a == 0 and c == 0):\n\tc-=b\n\tif c<=0:\n\t\tyes()\n\t\tbreak\n\ta-=d\n\tif a<=0:\n\t\tno()\n\t\tbreak', 'LI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("Yes")\nno = lambda: print("No")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\na,b,c,d = MI()\nwhile(a > 0 and c >0):\n\tc-=b\n\tif c<=0:\n\t\tyes()\n\t\tbreak\n\ta-=d\n\tif a<=0:\n\t\tno()\n\t\tbreak'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s114798922', 's192056929', 's239583936', 's439330610', 's576085915', 's635955042'] | [9136.0, 9152.0, 9192.0, 9192.0, 9200.0, 9180.0] | [21.0, 19.0, 23.0, 24.0, 24.0, 23.0] | [298, 298, 298, 339, 357, 354] |
p02700 | u980205854 | 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`. | ["# B - Battle\nA,B,C,D = map(int,input().split())\nans = ['No', 'Yes']\ntakahashi = (C-1)//B + 1\naoki = (A-1)//D + 1\nprint(ans[takahashi>=aoki])", "# B - Battle\nA,B,C,D = map(int,input().split())\nans = ['No', 'Yes']\ntakahashi = (C-1)//B + 1\naoki = (A-1)//D + 1\nprint(ans[takahashi<=aoki])"] | ['Wrong Answer', 'Accepted'] | ['s173907591', 's378436422'] | [9116.0, 9164.0] | [22.0, 24.0] | [140, 140] |
p02700 | u981332890 | 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 main():\n A, B, C, D = map(int, input().split())\n while True:\n C -= B\n if C <= 0:\n print("No")\n return 0\n A -= D\n if A <= 0:\n print("Yes")\n return 0\n\n return 0\n\nif __name__ == \'__main__\':\n main()', 'def main():\n A, B, C, D = map(int, input().split())\n while True:\n C -= B\n if C <= 0:\n print("Yes")\n return 0\n A -= D\n if A <= 0:\n print("No")\n return 0\n\n return 0\n\nif __name__ == \'__main__\':\n main()'] | ['Wrong Answer', 'Accepted'] | ['s437990033', 's821628536'] | [9148.0, 9176.0] | [22.0, 22.0] | [282, 282] |
p02700 | u984989720 | 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\n\nif (-(-c // b)) <= (-(-a // d):\n print('Yes')\nelse:\n print('No')\n", "a, b, c, d = map(int,input().split())\n\n\nif -(-c // b) >= -(-a // d):\n print('Yes')\nelse:\n print('No')\n", "a, b, c, d = map(int,input().split())\n\n\nif (-(-c // b)) >= (-(-a // d):\n print('Yes')\nelse:\n print('No')\n", "a, b, c, d = map(int,input().split())\n\n\nif -(-c // b) <= -(-a // d):\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s010749455', 's085977708', 's672400886', 's872054209'] | [9040.0, 9176.0, 8960.0, 9100.0] | [24.0, 19.0, 20.0, 21.0] | [111, 108, 111, 108] |
p02700 | u987637902 | 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 - b) <= 0:\n print("Yes")\n exit()\n else:\n c = c - d\n if a - d <= 0:\n print("No")\n exit()\n else:\n a = a - ', 'a, b, c, d = map(int, input().split())\nwhile True:\n if (c - b) <= 0:\n print("Yes")\n exit()\n else:\n c = c - b\n if a - d <= 0:\n print("No")\n exit()\n else:\n a = a - d\n\n'] | ['Runtime Error', 'Accepted'] | ['s191033263', 's535539664'] | [8868.0, 9164.0] | [26.0, 33.0] | [236, 239] |
p02700 | u991619971 | 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#N=int(input())\n#A = list(map(int,input().split()))\n#S=str(input())\nflag=True\nwhile flag==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()\n", "A,B,C,D = map(int,input().split())\n#N=int(input())\n#A = list(map(int,input().split()))\n#S=str(input())\nflag=True\nwhile C>0 and A>0:\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"] | ['Wrong Answer', 'Accepted'] | ['s185693951', 's046578785'] | [9172.0, 9160.0] | [23.0, 22.0] | [244, 248] |
p02700 | u993310962 | 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+1)>(c//b+1):\n print('No')\nelse:\n print('Yes')", "import sys\na,b,c,d=map(int,input().split())\ne=max(a//d+1,c//b+1)\nfor i in range(2*(e+1)):\n if i%2!=0:\n a-=d\n if a<=0:\n print('No')\n sys.exit()\n else:\n c-=b\n if c<=0:\n print('Yes')\n sys.exit()"] | ['Wrong Answer', 'Accepted'] | ['s030429287', 's575868993'] | [9104.0, 9216.0] | [24.0, 23.0] | [93, 269] |
p02700 | u993622994 | 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\ni, j = 0, 0\n\nwhile A > 0:\n A -= D\n i += 1\n\nwhile C > 0:\n C -= B\n j += 1\n\nif i <= j:\n print('Yes')\nelse:\n print('No')", "A, B, C, D = map(int, input().split())\nFlag = 1\n\nwhile A > 0 and C > 0:\n if Flag == 1:\n C -= B\n Flag = 2\n else:\n A -= D\n Flag = 1\n\nif Flag == 2:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s087933406', 's491087614'] | [9048.0, 9072.0] | [24.0, 27.0] | [174, 217] |
p02700 | u994502918 | 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 or c >= 0):\n a -= d\n c -= b\n print(a, c)\n if (a <= 0):\n print('No')\n quit()\n if (c <= 0):\n print('Yes')\n quit()", "a, b, c, d = map(int, input().split())\n\nwhile (a >= 0 or c >= 0):\n a -= d\n c -= b\n if (c <= 0):\n print('Yes')\n quit()\n if (a <= 0):\n print('No')\n quit()"] | ['Wrong Answer', 'Accepted'] | ['s684799569', 's428580041'] | [9184.0, 9180.0] | [22.0, 22.0] | [208, 192] |
p02700 | u997927785 | 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`. | ['\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")', '\nA, B, C, D = map(int, input().split())\n\n\nint takahashi = A\nint aoki = C\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")\n', '\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")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s170963833', 's384829608', 's322025097'] | [9188.0, 8980.0, 9164.0] | [21.0, 23.0, 20.0] | [390, 416, 333] |
p02700 | u999983491 | 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('yes' if A // D < C // B else 'no')", "A, B, C, D = map(int, input().split())\nprint('yes' if A+B > C + D else 'no')", "a, b, c, d = map(int, input().split())\nwhile 1:\n a -= d\n c -= b\n if a <= 0:\n print('no')\n break\n else:\n print('yes')\n break", "A, B, C, D = map(int, input().split())\nprint('yes' if A - D > C - B else 'no')", "a, b, c, d = map(int, input().split())\nwhile a > 0 and c > 0:\n c -= b\n if c <= 0:\n break\n a -= d\nprint('Yes' if c <= 0 else 'No')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s755873168', 's775325768', 's897407399', 's969963462', 's428141003'] | [9104.0, 9156.0, 9040.0, 9144.0, 9152.0] | [22.0, 20.0, 21.0, 23.0, 23.0] | [80, 76, 163, 78, 145] |
p02701 | u010384197 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['#coding UTF-8\nfrom collections import Counter\nn= int(input())\nl=[input()for i in range(n)] \nc=cCounter(l)\n\nprint(len(c))', '#coding UTF-8\nfrom collections import Counter\nn= int(input())\nl=[input()for i in range(n)] \nc=Counter(l)\n\nprint(len(c))'] | ['Runtime Error', 'Accepted'] | ['s299882512', 's129119090'] | [23544.0, 38920.0] | [226.0, 259.0] | [184, 183] |
p02701 | u011202375 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['import collections\n\nN=int(input())\nP=[input() for i in range(N)]\nprint(P)\nc=collections.Counter(P)\nprint(len(c))', 'import collections\n\nN=int(input())\nP=[input() for i in range(N)]\nc=collections.Counter(P)\nprint(len(c))'] | ['Wrong Answer', 'Accepted'] | ['s414871867', 's224030980'] | [43652.0, 38740.0] | [288.0, 265.0] | [112, 103] |
p02701 | u011276976 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['import collections\nn = int(input())\ns = [input() for i in range(n)]\nc = collections.Counter(s)\nprint(len(a))', 'import collections\nn = int(input())\ns = [input() for i in range(n)]\nc = collections.Counter(s)\nprint(len(c))\n'] | ['Runtime Error', 'Accepted'] | ['s620605807', 's828220300'] | [38712.0, 38780.0] | [265.0, 258.0] | [108, 109] |
p02701 | u013513417 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N=int(input())\nS=[]\ncount=0\nfor i in range(N):\n sample=input()\n S.append(sample)\n\nset(S)\n\n \n \nprint(len(S))', 'N=int(input())\nS=[]\ncount=0\nfor i in range(N):\n sample=input()\n S.append(sample)\n\n\n\n \n \nprint(len(set(S)))'] | ['Wrong Answer', 'Accepted'] | ['s726481316', 's896009168'] | [35648.0, 35604.0] | [285.0, 283.0] | [119, 118] |
p02701 | u018168283 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\nc = []\ncou = 1\nfor i in range(n):\n c.append(input())\n\nset(c)\n \nprint(len(c))', 'n = int(input())\nc = []\nfor i in range(n):\n c.append(input())\n\nprint(len(list(set(c))))'] | ['Wrong Answer', 'Accepted'] | ['s266701193', 's912008451'] | [35668.0, 35536.0] | [270.0, 283.0] | [95, 88] |
p02701 | u021906447 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = input()\na = []\nfor i in range(N):\n f = input()\n a.append(f)\n \na=list(set(a))\n\nprint(len(a))', 'N = int(input())\na = []\nfor i in range(N):\n f = input()\n a.append(f)\n \na=list(set(a))\n\nprint(len(a))'] | ['Runtime Error', 'Accepted'] | ['s073716216', 's094733858'] | [9048.0, 35656.0] | [22.0, 289.0] | [98, 103] |
p02701 | u023077142 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = int(input())\n\nWs = [s for _ in range(N)]\n\nprint(len(set(Ws)))', 'N = int(input())\n \nWs = [input() for _ in range(N)]\n \nprint(len(set(Ws)))'] | ['Runtime Error', 'Accepted'] | ['s652385218', 's494264760'] | [9120.0, 35496.0] | [23.0, 261.0] | [65, 73] |
p02701 | u023100857 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\nsequence = [input() for _ in range(n)]\nans = 0\nwhile True:\n if len(sequence) == 0:\n break\n a = sequence[0]\n sequence.remove(a)\n ans += 1\n\n\nprint(ans) ', 'n = int(input())\nsequence = [input() for _ in range(n)]\n\nprint(len(set(sequence))) '] | ['Wrong Answer', 'Accepted'] | ['s013651897', 's942894597'] | [23084.0, 35688.0] | [2206.0, 250.0] | [186, 83] |
p02701 | u031157253 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = int(input())\nr = set()\nfor i in range(N):\n r |= set(input())\n\nprint(len(r))', 'N = int(input())\nr = set()\nfor i in range(N):\n r |= set([input()])\n\nprint(len(r))'] | ['Wrong Answer', 'Accepted'] | ['s235974309', 's687560446'] | [9040.0, 31224.0] | [374.0, 332.0] | [82, 84] |
p02701 | u035453792 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\nans = []\ncnt = 0\nfor i in range(n):\n s = input()\n ans.append(s)\nans.sort()\nfor i in range(n-1):\n if ans[i]!=ans[i+1]:\n cnt+=1\nprint(cnt)', 'n = int(input())\nans = []\ncnt = 1\nfor i in range(n):\n s = input()\n ans.append(s)\nans.sort()\nfor i in range(n-1):\n if ans[i]!=ans[i+1]:\n cnt+=1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s920206619', 's886577514'] | [23892.0, 23884.0] | [348.0, 346.0] | [169, 169] |
p02701 | u038819082 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N=int(input())\nfor i in range(N):\n S[i+1]=str(input())\nprint(len(set(S)))', 'N=int(input())\na=[]\nfor i in range(N):\n a.append(input())\nprint(len(set(a)))'] | ['Runtime Error', 'Accepted'] | ['s383692655', 's248700564'] | [9172.0, 35680.0] | [22.0, 277.0] | [74, 77] |
p02701 | u039065404 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = int(input()) \ns = [input() for i in range(N)] \nprint(len(s))', 'N = int(input()) \ns = [input() for i in range(N)] \nprint(len(set(s)))'] | ['Wrong Answer', 'Accepted'] | ['s929310445', 's699996737'] | [23328.0, 35684.0] | [226.0, 256.0] | [128, 133] |
p02701 | u039189422 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n=input()\ns=set()\nprint(len(s))', 'n=int(input())\ns=[int(input()) for i in range(n)]\nprint(len(set(s))', 'n=int(input())\ns={input() for i in range(n)}\nprint(len(s))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s812998735', 's887120418', 's872812226'] | [9064.0, 9032.0, 31076.0] | [22.0, 21.0, 261.0] | [31, 67, 58] |
p02701 | u056830573 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\nitems = [x for x in input().split()]\n\nprint(len(set(items)))', 'n = int(input())\nitems = [input() for _ in range(n)]\n\nprint(len(list(set(items)))', 'n = int(input())\nitems = [input() for _ in range(n)]\n\nprint(len(list(set(items))))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s073243022', 's950200200', 's215881255'] | [9012.0, 8972.0, 35644.0] | [21.0, 21.0, 261.0] | [77, 81, 82] |
p02701 | u057668615 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = int(input())\nset = {}\nfor i in range(N):\n A = str(input())\n set.add(A)\n\nprint(len(set))\n', 'N = int(input())\ns = set()\nfor i in range(N):\n A = str(input())\n s.add(A)\n\nprint(len(s))'] | ['Runtime Error', 'Accepted'] | ['s231046666', 's966506392'] | [9136.0, 31136.0] | [20.0, 326.0] | [98, 94] |
p02701 | u059238013 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\ns_list = []\nfor i in range(n):\n temp = input()\n s_list.append(temp)\n\nlen(set(s_list))', 'n = int(input())\ns_list = []\nfor i in range(n):\n temp = input()\n s_list.append(temp)\n\nprint(len(set(s_list)))'] | ['Wrong Answer', 'Accepted'] | ['s937980290', 's302775862'] | [35632.0, 35480.0] | [270.0, 337.0] | [108, 115] |
p02701 | u063073794 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n= int(input())\nkk=set()\nfor i in range(n):\n s=input()\n kk.add()\nprint(len(kk))', 'n= int(input())\nkk=set()\nfor i in range(n):\n s=input()\n kk.add(s)\nprint(len(kk))'] | ['Runtime Error', 'Accepted'] | ['s175545020', 's715254534'] | [9104.0, 31104.0] | [21.0, 299.0] | [81, 82] |
p02701 | u066109980 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = int(raw_input())\ns = set()\nfor _ in range(N):\n S = raw_input()\n s.add(S)\nprint(len(s))', 'N = int(input())\ns = set()\nfor _ in range(N):\n S = input()\n s.add(S)\nprint(len(s))'] | ['Runtime Error', 'Accepted'] | ['s985861253', 's919094661'] | [9036.0, 31284.0] | [20.0, 292.0] | [96, 88] |
p02701 | u068343662 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['import math\n\ndef main():\n n = input()\n s = {}\n print(n)\n while int(n)>0:\n m = input()\n if m in s:\n s[m]+=1\n else:\n s[m]=1\n n = int(n) - 1\n print(len(s))\n return 0\n\nmain()', 'import math\n\ndef main():\n n = input()\n s = {}\n while int(n)>0:\n m = input()\n if m in s:\n s[m]+=1\n else:\n s[m]=1\n n = int(n) - 1\n print(len(s))\n return 0\n\nmain()'] | ['Wrong Answer', 'Accepted'] | ['s462988592', 's236387180'] | [35284.0, 35236.0] | [314.0, 304.0] | [238, 225] |
p02701 | u068844030 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = int(input())\nS = []\nfor i in range(N):\n S.append(input())\nset_S = set(S)\nlen(set_S)\n', 'N = int(input())\nS = []\nfor i in range(N):\n S.append(input())\nset_S = list(set(S))\nlen(set_S)\n', 'N = int(input())\nS = []\nfor i in range(N):\n S.append(input())\nset_S = list(set(S))\nprint(len(set_S))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s235655150', 's369706120', 's737528250'] | [35632.0, 35580.0, 35548.0] | [289.0, 289.0, 286.0] | [91, 97, 103] |
p02701 | u075304271 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ["import math\nimport collections\nimport fractions\nimport itertools\n\ndef solve():\n n = int(input())\n s = [input() for i in range(n)]\n print(len(s))\n return 0\n\nif __name__ == '__main__':\n solve()", "import math\nimport collections\nimport fractions\nimport itertools\n \ndef solve():\n n = int(input())\n s = [input() for i in range(n)]\n print(len(set(s)))\n return 0\n \nif __name__ == '__main__':\n solve()"] | ['Wrong Answer', 'Accepted'] | ['s246826546', 's600629235'] | [24696.0, 36888.0] | [248.0, 271.0] | [206, 213] |
p02701 | u077003677 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['import sys\nimport os\n\ndef file_input():\n f = open(\'../Beginner_Contest_164/input.txt\', \'r\')\n sys.stdin = f\n\ndef main():\n #file_input()\n # A,B,C,D=map(int, input().split())\n N = int(input())\n\n # S = []\n \n # str = input()\n # if str not in S:\n # S.append(str)\n #\n # print(len(S))\n\n S = {}\n val=0\n for i in range(N):\n str = input()\n if S.get(str) == None:\n S[val]=str\n val+=1\n\n print(val)\n\n # val = 0\n # str = ""\n \n # in_str = input()\n # if str.find(in_str):\n # str += " "+in_str\n # val += 1\n #\n # print(val)\n\nif __name__ == \'__main__\':\n main()\n', 'import sys\nimport os\n\ndef file_input():\n f = open(\'../Beginner_Contest_164/input.txt\', \'r\')\n sys.stdin = f\n\ndef main():\n #file_input()\n # A,B,C,D=map(int, input().split())\n N = int(input())\n\n # S = []\n \n # str = input()\n # if str not in S:\n # S.append(str)\n #\n # print(len(S))\n\n val = 0\n str = ""\n for i in range(N):\n in_str = input()\n if str.find(in_str):\n str += " "+in_str\n val += 1\n\n print(val)\n\nif __name__ == \'__main__\':\n main()\n', 'import sys\nimport os\n\ndef file_input():\n f = open(\'../Beginner_Contest_164/input.txt\', \'r\')\n sys.stdin = f\n\ndef main():\n #file_input()\n # A,B,C,D=map(int, input().split())\n N = int(input())\n\n # S = []\n \n # str = input()\n # if str not in S:\n # S.append(str)\n #\n # print(len(S))\n\n S = set()\n for i in range(N):\n S.add(input())\n\n print(len(S))\n\n # S = {}\n # val=0\n \n # str = input()\n # if S.get(str) == None:\n # S[val]=str\n # val+=1\n #\n # print(val)\n\n # val = 0\n # str = ""\n \n # in_str = input()\n # if str.find(in_str):\n # str += " "+in_str\n # val += 1\n #\n # print(val)\n\nif __name__ == \'__main__\':\n main()\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s573418380', 's906416894', 's097894210'] | [41092.0, 11136.0, 31156.0] | [293.0, 2206.0, 276.0] | [735, 558, 836] |
p02701 | u077013956 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector<string> S(N);\n for(int i=0;i<N;i++) {\n cin >> S.at(i);\n }\n sort(S.begin(),S.end());\n S.erase(unique(S.begin(),S.end()),S.end());\n cout << (int)S.size() << endl;\n}', 'N = int(input())\nS = []\nfor i in range(N) :\n S.append(input())\n\nprint(len(set(S)))'] | ['Runtime Error', 'Accepted'] | ['s272309488', 's943827960'] | [8876.0, 35576.0] | [25.0, 280.0] | [280, 85] |
p02701 | u078960732 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['import sys \ninput = sys.stdin.readline\nfor tt in range(1):\n\tn = int(input())\n\ts = set()\n\tfor i in range(n):\n\t\tif i==n-1:\n\t\t\ts.add(input().lower())\n\t\telse:\n\t\t\ts.add(input().lower()[:-1])\n\tprint(len(s))\n\t\t\t', "import sys \ntry:\n\tsys.stdin = open('input.txt', 'r') \n\tsys.stdout = open('output.txt', 'w')\nexcept:\n\tpass\n# input = sys.stdin.readline\nfor tt in range(1):\n\tn = int(input())\n\ts = set()\n\tfor i in range(n):\n\t\ts.add(input())\n\tprint(len(s))\n\t\t\t"] | ['Wrong Answer', 'Accepted'] | ['s195394878', 's854367280'] | [31272.0, 31280.0] | [138.0, 283.0] | [204, 239] |
p02701 | u080685822 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\nlist = []\nfor i in range(n):\n i = str(input())\n ilen = len(i)\n list.append(ilen)\n \nkind = len(list)\nprint(kind)', 'n = int(input())\nlis = set()\nfor i in range(n):\n i = str(input())\n ilen = len(i)\n lis.append(ilen)\n \nkind = int(len(lis))\nprint(kind)\n', 'n = int(input())\nlis = {}\nfor i in range(n):\n i = str(input())\n ilen = len(i)\n lis.append(ilen)\n \nkind = int(len(lis))\nprint(kind)\n', 'n = int(input())\nlis = []\nfor i in range(n):\n i = str(input())\n ilen = len(i)\n lis.append(ilen)\n \nkind = int(len(lis))\nprint(kind)\n', 'n = int(input())\nlis = set()\nfor i in range(n):\n i = str(input())\n lis.add(i)\n \nkind = int(len(lis))\nprint(kind)\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s000356814', 's162936776', 's928915825', 's991509391', 's016303120'] | [10604.0, 9172.0, 9176.0, 10632.0, 31148.0] | [288.0, 21.0, 21.0, 286.0, 332.0] | [132, 138, 135, 135, 116] |
p02701 | u081075058 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['a = input().strip()\nl = a.split()\n\nm_l = set()\nfor i in range(1 , n + 1):\n m_l.add(l[i])\nprint(len(m_l))\n', 'b = input().strip()\na = b.split()\na.pop(0)\nprint(len(set(a)))\n', 'a = p.strip()\nl = a.split()\nm = l.pop(0)\nprint(len(set(l))\n', 'a = input().strip()\nl = a.split()\nn = int(l[0])\nm_l = set()\nfor i in range(1 , n + 1):\n m_l.add(l[i])\nprint(len(set(m_l)))\n', 'p = input()\na = p.strip()\nl = a.split()\nprint(len(set(l)) - 1)\n\n', 'a = input().strip()\nl = a.split()\nn = int(l[0])\nm_l = []\nfor i in range(1 , n + 1):\n m_l.append(l[i])\nprint(len(list(set(m_l))))\n', 'a = p.strip()\nl = a.split()\nm = l.pop(0)\nprint(len(set(l)))\n', 'a = input().strip()\nl = a.split()\nprint(len(set(l)) - 1)\n', 'p = input()\na = p.strip()\nl = a.split()\nm = l.pop(0)\nprint(len(set(l))\n', '\na = int(input())\nl = [input() for i in range(a)]\nprint(len(set(l)))\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s035225113', 's089703732', 's335339558', 's363437163', 's508042553', 's790092650', 's836808513', 's910321603', 's993695690', 's762350030'] | [8952.0, 9100.0, 8956.0, 9040.0, 8968.0, 9176.0, 9068.0, 9008.0, 8912.0, 35588.0] | [23.0, 25.0, 22.0, 23.0, 20.0, 22.0, 23.0, 19.0, 25.0, 254.0] | [108, 62, 59, 126, 64, 132, 60, 57, 71, 69] |
p02701 | u081784777 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\ns = []\nfor _ in range(n):\n s.append(input())\n\nprint(s)\n\nprint(len(set(s)))', 'n = int(input())\ns = []\nfor _ in range(n):\n s.append(input())\n\nprint(len(set(s)))'] | ['Wrong Answer', 'Accepted'] | ['s050389968', 's008955966'] | [38032.0, 35528.0] | [292.0, 264.0] | [94, 84] |
p02701 | u083874202 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ["import math\n\nI = int(input())\n\n#N, M = map(int, input().split())\n\n#N = input()\n\n#listA = list(N)\n\n#list = list(map(int, input().split()))\n\nlist = '\\n'.join(iter(input, ''))\nprint(len(set(list)))", "import math\n\nI = int(input())\n\n#N, M = map(int, input().split())\n\n#N = input()\n\n#listA = list(N)\n\n#list = list(map(int, input().split()))\n\nlist = '\\n'.join(iter(input, ''))\nprint(len(set(list))-1)", 'import math\n\nI = int(input())\n\n#N, M = map(int, input().split())\n\n#N = input()\n\n#listA = list(N)\n\n#list = list(map(int, input().split()))\n\nlist = [input() for i in range(I)]\nprint(len(set(list)))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s606973581', 's619806811', 's361335006'] | [23340.0, 23372.0, 35588.0] | [214.0, 217.0, 257.0] | [408, 410, 422] |
p02701 | u084101398 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['b=int(input())\na=set(input().split())\nprint(len(a))', 'b=int(input())\nl = {input() for _ in range(b)}\nprint(len(l))'] | ['Wrong Answer', 'Accepted'] | ['s715173832', 's133128032'] | [9156.0, 31284.0] | [21.0, 264.0] | [51, 60] |
p02701 | u086776991 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['#include "bits/stdc++.h"\nusing namespace std;\n\nint main(){\n int N;\n cin >> N;\n string S[N];\n for(int i=0;i<N;i++) cin >> S[i];\n int count = 0;\n for(int i=0;i<N;i++){\n if(S[i]!="0"){\n for(int j=i+1;j<N;j++){\n if(S[i]==S[j]) S[j]="0";\n }\n }\n }\n for(int i=0;i<N;i++){\n if(S[i]!="0") count++;\n }\n cout << count << endl;\n\n}\n', 'a,b,c,d=map(int,input().split())\nwhile True:\n\tc-=b\n\tif c<=0:\n\t\tprint("Yes")\n\t\tbreak\n\ta-=d\n\tif a<=0:\n\t\tprint("No")\n\t\tbreak\n', 'N = int(input())\nS = list()\nfor i in range(N):\n S.append(input())\nS1 = set(S)\nprint(len(S1))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s619108169', 's824799984', 's024159695'] | [9012.0, 9176.0, 35568.0] | [20.0, 23.0, 290.0] | [407, 122, 94] |
p02701 | u087118202 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n=int(input())\na=[]\nfor _ in range(n):\n a.append(input())\nas=set(a)\nprint(len(a))', 'n=int(input())\na=[]\nfor _ in range(n):\n a.append(input())\nas=set(a)\nprint(len(as))', 'n=int(input())\na=[]\nfor _ in range(n):\n a.append(input())\nas_=set(a)\nprint(len(as_))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s252281664', 's533522844', 's966133860'] | [9020.0, 8944.0, 35532.0] | [26.0, 24.0, 283.0] | [82, 83, 85] |
p02701 | u088115428 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n = int(input())\nl =[]\nfor i in range(0,n):\n l.append(input())\nprint(len(set(l))\n ', 'n = int(input())\nl =[]\nfor i in range(0,n):\n l.append(str(input()))\nprint(len(set(l)))'] | ['Runtime Error', 'Accepted'] | ['s573404108', 's600954971'] | [8976.0, 35584.0] | [22.0, 287.0] | [84, 87] |
p02701 | u088989565 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['N = int(input())\nS = [ [],[],[],[],[],[],[],[],[],[] ]\nans = 0\nfor i in range(N):\n temps = input()\n if(temps not in S[len(temps)-1]):\n ans += 1\n S[len(temps)-1].append(temps)\nprint(ans)\nprint(S)', 'N = int(input())\nd = {}\nfor i in range(N):\n d[input()] = 1\nprint(len(d))'] | ['Wrong Answer', 'Accepted'] | ['s818530847', 's971400320'] | [10240.0, 35204.0] | [2206.0, 279.0] | [202, 73] |
p02701 | u089504174 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n=int(input())\ng=[]\nfor i in range(n):\n gi=input()\n g.append(gi) \ng.sort()\ncount=1\nfor i in range(n-1):\n if g[i]!=g[i+1]:\n count+=1\nprint(g)\nprint(count)', 'n=int(input())\ng=[]\nfor i in range(n):\n gi=input()\n g.append(gi) \ng.sort()\ncount=1\nfor i in range(n-1):\n if g[i]!=g[i+1]:\n count+=1\n\nprint(count)\n'] | ['Wrong Answer', 'Accepted'] | ['s015493709', 's336680380'] | [29832.0, 23964.0] | [409.0, 369.0] | [160, 153] |
p02701 | u090406054 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n= input()\ns=[]\nfor i in range(n):\n s.append(input())\n \nprint(set(s))\n', 'n= int(input())\ns=[]\nfor i in range(n):\n s.append(int(input()))\n \nprint(set(s))', 'n= int(input())\ns=[]\nfor i in range(n):\n s.append(input())\n \nprint(len(set(s)))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s181981047', 's945357649', 's696436723'] | [8996.0, 9128.0, 35632.0] | [21.0, 22.0, 268.0] | [72, 81, 82] |
p02701 | u095192632 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['S = input()\nN = len(S)\nprint(N)\ncnt = 0\n\nfor i in range(N):\n for j in range(i+4, N+1):\n if int(S[i:j]) % 2019 == 0:\n cnt += 1\nprint(cnt)\n\n', 'N = int(input())\nS = [input() for _ in range(N)]\n\ns = len(set(S))\nprint(s)'] | ['Wrong Answer', 'Accepted'] | ['s356064179', 's945784236'] | [9180.0, 35712.0] | [25.0, 252.0] | [159, 74] |
p02701 | u101232733 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['n= int(input())\nl= {}\nfor _ in range(n):\n\ts= input()\n\tl.add(s)\nprint(len(l))', 'n= int(input())\nl= set()\nfor _ in range(n):\n\ts= input()\n\tl.add(s)\nprint(len(l))'] | ['Runtime Error', 'Accepted'] | ['s986393271', 's160378377'] | [9160.0, 31072.0] | [23.0, 305.0] | [76, 79] |
p02701 | u105124953 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ["import itertools\ns = input()\ns_li = list(s)\nlee = len(s_li)\n\ncount = 0\nketa = list(itertools.combinations([i for i in range(lee)], 2))\nfor k in keta:\n lk = list(k)\n #print(s_li[lk[0]:lk[1]+1])\n if int(''.join(s_li[lk[0]:lk[1]+1]))%2019 == 0:\n count += 1\nprint(count)", 'n = int(input())\nli = []\nfor _ in range(n):\n li.append(input())\nprint(len(set(li)))'] | ['Wrong Answer', 'Accepted'] | ['s624078110', 's698432881'] | [9208.0, 35532.0] | [22.0, 271.0] | [282, 86] |
p02701 | u106954338 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['import collections\nN = int(input())\nS = [str(input()) for i in range(N)]\na = collections.Counter(S)\nprint(len(S))\n', 'import collections\nN = int(input())\nS = [str(input()) for i in range(N)]\na = collections.Counter(S)\nprint(len(a))\n'] | ['Wrong Answer', 'Accepted'] | ['s774758642', 's173466513'] | [38716.0, 38792.0] | [286.0, 282.0] | [114, 114] |
p02701 | u112247039 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ["s = set()\nfor _ in range(int(input())):\n s.add(input())\nprint(*s,'\\n',len(s))", 's = set()\nfor _ in range(int(input())):\n s.add(input())\nprint(len(s))'] | ['Wrong Answer', 'Accepted'] | ['s996373428', 's607180024'] | [32492.0, 31132.0] | [355.0, 286.0] | [80, 72] |
p02701 | u112317104 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['from collections import defaultdict\n\ndef solve():\n N = int(input())\n A = [input() for _ in range(N)]\n d = defaultdict(int)\n \n for a in A:\n d[a] += 1\n \n return len(d)\n\n# print(solve())\n\n\nsolve()', 'from collections import defaultdict\n\ndef solve():\n N = int(input())\n A = [input() for _ in range(N)]\n d = defaultdict(int)\n \n for a in A:\n d[a] += 1\n \n return len(d)\n\nprint(solve())\n\n\n#solve()\n'] | ['Wrong Answer', 'Accepted'] | ['s202245619', 's107957579'] | [38608.0, 38776.0] | [282.0, 285.0] | [258, 258] |
p02701 | u112629957 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['Row = int(input())\nList = list(input() for i in range(Row))\nsorted(List)\na=Row-1\nwhile a>0:\n if List[a] == List[a-1]:\n List.remove(List[a])\n a-=1\n else:a-=1\nelse:print(len(List)) ', 'Row = int(input())\nList = list(input() for i in range(Row))\nsorted(List)\na=Row-1\nwhile a>0:\n if List[a] == List[a-1]:\n List.remove(List[a])\n a-=1\n else:a-=1\nelse:print(len(List)) ', 'Row = int(input())\nList = list(input() for i in range(Row))\nprint(len(set(List)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067338384', 's549116529', 's352816967'] | [25468.0, 25276.0, 35576.0] | [2206.0, 2206.0, 258.0] | [182, 182, 81] |
p02701 | u113255362 | 2,000 | 1,048,576 | You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i. How many kinds of items did you get? | ['Row = int(input())\nList = []\nfor i in range (Row):\n List.append(int(input()))\ns_l = set(List)\nprint(len(s_l))', 'Row = int(input())\nList = []\nfor i in range (Row):\n List.append(input())\ns_l = set(List)\nprint(len(s_l))'] | ['Runtime Error', 'Accepted'] | ['s610642916', 's142598752'] | [9164.0, 35504.0] | [26.0, 279.0] | [110, 105] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.