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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02676
|
u548976218
| 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())\nl = len(s)\nif k >= l:\n print(s)\nelse:\n print(s[0:k])', 'k = int(input())\ns = str(input())\nif len(s) <= k:\n print(s)\nelse:\n print(s[0:k] + "...")']
|
['Wrong Answer', 'Accepted']
|
['s059304487', 's594810936']
|
[9152.0, 9140.0]
|
[22.0, 23.0]
|
[92, 94]
|
p02676
|
u552201227
| 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=len(S)\nif a<=K:\n print(S)\nelse:\n print(S[:K]+"."*(a-K))', 'K=int(input())\nS=input()\na=len(S)\nif a<=K:\n print(S)\nelse:\n print(S[:K]+"."*3)']
|
['Wrong Answer', 'Accepted']
|
['s010590666', 's741862938']
|
[9168.0, 9100.0]
|
[22.0, 21.0]
|
[84, 80]
|
p02676
|
u553308611
| 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()\nif len(S) < K:\n print(S)\nelse:\n print("S[:K]" + "...")\n', 'K = input()\nS = input()\nK = int(K)\nif len(S) <= K:\n print(S)\nelse:\n a = S[:K] + "..."\n print(a)\n']
|
['Runtime Error', 'Accepted']
|
['s601347674', 's058789424']
|
[9088.0, 9096.0]
|
[20.0, 21.0]
|
[85, 105]
|
p02676
|
u556326496
| 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 s = s[:k]\n\nprint(s)', "k = int(input())\ns = input()\n\nif len(s) > k:\n s = s[:k] + '...'\n\nprint(s)\n"]
|
['Wrong Answer', 'Accepted']
|
['s174441130', 's003167458']
|
[9060.0, 8964.0]
|
[22.0, 21.0]
|
[66, 75]
|
p02676
|
u557659226
| 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().rstrip())\ns = list(input().rstrip())\n\nprint(s)\ndef print_len(k,s):\n for i in range(min(k,len(s))):\n print(s[i],end="")\n for i in range(len(s)-k):\n print(\'.\',end="")\n print()\n \nprint_len(k,s)', 'k = int(input().rstrip())\ns = list(input().rstrip())\n\ndef print_len(k,s):\n for i in range(min(k,len(s))):\n print(s[i],end="")\n for i in range(len(s)-k):\n print(\'.\',end="")\n print()\n \nprint_len(k,s)', 'k = int(input().rstrip())\ns = list(input().rstrip())\n\ndef print_len(k,s):\n for i in range(min(k,len(s))):\n print(s[i],end="")\n if len(s)-k > 0:\n print(\'...\',end="")\n print()\n \nprint_len(k,s)']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s727280455', 's876112681', 's266888297']
|
[9192.0, 9176.0, 9176.0]
|
[23.0, 24.0, 20.0]
|
[232, 223, 216]
|
p02676
|
u563430990
| 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()).lower()\n\nif 0 < K < 101 and 0 < len(S) < 101:\n if len(S) =< K:\n print(S)\n else:\n print(S[:K] + "...") \nelse:\n print("Try again with K and length of S between 1 and 100 ")', 'K = int(input())\nS = input()\n\nif 0 < K < 101 and 0 < len(S)+1 < 101:\n if len(S) < K:\n print(S)\n else:\n M = len(S) - K\n print(S[0:M] + "...") \nelif K > 100 or K < 1:\n print("Please choose an interger from 1 to 100")\nelif len(S) > 100 or len(S) < 1:\n print("Please enter at least at least 1 string and not more than 100")\n', 'K = int(input("enter a number: "))\nS = input("enter a random string: ")\ndef f(K, S):\n if 0 < K < 101 and 0 < len(S)+1 < 101:\n if len(S) < K:\n return S\n else:\n M = len(S) - K\n return S[0:M] + "..."\n elif K > 100 or K < 1:\n return "Please choose an interger from 1 to 100"\n elif len(S) > 100 or len(S) < 1:\n return "Please enter at least at least 1 string and not more than 100"\n\nprint (f(K, S))', 'K = int(input())\nS = str(input()).lower()\n\nif 0 < K < 101 and 0 < len(S) < 101:\n if len(S) <= K:\n print(S)\n else:\n print(S[:K] + "...") \nelse:\n print("Try again with K and length of S between 1 and 100 ")']
|
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s355893575', 's493764530', 's936855738', 's292897551']
|
[8956.0, 9184.0, 9132.0, 9020.0]
|
[23.0, 24.0, 21.0, 22.0]
|
[227, 353, 463, 227]
|
p02676
|
u566574814
| 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)\nelif(k < len(s)):\n ans = k-len(s)\n print(s[:ans])', "k = int(input())\ns = input()\n\nif (k >= len(s)):\n print(s)\nelif(k < len(s)):\n ans = k-len(s)\n print(s[:ans]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s732440870', 's465506880']
|
[9168.0, 9164.0]
|
[24.0, 22.0]
|
[109, 116]
|
p02676
|
u568711768
| 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[:K]+"...")', 'K = int(input())\nS = input()\nif K >= len(S):\n print(S)\nelse:\n print(S[:K]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s529799262', 's105462492']
|
[9180.0, 9080.0]
|
[23.0, 21.0]
|
[82, 82]
|
p02676
|
u569479281
| 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 = str(input())\n s = str(input())\n h = len(k)\n w = len(s)\n \n if w<=h:\n print(s)\n else:\n print(s[:h] + '...')\n \nmain()", "def main():\n k = str(input())\n s = str(input())\n h = len(k)\n w = len(s)\n \n if w<h:\n print(s)\n else:\n print(s[:h] + '...')\n \nmain()", "def main():\n k = int(input())\n s = str(input())\n w = len(s)\n \n if w<=k:\n print(s)\n else:\n print(s[:k] + '...')\n \nmain()"]
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s716569471', 's872068718', 's738407865']
|
[9100.0, 9064.0, 9160.0]
|
[20.0, 23.0, 21.0]
|
[147, 146, 134]
|
p02676
|
u569776981
| 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)\nelif len(s) > k:\n print(s[:k - 1] + '...')", "k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelif len(s) > k:\n print(s[: k] + '...')"]
|
['Wrong Answer', 'Accepted']
|
['s040562397', 's247605977']
|
[9084.0, 9040.0]
|
[28.0, 31.0]
|
[104, 101]
|
p02676
|
u574565611
| 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()\ns = input()\n \nif len(k) <= k:\n print(s)\n \nelse:\n print(s[:k] + "...")', 'k = int()\ns = int(input())\n \nif len(s) <= k:\n print(s)\n \nelse:\n print(s[:k] + "...")', 'k = input()\ns = int(input())\n \nif len(k) <= k:\n print(s)\n \nelse:\n print(s[:k] + "...")', 'k = int(input())\ns = int()\n\nif len(s) <= s:\n print(k)\n \nelse:\n print(k[:s] + "...")', 'k = int(input())\ns = input()\n \nif len(s) <= k:\n print(s)\n \nelse:\n print(s[:k] + "...")']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s295933144', 's519808437', 's622675580', 's686425099', 's123125497']
|
[9028.0, 9164.0, 9164.0, 9160.0, 9100.0]
|
[23.0, 20.0, 23.0, 20.0, 22.0]
|
[82, 87, 89, 86, 89]
|
p02676
|
u578722729
| 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(list(S)) > K:\n print(S[0:K-1]+"."*(len(list(S))-K))\nelse:\n print(S)', 'K= int(input())\nS=input()\n\nif len(list(S)) > K:\n print(len(S))\n print(S[0:K]+"...")\nelse:\n print(S)', 'K= int(input())\nS=input()\n\nif len(list(S)) > K:\n print(S[0:K]+"...")\nelse:\n print(S)\n']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s000645861', 's046213374', 's345226702']
|
[9060.0, 9152.0, 9096.0]
|
[22.0, 22.0, 20.0]
|
[107, 108, 91]
|
p02676
|
u580236524
| 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 = [input() for i in range(2)]\n\nk = int(n[0])\ns = n[1]\n\nprint(k,s)\n\nif len(s) <= k:\n print(s)\n\nelse:\n s = s[0:k] + "..."\n print(s)\n ', 'n = [input() for i in range(2)]\n\nk = int(n[0])\ns = n[1]\n\nif len(s) <= k:\n print(s)\n\nelse:\n s = s[0:k] + "..."\n print(s)\n ']
|
['Wrong Answer', 'Accepted']
|
['s360244213', 's053236699']
|
[9176.0, 9168.0]
|
[20.0, 22.0]
|
[145, 133]
|
p02676
|
u580273604
| 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.
|
['7\nnikoandsolstice', "K=int(input())\nS=input()\nif len(S)<=K:print(S)\nelse:print(S[0:K]+'...')"]
|
['Runtime Error', 'Accepted']
|
['s694417007', 's554255605']
|
[9076.0, 9160.0]
|
[25.0, 31.0]
|
[17, 71]
|
p02676
|
u581384797
| 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 s.len()<=k: print(s)\nelse: print(s[:k]+"...")', 'k=int(input())\ns=input()\nif s.len()<=k: print(s)\nelse: print(s[:k]+"...")\n', 'k=int(input())\ns=input()\nif len(s)<=k: print(s)\nelse: print(s[:k]+"...")\n']
|
['Runtime Error', 'Runtime Error', 'Accepted']
|
['s683744940', 's973518778', 's317923765']
|
[9036.0, 9132.0, 9160.0]
|
[21.0, 23.0, 19.0]
|
[71, 74, 73]
|
p02676
|
u581444421
| 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 = int(len(S))\nif s <= K:\n print(S)\nelse:\n print(S[0:K + 1] + '...')\n", "K = int(input())\nS = str(input())\ns = int(len(S))\nif s <= K:\n print(S)\nelse:\n print(S[0:K] + '...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s825561358', 's908296547']
|
[9160.0, 9156.0]
|
[23.0, 24.0]
|
[110, 106]
|
p02676
|
u583276018
| 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()\nl = max(len(s)-n, 0)\nif(l == 0):\n print(s)\nelse:\n k = s(:n)\n print(k + "...")', 'n = int(input())\ns = input()\nl = max(len(s)-n, 0)\nif(l == 0):\n print(s)\nelse:\n k = s[:n]\n print(k + "...")']
|
['Runtime Error', 'Accepted']
|
['s737950167', 's023275768']
|
[9036.0, 9092.0]
|
[22.0, 23.0]
|
[109, 109]
|
p02676
|
u584153341
| 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())\nword = str(input())\n\nif len(word) <= num:\n print(word)\nelse:\n word_r = word[:num]\n for _ in range(len(word) - num):\n word_r += '.'\n print(word_r)", "num = int(input())\nword = str(input())\n\nif len(word) <= num:\n print(word)\nelse:\n word_r = word[:num] + '...'\n print(word_r)"]
|
['Wrong Answer', 'Accepted']
|
['s098839492', 's653770844']
|
[9084.0, 9156.0]
|
[24.0, 23.0]
|
[183, 132]
|
p02676
|
u586857375
| 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[:]+'...')\n", "K = int(input())\nS = input()\nif len(S) <= K:\n print(S)\nelse:\n l = S.split()\n for i in range(K - len(S)):\n l.pop(-1)\n print(''.join(l))", "K = int(input())\nS = input()\nif len(S) <= K:\n print(S)\nelse:\n l = S.split()\n l.pop(K:)\n print(''.join(l))", "K = int(input())\nS = input()\nif len(S) <= K:\n print(S)\nelse:\n l = S.split()\n for i in range(len(S)-K):\n l.pop(-1)\n print(''.join(l))\n", "K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:],'...')", "K = int(input())\nS = input()\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],'...')\n", "K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+'...')\n"]
|
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s234305877', 's337876020', 's342036033', 's574181177', 's722864562', 's751416896', 's963667518', 's389745510']
|
[9176.0, 9140.0, 8896.0, 9132.0, 9160.0, 9100.0, 9088.0, 9072.0]
|
[20.0, 23.0, 22.0, 27.0, 20.0, 21.0, 24.0, 22.0]
|
[83, 141, 109, 140, 82, 84, 83, 84]
|
p02676
|
u587079202
| 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 num = int(K)\n if num >= len(S):\n print(S)\n else:\n print(S[:num]+'...')\n\nK, S = input().split()\n\nmain()\n", "def main():\n num = int(K)\n if num >= len(S):\n print(S)\n else:\n print(S[:num]+'...')\n\nK = int(input())\nS = input()\n\nmain()\n"]
|
['Runtime Error', 'Accepted']
|
['s459694556', 's965275591']
|
[9096.0, 9060.0]
|
[25.0, 24.0]
|
[139, 145]
|
p02676
|
u587155469
| 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, K = input().split()\nK = int(K)\nif len(S) > K:\n S_dash = S[0:K]\n S_dash += '...'\n print(S_dash)\nelse:\n print(S)", "K = int(input())\nS = str(input())\nif len(S) > K:\n S_dash = S[0:K]\n S_dash += '...'\n print(S_dash)\nelse:\n print(S)"]
|
['Runtime Error', 'Accepted']
|
['s521061737', 's645503135']
|
[8936.0, 9068.0]
|
[25.0, 27.0]
|
[125, 125]
|
p02676
|
u588048170
| 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().lower())\nif len(S) <= K:\n print(S)\nelif len(S) > K:\n stol = list(S)\n stol[K] = "..."\n print(stol)', 'K = int(input())\nS = str(input().lower())\nif len(S) <= K:\n print(S)\nelif len(S) > K:\n stol = list(S)\n stol[K-1] = "..."\n print(stol)', 'K = int(input())\nS = str(input().lower())\nif len(S) <= K:\n print(S)\nelif len(S) > K:\n stol = list(S)\n stol[K-1] = "..."\n Cutlist = stol[0:K]\n LtoS = \'\'.join(map(str, Cutlist))\n print(LtoS)', 'K = int(input())\nS = str(input().lower())\nif len(S) <= K:\n print(S)\nelif len(S) > K:\n stol = list(S)\n stol[K] = "..."\n Cutlist = stol[0:K+1]\n LtoS = \'\'.join(map(str, Cutlist))\n print(LtoS)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s018239984', 's162568723', 's577796709', 's990570015']
|
[9204.0, 9176.0, 9188.0, 9068.0]
|
[23.0, 21.0, 24.0, 22.0]
|
[142, 144, 206, 206]
|
p02676
|
u589432040
| 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[0:K+"..."])', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K]+"...")\n']
|
['Runtime Error', 'Accepted']
|
['s222258999', 's565463760']
|
[9100.0, 8992.0]
|
[22.0, 22.0]
|
[84, 85]
|
p02676
|
u589969467
| 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 k > len(s):\n print(s[:k]+'...')\nelse:\n print(s)", "k = int(input())\ns = str(input())\nif k < len(s):\n print(s[:k]+'...')\nelse:\n print(s)"]
|
['Wrong Answer', 'Accepted']
|
['s181043679', 's796911981']
|
[9164.0, 8996.0]
|
[23.0, 26.0]
|
[90, 90]
|
p02676
|
u593346450
| 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\n\ncount = 0\nfor i in sys.stdin:\n if count == 0:\n K = int(i)\n count += 1\n else:\n S = i\nlength = len(S)\nif length <= K:\n print(S)\nelse:\n print(S[0:K] + "…")', 'k = int(input())\ns = input()\n \nlength = len(s)\nif length > K:\n s = s[:K]+"..."\nprint(s)\n', 'k = int(input())\ns = input()\n \nlength = len(s)\nif length > K:\n S = S[:K]+"..."\nprint(S)\n', 'k = int(input())\ns = input()\n \nlength = len(s)\nif length > k:\n s = s[:k]+"..."\nprint(s)\n']
|
['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s226963304', 's683983317', 's833640912', 's273552909']
|
[9168.0, 9160.0, 9040.0, 8960.0]
|
[21.0, 20.0, 22.0, 20.0]
|
[199, 98, 98, 98]
|
p02676
|
u594862874
| 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(S[:len(S)-K]+'...' if len(S)>int(K) else S)", "K = int(input())\nS = input()\n\nprint(S[:K]+'...' if len(S)>int(K) else S)"]
|
['Wrong Answer', 'Accepted']
|
['s595481040', 's611673683']
|
[9164.0, 9168.0]
|
[25.0, 24.0]
|
[79, 72]
|
p02676
|
u600261652
| 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()\ns = len(S)\nif (s <= K):\n print(S)\n', 'K = input()\nS = input()\ncount = len(S)\nlist = 0\na = ""\nfor i in raige(K):\n a = a+S[list]\n list = list + 1\n\nif (count <= K):\n print(S)\nelse:\n print(a+"...")', 'K = input()\nS = input()\ncount = len(S)\nlist = 0\nList = []\nfor i in range(K):\n a = S[list]\n a.attend(List)\n list = list + 1\nif (count <= K):\n print(S)\nelse:\n print(List+"...")', 'K = input()\nS = input()\ncount = len(S)\nlist = 0\nfor i in range(K):\n i = S[list]\n list = list + 1\nif (count <= K):\n print(S)\nelse:\n print(i+"...")', 'K = input()\nS = input()\nlist = 0\na = ""\nfor i in raige(K):\n a = a+S[list]\n list = list + 1\nprint(S if len(S)<=K else a+"...")', 'K = input()\nS = input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")', 'K = input()\nS = input()\ncount = len(S)\nif (count <= K):\n print(S)\nelse:\n print(\'{:.Kg}.format(S)\'+"...")\n', 'K = input()\nS = input()\nlist = 0\na = ""\nfor i in raige(K):\n a = "a+S[list]"\n list = list + 1\n\nif (len(S) <= K):\n print(S)\n', 'K = input()\nS = input()\nif (len(S) <= K):\n print(S)\n', 'K = input()\nS = input()\nprint(S)', 'K = int(input())\nS = input()\nif (len(S) <= K):\n print(S)', 'K = input()\nS = input()\ncount = len(S)\nlist = 0\na = ""\nfor i in raige(K):\n a = a+S[list]\n list = list + 1\n\nif count <= K:\n print(S)\nelse:\n print(a+"...")', 'K = input()\nS = input()\ncount = len(S)\nlist = 0\nList = []\nfor i in range(K):\n print(S[list])\n list = list + 1\nif count <= K:\n print(S)\nelse:\n print( *i +"...")', 'K = input()\nS = input()\ncount = len(S)\nlist = 0\nList = []\nfor i in range(K):\n print(S[list])\n list = list + 1\nif (count <= K):\n print(S)\nelse:\n print( *i +"...")\n', 'K = input()\nS = input()\ns = len(S)\nif s<=K:\n print(S)', 'K = input()\nS = input()\nprint(S if len(S)<=K)', 'K = input()\nS = input()\ns = len(S)\nif (s <= K):\n print(S)', 'K = input()\nS = input()\nif (len(S) <= K):\n print(S)\nelse:\n print(S[K]+"...")', 'K = input()\nS = input()\ncount = len(S)\nlist = 0\na = ""\nfor i in raige(K):\n a = "a+S[list]"\n list = list + 1\n\nif (count <= K):\n print(S)\nelse:\n print(a+"...")', 'K = int(input())\nS = input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s011079046', 's106259500', 's238975674', 's248155788', 's356476189', 's372462807', 's414715988', 's445739282', 's547645610', 's590862989', 's597460160', 's675246218', 's703418156', 's716403439', 's736083115', 's823609745', 's881192757', 's889831812', 's954671556', 's098299885']
|
[9028.0, 9140.0, 9120.0, 8976.0, 9048.0, 8760.0, 9028.0, 9092.0, 9084.0, 9088.0, 9164.0, 8988.0, 9060.0, 9104.0, 9096.0, 9024.0, 9036.0, 9124.0, 9112.0, 9096.0]
|
[24.0, 25.0, 20.0, 21.0, 24.0, 24.0, 20.0, 22.0, 24.0, 24.0, 22.0, 25.0, 23.0, 25.0, 20.0, 22.0, 20.0, 26.0, 23.0, 22.0]
|
[59, 159, 179, 149, 127, 75, 107, 125, 53, 32, 57, 157, 163, 166, 54, 45, 58, 78, 161, 80]
|
p02676
|
u601620345
| 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]+'...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s656365200', 's964277540']
|
[9072.0, 9072.0]
|
[21.0, 21.0]
|
[86, 86]
|
p02676
|
u602128502
| 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())\nchara=input()\nnc=len(chara)\n\nif n=>nc:\n print(chara)\nelse:\t\n print(chara[1:n])\n \n ', 'n=int(input())\nchara=input()\nnc=len(chara)\n\nif n>=nc:\n print(chara)\nelse:\t\n print(chara[0:n]+"...")']
|
['Runtime Error', 'Accepted']
|
['s997294810', 's524931366']
|
[8956.0, 9180.0]
|
[25.0, 21.0]
|
[101, 101]
|
p02676
|
u604269317
| 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[:K],"...")\nelse:\n print(S[:])\n ', 'K=int(input())\nS=input()\n\nif len(S)>K:\n print(S[:K]+"...")\nelse:\n print(S[:])\n ']
|
['Wrong Answer', 'Accepted']
|
['s696106272', 's136473149']
|
[9152.0, 9096.0]
|
[23.0, 22.0]
|
[82, 82]
|
p02676
|
u607629451
| 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\n\nif len(s) <= k :\n print(s)\n\nelse :\n print(s[0:k],"...")', 'k = int(input())\ns = input()\n\n\nif len(s) >= k :\n print(s)\n\nelse :\n print(s[0: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', 'Accepted']
|
['s224135869', 's355442561', 's930767636', 's040783784']
|
[8980.0, 8940.0, 9080.0, 9160.0]
|
[26.0, 29.0, 25.0, 26.0]
|
[91, 92, 92, 91]
|
p02676
|
u609018550
| 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[0] + '...')\nelse:\n print(s)", "length = int(input())\ninput_str = input()\n\nif len(input_str) > length:\n print(input_str + '...')\nelse:\n print(input_str)", "length = input()\ninput_str = input()\n\nif len(input_str) > length:\n print(input_str + '...')\nelse:\n input_str", "length = input()\ninput_str = input()\n\nif len(input_str) > length:\n print(input_str + '...')\nelse:\n print(input_str)", "from sys import stdin\n\nk = int(stdin.readline().rstrip())\ns = stdin.readline().rstrip()\n\nprint(s[:k] + '...' if len(s) > k else s)"]
|
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s119099940', 's130998463', 's386016031', 's439286200', 's839519214']
|
[9156.0, 9104.0, 9064.0, 9088.0, 9168.0]
|
[22.0, 24.0, 25.0, 23.0, 23.0]
|
[87, 126, 114, 121, 130]
|
p02676
|
u611551778
| 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_1=input()\ninput_2=input()\n#print(input_1)\n#print(input_2)\n \nlength = len(input_2)\n#print(length)\n\nif int(length) <= int(input_1):\n print(input_2)\nelse:\n print(input_2[:int(input_1)]+"…")', 'input_1=input()\ninput_2=input()\n#print(input_1)\n#print(input_2)\n \nlength = len(input_2)\n#print(length)\n\nif int(length) <= int(input_1):\n print(input_2)\nelse:\n print(input_2[:int(input_1)]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s500713112', 's467181388']
|
[9172.0, 9156.0]
|
[25.0, 21.0]
|
[203, 203]
|
p02676
|
u612975321
| 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\nn = len(s)\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k+1] + '...')", "k = int(input())\ns = input()\n\nn = len(s)\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + '...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s201892412', 's393685346']
|
[9104.0, 9092.0]
|
[28.0, 29.0]
|
[102, 101]
|
p02676
|
u617037231
| 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\nN = input()\ns = N[-1]\nif s in ['2','4','5','7','9']:\n print('hon')\n sys.exit(0)\nif s in ['0','1','6','8']:\n print('pon')\n sys.exit(0)\nif s == '3':\n print('bon')\n", 'K = int(input())\nS = input()\nl = len(S)\nif l <= K:\n print(S)\nelse:\n s = S[0:K]\n s += "..."\n print(s)\n ']
|
['Wrong Answer', 'Accepted']
|
['s276295562', 's710344158']
|
[9040.0, 9160.0]
|
[20.0, 24.0]
|
[177, 107]
|
p02676
|
u617298485
| 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()\nlength = len(s)\nprint(k)\nprint(s)\nprint(length)\n\nk = int(k)\nif length <= k:\n print(s)\nelse:\n string = ''\n for i in range(k):\n string += s[i]\n string += '...'\n print(string)\n", "k = input()\ns = input()\nlength = len(s)\n# print(k)\n# print(s)\n# print(length)\n\nk = int(k)\nif length <= k:\n print(s)\nelse:\n string = ''\n for i in range(k):\n string += s[i]\n string += '...'\n print(string)\n"]
|
['Wrong Answer', 'Accepted']
|
['s457426107', 's316076812']
|
[9180.0, 9172.0]
|
[22.0, 24.0]
|
[219, 225]
|
p02676
|
u618373524
| 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]+"...")\nprint(len(s))', 'k = int(input())\ns = input()\n\nif len(s) <= k :\n print(s)\nelse :\n print(s[:k]+"...")']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s415887205', 's615984202', 's335598334']
|
[9164.0, 9160.0, 9100.0]
|
[21.0, 22.0, 21.0]
|
[83, 103, 89]
|
p02676
|
u619819312
| 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());s=input();print(s[:k]+"…" if len(s)>k else s)', 'k=int(input());s=input();print(s[:k]+"..." if len(s)>k else s)']
|
['Wrong Answer', 'Accepted']
|
['s392857078', 's356968323']
|
[9164.0, 9048.0]
|
[29.0, 26.0]
|
[62, 62]
|
p02676
|
u625864724
| 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 for i in range (n):\n print(s[i], end = '')\n print()", 'n = int(input())\ns = input()\nx = len(s)\nif (x <= n):\n print(s)\nelse:\n for i in range (n):\n print(s[i], end = \'\')\n print("...")\n']
|
['Runtime Error', 'Accepted']
|
['s065297544', 's531877689']
|
[9164.0, 9156.0]
|
[26.0, 28.0]
|
[119, 133]
|
p02676
|
u626228246
| 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(s if len(s) <= k else s+"...") \n', 's = input()\nk = input()\nprint(s if len(s) <= len(k) else s+"...") ', 'k = int(input())\ns = input()\nprint(s if len(s) <= k else s[:k] +"...") ']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s098477214', 's129608138', 's894413117']
|
[9136.0, 8996.0, 9164.0]
|
[23.0, 22.0, 23.0]
|
[68, 67, 72]
|
p02676
|
u628070051
| 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 x(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n x = S[:K]\n return x + '...'\n\nprint(x)", "def result(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n answer = S[:K]\n return answer + '...'\n", "def x(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[:K] + '...'\n\nprint(x)", "K = int(input())\nS = str(input())\n\ndef result(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n answer = S[:K]\n return answer + '...'\n", "def result(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[:K] + '...'\n\nprint(result)", "def x(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n x = S[:K]\n return x + '...'\n\nprint(x)\n", "def x(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n x = S[:K]\n return x + '...'", "def x(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[:K] + '...'\n", "def result(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[:K] + '...'\n", "K = int(input())\nS = str(input())\n\n\ndef result(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n answer = S[:K]\n return answer + '...'\n\nprint(result(K, S))\n"]
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s040102393', 's076765113', 's094454763', 's179471939', 's345500192', 's650507899', 's843327416', 's895846817', 's984018592', 's145785803']
|
[9028.0, 9004.0, 8968.0, 9052.0, 9024.0, 9084.0, 8948.0, 8996.0, 9020.0, 9028.0]
|
[30.0, 27.0, 29.0, 29.0, 26.0, 27.0, 25.0, 25.0, 27.0, 27.0]
|
[129, 135, 115, 170, 125, 135, 119, 106, 111, 192]
|
p02676
|
u629540524
| 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 S(len) < 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']
|
['s359116820', 's109074362']
|
[9052.0, 9096.0]
|
[22.0, 21.0]
|
[87, 88]
|
p02676
|
u632384660
| 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.
|
["numTest = int(input())\n\ninputLine = input()\n\nprint(inputLine[0 : numTest] + '...' if len(inputLine) > numTest else inputLine", "numTest = int(input())\n\ninputLine = input()\n\nprint(inputLine[0 : numTest] + '...' if len(inputLine) > numTest else inputLine)"]
|
['Runtime Error', 'Accepted']
|
['s004951434', 's300532968']
|
[9024.0, 9096.0]
|
[21.0, 21.0]
|
[124, 125]
|
p02676
|
u632609425
| 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\tprint(S)\nelse:\n\tmae=S[0:len(S)-1]\n\tans=mae + "..."\n\tprint(ans)', 'K=int(input())\nS=input()\nif K>=len(S):\n\tprint(S)\nelse:\n\tmae=S[0:K]\n\tans=mae+"..."\n\tprint(ans)']
|
['Wrong Answer', 'Accepted']
|
['s703802785', 's432266726']
|
[9100.0, 9172.0]
|
[22.0, 23.0]
|
[102, 93]
|
p02676
|
u633591853
| 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())\nstr = input()\nprint(str) if len(str) <= n else print(str[:n + 1] + '...')", "n = int(input())\nstr = input()\nprint(str) if len(str) <= n else print(str[:n] + '...')"]
|
['Wrong Answer', 'Accepted']
|
['s417972673', 's379335942']
|
[9164.0, 9164.0]
|
[22.0, 23.0]
|
[90, 86]
|
p02676
|
u634965946
| 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 = input()\ns = input()\n\nif len(s) <= n:\n print(s)\nelse :\n print(s[:n] + "...")', 'n = int(input())\ns = input()\n\nif len(s) <= n:\n print(s)\nelse :\n print(s[:n] + "...")']
|
['Runtime Error', 'Accepted']
|
['s252268990', 's624000290']
|
[9024.0, 9164.0]
|
[25.0, 27.0]
|
[81, 86]
|
p02676
|
u635864321
| 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().split()\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] + "...")']
|
['Wrong Answer', 'Accepted']
|
['s191444455', 's271135170']
|
[9096.0, 9156.0]
|
[23.0, 22.0]
|
[87, 84]
|
p02676
|
u636256839
| 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().lower()\n\nif len(S) < K and len(S) < 1 and len(S) > 100:\n print(S)\nelif len(S) > K and len(S) < 1 and len(S) > 100:\n print(S[0:K] + '...')\n", 'K = int(input())\nS = input()\n\nif S.islower() and len(S) < K and len(S) < 1 and len(S) > 100:\n print(S)\nelif S.islower() and len(S) > K and len(S) < 1 and len(S) > 100:\n print(f"{S[0:K]}{\'...\'}")\n', 'K = int(input())\nS = input()\n\nif S.islower() and len(S) < K and len(S) <= 1 and len(S) >= 100 and K <= 1 and K >= 100:\n print(S)\nelif S.islower() and len(S) > K and len(S) < 1 and len(S) > 100 and K <= 1 and K >= 10:\n print(f"{S[0:K]}{\'...\'}")\n', 'K = int(input())\nS = input()\n\nif S.islower() and len(S) < K and len(S) <= 1 and len(S) >= 100:\n print(S)\nelif S.islower() and len(S) > K and len(S) <= 1 and len(S) >= 100:\n print(f"{S[0:K]}{\'...\'}")\n', "K = int(input())\nS = input().lower()\n\nif len(S) <= K and len(S) < 1 and len(S) > 100:\n print(S)\nelif len(S) > K and len(S) < 1 and len(S) > 100:\n print(S[0:K] + '...')", 'K = int(input())\nS = input()\n\nif S.islower() and len(S) <= K:\n print(S)\nelif S.islower() and len(S) >= K:\n print(f"{S[0:K]}{\'...\'}")']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s013892757', 's108015732', 's278573710', 's401463736', 's763767694', 's532540644']
|
[9172.0, 9176.0, 9180.0, 9176.0, 9184.0, 9172.0]
|
[22.0, 23.0, 22.0, 18.0, 22.0, 23.0]
|
[173, 201, 250, 205, 173, 138]
|
p02676
|
u639703036
| 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())\ns = input()\nif(len(s) > a):\n print(s +"...")\nelse:\n print(s)', 'a = int(input())\ns = input()\nif(len(s) > a):\n print(s[:a] +"...")\nelse:\n print(s)']
|
['Wrong Answer', 'Accepted']
|
['s753566510', 's303400754']
|
[9092.0, 9092.0]
|
[24.0, 23.0]
|
[83, 87]
|
p02676
|
u642502903
| 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.
|
['x = input()\ny = input()\nz = len(y)\nif z <= x:\n print(y)\nelse:\n print(y[:x]', 'x = input()\ny = input()\nz = len(y)\nif z <= int(x):\n print(y)\nelse:\n print(y[:int(x)])', 'x = input()\ny = input()\nz = len(y)\nif z <= x:\n print(y)\nelse:\n print(y[:x])', 'x = input()\ny = input()\nz = len(y)\nif z <= int(x):\n print(y)\nelse:\n print(y[:x])', "x = input()\ny = input()\nz = len(y)\nif z <= int(x):\n print(y)\nelse:\n print(y[:int(x)]+'...')"]
|
['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s031332326', 's035002555', 's129635237', 's669059736', 's166619300']
|
[9060.0, 9152.0, 9108.0, 9172.0, 9152.0]
|
[24.0, 22.0, 20.0, 23.0, 21.0]
|
[76, 87, 77, 82, 93]
|
p02676
|
u643679148
| 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 length = len(s)-k\n print(s[:k]+'.'*length)\n", "k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s526961354', 's848617836']
|
[9188.0, 9156.0]
|
[23.0, 26.0]
|
[114, 87]
|
p02676
|
u645504441
| 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[0:K-1])', 'K = int(input())\nS = input()\n\nif (len(S) <= K):\n print(S)\nelse:\n print(S[0:K-1] + "...")', 'K = int(input())\nS = input()\n\nif (len(S) <= K):\n print(S)\nelse:\n print(S[0:K] + "...")']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s070757920', 's127742651', 's755845989']
|
[9164.0, 9168.0, 9160.0]
|
[21.0, 20.0, 20.0]
|
[86, 94, 92]
|
p02676
|
u656803083
| 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())\nword = input()\nans = ""\nif len(word) < n:\n print(word)\nelse:\n ans += word[0:n+1] + "..."\n\nprint(ans)', 'n = int(input())\nword = input()\nans = ""\nif len(word) <= n:\n\tprint(word)\nelse:\n\tfor i in range(n):\n \tans += word[i]\n\tans +=("...")\n\tprint(ans)', 'n = int(input())\nword = input()\nans = ""\nif len(word) < n:\n\tprint(word)\nelse:\n\tfor i in range(n):\n \tans += word[i]\nprint(ans + "...")', 'n = int(input())\nword = input()\nans = ""\nif len(word) <= n:\n print(word)\nelse:\n for i in range(n):\n ans += word[i]\n ans +=("...")\n print(ans)', 'k = int(input())\ns = input()\nif len(s)<=k:\n\tprint(s)\nelse:\n print(s[:k]+"...")']
|
['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
|
['s427362498', 's619690402', 's729939354', 's857280918', 's734582224']
|
[9168.0, 9024.0, 8964.0, 9172.0, 9148.0]
|
[32.0, 21.0, 23.0, 30.0, 29.0]
|
[119, 145, 136, 150, 81]
|
p02676
|
u656919695
| 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.
|
["\nk =int(input())\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[0:k]+'…')", "k =int(input())\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[0:k]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s268642156', 's662520058']
|
[9160.0, 9056.0]
|
[21.0, 23.0]
|
[84, 83]
|
p02676
|
u666550725
| 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 = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s316603258', 's766659520']
|
[9160.0, 9160.0]
|
[22.0, 24.0]
|
[79, 84]
|
p02676
|
u667024514
| 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 = str(input())\nif len(s) <= n:\n print(s)\nelse:\n print(s[:k+1]+"...")', 'n = int(input())\ns = str(input())\nif len(s) <= n:\n print(s)\nelse:\n print(s[:n+1]+"...")', 'n = int(input())\ns = str(input())\nif len(s) <= n:\n print(s)\nelse:\n print(s[:n]+"...")\n']
|
['Runtime Error', 'Wrong Answer', 'Accepted']
|
['s201804994', 's848793111', 's215617614']
|
[9164.0, 9164.0, 9136.0]
|
[22.0, 23.0, 23.0]
|
[89, 89, 88]
|
p02676
|
u667937724
| 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 = int(input())\nt = input()\n\nif len(t) =< s:\n print(t)\n \nelse :\n tt = t[0:s]\n print(tt + "...")', 's = int(input())\nt = input()\n\nif len(t) =< s:\n print(t)\n \nelse :\n tt = t[0:s]\n print(tt + "...")', 's = int(input())\nt = input()\n\nif len(t) <= s:\n print(t)\n \nelse :\n tt = t[0:s]\n print(tt + "...")']
|
['Runtime Error', 'Runtime Error', 'Accepted']
|
['s412224119', 's747866174', 's705335141']
|
[9012.0, 9004.0, 9084.0]
|
[27.0, 24.0, 26.0]
|
[101, 101, 101]
|
p02676
|
u668503853
| 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())\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")', 'K=int(input())\nS=list(input())\nif len(S)<=K:\n print("".join(S))\nelse:\n print("".join(S[:K])+"...")\n']
|
['Runtime Error', 'Accepted']
|
['s825737794', 's757228299']
|
[9164.0, 9152.0]
|
[21.0, 23.0]
|
[82, 101]
|
p02676
|
u670127851
| 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()\nk = int(k)\nif len(s) <= k:\n print(s)\nelse:\n print(s[0:k])', 'k = input()\ns = input()\nk = int(k)\nif len(s) <= k:\n print(s)\nelse:\n print(s[0:k],"...")', 'k = input()\ns = input()\nk = int(k)\nif len(s) <= k:\n print(s)\nelse:\n print(s[0:k],"...",sep="")']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s035002096', 's289017178', 's759138488']
|
[9164.0, 9192.0, 9172.0]
|
[22.0, 20.0, 22.0]
|
[87, 93, 100]
|
p02676
|
u671211357
| 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())\nif len(S)<=K:\n print(*S,sep="")\nelse:\n kari=S[:K]\n kari.append("…")\n print(*kari,sep="")', 'K=int(input())\nS=list(input())\nif len(S)<=K:\n print(*S,sep="")\nelse:\n kari=S[:K]\n kari.append("...")\n print(*kari,sep="")']
|
['Wrong Answer', 'Accepted']
|
['s166564556', 's284410925']
|
[9164.0, 9164.0]
|
[24.0, 24.0]
|
[133, 133]
|
p02676
|
u671889550
| 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=[]\n\nif len(S)<=K:\n print(S)\nelse:\n for i in range(K):\n l.append(S[i])\n print("".join(l),\'...\')\n \n ', 'K=int(input())\nS=input()\nl=[]\n\nif len(S)<=K:\n print(S)\nelse:\n for i in range(K):\n l.append(S[i])\n print("".join(l)+\'...\')']
|
['Wrong Answer', 'Accepted']
|
['s259645418', 's337192493']
|
[9124.0, 8956.0]
|
[29.0, 29.0]
|
[145, 137]
|
p02676
|
u672542358
| 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 print(s[:k-1]+"...")', 'k=int(input())\ns=input()\nl=len(s)\nif l<=k:\n print(s)\nelse:\n print(s[:k]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s925441815', 's454153622']
|
[9084.0, 9168.0]
|
[22.0, 23.0]
|
[82, 80]
|
p02676
|
u673355261
| 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), K)\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] + '...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s218395300', 's006892635']
|
[9160.0, 9152.0]
|
[24.0, 20.0]
|
[107, 90]
|
p02676
|
u674343825
| 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],"...",sep="")']
|
['Wrong Answer', 'Accepted']
|
['s425176487', 's122642391']
|
[9160.0, 9168.0]
|
[23.0, 22.0]
|
[86, 93]
|
p02676
|
u677991935
| 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.
|
['\nK = int(input())\nS = input()\n\nif(K>=7):\n print(S)\nelse:\n print(S[0:7]+"...")\n', '\nK = int(input())\nS = input()\n\nif(K>=len(S)):\n print(S)\nelse:\n print(S[0:K]+"...")\n']
|
['Wrong Answer', 'Accepted']
|
['s726732843', 's724154082']
|
[9156.0, 9176.0]
|
[20.0, 22.0]
|
[84, 89]
|
p02676
|
u678048156
| 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']
|
['s615539096', 's114837988']
|
[9164.0, 9160.0]
|
[23.0, 23.0]
|
[87, 85]
|
p02676
|
u678505520
| 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[:7],'...')", "k = int(input())\ns = str(input())\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s315218420', 's010680911']
|
[9160.0, 9160.0]
|
[22.0, 22.0]
|
[91, 91]
|
p02676
|
u680503348
| 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 inp():\n return(int(input()))\n\n\nk = inp()\n\ns = input()\nres = s\nif len(s) > k:\n res = s[:k+1] + "..."\nprint(res)\n', 'def inp():\n return(int(input()))\n\n\nk = inp()\n\ns = input()\nres = s\nif len(s) > k:\n res = s[:k] + "..."\nprint(res)\n']
|
['Wrong Answer', 'Accepted']
|
['s842837338', 's169229966']
|
[9160.0, 9156.0]
|
[23.0, 22.0]
|
[121, 119]
|
p02676
|
u681502232
| 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.
|
["#168b\n\nK = int(input())\nS = str(input())\n\n\ndef answer(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[K:] + '...'\n\n\nprint(answer(K, S))", "#168b\n\nK = int(input())\nS = str(input())\n\n\ndef answer(K: int, S: str) -> str:\n if len(S) <= K:\n return S\n else:\n return S[:K] + '...'\n\n\nprint(answer(K, S))"]
|
['Wrong Answer', 'Accepted']
|
['s924918421', 's132899262']
|
[9096.0, 9192.0]
|
[28.0, 27.0]
|
[265, 265]
|
p02676
|
u682616422
| 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\n\n\nif len(s) <= k:\n\tprint(s)\nelse:\n\ts = s.ljust(k)\n\tprint(s + "...")', 'k = int(input())\ns = input()\n\n\nif(len(s) <= k):\n\tprint(s)\nelse:\n\tcnt = 0\n\ta = ""\n\tfor i in s:\n\t\ta += i\n\t\tcnt += 1\n\t\tif cnt == k:\n\t\t\tbreak\n\tprint(a + "...")\n\n\n']
|
['Wrong Answer', 'Accepted']
|
['s383124055', 's139524321']
|
[9172.0, 9180.0]
|
[24.0, 20.0]
|
[97, 158]
|
p02676
|
u684267998
| 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.
|
['\nk=int(input())\ns=str(input())\n\nss = list(s)\n\nif len(s) <= k :\n print(s)\nelse:\n ss = ss[0:len(s)-k]\n print(\'\'.join(ss)+"...")', '\nk=int(input())\ns=str(input())\n\nss = list(s)\n\nif len(s) <= k :\n print(s)\nelse:\n ss = ss[0:k]\n print(\'\'.join(ss)+"...")\n\n']
|
['Wrong Answer', 'Accepted']
|
['s927060616', 's987511309']
|
[9204.0, 9160.0]
|
[22.0, 24.0]
|
[134, 129]
|
p02676
|
u685244071
| 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)\nelse:\n print(S + "...")\n', 'K = int(input())\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:K+1] + "...")\n', 'K = int(input())\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:(K+1)] + "...")\n', 'K = int(input())\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:(K-1)] + "...")', 'K = int(input())\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:K] + "...")\n']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s212370507', 's448328977', 's726217339', 's741650717', 's672436865']
|
[9056.0, 9084.0, 9044.0, 9092.0, 9088.0]
|
[21.0, 22.0, 21.0, 23.0, 22.0]
|
[88, 94, 96, 95, 92]
|
p02676
|
u685684561
| 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())\nimport sys\ns=''\nfor i in range(K+1):\n try:\n s+=S[i]\n except IndexError:\n print (s)\n sys.exit()\ns=s+'...'\nprint (s)", "K=int(input())\nS=str(input())\nimport sys\ns=''\nfor i in range(K):\n try:\n s+=S[i]\n except IndexError:\n print (s)\n sys.exit()\nif s==S:\n print (s)\nelse:\n s=s+'...'\n print (s)"]
|
['Wrong Answer', 'Accepted']
|
['s809478044', 's905254501']
|
[9112.0, 9212.0]
|
[23.0, 23.0]
|
[171, 206]
|
p02676
|
u689890477
| 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],"...")', 'k = int(input())\ns = input()\n\nif len(s)<= k:\n print(s)\nelse:\n print(s[:k]+"...")']
|
['Wrong Answer', 'Runtime Error', 'Accepted']
|
['s435197361', 's695378088', 's544715821']
|
[9164.0, 9164.0, 9164.0]
|
[23.0, 22.0, 22.0]
|
[86, 86, 86]
|
p02676
|
u690145987
| 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))\nif len(S) <= K:\n print(S)\nelse:\n print(f"{S[:K]}...")', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(f"{S[:K]}...")']
|
['Wrong Answer', 'Accepted']
|
['s743962625', 's179403594']
|
[9164.0, 9168.0]
|
[24.0, 25.0]
|
[102, 89]
|
p02676
|
u691558266
| 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+1])', "k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + '...')"]
|
['Runtime Error', 'Accepted']
|
['s727391274', 's751161763']
|
[8968.0, 9124.0]
|
[26.0, 30.0]
|
[78, 89]
|
p02676
|
u693333798
| 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.
|
['Kkk = int(input()) \nString = str(input())\nif len(String)==Kkk :\n print(String) \nelse : \n String.translate({ord(i): None for i in range(Kkk+1,len(String)-1)})\n print(String.append("..."))\n ', 'Kkk = int(input()) \nString = str(input())\nres=""\nif len(String)>Kkk :\n for i in range (0,len(String)):\n if i<=Kkk-1:\n res=res+String[i]\n print(res+("..."))\nelse : \n print(String)\n \n']
|
['Runtime Error', 'Accepted']
|
['s745349074', 's527829212']
|
[9180.0, 9172.0]
|
[23.0, 22.0]
|
[195, 198]
|
p02676
|
u695474809
| 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 for i in range(K):\n print(S[i],end="")\n print("…")\nelse:\n print(S)', 'K = int(input())\nS = input()\nif(len(S)>K):\n for i in range(K):\n print(S[i],end="")\n print(". . .")\nelse:\n print(S)', '\nK=int(input())\nS=input()\nif K>=len(S):\n print(S)\nelse:\n print(S[0:K]+"...")']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s685184660', 's936275207', 's222416413']
|
[8980.0, 9144.0, 9164.0]
|
[25.0, 21.0, 27.0]
|
[128, 130, 1222]
|
p02676
|
u697502900
| 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']
|
['s225461735', 's377875288']
|
[8968.0, 9148.0]
|
[22.0, 22.0]
|
[84, 84]
|
p02676
|
u699944218
| 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 = list(S)\nif len(S) >= K:\n ansl = ls[0:K-1]\nprint(''.join(ansl) + '...')", "K = int(input())\nS = input()\nls = list(S)\nif len(S) > K:\n ansl = ls[0:K]\n print(''.join(ansl) + '...')\nelse:\n print(S)"]
|
['Runtime Error', 'Accepted']
|
['s760008228', 's431672114']
|
[9164.0, 9172.0]
|
[22.0, 25.0]
|
[105, 121]
|
p02676
|
u701513230
| 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\nls = len(S)\nif ls <= K:\n print(S)\nelse:\n print(S[:K])', 'K = int(input())\nS = input()\n\nls = len(S)\nif ls <= K:\n print(S)\nelse:\n print(S[:K]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s033216013', 's599609480']
|
[9000.0, 9100.0]
|
[27.0, 26.0]
|
[85, 91]
|
p02676
|
u704287489
| 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 for i in range(len(S))\n \tif i <= K:\n print(S[i],end="")\n else:\n print("...")\n break', 'K = int(input())\nS = input()\nif int(len(S)) <= K:\n print(S)\nelse:\n for i in range(len(S)):\n if i < K:\n print(S[i],end="")\n else:\n print("...")\n break']
|
['Runtime Error', 'Accepted']
|
['s336862627', 's948582794']
|
[8964.0, 9180.0]
|
[20.0, 23.0]
|
[171, 172]
|
p02676
|
u706121438
| 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-1] + "...")', 'k = int(input())\ns = input()\nif len(s) <= k:\n print(s)\nelse:\n print(s[: k] + "...")']
|
['Wrong Answer', 'Accepted']
|
['s494262838', 's717811609']
|
[9160.0, 9164.0]
|
[24.0, 20.0]
|
[91, 89]
|
p02676
|
u706330549
| 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\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\nk = int(input())\ns = input()\n\nt = ""\na = len(s)\n\n\nif k >= a:\n print(s)\nelse:\n for i in range(k, len(s)):\n t += "."\n\n print(s[:k] + t)\n', 'import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\nk = int(input())\ns = input()\n\nt = ""\na = len(s)\n\n\nif k >= a:\n print(s)\nelse:\n print(s[:k] + "...")\n']
|
['Wrong Answer', 'Accepted']
|
['s074803221', 's140746068']
|
[9120.0, 9112.0]
|
[24.0, 23.0]
|
[228, 183]
|
p02676
|
u707187541
| 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\nlist1=(input()).split()\nA=int(list1[0])\nB=int(list1[1])\nH=int(list1[2])\nM=int(list1[3])\np=math.pi\nHM=(A**2+B**2-2*A*B*(math.cos(abs(p*H/6-p*M/30))))**0.5\nprint(HM)', 'K=int(input())\nS=input()\nlist1=[]\nif len(S)<=K:\n print(S)\nelse:\n for i in range(K):\n list1.append(S[i])\n list1.append("...")\n S2="".join(list1)\n print(S2)']
|
['Runtime Error', 'Accepted']
|
['s096650998', 's298094456']
|
[9132.0, 9180.0]
|
[25.0, 28.0]
|
[175, 162]
|
p02676
|
u714410759
| 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 = input()\nlast_char = input[-1]\nif last_char == "3":\n print("bon")\nelif last_char in ["0", "1", "6", "8"]:\n print("pon")\nelse:\n print("hon")', 'max_length = int(input())\ninput_string = input()\nif len(input_string) <= max_length:\n print(input_string)\nelse:\n print(input_string[:max_length] + "...")']
|
['Wrong Answer', 'Accepted']
|
['s866034113', 's403998640']
|
[8880.0, 9164.0]
|
[22.0, 21.0]
|
[155, 159]
|
p02676
|
u715435591
| 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\nn = len(s)\nif n > K:\n print(S)\nelse:\n print(S[0:K+1]+'...')", "K = int(input())\nS = input()\n\nn = len(S)\nif n <= K:\n print(S)\nelse:\n print(S[0:K+1] + '...')\n", "K = int(input())\nS = input()\n\nn = len(S)\nif n <= K:\n print(S)\nelse:\n print(S[0:K] + '...')\n"]
|
['Runtime Error', 'Wrong Answer', 'Accepted']
|
['s381769157', 's811350061', 's605959690']
|
[9108.0, 8876.0, 9088.0]
|
[25.0, 27.0, 30.0]
|
[91, 99, 97]
|
p02676
|
u720124072
| 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[K:]+"...")', 'K = int(input())\nS = str(input())\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s773256200', 's725920750']
|
[9076.0, 9072.0]
|
[21.0, 23.0]
|
[88, 88]
|
p02676
|
u723636155
| 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[:K])', 'K = int(input())\nS = str(input())\n\nif len(S) <=K:\n print(S)\nelse:\n print(S[:K] + "...")']
|
['Wrong Answer', 'Accepted']
|
['s713960076', 's206904832']
|
[9040.0, 9160.0]
|
[21.0, 22.0]
|
[85, 93]
|
p02676
|
u724088399
| 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())\n S = input()\n print(S[:K]+'...')", "K = int(input())\nS = input()\nif len(S) > K:\n print(S[:K]+'...')\nelse:\n print(S)\n "]
|
['Runtime Error', 'Accepted']
|
['s363321547', 's484716956']
|
[8996.0, 9092.0]
|
[25.0, 30.0]
|
[59, 90]
|
p02676
|
u724295910
| 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()\nK = int(K)\nS = input()\n\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K], '...')\n", "K = input()\nK = int(K)\nS = input()\n\n\nif len(S) > K:\n print(S)\nelse:\n print(S[:K], '...')\n", "K = map(int, input())\nS = input()\n\n\nif len(S) > K:\n print(S)\nelse:\n print(S[:K], '...')", "K = input()\nK = int(K)\nS = input()\n\n\nif len(S) <= K:\n print(S)\nelse:\n print(f'{S[:K]}...')"]
|
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
|
['s337444710', 's512955290', 's683691203', 's663099861']
|
[9108.0, 9044.0, 9008.0, 9056.0]
|
[21.0, 21.0, 21.0, 24.0]
|
[92, 91, 89, 96]
|
p02676
|
u726154863
| 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 n=s[0:k]\n print(n)', "k=int(input())\ns=input()\nl=len(s)\nif l<=k:\n print(s)\nelse:\n n=s[0:k]\n print(n+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s735754980', 's976584935']
|
[9164.0, 9072.0]
|
[19.0, 25.0]
|
[87, 93]
|
p02676
|
u727238330
| 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(str())\n\nif K >= len(S):\n print(S)\nelse:\n print(S[:0 + K], "...")', 'K = int(input())\nS = input(str())\n\nif K >= len(S):\n print(S)\nelse:\n print(S[:+ K], ("..."), sep=\'\')']
|
['Wrong Answer', 'Accepted']
|
['s443530801', 's737919305']
|
[8932.0, 9156.0]
|
[28.0, 30.0]
|
[97, 105]
|
p02676
|
u728564399
| 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())\n\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:K+1]+'...')", "K = int(input())\n\nS = input()\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:K]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s116803049', 's604828951']
|
[9072.0, 9160.0]
|
[22.0, 23.0]
|
[92, 90]
|
p02676
|
u729119068
| 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:print(S)\nelse:print(S[0:K-1]+'...')", "K=int(input())\nS=input()\nif len(S)<=K:print(S)\nelse:print(S[0:K]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s935856285', 's531145507']
|
[9072.0, 9048.0]
|
[28.0, 28.0]
|
[73, 71]
|
p02676
|
u730747703
| 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[:K])\nelif len(S) > K:\n print(S[:K] + ("." * (len(S) - K)))\n', 'K = int(input())\nS = str(input())\nif len(S) <= K:\n print(S[:K])\nelif len(S) > K:\n print(S[:K] + ("." * 3))\n']
|
['Wrong Answer', 'Accepted']
|
['s524917011', 's237942352']
|
[9168.0, 9156.0]
|
[21.0, 22.0]
|
[124, 113]
|
p02676
|
u730807152
| 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\nK = int(K)\n\nif (len(S) <= K):\n print(S)\n\nelif (len(S) > K):\n M = S[K:]\n print(M + "...")', 'K = input()\nS = input()\n\nK = int(K)\n\nif (len(S) <= K):\n print(S)\n\nelif (len(S) > K):\n M = S[:K]\n print(M + "...")']
|
['Wrong Answer', 'Accepted']
|
['s003881256', 's132648024']
|
[9048.0, 9112.0]
|
[23.0, 25.0]
|
[122, 122]
|
p02676
|
u732710135
| 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)\n"]
|
['Wrong Answer', 'Accepted']
|
['s581782345', 's379276219']
|
[9168.0, 8940.0]
|
[20.0, 22.0]
|
[86, 85]
|
p02676
|
u733837151
| 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\n\n\nN, M = map(int, input().split())\nstudy_days = map(int, input().split())\n\n\n# study_days_list = []\n# study_days_list.append(study_days)\n# print(study_days_list)\n\ntotal_study_days = sum(study_days)\n\nanswer = (N - total_study_days)\n\nif answer < 0:\n print(-1)\nelse:\n print(answer)', "K = int(input())\nS = str(input())\n\nSK = S[0 : (K)]\n\nif len(S) <= K:\n print(S)\nelse:\n print(SK + '...')"]
|
['Runtime Error', 'Accepted']
|
['s980457603', 's707978162']
|
[9008.0, 9132.0]
|
[26.0, 26.0]
|
[852, 108]
|
p02676
|
u734169929
| 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.
|
['\nK = int(input())\nS = input()\n\nif len(S) <= K-1:\n print(S)\nelse:\n print(S[0:K-1],"...")', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K-1],"...")', 'S = map(str, input())\nK = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K],"...")', 'S = str(input())\nK = int(input())\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K],"...")', 'S = input()\nK = int(input())\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K],"...")', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K]+"...")']
|
['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s425985527', 's451725286', 's495460378', 's806568818', 's888974219', 's942890415']
|
[9108.0, 9108.0, 9100.0, 9104.0, 9044.0, 9168.0]
|
[22.0, 21.0, 24.0, 21.0, 24.0, 22.0]
|
[89, 86, 89, 89, 84, 84]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.