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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02675 | u961288441 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['n = int(input())\nnum = map (str(n))\n\nif num[print(len(n))] == [2, 4, 5, 7, 9]:\n\tprint("hon")\nelif num[print(len(n))] == [0, 1, 6, 8]:\n\tprint("pon")\nelse:\n\tprint("bon")', 'n = str(input())\nnum = int(n[-1])\n\nif num in [2, 4, 5, 7, 9]:\n print("hon")\nelif num in [0, 1, 6, 8]:\n print("pon")\nelse:\n print("bon")'] | ['Runtime Error', 'Accepted'] | ['s682134539', 's089643440'] | [9116.0, 9140.0] | [23.0, 25.0] | [167, 144] |
p02675 | u962609087 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["def main():\n n = int(input())\n if n % 10 == 3:\n print('bon')\n elif n % 10 == 0 or n % 10 == 1 or n % 10 == 6 or n % 10 == 8:\n print('pon')\n else:\n print('hon')\nmain(", "def main():\n n = int(input())\n if n % 10 == 3:\n print('bon')\n elif n % 10 == 0 or n % 10 == 1 or n % 10 == 6 or n % 10 == 8:\n print('pon')\n else:\n print('hon')\nmain()"] | ['Runtime Error', 'Accepted'] | ['s631614870', 's761521878'] | [8972.0, 9076.0] | [22.0, 26.0] | [198, 199] |
p02675 | u963747475 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["n=(input())\nrem=str(n)\n\nif int(n[-1:]) in str(2) or str(4) or str(7) or str(9):\n print('hon')\nif int(n[-1:]) in str(0) or str(1) or str(6) or str(8):\n print('bon')\nif int(n[-1:]) == str(3):\n print('pon')\n \n", "n=int(input())\nrem=str(n)\nl1=[2,4,5,7,9]\nl2=[0,1,6,8]\n\nif int(n[-1:]) in l1:\n print('hon')\nif int(n[-1:]) in l2:\n print('bon')\nif int(n[-1:]) == 3:\n print('pon')\n ", "n = input()\nif n[-1:] == str(2) or n[-1:] == str(4) or n[-1:] == str(5) or n[-1:] == str(7) or n[-1:] == str(9):\n print('hon')\nif (n[-1:]) == str(0) or n[-1:] == str(1) or n[-1:] == str(6) or n[-1:] == str(8):\n print('bon')\nif (n[-1:]) == str(3):\n print('pon')", "n = input()\n\nif n[-1:] == str(2) or n[-1:] == str(4) or n[-1:] == str(7) or n[-1:] == str(9):\n print('hon')\nif (n[-1:]) == str(0) or n[-1:] == str(1) or n[-1:] == str(6) or n[-1:] == str(8):\n print('bon')\nif (n[-1:]) == str(3):\n print('pon')", "n = input()\nif n[-1:] == str(2) or n[-1:] == str(4) or n[-1:] == str(5) or n[-1:] == str(7) or n[-1:] == str(9):\n print('hon')\nif (n[-1:]) == str(0) or n[-1:] == str(1) or n[-1:] == str(6) or n[-1:] == str(8):\n \n print('pon')\nif (n[-1:]) == str(3):\n print('bon')\n"] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s180844430', 's338454505', 's351493668', 's927650314', 's716814025'] | [9188.0, 9124.0, 9084.0, 9008.0, 9072.0] | [21.0, 21.0, 21.0, 22.0, 21.0] | [210, 167, 273, 251, 277] |
p02675 | u964521959 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['\nN= input()\nN_list = list(N)\n\nprint(N_list[len(N_list)-1])\n\nif(N_list[len(N_list)-1] == "2" or "4" or "5" or "7"or "9"):\n print("hon")\nelif(N_list[len(N_list)-1] == "0" or "1" or "6" or "8"):\n print("pon")\nelse:\n print("bon")', '\nN= input()\nN_list = list(N)\n\n\n\nif(N_list[len(N_list)-1] == "2"):\n print("hon")\nelif(N_list[len(N_list)-1] == "4"):\n print("hon")\nelif(N_list[len(N_list)-1] == "5"):\n print("hon")\nelif(N_list[len(N_list)-1] == "7"):\n print("hon")\nelif(N_list[len(N_list)-1] == "9"):\n print("hon")\nelif(N_list[len(N_list)-1] == "3"):\n print("bon")\n\nelse:\n print("pon")\n\n'] | ['Wrong Answer', 'Accepted'] | ['s104481425', 's593993301'] | [9048.0, 9076.0] | [23.0, 22.0] | [244, 375] |
p02675 | u968166680 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["from sys import stdin, setrecursionlimit\n\nsetrecursionlimit(10 ** 9)\nINF = 1 << 60\n\n\ndef input():\n return stdin.readline().strip()\n\n\nN = int(input())\nif N in (2, 4, 5, 7, 9):\n print('hon')\nelif N in (0, 1, 6, 8):\n print('pon')\nelse:\n print('bon')\n", "from sys import stdin, setrecursionlimit\n\nsetrecursionlimit(10 ** 9)\nINF = 1 << 60\n\n\ndef input():\n return stdin.readline().strip()\n\n\nN = int(input())\nN %= 10\nif N in (2, 4, 5, 7, 9):\n print('hon')\nelif N in (0, 1, 6, 8):\n print('pon')\nelse:\n print('bon')\n"] | ['Wrong Answer', 'Accepted'] | ['s020269406', 's396193220'] | [9172.0, 9172.0] | [23.0, 21.0] | [259, 267] |
p02675 | u968404618 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['import pandas as pd\n\ndf1 = pd.Dataframe([1,2])\ndf2 = pd.Dataframe([3,4])\n\nprint(pd.merge(df1, df2))\n', 'n = input()\nif n[-1] == "3":\n print("bon")\nelif n[-1] == "0" or n[-1] == "1" or n[-1] == "6" or n[-1] == "8":\n print("pon")\nelse:\n print("hon")'] | ['Runtime Error', 'Accepted'] | ['s537490556', 's823053327'] | [9008.0, 9056.0] | [23.0, 22.0] | [100, 152] |
p02675 | u969081133 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["N=int(input())\na=N%10\nif a==2,4,5,7,9:\n print('hon')\nelif a==0,1,6,8:\n print('pon')\nelse:\n print('bon')", "N=int(input())\na=N%10\nif a==3:\n print('bon')\nelif a==0 or a==1 or a==6 or a==8:\n print('pon')\nelse:\n print('hon')"] | ['Runtime Error', 'Accepted'] | ['s761126945', 's183894056'] | [8996.0, 9028.0] | [19.0, 25.0] | [106, 116] |
p02675 | u969848070 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["s = input()\nif s[-1] == 3:\n print('bon')\nelif s[-1]==0 or s[-1]==1 or s[-1]== 6 or s[-1]== 8:\n print('pon')\nelse:\n print('hon')", "s = input()\nif s[-1] == '3':\n print('bon')\nelif s[-1]=='0' or s[-1]=='1' or s[-1]== '6' or s[-1]== '8':\n print('pon')\nelse:\n print('hon')\n"] | ['Wrong Answer', 'Accepted'] | ['s234392845', 's986944528'] | [9112.0, 8968.0] | [28.0, 27.0] | [130, 141] |
p02675 | u970497613 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["N = int(input())\nN1 = N % 10\nif N1 ==3:\n print('bon')\nelif N1 == 0||N1==1||N1== 6||N1 == 8:\n print('pon')\nelse:\n print('hon')\n", "N = int(input())\nN1 = N % 10\nif N1 ==3:\n print('bon')\nelif N1 == 0,1,6,8:\n print('pon')\nelse:\n print('hon')\n", "N = int(input())\nN1 = N % 10\nif N1 ==3:\n print('bon')\nelif N1 == 0 or N1==1 or N1== 6 or N1 == 8:\n print('pon')\nelse:\n print('hon')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s062106107', 's520843589', 's673919000'] | [9016.0, 9012.0, 9160.0] | [23.0, 22.0, 25.0] | [129, 111, 135] |
p02675 | u972534279 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["\nval = input()\nif val <= 999:\n str_val = str(val)\n val_one = str_val[-1]\n if val_one in {'2','4','5','9','7'}:\n print('hon')\n elif val_one in {'0','1','6','8'}:\n print('pon')\n elif val_one == '3':\n print('bon')", "val = input()\nif int(val) <= 999:\n str_val = str(val)\n val_one = str_val[-1]\n if val_one in {'2','4','5','9','7'}:\n print('hon')\n elif val_one in {'0','1','6','8'}:\n print('pon')\n elif val_one == '3':\n print('bon')\n"] | ['Runtime Error', 'Accepted'] | ['s844327169', 's899323179'] | [9120.0, 9172.0] | [21.0, 20.0] | [224, 229] |
p02675 | u974053290 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['s = input()\na = s[len(s)-1]\n\nif a == "2" or a == "4" or a == "5" or a == "7" or a == "9":\n print("hon)\nelif a == "0" or a == "1" or a == "6" or a == "8":\n print("pon")\nelse:\n print("bon")', 's = input()\na = s[len(s)-1]\n\nif a == "2" or a == "4" or a == "5" or a == "7" or a == "9":\n print("hon")\nelif a == "0" or a == "1" or a == "6" or a == "8":\n print("pon")\nelse:\n print("bon")'] | ['Runtime Error', 'Accepted'] | ['s999463250', 's071781957'] | [8948.0, 9072.0] | [22.0, 21.0] | [196, 197] |
p02675 | u975445930 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['K = int(input())\nS = input()\nl = len(S)\nif l > K:\n print("{}...".format(S[:K]))\nelse:\n print(S)', 'n, m = map(int, input().split())\nl = [list(map(int, input().split())) for i in range(m)]\nd = [0] + [100000]*(n-1)\na = [[float(\'inf\') for j in range(n)] for i in range(n)]\nt = [0]*n\n\nfor i in range(m):\n a[l[i][0]-1][l[i][1]-1] = 1\n a[l[i][1]-1][l[i][0]-1] = 1\n\nfor i in range(n):\n for j in range(n):\n if d[i] + a[i][j] < d[j]:\n d[j] = d[i] + a[i][j]\n t[j] = i+1\nif 0 in t[1:]:\n print("No")\nelse:\n print(\'Yes\')\n for i in range(1,n):\n print(t[i])', 'n, m = map(int, input().split())\nl = [list(map(int, input().split())) for i in range(m)]\nd = [0] + [100000]*(n-1)\na = [[float(\'inf\') for j in range(n)] for i in range(n)]\nt = [0]*n\n\nfor i in range(m):\n a[l[i][0]-1][l[i][1]-1] = 1\n a[l[i][1]-1][l[i][0]-1] = 1\n\nfor i in range(n):\n for j in range(n):\n if d[i] + a[i][j] < d[j]:\n d[j] = d[i] + a[i][j]\n t[j] = i+1\nif 0 in t[1:]:\n print("No")\nelse:\n print(\'Yes\')\n for i in range(1,n):\n print(t[i])', 'N = input()\nx = N[-1]\n\nif x == \'3\':\n print("bon")\nelif x == \'0\' or x == \'1\' or x == \'6\' or x == \'8\':\n print(\'pon\')\nelse:\n print(\'hon\')'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s217100633', 's481003223', 's659197967', 's496941316'] | [9156.0, 9260.0, 9200.0, 9036.0] | [19.0, 24.0, 26.0, 21.0] | [101, 497, 497, 143] |
p02675 | u976169012 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['import random\nimport math\nLI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("Yes")\nno = lambda: print("No")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\nt = II()\nif t%10 == 3:\n\tprint("bon")\nelif t in [0,1,6,8]:\n\tprint("pon")\nelse:\n\tprint("hon")', 'import random\nimport math\nLI = lambda: list(map(int,input().split()))\nMI = lambda: map(int,input().split())\nyes = lambda: print("Yes")\nno = lambda: print("No")\nI = lambda: list(input())\nJ = lambda x: "".join(x)\nII = lambda: int(input())\nSI = lambda: input()\n#---khan17---template\nt = II()\nif t%10 == 3:\n\tprint("bon")\nelif t%10 in [0,1,6,8]:\n\tprint("pon")\nelse:\n\tprint("hon")'] | ['Wrong Answer', 'Accepted'] | ['s641427586', 's951655643'] | [9568.0, 9564.0] | [24.0, 24.0] | [371, 374] |
p02675 | u979078704 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["n = int(input())\n\nif n%10 == 2 or 4 or 5 or 7 or 9:\n print('hon')\nelif n % 10 == 0 or 1 or 6 or 8:\n print('pon')\nelse:\n print('bon')", "n = int(input())\n\nif n%10 == 2 or n%10 ==4 or n%10 ==5 or n%10 ==7 or n%10 ==9:\n print('hon')\nelif n % 10 == 0 or n%10 ==1 or n%10 ==6 or n%10 == 8:\n print('pon')\nelse:\n print('bon')"] | ['Wrong Answer', 'Accepted'] | ['s126271316', 's383923065'] | [9152.0, 9168.0] | [22.0, 23.0] | [141, 191] |
p02675 | u979444096 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["def main():\n n = input()\n a = ['2', '4', '5', '7', '9']\n b = ['0', '1', '6', '8']\n print(n[-1])\n if n[-1] in a:\n print('hon')\n elif n[-1] in b:\n print('pon')\n else:\n print('bon')\n\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n n = input()\n a = ['2', '4', '5', '7', '9']\n b = ['0', '1', '6', '8']\n if n[-1] in a:\n print('hon')\n elif n[-1] in b:\n print('pon')\n else:\n print('bon')\n\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s053686208', 's743031189'] | [9112.0, 9048.0] | [22.0, 21.0] | [262, 245] |
p02675 | u981931040 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["x = input()\npon = ['0', '1', '6', '8']\nif x[-1] if pon:\n print('pon')\nelif x[-1] == '3':\n print('bon')\nelse:\n print('hon')", "x = input()\npon = ['0', '1', '6', '8']\nif x[-1] in pon:\n print('pon')\nelif x[-1] == '3':\n print('bon')\nelse:\n print('hon')\n"] | ['Runtime Error', 'Accepted'] | ['s816577494', 's664599597'] | [8884.0, 9012.0] | [29.0, 26.0] | [125, 126] |
p02675 | u983367697 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['n=int(input())\nif(n==3):\n print("bon")\nelif(n in (0,1,6,8)):\n print("pon")\nelse:\n print("hon")', 'n=int(input())\nn%=10\nif(n==3):\n print("bon")\nelif(n in [0,1,6,8]):\n print("pon")\nelse:\n print("hon")\n'] | ['Wrong Answer', 'Accepted'] | ['s799995646', 's162963350'] | [9108.0, 9156.0] | [21.0, 22.0] | [97, 104] |
p02675 | u985419292 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["K = int(input())\nS = input()\nif K >= len(S):\n print(S)\nelse:\n S = S[:K]+'...'\n print(S)\n", "N = int(input())\nN &= 10\nif N in [2,4,5,7,9]:\n\tprint('hon')\nelif N in [0,1,6,8]:\n\tprint('pon')\nelse N == 3:\n\tprint('bon')\n", "N = int(input())\nN &= 10\nif N in [2,4,5,7,9]:\n\tprint('hon')\nelif N in [0,1,6,8]:\n\tprint('pon')\nelse N == 3\n\tprint('bon')", "N = int(input())\na = N%10\nif a in [2,4,5,7,9]:\n\tprint('hon')\nelif a in [0,1,6,8]:\n\tprint('pon')\nelif a == 3:\n\tprint('bon')\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s119261654', 's249837456', 's901748213', 's026571065'] | [9152.0, 8964.0, 9032.0, 9116.0] | [23.0, 25.0, 24.0, 20.0] | [91, 122, 120, 123] |
p02675 | u987549444 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["from sys import stdin\nimport math\na=int(stdin.readline())\nb=stdin.readline()\nstdin.readline\n\nif len(b)<=a:\n print(b)\nelse:\n for k in range(0,a):\n print(b[k],end='')\n print('...',end='')", "from sys import stdin\nimport math\na=int(stdin.readline())\n\nA=a%10\n\nif (a==0 or a==1) or (a==6 or a==8):\n print('pon')\nelif a==3:\n print('bon')\nelse:\n print('hon')", "from sys import stdin\nimport math\na=int(stdin.readline())\n\nA=a%10\n\nif (A==0 or A==1) or (A==6 or A==8):\n print('pon')\nelif A==3:\n print('bon')\nelse:\n print('hon')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s337616874', 's744399488', 's892905274'] | [9180.0, 9172.0, 9172.0] | [25.0, 23.0, 22.0] | [201, 171, 171] |
p02675 | u988141656 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["N=int(input())\nnum = n[-1]\nnum1 = num[-1]\nif num1 == '3':\n print('bon')\nelif num1 == '0' or num1 == '1' or num1 == '6' or num1 == '8':\n print('pon')\nelse:\n print('hon')", "import sys\nargs = sys.argv\nnum = args[-1]\nnum1 = num[-1]\nprint(num1)\n\nif num1 == '3':\n print('bon')\nelif num1 == '0' or num1 == '1' or num1 == '6' or num1 == '8':\n print('pon')\nelse:\n print('hon')", "import sys\nargs = sys.argv\nnum = args[-1]\nnum1 = num[-1]\nif num1 == '3':\n print('bon')\nelif num1 == '0' or num1 == '1' or num1 == '6' or num1 == '8':\n print('pon')\nelse:\n print('hon')", "N = input()\nnum1 = N[-1]\nif num1 == '3':\n print('bon')\nelif num1 == '0' or num1 == '1' or num1 == '6' or num1 == '8':\n print('pon')\nelse:\n print('hon')"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s187366317', 's433687013', 's709735377', 's539404312'] | [9132.0, 9104.0, 8956.0, 9096.0] | [23.0, 23.0, 20.0, 20.0] | [177, 205, 192, 160] |
p02675 | u988191897 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['N = input()\nh = [2,4,5,7,9]\np = [0,1,6,8]\nprint(N[-1])\nif int(N[-1]) in h:\n\tprint("hon")\nelif int(N[-1]) in p:\n\tprint("pon")\nelse:\n\tprint("bon")', 'N = input()\nh = [2,4,5,7,9]\np = [0,1,6,8]\nif int(N[-1]) in h:\n\tprint("hon")\nelif int(N[-1]) in p:\n\tprint("pon")\nelse:\n\tprint("bon")'] | ['Wrong Answer', 'Accepted'] | ['s177344591', 's548217818'] | [9188.0, 9176.0] | [23.0, 22.0] | [144, 131] |
p02675 | u992471673 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ['n=str(input())\n\nl=len(n)\n\n\nif n[l-1]=="3":\n print("bon")\nelif (n[l-1]==="0" or n[l-1]==="1" or n[l-1]==="6" or n[l-1]==="8"):\n print("pon")\n\nelse :\n print("hon")', 'n=str(input())\n\nl=len(n)\n\n\nif n[l-1]=="3":\n print("bon")\nelif (n[l-1]=="0" or n[l-1]=="1" or n[l-1]=="6" or n[l-1]=="8"):\n print("pon")\n\nelse :\n print("hon")'] | ['Runtime Error', 'Accepted'] | ['s326943173', 's199261011'] | [8956.0, 9056.0] | [23.0, 23.0] | [170, 166] |
p02675 | u996506712 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["x=str(input())\nif x[-1]==2 or 4 or 5 or 7 or 9:\n print('hon')\nelif x[-1]==0 or 1 or 6 or 8:\n print('pon')\nelse:\n print('bon')", "x=input()\nif x[-1] in ['2' , '4' , '5' , '7' , '9']:\n print('hon')\nelif x[-1] in ['0' , '1' , '6' , '8']:\n print('pon')\nelse:\n print('bon')"] | ['Wrong Answer', 'Accepted'] | ['s541862700', 's596818688'] | [9000.0, 8976.0] | [23.0, 27.0] | [134, 148] |
p02675 | u997036872 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["n = list(input())\nif int(n[-1]) == 2 or 4 or 5 or 7or 9:\n print('hon')\nelif int(n[-1]) == 0 or 1 or 6 or 8:\n print('pon')\nelif int(n[-1]) == 3:\n print('bon')", "n = list(input())\nif n[-1] == 2 or 4 or 5 or 7or 9:\n print('hon')\nelif n[-1] == 0 or 1 or 6 or 8:\n print('pon')\nelif n[-1] == 3:\n print('bon')", "n = list(input())\nif int(n[-1]) in [2, 4, 5, 7,9]:\n print('hon')\nelif int(n[-1]) in [0 ,1, 6 , 8]:\n print('pon')\nelse:\n print('bon')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s000981546', 's339804787', 's990267387'] | [9172.0, 9112.0, 9208.0] | [18.0, 22.0, 19.0] | [160, 145, 135] |
p02675 | u998867748 | 2,000 | 1,048,576 | The cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese. When counting pencils in Japanese, the counter word "本" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of "本" in the phrase "N 本" for a positive integer N not exceeding 999 is as follows: * `hon` when the digit in the one's place of N is 2, 4, 5, 7, or 9; * `pon` when the digit in the one's place of N is 0, 1, 6 or 8; * `bon` when the digit in the one's place of N is 3. Given N, print the pronunciation of "本" in the phrase "N 本". | ["n = int(input())\n\nm = n[-1]\n\nif m == 3:\n print('bon')\nelif m == 0,1,6,8:\n print('pon')\nelse:\n print('hon')", "n = input()\n\nm = (n[-1])\n\nif m == '3':\n print('bon')\nelif m == '0' or m == '1' or m =='6' or m =='8':\n print('pon')\nelse:\n print('hon')"] | ['Runtime Error', 'Accepted'] | ['s986082720', 's740498733'] | [8988.0, 9088.0] | [23.0, 21.0] | [115, 144] |
p02676 | u000037600 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['a=int(input())\nb=input()\nif a>len(b):\n print(b)\nelse:\n print(b[0:a],"...")', 'a=int(input())\nb=input()\nif a>=len(b):\n print(b)\nelse:\n print(b[0:a]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s823197387', 's497585648'] | [9140.0, 8864.0] | [24.0, 30.0] | [76, 77] |
p02676 | u001464994 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K=input()\nS=input()\n\nif len(S)>=K:\n print(s)\nelse:\n print(s[:K]+"...")', 'K=int(input())\nS=input()\n\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")\n'] | ['Runtime Error', 'Accepted'] | ['s417863449', 's375595201'] | [8972.0, 9064.0] | [20.0, 22.0] | [72, 78] |
p02676 | u001547131 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K = int(input())\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nif s > K:\n print(S + '...')\n\n", "K = int(input())\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:K] + '...')\n\n"] | ['Wrong Answer', 'Accepted'] | ['s124950253', 's883268697'] | [9160.0, 9160.0] | [23.0, 23.0] | [93, 93] |
p02676 | u004823354 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = int(input())\ns = list(input())\nl = len(s)\nif k >= l:\n print(s)\nelse:\n print(s[:k])\n ', 'k = int(input())\ns = input()\nl = len(s)\nif k >= l:\n print(s)\nelse:\n print(str(s[:k])+str("..."))\n\n '] | ['Wrong Answer', 'Accepted'] | ['s349758586', 's691138489'] | [9124.0, 9084.0] | [28.0, 26.0] | [91, 102] |
p02676 | u008382444 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print("S[:K]"+"...")\n', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s425804001', 's478411302'] | [9144.0, 9164.0] | [24.0, 23.0] | [86, 83] |
p02676 | u008566194 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["n=int(input())\n \ns=input()\nl=len(s)\nif l>n:\n print(s[:n].join('...'))\nelse:\n print(s)", "n=int(input())\n\ns=input()\nl=len(s)\nif l>n:\n print(s[:n].join'...')\nelse:\n print(s)", "n=int(input())\n \ns=input()\nl=len(s)\nif l>n:\n print(s[:n]+'...')\nelse:\n print(s)\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s464745913', 's591051530', 's970032973'] | [9168.0, 8972.0, 9160.0] | [22.0, 23.0, 23.0] | [87, 84, 82] |
p02676 | u008718882 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K = int(input())\nS = input()\nprint(len(S))\n\nif K <= len(S):\n print(S[:K], '...')\nelse:\n print(S)", "K = int(input())\nS = input()\n\nif K <= len(S):\n print(S[:K], '...')\nelse:\n print(S)", "K = int(input())\nS = input()\n\nif K < len(S):\n print(S[:K], '...')\nelse:\n print(S)", "K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K], '...')", "K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + '...')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s298932405', 's453254506', 's783315650', 's846892104', 's546199569'] | [9168.0, 9160.0, 9164.0, 9104.0, 9080.0] | [22.0, 23.0, 23.0, 22.0, 23.0] | [102, 88, 87, 88, 89] |
p02676 | u010777300 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k=int(input())\ns=input()\nif len(s)<=k:\n print(s)\nelse:\n print(s[:s]+"...")', 'k=int(input())\ns=input()\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k]+"...")\n'] | ['Runtime Error', 'Accepted'] | ['s640371164', 's431817460'] | [9104.0, 9164.0] | [26.0, 33.0] | [76, 77] |
p02676 | u011202375 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['N=int(input())\na=input()\ni=0\nhe=""\nif len(a)>N:\n for m in range(N):\n he=he+a[i]\n i=+1\n he=he+"..."\nprint(he)', 'N=int(input())\na=input()\ni=0\nhe=""\nif len(a)>N:\n for m in range(N):\n he=he+a[i]\n i=i+1\n he=he+"..."\n print(he)\nelse:\n print(a)\n'] | ['Wrong Answer', 'Accepted'] | ['s953373694', 's995989346'] | [9168.0, 9112.0] | [27.0, 27.0] | [128, 151] |
p02676 | u014139588 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = int(input())\ns = input()\nls = len(s)\nif k >= ls:\n print(s)\nelse:\n for i in range(k):\n print(s[i], end = "")\n print("…")', 'k = int(input())\ns = input()\nls = len(s)\nif k >= ls:\n print(s)\nelse:\n for i in range(k):\n print(s[i], end = "")\n print("...")'] | ['Wrong Answer', 'Accepted'] | ['s495802287', 's768175457'] | [9176.0, 9176.0] | [24.0, 22.0] | [141, 141] |
p02676 | u014268998 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = str(input())\n\n#k = 7\n\n\nif len(s) > k:\n print(s[:k] , '...')\nelse :\n print(s)", "k = int(input())\ns = str(input())\n\n#k = 7\n\n\nif len(s) > k:\n temp = s[:k] + '...' \n print(temp)\nelse :\n print(s)"] | ['Wrong Answer', 'Accepted'] | ['s817708382', 's399347439'] | [9164.0, 9164.0] | [23.0, 23.0] | [121, 137] |
p02676 | u014646120 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K=int(input())\nS=input()\nif (K>len(S)):\n print (S)\nelse:\n print ((S[0:(K-1)]) + "...")', 'K=int(input())\nS=input()\nif (K>=len(S)):\n print (S)\nelse:\n print ((S[0:(K-1)]) + "...")', 'K=int(input())\nS=input()\nif (K>len(S)):\n print (S)\nelse:\n print ((S[0:(K+1)]) + "...")', 'K=int(input())\nS=input()\nif (K>=len(S)):\n print (S)\nelse:\n print ((S[0:(K+1)]) + "...")', 'K=int(input())\nS=input()\nif (K>=len(S)):\n print (S)\nelse:\n print ((S[0:(K)]) + "...")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s006907782', 's392420401', 's431283341', 's923648623', 's292608444'] | [9176.0, 9172.0, 9168.0, 9116.0, 9168.0] | [21.0, 21.0, 23.0, 23.0, 21.0] | [92, 93, 92, 93, 91] |
p02676 | u015993380 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = input()\nif len(s) > k:\n print(s[:k+1]+'...')\nelse:\n print(s)", "k = int(input())\ns = input()\nif len(s) > k:\n print(s[:k]+'...')\nelse:\n print(s)"] | ['Wrong Answer', 'Accepted'] | ['s347774267', 's850691025'] | [9164.0, 9116.0] | [25.0, 23.0] | [83, 81] |
p02676 | u017624958 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K = int(input())\nS = input()\n\nanswer = None\nis_less_than_K = len(S) <= K\nif is_less_than_K:\n answer = S\nelse:\n answer = S[0:K + 1] + '...'\n\nprint(answer)\n", "K = int(input())\nS = input()\n\nanswer = None\nis_less_than_K = len(S) <= K\nif is_less_than_K:\n answer = S\nelse:\n answer = S[0:K] + '...'\n\nprint(answer)\n"] | ['Wrong Answer', 'Accepted'] | ['s609844587', 's623821912'] | [9172.0, 9172.0] | [21.0, 21.0] | [160, 156] |
p02676 | u018168283 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['n = int(input())\np = list(input())\ndel p[n:]\np="".join(p)\nprint(p)', 'n = int(input())\np = list(input())\nif n < len(p):\n del p[n:]\n p="".join(p)\n print(str(p)+"...")\nelse:\n p="".join(p)\n print(p)'] | ['Wrong Answer', 'Accepted'] | ['s946947125', 's523278171'] | [9080.0, 9124.0] | [20.0, 22.0] | [66, 130] |
p02676 | u018679195 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS= input()\n\nstr = S\n\n\nif lens(s) == K:\n print(S)\n\nelse:\n print (str[0:K] +"...")\n', 'string=input()\nnumber=int(input())\ncharacters=len(string)\nempty=""\nif characters<=number:\n print(string)\nelse:\n i=0\n while i<number:\n empty+=string[i]\n i=i+1\n print(f"{empty}...")\n\n', '\ndef convert(S): \n str1 = "" # initialization of string to "" \n return(str1.join(S)) # using join function join the list s by \n # separating words by str1\n\n\nK = int(input()) # take K from user\nreadtext= str(input()) # take the input string \n\nS = list(readtext) #split the string into charactrers and put them to list\nlist1=list() #list 1 \n\nfor i in range (0 , K): # for looop to append the charachters to the new list\n a = S[i]\n list1.append(a) # appending the charachters to the list\nif len(list1) > K: # condition when number of charachters is big than K\n b = "..."\n list1.append(b) # append the 3 dots \n\nprint(convert(list1)) # convert the list of characters back to the string format\n \n \n', 'k=int(input())\ns=input()\nprint(s[:k])\n\n\n#print the characters before k', 'a=input()\nb=input()\nc=b[:int(a)]\nif len(b)>int(a):\n c+=". . ."\nprint(c)', 'k=int(input())\ns=input()\nif lens(s)>k:\n print(s[:k]+"..")\nelse:\n print(s)\ns[5:]\n', 'K = int(input())\nS = input()\n\nstr = S\n\n\nif lens(S) == k:\n print(str)\n\nelse:\n print (str[0:K] +"...")\n', 'a=input() \nb=input() #string input\nif len(b)>int(a): # if exceed the len given\n print(b[:int(a)],"...")\nelse:\n print(c)', 'def tripleDots(n, string):\n\tstring_len = len(string)\n\tif string_len > n : \n\t\tstring = string[ 0 : n ] + "..."\n\tprint(string)\n\narr = ["", ""]\n\nfor i in range(2):\n\tarr[i] = input()\n\n\ntripleDots(int(arr[0]), arr[1])'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s321127060', 's411693124', 's508909793', 's525379101', 's653312666', 's658601222', 's857284109', 's931685469', 's335888477'] | [9012.0, 9144.0, 9120.0, 9136.0, 9152.0, 9104.0, 9136.0, 9136.0, 9064.0] | [25.0, 22.0, 28.0, 26.0, 31.0, 24.0, 24.0, 25.0, 27.0] | [149, 207, 756, 94, 74, 86, 152, 135, 212] |
p02676 | u021933148 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = input()\n\nprint(len(s))\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + '...')", "k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + '...')"] | ['Wrong Answer', 'Accepted'] | ['s348001534', 's827390487'] | [9100.0, 9164.0] | [22.0, 22.0] | [100, 85] |
p02676 | u022658079 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['b,= map(int, input().split())\na= input().split()\nc= list(a)\nif len(c)<=b:\n print(a)\nelse:\n print(str(a[:b])+"...")', 'b,= map(int, input().split())\na= input()\nc= list(a)\nif len(c)<=b:\n print(str(a))\nelse:\n print(str(a[:b])+"...")'] | ['Wrong Answer', 'Accepted'] | ['s871131890', 's227726007'] | [9164.0, 9168.0] | [22.0, 23.0] | [116, 113] |
p02676 | u031679985 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k=int(input())\ns=input()\n\nif len(s)>k:\n print(s)\nelse:\n print(s[:k]+'...')", "s=input()\nk=int(input())\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k]+'...')", "k=int(input())\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k]+'...')"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s031621422', 's504753997', 's837927514'] | [9144.0, 9144.0, 9132.0] | [20.0, 22.0, 22.0] | [76, 77, 77] |
p02676 | u032625182 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['import sys\nK = int(input())\nS = input()\n\nif(len(S)<=K):\n print(S)\nelse:\n print(S[:K])', 'import sys\nK = int(input())\nS = input()\n\nif(len(S)>K):\n print(S)\nelse:\n print(S[:K])', 'import sys\nK = int(input())\nS = input()\n\nif(len(S)<=K):\n print(S)\nelse:\n print(S[:K])', 'import sys\nK = int(input())\nS = input()\n\nif(len(S)<=K):\n print(S)\nelse:\n print(S[:K]+"...")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s027338318', 's806512040', 's988077899', 's186836188'] | [9164.0, 9040.0, 9080.0, 9172.0] | [22.0, 22.0, 24.0, 21.0] | [91, 90, 91, 97] |
p02676 | u038216098 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['num=int(input())\nstr=input()\nif(len(str)<=num):\n print(str)\nelse:\n print(str[0:num],"...")', 'num=int(input())\nstr=input()\nif(len(str)<=num):\n print(str)\nelse:\n print(str[0:num]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s006247902', 's399322920'] | [9112.0, 9172.0] | [24.0, 22.0] | [92, 92] |
p02676 | u038676814 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\n\nif(len(S) <= K) :\n print(S)\nelse :\n S+="..."\n print(S)', 'K = int(input())\nS = input()\n\nif(len(S) <= K) :\n print(S)\nelse :\n print(S[0:K] + "...")'] | ['Wrong Answer', 'Accepted'] | ['s191588781', 's040847969'] | [9160.0, 9164.0] | [22.0, 32.0] | [93, 93] |
p02676 | u038819082 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K=int(input())\nS=input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K],"...")', 'K=int(input())\nS=input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s116066659', 's509630610'] | [9192.0, 9164.0] | [23.0, 25.0] | [80, 80] |
p02676 | u040642458 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['S = input()\nk = int(input())\nif len(S)<=k:\n print(S)\nelse:\n print(S[:k]+"...")\n \n', 'S = input()\nk = int.input()\nif S.len()<=k:\n print(S)\nelse:\n print(S[:k]+"...")\n \n', 'S = input()\nk = int(input())\nif S.len()<=k:\n print(S)\nelse:\n print(S[:k]+"...")\n \n', 'S = input()\nk = int.input()\nif S.len()<=K:\n print(S)\nelse:\n print(S[:K]+"...")\n ', 'k = int(input())\nS = input()\n\nif len(S)<=k:\n print(S)\nelse:\n print(S[:k]+"...")\n \n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s095598645', 's289581754', 's499252962', 's670390339', 's918026664'] | [9136.0, 8932.0, 9092.0, 8940.0, 9140.0] | [20.0, 21.0, 22.0, 26.0, 23.0] | [83, 83, 84, 82, 84] |
p02676 | u047502873 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | [" = int(input())\ns = str(input())\n\nif len(s) <= k:\n print(s)\nelse:\n s = s[:k] + '...'\n print(s)", "k = int(input())\ns = str(input())\n\n\nif len(s) <= k:\n print(s)\nelse:\n s = s[:k] + '...'\n print(s)"] | ['Runtime Error', 'Accepted'] | ['s917798012', 's317377755'] | [8856.0, 9092.0] | [27.0, 30.0] | [103, 105] |
p02676 | u048800107 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['\nn = int(input())\ns = str(input())\n\nif n >= len(s):\n print(s)\nelse:\n print(s[0:n-1] + "...")', 'n = int(input())\ns = str(input())\n\nif n >= len(s):\n print(s)\nelse:\n print(s[0] + "...")', '\nn = int(input())\ns = str(input())\n\nif n >= len(s):\n print(s)\nelse:\n print(s[0:n] + "...")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s111038945', 's391894878', 's356852060'] | [9156.0, 9164.0, 9164.0] | [21.0, 22.0, 21.0] | [98, 93, 96] |
p02676 | u049182844 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["value = int(input())\ntext = input()\nif value < len(text):\n print(text[0]+'...')\nelse:\n print(text)", "K = int(input())\nS = input()\nif K < len(S):\n print(S[0:K] + '...')\nelse:\n print(S)"] | ['Wrong Answer', 'Accepted'] | ['s042228984', 's084944517'] | [9108.0, 9096.0] | [25.0, 31.0] | [104, 84] |
p02676 | u050805798 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = input()\nif len(s) =< k:\n print(s)\nelse:\n s1 = s[0:k]\n s1 = s1 + '...'\n print(s1)", "k = int(input())\ns = input()\nif len(s) <= k:\n print(s)\nelse:\n s1 = s[0:k]\n s1 = s1 + '...'\n print(s1)"] | ['Runtime Error', 'Accepted'] | ['s084333476', 's736704178'] | [9012.0, 9168.0] | [24.0, 24.0] | [113, 113] |
p02676 | u053535689 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['\ndef ac_168b(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[0:K] + "..."\n\nK = input()\nS = input()\nprint(ac_168b(K, S))\n', '\ndef ac_168b(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[0:K] + "..."\n \nK = input():\nS = input():\nprint(ac_168b(K, S))\n', '\ndef ac_168b(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[0:K] + "..."\n\nK = int(input())\nS = input()\nprint(ac_168b(K, S))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s609407550', 's787851122', 's787734269'] | [8972.0, 9000.0, 9116.0] | [22.0, 24.0, 28.0] | [160, 166, 165] |
p02676 | u056550107 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k=int(input())\ns=input()\nn=len(s)\nif k>n:\n print(s[:k+1]+"...")\nelse:\n print(s)', 'k=int(input())\ns=input()\nn=len(s)\nif n>k:\n print(s[:k]+"...")\nelse:\n print(s)'] | ['Wrong Answer', 'Accepted'] | ['s791533602', 's200067276'] | [9164.0, 9192.0] | [21.0, 23.0] | [81, 79] |
p02676 | u060927350 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['n=int(input())\narr=input()\nz=len(arr)\nif z<=n:\n print(arr)\nelse:\n print(arr[:n],"...")', 'n=int(input())\narr=input()\nz=len(arr)\nif z<=n:\n print(arr)\nelse:\n print(arr[:n]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s396774613', 's817422241'] | [9164.0, 9164.0] | [24.0, 24.0] | [92, 92] |
p02676 | u062754605 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\nif int(len(S)) <= K:\n print(S)\nelse:\n print(S[0:K]...)\n', 'K = int(input())\nS = input()\nif int(len(S)) <= K:\n print(S)\nelse:\n print(S[0:K]...)\n', "K = int(input())\nS = input()\nif int(len(S)) <= K:\n print(S)\nelse:\n print(S[0:K]+'...')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s250402162', 's721642617', 's809858101'] | [8964.0, 9020.0, 9152.0] | [22.0, 24.0, 22.0] | [90, 90, 93] |
p02676 | u063346608 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\n\nif len(S) <= K:\n\tprint(S)\nelse:\n\tprint(S[0:K],"...")', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n\tprint(S)\nelse:\n\tprint(S[0:K] + "...")'] | ['Wrong Answer', 'Accepted'] | ['s019873595', 's911144943'] | [9188.0, 9156.0] | [28.0, 24.0] | [82, 84] |
p02676 | u064959680 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = input()\nS = input()\n\nif len(S) < int(K):\n print(S)\nelse:\n print(S+"...")', 'K = input()\nS = input()\n\nif len(S) <= int(K):\n print(S)\nelse:\n print(S+"...")', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K]+"...")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s546885224', 's607756302', 's824817453'] | [9112.0, 9140.0, 9172.0] | [22.0, 22.0, 25.0] | [78, 79, 84] |
p02676 | u066120361 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = str(input())\nn = len(s) - k\nprint(s[k:]+'...' if n>0 else s)", "k = int(input())\ns = str(input())\nn = len(s) - k\nprint(s[:k]+'...' if n>0 else s)"] | ['Wrong Answer', 'Accepted'] | ['s360664456', 's833453476'] | [9160.0, 9164.0] | [22.0, 20.0] | [81, 81] |
p02676 | u071068106 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\n\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K])', 'K = int(input())\nS = input()\n\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s038815191', 's425767733'] | [9152.0, 9172.0] | [23.0, 22.0] | [79, 85] |
p02676 | u071868443 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = int(input())\nn = str(input())\nif len(n) <= k:\n print(n)\nelse:\n print(n[:k])', "k = int(input())\nn = str(input())\nif len(n) <= k:\n print(n)\nelse:\n print(n[:k]+'...')\n"] | ['Wrong Answer', 'Accepted'] | ['s503534021', 's750476926'] | [9156.0, 9152.0] | [21.0, 21.0] | [81, 88] |
p02676 | u071916806 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k=int(input())\ns=input()\nl=len(s)\nif l<=k:\n print(s)\nelse:\n p=s[1:l]\n q='...'\n r=p+q\n print(r)", "k=int(input())\ns=input()\nl=len(s)\nif l<=k:\n print(s)\nelse:\n p=s[0:k-1]\n q='...'\n r=p+q\n print(r)", "k=int(input())\ns=input()\nl=len(s)\nif s<=k:\n print(s)\nelse:\n p=s[1:l]\n q='...'\n r=p+q\n print(r)", "k=int(input())\ns=input()\nl=len(s)\nif l<=k:\n print(s)\nelse:\n p=s[0:k]\n q='...'\n r=p+q\n print(r)"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s462097704', 's880207845', 's953079130', 's893898752'] | [9172.0, 9176.0, 9084.0, 9172.0] | [22.0, 21.0, 23.0, 21.0] | [99, 101, 99, 99] |
p02676 | u073396193 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = int(input())\ns = raw_input()\n\nif k >= len(s):\n print(s)\nelse:\n print(s[0:k]+"...")\n', 'k = int(input())\ns = input()\n\nif k >= len(s):\n print(s)\nelse:\n print(s[0:k]+"...")\n'] | ['Runtime Error', 'Accepted'] | ['s166271288', 's827712899'] | [9152.0, 9156.0] | [26.0, 23.0] | [93, 89] |
p02676 | u075109824 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = input()\n\nif len(s) > len(s[:k]):\n s += '...'", "k = int(input())\ns = input()\n\nif len(s) > len(s[:k]):\n s += '...'\n\nprint(s)", "k = int(input())\ns = input()\n\nif len(s) > len(s[:k]):\n s += '...'\n\nprint(s)", "k = int(input())\ns = input()\n\nif len(s) > len(s[:k]):\n s += '...'\n\nprint(s)", "k = int(input())\ns = input()\nprint(len(s))\nif len(s) > len(s[:k]):\n s += '...'\n\nprint(s)", "K = int(input())\nS = input()\nif K == len(S) or K > len(S): print (S)\nelse:\n print (S[:K]+'...')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s368628796', 's459314982', 's491345371', 's936521777', 's978365302', 's312397326'] | [9164.0, 9156.0, 9156.0, 9156.0, 9160.0, 9148.0] | [22.0, 21.0, 22.0, 22.0, 22.0, 23.0] | [68, 78, 78, 78, 91, 98] |
p02676 | u077836138 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k=int(input())\ns=input()\nl=len(s)\nif(l<=k):\n print(s)\nelse:\n s=s[k:]\n print(s)', 'k=int(input())\ns=input()\nl=len(s)\nif(l<=k):\n print(s)\nelse:\n s=s[k:]\n print(s,end=" ",...)\n', 'k=int(input())\ns=input()\nl=len(s)\nif(l<=k):\n print(s)\nelse:\n s=s[:k]\n s=s+"..."\n print(s)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s772509402', 's773819105', 's772323283'] | [9168.0, 9088.0, 9172.0] | [21.0, 22.0, 22.0] | [81, 94, 93] |
p02676 | u078527650 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = int(input())\ns = str(input())\ns_len = len(s)\nif s_len > k:\n print(s[0:7],"...")\nelse:\n print(s)\n', 'k = int(input())\ns = str(input())\ns_len = len(s)\nif s_len > k:\n k_short = str(s[0:k]+"...") \n print(k_short)\nelse:\n print(s)\n'] | ['Wrong Answer', 'Accepted'] | ['s977565274', 's533880355'] | [9156.0, 9032.0] | [21.0, 21.0] | [106, 134] |
p02676 | u080685822 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = int(input())\ns = input()\nslen = len(s)\nif slen > k:\n print(s)\nelse:\n print(s[:k] + "...")\n', 'k = int(input())\ns = input()\nslen = len(s)\nif slen > k:\n print(s)\nelse:\n print(s[:k])\n', 'k = input()\ns = len(input())\nklen = len(k)\nif s > klen:\n print(s)\nelse:\n print(k + "...")', 'k = input()\ns = input()\nklen = len(k)\nslen = len(s)\nif slen > klen:\n print(s)\nelse:\n print(k + "...")\n', 'k = int(input())\ns = input()\nslen = len(s)\nif slen > k:\n print(s[:k] + "...")\nelse:\n print(s)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s381733403', 's392832951', 's552426213', 's676120190', 's415605755'] | [9140.0, 9056.0, 9104.0, 9080.0, 9056.0] | [26.0, 20.0, 25.0, 25.0, 22.0] | [100, 92, 95, 108, 100] |
p02676 | u081472919 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K = int (input())\nS = (input())\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + '...'", "K = int (input())\nS = (input())\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + '...')"] | ['Runtime Error', 'Accepted'] | ['s253005494', 's329381288'] | [9020.0, 9120.0] | [19.0, 23.0] | [90, 91] |
p02676 | u082245101 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K=int(input())\nS=input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[0:K-1]+'...')", "K=int(input())\nS=input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[0:K]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s792904702', 's608592213'] | [9160.0, 9160.0] | [22.0, 25.0] | [83, 81] |
p02676 | u084094234 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = input()\ns = input()\n\nif s > len(str(k)):\n print(s)\nelse:\n print(s[k:] + '...')", "k = int(input())\ns = input()\n \nif len(str(s)) <= k:\n print(s)\nelse:\n print(s[k:] + '...')", "k = int(input())\ns = input()\n\nif k <= len(str(s)):\n print(s)\nelse:\n print(s[k:] + '...')", "k = int(input())\ns = input()\n \nif len(str(s)) <= k:\n print(s)\nelse:\n print(s[:k] + '...')"] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s224697854', 's688205535', 's985891894', 's254318274'] | [9076.0, 9172.0, 9152.0, 9172.0] | [25.0, 23.0, 21.0, 21.0] | [84, 91, 90, 91] |
p02676 | u087118202 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["s=input()\nk=int(input())\nif len(s) <=k:\n print(s)\nelse:\n print(s[:k] + '...')", "s=int(input())\nk=input()\nif len(s) <=k:\n print(s)\nelse:\n print(s[:k] + '...')", "s=int(input())\nk=input()\nif len(k) <=s:\n print(k)\nelse:\n print(k[:s] + '...')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s137359990', 's820831362', 's616103274'] | [9036.0, 9164.0, 9080.0] | [24.0, 25.0, 30.0] | [79, 79, 79] |
p02676 | u088475928 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K=int(input())\nS=input()\nhai=[]\nif len(S)<K:\n print(S)\nelse:\n for i in range(0,K):\n hai.append(S[i])\n print(hai+"...")\n ', 'K=int(input())\nS=input()\nhai=[]\nif len(S)<K:\n print(S)\nelse:\n for i in range(0,K):\n hai.append(S[i])\n print("hai"+"...")\n ', 'K=int(input())\nS=input()\nif len(S)<K:\n print(S)\nelse:\n print(S[0]+"...")', 'K=int(input())\nS=input()\nhai=[]\nif len(S)<K:\n print(S)\nelse:\n for i in range(0,K):\n hai.append(S[i])\n print(str(hai)+"...")\n ', 'K=int(input())\nS=input()\nif len(S)<K:\n print(S)\nelse:\n print(S[:,K]+"...")\n ', 'K=int(input())\nS=input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")\n '] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s342932844', 's437433254', 's587706121', 's673443353', 's964415142', 's112027378'] | [9004.0, 9192.0, 9112.0, 9172.0, 9156.0, 9060.0] | [25.0, 22.0, 21.0, 24.0, 22.0, 20.0] | [129, 131, 74, 134, 81, 81] |
p02676 | u089230684 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['#input an interget\nk=int(input())\n#input an string\nstr1=str(input())\n#get the length of the string\nx=int(len(str1))\n#get the difference in length between k and s\ni=x-k\n\n#make a second string for the appending\nfor i in range(k):\n str2="."\n str2=str2*i\n\n#if statement about how the string will function\n#if the string is the same length as k then print it\nif i==0:\n print(str1)\n#if not, delete the last character of the string\nelse:\n for i in range(x):\n str1=str1[0 : i : ] + str1[i+1 : : ]\n#and then join the two strings together\n newstr="".join((str1,str2))\n print(newstr)\n', '#need to use a raw input for one line input because they both defer in data types i.e interger and float\na,b = input().split()\n#and then convert them back into respective data types\na=int(a)\nb=float(b)\n#multiply a and b and then round the answer up before printing\nmul=a*b\nans=math.trunc(mul)\nprint(ans)\n', 'k=int(input())\ns=input()\nif lens(s)>k:\n print(s[:k]+"..")\nelse:\n print(s)\ns[]\ns[5:]', '#firsts we declare string s and k, if character s is at most with char k, it will print char s, no change\n#if s i more than k it\n\n\nk = int(input())\ns= input()\n\nstr = s\ntripledot= "..."\n\n\nif lens(s) == k:\n print(s)\n\nelif len(s) > k:\n print (str[0:k],"...")\n', 'K=int(input())\nS=input()\nif len(S)<K or len(S)==K:\n print (S)\nelif len(S)>K:\n print(S[0:K]) ', 'a=input()\nb=input()\nc=b[:int(a)]\n\nprint(c,". . .")', 'k=int(input())\ns=input()\nif len(s) > k:\n print(s[:k] + "...")\nelse:\n print(s)\n\n\n#if k is more than s\n#print the characters before k\n#if not print normally'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s259137718', 's344247344', 's583719265', 's616685839', 's836015590', 's896197253', 's164804564'] | [9180.0, 9092.0, 8992.0, 9176.0, 9060.0, 9160.0, 9144.0] | [28.0, 27.0, 21.0, 23.0, 29.0, 32.0, 28.0] | [598, 304, 85, 291, 99, 50, 184] |
p02676 | u090649502 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['n=int(input())\nif n==3:\n print("bon")\nelif n<=1 or n==6 or n==8:\n print("pon")\nelse:\n print("hon")', 'k=int(input())\ns=input()\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s884604389', 's895714948'] | [9160.0, 9096.0] | [22.0, 23.0] | [107, 80] |
p02676 | u093861603 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['S=input()\nk=int(input())\nif len(S)>k:\n S=S[:k]+"..."\nprint(S)', '\nk=int(input())\nS=input()\nif len(S)>k:\n S=S[:k]+"..."\nprint(S)'] | ['Runtime Error', 'Accepted'] | ['s082371193', 's759290949'] | [9188.0, 9160.0] | [25.0, 22.0] | [62, 63] |
p02676 | u095384238 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\nif len(S)<=K:\n print(S)\nelse:\n S += "..."\n print(S)', 'K = int(input())\nS = input()\nif len(S)<=K:\n print(S)\nelse:\n S = S[:K]\n S += "..."\n print(S)'] | ['Wrong Answer', 'Accepted'] | ['s526079379', 's885624109'] | [9156.0, 9152.0] | [22.0, 22.0] | [89, 103] |
p02676 | u095844416 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k=int(input())\ns=input()\na=int(len(s))\nif a<=k:\n\tprint(s)\nelse:\n\tprint(s[0:k+1]+'...')", "k=int(input())\ns=input()\na=int(len(s))\nif a<=k:\n\tprint(s)\nelse:\n\tprint(s[0:k]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s755281740', 's943440013'] | [9168.0, 9168.0] | [20.0, 22.0] | [86, 84] |
p02676 | u096025032 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['a, b, h, m = map(int,input().split())\n\nhk = h * 30\nmk = m * 6\n\nkaku = mk - hk\n\nprint(((b ** 2)+(a ** 2)) - (2 * a * b * kaku))', 'a = int(input())\nz = input()\n\nif len(z) > a: \n print(z[0:a] + "...")\nelse:\n print(z)'] | ['Runtime Error', 'Accepted'] | ['s776572958', 's023397242'] | [9164.0, 9164.0] | [22.0, 24.0] | [126, 86] |
p02676 | u098223184 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k=int(input())\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k+1]+'...')", "k=int(input())\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s498331511', 's156954068'] | [9060.0, 9080.0] | [25.0, 26.0] | [83, 81] |
p02676 | u098994567 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['\n\n\n\n\nk = int(input())\ns = str(input())\n\nresult = ""\nif len(s) <= k:\n result = s\nelse:\n for i in range(0, k - 1):\n result += s[i]\n result += "..."\n\nprint(result)\n', '\n\n\n\n\nk = int(input())\ns = str(input())\n\nresult = ""\nif len(s) <= k:\n result = s\nelse:\n for i in range(0, k):\n result += s[i]\n result += "..."\n\nprint(result)\n'] | ['Wrong Answer', 'Accepted'] | ['s907852751', 's579018836'] | [9072.0, 8952.0] | [26.0, 27.0] | [673, 669] |
p02676 | u104254237 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["n = int(input())\ns = input()\nif len(s)<=n:\n print(s)\nelse:\n print(s[:7]+'.'*(len(s)-n))\n", "n = int(input())\ns = input()\nif len(s)<=n:\n print(s)\nelse:\n print(s[:n]+'...')\n"] | ['Wrong Answer', 'Accepted'] | ['s351363335', 's814333369'] | [9156.0, 9156.0] | [21.0, 23.0] | [90, 81] |
p02676 | u105290050 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k=int(input())\ns=str(input())\nif len(s)>k:\n print(s[0:k]+"...")\nelif:\n print(s)', 'k=int(input())\ns=str(input())\nif len(s)>k:\n print(s[0:k]+"...")\nelse:\n print(s)'] | ['Runtime Error', 'Accepted'] | ['s256951142', 's943565230'] | [8960.0, 9164.0] | [21.0, 22.0] | [81, 81] |
p02676 | u109959065 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["\nN = int(input())\n\nS = input()\n\nstrLen = len(S)\n\nif strLen <= N :\n print(S)\nelse :\n result = S[0 : N]\n index = 0\n while index < (strLen - N):\n index = index + 1\n result += '.'\n print(result)", "N = int(input())\n\nS = input()\n\nstrLen = len(S)\n\nif strLen <= N :\n print(S)\nelse :\n result = S[0 : N]\n index = 0\n while index < (strLen - N):\n index = index + 1\n result += 'x'\n print(result)", '\nN = int(input())\n\nS = input()\n\nstrLen = len(S)\n\nif strLen <= N :\n print(S)\nelse :\n result = S[0 : N]\n result += "..."\n print(result)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s080709561', 's809343537', 's683611681'] | [9036.0, 9112.0, 9044.0] | [24.0, 28.0, 28.0] | [219, 218, 145] |
p02676 | u110311725 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = input()\nw = len(s)\nif w <= k:\n print(s)\nelse:\n ans = s[0:k-1]\n print('%s...' % ans)", "k = int(input())\ns = input()\nw = len(s)\nif w <= k:\n print(s)\nelse:\n ans = s[1:k]\n print('%s...' % ans)", "k = int(input())\ns = input()\nw = len(s)\nif w <= k:\n print(s)\nelse:\n ans = s[0:k]\n print('%s...' % ans)\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s702158594', 's791092029', 's626934438'] | [9108.0, 9168.0, 9156.0] | [20.0, 22.0, 22.0] | [113, 111, 112] |
p02676 | u110514504 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K = input()\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + '...')", "K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + '...')\n"] | ['Runtime Error', 'Accepted'] | ['s225662974', 's123235480'] | [9032.0, 9164.0] | [24.0, 22.0] | [80, 86] |
p02676 | u111559399 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K = int(input())\nS = str(input())\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+'…')", "K = int(input())\nS = str(input())\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s883526346', 's826413744'] | [9164.0, 9164.0] | [21.0, 23.0] | [91, 91] |
p02676 | u112629957 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\nif len(S)<=K:\n input(S)\nelse:\n input(S[:K] + "...")', 'K = int(input())\nS = input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K] + "...")'] | ['Runtime Error', 'Accepted'] | ['s611523970', 's184664667'] | [9160.0, 9164.0] | [19.0, 21.0] | [82, 82] |
p02676 | u114233208 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = int(input())\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+"...")', 'K = int(input())\nS = input()\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+"...")'] | ['Runtime Error', 'Accepted'] | ['s063742979', 's036547688'] | [9164.0, 9164.0] | [23.0, 23.0] | [87, 82] |
p02676 | u118772524 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['s=input()\nk=input()\na=len(k)\n\nif s<a\nprint(s)\n\nelif s>a\nprint(k+"...")', 'k=str(input())\ns=int(input())\n\na=len(s)\n\nif k>=a:\nprint(s)\n\nelse k<a:\nprint(s[k]+"...")', 'k=int(input())\ns=str(input())\n\na=len(s)\n\nif k>=a:\nprint(s)\n\nelse :\nprint(s[:k]+"...")', 'k=int(input())\ns=input()\n\na=len(s)\n\nif k>=a:\nprint(s)\n\nelse :\nprint(s[:k]+"...")\n', 's= str(input())\nk= int(input())\n\n\na=len(s)\n\nif k >= a:\n print(s)\n\nelse :\n print(s[:k]+"...")', 's=str(input())\nk=int(input())\na=len(s)\n\nif k<a\nprint(s)\n\nelif k>a\nprint(k+"...")', 'k= int(input())\ns= str(input())\n\na=len(s)\n\nif k >= a:\n print(s)\n\nelse :\n print(s[:k]+"...")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s072447699', 's342175976', 's500325415', 's518096114', 's612798587', 's990096016', 's944015194'] | [8872.0, 8920.0, 8880.0, 8928.0, 9164.0, 8960.0, 9164.0] | [19.0, 21.0, 22.0, 22.0, 23.0, 23.0, 23.0] | [70, 87, 85, 81, 94, 80, 93] |
p02676 | u119982001 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = input()\n\nif k >= len(s):\n print(s)\nelse:\n print(s[0:k], '...')\n", "k = int(input())\ns = input()\n\nif k >= len(s):\n print(s)\nelse:\n print(s[0:k]+'...')\n"] | ['Wrong Answer', 'Accepted'] | ['s223098113', 's090936460'] | [9156.0, 9152.0] | [23.0, 21.0] | [90, 89] |
p02676 | u121204840 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['inputk = input()\nk = int(inputk)\ns = input()\n\nif(len(s) <= k): print(s)\nelse: print(s[0 : k - 1] + "...")\n', 'inputk = input()\nk = int(inputk)\ns = input()\n\nif(len(s) <= k): print(s)\nelse: print(s[1:k] + "...")', 'inputk = input()\nk = int(inputk)\ns = input()\n\nif(len(s) <= k): print(s)\nelse: print(s[0 : k] + "...")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s440764257', 's902624962', 's427448662'] | [9156.0, 9168.0, 9164.0] | [21.0, 23.0, 22.0] | [130, 123, 126] |
p02676 | u121523434 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = str(input())\ne = len(s)\n\nif k < int(len(s)):\n print(n[0:int(e-k)-1]+'.'*3)\nelse:\n print(s)", "k = int(input())\ns = str(input())\ne = int(len(s))\n\nif k < e:\n print(s[0:k]+'.'*3)\nelse:\n print(s)"] | ['Runtime Error', 'Accepted'] | ['s395116854', 's372821233'] | [9104.0, 9172.0] | [22.0, 23.0] | [113, 99] |
p02676 | u123745130 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['n=int(input())\nl=input()\nif len(l)<=n:\n print(l)\nelse:\n print(l[:n+1]+"...")', 'n=int(input())\nl=input()\nif len(l)<=n:\n print(l)\nelse:\n print(l[:n]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s879294862', 's062022608'] | [9160.0, 9164.0] | [24.0, 23.0] | [78, 76] |
p02676 | u124498235 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['import math\na, b, h, m = map(int, input().split())\nx = 360*(h/12)+30*(m/60)\ny = 360*(m/60)\nd = math.cos(math.radians(abs(x-y)))\nz = a**2 + b**2 -2*a*b*d\nprint (math.sqrt(z))\n', 'k = int(input())\ns = input()\nif len(s) <= k:\n\tprint (s)\nelse:\n\tprint (s[:k] + "...")'] | ['Runtime Error', 'Accepted'] | ['s043300521', 's589530745'] | [9228.0, 9164.0] | [22.0, 24.0] | [174, 84] |
p02676 | u125269142 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k])', "k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + '...')\n"] | ['Wrong Answer', 'Accepted'] | ['s626250969', 's191303481'] | [9040.0, 9076.0] | [22.0, 22.0] | [77, 86] |
p02676 | u127499732 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['def main():\n k = int(input())\n s = input()\n\n l = len(s)\n if l <= k:\n print(s)\n else:\n print(s+"...")\n\nif __name__ == \'__main__\':\n main()\n', 'def main():\n k = int(input())\n s = input()\n\n l = len(s)\n if l <= k:\n print(s)\n else:\n print(s[:k]+"...")\n\nif __name__ == \'__main__\':\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s651740885', 's251075007'] | [9160.0, 9168.0] | [23.0, 21.0] | [169, 173] |
p02676 | u131666536 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['# -*- coding: utf-8 -*-\n"""\nCreated on Wed May 27 14:43:56 2020\n\n@author: 17664\n"""\n\nk = int(input())\ns = input()\n\nif len(s) <= k:\n print(s + \'...\')\nelse:\n print(s[:k])', '# -*- coding: utf-8 -*-\n"""\nCreated on Wed May 27 14:43:56 2020\n\n@author: 17664\n"""\n\nk = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + \'...\')'] | ['Wrong Answer', 'Accepted'] | ['s367572979', 's911638304'] | [9020.0, 9108.0] | [22.0, 21.0] | [174, 174] |
p02676 | u133174241 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['K = int(input())\nS = input()\nl = len(S)\nif l <= K:\n print(S)\nelse:\n SS = S[:K]+"…"\n print(SS)\n', 'K = int(input())\nS = input()\nl = len(S)\nif l <= K:\n print(S)\nelse:\n SS = S[:K]+"..."\n print(SS)'] | ['Wrong Answer', 'Accepted'] | ['s647109084', 's274465145'] | [9160.0, 9104.0] | [22.0, 23.0] | [105, 104] |
p02676 | u134245489 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["K = int(input())\nS = str(input())\n\nif len(S) < K :\n print(S)\nelse:\n print(S[0:K+1]+'...')", "K = int(input())\nS = str(input())\n\nif len(S) <= K :\n print(S)\nelse:\n print(S[0:K]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s323958398', 's814428188'] | [9164.0, 9156.0] | [24.0, 24.0] | [95, 94] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.