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
|
u345132740
| 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=str(S)\nC=len(S)\nprint(C)\nif(int(C)<=int(K)):\n print(S)\nelse:\n print((S[:int(K)])+"...")', 'K=input()\nS=input()\nS=str(S)\nC=len(S)\n\nif(int(C)<=int(K)):\n print(S)\nelse:\n print((S[:int(K)])+"...")']
|
['Wrong Answer', 'Accepted']
|
['s262904253', 's014944132']
|
[9140.0, 9172.0]
|
[20.0, 23.0]
|
[111, 103]
|
p02676
|
u345621867
| 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())\nresult =[]\nfor i,letter in enumerate(s):\n result.append(letter)\n if k == 0:\n print("...")\n break\n elif i+1 == k:\n break\n elif i+1 > k:\n result.append("...")\n break\nprint("".join(result))\n', 'k = int(input())\ns = list(input())\nresult =[]\nfor i,letter in enumerate(s):\n if k == 0:\n result.append("...")\n break\n elif i+1 <= k:\n result.append(letter)\n else:\n result.append("...")\n break\nprint("".join(result))\n']
|
['Wrong Answer', 'Accepted']
|
['s215613202', 's137325492']
|
[9164.0, 9160.0]
|
[23.0, 24.0]
|
[269, 259]
|
p02676
|
u347397127
| 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:]+"...")\n', '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]+"...");\n']
|
['Wrong Answer', 'Runtime Error', 'Accepted']
|
['s227108303', 's457901462', 's402870234']
|
[9156.0, 9172.0, 9132.0]
|
[22.0, 25.0, 25.0]
|
[83, 80, 84]
|
p02676
|
u349765885
| 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 moji(S,K):\n if len(S)<=K:\n print(S)\n else:\n T=""\n for i in range(len(S)):\n if i <K:\n T+=S[i]\n if i >=K:\n continue\n T+="..."\n print(T)\n ', 'K=int(input())\nS=input()\n\ndef moji(S,K):\n if len(S)<=K:\n print(S)\n else:\n T=""\n for i in range(len(S)):\n if i <K:\n T+=S[i]\n if i >=K:\n continue\n T+="..."\n print(T)', 'K=int(input())\nS=input()\n\ndef moji(S,K):\n if len(S)<=K:\n print(S)\n else:\n T=""\n for i in range(len(S)):\n if i <K:\n T+=S[i]\n if i >=K:\n continue\n T+="..."\n print(T)\n\nmoji("S",K)\n', 'K=int(input())\nS=input()\n\ndef moji(S,K):\n if len(S)<=K:\n print(S)\n else:\n T=""\n for i in range(len(S)):\n if i <K:\n T+=S[i]\n if i >=K:\n continue\n T+="..."\n print(T)\n\nmoji(S,K)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s126866064', 's651732564', 's857249366', 's584713650']
|
[9072.0, 9188.0, 9048.0, 9080.0]
|
[24.0, 22.0, 23.0, 22.0]
|
[240, 257, 271, 268]
|
p02676
|
u353919145
| 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.
|
['# program to print the new string after performing append operation in the string s "..." \n# if only the character s is more than k but if the character s is at most k\n# the output will not change\n#first we will define the new string\n\nk =int(input())\ns = input()\n\nstr = s\ndots = "..."\nif len(s) == k:\nprint(s)\nelif len(s) > k:\nprint (str[0:k],"...")\n\n', 'string=input()\nnumber=int(input())\ncharacters=len(string)\nempty=""\nif characters<=number:\n print(string)\nelse:\n i=0\n while i<=number-1:\n empty+=string[i]\n i=i+1\n print(f"{empty}...")', 'K=int(input())\nS=input()\nif len(S)==K:\n print (S)\nelse:\n print(S[K]) ', '\nk= input()\ns= str(input())\n\nwhile k==1 and k<=100 and len(s)==1 and len(s)<=100: #check if k and s are between 1 to 100\n\n if len(s) > k:\n #s.slice(k)\n print (s.slice(k)+"...") #cut the str until value of k and add ... to the end\n\n else:\n print (s)', 'K=int(input())\nS=input()\nif lens(s)>k:\n print(S[ :K ] + "...")\nelse:\n print(s)\nS[]\nS[5:]\n', '#input an interget\nK=int(input())\n#input an string\nS=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\nS2="..."\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(S)\n#if not, delete the last character of the string\nelse:\n for i in range(x):\n S=S[i]\n#and then join the two strings together\n newstr="".join((S,S2))\n print(newstr)\n', 'K=int(input())\nS=input()\n\nif len(S)<K or len(S)==K:\n print (S)\nelif len(S)>K:\n print(S[K]) \n', 'number=int(input())\nstring=input()\ncharacters=len(string)\nempty=""\nif characters<=number:\n print(string)\nelse:\n i=0\n while i<=number-1:\n empty+=string[i]\n i=i+1\n print(f"{empty}...")']
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted']
|
['s061868788', 's152734214', 's231967432', 's400180876', 's640508502', 's889060658', 's938566788', 's813049274']
|
[9020.0, 9176.0, 9188.0, 9004.0, 8900.0, 9140.0, 9152.0, 9092.0]
|
[23.0, 22.0, 28.0, 25.0, 24.0, 22.0, 26.0, 28.0]
|
[351, 203, 76, 275, 95, 518, 99, 203]
|
p02676
|
u354623416
| 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)\nelse:\n print (S[0:K]+ " ... ") \n', 'K = int(input())\nS = str(input())\nif K >= len(S):\n print (S)\nelse:\n print (S[0:K]+ "...") \n']
|
['Wrong Answer', 'Accepted']
|
['s311177427', 's032521224']
|
[9088.0, 9096.0]
|
[25.0, 31.0]
|
[98, 97]
|
p02676
|
u355154595
| 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]'+'...')\n ", "k=int(input())\ns=input()\nif int(len(s))<=k:\n print(s)\nelse:\n print(s[0:k]+'...')\n"]
|
['Runtime Error', 'Accepted']
|
['s689357211', 's771590207']
|
[9012.0, 9008.0]
|
[25.0, 25.0]
|
[88, 83]
|
p02676
|
u356488962
| 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] + "...")\n']
|
['Wrong Answer', 'Runtime Error', 'Accepted']
|
['s323969115', 's629271062', 's407158220']
|
[9156.0, 9160.0, 9088.0]
|
[23.0, 20.0, 23.0]
|
[91, 91, 90]
|
p02676
|
u362599643
| 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))\nif len(s)<=k: print(s)\nelse:\n print(s[:k]+'...')", "k = int(input())\ns = input()\n\nprint(len(s))\nif len(s)<k: print(s)\nelse:\n print(s[:7]+'...')", "k = int(input())\ns = input()\n\nif len(s)<=k: print(s)\nelse:\n print(s[:k]+'...')"]
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s108073155', 's112437812', 's035908714']
|
[9164.0, 9160.0, 9160.0]
|
[21.0, 24.0, 23.0]
|
[95, 94, 81]
|
p02676
|
u363080243
| 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())\nB = str(input())\nif N > len(B):\n print(B)\nelse:\n print(B[:(len(B)-1)] +"...")', 'N = int(input())\nB = str(input())\nif N == len(B):\n print(B)\nelse:\n print(B[:(len(B)-1)] +"...")', 'N = int(input())\nB = str(input())\nc = []\nif N > len(B):\n print(B)\nelse:\n c.append(B[:(len(B)-1)] + "...")\n c.append\n print(c)', 'N = int(input())\nB = str(input())\nif N == len(B):\n print(B)\nelse:\n print(B[:(len(B)-1)])', 'N = int(input())\ns = input()\ns = s.lower()\nls = []\nif len(s) <= N:\n print(s)\nelse:\n c = s[:N] +"..."\n print(c)']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s150349426', 's397761870', 's770217019', 's835217215', 's421673350']
|
[9160.0, 9168.0, 9184.0, 9172.0, 9164.0]
|
[22.0, 20.0, 21.0, 20.0, 23.0]
|
[100, 101, 137, 94, 119]
|
p02676
|
u365491796
| 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.
|
["# 168 B\nK = int(input())\nS = input()\nif len(str(S)) =< K:\n print(S)\nelse:\n print(S[:K]+'...')", "# 168 B\nK = int(input())\nS = input()\nif len(str(S)) <= K:\n print(S)\nelse:\n print(S[:K]+'...')"]
|
['Runtime Error', 'Accepted']
|
['s049351864', 's151059204']
|
[8948.0, 9148.0]
|
[25.0, 29.0]
|
[99, 99]
|
p02676
|
u366796457
| 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\ns=len(S)\n\nif K<s:\n print(S[0:s+1]+"...")\nif s<=K:\n print(S)', 'K=int(input())\nS=input()\n\n\nif len(S)<=K:\n print(S)\n\nelse:\n print(S[0:K]+"...")\n']
|
['Wrong Answer', 'Accepted']
|
['s153309115', 's349406311']
|
[9172.0, 9156.0]
|
[24.0, 20.0]
|
[91, 85]
|
p02676
|
u366996583
| 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()\nimport numpy as np\np=list(s)\nl=len(p)\nif l<=k:\n print(s)\nelse:\n arr=np.array(p)\n print(p+'...')", "k=int(input())\ns=input()\nimport numpy as np\np=list(s)\nl=len(p)\nif l<=k:\n print(s)\nelse:\n arr=np.array(p)\n arr=arr[0:k]\n print(''.join(list(arr))+'...')"]
|
['Runtime Error', 'Accepted']
|
['s343882053', 's974991555']
|
[27136.0, 27148.0]
|
[115.0, 114.0]
|
[123, 155]
|
p02676
|
u367147039
| 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[1:k+1]+"...")\n', 'k=int(input())\ns=input()\nif len(s)<=k:\n print(s)\nelse:\n print(s[0:k]+"...")\n']
|
['Wrong Answer', 'Accepted']
|
['s564703588', 's485139746']
|
[9084.0, 9048.0]
|
[28.0, 25.0]
|
[84, 82]
|
p02676
|
u368074441
| 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 print(S[:K])\n\nif __name__ == '__main__':\n main()", "def main():\n K = int(input())\n S = input()\n\n if(len(S) <= K):\n print(S)\n else:\n print(S[:K] + '...')\n\nif __name__ == '__main__':\n main()"]
|
['Wrong Answer', 'Accepted']
|
['s644421315', 's151344505']
|
[9136.0, 9144.0]
|
[19.0, 23.0]
|
[104, 166]
|
p02676
|
u368270116
| 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())\nK=input()\nif len(k)<=n:\n print(k)\nelse:\n a=k[0:n+1]\n print(a+"...")', 'n=int(input())\nk=input()\nif len(k)<=n:\n print(k)\nelse:\n a=k[0:n+1]\n print(a+"...")', 'n=int(input())\nk=input()\nif len(k)<=n:\n print(k)\nelse:\n a=k[:n]\n print(a+"...")']
|
['Runtime Error', 'Wrong Answer', 'Accepted']
|
['s037669916', 's174358895', 's085989082']
|
[9168.0, 9160.0, 9168.0]
|
[22.0, 24.0, 23.0]
|
[85, 85, 82]
|
p02676
|
u373047809
| 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, s = int(input()), input()\nprint(s[::k] + "..." if len(s) > k else s)', 'k, s = int(input()), input()\nprint(s[:k] + "..." if len(s) > k else s)']
|
['Wrong Answer', 'Accepted']
|
['s597704515', 's201391633']
|
[9088.0, 9056.0]
|
[26.0, 22.0]
|
[71, 70]
|
p02676
|
u373858851
| 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\ndef printt(S,K):\n\tif len(S)<=K:\n print(S)\n else:\n print(s[:k]+'...')\n \nprintt(S,K)", "K=int(input())\nS=input()\n \ndef printt(S,K):\n if len(S)<=K:\n print(S)\n else:\n print(S[:K]+'...')\n \nprintt(S,K)\n"]
|
['Runtime Error', 'Accepted']
|
['s939351667', 's023048645']
|
[8856.0, 9096.0]
|
[20.0, 21.0]
|
[126, 123]
|
p02676
|
u375252963
| 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 nl=s[0:n]\n print(nl,'...')\nelse:\n print(s)", "n=int(input())\ns=input()\nnl=s[0:n]\nprint(nl,'...')", "n=int(input())\ns=input()\nif len(s)>n:\n nl=s[0:n]\n print(nl+'...')\nelse:\n print(s)"]
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s108304902', 's539755103', 's729317618']
|
[9084.0, 9184.0, 9100.0]
|
[25.0, 21.0, 22.0]
|
[90, 50, 90]
|
p02676
|
u376637061
| 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']
|
['s459927385', 's226938963']
|
[9104.0, 9164.0]
|
[21.0, 23.0]
|
[79, 88]
|
p02676
|
u378691508
| 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\nlen_S=len(S)\n\nif K<=len_S:\n print(S)\n \nelse:\n print(S[K:], "...")', 'K=int(input())\nS=str(input())\n\n\nif K>=len(S):\n print(S)\n \nelse:\n print(S[:K]+ "...")\n\n']
|
['Runtime Error', 'Accepted']
|
['s388733211', 's434586994']
|
[9084.0, 9148.0]
|
[27.0, 32.0]
|
[89, 89]
|
p02676
|
u379378343
| 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()\nlen1 = len(s)\nprint(len1)\nif(len1>=n):\n print(s[0:n]+"...")\nelse:\n print(s)', 'n = int(input())\ns = input()\nlen1 = len(s)\nprint(len1)\nif(len1>n):\n print(s[0:n]+"...")\nelse:\n print(s)', 'k = int(input())\ns = input()\nlen1 = len(s)\nif(len1>k):\n print(s[0:k]+"...")\nelse:\n print(s)']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s292638159', 's540235712', 's470408743']
|
[9032.0, 9168.0, 9100.0]
|
[22.0, 24.0, 21.0]
|
[110, 109, 97]
|
p02676
|
u382169090
| 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 len(s) > k:\n print(s[:k] + '...')\nelse:\n print(s)", "s = int(input())\nk = input()\n\nif s < len(k):\n print(k + '...')\nelse:\n print(k)", "s = int(input())\nk = input()\n\nif s <= len(k):\n print(k + '...')\nelse:\n print(k)", "k = int(input())\ns = input()\n\nif len(s) > k:\n print(s[:k] + '...')\nelse:\n print(s)"]
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s113511458', 's282065620', 's602013538', 's684071922']
|
[9164.0, 9168.0, 9160.0, 9128.0]
|
[26.0, 22.0, 21.0, 22.0]
|
[98, 80, 81, 84]
|
p02676
|
u382407432
| 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']
|
['s629200191', 's298718043']
|
[9160.0, 9164.0]
|
[23.0, 21.0]
|
[77, 77]
|
p02676
|
u385475040
| 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() for i in range(2)] \ns0 = int(s[0])\nl0=len(s[1])\nif s0 >= l0:\n print(s[1])\nif s0 < l0:\n print(s[1][:s0],'...')\n ", "s = [input() for i in range(2)] \ns0 = int(s[0])\nl0 = len(s[1])\nif s0 >= l0:\n print(s[1])\nif s0 < l0:\n print(s[1][:s0],'...')", "s = [input() for i in range(2)] \ns0 = int(s[0])\nl0=len(s[1])\nif s0 >= l0:\n print(s[1])\nif s0 < l0:\n print(s[1][:s0]+'...')"]
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s253529953', 's320055274', 's121998017']
|
[9076.0, 9124.0, 9184.0]
|
[24.0, 22.0, 21.0]
|
[133, 130, 128]
|
p02676
|
u387610588
| 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=len(s)\nif n<=l:\n print(s)\nelse:\n print(s[0:n]+"...")\n', 'n=int(input())\ns=(input())\nl=len(s)\nif n>=l:\n print(s)\nelse:\n print(s[0:n]+"...")\n']
|
['Wrong Answer', 'Accepted']
|
['s898590215', 's461710248']
|
[9164.0, 9160.0]
|
[20.0, 24.0]
|
[84, 84]
|
p02676
|
u388904130
| 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(f'{S[:K]}...')"]
|
['Wrong Answer', 'Accepted']
|
['s466575210', 's354442845']
|
[9064.0, 9064.0]
|
[26.0, 28.0]
|
[83, 84]
|
p02676
|
u391540332
| 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.
|
['#!/usr/bin/env python3\n# coding: utf-8\nimport math\n\n# if __debug__:\n\n# else:\n# import sys\n# print(arg, file=sys.stderr)\n\ndef main():\n A, B, H, M = map(int, input().split())\n\n vh = ((H * 60 + M) / (12 * 60))\n vm = (M / 60)\n\n theta = (vh - vm) * math.tau\n d = math.sqrt(A ** 2 + B ** 2 - 2 * A * B * math.cos(theta))\n\n print(d)\n\nif __name__ == "__main__":\n main()\n', '#!/usr/bin/env python3\n# coding: utf-8\ndef main():\n K = int(input())\n S = input()\n if len(S) <= K:\n print(S)\n else:\n print(S[:K] + \'...\')\n \nif __name__ == "__main__":\n main()']
|
['Runtime Error', 'Accepted']
|
['s026935262', 's332801436']
|
[9180.0, 9164.0]
|
[24.0, 20.0]
|
[438, 203]
|
p02676
|
u397638621
| 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[:K] + "..."))', 'K = int(input())\nS = input()\nprint(S if (len(S) <= K) else (S[:K] + "..."))']
|
['Wrong Answer', 'Accepted']
|
['s843632006', 's755570297']
|
[9108.0, 9168.0]
|
[21.0, 20.0]
|
[74, 75]
|
p02676
|
u401645051
| 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 S = S[:K:1] + "..."\nelse:\n pass\nprint(K)\nprint(S)', 'k = int(input())\ns = str(input())\nif k<len(s):\n s = s[:k:1] + "..."\nelse:\n pass\nprint(k)\nprint(s)\n', 'K = int(input())\nS = str(input())\nif K<len(S):\n S = S[:K:1] + "..."\nelse:\n pass\nprint(K)\nprint(S)\n', 'k = int(input())\ns = str(input())\nif k<len(s):\n s = s[:k:1] + "..."\nelse:\n pass\n\nprint(s)\n']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s123385489', 's397145480', 's701308185', 's865131471']
|
[9064.0, 9164.0, 9132.0, 9156.0]
|
[25.0, 21.0, 25.0, 21.0]
|
[103, 104, 104, 96]
|
p02676
|
u407567153
| 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())\nw=input()\nwordlength=len(w)\nif n>=wordlength: print(w)\nelse: print(w[:n])', "n=int(input())\nw=input()\nwordlength=len(w)\nif n>=wordlength: print(w)\nelse: print(w[:n]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s226410065', 's504582891']
|
[9028.0, 9164.0]
|
[23.0, 21.0]
|
[88, 94]
|
p02676
|
u408071652
| 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[0:k-1],"...")\nelse:\n print(s)', 'k = int(input())\ns = input()\nif len(s)>k:\n print(s[0:k],"...")\nelse:\n print(s)\n', 'k = int(input())\ns = input()\nif len(s)>k:\n print(s[0:k],"...",sep="")\nelse:\n print(s)']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s318120229', 's931537713', 's100406247']
|
[9104.0, 9104.0, 9144.0]
|
[22.0, 23.0, 23.0]
|
[86, 85, 91]
|
p02676
|
u408958033
| 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 cin(): # To take limited number of inputs\n\treturn map(int,input().split())\n\ndef cino(test=False): # To take individual int input (test = False)\n if not test:\n return int(input())\n else: # To take string input (test = True)\n return input()\n\ndef cina(): # array input\n return list(map(int,input().split()))\n\ndef ssplit(): # multiple string input\n return list(input().split())\n\ndef printlist(l): # to print space seperated array\n for i in l:\n print(i,end=" ")\n\ndef main():\n a = cino()\n b = cino(True)\n l = len(b)\n print(len(b))\n if l<=a:\n print(b)\n else:\n print(b[:a]+"...")\n\nif __name__=="__main__":\n main()', 'def cin(): # To take limited number of inputs\n\treturn map(int,input().split())\n\ndef cino(test=False): # To take individual int input (test = False)\n if not test:\n return int(input())\n else: # To take string input (test = True)\n return input()\n\ndef cina(): # array input\n return list(map(int,input().split()))\n\ndef ssplit(): # multiple string input\n return list(input().split())\n\ndef printlist(l): # to print space seperated array\n for i in l:\n print(i,end=" ")\n\ndef main():\n a = cino()\n b = cino(True)\n l = len(b)\n # print(len(b))\n if l<=a:\n print(b)\n else:\n print(b[:a]+"...")\n\nif __name__=="__main__":\n main()']
|
['Wrong Answer', 'Accepted']
|
['s905523486', 's969902975']
|
[9144.0, 9204.0]
|
[22.0, 19.0]
|
[678, 680]
|
p02676
|
u411237324
| 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 list(s)\n # print(s[:k])\n print(s[:k], '...')\n", "k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n list(s)\n # print(s[:k])\n print(s[:k]+'...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s067154513', 's759482372']
|
[9112.0, 9156.0]
|
[22.0, 19.0]
|
[120, 119]
|
p02676
|
u411478442
| 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']
|
['s579214026', 's702752925']
|
[9164.0, 9160.0]
|
[23.0, 23.0]
|
[78, 86]
|
p02676
|
u414376763
| 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)\nelif len(s) > k:\n print(s[0:k-1]', "k = int(input())\ns = str(input())\n\nif len(s) <= k:\n print(s)\nelif len(s) > k:\n print(s[0:k-1] + '...')", "k = int(input())\ns = str(input())\n\nif len(s) <= k:\n print(s)\nelif len(s) > k:\n print(s[:k] + '...')"]
|
['Runtime Error', 'Wrong Answer', 'Accepted']
|
['s032862832', 's979697175', 's317366278']
|
[8964.0, 8960.0, 9080.0]
|
[26.0, 29.0, 29.0]
|
[95, 104, 101]
|
p02676
|
u415915510
| 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)\n\nif a <= K:\n print(S)\nelse:\n print(S[0:K-1]+"...")', 'K = int(input())\nS = input()\na = len(S)\n\nif a <= K:\n print(S)\nelse:\n print(S[0:K]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s112689175', 's942980187']
|
[9164.0, 9164.0]
|
[22.0, 22.0]
|
[96, 94]
|
p02676
|
u416223629
| 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==1:\n print(S[0]+'...')\nelse:\n print(S[:-(K-len(S)-1)]+'...')", "K=int(input())\nS=input()\n\nif len(S)<=K:\n print(S)\nelse:\n print(S[0:K]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s030545130', 's586440306']
|
[9164.0, 9088.0]
|
[22.0, 23.0]
|
[133, 82]
|
p02676
|
u417610915
| 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()\nsplit_str = S[:K]\nif len(S) > K:\n print(split_str)\nelse:\n print(split_str)', 'K = int(input())\nS = input()\nsplit_str = S[:K]\nif len(S) > K:\n print(split_str)\nelse:\n print(S)', 'K = int(input())\nS = input()\nsplit_str = S[:K]\nif len(S) > K:\n print(split_str+"...")\nelse:\n print(S)']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s378103421', 's670805010', 's993247839']
|
[9168.0, 9168.0, 9136.0]
|
[22.0, 21.0, 22.0]
|
[109, 101, 107]
|
p02676
|
u421916702
| 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 = int(input())\ns = input()\n\nif k >= len(s):\n print(s)\nelse:\n print(s[0:k] + '...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s572040534', 's168791989']
|
[9072.0, 9144.0]
|
[20.0, 23.0]
|
[88, 91]
|
p02676
|
u422414797
| 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,S] = input()\n\nif len(S)>K:\n print(S[:K]+"...")\nelse:\n print(S)\n\n', 'k=int(input())\ns=input()\nif (len(s)>k):\n print(s[:k]+"...")\nelse:\n print(s)\n']
|
['Runtime Error', 'Accepted']
|
['s916545371', 's037120852']
|
[9064.0, 9104.0]
|
[24.0, 20.0]
|
[74, 82]
|
p02676
|
u425068548
| 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, s = int(input()), input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k + 1] + "...")', 'k, s = int(input()), input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + "...")']
|
['Wrong Answer', 'Accepted']
|
['s376425850', 's789393726']
|
[9164.0, 9156.0]
|
[23.0, 22.0]
|
[93, 89]
|
p02676
|
u425236751
| 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()\nans= S\nif len(S) > K:\n ans = S[0:K+1] + "..."\nprint(ans)', 'K = int(input())\nS = input()\nans= S\nif len(S) > K:\n ans = S[0:K] + "..."\nprint(ans)']
|
['Wrong Answer', 'Accepted']
|
['s540403637', 's848059323']
|
[9108.0, 9156.0]
|
[25.0, 24.0]
|
[86, 84]
|
p02676
|
u426205961
| 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 = ""\nif K < len(S):\n\tfor i in range(K):\n \tA = A + S[i]\n A = A + "..."\nelse:\n\tA = S\nprint(A)', 'K = int(input())\nS = input()\nif K < len(S):\n A = ""\n for i in range(K):\n A = str(A) + S[i]\n A = str(A) + "..."\n S = A\nprint(S)']
|
['Runtime Error', 'Accepted']
|
['s633616257', 's749875072']
|
[8944.0, 9112.0]
|
[29.0, 27.0]
|
[128, 145]
|
p02676
|
u428403551
| 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()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']
|
['s028703018', 's472598145']
|
[8808.0, 9036.0]
|
[25.0, 27.0]
|
[107, 84]
|
p02676
|
u433080052
| 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)\n \nelse:\n print("{}...".format(S[0,K]))', 'K = int(input())\nS = input()\n \nif len(S) <= K:\n print(S)\n \nelse:\n print("{}...".format(S[:K]))']
|
['Runtime Error', 'Accepted']
|
['s072012860', 's415270511']
|
[9168.0, 9168.0]
|
[24.0, 20.0]
|
[97, 97]
|
p02676
|
u433136867
| 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 numpy as np\n\nK = int(input())\nS = input()\nS = list(S)\n\nif len(S) <= K:\n print(S)\n\nelse:\n del S[K:len(S)]\n print(S)', "import numpy as np\n\nK = int(input())\nS = input()\nS = list(S)\nmojiretu=''\nif len(S) <= K:\n for x in S:\n mojiretu += x\n print(str(mojiretu))\n\nelse:\n del S[K:len(S)]\n for x in S:\n mojiretu += x\n print(str(mojiretu)+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s324555161', 's449666867']
|
[27136.0, 27156.0]
|
[107.0, 103.0]
|
[130, 247]
|
p02676
|
u434846982
| 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 solution():\n k = int(input())\n s = int(input())\n if len(s) > k:\n return s[:k] + '...'\n else:\n return s\n\nprint(solution())", "def solution():\n k = int(input())\n s = str(input())\n if len(s) > k:\n return s[:k] + '...'\n else:\n return s\n\nprint(solution())"]
|
['Runtime Error', 'Accepted']
|
['s311600690', 's002357773']
|
[9156.0, 9088.0]
|
[21.0, 23.0]
|
[151, 151]
|
p02676
|
u434966508
| 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)\n\nelse:\n print(s[0:k],'...')", "k=int(input())\ns=str(input())\n\nif len(s) <=k:\n print(s)\n\nelse:\n c=s[0:k]+ '...'\n print(c)"]
|
['Wrong Answer', 'Accepted']
|
['s727918851', 's908178991']
|
[9156.0, 9164.0]
|
[20.0, 22.0]
|
[89, 98]
|
p02676
|
u439025531
| 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())\nanswer=[]\nif len(S)>=K:\n for i in range(K):\n answer.append(S[i])\n answer.append('...')\n s=''\n for i in range(len(answer)):\n s+=answer[i]\n print(s)\n print(1)\nelse:\n g=''\n for i in range(len(S)):\n g+=S[i]\n print(g)\n ", "K=int(input())\nS=list(input())\nif len(S)>=K:\n answer=[]\n for i in range(K):\n answer.append(S[i])\n answer.append('...')\n s=''\n for i in range(len(answer)):\n s+=answer[i]\n print(s)\n print(1)\nelse:\n g=''\n for i in range(len(S)):\n g+=S[i]\n g+='...'\n print(g)", "K=int(input())\nS=list(input())\nanswer=[]\nif len(S)>=K:\n for i in range(K):\n answer.append(S[i])\n answer.append('...')\n s=''\n for i in range(len(answer)):\n s+=answer[i]\n print(s)\n print(1)\nelse:\n g=''\n for i in range(len(S)):\n g+=S[i]\n g+='...'\n print(g)", "K=int(input())\nS=list(input())\nif len(S)>K:\n answer=[]\n for i in range(K):\n answer.append(S[i])\n answer.append('...')\n s=''\n for i in range(len(answer)):\n s+=answer[i]\n print(s)\nelse:\n g=''\n for i in range(len(S)):\n g+=S[i]\n print(g)\n \n \n"]
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s289414753', 's464519081', 's848844241', 's448641617']
|
[9184.0, 9148.0, 9204.0, 9192.0]
|
[24.0, 21.0, 21.0, 21.0]
|
[268, 274, 272, 262]
|
p02676
|
u440322097
| 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-1)] + "...")', 'k = int(input())\ns = input()\n\nif len(s) <= k:\n\tprint(s)\nelse:\n \tprint(s[0:(k-1)])', 'k = int(input())\ns = input()\n \nif len(s) <= k:\n\tprint(s)\nelse:\n \tprint(s[0:k] + "...")']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s780197647', 's828370221', 's547463798']
|
[9164.0, 9156.0, 9076.0]
|
[22.0, 23.0, 24.0]
|
[90, 81, 86]
|
p02676
|
u441225672
| 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)\nelse:\n print(S[:K],"...")\n', 'K=int(input())\nS=str(input())\nif K>=len(S):\n print(S)\nelse:\n print(S[:K]+"...")\n']
|
['Wrong Answer', 'Accepted']
|
['s132944737', 's223289650']
|
[9156.0, 9152.0]
|
[24.0, 24.0]
|
[86, 86]
|
p02676
|
u442850625
| 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())\nK = str(input())\n\nif S <= len(K):\n print(S)\nelse:\n print(K[:S] + "...")', 'K = int(input())\nS = str(input())\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + "...")']
|
['Wrong Answer', 'Accepted']
|
['s147818218', 's594657298']
|
[9096.0, 9164.0]
|
[25.0, 22.0]
|
[94, 94]
|
p02676
|
u452269253
| 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]+"...")7\nnikoandsolstice', 'K = int(input())\nS = input()\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+"...")']
|
['Runtime Error', 'Accepted']
|
['s224340757', 's274322796']
|
[8960.0, 9160.0]
|
[21.0, 23.0]
|
[103, 86]
|
p02676
|
u454866339
| 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[0:K] + '･･･')\n\n\nelse:\n print(S)", "K = int(input())\nS = input()\n\nif K < len(S):\n print(S[0:K] + '...')\n\n\nelse:\n print(S)"]
|
['Wrong Answer', 'Accepted']
|
['s121725439', 's905046134']
|
[9084.0, 9088.0]
|
[25.0, 30.0]
|
[97, 91]
|
p02676
|
u454866890
| 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 = list(input())\n\nans = []\nif len(N) > K:\n\tfor i in range(len(N)-K):\n\t\t#print(i,len(N))\n\t\tN.pop(-1)\nprint("".join(N))', 'K = int(input())\nN = list(input())\n\nans = []\nif len(N) > K:\n\tfor i in range(len(N)-K):\n\t\t#print(i,len(N))\n\t\tN.pop(-1)\n\tN.append("...")\nprint("".join(N))\n']
|
['Wrong Answer', 'Accepted']
|
['s303471834', 's369929226']
|
[9144.0, 9172.0]
|
[27.0, 29.0]
|
[146, 164]
|
p02676
|
u455354923
| 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=str(input())\nif len(S) <= K:\n print(S)\nelse:\n ans = S[0]\n for i in range(1,K):\n ans += S[i]\n ans += "..."\n print(ans)\n']
|
['Runtime Error', 'Accepted']
|
['s045705826', 's684932274']
|
[9144.0, 9160.0]
|
[20.0, 27.0]
|
[17, 157]
|
p02676
|
u463704918
| 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[1:K]+"...")', 'K=int(input())\nS=str(input())\n\nif len(S) <= K :\n print(S)\nelse :\n print(S[0:K]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s622053322', 's938120885']
|
[9160.0, 9132.0]
|
[21.0, 24.0]
|
[91, 91]
|
p02676
|
u463950771
| 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(sys.stdin.readline())\nS = sys.stdin.readline().rstrip()\nprint(len(S))\nif len(S) > K:\n print(S[:K] + "...")\nelse:\n print(S)', 'import sys\nK = int(sys.stdin.readline())\nS = sys.stdin.readline().rstrip()\nif len(S) > K:\n print(S[:K] + "...")\nelse:\n print(S)']
|
['Wrong Answer', 'Accepted']
|
['s772446356', 's022230869']
|
[9192.0, 9056.0]
|
[21.0, 22.0]
|
[147, 133]
|
p02676
|
u465101448
| 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())\nK = 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]+'...')"]
|
['Runtime Error', 'Runtime Error', 'Accepted']
|
['s083449925', 's482234899', 's337432701']
|
[9060.0, 9184.0, 9116.0]
|
[22.0, 23.0, 20.0]
|
[86, 84, 87]
|
p02676
|
u465652095
| 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 M = S[0:K+1]\n print(M + "...")', '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 M = S[0:K+1] + "..."\n print(M)', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n M = S[0:K]\n print(M + "...")']
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s675303304', 's920976445', 's965566506', 's798314726']
|
[9164.0, 9168.0, 9164.0, 9168.0]
|
[21.0, 22.0, 21.0, 22.0]
|
[102, 92, 102, 100]
|
p02676
|
u471754194
| 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 = input()\n s = input()\n if(len(s)<k):\n print(s)\n else:\n print(s[0:k] + '...')\n \n \nmain()", "def main():\n s = input()\n k = input()\n if(len(s)<=k):\n print(s)\n else:\n print(s[0:k] + '...')\n \n \nmain()", "def main():\n s = input()\n k = input()\n if(len(s)<k):\n print(s)\n else:\n print(s[0:k] + '...')\n \n \nmain()", "def main():\n K = int(input())\n S = input()\n if(len(S)<=K):\n print(S)\n else:\n print(S[0:K] + '...')\n \n \nmain()"]
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s113660530', 's365595292', 's555261607', 's133111646']
|
[9096.0, 9100.0, 9024.0, 9156.0]
|
[23.0, 23.0, 21.0, 20.0]
|
[132, 133, 132, 138]
|
p02676
|
u473234868
| 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\tprint(s)\nelse:\n\tprint(s[1:k]+'...')\n\t", "k= int(input())\ns= input()\nif len(s)<=k:\n\tprint(s)\nelse:\n\tprint(s[:k]+'...')\n\t"]
|
['Wrong Answer', 'Accepted']
|
['s587318459', 's928738610']
|
[9152.0, 9100.0]
|
[21.0, 22.0]
|
[79, 78]
|
p02676
|
u478266845
| 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 k >= len(s):\n ans = s\nelse:\n rest = len(s) - k\n ans = s[0:k] + '.'*rest\nprint(ans)", "k = int(input())\ns = str(input())\n\nif k >= len(s):\n ans = s\nelse:\n rest = len(s) - k\n ans = s[0:k] + '...'\nprint(ans)"]
|
['Wrong Answer', 'Accepted']
|
['s440551827', 's819628720']
|
[9164.0, 9168.0]
|
[24.0, 20.0]
|
[129, 126]
|
p02676
|
u480321332
| 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 > s:\n print(s[0:k+1] + "...")\nelse:\n print(s)\n\n', 'k = int(input())\ns = input()\n \nif k < len(s):\n print(s[0:k] + "...")\nelse:\n print(s)']
|
['Runtime Error', 'Accepted']
|
['s382446737', 's919810336']
|
[9156.0, 9160.0]
|
[19.0, 21.0]
|
[84, 86]
|
p02676
|
u482743994
| 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(k)\nelse:\n print(k[:k]&"...")', 'k=int(input())\ns=input()\nif len(s)<=k:\n print(k)\nelse:\n print(s[:k]&"...")', 'k=int(input())\ns=input()\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k]+"...")\n']
|
['Runtime Error', 'Runtime Error', 'Accepted']
|
['s757022988', 's884614814', 's121096661']
|
[9172.0, 9172.0, 9152.0]
|
[23.0, 23.0, 22.0]
|
[76, 76, 77]
|
p02676
|
u485819963
| 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\ndeffirence = len(S) - K\n\nif deffirence > 0:\n print(S[0: K:])\nelse:\n print(S)\n\n', "K = int(input()) \nS = str(input())\n\ndeffirence = len(S) - K\n\nif deffirence > 0:\n print(S[0: K:] + '...')\nelse:\n print(S)\n\n"]
|
['Wrong Answer', 'Accepted']
|
['s231787878', 's060725446']
|
[9160.0, 9084.0]
|
[28.0, 26.0]
|
[121, 129]
|
p02676
|
u485893928
| 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 for i in range(k):\n print(s[i],end='')\n print('...')"]
|
['Wrong Answer', 'Accepted']
|
['s975038251', 's959679456']
|
[9168.0, 9172.0]
|
[23.0, 23.0]
|
[81, 121]
|
p02676
|
u486209657
| 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)<=len(K):\n print(S)\nelse:\n print(S[0:len(K)])', 'K=int(input())\nS=input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[0:K])\n', "K=int(input())\nS=input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[0:K]+'...')\n"]
|
['Runtime Error', 'Wrong Answer', 'Accepted']
|
['s484082527', 's686560233', 's980756744']
|
[9144.0, 9020.0, 9084.0]
|
[27.0, 27.0, 27.0]
|
[81, 72, 78]
|
p02676
|
u487044452
| 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()\nans= str()\nfor i in s:\n ans+=i\nif len(s)<=k:\n print(ans)\nelse:\n print(ans+'...')", "k = int(input())\ns = input()\nans= str()\n\nif len(s)<=k:\n for i in s:\n ans+=i\n print(ans)\nelse:\n for i in range(k):\n ans+=s[i]\n print(ans+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s505756207', 's548907603']
|
[9164.0, 9172.0]
|
[25.0, 22.0]
|
[118, 168]
|
p02676
|
u488178971
| 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 S[:K]+"..."\nelse:\n print(S)', 'K = int(input())\nS = input()\nif len(S)>K:\n print(S[:K]+"...")\nelse:\n print(S)']
|
['Wrong Answer', 'Accepted']
|
['s855859381', 's438275957']
|
[9164.0, 9096.0]
|
[22.0, 22.0]
|
[76, 83]
|
p02676
|
u489600973
| 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[0:k],"...")\nelse:\n print(s)', 'k = int(input())\ns = str(input())\n\nif len(s)>k:\n print(s[0:k]+"...")\nelse:\n print(s)']
|
['Wrong Answer', 'Accepted']
|
['s077065304', 's838934403']
|
[9056.0, 9056.0]
|
[23.0, 23.0]
|
[86, 86]
|
p02676
|
u494295478
| 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(K)\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")', 'K=input()\nS=input()\nK=int(K)\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")']
|
['Runtime Error', 'Accepted']
|
['s991915478', 's183446525']
|
[9092.0, 9160.0]
|
[22.0, 24.0]
|
[64, 84]
|
p02676
|
u496148227
| 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']
|
['s025076627', 's432266114']
|
[9168.0, 9116.0]
|
[21.0, 20.0]
|
[87, 85]
|
p02676
|
u497188176
| 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()\nC=0\nB=0\nB=len(S)\nif B<=K:\n print(S)\nelse:\n R=B-K\n for i in range(0,R):\n i=i+1\n C=C+S[i]\n \n print(C)\n \n \n ', 'K=int(input())\nS=input()\nB=0\nD=0\nB=len(S)\nB=int(B)\nB=B+1\nD=S+...\nif B>=K:\n print(S)\nelse:\n print(D)\n', "K=int(input())\nS=input()\nC=0\nB=0\nD=0\nC=S\nB=len(C)\nB=int(B)\nB=B+1\nD=S+'...'\nif B<=K:\n print(S)\nelse:\n print(D)\n", "K=int(input())\nS=input()\nC=0\nB=0\nD=0\nC=S\nB=len(C)\nB=int(B)\nB=B+1\nD=S+'...'\nif B>=K:\n print(S)\nelse:\n print(D)\n", "K=int(input())\nS=input()\nB=0\nD=0\nB=len(S)\nB=int(B)\nD=S+'...'\nif S>=K:\n print(S)\nelse:\n print(D)\n", "K=int(input())\nS=input()\nB=0\nD=0\nB=len(S)\nB=int(B)\nB=B+1\nD=S+'...'\nif B>=K:\n print(S)\nelse:\n print(D)\n", "K=int(input())\nS=input()\nB=0\nD=0\nB=len(S)\nB=int(B)\nD=S+'...'\nif B>=K:\n print(S)\nelse:\n print(D)\n", "K=int(input())\nS=input()\nB=0\nD=0\nB=len(S)\nB=int(B)\nD=S+'...'\nif S=>K:\n print(S)\nelse:\n print(D)", "K=int(input())\nS=input()\nif len(S)<=K:print(S)\nelse:print(S[0:K]+'...')\n"]
|
['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted']
|
['s040403478', 's040460241', 's144634494', 's286194843', 's569741214', 's726890135', 's764591186', 's843401904', 's530271779']
|
[9172.0, 9112.0, 9180.0, 9112.0, 9164.0, 9104.0, 9144.0, 9028.0, 9016.0]
|
[31.0, 23.0, 20.0, 23.0, 21.0, 21.0, 21.0, 22.0, 28.0]
|
[180, 106, 116, 116, 102, 108, 102, 101, 72]
|
p02676
|
u497326082
| 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())\nprint(input()[:k])', 'k=int(input())\ns=input()\nprint(s[:k]+"..." if len(s)>k else s)']
|
['Wrong Answer', 'Accepted']
|
['s985042271', 's541134229']
|
[9092.0, 9172.0]
|
[23.0, 23.0]
|
[33, 62]
|
p02676
|
u498699271
| 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[:K]) if len(S) <= K else print(S[:K] + "...")', 'K=int(input())\nS=input()\nprint(S[:K]) if len(S) <= K else print(S[:K] + "...")\n']
|
['Runtime Error', 'Accepted']
|
['s855543829', 's434644656']
|
[9160.0, 9156.0]
|
[24.0, 21.0]
|
[78, 79]
|
p02676
|
u507456172
| 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]+"...")']
|
['Wrong Answer', 'Accepted']
|
['s205417042', 's666418185']
|
[9116.0, 9152.0]
|
[23.0, 23.0]
|
[80, 80]
|
p02676
|
u509029769
| 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.
|
['if len(S) > K:\n print(S[:K]+"...")\nelse:\n print(S)', 'K = int(input())\nS = input()\n\nif len(S) > K:\n print(S[:K]+"...")\nelse:\n print(S)']
|
['Runtime Error', 'Accepted']
|
['s213363281', 's506411861']
|
[9016.0, 9000.0]
|
[25.0, 27.0]
|
[56, 86]
|
p02676
|
u513929200
| 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 a = len(S) - K\n b = a-2\n print(S[:b])\n', "K = int(input())\nS = input()\nif len(S) <= K:\n print(S)\nelse:\n a = len(S) - K\n b = a-2\n print(S[:b]+'...')", "K = int(input())\nS = input()\nif len(S) <= K:\n print(S)\nelse:\n a = len(S) - K\n print(S[:-a]+'...')\n"]
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s005573778', 's833206509', 's604415327']
|
[9160.0, 9168.0, 9156.0]
|
[23.0, 23.0, 21.0]
|
[112, 117, 107]
|
p02676
|
u516678561
| 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']
|
['s482498235', 's354662835']
|
[9152.0, 9008.0]
|
[30.0, 29.0]
|
[96, 90]
|
p02676
|
u517621096
| 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()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + '...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s611300918', 's867674941']
|
[9176.0, 9152.0]
|
[22.0, 20.0]
|
[86, 90]
|
p02676
|
u517674755
| 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]+'...')\nelse:\n print(S)", "K = int(input())\nS = input()\nif len(S) > K:\n print(S[:K]+'...')\nelse:\n print(S)"]
|
['Runtime Error', 'Accepted']
|
['s522566243', 's207787192']
|
[9144.0, 9164.0]
|
[24.0, 21.0]
|
[85, 85]
|
p02676
|
u517754855
| 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]+"...")', 'K=int(input())\nS=input()\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K]+"...")']
|
['Runtime Error', 'Accepted']
|
['s968213552', 's757817470']
|
[9108.0, 9168.0]
|
[21.0, 27.0]
|
[73, 78]
|
p02676
|
u521240302
| 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.
|
['#!/usr/bin/env python3\n\n\nK = int(input())\nS = input()\n\nif (len(S) <= K):\n print(S)\nelse:\n print(S[0:K+1] + "...")\n\n', '#!/usr/bin/env python3\n\n\nK = int(input())\nS = input()\n\nif (len(S) <= K):\n print(S)\nelse:\n print(S[0:K] + "...")\n\n']
|
['Wrong Answer', 'Accepted']
|
['s578251900', 's236357953']
|
[9164.0, 9096.0]
|
[24.0, 20.0]
|
[121, 119]
|
p02676
|
u523385176
| 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\n", "k=int(input())\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k]+'...')\n\n"]
|
['Wrong Answer', 'Accepted']
|
['s336277017', 's810518954']
|
[9080.0, 9096.0]
|
[28.0, 26.0]
|
[83, 83]
|
p02676
|
u525882286
| 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()\ni = ""\nif len(s) <= k:\n print(s)\n else: \n for j in range(k):\n i = i + s[j]\n print(i + \'...\')', 'k = int(input())\ns = input()\ni = ""\nif len(s) <= k:\n print(s)\nelse: \n for j in range(k):\n i = i + s[j]\n print(i + \'...\')', 'k = int(input())\ns = input()\ni = ""\n\nif len(s) <= k:\n print(s)\nelse: \n for j in range(k):\n i = i + s[j]\n print(i + \'...\')', 'k = int(input())\ns = input()\ni = ""\nif len(s) <= k:\n print(s)\nelse:\n for j in range(k):\n i = i + s[j]\n print(i+"...")']
|
['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s109102526', 's831744269', 's987113390', 's513321095']
|
[8960.0, 9172.0, 9088.0, 9172.0]
|
[25.0, 22.0, 19.0, 22.0]
|
[134, 128, 129, 133]
|
p02676
|
u528303485
| 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[:7])', 'k = int(input())\ns = input()\n\nprint(s[:k])', "k = int(input())\ns = input()\n\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k]+'...')"]
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s569396186', 's860567994', 's488371745']
|
[9060.0, 9032.0, 9188.0]
|
[21.0, 20.0, 21.0]
|
[81, 42, 87]
|
p02676
|
u530169312
| 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 = int(input())\n\nif len(K) <= S:\n print(K)\nelse:\n print(K[:S] + "...")\n', 'K = input()\n\nS = int(input())\n\nif len(K) <= S:\n print(K)\n\n\nelse:\n print(K[:S] + "...")\n', 'K = input()\n\nS = int(input())\n\nif len(K) <= S:\n print(K)\n\n\nelse:\n print(K[:S] + "...")\n', 'K = input()\nS = int(input())\n\nif len(K) <= S:\n print(K)\nelse:\n print(K[:S]+"...")\n', 'S = input()\n\nK = int(input())\n\nif len(S) <= K:\n print(S)\n\n\nelse:\n print(S[:K] + "...")\n', "S = int(input())\nK = input()\nif len(K) <= S:\n print(K)\nelse:\n print(K[:S]+'...')"]
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s025539851', 's435233989', 's447753130', 's590665198', 's674652326', 's196636887']
|
[9044.0, 9092.0, 9084.0, 9104.0, 9128.0, 9052.0]
|
[28.0, 26.0, 24.0, 26.0, 28.0, 29.0]
|
[90, 93, 136, 88, 136, 86]
|
p02676
|
u531599639
| 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-1]+'...')", "K = int(input())\nS = input()\nif K>=len(S):\n print(S)\nelse:\n print(S[:K]+'...')\n"]
|
['Wrong Answer', 'Accepted']
|
['s824306367', 's575742049']
|
[9160.0, 9156.0]
|
[21.0, 19.0]
|
[82, 81]
|
p02676
|
u532955973
| 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.
|
["#!/usr/bin/env python3\n# atcoder \n\n\n\n\nK = int(input())\nS = input()\n\nif(len(S) <= K):\n print(S)\nelse:\n print(S[K:] + '.' * 3)\n ", '#!/usr/bin/env python3\n# atcoder \n\n\n\n\nK = int(input())\nS = input()\n\n\nslen = len(S)\nif(slen < K):\n print(S)\nelse: \n pr = S[:K]\n change = S[K:]\n for i in range(len(change)):\n change = change.replace(change[i], ".")\n print(pr + change)\n\n', "#!/usr/bin/env python3\n# atcoder \n\n\n\n\nK = int(input())\nS = input()\nslen = len(S)\n\n\n\nif(slen <= K):\n print(S)\nelse:\n print(S[K:] + '.' * 3)\n \n # change = change.replace(change[i], '.')\n #print(S[:K] + change[:3])\n\n", '#!/usr/bin/env python3\n# atcoder \n\n\n\n\nK = int(input())\nS = input()\nslen = len(S)\n\n\n\nif(slen <= K):\n print(S)\nelse:\n print(S[K:] + "...")\n \n # change = change.replace(change[i], \'.\')\n #print(S[:K] + change[:3])\n\n', "#!/usr/bin/env python3\n# atcoder \n\n\n\n\nK = int(input())\nS = input()\n\n\n\nif(len(S) <= K):\n print(S)\nelse:\n print(S[:K] + '.' * 3)\n \n # change = change.replace(change[i], '.')\n #print(S[:K] + change[:3])\n\n"]
|
['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s352709022', 's366621250', 's476465329', 's976599515', 's099081311']
|
[9092.0, 9168.0, 9136.0, 9132.0, 9180.0]
|
[23.0, 23.0, 24.0, 22.0, 23.0]
|
[190, 311, 305, 303, 293]
|
p02676
|
u534918612
| 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>s.length):\n print(s)\nelse:\n print(s[0,k],"...")', 'k=int(input())\ns=input()\nif(k>len(s)):\n print(s)\nelse:\n print(s[0:k],"...")\n', "k=int(input())\ns=input()\nif(k>=len(s)):\n print(s)\nelse:\n print(s[0:k]+'...')\n"]
|
['Runtime Error', 'Wrong Answer', 'Accepted']
|
['s136301184', 's965633413', 's483225445']
|
[9104.0, 9088.0, 9036.0]
|
[20.0, 22.0, 23.0]
|
[79, 78, 79]
|
p02676
|
u536685012
| 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\nl = len(s)\n\nif k >= l:\n print(k)\nelse:\n print(s[k - 1] + '...')", "k = int(input())\ns = input()\n\nl = len(s)\n\nif k >= l:\n print(s)\nelse:\n print(s[:k] + '...')\n"]
|
['Runtime Error', 'Accepted']
|
['s208215313', 's470858666']
|
[9036.0, 9152.0]
|
[20.0, 23.0]
|
[91, 94]
|
p02676
|
u538844871
| 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[:K] + '...')\nelse:\n print(S)", "S = input()\nK = int(input())\nif len(S) >= K:\n print(S[0:K] + '...')\nelse:\n print(S)\n", "S = input()\nK = int(input())\nif len(S) >= K:\n print(S[:K] + '...')\nelse:\n print(S)", "S = input()\nK = int(input())\nif len(S) > K:\n print(S[:K] + '...')\nelse:\n print(S)\n", "K = int(input())\nS = input()\nif len(S) > K:\n print(S[0:K] + '...')\nelse:\n print(S)"]
|
['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted']
|
['s119321587', 's368232276', 's513718849', 's674536782', 's804491976']
|
[9064.0, 9084.0, 9088.0, 9160.0, 9132.0]
|
[23.0, 20.0, 20.0, 24.0, 21.0]
|
[84, 86, 84, 84, 84]
|
p02676
|
u543489264
| 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.
|
["from sys import stdin\n\nK = int(inpu())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K],'...',sep='')", "from sys import stdin\n\nK = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K],'...',sep='')"]
|
['Runtime Error', 'Accepted']
|
['s738846957', 's832268005']
|
[9096.0, 9168.0]
|
[23.0, 23.0]
|
[116, 117]
|
p02676
|
u543540874
| 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 S = S[:K] + "..."\nprint(S)']
|
['Wrong Answer', 'Accepted']
|
['s075093672', 's722639852']
|
[9172.0, 9164.0]
|
[20.0, 22.0]
|
[83, 73]
|
p02676
|
u544272759
| 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 in range k + "...")', 'k=int(input())\ns=str(input())\nif len(s) <= k:\n print(s)\nelse:\n print(s[0:k] + "...")']
|
['Runtime Error', 'Accepted']
|
['s860801239', 's066401610']
|
[8908.0, 9164.0]
|
[24.0, 22.0]
|
[92, 86]
|
p02676
|
u546853743
| 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()\nl = input()\nif(len(l)<k):\n print(l)\nelse:\n print(l)\n print("...")', '\nk=int(input())\ns=input()\nl=len(s)\nif l<=k:\n print(s)\nelse:\n print(s[:k]+"...")']
|
['Runtime Error', 'Accepted']
|
['s501814528', 's545434136']
|
[9104.0, 9160.0]
|
[23.0, 27.0]
|
[90, 85]
|
p02676
|
u547375079
| 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] + "...")\n', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + "...")']
|
['Wrong Answer', 'Wrong Answer', 'Accepted']
|
['s332287359', 's757752214', 's254610006']
|
[9180.0, 9164.0, 9176.0]
|
[21.0, 24.0, 20.0]
|
[87, 86, 85]
|
p02676
|
u548055354
| 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 k <= n:\n print(s)\nelse:\n print(s[:k]+'...')", "k = int(input())\ns = input()\n \nn = len(s)\nif n <= k:\n print(s)\nelse:\n print(s[:k]+'...')"]
|
['Wrong Answer', 'Accepted']
|
['s913148276', 's667415093']
|
[9172.0, 9144.0]
|
[25.0, 23.0]
|
[89, 90]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.