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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02625 | u968166680 | 2,000 | 1,048,576 | Count the pairs of length-N sequences consisting of integers between 1 and M (inclusive), A_1, A_2, \cdots, A_{N} and B_1, B_2, \cdots, B_{N}, that satisfy all of the following conditions: * A_i \neq B_i, for every i such that 1\leq i\leq N. * A_i \neq A_j and B_i \neq B_j, for every (i, j) such that 1\leq i < j\leq N. Since the count can be enormous, print it modulo (10^9+7). | ['MOD = 1000000007\n\nCOM_MAX = 10 ** 6\n\nfac, finv, inv = [0] * (COM_MAX + 1), [0] * (COM_MAX + 1), [0] * (COM_MAX + 1)\nfac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1\n\nfor i in range(2, COM_MAX + 1):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef com(n, r):\n if n < 0 or r < 0 or n < r:\n return 0\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD\n\n\ndef perm(n, r):\n if n < 0 or r < 0 or n < r:\n return 0\n return fac[n] * finv[n - r] % MOD\n\n\ndef mod_com_once(n, r, MOD):\n if n < r or n < 0 or r < 0:\n return 0\n r = min(r, n - r)\n numer = denom = 1\n for i in range(n - r + 1, n + 1):\n numer = numer * i % MOD\n for i in range(1, r + 1):\n denom = denom * i % MOD\n return numer * pow(denom, MOD - 2, MOD) % MOD\n', "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, M = map(int, readline().split())\n\n COM_MAX = M\n\n fac, finv, inv = [0] * (COM_MAX + 1), [0] * (COM_MAX + 1), [0] * (COM_MAX + 1)\n fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1\n\n for i in range(2, COM_MAX + 1):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n def com(n, r):\n if n < 0 or r < 0 or n < r:\n return 0\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD\n\n def perm(n, r):\n if n < 0 or r < 0 or n < r:\n return 0\n return fac[n] * finv[n - r] % MOD\n\n ans = 0\n for k in range(N + 1):\n tmp = perm(M - k, N - k) * com(N, k) % MOD\n if k & 1:\n tmp *= -1\n ans = (ans + tmp) % MOD\n\n ans = ans * perm(M, N) % MOD\n\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s459037140', 's505446438'] | [127384.0, 68068.0] | [1068.0, 854.0] | [857, 1062] |
p02626 | u330912904 | 2,000 | 1,048,576 | There are N piles of stones. The i-th pile has A_i stones. Aoki and Takahashi are about to use them to play the following game: * Starting with Aoki, the two players alternately do the following operation: * Operation: Choose one pile of stones, and remove one or more stones from it. * When a player is unable to do the operation, he loses, and the other player wins. When the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile. In such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins. If this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print `-1` instead. | ['# AFTER EDITORIAL\n\n\ndef solve(ls):\n import math\n\n x, y, *ls = ls\n z = x + y\n s = 0\n for a in ls:\n s ^= a\n\n #\n # Max a <= x s.t.\n # 0 = NimSum(a, (x + y) - a, ls)\n # <=>\n # Max a <= x s.t.\n # ∃b.\n \n # a ^ b = NimSum(ls)\n # <=>\n # Max a <= x s.t.\n # ∃b.\n \n # a ^ b = NimSum(ls)\n #\n\n #\n # Thus it amounts to solve\n # a ^ b = s\n \n #\n # which is bit-wise independent as\n # a b ^ &\n # 0 0 0 0\n # 0 1 1 0\n # 1 0 1 0\n # 1 1 0 1\n #\n\n if (z - s) < 0 or (z - s) % 2 == 1:\n return -1\n\n t = (z - s) // 2\n s_t = s & t\n\n if s_t > 0 or t > x:\n return -1\n\n a = t\n b = t\n first_set = math.floor(math.log2(s))\n for i in range(first_set + 1)[::-1]:\n k = 1 << i\n if s & k:\n if (a | k) <= x: # Greedy is optimal\n a = a | k\n else:\n b = b | k\n return x - a\n\n\ndef main(istr, ostr):\n n = int(istr.readline().strip())\n ls = list(map(int, istr.readline().strip().split()))\n result = solve(ls)\n print(result, file=ostr)\n\n\nif __name__ == "__main__":\n import sys\n\n main(sys.stdin, sys.stdout)\n', '# AFTER EDITORIAL\n\n\ndef solve(ls):\n import math\n\n x, y, *ls = ls\n z = x + y\n s = 0\n for a in ls:\n s ^= a\n\n #\n # Max a <= x s.t.\n # 0 = NimSum(a, (x + y) - a, ls)\n # <=>\n # Max a <= x s.t.\n # ∃b.\n \n # a ^ b = NimSum(ls)\n # <=>\n # Max a <= x s.t.\n # ∃b.\n \n # a ^ b = NimSum(ls)\n #\n\n #\n # Thus it amounts to solve\n # a ^ b = s\n \n #\n # which is bit-wise independent as\n # a b ^ &\n # 0 0 0 0\n # 0 1 1 0\n # 1 0 1 0\n # 1 1 0 1\n #\n\n if (z - s) < 0 or (z - s) % 2 == 1:\n return -1\n\n t = (z - s) // 2\n s_t = s & t\n\n if s_t > 0 or t > x:\n return -1\n\n a = t\n b = t\n first_set = math.floor(math.log2(s + 1))\n for i in range(first_set + 1)[::-1]:\n k = 1 << i\n if s & k:\n if (a | k) <= x: # Greedy is optimal\n a = a | k\n else:\n b = b | k\n if a == 0:\n return -1\n return x - a\n\n\ndef main(istr, ostr):\n n = int(istr.readline().strip())\n ls = list(map(int, istr.readline().strip().split()))\n result = solve(ls)\n print(result, file=ostr)\n\n\nif __name__ == "__main__":\n import sys\n\n main(sys.stdin, sys.stdout)\n'] | ['Runtime Error', 'Accepted'] | ['s391657354', 's745265216'] | [9372.0, 9300.0] | [30.0, 26.0] | [1353, 1390] |
p02626 | u340781749 | 2,000 | 1,048,576 | There are N piles of stones. The i-th pile has A_i stones. Aoki and Takahashi are about to use them to play the following game: * Starting with Aoki, the two players alternately do the following operation: * Operation: Choose one pile of stones, and remove one or more stones from it. * When a player is unable to do the operation, he loses, and the other player wins. When the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile. In such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins. If this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print `-1` instead. | ['print(-1)', 'import sys\nfrom functools import lru_cache\n\n\ndef solve(n, aaa):\n if n == 2:\n h, m = divmod(sum(aaa), 2)\n if m == 1 or h > aaa[0]:\n return -1\n return aaa[0] - h\n\n x = 0\n for a in aaa[2:]:\n x ^= a\n a0, a1 = aaa[:2]\n s = a0 + a1\n\n if s & 1 != x & 1:\n return -1\n\n b = 1 << 40\n MASK = (b << 1) - 1\n\n @lru_cache(maxsize=None)\n def dfs(p, b):\n if b == 0:\n return p\n m = (MASK ^ (b - 1)) << 1\n q = p ^ x & m\n if x & b == 0:\n if s >= p + q + 2 * b:\n if p | b <= a0:\n return dfs(p | b, b >> 1)\n else:\n return -1\n return dfs(p, b >> 1)\n else:\n if s < p + q + b:\n return -1\n if p | b <= a0:\n ret = dfs(p | b, b >> 1)\n if ret != -1:\n return ret\n return dfs(p, b >> 1)\n\n ret = dfs(0, b)\n\n if ret <= 0:\n return -1\n return a0 - ret\n\n\nn, *aaa = map(int, sys.stdin.buffer.read().split())\nprint(solve(n, aaa))\n'] | ['Wrong Answer', 'Accepted'] | ['s279180843', 's752483552'] | [9056.0, 9664.0] | [33.0, 34.0] | [9, 1116] |
p02626 | u608088992 | 2,000 | 1,048,576 | There are N piles of stones. The i-th pile has A_i stones. Aoki and Takahashi are about to use them to play the following game: * Starting with Aoki, the two players alternately do the following operation: * Operation: Choose one pile of stones, and remove one or more stones from it. * When a player is unable to do the operation, he loses, and the other player wins. When the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile. In such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins. If this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print `-1` instead. | ['import sys\n\ndef solve():\n input = sys.stdin.readline\n N = int(input())\n A = [int(a) for a in input().split()]\n xorR = 0\n for i in range(2, N):\n xorR ^= A[i]\n rbit = [0] * 40\n K = xorR\n for i in range(40):\n rbit[i] = K % 2\n K //= 2\n \n D = A[0] + A[1] - xorR\n if D < 0 or D % 2 == 1:\n print(-1)\n return 0\n else:\n D //= 2\n K = D\n dbit = [0] * 40\n for i in range(40):\n dbit[i] = K % 2\n K //= 2\n A0, A1 = 0, 0\n for i in range(40):\n if rbit[39 - i] == dbit[39 - i] == 1:\n print(-1)\n break\n else:\n if rbit[39 - i] == 1:\n if (A0 + pow(2, 39 - i)) ^ D <= A[0]:\n A0 += pow(2, 39 - i)\n else:\n A1 += pow(2, 39 - i)\n if A0 > 0: print(A[0] - A0)\n else: print(-1)\n\n return 0\n\nif __name__ == "__main__":\n solve()', 'import sys\n\ndef solve():\n input = sys.stdin.readline\n N = int(input())\n A = [int(a) for a in input().split()]\n xorR = 0\n for i in range(2, N):\n xorR ^= A[i]\n rbit = [0] * 41\n K = xorR\n for i in range(41):\n rbit[i] = K % 2\n K //= 2\n \n D = A[0] + A[1] - xorR\n if D < 0 or D % 2 == 1:\n print(-1)\n return 0\n else:\n D //= 2\n if D > A[0]:\n print(-1)\n return 0\n\n K = D\n dbit = [0] * 41\n for i in range(41):\n dbit[i] = K % 2\n K //= 2\n \n A0 = D\n for i in range(41):\n if rbit[40 - i] == dbit[40 - i] and rbit[40 - i] == 1:\n print(-1)\n return 0\n else:\n if rbit[40 - i] == 1:\n if A0 + pow(2, 40 - i) <= A[0]:\n A0 += pow(2, 40 - i)\n if A0 > 0: print(A[0] - A0)\n else: print(-1)\n\n return 0\n\nif __name__ == "__main__":\n solve()'] | ['Wrong Answer', 'Accepted'] | ['s234360512', 's452930395'] | [9232.0, 9272.0] | [30.0, 28.0] | [1002, 1016] |
p02626 | u875291233 | 2,000 | 1,048,576 | There are N piles of stones. The i-th pile has A_i stones. Aoki and Takahashi are about to use them to play the following game: * Starting with Aoki, the two players alternately do the following operation: * Operation: Choose one pile of stones, and remove one or more stones from it. * When a player is unable to do the operation, he loses, and the other player wins. When the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile. In such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins. If this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print `-1` instead. | ['# coding: utf-8\n# Your code here!\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\n\nn,*a = map(int,read().split())\n\nv = 0\nfor i in a[2:]:\n v ^= i\n\nw = a[0]+a[1]\n\nz = w-v\nif z&1 or z<0 or z&w:\n print(-1)\nelse:\n z //= 2\n \n #print(z,v,z&w)\n ans = z\n for i in range(60,-1,-1):\n m = 1<<i\n if v&m:\n if ans+m <= a[0]:\n ans += m\n #print(ans,i)\n\n if ans >= a[0] or ans==0: print(-1)\n else: print(a[0]-ans) \n \n \n \n \n \n\n\n\n\n', '# coding: utf-8\n# Your code here!\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\n\nn,*a = map(int,read().split())\n\nv = 0\nfor i in a[2:]:\n v ^= i\n\nw = a[0]+a[1]\n\nz = w-v\nif z&1==1 or z<0:\n print(-1)\nelse:\n z //= 2\n \n if z&v:\n print(-1)\n exit()\n\n ans = z\n for i in range(60,-1,-1):\n m = 1<<i\n if v&m:\n if ans+m <= a[0]:\n ans += m\n #print(ans,i)\n\n if ans > a[0] or ans==0: print(-1)\n else: print(a[0]-ans) \n \n \n \n \n \n\n\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s066408040', 's216144482'] | [9184.0, 9212.0] | [31.0, 32.0] | [589, 610] |
p02626 | u923270446 | 2,000 | 1,048,576 | There are N piles of stones. The i-th pile has A_i stones. Aoki and Takahashi are about to use them to play the following game: * Starting with Aoki, the two players alternately do the following operation: * Operation: Choose one pile of stones, and remove one or more stones from it. * When a player is unable to do the operation, he loses, and the other player wins. When the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile. In such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins. If this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print `-1` instead. | ['n=int(input())\na=list(map(int, input().split()))\nX=0\nfor i in a[2:]:X^=i\nm=a[0]+a[1]-X\nif m>a[0]or(m&X)!=0:exit(print(-1))\nl=1<<max(x.bit_length(),m.bit_length())\nwhile l > 0:\n if (m&l)!=0and(a|b)<=a[0]:a|=b\n b>>=1\nprint(a[0]-m if a!=0else-1)', 'n=int(input())\na=list(map(int,input().split()))\nx=0\nfor i in a[2:]:x^=i\nm=(a[0]+a[1]-x)//2\nif a[0]+a[1]!=x+m*2or m>a[0]or(x&m)!=0:exit(print(-1))\nl=1<<(max(x.bit_length(),m.bit_length())+1)\nwhile l>0:\n if((x&l)!=0)and((m|l)<=a[0]):m|=l\n l>>=1\nprint(a[0]-m if m!=0else-1)'] | ['Runtime Error', 'Accepted'] | ['s749655519', 's368252384'] | [9136.0, 9188.0] | [28.0, 28.0] | [242, 270] |
p02627 | u000875186 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a=input()\nif(a.islower()==True):\n print(a.upper())\nelse:\n print(a.lower())', 'a=input()\nif(a.islower()==True):\n print("A")\nelse:\n print("a")', 'a=input()\nif(a.islower()==True):\n print("a")\nelse:\n print("A")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s311998510', 's764894692', 's349180156'] | [8968.0, 8996.0, 8960.0] | [30.0, 27.0, 26.0] | [80, 68, 68] |
p02627 | u004233621 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nif a.upper() == True:\n print(\'A\')\nelse:\n print("a")', 'a = input()\nif a.isupper() == True:\n print(\'A\')\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s563007748', 's178370895'] | [9088.0, 9012.0] | [31.0, 28.0] | [65, 67] |
p02627 | u007381711 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["# -*- coding: utf-8 -*-\nimport sys\ninput = sys.stdin.readline\nN = int(input())\nab = [chr(ord('a') + i) for i in range(26)]\nj = 1\nwhile True:\n temp = 1000000000000001//(26**j)\n j+=1\n if temp<1:\n break\nans = ''\nfor i in range(1, j+2):\n ax = (N//(26**(i-1)))%26\n if ax==0:\n ax = 25\n ans += ab[ax]\n if N//(26**i)<1:\n print(ans[::-1])\n sys.exit()", "# -*- coding: utf-8 -*-\nimport sys\ninput = sys.stdin.readline\na = str(input())\nif a.isupper():\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s755632251', 's348911604'] | [9180.0, 9096.0] | [24.0, 33.0] | [360, 126] |
p02627 | u007550226 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['print(chr(ord(input())+32))', "if 'a' <= input() <= 'z':print('a')\nelse:print('A')"] | ['Wrong Answer', 'Accepted'] | ['s342900613', 's891892209'] | [8980.0, 9080.0] | [30.0, 25.0] | [27, 51] |
p02627 | u007738720 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["alf=input()\nif 'alf'.isupper():\n print('A')\nelse:\n print('a')\n ", "alf=input()\nif alf.isupper():\n print('A')\nelse:\n print('a')\n "] | ['Wrong Answer', 'Accepted'] | ['s074226791', 's487693266'] | [9020.0, 9012.0] | [29.0, 29.0] | [66, 64] |
p02627 | u007771307 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['n,m=map(int,input().split())\nl=list(map(int,input().split()))\ns=0\nl.sort()\nx=l[:m]\n \nprint(sum(x))\n', 's=input()\nif s.isupper():\n print("A")\nelse:\n print("a")\n'] | ['Runtime Error', 'Accepted'] | ['s458424483', 's926607252'] | [9156.0, 8936.0] | [27.0, 27.0] | [101, 62] |
p02627 | u011202375 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['N=input()\nif N.isupper()=="TRUE":\n print("A")\nelse:\n print("a")', 'N=input()\n\nif N.isupper()==True:\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s136431312', 's100869894'] | [9004.0, 9020.0] | [33.0, 30.0] | [69, 68] |
p02627 | u012820749 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['def main():\n c = input()\n if c.isupper():\n print(c.lower())\n else:\n print(c.upper())\n\nmain()\n', "def main():\n c = input()\n if c.isupper():\n print('A')\n else:\n print('a')\n \nmain()"] | ['Wrong Answer', 'Accepted'] | ['s585156657', 's584943288'] | [9016.0, 9088.0] | [26.0, 28.0] | [102, 90] |
p02627 | u014540405 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a = input()\nprint(a)\n\nif a.isupper():\n print('A')\nelse:\n print('a')", "a = input()\n\nif a.isupper():\n print('A')\nelse:\n print('a')"] | ['Wrong Answer', 'Accepted'] | ['s276890607', 's815421647'] | [8924.0, 9028.0] | [26.0, 28.0] | [73, 64] |
p02627 | u014562811 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["\ndef test(a):\n\tif tmp.isupper():\n\t\treturn 'A'\n\telse:\n\t\treturn 'a'\n \ntest(input())", "\ndef test(a):\n\tif a.isupper():\n\t\treturn 'A'\n\telse:\n\t\treturn 'a'\n \ntest(input())", "tmp = input()\nif tmp.isupper():\n print 'A'\nelse:\n print'a'", "def test(a):\n\tif a.isupper():\n\t\tprint('A')\n\telse:\n\t\tprint('a')\n\n \ntest(input())"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s030411720', 's490483102', 's697466699', 's282949872'] | [9080.0, 9076.0, 8944.0, 9084.0] | [25.0, 26.0, 25.0, 28.0] | [86, 84, 60, 86] |
p02627 | u016336953 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['num=int(input())\n\n\ndef num2alpha(num):\n if num<=26:\n return chr(64+num)\n elif num%26==0:\n return num2alpha(num//26-1)+chr(90)\n else:\n return num2alpha(num//26)+chr(64+num%26)\n\nans=num2alpha(num).lower()\n\nprint(ans)', 'str=input()\na=str.isupper()\nif a==True:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s033646897', 's994803127'] | [9096.0, 9092.0] | [25.0, 31.0] | [244, 75] |
p02627 | u021849254 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['print(input().swapcase())', "X=int(input())\nn=26\n\na=[]\nX_dumy = X\nout = ''\nwhile X_dumy>0:\n out = str(X_dumy%n)\n X_dumy = int(X_dumy/n)\n a.append(out)\n\nl = list('abcdefghijklmnopqrstuvwxyz')\nN=0\nfor x in a:\n a[N]=l[int(a[N])-1]\n N=N+1\npg = ''.join(a)\nprint(pg)", 'if input().isupper():\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s163490941', 's920653267', 's018042345'] | [9076.0, 9184.0, 9080.0] | [30.0, 27.0, 29.0] | [25, 236, 53] |
p02627 | u023632682 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s=str(input())\nS=s.swapcase()\nprint(S)', "s=str(input())\nif(s.islower()==True):\n print('a')\nelse:\n print('A')"] | ['Wrong Answer', 'Accepted'] | ['s948466074', 's889271030'] | [9008.0, 8916.0] | [29.0, 27.0] | [38, 73] |
p02627 | u025463382 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['if input().issuper():\n print("a")\nelse:\n print("a")', 'if input().isupper():\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s738184176', 's444504936'] | [9020.0, 8944.0] | [21.0, 26.0] | [53, 53] |
p02627 | u026643077 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['alpha = str(input())\nif str.isupper(alpha) = True:\n print("A")\nelse:\n print("a")', 'alpha = input()\nif alpha.isupper():\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s177411949', 's267461110'] | [9016.0, 8808.0] | [21.0, 31.0] | [82, 67] |
p02627 | u030879708 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['print(“aA”[input().isupper()])', 'print("aA"[input().isupper()])'] | ['Runtime Error', 'Accepted'] | ['s704583206', 's581466362'] | [8972.0, 9056.0] | [27.0, 25.0] | [34, 30] |
p02627 | u035885928 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["if(input().islower):print('a')\nelse: print('A')", "if (input().islower()):print('a')\nelse: print('A')"] | ['Wrong Answer', 'Accepted'] | ['s705715509', 's688504580'] | [9092.0, 8892.0] | [29.0, 29.0] | [47, 50] |
p02627 | u036492525 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["c = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\na=input()\n\nfor i in range(52):\n if c[i]== a:\n d = i + 26\n if d > 51:\n d = i-26\n print(c[d])\n exit(0)", 'c = \'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\'\n\na=input()\n\nfor i in range(52):\n if c[i]== a:\n if i > 25:\n print("A")\n else:\n print("a")\n exit(0)'] | ['Wrong Answer', 'Accepted'] | ['s609433497', 's379404137'] | [9092.0, 8920.0] | [33.0, 24.0] | [202, 202] |
p02627 | u040298438 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nprint(a.lower())', 'a = input()\nif a.isupper():\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s145035053', 's020149363'] | [8960.0, 8936.0] | [26.0, 28.0] | [28, 63] |
p02627 | u042347918 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['\nA = input()\n\n\n\nN = A.isupper()\n\nprint(N)\n\nif N == True:\n print("A")\nelse :\n print("a")', '\nA = input()\n\n\n\nN = A.isupper()\n\n#print(N)\n\nif N == True:\n print("A")\nelse :\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s601935695', 's581637427'] | [9092.0, 8756.0] | [32.0, 29.0] | [121, 122] |
p02627 | u054931633 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['n=int(input())\ni=1\na=0\nm=n\nwhile n-26**i>0:\n n=n-26**i\n i+=1\n a+=n**i \na \nans=""\nb=0\nl=[\'a\', \'b\', \'c\', \'d\', \'e\', \'f\', \'g\', \'h\', \'i\', \'j\', \'k\', \'l\', \'m\', \'n\', \'o\', \'p\', \'q\', \'r\', \'s\', \'t\', \'u\', \'v\', \'w\', \'x\', \'y\', \'z\']\nfor j in range(i):\n b=m%26\n m=m//26\n if b==0:\n m=m-1\n ans=l[b-1]+ans\nprint(ans)', 's=input()\nif s.isupper()==True:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s804011715', 's312427409'] | [9220.0, 9076.0] | [30.0, 32.0] | [337, 67] |
p02627 | u060793972 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a=input()\nprint('a' if a==a.lower() else 'a')", "a=input()\nprint('a' if a==a.lower() else 'A')"] | ['Wrong Answer', 'Accepted'] | ['s344916770', 's559928010'] | [9024.0, 9012.0] | [33.0, 30.0] | [45, 45] |
p02627 | u063346608 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['N,K = list(map(int,input().split()))\nP = list(map(int,input().split()))\n\ndef bubblesort(l):\n for index in range(len(l)-1, 0, -1):\n for low in range(index):\n if l[low] > l[low+1]:\n tmp = l[low+1]\n l[low+1] = l[low]\n l[low] = tmp\n return l\n\nbubblesort(P)\nsum = 0\nfor i in range(K):\n\tsum = sum + P[i]\nprint(sum)', 'a = input()\n\nif a.isupper():\n\tprint(a.upper())\nelse:\n\tprint(a)', 'a = input()\n\nif a.isupper():\n\tprint(A)\nelse:\n\tprint(a)', 'a = input()\n\nif a.isupper():\n\tprint("A")\nelse:\n\tprint("a")'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s348848185', 's564552725', 's919041373', 's059451397'] | [9144.0, 9004.0, 8952.0, 8984.0] | [27.0, 29.0, 29.0, 24.0] | [377, 62, 54, 58] |
p02627 | u068538925 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['n = int(input())\nlist_in = list(map(int, input().split()))\nq = int(input())\nfor i in range(q):\n bc = list(map(int, input().split()))\n for j in range(n):\n if list_in[j] == bc[0]:\n list_in[j] = bc[1]\n print(sum(list_in))', 'in_str = input()\nif in_str.isupper() == True:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s205361277', 's042702794'] | [9116.0, 9020.0] | [26.0, 31.0] | [245, 81] |
p02627 | u068750695 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s=input()\n\nprint(s.swapcase())', 's=input()\n\nif 65<=ord(s)<=90:\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s763947988', 's994099953'] | [9072.0, 9088.0] | [33.0, 33.0] | [30, 65] |
p02627 | u068891073 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['x = input()\n\nif x.islower():\n\tan = x.upper()\nelse:\n an = x.lower()\n\n print(an)', "a = input()\n\nif a.islower():\n print('A')\nelse:\n print('a')\n ", "a = input()\n\nif a.islower():\n print('a')\nelse:\n print('A')\n "] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s401567034', 's623536598', 's600435194'] | [8912.0, 8972.0, 8968.0] | [27.0, 26.0, 26.0] | [81, 63, 63] |
p02627 | u069978048 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\n\nif str.isupper(a) == ture :\n print("A")\nelse :\n ptint("a")', "a = input()\n \nif str.isupper(a):\n print('A')\nelse :\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s947206041', 's830420682'] | [8972.0, 9024.0] | [27.0, 32.0] | [73, 65] |
p02627 | u070581567 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['in = input()\n\nif in.isupper():\n print("A")\nelse:\n print("a")', 'tmp = input()\n\nif tmp.isupper():\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s910539732', 's351444774'] | [8964.0, 8964.0] | [29.0, 30.0] | [62, 68] |
p02627 | u078181689 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s=input()\nprint("a" if s=s.lower() else "A")', 's=input()\nprint("a" if s==s.lower() else "A")'] | ['Runtime Error', 'Accepted'] | ['s106276327', 's248579954'] | [8928.0, 8988.0] | [25.0, 27.0] | [44, 45] |
p02627 | u078276601 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['n = int(input())\na_list = list(map(int, input().split()))\nq = int(input())\n\nfor i in range(q):\n b, c = map(int, input().split())\n newlist = a_list\n for j in range(n):\n if newlist[j] == b:\n newlist[j] = c\n ans = sum(newlist)\n print(ans)\n', 'alpha = input()\nif alpha.upper()==alpha:\n print("A")\nelif alpha.lower()==alpha:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s426161542', 's292937165'] | [9164.0, 9056.0] | [34.0, 28.0] | [273, 97] |
p02627 | u079022116 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nif a.isupper():\n print(a.lower())\nelse:\n print(a)', "n = int(input())\nans = ''\nwhile n > 0:\n n -= 1\n ans += chr(97 + n%26)\n n //= 26\nprint(ans[::-1])", "a = input()\nif a.isupper():\n print('A')\nelse:\n print('a')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s059126252', 's320509883', 's949926744'] | [9032.0, 9164.0, 8944.0] | [25.0, 23.0, 33.0] | [67, 105, 64] |
p02627 | u079142126 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["c = input()\nprint('A' if ord('A') <= ord(A) <= ord('Z') else 'a')", "print('A' if ord('A') <= ord(input()) <= ord('Z') else 'a')"] | ['Runtime Error', 'Accepted'] | ['s785926808', 's179282525'] | [8896.0, 9076.0] | [22.0, 28.0] | [65, 59] |
p02627 | u081714930 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['letter=input()\n\nif letter==letter.upper():\n print(A)\nelse:\n print(B)', "letter=input()\n\nif letter==letter.upper():\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s907244517', 's828856644'] | [9088.0, 9020.0] | [22.0, 28.0] | [74, 78] |
p02627 | u084411645 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['n, k = input().split(" ")\nn = int(n)\nk = int(k)\na = [int(x) for x in input().split(" ")]\na.sort()\nans = 0\nfor i in range(k):\n ans += int(a[i])\nprint(ans)\n', "x = input()\nprint('A' if ord(x) > ord('z') else 'a') \n", "x = input()\nprint('A' if ord(x) < ord('A') else 'a') \n", "x = input()\nprint('A' if ord(x) < ord('a') else 'a') \n"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s605336007', 's629004385', 's806675401', 's796519542'] | [9108.0, 8972.0, 9076.0, 8984.0] | [23.0, 26.0, 26.0, 30.0] | [154, 54, 54, 54] |
p02627 | u085334230 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nif a.islower():\n print(a.upper())\n exit()\nelse:\n print(a.lower())\n exit()', 'a = input()\nif a.isupper():\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s943486960', 's796493625'] | [9104.0, 8948.0] | [28.0, 26.0] | [97, 63] |
p02627 | u089888152 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['# -*- coding: utf-8 -*-\n\na = input()\nif a.isupper():\n print(a.lower())\nelse:\n print(a.upper())\n', "# -*- coding: utf-8 -*-\n\na = input()\nif a.isupper():\n print('A')\nelse:\n print('a')\n"] | ['Wrong Answer', 'Accepted'] | ['s170105350', 's597326388'] | [8928.0, 9072.0] | [28.0, 31.0] | [101, 89] |
p02627 | u093943966 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['def c(inp):\n\tif inp.isupper():\n\t\treturn "A"\n\treturn "B"', 'a = input()\n\nif a.isupper():\n\tprint("A")\nelif a.islower():\n\tprint("a")'] | ['Wrong Answer', 'Accepted'] | ['s232035891', 's004628746'] | [8952.0, 9024.0] | [27.0, 31.0] | [55, 70] |
p02627 | u094300401 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\n\nif a.isupper() == True:\n print("A")\nelif a.islower() == True:\n print("a")\nelse:\n return', 'a = input()\n \nif a.isupper() == True and a.isalpha() == True:\n print("A")\nelif a.islower() == True and a.isalpha() == True:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s795789870', 's967305261'] | [9028.0, 8964.0] | [28.0, 26.0] | [103, 137] |
p02627 | u102776280 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['N = input()\nif(N.lower() = N):\n print("a")\nelse:\n print("A")', 'N = input()\nif(N.lower() = N):\n print("a")\nelse:\n print("A")', 'N = input()\nif(N.lower() == N):\n print("a")\nelse:\n print("A")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s559367061', 's918115403', 's986999149'] | [9012.0, 8712.0, 9020.0] | [23.0, 24.0, 29.0] | [62, 62, 63] |
p02627 | u106311097 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["#!python3.8\n# -*- coding: utf-8 -*-\n# abc171/abc171_a\nimport sys\n\ns2nn = lambda s: [int(c) for c in s.split(' ')]\nss2nn = lambda ss: [int(s) for s in list(ss)]\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [i2s() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\ndef main():\n a = i2s\n print('A' if a.isupper() else 'a')\n return\n\nmain()\n", "#!python3.8\n# -*- coding: utf-8 -*-\n# abc171/abc171_a\nimport sys\n\ns2nn = lambda s: [int(c) for c in s.split(' ')]\nss2nn = lambda ss: [int(s) for s in list(ss)]\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [i2s() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\ndef main():\n a = i2s()\n print('A' if a.isupper() else 'a')\n return\n\nmain()\n"] | ['Runtime Error', 'Accepted'] | ['s824212623', 's573832272'] | [9068.0, 9132.0] | [26.0, 28.0] | [501, 503] |
p02627 | u111473084 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["def main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n\n a = input()\n\n if ord('a') <= ord(a) <= ord('z'):\n print('a')\n else:\n print('A')\n \n\nmain()\n", "def main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n\n a = input()\n\n if ord('a') <= ord(a) <= ord('z'):\n print('a')\n else:\n print('A')\n \n\nmain()", "def main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n\n a = input()[:-1]\n\n if ord('a') <= ord(a) <= ord('z'):\n print('a')\n else:\n print('A')\n \n\nmain()"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s519328840', 's668563176', 's302001211'] | [9116.0, 9032.0, 9096.0] | [26.0, 25.0, 33.0] | [213, 212, 217] |
p02627 | u112247039 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['def freq(my_list):\n count = {} \n for i in my_list: \n count[i] = count.get(i, 0) + 1\n return count\n\nn = int(input())\nl = list(map(int, input().split()))\ns,f = sum(l), freq(l)\nfor _ in range(int(input())):\n x, y = map(int, input().split())\n if x in f:\n v = f[x]\n if y in f:\n f[y]+=v\n f.pop(x)\n else:\n f[y]=f.pop(x)\n s += (y-x)*v\n print(s)', "i= input()\nprint('A' if (ord(i)>64 and ord(i)<91) else 'a')"] | ['Runtime Error', 'Accepted'] | ['s142467331', 's832148138'] | [9056.0, 9036.0] | [26.0, 24.0] | [422, 59] |
p02627 | u115450288 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s = str(input())\nprint(s.lower())', 's = str(input())\nprint(s.lower())', "s = str(input())\na= 'A' if s.isupper() else 'a' ;\nprint(a)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s279862023', 's343465719', 's987577360'] | [9012.0, 9076.0, 9016.0] | [27.0, 27.0, 29.0] | [33, 33, 58] |
p02627 | u116484168 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a = input()\nbig = range('A', 'Z')\n\nif big.include(a):\n print 'A'\nelse:\n print 'a'\n", "a = input()\n\nprint('a') if a.islower() else print('A')\n"] | ['Runtime Error', 'Accepted'] | ['s231902565', 's134175951'] | [8892.0, 9016.0] | [24.0, 29.0] | [88, 55] |
p02627 | u123579949 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['if input().upper()==input():\n print("A")\nelse:\n print("a")', 'S=input()\nif S.upper()==S:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s840593046', 's264753497'] | [8924.0, 8964.0] | [22.0, 31.0] | [60, 58] |
p02627 | u124040548 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['import sys\n\ninput_list = sys.stdin.readlines()\n\ncount = 1\nget_count = 0\nget_value_count = 0\nfor i in input_list:\n get_values = i.split()\n if count == 1:\n get_value_count = int(get_values[0])\n get_count = int(get_values[1])\n else:\n if get_value_count == 1:\n print(get_values[0])\n else:\n get_values.sort()\n count_value = 1\n p = 0\n for c in get_values:\n if count_value > get_count:\n print(str(p))\n else:\n p = p + int(c)\n count_value = count_value + 1\n count = count + 1', 'input_line = input()\n \nif input_line.isupper() == True:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s639705356', 's938647849'] | [9204.0, 8896.0] | [26.0, 29.0] | [546, 87] |
p02627 | u127025777 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = str(input())\nif a == a.upper() :\n print(a.lower())\nelse :\n print(a.upper())', 'a = str(input())\nif a == a.upper() :\n print("A")\nelse :\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s537431879', 's267158012'] | [9020.0, 9092.0] | [28.0, 36.0] | [81, 69] |
p02627 | u127503735 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['if α.isupper() = True :\n print("A")\nelse:\n print("B")', 'α = input()\n\nif α.isupper() == True :\n print("A")\nif α.islower() == True :\n print("a")\n'] | ['Runtime Error', 'Accepted'] | ['s600985849', 's728893981'] | [8740.0, 9068.0] | [26.0, 37.0] | [56, 92] |
p02627 | u133583235 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nif a.islower:\n print("a")\nelse:\n print("A")', 'a = input()\nif a.islower():\n print("a")\nelse:\n print("A")'] | ['Wrong Answer', 'Accepted'] | ['s138339687', 's834066611'] | [8908.0, 9088.0] | [31.0, 30.0] | [57, 59] |
p02627 | u135197221 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s = input()\nprint(s.swapcase())', 's = input()\nprint("A") if s.isupper() else print("a")'] | ['Wrong Answer', 'Accepted'] | ['s038534265', 's882217464'] | [9088.0, 8996.0] | [24.0, 25.0] | [31, 53] |
p02627 | u135847648 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['def main():\n n = int(input())\n alphabets = [None] + [chr(ord("a") + x) for x in range(26)]\n \n \n \n \n \n \n\n \n cnt = 0\n m = n\n while m > 0:\n cnt += 1\n m -= 26 ** cnt\n #print(cnt)\n\n \n num = []\n for i in range(cnt):\n \n y = n % (26 ** (i+1))\n \n if y == 0:\n num += [26]\n else:\n n -= y\n num += [y // (26**i)]\n\n #print(num)\n\n ans = ""\n for s in num[::-1]:\n ans += alphabets[s]\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n', 'def main():\n s = input()\n alphabets = [chr(ord("a") + x) for x in range(26)]\n if s in alphabets:\n print("a")\n else:\n print("A")\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s854506665', 's207552826'] | [9152.0, 9092.0] | [30.0, 28.0] | [877, 194] |
p02627 | u136284779 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a=input()\nprint('a' if a.islower else 'A')", "a=input()\nprint('A' if a.islower() else 'a')", "a=input()\nprint('A' if a.islower() else 'a')", "a=input()\nprint('a' if a.islower() else 'A')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s280630880', 's438536478', 's625262947', 's500892863'] | [8892.0, 9028.0, 9040.0, 9072.0] | [24.0, 26.0, 30.0, 24.0] | [42, 44, 44, 44] |
p02627 | u137226361 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['import sys\nn = int(input())\nan = list(map(int, sys.stdin.readline().rstrip().split()))\nq = int(input())\n\nimport numpy as np\n\nsum = np.sum(an)\n\n\nfor _ in range(q):\n b,c = map(int, input().split())\n for i in range(n):\n if b == an[i]:\n an[i]=c\n sum += c-b\n print(sum)', "alpha = str(input())\n\nif alpha in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s011065160', 's025818989'] | [9164.0, 9044.0] | [24.0, 28.0] | [302, 99] |
p02627 | u146066372 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["n=int(input())\nans=''\nwhile n>=26:\n s=n%26\n n=n//26\n ans+=(chr(s+96))\nans+=(chr(n+96))\nprint(ans)", "n=int(input())\nA=list()\nans=''\nwhile n>=26:\n s=n%26\n n=n//26\n ans+=(chr(s+96))\nans+=(chr(n+96))\nprint(ans)", 'a=input()\n \nif str.isupper(a):\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s115305140', 's765405533', 's307198287'] | [9032.0, 9052.0, 8896.0] | [30.0, 32.0, 26.0] | [106, 115, 68] |
p02627 | u146803137 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | [" 1 ini = lambda : int(input())\n 2 inm = lambda : map(int,input().split())\n 3 inl = lambda : list(map(int,input().split()))\n 4 gcd = lambda x,y : gcd(y,x%y) if x%y else y\n 5 a = input()\n 6 if ord(a) < ord('a'):\n 7 print('A')\n 8 else: \n 9 print('a')\n", "import sys\n\nx = input()\nif ord(x) < 91:\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s231639510', 's780005596'] | [8860.0, 9092.0] | [23.0, 26.0] | [273, 75] |
p02627 | u147171757 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["letter = input()\n \nif letter.isUpper()==True:\n print('A')\nelse:\n print('a')\n ", "letter = input()\n\nif letter.isupper()==True:\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s639962650', 's815571504'] | [9020.0, 9028.0] | [27.0, 30.0] | [81, 76] |
p02627 | u151163404 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a = int(input())\n\nif a.islower():\n print('A')\nelse:\n print('a')", "a = input()\n \nif a.islower():\n print('A')\nelse:\n print('a')", "a = input()\n \nif a.islower():\n print('a')\nelse:\n print('A')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s059152001', 's838136024', 's482379119'] | [9140.0, 9016.0, 9020.0] | [26.0, 30.0, 29.0] | [65, 61, 61] |
p02627 | u153955689 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["A = input()\nprint('A') if A.issuper() else print('a')\n ", "A = input()\nprint('A') if A.isupper() else print('a')"] | ['Runtime Error', 'Accepted'] | ['s201248147', 's158957572'] | [9024.0, 8932.0] | [25.0, 24.0] | [56, 53] |
p02627 | u156931988 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['num = int(input())\nd = {"a":1,"b":2,"c":3,"d":4,"e":5,"f":6,"g":7,"h":8,"i":9,"j":10,"k":11,"l":12,"m":13,"n":14,"o":15,"p":16,"q":17,"r":18,"s":19,"t":20,"u":21,"v":22,"w":23,"x":24,"y":25,"z":0}\nop_d = {}\nfor i,j in d.items():\n op_d[j] = i\nans =""\nfor i in list(range(0,12))[::-1]:\n if(int(num/(26**i)) == 0 ):\n pass\n else:\n ans += op_d[int(num/(26**i))]\n num = num % 26**i;\nprint(ans)', 'a =input()\nif(a.islower):\n print("a")\nelse:\n print("A")', 'a =input()\nif(a.islower()):\n print("a")\nelse:\n print("A")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s523930860', 's642176607', 's701103239'] | [9188.0, 9024.0, 9080.0] | [26.0, 30.0, 33.0] | [417, 61, 63] |
p02627 | u159369286 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nif a.upper() == a\n print("A")\nelse:\n print("a")', 'n, k = map(int,input().split())\na = sorted(list(map(int,input().split())))\nprint(sum(a[:k]))', 'a = input()\nif a == a.upper():\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s024962391', 's121027093', 's990275518'] | [8860.0, 9156.0, 8956.0] | [25.0, 19.0, 29.0] | [65, 92, 66] |
p02627 | u161575842 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['S = input()\n\nif S.islower():\n print("A")\nelse:\n print("a")', 'S = input()\n\nif S.islower():\n print("a")\nelse:\n print("A")'] | ['Wrong Answer', 'Accepted'] | ['s262641101', 's335500801'] | [8996.0, 8972.0] | [30.0, 27.0] | [64, 64] |
p02627 | u162208209 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["α\u3000= input()\nif α.isupper():\n print('A')\nelse:\n print('a')", "α = input('input your favorite alpabet:')\nif α.isupper():\n print('A')\nelse:\n print('a')", "α\u3000= input('input your favorite alpabet:')\nif α.isupper():\n print('A')\nelif α.islower:\n print('a')\n", "a = input()\nprint('A' if a.isupper() else 'a')\n"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s029308599', 's207649020', 's665718997', 's014889479'] | [9008.0, 9172.0, 8936.0, 9012.0] | [21.0, 29.0, 27.0, 24.0] | [67, 95, 109, 47] |
p02627 | u163421511 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nans = a.lower() if a.upper() == a else a.upper()\nprint(ans)\n', 'a = input()\nans = "A" if a.upper() == a else "a"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s123927720', 's925043442'] | [8864.0, 9024.0] | [24.0, 31.0] | [72, 59] |
p02627 | u165612156 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a = input()\nif a == type.lower():\n print('a')\nelif a == type.upper():\n print('A') \n\t", "a = input()\nif a.islower():\n print('a')\nelif a.isupper():\n print('A') \n"] | ['Runtime Error', 'Accepted'] | ['s237347926', 's203208905'] | [8988.0, 8976.0] | [25.0, 27.0] | [90, 77] |
p02627 | u166201488 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["alfa = input()\nif str.isupper('alfa'):\n print('A')\nelse:\n print('a')", "alfa = input()\nif alfa.isupper():\n print('A')\nelse:\n print('a')"] | ['Wrong Answer', 'Accepted'] | ['s346474925', 's099872045'] | [9092.0, 9112.0] | [32.0, 26.0] | [70, 65] |
p02627 | u167681994 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["x = input()\nif X.isupper():\n print('A')\nelse:\n print('a')", "x = input()\nif x.isupper():\n print('A')\nelse:\n print('a')\n"] | ['Runtime Error', 'Accepted'] | ['s427750285', 's731858869'] | [8944.0, 8836.0] | [24.0, 27.0] | [59, 60] |
p02627 | u168416324 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s=input()\n\nif s>"A":\n print("a")\nelse:\n print("A")', 's=input()\n\nif s in "abcdefghijklmnopqrstuvwxyz":\n print("a")\nelse:\n print("A")'] | ['Wrong Answer', 'Accepted'] | ['s610007234', 's342029063'] | [9016.0, 9040.0] | [28.0, 31.0] | [52, 80] |
p02627 | u169200126 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a = input().strip()\nif a <= z:\n print('a')\nelse:\n print('A')", "a = input().strip()\n\nif a.isupper():\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s848915912', 's178733048'] | [8900.0, 9080.0] | [23.0, 33.0] | [62, 72] |
p02627 | u174536291 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["s = input()\nif s.isupper == True:\n print('A')\nelse:\n print('a')", 's = input()\nprint(str.swapcase(s))', "s = input()\nif s.isupper() == True:\n print('A')\nelse:\n print('a')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s708028769', 's927073618', 's890500956'] | [9088.0, 8924.0, 9012.0] | [27.0, 30.0, 28.0] | [65, 34, 67] |
p02627 | u174990305 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = str(input())\nans = str(upper(a))\nif a = ans:\n print("A")\nelse:\n print("a")', 'a = input()\nans = upper(a)\nif a = ans:\n print("A")\nelse:\n print("a")', 'a = input()\nans = upper(a)\nif a == ans:\n print("A")\nelse:\n print("a") ', 'a = input()\nans = a.upper()\nif a == ans:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s279874643', 's758318932', 's927872258', 's240913273'] | [8804.0, 8980.0, 9024.0, 8860.0] | [25.0, 27.0, 24.0, 29.0] | [80, 70, 72, 72] |
p02627 | u176165272 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['N = input()\nA = [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z]\nif N in A:\n print("A")\nelse:\n print("a")', 'word = input()\nA = ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]\nif word in A:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s971264306', 's458630446'] | [9080.0, 9108.0] | [22.0, 29.0] | [116, 174] |
p02627 | u179025808 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['2\n1 2\n3\n1 100\n2 100\n100 1000', "a = input()\nprint('A' if 'A' <= a <= 'Z' else 'a')"] | ['Runtime Error', 'Accepted'] | ['s738179861', 's724412219'] | [8956.0, 9016.0] | [23.0, 29.0] | [28, 50] |
p02627 | u182166469 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s=str(input())\nif s.isupper()=True:\n print("A")\nelse:\n print("a")', 's=str(input())\nif s.isupper()==True:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s473168814', 's272808791'] | [9004.0, 8960.0] | [23.0, 25.0] | [67, 68] |
p02627 | u185896732 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['import sys\ninput=sys.stdin.readline\nsys.setrecursionlimit(10**6)\n\ns=input().rstrip()\nif s.isupper():print(s.lower())\nelse:print(s.upper())', 'import sys\ninput=sys.stdin.readline\nsys.setrecursionlimit(10**6)\n\ns=input().rstrip()\nif s.isupper():print("A")\nelse:print("a")'] | ['Wrong Answer', 'Accepted'] | ['s131156649', 's060477474'] | [8892.0, 8848.0] | [25.0, 24.0] | [138, 126] |
p02627 | u187883751 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a = str(input())\nif a == isupper():\n print('A')\nelif a == islower():\n print('a')\n", "a = str(input())\nif a = ('A'-'Z'):\n print('A')\nelif a = ('a'-'z'):\n print('a')", "a=input()\nif a.isupper():\n print('A')\nelif a.lower():\n print('a')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s128305199', 's801375336', 's813821321'] | [9096.0, 8816.0, 9004.0] | [22.0, 26.0, 24.0] | [87, 84, 67] |
p02627 | u190178779 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['import sys\ni = input()\nif not ( i.isupper() or i.islower() ): sys.exit()\n\nif i.isupper(): print(i.lower())\nif i.islower(): print(i.upper())', "import sys\ni = input()\nif not ( i.isupper() or i.islower() ): sys.exit()\n\nif i.isupper(): print('A')\nif i.islower(): print('a')"] | ['Wrong Answer', 'Accepted'] | ['s848626713', 's492728151'] | [8924.0, 9096.0] | [26.0, 28.0] | [139, 127] |
p02627 | u192042624 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['import numpy as np\nimport sys\nimport math\nimport itertools\nimport collections\n\na = input()\nprint(a.swapcase())', 'import numpy as np\nimport sys\nimport math\nimport itertools\nimport collections\n\na = input()\n\nif a.isupper():\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s608591163', 's697098063'] | [27140.0, 27140.0] | [123.0, 125.0] | [110, 143] |
p02627 | u193771328 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['n=int(input())\na=[int(i) for i in input().split()]\nx=0\nfor i in a:\n x^=i\n\nb=[x^i for i in a]\nfor i in b:\n print(i,end=" ")', "a = str(input())\n\nif a.isupper():\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s982404323', 's542168458'] | [9040.0, 8840.0] | [25.0, 24.0] | [128, 69] |
p02627 | u194908327 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["import sys\n\nprint('アルファベットを入力')\na=input()\n\nb=ord(a)\n\nif b>=65 and b<=90:\n print('A')\n\nelif b>=97 and b<=122:\n print('a')\n\nelse:\n print('エラー')\n", "import sys\n\na=input()\nb=ord(a)\n\nif b>=65 and b<=90:\n print('A')\n\nelif b>=97 and b<=122:\n print('a')\n\nelse:\n print('エラー')\n"] | ['Wrong Answer', 'Accepted'] | ['s692282541', 's292919008'] | [8924.0, 9024.0] | [27.0, 33.0] | [177, 136] |
p02627 | u195355592 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['# coding cell (SUBMIT ONLY THIS CELL)\n\nS = input()\n\nif S.islower():\n print(S.upper())\nelse:\n print(S.lower())\n\n\n\n\n', '# coding cell (SUBMIT ONLY THIS CELL)\n\nS = input()\n\nif S.islower():\n print("a")\nelse:\n print("A")\n\n\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s273173377', 's912825053'] | [9084.0, 9072.0] | [29.0, 29.0] | [120, 108] |
p02627 | u196990064 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["a = input()\nprint('A' if a.islower() else 'a')", "s = input()\nif s.isupps = input()\nif s.isupper():\n print('A')\nelse:\n print('a')", "s = input()\nif s.isupper():\n print('A')\nelse:\n print('a')"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s015105976', 's073867991', 's394875917'] | [8976.0, 9012.0, 9116.0] | [32.0, 23.0, 26.0] | [46, 85, 59] |
p02627 | u197493441 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['M = int(input())\nif M == M.upper():\n print("A")\nelse:\n print("a")', "a = input()\nprint('A' if a.islower() else 'a')", "M = input()\nprint('A'if M.islower() else 'a')", "N = input()\nprint('A' if N.isupper() else 'a')"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s309761043', 's940788995', 's986852508', 's266008320'] | [8976.0, 8856.0, 9024.0, 9028.0] | [22.0, 28.0, 28.0, 29.0] | [67, 46, 45, 46] |
p02627 | u201584592 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['s=input()\nif s.lowercase():\n print("A")\nelse:\n print("a")', 's=input()\nif s.islower():\n print("A")\nelse:\n print("a")', 's=input()\nif s.islower():\n print("a")\nelse:\n print("A")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s665860373', 's683712469', 's162966001'] | [9028.0, 8988.0, 9016.0] | [20.0, 27.0, 24.0] | [59, 57, 57] |
p02627 | u206352909 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a=input()\nif a==a.upeer():\n print("A")\nelse:\n print("a")', 'a=input()\nif a==a.upper():\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s630319517', 's217418974'] | [9092.0, 9012.0] | [22.0, 25.0] | [58, 58] |
p02627 | u208133431 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['kotae = str(input())\nprint(kotae.swapcase())', 'kotae = str(input())\nif kotae.isupper() == True:\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s666622625', 's114912227'] | [9024.0, 9040.0] | [32.0, 26.0] | [44, 84] |
p02627 | u208633734 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = str(input())\nif a = str.isupper():\n print("A")\nelse:\n print("a")', 'α\u3000= input()\nif α.islower():\n print("A")\nelse:\n print("a")', 'a = str(input())\nif a.isupper():\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s416714498', 's440189349', 's352281383'] | [8876.0, 8884.0, 8952.0] | [20.0, 22.0, 27.0] | [70, 63, 64] |
p02627 | u209275335 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['n = int(input())\nc = 0\nn1 = 0\nn1 += n\nfor i in range(1,12):\n a = n1 - 26**(i)\n c += 1\n if a <= 0:\n break\n n1 = n1 - 26**(i)\na = ""\nfor i in range(c):\n if n // 26**(c-i-1) >= 26:\n alpha = 26\n n = n - 26**(c-i)\n else:\n alpha = n // 26**(c-i-1)\n n = n % 26**(c-i-1)\n a += chr(96 + alpha)\nprint(a)', 'a = input()\nif str.upper(a) == a:\n print("A")\nelse:\n print("a")'] | ['Runtime Error', 'Accepted'] | ['s104153163', 's295802414'] | [9172.0, 8964.0] | [30.0, 28.0] | [349, 69] |
p02627 | u212328220 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['# H, W = map(int,input().split())\na = input()\n\n\nif a.islower():\n print(a.upper())\nelse:\n print(a.lower())', "# H, W = map(int,input().split())\na = input()\n\n\nif a.islower():\n print('a')\nelse:\n print('A')"] | ['Wrong Answer', 'Accepted'] | ['s314335337', 's346611551'] | [9020.0, 8916.0] | [29.0, 31.0] | [148, 136] |
p02627 | u215315599 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["if input().isUpper():\n print('A')\nelse:\n print('a')", "if input().isupper():\n print('A')\nelse:\n print('a')"] | ['Runtime Error', 'Accepted'] | ['s726988728', 's345110838'] | [8984.0, 8732.0] | [25.0, 25.0] | [53, 53] |
p02627 | u217571418 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ["al = str(input())\nif al.isupper() = true:\n\tprint('A')\nelse:\n\tprint('a')", "al = str(input())\nif al.isupper():\n\tprint('A')\nelse:\n\tprint('a')"] | ['Runtime Error', 'Accepted'] | ['s399047666', 's823225476'] | [8884.0, 8904.0] | [26.0, 29.0] | [71, 64] |
p02627 | u218216885 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['if input()islower():\n print("a")\nelse:\n print("A")', 'if input().islower():\n print("a")\nelse:\n print("A")'] | ['Runtime Error', 'Accepted'] | ['s398622055', 's823631669'] | [8880.0, 8928.0] | [24.0, 28.0] | [56, 57] |
p02627 | u218375549 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['moji = input()\nif moji.isupper():\n print(moji.upper())\nelse:\n print(moji.lower())', 'moji = input()\nif moji.isupper():\n print("A")\nelse:\n print("a")'] | ['Wrong Answer', 'Accepted'] | ['s159862904', 's094921726'] | [9020.0, 9080.0] | [32.0, 27.0] | [87, 69] |
p02627 | u219417113 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['a = input()\nif a.isupper():\n print("A)\nelse:\n print("a")', 'a = input()\nif a.isupper():\n print("A")\nelse:\n print("a")\n'] | ['Runtime Error', 'Accepted'] | ['s251355791', 's232741667'] | [8856.0, 8880.0] | [27.0, 34.0] | [58, 60] |
p02627 | u223215060 | 2,000 | 1,048,576 | An uppercase or lowercase English letter \alpha will be given as input. If \alpha is uppercase, print `A`; if it is lowercase, print `a`. | ['x = str(input())\nprint(x.swapcase())', "x = str(input())\nif x.isupper():\n print('A')\nelse :\n print('a')"] | ['Wrong Answer', 'Accepted'] | ['s869171960', 's613503671'] | [9016.0, 9080.0] | [30.0, 24.0] | [36, 65] |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.