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 | u134341470 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['\nfrom math import radians\nfrom heapq import heapify, heappush, heappop\nimport bisect\nfrom math import pi\nfrom collections import deque\nfrom math import factorial\nfrom math import log, ceil\nfrom collections import defaultdict\nfrom math import *\nfrom sys import stdin, stdout\nimport itertools\nimport os\nimport sys\nimport threading\nfrom collections import deque, Counter, OrderedDict, defaultdict\nfrom heapq import *\n# from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd\n\n# from decimal import *,threading\nfrom fractions import Fraction\nmod = int(pow(10, 9)+7)\n# mod = 998244353\n\n\ndef ii(): return int(input())\n\n\ndef si(): return str(input())\n\n\ndef mi(): return map(int, input().split())\n\n\ndef li1(): return list(mi())\n\n\ndef fii(): return int(stdin.readline())\n\n\ndef fsi(): return str(stdin.readline())\n\n\ndef fmi(): return map(int, stdin.readline().split())\n\n\ndef fli(): return list(fmi())\n\n\nabd = {\'a\': 0, \'b\': 1, \'c\': 2, \'d\': 3, \'e\': 4, \'f\': 5, \'g\': 6, \'h\': 7, \'i\': 8, \'j\': 9, \'k\': 10, \'l\': 11, \'m\': 12,\n \'n\': 13, \'o\': 14, \'p\': 15, \'q\': 16, \'r\': 17, \'s\': 18, \'t\': 19, \'u\': 20, \'v\': 21, \'w\': 22, \'x\': 23, \'y\': 24,\n \'z\': 25}\n\n\ndef getKey(item): return item[0]\n\n\ndef sort2(l): return sorted(l, key=getKey)\n\n\ndef d2(n, m, num): return [[num for x in range(m)] for y in range(n)]\n\n\ndef isPowerOfTwo(x): return (x and (not (x & (x - 1))))\n\n\ndef decimalToBinary(n): return bin(n).replace("0b", "")\n\n\ndef ntl(n): return [int(i) for i in str(n)]\n\n\ndef powerMod(x, y, p):\n res = 1\n x %= p\n while y > 0:\n if y & 1:\n res = (res * x) % p\n y = y >> 1\n x = (x * x) % p\n return res\n\n\ngraph = defaultdict(list)\nvisited = [0] * 1000000\ncol = [-1] * 1000000\n\n\ndef bfs(d, v):\n q = []\n q.append(v)\n visited[v] = 1\n while len(q) != 0:\n x = q[0]\n q.pop(0)\n for i in d[x]:\n if visited[i] != 1:\n visited[i] = 1\n q.append(i)\n print(x)\n\n\ndef make_graph(e):\n d = {}\n for i in range(e):\n x, y = mi()\n if x not in d:\n d[x] = [y]\n else:\n d[x].append(y)\n if y not in d:\n d[y] = [x]\n else:\n d[y].append(x)\n return d\n\n\ndef gr2(n):\n d = defaultdict(list)\n for i in range(n):\n x, y = mi()\n d[x].append(y)\n return d\n\n\ndef connected_components(graph):\n seen = set()\n\n def dfs(v):\n vs = set([v])\n component = []\n while vs:\n v = vs.pop()\n seen.add(v)\n vs |= set(graph[v]) - seen\n component.append(v)\n return component\n\n ans = []\n for v in graph:\n if v not in seen:\n d = dfs(v)\n ans.append(d)\n return ans\n\n\ndef primeFactors(n):\n s = set()\n while n % 2 == 0:\n s.add(2)\n n = n // 2\n for i in range(3, int(sqrt(n)) + 1, 2):\n while n % i == 0:\n s.add(i)\n n = n // i\n if n > 2:\n s.add(n)\n return s\n\n\ndef find_all(a_str, sub):\n start = 0\n while True:\n start = a_str.find(sub, start)\n if start == -1:\n return\n yield start\n start += len(sub)\n\n\ndef SieveOfEratosthenes(n, isPrime):\n isPrime[0] = isPrime[1] = False\n for i in range(2, n):\n isPrime[i] = True\n p = 2\n while (p * p <= n):\n if (isPrime[p] == True):\n i = p * p\n while (i <= n):\n isPrime[i] = False\n i += p\n p += 1\n return isPrime\n\n\ndef dijkstra(edges, f, t):\n g = defaultdict(list)\n for l, r, c in edges:\n g[l].append((c, r))\n\n q, seen, mins = [(0, f, ())], set(), {f: 0}\n while q:\n (cost, v1, path) = heappop(q)\n if v1 not in seen:\n seen.add(v1)\n path = (v1, path)\n if v1 == t:\n return (cost, path)\n\n for c, v2 in g.get(v1, ()):\n if v2 in seen:\n continue\n prev = mins.get(v2, None)\n next = cost + c\n if prev is None or next < prev:\n mins[v2] = next\n heappush(q, (next, v2, path))\n return float("inf")\n\n\ndef binsearch(a, l, r, x):\n while l <= r:\n mid = l + (r-1)//2\n if a[mid]:\n return mid\n elif a[mid] > x:\n l = mid-1\n else:\n r = mid+1\n return -1\n\n\n\n\n\n\ndef readTree(n):\n adj = [set() for _ in range(n)]\n for _ in range(n-1):\n u, v = map(int, input().split())\n adj[u-1].add(v-1)\n adj[v-1].add(u-1)\n return adj\n\n\ndef treeOrderByDepth(n, adj, root=0):\n parent = [-2] + [-1]*(n-1)\n ordered = []\n q = deque()\n q.append(root)\n depth = [0] * n\n while q:\n c = q.popleft()\n ordered.append(c)\n for a in adj[c]:\n if parent[a] == -1:\n parent[a] = c\n depth[a] = depth[c] + 1\n q.append(a)\n return (ordered, parent, depth)\n\n\nn=ii()\ns=si()\nif len(s)>k:\n print(s[:k]+\'...\')\nelse:\n print(s)', '\nfrom math import radians\nfrom heapq import heapify, heappush, heappop\nimport bisect\nfrom math import pi\nfrom collections import deque\nfrom math import factorial\nfrom math import log, ceil\nfrom collections import defaultdict\nfrom math import *\nfrom sys import stdin, stdout\nimport itertools\nimport os\nimport sys\nimport threading\nfrom collections import deque, Counter, OrderedDict, defaultdict\nfrom heapq import *\n# from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd\n\n# from decimal import *,threading\nfrom fractions import Fraction\nmod = int(pow(10, 9)+7)\n# mod = 998244353\n\n\ndef ii(): return int(input())\n\n\ndef si(): return str(input())\n\n\ndef mi(): return map(int, input().split())\n\n\ndef li1(): return list(mi())\n\n\ndef fii(): return int(stdin.readline())\n\n\ndef fsi(): return str(stdin.readline())\n\n\ndef fmi(): return map(int, stdin.readline().split())\n\n\ndef fli(): return list(fmi())\n\n\nabd = {\'a\': 0, \'b\': 1, \'c\': 2, \'d\': 3, \'e\': 4, \'f\': 5, \'g\': 6, \'h\': 7, \'i\': 8, \'j\': 9, \'k\': 10, \'l\': 11, \'m\': 12,\n \'n\': 13, \'o\': 14, \'p\': 15, \'q\': 16, \'r\': 17, \'s\': 18, \'t\': 19, \'u\': 20, \'v\': 21, \'w\': 22, \'x\': 23, \'y\': 24,\n \'z\': 25}\n\n\ndef getKey(item): return item[0]\n\n\ndef sort2(l): return sorted(l, key=getKey)\n\n\ndef d2(n, m, num): return [[num for x in range(m)] for y in range(n)]\n\n\ndef isPowerOfTwo(x): return (x and (not (x & (x - 1))))\n\n\ndef decimalToBinary(n): return bin(n).replace("0b", "")\n\n\ndef ntl(n): return [int(i) for i in str(n)]\n\n\ndef powerMod(x, y, p):\n res = 1\n x %= p\n while y > 0:\n if y & 1:\n res = (res * x) % p\n y = y >> 1\n x = (x * x) % p\n return res\n\n\ngraph = defaultdict(list)\nvisited = [0] * 1000000\ncol = [-1] * 1000000\n\n\ndef bfs(d, v):\n q = []\n q.append(v)\n visited[v] = 1\n while len(q) != 0:\n x = q[0]\n q.pop(0)\n for i in d[x]:\n if visited[i] != 1:\n visited[i] = 1\n q.append(i)\n print(x)\n\n\ndef make_graph(e):\n d = {}\n for i in range(e):\n x, y = mi()\n if x not in d:\n d[x] = [y]\n else:\n d[x].append(y)\n if y not in d:\n d[y] = [x]\n else:\n d[y].append(x)\n return d\n\n\ndef gr2(n):\n d = defaultdict(list)\n for i in range(n):\n x, y = mi()\n d[x].append(y)\n return d\n\n\ndef connected_components(graph):\n seen = set()\n\n def dfs(v):\n vs = set([v])\n component = []\n while vs:\n v = vs.pop()\n seen.add(v)\n vs |= set(graph[v]) - seen\n component.append(v)\n return component\n\n ans = []\n for v in graph:\n if v not in seen:\n d = dfs(v)\n ans.append(d)\n return ans\n\n\ndef primeFactors(n):\n s = set()\n while n % 2 == 0:\n s.add(2)\n n = n // 2\n for i in range(3, int(sqrt(n)) + 1, 2):\n while n % i == 0:\n s.add(i)\n n = n // i\n if n > 2:\n s.add(n)\n return s\n\n\ndef find_all(a_str, sub):\n start = 0\n while True:\n start = a_str.find(sub, start)\n if start == -1:\n return\n yield start\n start += len(sub)\n\n\ndef SieveOfEratosthenes(n, isPrime):\n isPrime[0] = isPrime[1] = False\n for i in range(2, n):\n isPrime[i] = True\n p = 2\n while (p * p <= n):\n if (isPrime[p] == True):\n i = p * p\n while (i <= n):\n isPrime[i] = False\n i += p\n p += 1\n return isPrime\n\n\ndef dijkstra(edges, f, t):\n g = defaultdict(list)\n for l, r, c in edges:\n g[l].append((c, r))\n\n q, seen, mins = [(0, f, ())], set(), {f: 0}\n while q:\n (cost, v1, path) = heappop(q)\n if v1 not in seen:\n seen.add(v1)\n path = (v1, path)\n if v1 == t:\n return (cost, path)\n\n for c, v2 in g.get(v1, ()):\n if v2 in seen:\n continue\n prev = mins.get(v2, None)\n next = cost + c\n if prev is None or next < prev:\n mins[v2] = next\n heappush(q, (next, v2, path))\n return float("inf")\n\n\ndef binsearch(a, l, r, x):\n while l <= r:\n mid = l + (r-1)//2\n if a[mid]:\n return mid\n elif a[mid] > x:\n l = mid-1\n else:\n r = mid+1\n return -1\n\n\n\n\n\n\ndef readTree(n):\n adj = [set() for _ in range(n)]\n for _ in range(n-1):\n u, v = map(int, input().split())\n adj[u-1].add(v-1)\n adj[v-1].add(u-1)\n return adj\n\n\ndef treeOrderByDepth(n, adj, root=0):\n parent = [-2] + [-1]*(n-1)\n ordered = []\n q = deque()\n q.append(root)\n depth = [0] * n\n while q:\n c = q.popleft()\n ordered.append(c)\n for a in adj[c]:\n if parent[a] == -1:\n parent[a] = c\n depth[a] = depth[c] + 1\n q.append(a)\n return (ordered, parent, depth)\n\n\nk=ii()\ns=si()\nif len(s)>k:\n print(s[:k]+\'...\')\nelse:\n print(s)'] | ['Runtime Error', 'Accepted'] | ['s097353398', 's015880832'] | [26332.0, 26272.0] | [65.0, 68.0] | [5165, 5165] |
p02676 | u137061893 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 __name__ == "__main__":\n k = int(input())\n s = input()\n #k, n = map(int, input().split())\n ls = len(s)\n print(len(s))\n \n if ls<=k:\n print(s)\n else:\n print(s[0:k] + "...")', 'if __name__ == "__main__":\n k = int(input())\n s = input()\n ls = len(s)\n \n if ls<=k:\n print(s)\n else:\n print(s[0:k] + "...")'] | ['Wrong Answer', 'Accepted'] | ['s100268491', 's163660085'] | [9168.0, 9168.0] | [21.0, 23.0] | [211, 155] |
p02676 | u137228327 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['# -*- coding: utf-8 -*-\n"""\nCreated on Sat May 30 16:59:03 2020\n\n@author: Tofu\n"""\n\ndef tran(N,string):\n #print(N)\n #print(string)\n if len(string) > N:\n strout = string[:N]+\'...\'\n return strout\n else:\n return string\n\nif __name__ == \'__main__\':\n N = int(input())\n string = input()\n ans = tran(N,string)\n ', '# -*- coding: utf-8 -*-\n"""\nCreated on Sat May 30 16:59:03 2020\n\n@author: Tofu\n"""\n\ndef tran(N,string):\n #print(N)\n #print(string)\n if len(string) > N:\n strout = string[:N]+\'...\'\n return strout\n else:\n return string\n\nif __name__ == \'__main__\':\n N = int(input())\n string = input()\n ans = tran(N,string)\n print(ans)\n '] | ['Wrong Answer', 'Accepted'] | ['s850516910', 's347314918'] | [9164.0, 9120.0] | [23.0, 20.0] | [348, 363] |
p02676 | u137962336 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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] + "...")'] | ['Runtime Error', 'Accepted'] | ['s894602238', 's073311060'] | [9184.0, 9112.0] | [23.0, 22.0] | [83, 85] |
p02676 | u142616533 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['40\nferelibenterhominesidquodvoluntcredunt', 'n = int(input())\ns = str(input())\n\nif len(s) <= n:\n print(s)\nelse:\n print(s[:n] + "...")'] | ['Runtime Error', 'Accepted'] | ['s442555036', 's096395833'] | [8908.0, 9168.0] | [21.0, 24.0] | [41, 94] |
p02676 | u146066372 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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=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[K]+"...")', '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 print(S[0:K]+"...")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s172113986', 's224175338', 's289098697', 's580613856', 's000783158'] | [9124.0, 9124.0, 9056.0, 9000.0, 9148.0] | [29.0, 24.0, 29.0, 26.0, 29.0] | [75, 82, 78, 78, 80] |
p02676 | u148183225 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\na = len(S)\n\n\nif a =< K:\n print(S)\nelse:\n print(S[:K] + ("..."))\n ', 'K = int(input())\nS = input()\n\na = len(S)\n\n\nif a <= K:\n print(S)\nelse:\n print(S[:K] + ("..."))'] | ['Runtime Error', 'Accepted'] | ['s035309085', 's911690824'] | [8864.0, 9052.0] | [25.0, 22.0] | [104, 99] |
p02676 | u152376097 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['#-*- utf-8 -*-\n\nk = int(input())\ns = list(input())\n\nrslt = ""\n\nfor index in range(k):\n if len(s) > index:\n break\n rslt += s[index]\n\nif len(s) > k:\n rslt += "..."\n\nprint(rslt, flush=True)\n', '#-*- utf-8 -*-\n\nk = int(input())\ns = list(input())\n\nrslt = ""\n\nfor index in range(k):\n if len(s) <= index:\n break\n rslt += s[index]\n\nif len(s) > k:\n rslt += "..."\n\nprint(rslt, flush=True)\n'] | ['Wrong Answer', 'Accepted'] | ['s793343648', 's190107414'] | [9168.0, 9120.0] | [23.0, 22.0] | [203, 204] |
p02676 | u158380546 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input());\ns = input();\nn = int(len(s));\na = '…'\n\nif k >= n:\n print(s);\nelse:\n print(s[:k] + a);\n", "k = int(input());\ns = input();\nn = int(len(s));\na = '...'\n\nif k >= n:\n print(s);\nelse:\n print(s[:k] + a);\n"] | ['Wrong Answer', 'Accepted'] | ['s228753824', 's175395913'] | [9124.0, 9096.0] | [19.0, 22.0] | [112, 112] |
p02676 | u161024749 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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("")\nlenS=len(S)\nif lenS<=K:\n print(S)\nelse:\n print(S[:K])', 'K=int(intput(""))\nS=input("")\nlens=len(s)\nif lens<=K:\n print(S)\nelse:\n S2=S[:K-1]\n print(S2)\n ', 'K=int(input(""))\nS=input("")\nlenS=len(S)\nif lenS<=K:\n print(S)\nelse:\n print(S[:K]+"...")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s473517877', 's969484443', 's297489543'] | [9040.0, 8968.0, 9164.0] | [19.0, 27.0, 20.0] | [84, 98, 90] |
p02676 | u163320134 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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)\nans=''\nfor i in range(k):\n if i==l:\n break\n ans+=s[i]\nelse:\n print(ans)\n exit()\nans+='...'\nprint(ans)", "k=int(input())\ns=input()\nl=len(s)\nans=''\nfor i in range(k):\n ans+=s[i]\n if i==l-1:\n break\nelse:\n ans+='...'\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s081206161', 's892848630'] | [9176.0, 9040.0] | [24.0, 22.0] | [142, 124] |
p02676 | u165133750 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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] + "...")\n', 'k = int(input())\ns = input()\nif k >= len(s):\n print(s)\nelse:\n print(s[:k] + "...")\n'] | ['Wrong Answer', 'Accepted'] | ['s235118780', 's185062638'] | [9152.0, 9096.0] | [23.0, 22.0] | [93, 89] |
p02676 | u167681994 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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) > 7:\n print("{}...".format(s))\nelse:\n print(s)\n ', 'k = int(input())\ns = input()\n\nif len(s) > k:\n print("{}...".format(s[0:k]))\nelse:\n print(s)\n'] | ['Wrong Answer', 'Accepted'] | ['s951479506', 's983229188'] | [9076.0, 9076.0] | [30.0, 30.0] | [91, 94] |
p02676 | u168832623 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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)', 'K = int(input())\nS = input()\n\nif (len(S) > K):\n print(S[:K]+"...")\nelse:\n print(S)'] | ['Runtime Error', 'Accepted'] | ['s567125478', 's524229997'] | [9096.0, 9164.0] | [24.0, 22.0] | [87, 88] |
p02676 | u174849391 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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) >= 0:\n print(S)\nelse:\n print(S[0:K+1].format(...))', 'K = int(input())\nS = input()\n\nif K - len(S) >= 0:\n print(S)\nelse:\n print(S[0:K].format(...))', 'K = int(input())\nS = input()\n\nif K - len(S) >= 0:\n print(S)\nelse:\n print("{}...".format(S[0:K]))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s203969680', 's968498995', 's974234236'] | [9156.0, 8908.0, 9100.0] | [28.0, 28.0, 30.0] | [100, 98, 102] |
p02676 | u175590965 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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+1]+'...')", "k = int(input())\ns = input()\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k]+'...')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s193355682', 's601868307', 's378393529'] | [9172.0, 9172.0, 9136.0] | [23.0, 22.0, 25.0] | [88, 88, 86] |
p02676 | u177411511 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\n#from operator import itemgetter\n#from heapq import heappush, heappop\n#import numpy as np\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\n#from scipy.sparse import csr_matrix\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\nimport sys\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nnf = lambda: float(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nnb = lambda: list(map(float, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() # ignore trailing spaces\n\nK = ni()\nS = ns()\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + '..')", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\n#from operator import itemgetter\n#from heapq import heappush, heappop\n#import numpy as np\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\n#from scipy.sparse import csr_matrix\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\nimport sys\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nnf = lambda: float(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nnb = lambda: list(map(float, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() # ignore trailing spaces\n\nK = ni()\nS = ns()\nif len(S) <= K:\n print(S)\nelse:\n print(S[:K] + '...')"] | ['Wrong Answer', 'Accepted'] | ['s907463630', 's059087393'] | [10832.0, 10876.0] | [41.0, 39.0] | [777, 778] |
p02676 | u184117766 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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(str())\n\n# print(s[0:int(k)])\n\nprint('-------------')\nif len(s) <= int(k):\n print(s)\n\nelse:\n\n print(s[0:int(k)] + '...')", "k = input()\ns = input(str())\n\nif len(s) <= int(k):\n print(s)\n\nelse:\n print(s[0:int(k)] + '...')"] | ['Wrong Answer', 'Accepted'] | ['s284824833', 's732108080'] | [9156.0, 9128.0] | [22.0, 21.0] | [147, 101] |
p02676 | u184661160 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\n\ndef dict_sort(ans):\n ans=sorted(ans.items(),reverse=True,key=lambda kv:(kv[1]))\ndef is_prime(n,k):\n if n==1:\n return 0\n for i in range(2,int(math.sqrt(n))+1):\n if n%i==0:\n res=i\n break\n return res\ndef inp():\n ls=list(map(int,input().split()))\n return ls\nt=int(input())\ns=input()\nif len(s)<=t:\n print(s)\nelse:\n print(s[0:t],end="")\n for i in range(len(s)-t):\n print(\'.\',end=\'\')\n print()\n', 'import math\n\ndef dict_sort(ans):\n ans=sorted(ans.items(),reverse=True,key=lambda kv:(kv[1]))\ndef is_prime(n,k):\n if n==1:\n return 0\n for i in range(2,int(math.sqrt(n))+1):\n if n%i==0:\n res=i\n break\n return res\ndef inp():\n ls=list(map(int,input().split()))\n return ls\nt=int(input())\ns=input()\nif len(s)<=t:\n print(s)\nelse:\n print(s[0:t]+"...")\n'] | ['Wrong Answer', 'Accepted'] | ['s761692868', 's047214017'] | [9204.0, 9124.0] | [23.0, 21.0] | [502, 433] |
p02676 | u185806788 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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]+"...")\n ', 'K=int(input())\nS=input()\nif K >= len(S):\n print(S)\nelse:\n print(S[:K]+"...")\n '] | ['Runtime Error', 'Accepted'] | ['s624327281', 's768294193'] | [8944.0, 9156.0] | [22.0, 24.0] | [81, 81] |
p02676 | u187883751 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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] + '...')"] | ['Runtime Error', 'Accepted'] | ['s956674113', 's792627531'] | [9000.0, 9072.0] | [22.0, 25.0] | [81, 81] |
p02676 | u188272222 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\nelif len(s) > k:\n print(str(s)+"...")', 'k = int(input())\ns = list(input())\n\nif len(s) <= k :\n print(\'\'.join(s))\n\nelif len(s) > k:\n print(str(\'\'.join(s[:k])) + "...")'] | ['Wrong Answer', 'Accepted'] | ['s179685404', 's527317699'] | [9172.0, 9160.0] | [23.0, 23.0] | [97, 127] |
p02676 | u192042624 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\nimport sys\nimport math\n\nK = int(input())\nS = input()\n\nif len(S) <= K :\n print(S)\nelse:\n print(S+"...")', 'import numpy as np\nimport sys\nimport math\n\nK = int(input())\nS = input()\n\nif len(S) <= K :\n print(S)\nelse:\n print(S[:K]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s761468288', 's492350860'] | [27132.0, 27040.0] | [106.0, 109.0] | [127, 131] |
p02676 | u192165179 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\nl = len(S)\n\nif l < K+1:\n print(S)\nelse:\n print(S[:K])', "K = int(input())\nS = input()\n\nl = len(S)\n\nif l <= K:\n print(S)\nelse:\n print(S[:K] + '…')", 'K = int(input())\nS = input()\n\nl = len(S)\n\nif l <= K:\n print(S)\nelse:\n print(S[:K])', "K = int(input())\nS = input()\n\nl = len(S)\n\nif l <= K:\n print(S)\nelse:\n print(S[:K] + '...')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s138909208', 's500763312', 's962163176', 's147488598'] | [9096.0, 9064.0, 9096.0, 9072.0] | [23.0, 23.0, 24.0, 19.0] | [85, 92, 84, 92] |
p02676 | u193582576 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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], end="")\n print("."*(len(S)-K))\n\n', 'K = int(input())\nS = input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K],"."*(len(S)-K))\n\n', 'K = int(input())\nS = input()\nif len(S)<=K:\n print(S)\nelse:\n print(S[:K]+"...")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s058004449', 's163557422', 's790003332'] | [9160.0, 9092.0, 9152.0] | [21.0, 23.0, 23.0] | [114, 95, 85] |
p02676 | u197525404 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 answer(k:int, s:str) -> str:\n if len(s) <= k:\n return s\n else:\n return s[:(k-1)] + '...'\n\nk = int(input())\ns = input()\n\nprint(answer(k, s))", "def answer(k:int, s:str) -> str:\n if len(s) <= k:\n return s\n else:\n return s[:k] + '...'\n\nk = int(input())\ns = input()\n\nprint(answer(k, s))"] | ['Wrong Answer', 'Accepted'] | ['s913043523', 's239923395'] | [9168.0, 9164.0] | [28.0, 26.0] | [163, 159] |
p02676 | u198010035 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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] + '...')", "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', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s327512752', 's576624924', 's843847277', 's061764511'] | [9160.0, 9076.0, 9092.0, 9144.0] | [22.0, 21.0, 22.0, 21.0] | [79, 87, 87, 88] |
p02676 | u199441105 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[:a+1]+"...")\nelse:\n print(s)', 'a = int(input())\ns = input()\nif len(s) > a:\n print(s[:a]+"...")\nelse:\n print(s)'] | ['Wrong Answer', 'Accepted'] | ['s323177862', 's359711155'] | [9156.0, 9164.0] | [28.0, 28.0] | [83, 81] |
p02676 | u200228637 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nx = len(S)\n \nif x <= K:\n print(S)\nelse:\n print(S[K - 1:])', 'K = int(input())\nS = input()\nx = len(s)\n \nif x <= K:\n print(S)\nelse:\n print(S[K:])', 'K = int(input())\nS = input()\nx = len(S)\n \nif x <= K:\n print(S)\nelse:\n print(S[K:])', "K = int(input())\nS = input()\nx = len(S)\n \nif x <= K:\n print(S)\nelse:\n print(S[K - 1:] + '...')", "K = int(input())\nS = input()\nx = len(S)\n \nif x <= K:\n print(S)\nelse:\n print(S[K - 1:]\u3000+ '...')", "K = int(input())\nS = input()\n\nx = len(s)\n\nif x > K:\n print(S[1:] + '...')\nelse:\n print(S)", "K = int(input())\nS = input()\nx = len(S)\n \nif x <= K:\n print(S)\nelse:\n print(S[K:]\u3000+ '...')", 'K = int(input())\nS = input()\nx = len(s)\n\nif x <= K:\n print(S)\nelse:\n print(S[K -1:])', "K = int(input())\nS = input()\nx = len(S)\n \nif x <= K:\n print(S)\nelse:\n print(S[:K] + '...')"] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s061722417', 's100384261', 's200291929', 's338705584', 's765497412', 's837176627', 's854950795', 's931432112', 's269871661'] | [9164.0, 9168.0, 9192.0, 9168.0, 9000.0, 9192.0, 8964.0, 9164.0, 9096.0] | [21.0, 20.0, 18.0, 21.0, 21.0, 22.0, 24.0, 20.0, 23.0] | [88, 84, 84, 96, 98, 91, 94, 86, 96] |
p02676 | u202385788 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[:k] + "...")\nelse:\n print(s)'] | ['Wrong Answer', 'Accepted'] | ['s168102000', 's994695660'] | [9108.0, 9168.0] | [22.0, 21.0] | [84, 88] |
p02676 | u203962828 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s574486058', 's003247690'] | [9148.0, 9156.0] | [31.0, 25.0] | [93, 89] |
p02676 | u205087376 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 a = s+s[0:k]\n print(a)', 'k = int(input())\ns = str(input())\nif k>=len(s):\n print(s)\nelse:\n a = str(s+s[0:k])\n print(a)\n', "k = int(input())\ns = str(input())\nif k>=len(s):\n print(s)\nelse:\n a = s+'...'\n print(a)\n", "k = int(input())\ns = str(input())\nif k>=len(s):\n print(s)\nelse:\n a = s[0:k]+'...'\n print(a)\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s368413641', 's740924954', 's999768264', 's904743940'] | [9168.0, 9160.0, 9160.0, 9160.0] | [24.0, 24.0, 24.0, 23.0] | [90, 96, 90, 95] |
p02676 | u205303316 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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)\nelif len(S) > K:\n print(S[0:int(K)])', 'K=int(input())\nS=str(input())\nif len(S) <= K:\n print(S)\nelif len(S) > K:\n print(S[0:int(K)]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s206789708', 's679533054'] | [9168.0, 9172.0] | [21.0, 22.0] | [98, 104] |
p02676 | u206541745 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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(K)\nelse:\n print(S.replace(S[K:len(S)],"..."))', 'k=int(input())\ns=str(input())\nif len(s)<=k:\n print(k)\n else:\n print(s.replace(s[K:len(s)],"..."))', 'k=int(input())\ns=str(input())\n\nif len(s)<=k:\n print(s)\n else:\n print(s[0:k]+"...")', 'k=int(input())\ns=str(input())\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[0:k]+"...")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s219882969', 's900023552', 's993024862', 's060414073'] | [9040.0, 8960.0, 8848.0, 9140.0] | [21.0, 23.0, 22.0, 21.0] | [68, 102, 87, 85] |
p02676 | u209275335 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[:8])', 'k = int(input())\ns = input()\nif k >= len(s):\n print(s)\nelse:\n print(s[:k]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s522538274', 's847315500'] | [9104.0, 9168.0] | [24.0, 22.0] | [80, 86] |
p02676 | u209911545 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 = str(input())\nS = str(input())\n\nif len(S) < len(K):\n print(S)\n\nelse:\n print(S[0:len(K)]+"...")', 'K = int(input())\nS = str(input())\n\nif len(S) <= K:\n print(S)\n\nelse:\n print(S[0:K]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s274920212', 's835197990'] | [9036.0, 9160.0] | [21.0, 23.0] | [103, 94] |
p02676 | u210882514 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\n for i in range(0,K):\n\n print(S[i], end="")\n \n print("")\n\nelse:\n\n print(S)', 'K = int(input())\nS = input()\n\nif len(S) > K:\n\n for i in range(0,K):\n\n print(S[i], end="")\n \n print("...")\n\nelse:\n\n print(S)'] | ['Wrong Answer', 'Accepted'] | ['s067533629', 's263607490'] | [9172.0, 9168.0] | [22.0, 23.0] | [139, 142] |
p02676 | u212242633 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s013594250', 's944213398'] | [8952.0, 9156.0] | [26.0, 29.0] | [82, 91] |
p02676 | u213314609 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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: print( S[0:K].join('...')", "K = int(input())\nS = raw_input()\nif (len(S) == K):\n print(S)\nelse: print(S[0:K] + '...')", "K = int(input())\nS = input()\nif (len(S) <= K):\n print(S)\nelse: print(S[0:K] + '...')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s318928965', 's827152206', 's500105036'] | [9032.0, 9164.0, 9168.0] | [25.0, 19.0, 21.0] | [89, 89, 85] |
p02676 | u217138547 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["ln=int(input())\nst=input()\nop=''\nif len(st)<=ln:\n print(st)\nelse:\n ln1=len(st)-ln\n for i in range(ln1):\n op=op+'.'\n print(st[:ln]+op)\n ", "ln=int(input())\nst=input()\nop=''\nif len(st)<=ln:\n print(st)\nelse:\n ln1=len(st)-ln\n for i in range(ln):\n op=op+'.'\n print(st[:ln]+op)\n ", "ln=int(input())\nst=input()\nop=''\nif len(st)<=ln:\n print(st)\nelse:\n ln1=len(st)-ln\n for i in range(ln):\n op=op+'.'\n print(st[:ln]+op\n ", "ln=int(input())\ns=input()\nl=len(s)\nif ln<l:\n print(s[:ln]+'...')\n\nelif ln>=l:\n print(s)\n "] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s006427921', 's719803805', 's897452123', 's769270644'] | [9080.0, 9176.0, 9028.0, 9144.0] | [23.0, 23.0, 21.0, 21.0] | [145, 144, 143, 92] |
p02676 | u217836256 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nlist_s =list(S)\nT = len(list_s)\nif T > K:\n for i in range(K,T):\n list_s[i] = \'.\'\n S =""\n for i in range(T):\n S += list_s[i]\nprint(S)', 'K = int(input())\nS = input()\nlist_s =list(S)\nT = len(list_s)\nif T > K:\n for i in range(K,T):\n del list_s[K]\n S =""\n for i in range(K):\n S += list_s[i]\n S += \'...\'\nprint(S)\n'] | ['Wrong Answer', 'Accepted'] | ['s493010454', 's168411889'] | [9176.0, 9176.0] | [21.0, 25.0] | [184, 198] |
p02676 | u218216885 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s688789158', 's402067155'] | [9116.0, 9172.0] | [21.0, 21.0] | [89, 87] |
p02676 | u219494936 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['40\nferelibenterhominesidquodvoluntcredunt', 'K = int(input())\nS = input()\n\nif len(S) > K:\n print(S[:K] + "...")\nelse:\n print(S)'] | ['Runtime Error', 'Accepted'] | ['s408062711', 's221476890'] | [9072.0, 9168.0] | [20.0, 22.0] | [41, 84] |
p02676 | u219937318 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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())\n\nSL=len(S)\n\nif SL =< K:\n print(S)\nelif SL > K:\n print(S[0:(SL-1):1])', 'K=int(input())\nS=list(input())\n\nif (len(S)+1) <= K:\n print(S)\nelse:\n print(S[0:K:1],"...")\n', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) < K:\n print(S)\nelse:\n print(s[0:(K-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nif len(S) < K:\n print(S)\nelif len(S) > K:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nLS=len(S)\n\nif LS <= K:\n print(S)\nelif LS > K:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nif len(S) <= K:\n print(list(S))\nelse:\n print(S[0:(K-1):1],"...")', 'K=int(input())\nS=input()\n\nSL=len(S)\n\nif SL =< K:\n print(S)\nelif SL > K:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nif (len(S)+1) <= K:\n print(S)\nelse:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) =< K:\n print(S)\nelse:\n print(S[0:K:]+"...")\n', 'K=int(input())\nS=list(input())\n\nif (len(S)+1) <= K:\n print(S)\nelif (len(S)+1) > K:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:(K-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nif len(S) < K:\n print(S)\nelse:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nSL==len(S)\n\nif SL =< K:\n print(S)\nelif SL > K:\n print(S[0:(SL-1):1],"...")', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) < K:\n print(S)\nelse:\n print(s[0:(K-1):],"...")\n', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) < K:\n print(S)\nelse:\n print(S[0:(K-1):],"...")\n', 'K=int(input())\nS=list(input())\n\nLS=len(S)\n\nif (LS+1) <= K:\n print(S)\nelif (LS+1) > K:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nif len(S) < K:\n print(S)\nelse:\n print(S[0:(K-1):1],"...")', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) < K:\n print(S)\nelse:\n print(s[0:K:1],"...")\n', 'K=int(input())\nS=list(input())\n\nLS==len(S)\n\nif LS <= K:\n print(S)\nelif LS > K:\n print(S[0:(SL-1):1],"...")', 'K=int(input())\nS=list(input())\n\nif len(S) =< K:\n print(S)\nelif len(S) > K:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nLS=len(S)+1\n\nif LS <= K:\n print(S)\nelif LS > K:\n print(S[0:(SL-1):1],"...")\n', 'K=int(input())\nS=list(input())\n\nLS==len(S)+1\n\nif LS <= K:\n print(S)\nelif LS > K:\n print(S[0:(SL-1):1],"...")', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) < K:\n print(S)\nelse:\n print(s[0:(K-1):],"...")\n', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) < K:\n print(S)\nelse:\n print(s[0:(K-1):]+"...")\n', 'K=int(input())\nS=input()\ns=list(S)\n\nif len(s) <= K:\n print(S)\nelse:\n print(S[0:K:]+"...")\n'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s116322602', 's131735491', 's184373413', 's237891212', 's318244300', 's321153750', 's353517604', 's380754830', 's382879878', 's427845311', 's442494231', 's521787665', 's526198787', 's576328838', 's636738916', 's673368316', 's747073133', 's755357847', 's768289285', 's788684471', 's893643674', 's927419544', 's930938577', 's977020293', 's094588395'] | [9016.0, 9192.0, 9164.0, 9076.0, 9096.0, 9168.0, 8908.0, 9076.0, 8916.0, 9056.0, 9160.0, 9188.0, 9020.0, 9088.0, 9092.0, 9168.0, 9060.0, 9160.0, 9056.0, 9016.0, 9164.0, 9108.0, 9164.0, 9068.0, 9092.0] | [23.0, 24.0, 23.0, 20.0, 23.0, 23.0, 23.0, 22.0, 22.0, 21.0, 21.0, 23.0, 27.0, 24.0, 23.0, 23.0, 23.0, 22.0, 22.0, 24.0, 22.0, 25.0, 23.0, 20.0, 21.0] | [105, 97, 100, 108, 112, 102, 106, 102, 96, 117, 97, 97, 112, 99, 99, 120, 95, 96, 112, 109, 114, 114, 99, 99, 96] |
p02676 | u224740009 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nw = input()\nl = len(w)\nif l <= k:\n\tprint(w)\nelse:\n print(w[:k])\n', 'k = input()\nstr = input()\nl = len(str)\nif l <= k:\n print(str)\n else:\n print(s[:k])\n', 'k = input()\nw= input()\nl = len(str)\n\tif l <= k:\n print(str)\n \telse:\n print(w[:k])\n', 'k = input()\nstr = input()\nl = len(str)\nif l <= k:\n print(str)\n else:\n print(s[:k])', 'k = input()\nstr = input()\nl = len(str)\nif l <= k:\n print(str)\n else:\n print(s[1:k])', 'k = input()\nw = input()\nl = len(w)\nif l <= k:\n\tprint(w)\nelse:\n print(w[:k]"...")\n', 'k = input()\nw= input()\nl = len(w)\nif l <= k:\n \t \n print(w)\nelse:\n \t print(w[:k])\n', 'k = input()\nw = input()\nl = len(w)\nif l <= k:\n\tprint(w)\nelse:\n print(w[:k])', 'k = int(input())\ns = input()\nif int(len(s)) <= k:\n \tprint(str(s))\nelse:\n \tprint(((str(s))[0:k])', 'k = input()\nw = input()\nl = len(w)\nif l <= k:\n \t print(w)\nelse:\n \t print(w[:k])\n', 'k = int(input())\ns = input()\nl = len(s)\nif l <= k:\n\tprint(s)\nelse: \n \tprint(s[0:k]"...")\n', 'k = input()\nw= input()\nl = len(w)\n\tif l <= k:\n \t print(w)\n \telse:\n \t print(w[:k])\n', 'k = input()\nw= input()\nl = len(w)\nif l <= k:\n\tprint(w)\nelse:\n\tprint(w[:k])\n', 'k = int(input())\ns = input()\nif int(len(s)) <= k:\n \tprint(str(s))\nelse:\n \tprint(((str(s))[0:k]) + "...")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s016833996', 's146150885', 's168702317', 's179919496', 's189373441', 's193843255', 's415407334', 's432897226', 's435082065', 's453316030', 's606820769', 's792300328', 's969110492', 's817758862'] | [9016.0, 9012.0, 8960.0, 9024.0, 9020.0, 9024.0, 9100.0, 9112.0, 9044.0, 9052.0, 8812.0, 9016.0, 9100.0, 9184.0] | [22.0, 25.0, 22.0, 24.0, 21.0, 20.0, 21.0, 22.0, 22.0, 24.0, 22.0, 22.0, 24.0, 22.0] | [79, 88, 87, 87, 88, 84, 86, 78, 97, 82, 90, 85, 75, 106] |
p02676 | u227550284 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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)', "import sys\ninput = sys.stdin.readline\n\ndef main():\n k = int(input())\n s = input().rstrip()\n\n if len(s) <= k:\n print(s)\n else:\n print(s[:k] + '...')\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s362675756', 's822312855', 's983630800'] | [9160.0, 9096.0, 9164.0] | [23.0, 20.0, 25.0] | [76, 76, 213] |
p02676 | u228303592 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 s = s[0,k]+"..."\nprint(s)\n\n', "k = int(input())\ns = input()\n\nif len(s) > k:\n s = s[k] + '...'\n \nprint(s) ", 's = input()\nk = int(input())\n\nif k < len(s):\n s = s[0,k]+"..."\nprint(s)', 'k = int(input())\ns = input()\n\nif len(s) > k:\n s = s[k] + "..."\n \nprint(s) \n', 'k = int(input())\ns = input()\n\nif k < len(s):\n s = s[:k]+"..."\nprint(s)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s195028690', 's538645077', 's604792303', 's946561823', 's550730410'] | [9028.0, 9076.0, 9052.0, 9000.0, 9048.0] | [23.0, 21.0, 23.0, 21.0, 29.0] | [74, 77, 72, 78, 71] |
p02676 | u230364791 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s973928685', 's998323654'] | [9096.0, 9084.0] | [23.0, 21.0] | [82, 78] |
p02676 | u230717961 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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])\n', 'k = int(input())\ns = input()\n\nlength = len(s)\n\nif length <= k:\n print(s)\nelse:\n print(s[:k] + "...")'] | ['Wrong Answer', 'Accepted'] | ['s653011534', 's573297551'] | [9168.0, 9160.0] | [21.0, 22.0] | [42, 102] |
p02676 | u231484984 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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) <= int(K):\n print(S)\nelse:\n print(S[0:int(K)])', "K = input()\nS = input()\nif len(S) <= int(K):\n print(S)\nelse:\n print(S[0:int(K)] +'...')"] | ['Wrong Answer', 'Accepted'] | ['s346910939', 's563498635'] | [9052.0, 9040.0] | [22.0, 21.0] | [87, 94] |
p02676 | u231518782 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\nK = int(input())\nS = input()\n\nprint(K,len(S))\n\nif K >= len(S):\n print(S)\nelse:\n print(S[:K]+'...')", "import sys\n\nK = int(input())\nS = input()\n\nprint(K,len(S))\n\nif K > len(S):\n print(S)\nelse:\n print(S[:K]+'...')\n", "import sys\n\nK = int(input())\nS = input()\n\nif K >= len(S):\n print(S)\nelse:\n print(S[:K]+'...')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s054455928', 's159238188', 's078329780'] | [9168.0, 9152.0, 9168.0] | [23.0, 23.0, 23.0] | [116, 116, 99] |
p02676 | u232462528 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['40\nferelibenterhominesidquodvoluntcredunt', 'n=int(input())\ns=input()\nif len(s)>n:\n print(s[:n]+"...")\nelse:\n print(s)'] | ['Runtime Error', 'Accepted'] | ['s248083506', 's709241389'] | [9008.0, 9152.0] | [23.0, 21.0] | [41, 75] |
p02676 | u233841219 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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]+"."*(len(s) - k))', 'k = int(input())\ns = input()\nif k >= len(s):\n print(s)\nelse:\n print(s[:k]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s205511060', 's959097100'] | [9160.0, 9172.0] | [23.0, 23.0] | [97, 86] |
p02676 | u236978474 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 triple_dot():\n k = int(input())\n s = list(input())\n len_s =len(s)\n result_s = []\n \n if len_s > k:\n for i in range(k):\n result_s.append(s[i])\n if len_s < k:\n print("".join(s))\n\ntriple_dot()', 'def triple_dot():\n k = int(input())\n s = input()\n len_s =len(s)\n result_s = []\n \n if len_s > k:\n for i in range(k):\n result_s.append(s[i])\n print("".join(result_s) + "...")\n else:\n print("".join(s))\ntriple_dot()'] | ['Wrong Answer', 'Accepted'] | ['s317058224', 's552326357'] | [9124.0, 9092.0] | [23.0, 21.0] | [238, 264] |
p02676 | u237601489 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 = s[:k] + "..."\n\nprint(s)', 'K = int(input())\nS = input()\nif len(S)>K:\n print( S[:K] + "...")\nelse:\n print(S)'] | ['Runtime Error', 'Accepted'] | ['s649359255', 's885888646'] | [9116.0, 9172.0] | [20.0, 26.0] | [73, 85] |
p02676 | u240292623 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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)>=int(k):\n print(s)\nelse:\n print(s[0:int(k)]+'...')", "k = input()\ns = input()\nif len(s)<=int(k):\n print(s)\nelse:\n print(s[0:int(k)]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s955817386', 's475381678'] | [9164.0, 9168.0] | [25.0, 22.0] | [90, 90] |
p02676 | u244423127 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['k = input()\ns = input()\n\nif len(s) <= int(k):\n print(s)\nelse:\n print(s[0:k] + "...")', 'k = input()\ns = input()\n\nif len(s) <= int(k):\n print(s)\nelse:\n print(s[0:int(k)] + "...")'] | ['Runtime Error', 'Accepted'] | ['s966645067', 's704295191'] | [9144.0, 9164.0] | [25.0, 22.0] | [86, 91] |
p02676 | u244434589 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nx = len(s)\n\nif x<=K:\n print(s)\nelse:\n print(S[:K]+'...')", "K=int(input())\ns =input()\nx = len(s)\n\nif x<=K:\n print(s)\nelse:\n print(s[:K]+'...')"] | ['Runtime Error', 'Accepted'] | ['s107402464', 's323966713'] | [9020.0, 9184.0] | [27.0, 30.0] | [88, 88] |
p02676 | u244466744 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\nlength = len(S)\n\nif length <= K:\n print(S)\n \nelse:\n S = S[K:]\n print(S.apend("..."))\n ', 'K = int(input())\nS = input()\n\nlength = len(S)\n\nif length <= K:\n print(S)\n \nelse:\n S = S[K:]\n print(S + "...")\n \n', 'K = int(input())\nS = input()\n\nlength = len(S)\n\nif length <= K:\n print(S)\n \nelse:\n S = S[:K]\n print(S + "...")\n \n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s394774171', 's913806040', 's868097593'] | [9096.0, 9156.0, 9144.0] | [29.0, 30.0, 29.0] | [121, 117, 117] |
p02676 | u244836567 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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=input()\na=int(a)\nb=input()\nc=""\nif a>=len(b):\n print(b)\nelse:\n for i in range(a):\n c=c+b[i]\n print(c)', 'a=input()\na=int(a)\nb=input()\nc=""\nif a>=len(b):\n print(b)\nelse:\n for i in range(a):\n c=c+b[i]\n print(c+"...")'] | ['Wrong Answer', 'Accepted'] | ['s019331763', 's765675905'] | [9068.0, 9092.0] | [28.0, 28.0] | [109, 115] |
p02676 | u245954478 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[0:S] + '...')", "K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K] + '...')"] | ['Runtime Error', 'Accepted'] | ['s494722860', 's603694475'] | [9136.0, 9144.0] | [23.0, 27.0] | [90, 90] |
p02676 | u248081745 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\n\nK = int(K)\n \ns_length = len(S)\n\n\nif s_length > K:\n val = S[0:K]\n print(val,'...')\nelse :\n print(S)", "K = input()\nS = input()\n\n\nK = int(K)\nprint(K) \ns_length = len(S)\n\n\nif s_length > K:\n val = S[0:K]\n print(val,'...')\nelse :\n print(S)", "K = int(input())\nS = input()\n\nif len(S) > K:\n S = S[:K] +'...'\n\nprint(S)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s495406565', 's728735143', 's478264313'] | [9172.0, 9060.0, 9176.0] | [24.0, 25.0, 24.0] | [133, 141, 75] |
p02676 | u249629612 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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) > int(k):\n print(s[:k]+'...')\nelse:\n print(s)", "K = int(input())\nS = input()\nif len(S) > K:\n\tprint(S[:K] + '...')\nelse:\n\tprint(S)"] | ['Runtime Error', 'Accepted'] | ['s725094785', 's881793156'] | [9104.0, 9060.0] | [19.0, 24.0] | [81, 81] |
p02676 | u257856080 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ["k = int(input())\ns = input()\nls = len(s)\n\nif ls <=k:\n print(s)\nelse:\n print(s+'...')", "k = int(input())\ns = input()\nls = len(s)\n\nif ls <=k:\n print(s)\nelse:\n print(s[:k]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s713195416', 's416838467'] | [9100.0, 9168.0] | [22.0, 24.0] | [90, 94] |
p02676 | u259957186 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nwhile len(s)<n:\n s=s[:n]+"..."\nprint(s) ', 'n=int(input())\ns=input()\nif len(s)>n:\n s=s[:n]+"..."\nprint(s) '] | ['Wrong Answer', 'Accepted'] | ['s904994810', 's119113387'] | [9100.0, 9160.0] | [25.0, 23.0] | [69, 65] |
p02676 | u260068288 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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("{fname}...".format(fname = s[:k]))', "k=int(input())\ns=input()\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k]+'...')"] | ['Runtime Error', 'Accepted'] | ['s233680410', 's514153827'] | [9004.0, 9160.0] | [23.0, 21.0] | [106, 82] |
p02676 | u262543030 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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#print(len(S))\n#print(S[1:3])\n\nif len(S) <= K :\n print(S)\nelse:\n print(S[1:K])', 'K = int(input())\nS = input()\n\n#print(len(S))\n#print(S[1:3])\n\nif len(S) <= K :\n print(S)\nelse:\n print(S[1:K] + "...")', 'K = int(input())\nS = input()\n\n#print(len(S))\n#print(S[1:3])\n\nif len(S) > K :\n print(S[1:K] + "...")\nelse:\n print(S)', 'K = int(input())\nS = input()\n\n#print(len(S))\n#print(S[1:3])\n\nif len(S) <= K :\n print(S)\nelse:\n print(S[0:K] + "...")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s388567984', 's614270507', 's806565653', 's870107588'] | [9092.0, 9112.0, 9028.0, 9156.0] | [21.0, 26.0, 23.0, 20.0] | [110, 118, 117, 118] |
p02676 | u266143155 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 = []\ns = str(input())\nif len(s)<= k:\n print(s)\nelse:\n print(s[0:k],'...')", "k = int(input())\ns = []\ns = str(input())\nif len(s)<= k:\n print(s)\nelse:\n print(s[0:k]+'...')"] | ['Wrong Answer', 'Accepted'] | ['s966401805', 's423198682'] | [9108.0, 9164.0] | [22.0, 21.0] | [98, 98] |
p02676 | u266675845 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 SK = S[: K]+ "…"\n print(SK)', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelif len(S) > K:\n SK = S[: K]+ "..."\n print(SK)'] | ['Wrong Answer', 'Accepted'] | ['s493351846', 's548739449'] | [9168.0, 9152.0] | [22.0, 23.0] | [112, 112] |
p02676 | u268314634 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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=input()\ns=input()\n\nif len(s)<int(k):\n print(s)\nelse:\n print(s+"...")', '\nk=input()\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s+"...")', '\nk=int(input())\ns=input()\n\nif len(s)<k:\n print(s)\nelse:\n print(s+"...")', '\nk=input()\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s+"...")', '\nk=int(input())\ns=input()\n\nif len(s)<=k:\n print(s)\nelse:\n print(s+"...")', '\nk=int(input())\ns=input()\n\n#if len(s)<=k:\n # print(s)\n #else:\n #print(s+"...")\n\n\n\n\n\n\n\n\nif len(s)<=k:\n print(s)\nelse:\n print(s[:k] + \'...\')\n \n\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s304207123', 's517120901', 's534943214', 's698098111', 's976786548', 's540055545'] | [9164.0, 9024.0, 9108.0, 9032.0, 9048.0, 8996.0] | [25.0, 24.0, 24.0, 22.0, 27.0, 28.0] | [77, 73, 77, 73, 78, 235] |
p02676 | u275030199 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 = str(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'] | ['s957832946', 's452581856'] | [9100.0, 9160.0] | [22.0, 22.0] | [82, 84] |
p02676 | u279570066 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[0:K-1]+"...")', 'K = int(input())\nSub = input()\n\nif len(Sub) <= K:\n print(Sub)\nelif len(Sub) > K:\n print(Sub[0:K-1]+"...")', 'K = int(input())\nS = input()\n \nif len(S) <= K:\n print(S)\nelif len(S) > K:\n print(S[0:K]+"...")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s271786095', 's503522360', 's675995820'] | [9164.0, 9136.0, 9160.0] | [24.0, 28.0, 30.0] | [98, 107, 96] |
p02676 | u282248252 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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("K:"))\nS = str(input("S:"))\n\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:K] + "...")\n', 'K = int(input())\nS = str(input())\n\ns = len(S)\n\nif s <= K:\n print(S)\nelse:\n print(S[:K] + "...")\n'] | ['Wrong Answer', 'Accepted'] | ['s018617445', 's576719975'] | [9164.0, 9160.0] | [23.0, 19.0] | [110, 102] |
p02676 | u282707041 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nlng=len(s)\nx=s[:k]\nif k < lng:\n print(s)\nelse:\n print(x+'...')", "k=int(input())\ns=input()\nlng=len(s)\nx=s[:k]\nif k >= lng:\n print(s)\nelse:\n print(x+'...')\n\n"] | ['Wrong Answer', 'Accepted'] | ['s876723605', 's384728807'] | [9168.0, 9164.0] | [24.0, 24.0] | [93, 96] |
p02676 | u285833393 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s422323528', 's829785403'] | [9164.0, 9164.0] | [23.0, 24.0] | [81, 89] |
p02676 | u289105044 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nn=input()\n\nm=len(n)\n\nt=int (k)\n\n\n\nif(m==t):\n print("n")\n \nelse:\n for i, name in enumerate(n):\n if i==t:\n break\n print(name,end=\'\')\n \n \n\n', 'k=input()\nn=input()\n\nm=len(n)\n\nt=int (k)\n\n\n\nif(m<=t):\n print("n")\n \nelse:\n for i, name in enumerate(n):\n if i==t:\n break\n print(name,end=\'\')\n \n \n\n', 'k=input()\nn=input()\n\nm=len(n)\n\nt=int (k)\n\n\n\nif(m<=t):\n print("n")\n \nelse:\n for i, name in enumerate(n):\n if i==t:\n break\n print(name,end=\'\')\n \n \n\n', 'k=input()\nn=input()\n\nm=len(n)\n\nt=int (k)\n\n\n\nif(m<=t):\n print(n)\n \nelse:\n for i, name in enumerate(n):\n if i==t:\n print("...")\n break\n print(name,end=\'\')\n \n \n\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s133553643', 's399500655', 's620853500', 's050145731'] | [9104.0, 9140.0, 9136.0, 8896.0] | [22.0, 26.0, 21.0, 23.0] | [166, 166, 166, 183] |
p02676 | u289288647 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\ntry:\n if 0 > int(K) or int(K) >= 100:\n print("K\'s value must be over 1 and under 100")\n exit()\nexcept ValueError:\n print("K\'s value must be integer")\n exit()\n\nS = input()\nif 1 > len(S) or 100 < len(S):\n print("S\'s length must be over 1 and under 100")\n exit()\n \nif len(S) <= int(K):\n print(S)\nelse:\n S = S[:K]\n S.append(\'...\')\n print(S)\n ', 'K = input()\n\ntry:\n if 0 > int(K) or int(K) >= 100:\n print("K\'s value must be over 1 and under 100")\n exit()\nexcept ValueError:\n print("K\'s value must be integer")\n exit() \n\nS = input()\n if 1 > len(S) or 100 < len(S):\n print("S\'s length must be over 1 and under 100")\n exit()\n \n if len(S) <= int(K):\n print(S)\n else:\n S = S[:int(K)]\n S += \'...\'\n print(S)\n', 'K = input()\n\ntry:\n if 0 > int(K) or int(K) >= 100:\n print("K\'s value must be over 1 and under 100")\n exit()\nexcept ValueError:\n print("K\'s value must be integer")\n exit() \n\nS = input()\n if 1 > len(S) or 100 < len(S):\n print("S\'s length must be over 1 and under 100")\n exit()\n \n if len(S) <= int(K):\n print(S)\n else:\n S = S[:int(K)]\n S += \'...\'\n print(S)\n', "K = input()\nS = input()\n\n \nif len(S) <= int(K):\n print(S)\nelse:\n S = S[:int(K)]\n S += '...'\n print(S)\n"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s372530045', 's701202651', 's968521050', 's035180495'] | [9184.0, 9012.0, 8968.0, 9148.0] | [24.0, 27.0, 25.0, 24.0] | [367, 393, 387, 108] |
p02676 | u298376876 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 >= S:\n print(S)\nelse:\n print(S[:K] + '...')", "k = int(input())\ns = input()\n\nif len(s) > k:\n s = s[:k] + '...'\n \nprint(s)"] | ['Runtime Error', 'Accepted'] | ['s286522604', 's988966588'] | [9144.0, 9132.0] | [24.0, 22.0] | [85, 76] |
p02676 | u307592354 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\ndef heikatu(A,B):\n if A % abs(B) ==0:\n return (A//abs(B),B//abs(B))\n if abs(B) % A == 0:\n return (1,B//A)\n \n c = 2\n while c <=math.sqrt(max(A,abs(B))):\n while A % c ==0 and B% c ==0:\n A //=c\n B//=c\n c+=1\n\n return (A,B)\n\n\ndef pow_r(x, n,mod=10**9+7):\n \n if n == 0: # exit case\n return 1\n if n % 2 == 0: # standard case ① n is even\n return pow_r((x ** 2)%1000000007 , n // 2) % mod\n else: # standard case ② n is odd\n return (x * pow_r((x ** 2)%1000000007, (n - 1) // 2) % mod) % mod\n\n\n\ndef resolve():\n N = int(input())\n\n kp = dict()\n km = dict()\n zero = [0,0]\n zerozero = 0\n for i in range(N):\n A,B = map(int,input().split())\n if A <0:\n A *= -1\n B *= -1\n if A == 0 and B == 0:\n zerozero+=1\n continue\n\n if A == 0:\n zero[0]+=1\n continue\n if B == 0:\n zero[1]+=1\n continue\n\n xx = heikatu(A,B)\n\n\n\n if B < 0:\n if not xx in km:\n km[xx]=0\n km[xx]+=1\n else:\n if not xx in kp:\n kp[xx]=0\n kp[xx]+=1\n\n tx = []\n if zero != [0,0]:\n tx.append(zero)\n\n for key in kp:\n A,B = key\n cou = kp[key] \n if (B,-A) in km:\n tx.append([cou,km[(B,-A)]])\n km.pop((B,-A))\n else:\n tx.append([cou,0])\n for key in km:\n tx.append([0,km[key]])\n\n ans = 1\n mod = 1000000007\n for a,b in tx:\n xxx = 0\n if a != 0:\n xxx=(xxx+pow_r(2,a)) %mod\n if b != 0:\n xxx=(xxx+pow_r(2,a)) %mod\n if a !=0 and b!=0:\n xxx-=1\n ans = (ans*xxx) % mod\n\n ans = (ans+mod-1+zerozero) % mod \n\n print(ans) \n\n\n \n\n\n\n\n\n\n\nresolve()', 'def resolve():\n K= int(input())\n S = input()\n\n if len(S) <= K:\n print(S)\n else:\n print(S[:K]+"...")\n\n\n\nif __name__ == "__main__":\n resolve()'] | ['Runtime Error', 'Accepted'] | ['s880622903', 's218079615'] | [9284.0, 9160.0] | [25.0, 23.0] | [1924, 169] |
p02676 | u307622233 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 itertools\nimport sys\n\ndef main():\n # n, m, x = map(int, input().split())\n k = int(input())\n s = input()\n print(len(s))\n if len(s) > k:\n s = s[:k] + '...'\n\n print(s)\n\n\nif __name__ == '__main__':\n main()", "import itertools\n k = int(input())\n s = input()\n if len(s) > k:\n s = s[:k] + '...'\n print(s)\n\nif __name__ == '__main__':\n main()\n", "def main():\n k = int(input())\n s = input()\n if len(s) > k:\n s = s[:k] + '...'\n\n print(s)\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s572817096', 's914734029', 's808126402'] | [9176.0, 9004.0, 9156.0] | [23.0, 22.0, 22.0] | [236, 151, 148] |
p02676 | u314837274 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s847869026', 's134146651'] | [9164.0, 9104.0] | [23.0, 20.0] | [71, 77] |
p02676 | u317533286 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nSl = len(S)\nif Sl <= K:\n ans = S\nelse:\n newS = S[0 : Sl - 1]\n ans = (newS + "...")\nprint(ans)', 'K = int(input())\nS = input()\nSl = len(S)\nif Sl <= K:\n ans = S\nelse:\n newS = S[0 : Sl - 1].append("...")\n ans = newS\nprint(ans)\n ', 'K = int(input())\nS = input()\nSl = len(S)\nif Sl <= K:\n ans = S\nelse:\n newS = S[0 : K-1]\n ans = (newS + "...")\nprint(ans)', 'K = int(input())\nS = input()\nSl = len(S)\nif Sl <= K:\n ans = S\nelse:\n newS = S[0 :: K - 1]\n ans = (newS + "...")\nprint(ans)', 'K = int(input())\nS = input()\nSl = len(S)\nif Sl <= K:\n ans = S\nelse:\n newS = S[0 : K]\n ans = (newS + "...")\nprint(ans)'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s213795781', 's765551153', 's819337296', 's951371090', 's701028108'] | [9168.0, 9164.0, 9108.0, 9004.0, 9172.0] | [26.0, 23.0, 23.0, 22.0, 22.0] | [125, 132, 122, 125, 120] |
p02676 | u318427318 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['#-*-coding:utf-8-*-\n\ndef main():\n k = int(input().strip())\n s = input().strip()\n if len(s) <= k:\n print(s)\n else:\n print(s[:k]+"…")\n\nif __name__=="__main__":\n main()', '#-*-coding:utf-8-*-\n\ndef main():\n k = int(input().strip())\n s = input().strip()\n if len(s) <= k:\n print(s)\n elif len(s) > k:\n print(s[:k]+"...")\n\nif __name__=="__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s923144433', 's281190643'] | [9172.0, 9172.0] | [23.0, 25.0] | [196, 207] |
p02676 | u319631723 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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],'...',sep='')"] | ['Wrong Answer', 'Accepted'] | ['s187507994', 's344142731'] | [9160.0, 9164.0] | [25.0, 22.0] | [81, 88] |
p02676 | u320555665 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 k=>len(s):\n print(s)\nelse print(s[for k i in range k+1]+"...")', 'k = int(input())\ns = list(input())\nif k>=len(s):\n print(s)\nelse:\n for i in range (k):\n print(s[i])\n print("...")\n ', 'k = int(input())\ns =input()\nif k>=len(s):\n print(s)\nelse:\n for i in range (k):\n print(s[i],end="")\n print("...")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s636593406', 's761384133', 's333153208'] | [9020.0, 9096.0, 9116.0] | [21.0, 22.0, 21.0] | [103, 131, 128] |
p02676 | u322763702 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 ans = S if len(S) <= K else S[:K + 1] + "..."\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n', 'def main():\n K = int(input())\n S = input()\n ans = S if len(S) <= K else S[:K] + "..."\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s624913943', 's623922703'] | [9172.0, 9172.0] | [21.0, 22.0] | [154, 150] |
p02676 | u325282913 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s883899945', 's901269341'] | [9164.0, 9160.0] | [23.0, 22.0] | [88, 86] |
p02676 | u330799501 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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#a, b = map(int, input().split())\n#l = list(map(int, input().split()))\n#s = input()\n\n\nif len(s) <= k:\n print(s)\nelse:\n s += "..."\n print(s)\n', 'k = int(input())\ns = input()\n#a, b = map(int, input().split())\n#l = list(map(int, input().split()))\n#s = input()\n\n\nif len(s) <= k:\n print(s)\nelse:\n t = s[0:k] + "..."\n print(t)\n'] | ['Wrong Answer', 'Accepted'] | ['s557702930', 's492851318'] | [9156.0, 9148.0] | [32.0, 26.0] | [178, 186] |
p02676 | u332793228 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[0]+"...")', 'k=int(input())\ns=input()\nprint(s if len(s)<=k else s[0:k+1]+"...")', 'k=int(input())\ns=input()\nprint(s if len(s)<=k else s[1:k+1]+"...")', 'k=int(input())\ns=input()\nprint(s if len(s)<=k else s[0:k]+"...")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s022313138', 's779856395', 's959710926', 's243739854'] | [9040.0, 9164.0, 9168.0, 9156.0] | [23.0, 20.0, 22.0, 21.0] | [62, 66, 66, 64] |
p02676 | u333286360 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 S = S[0:K-1]\n S = S+"..."\n \nprint(S)', 'K = int(input())\nS = input()\n\nif K < len(S):\n S = S[0:K]\n S = S+"..."\n \nprint(S)'] | ['Wrong Answer', 'Accepted'] | ['s304613747', 's272775299'] | [9096.0, 9140.0] | [22.0, 21.0] | [85, 83] |
p02676 | u334370828 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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:] + "." * 3)\n', 'K = int(input())\nS = input()\n\nif len(S) <= K:\n print(S)\nelse:\n print(S[0:K] + "." * 3)\n'] | ['Wrong Answer', 'Accepted'] | ['s838284193', 's913470451'] | [9160.0, 9160.0] | [22.0, 24.0] | [92, 93] |
p02676 | u337820403 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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 if len(s)<=k else s[0:k] + "...")a', 'k = int(input())\ns = input()\n\nprint(s if len(s)<=k else s[0:k] + "...")'] | ['Runtime Error', 'Accepted'] | ['s097020682', 's225460245'] | [9024.0, 9088.0] | [21.0, 20.0] | [72, 71] |
p02676 | u338598734 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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\tres = s[0:(k-1)]\n\tres += "..."\n\tprint(res)\n\n', 'k = int(input())\ns = input()\nif len(s) <= k:\n\tprint(s)\nelse:\n\tres = s[1:k]\n\tres += "..."\n\tprint(res)\n\n', 'k = int(input())\ns = input()\nif len(s) <= k:\n\tprint(s)\nelse:\n\tres = s[0:k]\n\tres += "..."\n\tprint(res)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s342633981', 's472106107', 's963843494'] | [9176.0, 9152.0, 9100.0] | [23.0, 23.0, 24.0] | [106, 102, 101] |
p02676 | u338824669 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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'] | ['s176958885', 's252564804'] | [9164.0, 9164.0] | [25.0, 24.0] | [83, 81] |
p02676 | u339654163 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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()\nt=len(list(s))\nprint(t)\nn=""\nif(t<=k):\n print(s)\nelse:\n for i in range(k):\n n=n+s[i]\n n=n+"..."\n print(n)', 'k=int(input())\ns=input()\nt=len(list(s))\n#print(t)\nn=""\nif(t<=k):\n print(s)\nelse:\n for i in range(k):\n n=n+s[i]\n n=n+"..."\n print(n)'] | ['Wrong Answer', 'Accepted'] | ['s660304664', 's375885097'] | [9180.0, 9176.0] | [22.0, 20.0] | [149, 150] |
p02676 | u341610067 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[:k]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s876954281', 's484318931'] | [9160.0, 9164.0] | [21.0, 24.0] | [83, 87] |
p02676 | u343151547 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result. | ['i = int(input())\ns= input()\nif len(s) > k:\n s=s[:k] + "..."\nprint(s)', 'i = int(input())\ns= input()\nif len(s) > i:\n\ts=s[:i] + "..."\nprint(s)'] | ['Runtime Error', 'Accepted'] | ['s417723102', 's410936951'] | [9156.0, 8868.0] | [24.0, 20.0] | [69, 68] |
p02676 | u343523553 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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(list(s))\nif l <=k:\n print(s)\nelse:\n t = s+"..."\n print(t)\n', 'k = int(input())\ns = input()\nn = len(list(s))\nif n <= k:\n print(s)\nelse:\n t = s[:k]+"..."\n print(t)'] | ['Wrong Answer', 'Accepted'] | ['s432505446', 's548716258'] | [9156.0, 9164.0] | [22.0, 25.0] | [104, 108] |
p02676 | u344813796 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[:k])\nelse:\n print(s[:k]+"....")', 'k=int(input()) \ns=str(input()) \n\nif len(s)<=k:\n print(s[:k])\nelse:\n print(s[:k]+"...")'] | ['Wrong Answer', 'Accepted'] | ['s599922079', 's011864346'] | [9164.0, 9164.0] | [25.0, 23.0] | [89, 88] |
p02676 | u344888046 | 2,000 | 1,048,576 | We have a string S consisting of lowercase English letters. If the length of S is at most K, print S without change. 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[:K] + "...")', 'K = int(input())\nS = input()\n \nif K >= len(S):\n print(S)\nelse:\n print(S[:K] + "...")'] | ['Wrong Answer', 'Accepted'] | ['s036288476', 's185544511'] | [9100.0, 9168.0] | [22.0, 22.0] | [85, 86] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.