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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02768 | u840310460 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n, a, b = [int(i) for i in input().split()]\n\np = 10 ** 9 + 7\nN = 10 ** 9\nfact = [1, 1]\nfactinv = [1, 1]\ninv = [0, 1]\n\nfor i in range(2, N+1):\n fact.append((fact[-1]*i)%p)\n inv.append((-inv[p%i] * (p//i)) % p) \n factinv.append(factinv[-1] * inv[-1] % p)\n \ndef comb(n, r, p):\n if r < 0 or n ... | ['Time Limit Exceeded', 'Accepted'] | ['s938183978', 's285754856'] | [225920.0, 3064.0] | [2123.0, 151.0] | [458, 358] |
p02768 | u840974625 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n, a, b = map(int, input().split())\n\nmod = 10**9 + 7\nres = (2**n - 1) % mod\n\ndef cmb(n, r, mod):\n r = min(n-r, r)\n if r == 0:\n return 1\n over, under = 1, 1\n for i in range(1, r+1):\n over = over * (n-i+1) % mod\n under = under * i % mod\n inv = pow(under, mod-2, mod)\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Time Limit Exceeded', 'Runtime Error', 'Time Limit Exceeded', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s043535825', 's151274784', 's251706015', 's561108150', 's592749029', 's612818541', 's630502405', 's766948369', 's695061932'] | [199380.0, 209708.0, 199388.0, 228828.0, 3064.0, 213996.0, 223728.0, 199380.0, 3064.0] | [2106.0, 2118.0, 2107.0, 2119.0, 18.0, 2118.0, 2119.0, 2107.0, 141.0] | [401, 717, 382, 628, 403, 716, 716, 563, 399] |
p02768 | u857330600 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['mod=10**9+7\nors=[n]\nrev=[1]\n\ndef ie(n,r,mod):\n if r==1:\n return n\n elif r%2==0:\n return (ie(n,r//2,mod)**2)%mod\n else:\n return n*((ie(n,(r-1)//2,mod))**2)%mod\n \nfor i in range(1,b):\n ors.append(ors[-1]*(n-i)%mod)\n rev.append(rev[-1]*(i+1)%mod) \nN=ie(2,n,mod)\nA=ors[a-1]*ie(rev[a-1],mod-... | ['Runtime Error', 'Accepted'] | ['s165575890', 's609485676'] | [3064.0, 18892.0] | [17.0, 150.0] | [363, 399] |
p02768 | u860002137 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['from functools import reduce\nMOD = 10**9 + 7\n\n\ndef cmb(N, A):\n num = reduce(lambda x, y: x * y % MOD, range(N, N - A, -1))\n den = reduce(lambda x, y: x * y % MOD, range(1, A + 1))\n return num * pow(den, MOD - 2, MOD) % MOD\n\n\nn, a, b = map(int, input().split())\na %= MOD\nb %= MOD\n\n\nprint((pow(2,... | ['Wrong Answer', 'Accepted'] | ['s130701126', 's934519135'] | [3684.0, 3572.0] | [159.0, 160.0] | [343, 347] |
p02768 | u871509659 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['import math\n\nz = 10**9 + 7\n\nn, a, b = [int(i) for i in input().split()]\n\nr = pow(2, n, z)\n\ndef c(m):\n x = 1\n for i in range(n-m+1, n+1):\n x = x*i % z\n \n return (x * pow(math.factorial(m), z-2, z)) % z\n\nr = (r - c(a) - c(b)) % z\n\nprint(r)', 'import math\n\nz = 10**9 + 7\n\nn, a, b = [int(i) for... | ['Wrong Answer', 'Accepted'] | ['s407082561', 's718632444'] | [5452.0, 5464.0] | [1489.0, 1489.0] | [244, 248] |
p02768 | u880480312 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['m=10**9+7\nn,a,b=map(int,input().split())\n\ndef comb(n,r,m):\n x,y=1,1\n for i in range(r):\n x*=n-1\n y*=n+1\n x%=m\n y%=m\n return int(x * pow(y, m-2, m))\nans = pow(2, n, m)-comb(n, a, m) - comb(n, b, m)\nprint(ans%m)', 'm=10**9+7\nn,a,b=map(int,input().split())\n\ndef comb(n,... | ['Wrong Answer', 'Accepted'] | ['s232018694', 's747901361'] | [3064.0, 3064.0] | [151.0, 147.0] | [246, 248] |
p02768 | u893063840 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n, a, b = map(int, input().split())\nmod = 10 ** 9 + 7\n\nans = pow(2, n, mod)\nans -= 1\nans += 2 * mod\n\n\ndef cmb(n, r, mod):\n if ( r<0 or r>n ):\n return 0\n r = min(r, n-r)\n return g1[r-1] * g2[r] % mod\n\nmod = 10**9+7 \nN = 2 * 10 ** 5\ng1 = [n % mod] \ng2 = [1, 1] \ninverse = [0, 1] 計算用テーブ\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s201359536', 's621776869', 's375040862'] | [27052.0, 27076.0, 18804.0] | [280.0, 278.0, 318.0] | [631, 616, 501] |
p02768 | u895558682 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['from math import comb\n\nM = 10**9 + 7\nn,a,b = map(int, input().split())\n\nprint(pow(2, n, M) - comb(n, a) % M - comb(n, b) % M)\n', 'M = 10**9 + 7\nn,a,b = map(int, input().split())\n\ndef modinv(n):\n return pow(n, M-2, M)\n\ndef comb(n, r):\n num = denom = 1\n for i in range(1,r+1):\n num = (num*... | ['Runtime Error', 'Accepted'] | ['s674428792', 's423059519'] | [2940.0, 3064.0] | [17.0, 149.0] | [126, 303] |
p02768 | u898967808 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n,a,b = map(int,input().split())\n\nMOD = 10**9 + 7\nm = 2*10**5\nmm = 2** m\n\nans = 1\nfor _ in range(n // m):\n ans = (ans * mm) % MOD\n\nans = (ans * 2**(n % m)) % MOD \n \nans = (ans - 1) % MOD\n\nans = (ans - cmb(n,a,MOD))%MOD\nans = (ans - cmb(n,b,MOD))%MOD\n\nprint(ans)', 'n,a,b = map(int,input().split()... | ['Runtime Error', 'Accepted'] | ['s437605437', 's872974443'] | [3064.0, 3064.0] | [517.0, 1525.0] | [266, 346] |
p02768 | u909991537 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n, a, b = (int(i) for i in input().split()) \nmod = 1000000007\nimport math\n\ndef combinations_count(n, r):\n if n <= 1:\n return 0\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n \nlis = [n]\nans = n\nbef = n\nfor i in range(2, math.floor(n/2) + 1):\n add = bef * (bef-1) ... | ['Wrong Answer', 'Accepted'] | ['s248598994', 's581432102'] | [85932.0, 3064.0] | [2112.0, 1516.0] | [560, 430] |
p02768 | u920204936 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n,a,b = map(int,input().split())\nmod = 10**9 + 7\naue,bue = 1,1\nfor i in range(a):\n aue = aue * (n-i) % mod\nfor i in range(b):\n bue = bue * (n-i) % mod\nasita,bsita = 1,1\nfor i in range(1,a+1):\n asita = asita*i %mod\nfor i in range(1,b+1):\n bsita = bsita*i %mod\nat = aue * pow(asita,mod-2,mod)\nbt... | ['Wrong Answer', 'Accepted'] | ['s561604207', 's672823128'] | [3064.0, 3064.0] | [182.0, 189.0] | [393, 383] |
p02768 | u921168761 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['mod = 1e9 + 7\n\ndef pw(x, n):\n if n == 0: return 1\n elif n == 1: return x\n elif n % 2 == 0:\n return pw(x, n // 2) ** 2 % mod\n else:\n return x * pw(x, n // 2) ** 2 % mod\n\ndef dv(x, y):\n return x * pw(y, mod - 2) % mod\n\ndef comb(n, r):\n v = 1\n if n < r or n < 0 or r < 0:... | ['Wrong Answer', 'Accepted'] | ['s713845702', 's894929189'] | [3064.0, 3064.0] | [2108.0, 143.0] | [551, 511] |
p02768 | u922487073 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['\nn,a,b = map(int, input().split())\nMOD = 10**9 + 7\nallpair = pow(2,n,MOD)\n\ndef combo(n,k):\n c = 1\n for i in range(k):\n c *= n - i\n c %= MOD\n\n d = 1\n for i in range(1, k+1):\n d *= i\n d %= MOD\n\n return (c * pow(d, mod-2, MOD)) % MOD\n\nprint((allpair - combo(n,... | ['Runtime Error', 'Accepted'] | ['s721922595', 's901587396'] | [9128.0, 9060.0] | [73.0, 124.0] | [330, 329] |
p02768 | u934099192 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['MAX_NUM = 10**9+1\nMOD = 10**9+7\n\nfac = [0 for _ in range(MAX_NUM)]\nfinv = [0 for _ in range(MAX_NUM)]\ninv = [0 for _ in range(MAX_NUM)]\n\nfac[0] = fac[1] = 1\nfinv[0] = finv[1] = 1\ninv[1] = 1\n\nfor i in range(2,MAX_NUM):\n fac[i] = fac[i-1] * i % MOD\n inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD\n ... | ['Time Limit Exceeded', 'Accepted'] | ['s016781428', 's496956458'] | [486552.0, 3064.0] | [2132.0, 1480.0] | [775, 1022] |
p02768 | u941753895 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdi... | ['Wrong Answer', 'Accepted'] | ['s378144525', 's537721384'] | [5172.0, 5304.0] | [166.0, 158.0] | [1287, 1191] |
p02768 | u944643608 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['import math\nrom scipy.special import comb\nt = comb(n, a, exact=True)\nk = comb(n, b, exact=True)\nn, a, b = map(int,input().split())\nif n == 2:\n print(0)\nelse:\n total = 2 ** n -1\n total = total - t - k\n print(total % (10 ** 9 + 7))\n', 'import math\nN, a, b = map(int,input().split())\np = 10 ** 9 +7\nA =... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s077993943', 's134795948', 's141214352', 's160558394', 's425867661', 's461009593', 's480989439', 's543449773', 's584349309', 's588555631', 's617900406', 's713729657', 's799251332', 's852382429', 's878974333', 's888323838', 's507325114'] | [2940.0, 5912.0, 5796.0, 199372.0, 3064.0, 3064.0, 3064.0, 3264.0, 3304.0, 2940.0, 5904.0, 9072.0, 5804.0, 5904.0, 2940.0, 5788.0, 3064.0] | [17.0, 2104.0, 2104.0, 2107.0, 838.0, 98.0, 17.0, 2104.0, 2104.0, 17.0, 1437.0, 2104.0, 1432.0, 1434.0, 17.0, 1434.0, 116.0] | [235, 381, 288, 267, 337, 336, 526, 531, 422, 523, 411, 374, 397, 411, 525, 400, 291] |
p02768 | u951480280 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n,a,b=map(int,input().split())\n\n \ndef combination(n, r, mod=10**9+7):\n n1, r = n+1, min(r, n-r)\n numer = denom = 1\n for i in range(1, r+1):\n numer = (numer*(n1-i)) % mod\n denom = (denom*i) % mod\n return numer * pow(denom, mod-2, mod) % mod\n\nmod=10**9+7\n\nprint((pow(2,n,mod) - com... | ['Wrong Answer', 'Accepted'] | ['s935614021', 's072571812'] | [3064.0, 3064.0] | [130.0, 131.0] | [351, 354] |
p02768 | u959340534 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n, a, b = map(int, input().split())\n\nfrom operator import mul\nfrom functools import reduce\nimport math\n\nflg = (a == n-b)\nrep = math.ceil(n/2)\nMOD = 10**9+7\nmemo = 0\n\ndef modpow(a: int, p: int, mod: int) -> int:\n \n if p == 0:\n return 1\n if p % 2 == 0:\n half = modpow(a, p//2, mod)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s236508102', 's386214145', 's830811455', 's816698823'] | [3688.0, 3572.0, 3688.0, 3572.0] | [254.0, 251.0, 252.0, 254.0] | [895, 897, 897, 903] |
p02768 | u970197315 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['# ABC 156 D\nsi = lambda: input()\nni = lambda: int(input())\nnm = lambda: map(int, input().split())\nnms = lambda: map(str, input().split())\nnl = lambda: list(map(int, input().split()))\n\n# a = 1\n\n# a *= i\n# a %= mod\n# return a\n\n\n# return 0\n# fact_n = factorial_mod(n, mo... | ['Wrong Answer', 'Accepted'] | ['s863124833', 's694809941'] | [28080.0, 3064.0] | [2106.0, 143.0] | [1389, 287] |
p02768 | u975039852 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['n, a, b = map(int, input().split())\nmod = 10**9+7\ndef inv(x):\n return pow(x, mod-2, mod)\ndef fact(x):\n f = 1\n for i in range(1, x + 1):\n f *= i\n f %= mod\n return f\ndef comb(n, r):\n return (fact(n) * inv(fact(n-r)) * inv(fact(r))) % mod\nprint((pow(2, n) - comb(n, a) - comb(n, b)) % mod)', 'n, a,... | ['Wrong Answer', 'Accepted'] | ['s101069110', 's221790715'] | [199372.0, 3064.0] | [2108.0, 117.0] | [297, 385] |
p02768 | u981332890 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['from operator import mul\nfrom functools import reduce\n\ndef cmb(n,r):\n r = min(n-r,r)\n if r == 0: return 1\n over = reduce(mul, range(n, n - r, -1))\n under = reduce(mul, range(1,r + 1))\n return over // under\n\ndef main():\n mod = (10 ** 9) + 7\n n, a, b = map(int, input().split())\n\n a... | ['Wrong Answer', 'Accepted'] | ['s091286764', 's328127442'] | [3572.0, 5804.0] | [24.0, 1485.0] | [923, 584] |
p02768 | u981931040 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['def modinv(a, m):\n b = m\n u = 1\n v = 0\n while b:\n t = a // b\n a -= t * b\n a, b = b, a\n u -= t * v\n u, v = v, u\n u %= m\n if u < 0:\n u += m\n return u\n\ndef nCk(N, k, mod):\n ret_val = 1\n for i in range(k):\n ret_val *= (N - i)\n ... | ['Runtime Error', 'Accepted'] | ['s472146978', 's510217231'] | [8900.0, 9140.0] | [29.0, 804.0] | [581, 578] |
p02768 | u983109611 | 2,000 | 1,048,576 | Akari has n kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b. How many different bouquets are there that Akari can make? Find the count modulo (10^9 + 7). Here,... | ['N, a, b = map(int, input().split())\n \ndef cmb(n, r, mod):\n if ( r<0 or r>n ):\n return 0\n r = min(r, n-r)\n return g1[n] * g2[r] * g2[n-r] % mod\n \nmod = 10**9+7 \nX = 10**9\ng1 = [1, 1] \ng2 = [1, 1] \ninverse = [0, 1] 計算用テーブル\n \nfor i in range( 2, X + 1 ):\n g1.append( ( g1[-1] * i ) % mod ... | ['Time Limit Exceeded', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Time Limit Exceeded', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s065798532', 's360659395', 's379334116', 's438656903', 's622026178', 's667607699', 's701528548', 's715182878', 's742235775', 's876041013', 's439065171'] | [216900.0, 27092.0, 199380.0, 27092.0, 27092.0, 27152.0, 27092.0, 199380.0, 27092.0, 199328.0, 3064.0] | [2118.0, 260.0, 2106.0, 267.0, 266.0, 283.0, 262.0, 2112.0, 277.0, 2106.0, 159.0] | [577, 584, 593, 586, 576, 576, 578, 590, 586, 616, 304] |
p02769 | u021548497 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['n, k = map(int, input().split())\nmod = 10**9+7\n\nk = min([k, n-1])\n\n\nans = 0\nkey = 1\n\nfor i in range(k):\n ans += key\n ans %= mod\n key = (((key*(n-i)%mod)*(n-i-1)%mod)*pow(pow(i+1, mod-2, mod), 2, mod))%mod\nprint(ans)', 'n, k = map(int, input().split())\nmod = 10**9+7\n\nk = min([k, n-1])\n\n\nans... | ['Wrong Answer', 'Accepted'] | ['s898951135', 's072407676'] | [3064.0, 3064.0] | [1028.0, 1033.0] | [224, 226] |
p02769 | u162612857 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['n, k = list(map(int, input().split()))\n\nmod = 10**9 + 7\n\n\ndef modinv(x):\n return pow(x, mod-2)\n\n\n\n\n\nmax_len = 2 * n - 1 \n\nfactori_table = [1] * (max_len + 1)\nfactori_inv_table = [1] * (max_len + 1)\nfor i in range(1, max_len + 1):\n factori_table[i] = factori_table[i-1] * (i) % mod\n factori_i... | ['Time Limit Exceeded', 'Accepted'] | ['s997558940', 's407037293'] | [172092.0, 50536.0] | [2111.0, 740.0] | [1423, 2279] |
p02769 | u461454424 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['#input\nn, k = map(int, input().split())\n\n#output\nmod = pow(10, 9) + 7\n\ndef cmb(n, r):\n res = 1\n fac = 1\n for i in range(r):\n res *= (n-i)\n res %= mod\n fac *= (i+1)\n fac %= mod\n return res*pow(fac, mod-2, mod) % mod\n\nif n <= k-1:\n print(cmb(2*n-1, n))\nelse:\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s220899185', 's417488342', 's630970418'] | [3064.0, 3064.0, 34676.0] | [88.0, 17.0, 610.0] | [406, 406, 534] |
p02769 | u482789362 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ["from functools import lru_cache\n\n\nCHECK = False\n\nN, K = list(map(int, input().split()))\n\nMOD = 10 ** 9 + 7\n\n\n@lru_cache(maxsize=None)\ndef modInverse(a, p):\n # Fermat's little theorem, a**(p-1) = 1 mod p\n return pow(a, p - 2, p)\n\n\nif CHECK:\n fact = [1]\n for i in range(1, 2 * N + 1):\n ... | ['Runtime Error', 'Accepted'] | ['s497531236', 's995453914'] | [60580.0, 60580.0] | [1664.0, 1699.0] | [1509, 1523] |
p02769 | u497046426 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ["class Combinatorics:\n def __init__(self, N, mod):\n '''\n Preprocess for calculating binomial coefficients nCr (0 <= r <= n, 0 <= n <= N)\n over the finite field Z/(mod)Z.\n Input:\n N (int): maximum n\n mod (int): a prime number. The order of the field Z/(mod)Z o... | ['Wrong Answer', 'Accepted'] | ['s950537447', 's397806325'] | [78060.0, 78060.0] | [872.0, 871.0] | [2182, 2179] |
p02769 | u511379665 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['n,k=map(int,input().split())\nMOD=10**9+7\nans=1\n\n#Combination 1 O()\ndef cmb(n, r, mod):\n if ( r<0 or r>n ):\n return 0\n r = min(r, n-r)\n return g1[n] * g2[r] * g2[n-r] % mod\n\nmod = MOD \nN = 10**6\ng1 = [1, 1] \ng2 = [1, 1] \ninverse = [0, 1] 計算用テーブル\n\nfor i in range( 2, N + 1 ):\n g1.app... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s402886996', 's408154822', 's586705747', 's356212969'] | [122040.0, 123888.0, 122016.0, 121852.0] | [1749.0, 1625.0, 1601.0, 1509.0] | [622, 675, 658, 1505] |
p02769 | u606045429 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['Point = complex\n\n\nN, *XY = map(int, open(0).read().split())\n\nP = [Point(x, y) for x, y in zip(*[iter(XY)] * 2)]\n\ndef max_distance(center):\n return max(abs(center - p) for p in P)\n\ndef ternary_search(f, left, right, MAX_ITER=100):\n for _ in range(MAX_ITER):\n m1 = (left * 2 + right) / 3\n ... | ['Runtime Error', 'Accepted'] | ['s300697479', 's432433867'] | [3064.0, 50776.0] | [18.0, 704.0] | [564, 800] |
p02769 | u699008198 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['n, k = map( int, input().split() )\nmod = 10 ** 9 + 7\n\nnumer = [ 1 ] * ( n + 1 )\ndemon = [ 1 ] * ( n + 1 )\n\nfor i in range( 1, n + 1 ):\n numer[ i + 1 ] = ( numer[ i ] * i ) % mod\n\ndemon[ n ] = pow( numer[ n ], mod - 2, mod )\nfor i in range( n, 0, -1 ):\n demon[ i - 1 ] = ( demon[ i ] * i ) % mod\n \ndef n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s268980418', 's473150427', 's901512281', 's576197649'] | [3064.0, 12404.0, 12404.0, 18804.0] | [17.0, 89.0, 83.0, 390.0] | [520, 509, 516, 500] |
p02769 | u747602774 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['def modinv(a,m):\n return pow(a,m-2,m)\n\n\nn,k = map(int,input().split())\nP = 10**9+7\n\nif n-1 <= k:\n\n ans = 1\n for i in range(1,n):\n ans = ans*(N+1-i)*modinv(i,P)%P\n\nelse:\n ans = 0\n nCl = 1\n n1Cl = 1\n for l in range(1,k+1):\n nCl = nCl*(n+1-l)*modinv(l,P)%P\n n1... | ['Runtime Error', 'Accepted'] | ['s508138689', 's418325925'] | [3064.0, 18960.0] | [1612.0, 1645.0] | [379, 350] |
p02769 | u784022244 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['N,K=map(int, input().split())\ndef cmb(n, r, p):\n if (r < 0) or (n < r):\n return 0\n r = min(r, n - r)\n return fact[n] * factinv[r] * factinv[n-r] % p\n\np = 10 ** 9 + 7\nn= 2*10 ** 5 \nfact = [1, 1] \nfactinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)\ninv = [0, 1] \n \nfor i in range(2, n + 1)... | ['Wrong Answer', 'Accepted'] | ['s082771250', 's276985608'] | [27116.0, 27116.0] | [614.0, 636.0] | [672, 672] |
p02769 | u922449550 | 2,000 | 1,048,576 | There is a building with n rooms, numbered 1 to n. We can move from any room to any other room in the building. Let us call the following event a **move** : a person in some room i goes to another room j~ (i \neq j). Initially, there was one person in each room in the building. After that, we know that there were e... | ['def factorial(n, mod=10**9+7):\n a = 1\n for i in range(1,n+1):\n a = a * i % mod\n return a\n\n\ndef power(n, r, mod=10**9+7):\n if r == 0: return 1\n if r%2 == 0:\n return power(n*n % mod, r//2, mod) % mod\n if r%2 == 1:\n return n * power(n, r-1, mod) % mod\n\n\ndef comb(n, k... | ['Runtime Error', 'Accepted'] | ['s326550799', 's387272068'] | [6352.0, 6188.0] | [1168.0, 1126.0] | [1997, 1093] |
p02770 | u044220565 | 2,000 | 1,048,576 | We have a sequence of k numbers: d_0,d_1,...,d_{k - 1}. Process the following q queries in order: * The i-th query contains three integers n_i, x_i, and m_i. Let a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \begin{eqnarray} a_j = \begin{cases} x_i & ( j = 0 ) \\\ a_{j - 1} + d_{(j - 1)~\textrm{... | ['# coding: utf-8\nimport sys\n#from operator import itemgetter\nsysread = sys.stdin.readline\n#from heapq import heappop, heappush\n#from collections import defaultdict\nsys.setrecursionlimit(10**7)\n#import math\n#from itertools import combinations\nimport numpy as np\ndef run():\n k,q = map(int, sysread().split()... | ['Wrong Answer', 'Accepted'] | ['s267423748', 's752135970'] | [12828.0, 24752.0] | [920.0, 1082.0] | [984, 989] |
p02770 | u207850265 | 2,000 | 1,048,576 | We have a sequence of k numbers: d_0,d_1,...,d_{k - 1}. Process the following q queries in order: * The i-th query contains three integers n_i, x_i, and m_i. Let a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \begin{eqnarray} a_j = \begin{cases} x_i & ( j = 0 ) \\\ a_{j - 1} + d_{(j - 1)~\textrm{... | ['k, q = map(int, input().split())\nd = list(map(int, input().split()))\nqueries = [tuple(map(int, input().split())) for _ in range(q)]\n\nfor n, x, m in queries:\n x_mod = x % m\n d_mod = [elem % m for elem in d]\n\n rem = n % k\n rem_d_mod = d_mod[-rem:]\n\n print(n - (x + sum(d_mod) * (n // k) + sum(r... | ['Wrong Answer', 'Accepted'] | ['s356228346', 's524213031'] | [4500.0, 15072.0] | [2104.0, 789.0] | [373, 432] |
p02770 | u211706121 | 2,000 | 1,048,576 | We have a sequence of k numbers: d_0,d_1,...,d_{k - 1}. Process the following q queries in order: * The i-th query contains three integers n_i, x_i, and m_i. Let a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \begin{eqnarray} a_j = \begin{cases} x_i & ( j = 0 ) \\\ a_{j - 1} + d_{(j - 1)~\textrm{... | ['import sys\nimport numpy as np\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nk,q=map(int,readline().split())\nD=list(map(int,readline().split()))\nNXM = map(int, read().split())\n\nNXM=iter(NXM)\nNXM=zip(NXM,NXM,NXM)\n\nfor n,x,m in NXM:\n tmpD=D%m\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s271406966', 's600972742', 's382969649'] | [13260.0, 4848.0, 13324.0] | [155.0, 2104.0, 849.0] | [517, 407, 572] |
p02770 | u581187895 | 2,000 | 1,048,576 | We have a sequence of k numbers: d_0,d_1,...,d_{k - 1}. Process the following q queries in order: * The i-th query contains three integers n_i, x_i, and m_i. Let a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \begin{eqnarray} a_j = \begin{cases} x_i & ( j = 0 ) \\\ a_{j - 1} + d_{(j - 1)~\textrm{... | ['\nimport numpy as np\ndef resolve():\n K, Q = map(int, input().split())\n D = np.array(input().split(), dtype=np.int64)\n\n\n for _ in range(Q):\n n, x, m = map(int, input().split())\n \n \n E = D % m\n acc_E = np.cumsum(E)\n\n \n loop, rem = divmod(n - 1, K)\... | ['Runtime Error', 'Accepted'] | ['s730991032', 's751763586'] | [9088.0, 28248.0] | [26.0, 502.0] | [1838, 1019] |
p02770 | u671455949 | 2,000 | 1,048,576 | We have a sequence of k numbers: d_0,d_1,...,d_{k - 1}. Process the following q queries in order: * The i-th query contains three integers n_i, x_i, and m_i. Let a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \begin{eqnarray} a_j = \begin{cases} x_i & ( j = 0 ) \\\ a_{j - 1} + d_{(j - 1)~\textrm{... | ['import numpy as np\n\nk, q = map(int, input().split())\nd = np.array(list(map(int, input().split())))\n\nfor i in range(q):\n n, x, m = map(int, input().split())\n mod_d = d % m\n modsum_d = mod_d.cumsum()\n _q, _m = divmod(n - 1, k)\n \n ans = modsum_d[k - 1] * _q\n if _m > 0:\n ans += modsum_d[_m - 1]\n ... | ['Wrong Answer', 'Accepted'] | ['s233562519', 's214088964'] | [22060.0, 12620.0] | [866.0, 864.0] | [442, 446] |
p02770 | u711693740 | 2,000 | 1,048,576 | We have a sequence of k numbers: d_0,d_1,...,d_{k - 1}. Process the following q queries in order: * The i-th query contains three integers n_i, x_i, and m_i. Let a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \begin{eqnarray} a_j = \begin{cases} x_i & ( j = 0 ) \\\ a_{j - 1} + d_{(j - 1)~\textrm{... | ["def main():\n import numpy as np\n k, q = map(int, input().split())\n d = np.array(list(map(int, input().split())))\n for i in range(q):\n n, x, m = map(int, input().split())\n x %= m\n d_mod = d % m\n zero_d = k - np.count_nonzero(d_mod)\n d_mod_sum = np.sum(d_mod) + m * zero_d\n rep = (n-1) //... | ['Wrong Answer', 'Accepted'] | ['s158462977', 's142937738'] | [21928.0, 12592.0] | [908.0, 897.0] | [568, 549] |
p02771 | u000085263 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a, b, c = map(int, input)\nif a==b or b==c or c==a:\n print("Yes")\nelse:\n print("No")', 'a, b, c = map(int, input().split())\nif a==b and b==c:\n print("No")\nelif a==b or b==c or c==a:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s561860710', 's634057247'] | [8972.0, 9084.0] | [23.0, 28.0] | [85, 131] |
p02771 | u000297744 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["a,b,c = map(int,input().split())\n\nif (a==b && a!=c) || (a==c&&a!=b) ||(b==c&&b!=a):\n print('yes')\nelse:\n print('no')", "a,b,c = map(int,input().split())\n\nif (a==b && a!=c) || (a==c&&a!=b) ||(b==c&&b!=a):\n print('Yes')\nelse:\n print('No')", "a,b,c = map(int,input().split())\n\nif (a==b and a!=c) o... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s316233542', 's485476800', 's658100445'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [122, 122, 130] |
p02771 | u002438394 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c=map(int,input().split())\nif(a==b and b==c):\n print("Yes")\nelse:\n print("No"', 'a,b,c=map(int,input().split())\nif(a==b and b==c):\n print("No")\nelif(a==b or b==c or c==a):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s379542142', 's347035142'] | [2940.0, 3060.0] | [17.0, 17.0] | [83, 132] |
p02771 | u003475507 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['n=int(input())\na = [input() for i in range(n)]\nb = sorted(list(set(a)))\nd = {}\nfor i in b:\n t = a.count(i)\n d.setdefault(t,[])\n d[t].append(i)\n\nfor i in d[max(d.keys())]:\n print(i)\n', "b = list(map(int,input().split()))\n\nif len(set(b)) == 2:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s081078598', 's240927761'] | [2940.0, 2940.0] | [17.0, 17.0] | [193, 96] |
p02771 | u003899575 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["a, b, c = input().split()\n\nif a == b and a != c:\n print('Yes')\nelif b == c and b != a:\n print('Yes')\nelif c == a and c != b:\n print('Yes')\nelse:\n print('No)", "a, b, c = input().split()\n \nif a == b and a != c:\n print('Yes')\nelif b == c and b != a:\n print('Yes')\nelif c == a and c != b:\n print('Y... | ['Runtime Error', 'Accepted'] | ['s043722277', 's946712732'] | [2940.0, 2940.0] | [17.0, 17.0] | [160, 162] |
p02771 | u004823354 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c = map(int,input().split())\nif a==b==c:\n print("No")\nelif a==b or b==c or a==c:\n print("No")\nelse:\n print("Yes")', 'a,b,c = map(int,input().split())\nif a==b==c:\n print("No")\nelif a!=b and b!=c and a!=c:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s676415810', 's067317807'] | [9068.0, 9132.0] | [28.0, 26.0] | [120, 122] |
p02771 | u005899289 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["A, B, C = map(int, input().split())\nif A == B and B == C:\n print('Yes')\nelse:\n print('No')", "A, B, C = map(int, input().split())\nif A == B and B == C:\n print('No')\nelif A != B and B !=C and C != A:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s473452817', 's585163154'] | [9144.0, 9128.0] | [25.0, 29.0] | [96, 146] |
p02771 | u006425112 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a, b, c = map(int, input().split())\n\ns = set([a,b,c])\nif len(s) == 2:\n print("YES")\nelse:\n print("NO")', 'a, b, c = map(int, input().split())\n\ns = set([a,b,c])\nif len(s) == 2:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s302471655', 's530102791'] | [2940.0, 2940.0] | [17.0, 17.0] | [108, 108] |
p02771 | u006883624 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['#from math import sqrt\n#from heapq import heappush, heappop\n#from collections import deque\n\na, b, c = [int(v) for v in input().split()]\n\nif a == b and a != c:\n print("YES")\n exit()\n\nif b == c and b != a:\n print("YES")\n exit()\n\nif c == a and c != b:\n print("YES")\n exit()\n\nprint("NO"... | ['Wrong Answer', 'Accepted'] | ['s008923033', 's561020021'] | [2940.0, 2940.0] | [18.0, 19.0] | [302, 302] |
p02771 | u007738720 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["a,b,c=input().split()\nif a==b==c or a!=b!=c:\n print('No')\nelse:\n print('Yes')", "a,b,c=input().split()\nif a==b==c or a!=b!=c!=a:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s326890026', 's900210468'] | [2940.0, 2940.0] | [18.0, 17.0] | [79, 82] |
p02771 | u007808656 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c=input().split()\nif (a==b and b==c) or (a!=b and b!=c):\n print("No")\nelse:\n print("Yes")', 'a,b,c=input().split()\nif (a==b and b==c) or (a!=b and b!=c and c!=a):\n print("No")\nelse:\n print("Yes")\n'] | ['Wrong Answer', 'Accepted'] | ['s531378927', 's461701763'] | [2940.0, 2940.0] | [18.0, 17.0] | [95, 105] |
p02771 | u012955130 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["list_num = input().split(' ')\nif len(set(list_num))==2:\n print('YES')\nelse:\n print('NO')", "list_num = input().split(' ')\nif len(set(list_num))==2:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s712751313', 's169472822'] | [2940.0, 2940.0] | [17.0, 18.0] | [95, 95] |
p02771 | u014960543 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['n=int(input())\nL={}\nc=0\nfor i in range (n):\n s=input()\n if s in L:\n L[s]+=1\n else:\n L.update({s:1})\n c+=1\nM=list(L.values())\nC=list(L.keys())\nb=max(M)\nF=[]\nfor i in range(c):\n if M[i]==b:\n F+=[C[i]]\nF.sort()\nfor i in F:\n print(i)\n \n \n', 'A,B,C... | ['Runtime Error', 'Accepted'] | ['s274844514', 's734684383'] | [3192.0, 2940.0] | [17.0, 17.0] | [287, 106] |
p02771 | u015467545 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c=map(int,input().split())\nif a==b and a!=c:\n print("yes")\nelif a==c and a!=b:\n print("yes")\nelif c==b and a!=c:\n print("yes")\nelse:\n print("no")', 'a,b,c=map(int,input().split())\nif a==b and a!=c:\n print("Yes")\nelif a==c and a!=b:\n print("Yes")\nelif c==b and a!=c:\n print("Yes")\nelse:\n pri... | ['Wrong Answer', 'Accepted'] | ['s954471028', 's237902796'] | [3060.0, 3064.0] | [18.0, 17.0] | [153, 153] |
p02771 | u015490689 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['#include <bits/stdc++.h>\nusing namespace std;\n\n\n\n\n#define FORE(i, b) for(auto &i:b)\n#define REP(i, b) FOR(i, 0, b)\n#define REPN(i, b) FORN(i, 0, b)\n#define SQ(i) (i*i)\n#define ALL(a) a.begin(), a.end()\n#define ALLA(a,n) a, a+n\n#define SORT(a) sort(ALL(a))\n#define SORTA(a, n) sort(ALLA(a, n))\n#define REV... | ['Runtime Error', 'Accepted'] | ['s410148531', 's969420462'] | [2940.0, 2940.0] | [17.0, 17.0] | [1604, 81] |
p02771 | u016901717 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['n=int(input())\nA=list(map(int,input().split()))\nans="APPROVED"\nfor i in A:\n if i%2==0:\n if i%3!=0 and i%5!=0:\n ans="DENIED"\n \n break\nprint(ans)\n \n', 'l=set(map(int,input().split()))\nif len(l)==2:\n print("Yes")\nelse:\n print("No")\n\n'] | ['Runtime Error', 'Accepted'] | ['s620151144', 's073597223'] | [2940.0, 2940.0] | [17.0, 17.0] | [199, 86] |
p02771 | u018679195 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a = int(input())\nb = int(input())\nc = int(input())\n\nif a==b or b==c or a==c:\n print("Yes")\nelse:\n print("No")\n', '#include<stdio.h>\nvoid main( )\n{\nint e,f,g;\nscanf("%d%d%d", &e, &f, &g);\nint count = 0;\nif( e==f && f!=g)\ncount=1;\nif( f==g && g!=f)\ncount=1;\nif( g==e && e!=f)\ncount=1;\n\nif(coun... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s042204417', 's348034294', 's355750321', 's578230585', 's784236620', 's920742757', 's842288144'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [116, 227, 202, 169, 210, 298, 185] |
p02771 | u019113646 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['n = list(map(int, input().split()))\nif n[0] !== n[1]:\n print("Yes")\n exit(0)\nif n[0] !== n[2]:\n print("Yes")\n exit(0)\nprint("No")', 'n = list(map(int, input().split()))\nif n[0] == n[1]:\n if n[0] == n[2]:\n print("Yes")\n exit()\nprint("No")', 'n = list(map(int, input().split()))\... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s202795217', 's316745200', 's435490265', 's639670672', 's779267419', 's979270196', 's117786899'] | [2940.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 19.0, 17.0, 17.0, 18.0, 17.0] | [141, 121, 106, 89, 102, 139, 308] |
p02771 | u021763820 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['# -*- coding: utf-8 -*-\nA, B, C = map(int, input().split())\ns = {A, B, C}\nif len(s) == 2:\n print("YES")\nelse:\n print("No")', '# -*- coding: utf-8 -*-\nA, B, C = map(int, input().split())\ns = {A, B, C}\nif len(s) == 2:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s750154321', 's291951551'] | [3064.0, 2940.0] | [20.0, 17.0] | [128, 128] |
p02771 | u022562184 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["a, b, c = map(int, input().split())\nif a == b and b != c:\n print('Yes')\n exit()\nif b == c and c != a:\n print('Yes')\n exit()\nprint('No')\n", "a, b, c = map(int, input().split())\nif a == b and b != c:\n print('Yes')\n exit()\nif b == c and c != a:\n print('Yes')\n exit()\nif c == a and b... | ['Wrong Answer', 'Accepted'] | ['s054298248', 's087537900'] | [2940.0, 2940.0] | [17.0, 17.0] | [148, 197] |
p02771 | u024782094 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['list=[int(input()) for i in range(3)]\nprint(len(set(list)))', 'list=[int(input()) for i in range(3)]\nprint("Yes" if len(set(list))=2 else "No")', 's=list(set(input().split()))\nif len(s)==2:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s280908985', 's796222007', 's561265357'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [59, 80, 77] |
p02771 | u025241948 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c=input()\n\nif a==b and a!=c:\n print("Yes")\nelif a==c and a!=b:\n print("Yes")\nelif b==c and a!=b:\n print("Yes")\nelse:\n print("No")', 'a,b,c=input().split()\n\nif a==b and a!=c:\n print("Yes")\nelif a==c and a!=b:\n print("Yes")\nelif b==c and a!=b:\n print("Yes")\nelse:\n print("No... | ['Runtime Error', 'Accepted'] | ['s524666276', 's925624905'] | [3064.0, 2940.0] | [17.0, 17.0] | [145, 153] |
p02771 | u025389922 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["i=list(map(int, input().split()))\n \nif i[0]==i[1] | i[0]==i[2] | i[1]==i[2]:\n if i[0]==i[1] & i[0]==i[2] & i[1]==i[2]:\n\tprint('No')\n else:\n\tprint('Yes')\nelse:\n print('No')", "if A==B & A==C:\n\tprint('NO')\nif A==B | A==C | B==C:\n\tprint('YES')\nelse:\n print('NO')", "i=list(map(int, input().split... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s356794215', 's435244901', 's775432319', 's796202480', 's797388634', 's873084366', 's634222019'] | [2940.0, 2940.0, 2940.0, 3064.0, 2940.0, 3060.0, 3060.0] | [19.0, 17.0, 17.0, 18.0, 19.0, 17.0, 17.0] | [177, 87, 162, 163, 177, 151, 167] |
p02771 | u025501820 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['nums = list(map(int, input.split(" ")))\nif len(set(nums)) == 2:\n print("Yes")\nelse:\n print("No")\n', 'nums = list(map(int, input().split(" ")))\nif len(set(nums)) == 2:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s880754388', 's091496025'] | [2940.0, 2940.0] | [16.0, 17.0] | [103, 105] |
p02771 | u026862065 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a, b, c = map(int, input().split())\nif a == b == c or a != b != c:\n print("No")\nelse:\n print("Yes")', 'l = set(map(int, input().split()))\nif len(l) == 2:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s492680039', 's520938295'] | [2940.0, 2940.0] | [17.0, 18.0] | [105, 89] |
p02771 | u030278108 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c = list(map(int, input().split()))\n\nif(a==b and a!=c) or (a==c and a!=b) or (c==b and a!=c):\n print("yes")\nelse:\n print("no")', 'a,b,c =list(map(int, input().split()))\n\nif(a==b and a!=c):\n print("yes")\nelif(a==c and b!=c):\n print("yes")\nelif (b==c and b!=a):\n print("yes")\nelse:\n p... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s016980993', 's167951513', 's323712067', 's346051532', 's395937659', 's441330338', 's580077354', 's601524090', 's617157718', 's637441084', 's752784242', 's769706694', 's828963711', 's897141136', 's935497295', 's951594292', 's962488541', 's980388493', 's670461793'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 20.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 17.0, 17.0, 28.0, 17.0, 17.0, 17.0, 17.0] | [136, 174, 158, 162, 232, 164, 185, 128, 108, 95, 230, 104, 109, 135, 170, 129, 128, 170, 162] |
p02771 | u030410515 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['A,B,C=map(int,input().split())\n\nif (A==B and B==C):\n print("No")\nelif(A!=B and B!=C):\n print("No")\nelse:\n print("Yes")\n', 'A,B,C=map(int,input().split())\n\nif(A==B and (B==C and A==C)):\n print("No")\n\nelif(A!=B and (B!=C and A!=C)):\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s322279939', 's565822590'] | [2940.0, 3060.0] | [18.0, 17.0] | [128, 149] |
p02771 | u032955959 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c=int(input().split())\nif a==b and a!=c:\n print("Yes")\nelif b==c and b!=a:\n print("Yes")\nelif c==a and c!=b:\n print("Yes")\nelse:\n print("No")\n \n', 'A,B,C=int(input())\nif A==B and A!=C:\n print("Yes")\nelif B==C and B!=A:\n print("Yes")\nelif C==A and C!=B:\n print("Yes")\nelse:\n print("No")\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s206529318', 's366444412', 's466951723', 's569448617', 's922928200', 's959708100', 's503224892'] | [2940.0, 3064.0, 2940.0, 2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 17.0] | [153, 145, 141, 145, 158, 153, 157] |
p02771 | u033642300 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["def main():\n a, b, c = map(int, input().split())\n if (a == b and b != c) or (b == c and a != b):\n print('Yes')\n else:\n print('No')\nmain()", "def main():\n a, b, c = map(int, input().split())\n if (a == b and b != c) or (b == c and a != b) or (a == c and a != b):\n print('Yes'... | ['Wrong Answer', 'Accepted'] | ['s433670534', 's322892743'] | [9172.0, 9096.0] | [27.0, 29.0] | [160, 183] |
p02771 | u036340997 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["n = int(input())\ndic = {}\nm = 0\nfor i in range(n):\n s = input()\n if s in dic:\n dic[s] += 1\n m = max(m, dic[s])\n else:\n dic[s] = 1\n m = max(m, dic[s])\nans = []\nfor s in dic:\n if dic[s] == m:\n ans.append(s)\nprint('\\n'.join(ans.sort()))", "print('Yes' if len(set(input().split()))==2 el... | ['Runtime Error', 'Accepted'] | ['s664159549', 's566569369'] | [3064.0, 2940.0] | [18.0, 17.0] | [252, 54] |
p02771 | u036492525 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a=list(map(int,input().split()))\nif a[0]==a[1]:\n\tif a[1] == a[2]:\n\t\tprint("No")\n\telse:\n\t\tprint("Yes")\nelse:\n\tif a[1] == a[2]:\n\t\tprint("Yes")\n\telse:\n\t\tprint("No")\n', 'a=sorted(list(map(int,input().split())))\nif a[0]==a[1]:\n\tif a[1] == a[2]:\n\t\tprint("No")\n\telse:\n\t\tprint("Yes")\nelse:... | ['Wrong Answer', 'Accepted'] | ['s942570134', 's638642097'] | [2940.0, 3060.0] | [18.0, 17.0] | [163, 170] |
p02771 | u038819082 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["A=map(list(int,input().split()))\nB=len(set(A))\nif B==2:\n print('Yes')\nelse:\n print('No')", "N=int(input())\nA=list(map(int,input().split()))\ng='APPROVED'\nfor i in range(N):\n if A[i]%2 == 0:\n if A[i]%3 != 0 and A[i]%5 != 0:\n g='DENIED'\n break\nprint(g)", "N=int(input())... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s248595345', 's618700486', 's674207191', 's087485447'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [94, 189, 173, 94] |
p02771 | u041046014 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a=list(map(int,input().split()))\nprint(a)\nif not(a[0]==a[1]==a[2]) and (a[0]==a[1] or a[1]==a[2] or a[0]==a[2]):\n print("YES")\nelse:\n print("NO")\n', 'a=list(map(int,input().split()))\na.sort()\nif (a[0]==a[1] and a[1]!=a[2]):\n print("YES")\nelse:\n print("NO")', 'a=list(map(int,input().split()))\nprint(a)\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s055673195', 's555967053', 's674581487', 's703252104', 's751222985', 's568801538'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0] | [148, 108, 118, 132, 108, 117] |
p02771 | u041401317 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["def main():\n num = list(map(int,input().split()))\n if num.count(num[0]) == 2 or num.count(num[1]) == 2:\n print('YES')\n return\n\n print('NO')\n\n\nmain()\n", "def main():\n num = list(map(int,input().split()))\n if num.count(num[0]) == 2 or num.count(num[1]) == 2:\n print('Yes'... | ['Wrong Answer', 'Accepted'] | ['s063126707', 's009519412'] | [2940.0, 2940.0] | [17.0, 18.0] | [172, 172] |
p02771 | u041529470 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['x, y, z = input().split(" ")\na = int(x)\nb = int(y)\nc = int(z)\npoor = False\nif a == b == c:\n print(\'no\')\nelse:\n if a == b:\n poor = not poor\n\n if a == c:\n poor = not poor\n\n if b == c:\n poor = not poor\n\n if poor:\n print(\'yes\')\n else:\n print(\'n... | ['Wrong Answer', 'Accepted'] | ['s535351559', 's000169286'] | [3060.0, 3060.0] | [17.0, 17.0] | [296, 296] |
p02771 | u043964516 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a=input()\nb=input()\nc=input()\nif(a==b and a == c):\n print("No")\nelif(a != b and b == c):\n print("Yes")\nelif(a != b and a == c):\n print("Yes")\nelif(a!=c and a == b):\n print("Yes")\nelse:\n print("No")', 'a=input()\nb=a[2]\nc=a[4]\na=a[0]\nif(a==b and a == c):\n print("No")\nelif(a != b and b == c):\n ... | ['Runtime Error', 'Accepted'] | ['s770320862', 's805939623'] | [3060.0, 3060.0] | [18.0, 17.0] | [202, 203] |
p02771 | u044459372 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["def equ(a,b):\n return 1*(a==b)\na,b,c = map(input().split())\nans = equ(a,b)+equ(b,c) +equ(c,a)\nprint('Yes' if ans ==1 else 'No')\n", "def equ(a,b):\n return 1*(a==b)\na,b,c = map(int,input().split())\nans = equ(a,b)+equ(b,c) +equ(c,a)\nprint('Yes' if ans ==1 else 'No')"] | ['Runtime Error', 'Accepted'] | ['s698030587', 's676948146'] | [2940.0, 2940.0] | [18.0, 18.0] | [129, 132] |
p02771 | u045235021 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['n = input().split()\nn= [int(i) for i in n]\nn.sort()\n\n\nif n[1] == n[0]:\n if n[2]== n[1]:\n print("No")\n \nelif n[2] == n[1]: print("Yes")\nelse: print("No")\n', 'n = input().split()\nn= [int(i) for i in n]\nn.sort()\n\nif n[1] == n[0]:\n if n[2]==n[1]:\n print("No")\n else:\n print("Y... | ['Wrong Answer', 'Accepted'] | ['s823167200', 's474799559'] | [2940.0, 3064.0] | [17.0, 19.0] | [160, 197] |
p02771 | u047197186 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a, b, c = [int(elem) for elem in input().split()]\n\nif a == b and a != c:\n return "Yes"\nif a == c and a != b:\n return "Yes"\nif b == c and a != b:\n return "Yes"\nelse:\n return "No"', 'a, b, c = [int(elem) for elem in input().split()]\n\nif a == b and a != c:\n print("Yes")\nelif a == c and a != b:\n print... | ['Runtime Error', 'Accepted'] | ['s127167285', 's286279579'] | [3064.0, 3060.0] | [19.0, 17.0] | [181, 185] |
p02771 | u047816928 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["print('Yes' if set(map(int, input().split()))==2 else 'No')", "print('Yes' if len(set(map(int, input().split())))==2 else 'No')"] | ['Wrong Answer', 'Accepted'] | ['s953377558', 's832139692'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 64] |
p02771 | u048956777 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a, b ,c = map(int, input().split())\n\nif (a == b == c) or (a != b != c):\n print("No")\nelse:\n print("Yes")', 'a, b ,c = map(int, input().split())\n\nif (a == b == c) or (a != b and b != c and a!= c):\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s112479101', 's010769109'] | [2940.0, 2940.0] | [17.0, 17.0] | [110, 126] |
p02771 | u049725710 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a,b,c=map(map(int,input().split()))\ns=set(a,b,c)\nif len(s)==2:\n print("Yes")\nelse:\n print("No")', 'import sys\nmyset=set()\nfor n in range(3):\n\tmyset[n-1].add(sys.argv[n])\nif len(myset)==2:\n\tprint("Yes")\nelse:\n\tprint("No")', 'a,b,c=map(int,input().split())\ns=set([a,b,c])\nif len(s)==2:\n print("Yes")... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s126633042', 's624135335', 's033786804'] | [2940.0, 2940.0, 2940.0] | [18.0, 19.0, 18.0] | [97, 121, 94] |
p02771 | u050706842 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['A, B, C = list(map(int, input().split()))\n\nif A == B and A != C:\n print("YES")\nelif A == C and A != B:\n print("YES")\nelif B == C and A != B:\n print("YES")\nelse:\n print("NO")', 'A, B, C = list(map(int, input().split()))\n\nif A == B and A != C:\n print("Yes")\nelif A == C and A != B:\n print... | ['Wrong Answer', 'Accepted'] | ['s473459316', 's522430245'] | [3060.0, 3060.0] | [18.0, 17.0] | [185, 185] |
p02771 | u054514819 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["L = set(list(map(int, input().split())))\nif len(L)==2:\n print('YES')\nelse:\n print('NO')", "L = set(list(map(int, input().split())))\nif len(L)==2:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s351619956', 's155859944'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 89] |
p02771 | u054622560 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['print(sys.stdin)', 'if len(set(input().split())) == 2:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s587805813', 's836326160'] | [2940.0, 2940.0] | [17.0, 17.0] | [16, 69] |
p02771 | u057325497 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['x = input().split()\n\nif x[0]== x[1] != x[2]:\n print("yes")\nelif x[1] == x[2] != x[0]:\n print("yes")\nelif x[2] == x[0] != x[1]:\n print("yes")\nelse:\n print("No")', 'x = input().split(\' \')\n\nif x[0] == x[1] != x[2]:\n print("yes")\nelif x[1] == x[2] != x[0]:\n print("yes")\nelif x[2] == x... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s039222009', 's078586813', 's185787214', 's202459025', 's264565009', 's413774437', 's646027605', 's739867246', 's740603840', 's831402367', 's028541205'] | [3060.0, 3060.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 20.0, 17.0, 17.0, 20.0, 17.0, 17.0, 17.0, 17.0] | [172, 176, 161, 172, 193, 176, 218, 176, 218, 196, 176] |
p02771 | u057362336 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["a,b,c=map(int,input())\nif (a!=b and b!=c and c!=a) or (a==b and b==c):\n print('No')\nelse:\n print('Yes')\n", "a,b,c=map(int,input().split())\nif (a!=b and b!=c and c!=a) or (a==b and b==c):\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s413281077', 's455276817'] | [9148.0, 9156.0] | [26.0, 31.0] | [106, 113] |
p02771 | u057415180 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["a, b, c = map(int, input().split())\nans = 'No'\nif a == b and b == c:\n ans = 'No'\nelif a != b and b != c:\n ans ='No'\nelse:\n ans ='Yes'\nprint(ans)", "a = set(map(int, input().split()))\nif len(a) == 2:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s141446924', 's342595357'] | [2940.0, 2940.0] | [18.0, 17.0] | [153, 89] |
p02771 | u057964173 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['import sys\ndef input(): return sys.stdin.readline().strip()\nfrom collections import Counter\ndef resolve():\n n=int(input())\n l=[input() for i in range(n)]\n l.sort()\n c=Counter(l)\n maxl=[]\n syutugenmax=max(c.values())\n for name,kazu in c.items():\n if kazu==syutugenmax:\n ... | ['Runtime Error', 'Accepted'] | ['s972047607', 's774459422'] | [3316.0, 3060.0] | [21.0, 17.0] | [387, 143] |
p02771 | u059684599 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["N = int(input())\nA = list(map(int,input().split()))\nans = 'APPROVED'\nfor a in A:\n if a % 2 == 0:\n if a % 3 != 0 and a % 5 != 0:\n ans = 'DENIED'\n exit()\nprint(ans)", 'print("Yes" if len(set(map(int, input().split())))==2 else "No")'] | ['Runtime Error', 'Accepted'] | ['s826579970', 's795725550'] | [3060.0, 2940.0] | [20.0, 17.0] | [194, 64] |
p02771 | u060012100 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['A = map(int,input().split())\nif len(set(A)) == 2:\n print("yes")\nelse:\n print("No")', 'A = map(int, input().split())\nif len(set(A)) == 2:\n print("yes")\nelse:\n print("No")', 'A = map(int, input().split())\nif len(set(A) == 2):\n print("yes")\nelse:\n print("No")', 'A = map(int,input().split())\nif len(set... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s138988203', 's442244659', 's511330560', 's845135698', 's619461902'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0, 17.0, 17.0] | [84, 85, 85, 84, 89] |
p02771 | u061539997 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['a = input().split()\nif a[0] == a[1] and a[0] != a[2]:\n print("No")\nelif a[0] == a[2] and a[0] != a[1]:\n print("No")\nelif a[1] == a[2] and a[1] != a[0]:\n print("No")\nelse:\n print("Yes")', 'a = input().split()\nif a[0] == a[1] and a[0] != a[2]:\n print("Yes")\nelif a[0] == a[2] and a[0] != a[1]:\... | ['Wrong Answer', 'Accepted'] | ['s608146164', 's303822850'] | [3060.0, 3060.0] | [17.0, 17.0] | [196, 198] |
p02771 | u063346608 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['A,B,C = map(int,input().split())\n\nif A == B and A != C :\n\tanswer\u3000= "Yes"\n \nelif A == C and A != B :\n\tanswer\u3000= "Yes"\n \nelif B == C and B != A :\n\tanswer\u3000= "Yes"\nelse:\n\tanswer = "No"\n\nprint(answer)\n ', 'A,B,C = map(int,input().split())\n\nif (A==B) and A !=C:\n\tprint("Yes")\nel... | ['Runtime Error', 'Accepted'] | ['s023416271', 's105987283'] | [3064.0, 9096.0] | [23.0, 30.0] | [211, 163] |
p02771 | u064445353 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['import collections\n\nn = int(input())\ns = [input() for i in range(n)]\n\nc = collections.Counter(s).most_common()\nans = [k for k, v in c if c[0][1] == v]\nans.sort()\n\nfor i in ans:\n print(i)', 'a, b, c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\n\nif a == b and a != c:\n print("Yes")\nelif a ==... | ['Runtime Error', 'Accepted'] | ['s766257666', 's537403298'] | [3316.0, 3060.0] | [21.0, 19.0] | [189, 202] |
p02771 | u065994196 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['arr=list(map(int,input().strip().split()))[:3]\nif(arr[0]==arr[1] and arr[0]!=arr[2]):\n print("Yes")\nelif(arr[1]==arr[2] and arr[1]!=arr[0]):\n print("Yes")\nelif(arr1[0]==arr[2] and arr1[0]!=arr[1]):\n print("Yes")\nelse:\n print("No")', 'arr=list(map(int,input().strip().split()))[:3]\ndict1={}\nfor i in arr:\... | ['Runtime Error', 'Accepted'] | ['s430532223', 's713052730'] | [3064.0, 3064.0] | [17.0, 17.0] | [234, 195] |
p02771 | u067694718 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['n = int(input())\ns_list = [input() for i in range(n)]\ns_set = set(s)\nmax = 0\nmax_elements = []\nfor i in s_set:\n c = s_list.count(i)\n if c > max:\n max = c\n max_elements = [i]\n if c == max and i not in max_elements:\n max_elements.append(i)\n\nfor i in sorted(max_elements):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s237278832', 's320113488', 's575263433', 's472004349'] | [3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0, 17.0] | [313, 318, 179, 57] |
p02771 | u068142202 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['from collections import Counter\n\nn = int(input())\ns = [input() for _ in range(n)]\nans = []\n\ncharctor_count = Counter(s)\nmax_count = max(charctor_count.values())\nfor k, v in charctor_count.items():\n if v == max_count:\n ans.append( k)\nprint("\\n".join(sorted(ans)))', 'a, b ,c = map(int,input().split())\n... | ['Runtime Error', 'Accepted'] | ['s127151975', 's642623193'] | [3316.0, 3060.0] | [21.0, 18.0] | [266, 150] |
p02771 | u071361440 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ['lst=set(map(int,input().split(" ")))\nif len(set)==2:\n print("Yes")\nelse:print("No")', '#!/usr/bin/env python\nn=int(input())\nlst=list(map(int,input().split()))\n\nfor i in range(0,n):\n if lst[i]%2==0:\n if lst[i]%3==0 or lst[i]%5==0:\n x=1\n \n else: x=0\nif x==1:print("AP... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s126695603', 's433557074', 's855440949', 's965534011', 's857190774'] | [2940.0, 3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 22.0, 18.0, 17.0, 17.0] | [84, 247, 139, 85, 84] |
p02771 | u074687136 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["A, B, C = input().rstrip().split('')\n\nif A == B == C:\n print('No')\nelif A == B or B == C or C == A:\n print('Yes')\nelse:\n print('No')", "A, B, C = input().rstrip().split(' ')\n\nif A == B == C:\n print('No')\nelif A == B or B == C or C == A:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s747746147', 's601919097'] | [2940.0, 2940.0] | [17.0, 17.0] | [135, 136] |
p02771 | u076306174 | 2,000 | 1,048,576 | A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers. You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`. | ["A,B,C=list(map(int, input().split()))\n\nif A==B and B==C or A!=B and B!=C and C!=A:\n print('No')\nelse\n print('Yes')\n", "A,B,C=list(map(int, input().split()))\n\nif A==B and B==C or A!=B and B!=C and C!=A:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s435228519', 's556113282'] | [2940.0, 2940.0] | [17.0, 17.0] | [121, 121] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.