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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02779 | u971091945 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\na = list(map(int, input().split()))\n\na.sort()\n\nfor i in range(n-1):\n if a[i] == a[i+1]:\n print("No")\n exit(0)\n\nprint("Yes")', 'n = int(input())\na = list(map(int, input().split()))\na_set = set(a)\n\nif len(a) == len(a_set):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s892788058', 's643170179'] | [26808.0, 26808.0] | [182.0, 91.0] | [157, 132] |
p02779 | u971719367 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nintegers = list(map(int,input().split()))\n\ndef has_duplicates(seq):\n if len(seq) != len(set(seq)):\n return 'YES'\n else:\n return 'NO'\n\nprint(has_duplicates(integers))\n", "N = int(input())\nintegers = list(map(int,input().split()))\n\ndef has_duplicates(seq):\n if len(seq) != len(set(seq)):\n return 'NO'\n else:\n return 'YES'\n\nprint(has_duplicates(integers))\n"] | ['Wrong Answer', 'Accepted'] | ['s479652488', 's127183663'] | [25172.0, 25936.0] | [86.0, 91.0] | [203, 203] |
p02779 | u972658925 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | [' print("NO")\n', 'n = int(input())\na = list(map(int,input().split()))\naa = set(a)\nif len(a) == len(aa):\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Accepted'] | ['s453687667', 's470559665'] | [2940.0, 25172.0] | [17.0, 90.0] | [16, 124] |
p02779 | u973055892 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["_list = input()\n\nnum_list = _list.split(' ')\n\nfor num in num_list:\n if num_list.count(num) > 1:\n print('No')\n break\nelse:\n print('Yes') ", "_ = input()\n_list = input()\n\nnum_list = _list.split(' ')\n\nfor num in num_list:\n if num_list.count(num) > 1:\n print('No')\n break\nelse:\n print('Yes') ", "import collections\n\n_ = input()\n_list = input()\n \nnum_list = _list.split(' ')\n \nc = collections.Counter(num_list)\nif c.most_common()[0][1] > 1:\n print('NO')\nelse:\n print('YES')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s393567237', 's479727917', 's117165759'] | [3060.0, 22840.0, 48588.0] | [17.0, 2105.0, 180.0] | [144, 156, 178] |
p02779 | u974292946 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\nA = list(map(int,input().split()))\nprint("Yes") if len(A) == len(set(A)) else print("No")', 'n = int(input())\nA = list(map(int,input().split()))\nprint("YES") if len(A) == len(set(A)) else print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s146885932', 's194295589'] | [25936.0, 26808.0] | [84.0, 83.0] | [106, 106] |
p02779 | u975485663 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = list(map(int, input().split()))\nS = list(set(A))\nif len(A) == len(S):\n return "YES"\nelse:\n return "NO"', 'N = int(input())\nA = list(map(int, input().split()))\nS = list(set(A))\n\nif len(A) == len(S):\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Accepted'] | ['s885487708', 's646666282'] | [2940.0, 25172.0] | [18.0, 94.0] | [125, 126] |
p02779 | u975820355 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = int(input())\nA = [int(e) for e in input().split()]\n\nif length(set(A)) == length(A):\n print("YES")\nelse:\n print("NO")', 'n = int(input())\nA = [int(e) for e in input().split()]\n\nif len(set(A)) == len(A):\n print("YES")\nelse:\n print("NO")\n'] | ['Runtime Error', 'Accepted'] | ['s584717128', 's529984394'] | [25172.0, 25172.0] | [74.0, 91.0] | [122, 117] |
p02779 | u977141657 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n = input()\na_list = list(map(int, input().split()))\na_set = set(a)\n\nif len(a_list) == len(a_set):\n print("YES")\nelse:\n print("NO")', 'n = input()\na_list = list(map(int, input.split()))\na_set = set(a)\n\nif len(a_list) == len(a_set):\n print("YES")\nelse:\n print("NO")', 'n = input()\na_list = list(map(int, input().split()))\na_set = set(a_list)\n\nif len(a_list) == len(a_set):\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s000400432', 's663310455', 's621555160'] | [26808.0, 3060.0, 26808.0] | [68.0, 17.0, 92.0] | [133, 131, 138] |
p02779 | u977193988 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ["N = int(input())\nA = list(map(int,input().split()))\nprint(A)\nif N==len(A):\n print('YES')\nelse:\n print('NO')", "N = int(input())\nA = list(map(int,input().split()))\nA = list(set(A))\nif N==len(A):\n print('YES')\nelse:\n print('NO')"] | ['Wrong Answer', 'Accepted'] | ['s188031261', 's516538537'] | [26804.0, 26808.0] | [87.0, 93.0] | [113, 121] |
p02779 | u977642052 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['def main(n, a):\n if len(set(a)) == n:\n print("YES")\n else:\n print("NO")\n\n\nif __name__ == "__main__":\n n = int(input())\n a = list(map(int, input().split()))\n\n map(n, a)\n', 'def main(n, a):\n if len(set(a)) == n:\n print("YES")\n else:\n print("NO")\n\n\nif __name__ == "__main__":\n n = int(input())\n a = list(map(int, input().split()))\n\n main(n, a)\n'] | ['Wrong Answer', 'Accepted'] | ['s494098183', 's291404007'] | [26808.0, 26808.0] | [87.0, 85.0] | [197, 198] |
p02779 | u977661421 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['# -*- coding: utf-8 -*-\nn = int(input())\na = [int(i) for i in input().split()]\n\n"""\nif len(set(a)) == len(a):\n print("YES")\nelse:\n print("NO")\n"""\n\nflag = True\na.sort()\nfor i in range(n - 1):\n if a[i] == a[i + 1]:\n flag = False\nif flag:\n print("Yes")\nelse:\n print("No")\n', '# -*- coding: utf-8 -*-\nn = int(input())\na = [int(i) for i in input().split()]\n\n"""\nif len(set(a)) == len(a):\n print("YES")\nelse:\n print("NO")\n"""\n\nflag = True\na.sort()\nfor i in range(n - 1):\n if a[i] == a[i + 1]:\n flag = False\nif flag:\n print("Yes")\nelse:\n print("No")\n', '# -*- coding: utf-8 -*-\nn = int(input())\na = [int(i) for i in input().split()] \n\nif len(set(a)) == n:\n print("YES")\nelse:\n print("NO")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s226332664', 's559952434', 's646530884'] | [25168.0, 25936.0, 25168.0] | [186.0, 183.0, 91.0] | [292, 292, 141] |
p02779 | u981931040 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['from collections import Counter\nN = int(input())\nA = Counter(map(int, input().split()))\nA = A.values()\nfor a in A:\n if a != 1:\n print("NO")\n exit()\nprint("Yes")', 'from collections import Counter\nN = int(input())\nA = Counter(map(int, input().split()))\nA = A.values()\nfor a in A:\n if a != 1:\n print("NO")\n exit()\nprint("YES")'] | ['Wrong Answer', 'Accepted'] | ['s817963586', 's141065680'] | [44624.0, 44744.0] | [118.0, 117.0] | [177, 177] |
p02779 | u983109611 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['import collections\nN = int(input())\nA = list(input().split())\nl = collections.Counter(A)\nif len(l) == len(A):\n print("Yes")\nelse:\n print("No")', 'import collections\nN = int(input())\nA = list(input().split())\nl = collections.Counter(A)\nif N == len(l):\n print("Yes")\nelif N != len(l):\n print("No")', 'import collections\nN = int(input())\nA = list(input().split())\nl = collections.Counter(A)\nif N == len(l):\n print("Yes")\nelif N != len(l):\n print("No")', 'import collections\nN = int(input())\nA = list(map(int, input().split()))\nl = collections.Counter(A)\nif N == len(l):\n print("Yes")\nelif N != len(l):\n print("No")', 'import collections\nN = int(input())\nA = list(input().split())\nl = collections.Counter(A)\nif N == len(l):\n print("Yes")\nelif N == len(l):\n print("No")', 'import collections\nN = int(input())\nA = list(map(int, input().split()))\nl = collections.Counter(A)\nif N == len(l):\n print("YES")\nelif N != len(l):\n print("NO")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s010659883', 's074248604', 's487526554', 's731563126', 's838674455', 's135871022'] | [39884.0, 39884.0, 39884.0, 33996.0, 39884.0, 33996.0] | [81.0, 88.0, 86.0, 107.0, 89.0, 104.0] | [148, 155, 155, 165, 155, 165] |
p02779 | u983327168 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n=int(input())\na=list(map(int,input().split()))\nif len(list(set(a)))==len(a):\n print("Yes")\nelse:print("No")\n', 'n=int(input())\na=list(map(int,input().split()))\n\nif len(set(a))==len(a):\n print("Yes")\nelif len(set(a))!=len(a):\n print("No")\n\n', 'n=int(input())\na=list(map(int,input().split()))\nif len(list(set(a)))==n:\n print("Yes")\nelse:print("No")\n\n', 'n=int(input())\na=list(map(int,input().split()))\nif len(list(set(a)))==n:\n print("YES")\nelse:print("NO")\n '] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s372822644', 's483225734', 's935810176', 's792515779'] | [26808.0, 28844.0, 25452.0, 26808.0] | [89.0, 101.0, 91.0, 92.0] | [112, 133, 108, 108] |
p02779 | u989348352 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N = int(input())\nA = [int(i) for i in input().split()]\nf = 0\nA.sort()\nfor i in range(len(A)):\n if A[i] == A[i+1]:\n f = 1\n break\n \nif f > 0:\n print("NO")\nelse:\n print("YES")\n\n', 'N = int(input())\nA = [int(i) for i in input().split()]\nf = 0\nA.sort()\nfor i in range(len(A)):\n # if A.count(i) > 1:\n if A[i] == A[i+1]:\n f = 1\n break\n \nif f > 0:\n print("NO")\nelse:\n print("YES")\n \n', 'N = int(input())\nA = [int(i) for i in input().split()]\nf = 0\nA.sort()\nfor i in range(len(A)):\n if i != len(A)-1:\n if A[i] == A[i+1]:\n f = 1\n break\n \nif f > 0:\n print("NO")\nelse:\n print("YES")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s083389964', 's514340171', 's114437815'] | [25812.0, 25936.0, 25932.0] | [184.0, 185.0, 214.0] | [204, 230, 236] |
p02779 | u990608646 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['\nN = int(input())\nA = list(map(int,input().split()))\n\nA = sorted(A)\n\nfor i in range(len(A)-1):\n if A[i] == A[i+1]:\n print("No")\n exit()\n\nprint("Yes")\n \n \n', '\nN = int(input())\nA = list(map(int,input().split()))\n\nA = sorted(A)\n\nfor i in range(len(A)-1):\n if A[i] == A[i+1]:\n print("NO")\n exit()\n\nprint("YES")\n '] | ['Wrong Answer', 'Accepted'] | ['s896983337', 's628422031'] | [26808.0, 26808.0] | [190.0, 189.0] | [177, 171] |
p02779 | u994527877 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['s = input()\na = map(int, input().lower().split())\n\nif int(s) == len(set(a)):\n print("YESS")\nelse:\n print("NO")\n', 's = input()\na = map(int, input().lower().split())\n \nif int(s) == len(set(a)):\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s504153087', 's006766005'] | [36944.0, 37840.0] | [91.0, 91.0] | [113, 112] |
p02779 | u995109095 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n=int(input())\nl=list(map(int,input().split()))\nf=1\nfor i in range(n-1):\n\tif l[i]==l[i+1]:\n f=0\n break\nif f:\n\tprint("YES")\nelse:\n\tprint("NO")', 'n=int(input())\nl=list(map(int,input().split()))\nf=1\nfor i in range(n-1):\n\tif l[i]==l[i+1]:\n f=0\n break\nif f:\n\tprint("YES")\nelse:\n\tprint("NO")\n', 'n=int(input())\nl=list(map(int,input().split()))\nif len(set(l))==n:\n print("YES")\nelse:\n print("NO")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s359521959', 's421609278', 's630558699'] | [2940.0, 2940.0, 25324.0] | [17.0, 16.0, 83.0] | [151, 156, 105] |
p02779 | u995419623 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['s=input()\nt=list(map(int,input().split()))\nu=len(t)\nv=len(set(t))\n\nif u == v:\n print("Yes")\nelse:\n print("No")', 's=input()\nt=list(map(int,input().split()))\nu=len(t)\nv=len(set(t))\n\nif u == v:\n print("YES")\nelse:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s047127577', 's432221222'] | [26808.0, 26808.0] | [89.0, 86.0] | [112, 112] |
p02779 | u996434204 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['n=int(input())\na=[int(x) for x in input().split()]\n\nif len(a) != set(a):\n print("NO")\nelse:\n print("YES")\n', 'n=int(input())\na=[int(x) for x in input().split()]\n\nif len(a) != len(set(a)):\n print("NO")\nelse:\n print("YES")\n'] | ['Wrong Answer', 'Accepted'] | ['s435738493', 's918577432'] | [25168.0, 25172.0] | [93.0, 90.0] | [112, 117] |
p02779 | u996731299 | 2,000 | 1,048,576 | Given is a sequence of integers A_1, A_2, ..., A_N. If its elements are pairwise distinct, print `YES`; otherwise, print `NO`. | ['N=int(input())\nnum=list(map(int,input().split()))\n#print(num)\nnum.sort()\nans=0\nfor i in range(N-1):\n if num[i]==num[i+1]:\n ans=1\n break\nif ans==0:\n print("Yes")\nif ans==1:\n print("No")', 'N=int(input())\nnum=list(map(int,input().split()))\n#print(num)\nnum.sort()\nans=0\nfor i in range(N-1):\n if num[i]==num[i+1]:\n ans=1\n break\nif ans==0:\n print("YES")\nif ans==1:\n print("NO")'] | ['Wrong Answer', 'Accepted'] | ['s155018387', 's575073203'] | [25172.0, 25172.0] | [178.0, 182.0] | [207, 207] |
p02780 | u045235021 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['s =0\n\nprint(n,a)\n\nfor f in range(n):\n \n for g in range(n):\n\n if g != f:\n \tif a[f] == a[g]:\n \t\t#print(a[f], a[g])\n \t\ts = s+1\n \nif s>0: print("NO")\nelse: print(\'YES\')', "import math\n\nn,k = input().split()\np = input().split()\n\nn = int(n)\nk = int(k)\n#p = [int(s) for s in p]\n\n#print(p)\n\nex =0\next = []\next2 = []\nfor f in range(n):\n pi = int(p[f])\n xs =(pi+1)/2\n ext.append(xs)\n\next2.append(ext[0])\nfor i in range(1,n):\n ext2.append(ext2[i-1]+ext[i])\n\nex = ext2[k-1]\nfor j in range(1,n-k+1):\n ext3 =ext2[j+k-1]-ext2[j-1]\n if ext3 > ex: ex = ext3\n\nprint('{:.12f}'.format(ex))"] | ['Runtime Error', 'Accepted'] | ['s018867463', 's257272842'] | [2940.0, 30052.0] | [17.0, 252.0] | [187, 419] |
p02780 | u057993957 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['n, k = list(map(int, input().split()))\np = list(map(int, input().split()))\n\nem = 0\nexp = []\nfor i in range(n-k+1):\n temp = sum(p[i:i+k])\n if em <= temp:\n em = temp\n exp = p[i:i+k]\n\n \nprint(sum([(pi + 1) / 2 for pi in exp]))', 'import numpy as np\nn, k = list(map(int, input().split()))\ndice = list(map(int, input().split()))\nsort_dice = sorted(dice, reverse=True)[:k]\n\nsort_p = 1. / np.array(sort_dice)\nsort = np.array([sum([j+1 for j in range(i)]) for i in sort_dice])\nprint(np.sum(sort_p * sort))', 'n, k = list(map(int, input().split()))\np = list(map(int, input().split()))\n\nexpect = [(pi+1) / 2 for pi in p]\n\nem = 0\nfor i in range(n-k+1):\n em = max(em, sum(expect[i:i+k]))\n\nprint(em)', 'n, k = list(map(int, input().split()))\np = list(map(int, input().split()))\nexp = [sum([(pi + 1) / 2 for pi in p[i:i+k]]) for i in range(n-k+1)]\nprint(max(exp))', 'n, k = list(map(int, input().split()))\np = list(map(int, input().split()))\n\ndef expect(p):\n return (p + 1) / 2\n\nl = [0 for i in range(n+1)]\nfor i in range(1, n+1):\n l[i] = expect(p[i-1]) + l[i-1]\n\nans = 0\nfor i in range(k, n+1):\n ans = max(ans, l[i] - l[i-k])\nprint("{:.12f}".format(ans))'] | ['Time Limit Exceeded', 'Wrong Answer', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s002378447', 's562521719', 's907163641', 's951799845', 's444496749'] | [24804.0, 33940.0, 25060.0, 24812.0, 25060.0] | [2104.0, 2109.0, 2105.0, 2104.0, 220.0] | [234, 270, 186, 159, 291] |
p02780 | u096983897 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["N, K = map(int, input().split())\np = list(map(int, input().split()))\n \nnow = sum(p[:K])\nsaidai = now\nfor i in range(K, N):\n now -= p[i-K]\n now += p[i+K]\n if now > saidai:\n saidai = now\n\nprint('{:.12f}'.format((saidai + K)/2))", "N, K = map(int, input().split())\np = list(map(int, input().split()))\n \nnow = sum(p[:K])\nsaidai = now\nfor i in range(K, N):\n now -= p[i-K]\n now += p[i]\n if now > saidai:\n saidai = now\n \nprint('{:.12f}'.format((saidai + K)/2))"] | ['Runtime Error', 'Accepted'] | ['s168570859', 's602841340'] | [25060.0, 24940.0] | [132.0, 127.0] | [231, 230] |
p02780 | u132687480 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['\ndef Main(N, K, P):\n wa = sum(P[:K])\n max_sum = wa\n max_sum_ind = 0\n for i in range(N-K-1):\n wa = wa - P[i] + P[i+K]\n if(wa > max_sum):\n max_sum = wa\n max_sum_ind = i\n ans = 0\n for i in range(max_sum_ind+1, max_sum_ind+K+1):\n ans += (P[i]+1)/2\n return ans\n\ndef main():\n N, K = map(int, input().split())\n P = list(map(int, input().split()))\n print("{:.12f}".format(Main(N, K, P)))\n\nif __name__ == \'__main__\':\n main()', '\ndef Main(N, K, P):\n wa = sum(P[:K])\n max_sum = wa\n max_sum_ind = 0\n for i in range(N-K):\n wa = wa - P[i] + P[i+K]\n if(wa > max_sum):\n max_sum = wa\n max_sum_ind = i\n ans = 0\n if max_sum_ind == 0:\n for i in range(K):\n ans += (P[i]+1)/2\n else:\n for i in range(max_sum_ind+1, max_sum_ind+K+1):\n ans += (P[i]+1)/2\n return ans\n\ndef main():\n N, K = map(int, input().split())\n P = list(map(int, input().split()))\n print("{:.12f}".format(Main(N, K, P)))\n\nif __name__ == \'__main__\':\n main()'] | ['Runtime Error', 'Accepted'] | ['s232845484', 's547550067'] | [25060.0, 25056.0] | [91.0, 92.0] | [491, 589] |
p02780 | u169702930 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['n,k = map(int, input().split())\np = list(map(int, input().split()))\nfor i in range(n):\n p[i] = (p[i] + 1)/2\nans = 0\ntmp = 0\nfor i in range(k):\n tmp += p[i]\nfor i in range(1,n - k + 1):\n tmp = tmp - p[i - 1] + p[i + k - 1]\n if ans < tmp:\n ans = tmp\nprint("{:.10f}".format(ans))\n', 'n,k = map(int, input().split())\np = list(map(int, input().split()))\nfor i in range(n):\n p[i] = (p[i] + 1)/2\nans = 0\ntmp = 0\nfor i in range(k):\n tmp += p[i]\n ans += p[i]\nfor i in range(1,n - k + 1):\n tmp = tmp - p[i - 1] + p[i + k - 1]\n if ans < tmp:\n ans = tmp\nprint("{:.12f}".format(ans))\n'] | ['Wrong Answer', 'Accepted'] | ['s935846782', 's709776300'] | [25060.0, 25604.0] | [173.0, 171.0] | [296, 312] |
p02780 | u185037583 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["n, k = map(int, input().split())\np = [(int(i)+1.0)/2.0 for i in input().split()]\nans = 0\ntmp = p[:k]\nfor i in range(k,n):\n tmp += p[i]-p[i-k]\n ans = max(ans, tmp)\nprint('{:.12f}'.format(ans))\n", "n, k = map(int, input().split())\np = [(int(i)+1.0)/2.0 for i in input().split()]\nans = tmp = 0\nfor i in range(n-k):\n tmp += p[i]-p[i+k]\n ans = max(ans, tmp)\nprint('{:.12f}'.format(ans))\n", "n, k = map(int, input().split())\np = [(int(i)+1.0)/2.0 for i in input().split()]\nans = tmp = sum(p[:k])\nfor i in range(k,n):\n tmp += p[i]-p[i-k]\n ans = max(ans, tmp)\nprint('{:.12f}'.format(ans))\n"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s580508714', 's747570062', 's655600418'] | [23524.0, 23524.0, 23524.0] | [109.0, 207.0, 192.0] | [198, 192, 201] |
p02780 | u240768672 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['N=2*10**5+7\nn,k=map(int,input().split())\nList=list(map(float,input().split()))\nfor i in range(n):\n List[i]=(1+List[i])/2\nfor i in range(1,n):\n List[i]+=List[i-1]\nans=0.0\nfor i in range(0,n-k+1):\n ans=max(ans,List[i+k-1]-List[max(0,i-1)])\nprint(ans)\n', 'N=2*10**5+7\nn,k=map(int,input().split())\nList=list(map(float,input().split()))\nfor i in range(n):\n List[i]=(1+List[i])/2\nfor i in range(1,n):\n List[i]+=List[i-1]\nans=0.0\nfor i in range(0,n-k+1):\n #ans=max(ans,List[i+k-1]-List[max(0,i-1)])\n if i==0 :\n ans=max(ans,List[i+k-1])\n else :\n ans=max(ans,List[i+k-1]-List[i-1])\nprint("{:.12f}".format(ans))\n'] | ['Wrong Answer', 'Accepted'] | ['s921588745', 's734897616'] | [23524.0, 23524.0] | [292.0, 300.0] | [258, 378] |
p02780 | u285022453 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["import sys\n\ninput = sys.stdin.readline\nn, k = map(int, input().split())\n\np = list(map(lambda x: (x + 1) / 2, map(int, input().split())))\n\n# 1 - pi\nans = k\ninit = p[0]\nfor i in range(k, len(p)):\n print(i)\n if init < p[i]:\n init = p[i]\n ans = i\n\nexp = 0\nfor i in range(ans - k + 1, ans + 1):\n exp += p[i]\nprint('{:.12f}'.format(exp))\n", "import sys\nimport numpy as np\n\ninput = sys.stdin.readline\nn, k = map(int, input().split())\n\np = list(map(lambda x: (x + 1) / 2, map(int, input().split())))\n# 1 - pi\n# print(p)\np_cumsum = np.cumsum(p)\n# print(p_cumsum)\nans = p_cumsum[k-1]\n\nfor i in range(0, n - k):\n \n cum = p_cumsum[i + k] - p_cumsum[i]\n ans = max(ans, cum)\n\n\nprint('{:.12f}'.format(ans))"] | ['Runtime Error', 'Accepted'] | ['s306854718', 's923712700'] | [22868.0, 32224.0] | [255.0, 426.0] | [355, 381] |
p02780 | u334175843 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["import bisect,collections,copy,heapq,itertools,math,numpy,string,scipy\nimport sys\nsys.setrecursionlimit(10**7)\n\ndef S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n\ndef main():\n N,K = LI()\n P = LI()\n \n \n \n print((numpy.max(scipy.convolve(P,numpy.ones(K,dtype='float'), mode='valid')/scipy.convolve(numpy.ones(len(P)),numpy.ones(K),mode='valid'))+1)*(K/2))\n \nmain()\n\n", 'import bisect,collections,copy,heapq,itertools,math,numpy,string,scipy\nimport sys\nsys.setrecursionlimit(10**7)\n\ndef S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n\ndef main():\n N,K = LI()\n P = LI()\n Pe = [(v+1)/2 for v in P]\n P_ms = numpy.cumsum(Pe)\n ans = 0\n for i in range(K,N):\n ans = max(ans,P_ms[i]-P_ms[i-K])\n print(ans)\nmain()\n\n', 'import bisect,collections,copy,heapq,itertools,math,numpy,string\nimport sys\nsys.setrecursionlimit(10**7)\n\ndef S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n\ndef main():\n N,K = LI()\n P = LI()\n \n \n \n print((numpy.max(numpy.convolve(P,numpy.ones(K)/K,mode="valid"))+1)*(K/2))\n\nmain()\n\n', 'import bisect,collections,copy,heapq,itertools,math,numpy,string\nimport sys\nsys.setrecursionlimit(10**7)\n\ndef S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n\ndef main():\n N,K = LI()\n P = LI()\n Pk_max_idx = numpy.argmax([sum(P[i:i+K]) for i in range(len(P))])\n print((sum(P[Pk_max_idx:Pk_max_idx+K])+K)/2)\n\nmain()\n\n', 'import bisect,collections,copy,heapq,itertools,math,numpy,string\nimport sys\nsys.setrecursionlimit(10**7)\n\ndef S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n\ndef main():\n N,K = LI()\n P = LI()\n Pk_max_idx = numpy.argmax(numpy.convolve(P,numpy.ones(K)/K,mode="valid"))\n print((sum(P[Pk_max_idx:Pk_max_idx+K])+K)/2)\n\nmain()\n\n', 'import bisect,collections,copy,heapq,itertools,math,numpy,string,scipy\nimport sys\nsys.setrecursionlimit(10**7)\n\ndef S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n\ndef main():\n N,K = LI()\n P = LI()\n Pe = [(v+1)/2 for v in P]\n P_ms = numpy.cumsum(Pe)\n ans = 0\n for i in range(K,N):\n ans = max(ans,P_ms[i]-P_ms[i-K])\n print("{:f}".format(ans))\nmain()\n\n', 'import bisect,collections,copy,heapq,itertools,math,numpy,string,scipy\nimport sys\nsys.setrecursionlimit(10**7)\n\ndef S(): return sys.stdin.readline().rstrip()\ndef I(): return int(sys.stdin.readline().rstrip())\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\ndef LS(): return list(sys.stdin.readline().rstrip().split())\n\n\ndef main():\n N,K = LI()\n P = LI()\n Pe = [(v+1)/2 for v in P]\n P_ms = numpy.cumsum(Pe)\n if K==N:print("{:.12f}".format(sum(Pe)));exit(0)\n ans = 0\n for i in range(K,N):\n ans = max(ans,P_ms[i]-P_ms[i-K])\n print("{:.12f}".format(ans))\nmain()\n\n'] | ['Time Limit Exceeded', 'Wrong Answer', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Wrong Answer', 'Accepted'] | ['s262265027', 's357602279', 's365939565', 's792752525', 's870411368', 's932190990', 's297910404'] | [54820.0, 54672.0, 51176.0, 50872.0, 50872.0, 54780.0, 54872.0] | [2207.0, 281.0, 2207.0, 2206.0, 2207.0, 283.0, 282.0] | [843, 541, 682, 504, 512, 556, 612] |
p02780 | u363995337 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["N, K = map(int, input().split())\np = list(map(int, input().split()))\np_sum = [0]\nmax = 0\n\nfor i in range(len(p)):\n p_sum.append(p_sum[i] + (p[i]+1)/2) \nprint(p_sum)\n\nfor i in range(K,N+1):\n sum = p_sum[i] - p_sum[i-K]\n print(sum)\n if(max < sum):\n max = sum\nprint('{:.12f}'.format(max))\n", 'N, K = map(int, input().split())\np = list(map(int, input().split()))\np_sum = [0]\nmax = 0\n\nfor i in range(len(p)):\n p_sum.append(p_sum[i] + (p[i]+1)/2) \n\nfor i in range(K,N+1):\n sum = p_sum[i] - p_sum[i-K]\n if(max < sum):\n max = sum\n\n# tmp = p[i]\n# # print("i:" + str(i))\n# for j in range(i+1,i+K):\n# tmp += p[j]\n\n# # print(tmp)\n# if(max < tmp):\n# max = tmp \n# maxStartIndex = i\n# ans = 0\n\n\n# ans += sum/p[i]\nprint(\'{:.12f}\'.format(max))\n# 1 2 3 \n# 3 2 1\n\n\n# n, n-1, n-2\n# n(n + 1)/2 '] | ['Wrong Answer', 'Accepted'] | ['s399894966', 's422542159'] | [25636.0, 25060.0] | [464.0, 173.0] | [305, 651] |
p02780 | u382639013 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['import numpy\nN, K = map(int, input().split())\np = list(map(int, input().split()))\n\nlis = list()\n\np = [(i + 1)/2 for i in p ]\n\ncumSum = numpy.cumsum(p)\n\ncumSum2 = list(cumSum)\n\ncumSum2.insert(0,0)\n\nfor i in range(0, N-K+1):\n lis.append(cumSum2[K+i] - cumSum2[i])\n\nprint(int(max(lis)))', "import numpy\nN, K = map(int, input().split())\np = list(map(int, input().split()))\n\nlis = list()\n\np = [(i + 1)/2 for i in p ]\n\ncumSum = numpy.cumsum(p)\n\ncumSum2 = list(cumSum)\n\ncumSum2.insert(0,0)\n\nfor i in range(0, N-K+1):\n print(i)\n lis.append(cumSum2[K+i] - cumSum2[i])\n\nprint('{:.08f}'.format(max(lis)))", "import numpy\nN, K = map(int, input().split())\np = list(map(int, input().split()))\n\nlis = list()\n\np = [(i + 1)/2 for i in p ]\n\ncumSum = numpy.cumsum(p)\n\ncumSum2 = list(cumSum)\n\ncumSum2.insert(0,0)\n\nfor i in range(0, N-K+1):\n lis.append(cumSum2[K+i] - cumSum2[i])\n\nprint('{:.18f}'.format(int(max(lis))))", 'import numpy\nN, K = map(int, input().split())\np = list(map(int, input().split()))\n\nlis = list()\n\np = [(i + 1)/2 for i in p ]\n\ncumSum = numpy.cumsum(p)\n\ncumSum2 = list(cumSum)\n\ncumSum2.insert(0,0)\n\nfor i in range(0, N-K+1):\n print(i)\n lis.append(cumSum2[K+i] - cumSum2[i])\n\nprint(max(lis))', "import numpy\nN, K = map(int, input().split())\np = list(map(int, input().split()))\n\nlis = list()\n\np = [(i + 1)/2 for i in p ]\n\ncumSum = numpy.cumsum(p)\n\ncumSum2 = list(cumSum)\n\ncumSum2.insert(0,0)\n\nfor i in range(0, N-K+1):\n lis.append(cumSum2[K+i] - cumSum2[i])\n\nprint('{:.08f}'.format(int(max(lis))))", "import numpy\nN, K = map(int, input().split())\np = list(map(int, input().split()))\n\nlis = list()\n\np = [(i + 1)/2 for i in p ]\nnumpy.set_printoptions(precision=16)\n\ncumSum = numpy.cumsum(p)\n\nprint(p)\ncumSum2 = list(cumSum)\n\ncumSum2.insert(0,0)\n\nfor i in range(0, N-K+1):\n lis.append(cumSum2[K+i] - cumSum2[i])\n\nprint('{:.12f}'.format(max(lis)))", "import numpy\nN, K = map(int, input().split())\np = list(map(int, input().split()))\n\nlis = list()\n\np = [(i + 1)/2 for i in p ]\nnumpy.set_printoptions(precision=16)\n\ncumSum = numpy.cumsum(p)\n\ncumSum2 = list(cumSum)\n\ncumSum2.insert(0,0)\n\nfor i in range(0, N-K+1):\n lis.append(cumSum2[K+i] - cumSum2[i])\n\nprint('{:.12f}'.format(max(lis)))"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s198300285', 's205532079', 's506322676', 's631666768', 's725980041', 's822643329', 's521372078'] | [36784.0, 38116.0, 36816.0, 38136.0, 36780.0, 38188.0, 36776.0] | [354.0, 494.0, 352.0, 529.0, 347.0, 411.0, 361.0] | [286, 312, 304, 294, 304, 345, 336] |
p02780 | u385309449 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["n,k=map(int,input().split())\np=list(map(int,input().split()))\nl=sum([p[i] for i in range(k)])\nans=0\nfor i in range(n-k):\n l-=p[i]\n l+=p[i+k]\n ans=max(l,ans)\nprint('{:.7f}'.format((ans+k)/2))", "n,k=map(int,input().split())\np=list(map(int,input().split()))\nl=sum([p[i] for i in range(k)])\nif n==k:\n ans=l\nelse:\n ans=0\nfor i in range(n-k):\n l-=p[i]\n l+=p[i+k]\n ans=max(l,ans)\nprint('{:.12f}'.format((ans+k)/2))"] | ['Wrong Answer', 'Accepted'] | ['s499476976', 's326129350'] | [24812.0, 24804.0] | [190.0, 157.0] | [193, 219] |
p02780 | u736848749 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["N,K = map(int,input().split())\np = list(map(int,input().split()))\n\nexpectation=[]\nE = []\n\n\nfor t in p:\n value = 0\n for x in range(t+1):\n value += x/t\n E.append(value)\nprint(E)\n\nfor t in range(N-(K-1)):\n value = 0\n for i in range(K):\n value += E[t+i]\n expectation.append(value)\n\noutput = sorted(expectation,reverse=True)\nprint(format(output[0],'.12f')) \n", "N,K = map(int,input().split())\np = list(map(int,input().split()))\n\nE = []\nvalue=0\n\nfor P_i in p:\n value += (1+P_i)/2\n E.append(value)\n\nflag = E[K-1]\n\nfor k in range(K,N):\n S = E[k] - E[k-K]\n if flag < S:\n flag = S\nprint(format(flag,'.12f'))"] | ['Wrong Answer', 'Accepted'] | ['s971215124', 's550128626'] | [25060.0, 24812.0] | [2104.0, 153.0] | [395, 323] |
p02780 | u806403461 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['N, K = map(int, input().split())\np = list(map(int, input().split()))\n\nexv = list()\n\nfor a in p:\n exv.append((1+a)/2)\n\n', "N, K = map(int, input().split())\np = list(map(int, input().split()))\n\nfrom collections import deque\n\nexv = list()\n\nfor a in p:\n exv.append((1+a)/2)\n\nsm = 0\nmx = 0\n\nq = deque()\n\nfor a in range(N):\n sm += exv[a]\n q.appendleft(exv[a])\n if len(q) > K:\n sm -= q.pop()\n if len(q) == K:\n mx = max(mx,sm)\n\nprint('{:.12f}'.format(mx))"] | ['Wrong Answer', 'Accepted'] | ['s883171767', 's173614542'] | [25060.0, 24808.0] | [93.0, 277.0] | [121, 354] |
p02780 | u825541307 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ["N,K = map(int,input().split())\n\ndef exp(n):\n if n % 2 == 0:\n s = (n+1)*n/2\n else:\n s = (n+1)*(n-1)/2+(n+1)/2\n ans = s / n\n return ans\n\np = list(map(int,input().split()))\n\nM = 0\nfor i in range(N-K+1):\n S = float(0)\n for j in range(K):\n S += exp(p[i+j]) \n print(S) \n if M < S:\n M = S\n\nprint('{:.12f}'.format(M))", "N,K = map(int,input().split())\np = list(map(int,input().split()))\n\ndef exp(n):\n if n % 2 == 0:\n s = (n+1)*n/2\n else:\n s = (n+1)*(n-1)/2+(n+1)/2\n ans = s / n\n return ans\n\nq = []\nfor i in range(N):\n q.append(exp(p[i]))\n#print(q)\n\nS = sum([q[i] for i in range(K)])\nM = S\n#print(M)\n\nfor i in range(N-K):\n S = S - q[i] + q[K+i]\n #print(S)\n if S > M:\n M = S\n\nprint('{:.12f}'.format(M))"] | ['Wrong Answer', 'Accepted'] | ['s323344624', 's580759745'] | [25060.0, 25056.0] | [2104.0, 237.0] | [367, 424] |
p02780 | u839954363 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['query=[int(x) for x in input().split()]\nN = query[0]\nK = query[1]\nL = list()\nL = [int(x) for x in input().split()]\n\n\n\ndef prob(x):\n out = 0.0\n for i in range(1, x + 1):\n out = out + (1 / x) * i\n\n return out\n\n\nfinal = 0.0\nanswer=list()\nfor i in range(0, N):\n final=0.0\n for j in range(i, K+i):\n if K+i<N:\n div = L[j]\n final = final + prob(div)\n answer.append(final)\n\nprint("%14.12f"%max(answer))', 'query=[int(x) for x in input().split()]\nN = query[0]\nK = query[1]\nL = list()\nL = [int(x) for x in input().split()]\n\n\n\ndef prob(x):\n out = 0.0\n\n out = (1 / x) * (x*(x+1))/2\n\n return out\n\n\nfinal = 0.0\nanswer=list()\nfor i in range(0, N):\n final=0.0\n for j in range(i, K+i):\n if K+i<=N:\n div = L[j]\n final = final + prob(div)\n answer.append(final)\nprint(answer)\nprint("%14.12f"%max(answer))', 'query=[int(x) for x in input().split()]\nN = query[0]\nK = query[1]\nL = list()\nL = [int(x) for x in input().split()]\n\n\n\ndef prob(x):\n out = 0.0\n\n out = (x+1)/2\n\n return out\n\n\n# final = 0.0\n# answer=list()\n\n# final=0.0\n# for j in range(i, K+i):\n# if K+i<=N:\n# div = L[j]\n# final = final + prob(div)\n# answer.append(final)\n#\n# print("%14.12f"%max(answer))\n\n\nres=0.0\ntres=0.0\nfor i in range(0,K):\n tres+=prob(L[i])\n res=max(res,tres)\nrindex=K\nlindex=0\nwhile rindex<N:\n tres=tres-prob(L[lindex])+prob(L[rindex])\n rindex+=1\n res=max(res,tres)\n lindex+=1\nprint("%14.12f"%res)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s735951263', 's777766641', 's824195944'] | [25376.0, 24676.0, 24684.0] | [2104.0, 2104.0, 248.0] | [448, 433, 661] |
p02780 | u952773501 | 2,000 | 1,048,576 | We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown. We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum. | ['\nn, k = map(int, input().split())\np = list(map(int, input().split()))\n\ne = [(i+1)/2 for i in p]\n\nsume = [0 for _ in range(n)]\nfor i in range(n):\n if i == 0:\n sume[i] = e[i]\n else:\n sume[i] = sume[i-1]+e[i]\n\nans = []\nfor i in range(n-k+1):\n if i == 0:\n ans.append(sume[i])\n else:\n ans.append(sume[i+k-1]-sume[i-1]) \n\nprint(max(ans))\n ', 'n, k = map(int, input().split())\np = list(map(int, input().split()))\n\ne = [(i+1)/2 for i in p]\n\nsume = [0 for _ in range(n)]\nfor i in range(n):\n if i == 0:\n sume[i] = e[i]\n else:\n sume[i] = sume[i-1]+e[i]\n\nans = []\nfor i in range(n-k):\n ans.append(sume[i+k]-sume[i]) \n \nprint(max(ans))\n ', '\nn, k = map(int, input().split())\np = list(map(int, input().split()))\n\ne = [(i+1)/2 for i in p]\n\nsume = [0 for _ in range(n)]\nfor i in range(n):\n if i == 0:\n sume[i] = e[i]\n else:\n sume[i] = sume[i-1]+e[i]\n\nans = []\n\nif n == k:\n ans.append(sume[-1])\nelse:\n for i in range(n-k):\n ans.append(sume[i+k]-sume[i])\n\nprint("%.12f"%max(ans))\n '] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s482143329', 's765419536', 's019176779'] | [28224.0, 28228.0, 28228.0] | [221.0, 200.0, 202.0] | [378, 319, 371] |
p02781 | u002539468 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = input()\nK = int(input())\nL = len(N)\n\ndp0 = [[0] * (K + 1) for _ in range(L + 1)]\ndp1 = [[0] * (K + 1) for _ in range(L + 1)]\n\ndp0[0][0] = 1\n\nn = []\nfor i in N:\n n.append(int(i))\n\nfor i in range(L):\n D = n[i]\n for j in range(K + 1):\n if D == 0:\n dp0[i + 1][j] += dp0[i][j]\n dp1[i + 1][j] += dp1[i][j]\n if j < K:\n dp1[i + 1][j + 1] = dp1[i][j] * 9\n else:\n dp1[i + 1][j] += (dp0[i][j] + dp1[i][j])\n if j < K:\n dp0[i + 1][j + 1] += dp0[i][j]\n dp1[i + 1][j + 1] += (D - 1) * dp0[i][j]\n dp1[i + 1][j + 1] += 9 * dp1[i][j]\n\nprint(dp0)\nprint(dp1)\nprint(dp0[L][K] + dp1[L][K])', 'N = input()\nK = int(input())\nL = len(N)\n\ndp0 = [[0] * (K + 1) for _ in range(L + 1)]\ndp1 = [[0] * (K + 1) for _ in range(L + 1)]\n\ndp0[0][0] = 1\n\nn = []\nfor i in N:\n n.append(int(i))\n\nfor i in range(L):\n D = n[i]\n for j in range(K + 1):\n if D == 0:\n dp0[i + 1][j] += dp0[i][j]\n dp1[i + 1][j] += dp1[i][j]\n if j < K:\n dp1[i + 1][j + 1] = dp1[i][j] * 9\n else:\n dp1[i + 1][j] += (dp0[i][j] + dp1[i][j])\n if j < K:\n dp0[i + 1][j + 1] += dp0[i][j]\n dp1[i + 1][j + 1] += (D - 1) * dp0[i][j]\n dp1[i + 1][j + 1] += 9 * dp1[i][j]\n\nprint(dp0[L][K] + dp1[L][K])'] | ['Wrong Answer', 'Accepted'] | ['s953195185', 's377992646'] | [3064.0, 3064.0] | [21.0, 18.0] | [709, 687] |
p02781 | u003475507 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['s = input()\nK = int(input())\nn =len(s)\n\ndp = [[[0] * 2 for _ in range(4)] for _ in range(101)]\n\ndp[0][0][0]=1\nfor i in range(n):\n for j in range(4):\n for k in range(2):\n nd = int(s[i])\n\n for d in range(10):\n ni = i+1; nj = j; nk = k\n\n if d != 0 :nj+=1\n if nj > K:continue\n if k==0:\n if d > nd:continue\n if d < nd:nk =1\n dp[ni][nj][nk] += dp[i][j][k]\n print(d,k)\n print(i,j,k,dp[i][j][k])\n print(ni,nj,nk,dp[ni][nj][nk])\n [print(i) for i in dp]\n\nans=dp[n][K][0] + dp[n][K][1]\nprint(ans)\n[print(i) for i in dp]', 's=input()\nn=len(s)\n\nK=int(input())\n\ndp=[[[0] * 5 for _ in range(2)] for _ in range(n+1)]\ndp[0][0][0]=1\n\nfor i in range(n):\n ni= int(s[i])\n\n for k in range(4):\n \n dp[i + 1][1][k + 1] += dp[i][1][k] * 9; \n dp[i + 1][1][k] += dp[i][1][k]; \n\n \n \n \n if (ni > 0):\n dp[i + 1][1][k + 1] += dp[i][0][k] * (ni - 1)\n dp[i + 1][1][k] += dp[i][0][k]\n \n \n if (ni > 0) :\n dp[i + 1][0][k + 1] = dp[i][0][k]\n else:\n dp[i + 1][0][k] = dp[i][0][k]\n\nans=dp[n][0][K] + dp[n][1][K]\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s219363133', 's245698873'] | [26740.0, 3064.0] | [1471.0, 18.0] | [713, 956] |
p02781 | u023958502 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from scipy.misc import comb\nN = int(input())\nK = int(input())\nn = len(str(N))\nans = comb(n - 1, K) * 9 ** K\nfor i in range(K):\n ans += comb(n - 1 - i, K - 1 - i) * 9 ** (K - 1 - i) * (int(str(N)[i]) - 1)\n ans += comb(n - 1 - i, K - 2 - i) * 9 ** (K - 1 - i) * (int(str(N)[i + 1]) - 1)\n\n \nprint(ans + 1)', 'def comb(a, b):\n ans = 1\n for i in range(b):\n ans *= (a - i)\n for i in range(2, b + 1):\n ans //= i\n return ans\n\ndef solve_k1(N):\n ans = 0\n N = str(N)\n len_N = len(N)\n ans += 9 * (len_N - 1)\n ans += int(N[0])\n return ans\n\ndef solve_k2(N):\n ans = 0\n N = str(N)\n len_N = len(N)\n if len_N < 2:\n return 0\n ans = comb((len_N - 1), 2) * 9 ** 2 + (int(N[0]) - 1) * ((len_N - 1) * 9) + solve_k1(int(N[1:]))\n return ans\n\ndef solve_k3(N):\n ans = 0\n N = str(N)\n len_N = len(N)\n if len_N < 3:\n return 0\n ans = comb(len_N - 1, 3) * 9 ** 3 + (int(N[0]) - 1) * comb(len_N - 1, 2) * 9 ** 2 + solve_k2(int(N[1:]))\n return ans\n\nN = int(input())\nK = int(input())\nans = 0\nif K == 1:\n ans = solve_k1(N)\nelif K == 2:\n ans = solve_k2(N)\nelse:\n ans = solve_k3(N)\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s650588851', 's293942561'] | [16816.0, 3064.0] | [179.0, 17.0] | [308, 851] |
p02781 | u064963667 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["import math\n\nn = int(input())\nk = int(input())\n\ndef combinations_count(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\ndef count(num_str,k):\n digits = len(num_str)\n if digits == 0:\n return 0\n else:\n if k == 0:\n print(num_str,1)\n return 1\n if num_str[0] == '0':\n print(num_str,count(num_str[1:],k-1))\n return count(num_str[1:],k-1)\n else:\n if digits == 1 and k == 1:\n print(num_str,int(num_str))\n return int(num_str)\n elif digits == 1 and k > 1:\n print(num_str,0)\n return 0\n if digits >= k+1:\n count_0 = combinations_count(digits-1,k)*(9**k)\n else:\n count_0 = 0\n count_1 = combinations_count(digits-1,k-1)*(9**(k-1))\n print(num_str,count_0 + count_1*(int(num_str[0])-1)+count(num_str[1:],k-1))\n return count_0 + count_1*(int(num_str[0])-1)+count(num_str[1:],k-1)\n\nprint(count(str(n),k))", "import math\n\nn = int(input())\nk = int(input())\n\ndef combinations_count(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\ndef count(num_str,k):\n digits = len(num_str)\n if digits == 0:\n return 0\n else:\n if k == 0:\n # print(num_str,1)\n return 1\n if num_str[0] == '0':\n # print(num_str,count(num_str[1:],k-1))\n return count(num_str[1:],k)\n else:\n if digits == 1 and k == 1:\n # print(num_str,int(num_str))\n return int(num_str)\n elif digits == 1 and k > 1:\n # print(num_str,0)\n return 0\n if digits >= k+1:\n count_0 = combinations_count(digits-1,k)*(9**k)\n else:\n count_0 = 0\n count_1 = combinations_count(digits-1,k-1)*(9**(k-1))\n # print(num_str,count_0 + count_1*(int(num_str[0])-1)+count(num_str[1:],k-1))\n return count_0 + count_1*(int(num_str[0])-1)+count(num_str[1:],k-1)\n\nprint(count(str(n),k))"] | ['Wrong Answer', 'Accepted'] | ['s976126839', 's546335738'] | [3064.0, 3064.0] | [18.0, 18.0] | [1065, 1073] |
p02781 | u098012509 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["import sys\n\nsys.setrecursionlimit(10 ** 8)\n\ninput = sys.stdin.readline\n\n\ndef main():\n N = int(input())\n K = int(input())\n\n nstr = str(N)\n\n nl = len(str(N))\n\n dp = [[[0 for _ in range(nl + 1)] for _ in range(2)] for _ in range(nl + 1)]\n dp[0][0][0] = 1\n\n for i in range(nl):\n max_digit = int(nstr[i])\n for smaller in range(2):\n for j in range(nl):\n range_digit = 9\n \n if not smaller:\n range_digit = max_digit\n for x in range(range_digit + 1):\n if x != 0:\n if smaller == 1:\n dp[i + 1][smaller][j + 1] += dp[i][smaller][j]\n else:\n if x < max_digit:\n dp[i + 1][1][j + 1] += dp[i][smaller][j]\n else:\n dp[i + 1][0][j + 1] += dp[i][smaller][j]\n else:\n if smaller == 1:\n dp[i + 1][smaller][j] += dp[i][smaller][j]\n else:\n if x < max_digit:\n dp[i + 1][1][j] += dp[i][smaller][j]\n else:\n dp[i + 1][0][j] += dp[i][smaller][j]\n\n ans = 0\n print(dp[nl][1][K])\n\n\nif __name__ == '__main__':\n main()\n", "import sys\nfrom functools import lru_cache\n\ninput = sys.stdin.readline\n\nsys.setrecursionlimit(10 ** 8)\n\n\n@lru_cache(maxsize=None)\ndef solve(n, k):\n if n < 10:\n if k == 1:\n return n\n elif k == 0:\n return 1\n else:\n return 0\n\n q, r = divmod(n, 10)\n\n return solve(q, k) + solve(q, k - 1) * r + solve(q - 1, k - 1) * (9 - r)\n\n\ndef main():\n N = int(input())\n K = int(input())\n\n print(solve(N, K))\n\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Accepted'] | ['s194455484', 's906502170'] | [3428.0, 6260.0] | [78.0, 87.0] | [1476, 503] |
p02781 | u106778233 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n=input()\nk=input()\nsum=0\nfor i in range(1,k+1):\n a=list(str(i))\n if list.count(0)=k:\n sum+=1\nprint(sum) ', "n=int(input())\nk=int(input())\nsum=0\nfor i in range(1,n+1):\n a=list(str(i))\n if a.count('0')==k:\n sum+=1\n\nprint(sum)", 'n=int(input())\nk=int(input())\nsum=0\nfor i in range(1,n+1):\n a=list(str(i))\n if a.count("0")==k:\n sum+=1\n\nprint(sum)', 'n=input()\nk=int(input())\nm=len(n)\ndp=[[[0]*(k+1) for _ in range(2)] for _ in range(m+1)]\ndp[0][0][0]=1\nfor i in range(1,m+1):\n l = int(n[i-1])\n for j in range(k+1):\n dp[i][1][j]+=dp[i-1][1][j] \n if l!=0:\n dp[i][1][j]+=dp[i-1][0][j] \n else:\n dp[i][0][j]+=dp[i-1][0][j] \n if j-1>=0:\n dp[i][1][j]+=9*dp[i-1][1][j-1]\n if l!=0:\n dp[i][0][j]+=dp[i-1][0][j-1]\n dp[i][1][j]+=(l-1)*dp[i-1][0][j-1]\nprint(dp[m][0][k]+dp[m][1][k])'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s110020963', 's463209164', 's757542052', 's251723265'] | [2940.0, 2940.0, 3060.0, 3064.0] | [17.0, 2104.0, 2104.0, 18.0] | [120, 128, 128, 533] |
p02781 | u112317104 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["S = input()\nN = len(S)\nK = int(input())\n\nnCr = {}\ndef cmb(n, r):\n if r == 0 or r == n: return 1\n if r == 1: return n\n if (n,r) in nCr: return nCr[(n,r)]\n nCr[(n,r)] = cmb(n-1,r) + cmb(n-1,r-1)\n return nCr[(n,r)]\n\ndef rec(i, k, isSmaller):\n if i == N:\n if k == 0:\n return 1\n else:\n return 0\n \n if k == 0:\n return 1\n \n if isSmaller:\n return cmb(N-i, k) * pow(9, k)\n else:\n if S[i] == '0':\n return rec(i+1, k, False)\n else:\n zero = rec(i+1, k, True)\n between = rec(i+1, k-1, True) * (S[i] - '1')\n same = rec(i+1, k-1, False)\n return zero + between + same\n\nprint(rec(0, K, False))", "S = input()\nN = len(S)\nK = int(input())\n\ndef cmb(n, r):\n if r < 0 or r > n:\n return 0\n if r == 1:\n return n\n elif r == 2:\n return n * (n-1) // 2\n else:\n return n * (n-1) * (n-2) // (3 * 2) \n\ndef rec(i, k, isSmaller):\n if k == 0:\n return 1\n\n if i == N:\n return 0\n \n if isSmaller:\n return cmb(N-i, k) * pow(9, k)\n else:\n if S[i] == '0':\n return rec(i+1, k, False)\n else:\n zero = rec(i+1, k, True)\n between = rec(i+1, k-1, True) * (int(S[i]) - 1)\n same = rec(i+1, k-1, False)\n return zero + between + same\n\nprint(rec(0, K, False))\n"] | ['Runtime Error', 'Accepted'] | ['s633367421', 's624896230'] | [3936.0, 3064.0] | [74.0, 18.0] | [728, 673] |
p02781 | u145600939 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["n = input()\nk = int(input())\n\nif len(n) <= k:\n cnt = 0\n for i in range(1,int(n)+1):\n if len(str(i)) - str(i).count('0') == k:\n cnt += 1\n print(cnt)\n exit()\n\ncnt = 0\nl = len(n)\ndef combi(n,k):\n ans = 1\n if k == 0:\n return ans\n for i in range(k):\n ans = ans * (n-i) // (i+1)\n return ans\nflag = 0\nfor i in range(l):\n if flag > k:\n break\n if n[i] == '0':\n if i == l-1:\n cnt += 1\n continue\n flag += 1\n cnt += int(((int(n[i])-1)*9**(k-flag))*combi(l-i-1,k-flag) + 9**(k-flag+1)*combi(l-i-1,k-flag+1))\n print(cnt)\n\nprint(cnt)", "n = input()\nk = int(input())\nl = len(n)\ndp = [[[0,0] for j in range(5)] for i in range(l+1)]\ndp[0][0][1] = 1\nfor i in range(l):\n for j in range(k+1):\n dp[i+1][j+1][0] += 9 * dp[i][j][0]\n dp[i+1][j ][0] += dp[i][j][0]\n if n[i] == '0':\n dp[i+1][j ][1] = dp[i][j][1]\n else:\n dp[i+1][j ][0] += dp[i][j][1]\n dp[i+1][j+1][0] += (int(n[i]) - 1)*dp[i][j][1]\n dp[i+1][j+1][1] += dp[i][j][1]\nprint(dp[l][k][1] + dp[l][k][0] )\n "] | ['Wrong Answer', 'Accepted'] | ['s614616006', 's791094597'] | [3064.0, 3188.0] | [17.0, 18.0] | [621, 454] |
p02781 | u157020659 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from collections import deque\nn = input()\nk = int(input())\na = [int(n[i]) for i in range(min(k, len(n)))]\nn = len(n)\n\nif k > n:\n ans = 0\nelif k == 1:\n \n ans += a[0]\n \n ans += (n - 1)*9\nelif k == 2:\n \n ans += a[1] + (n - 2)*9\n \n ans += (a[0] - 1)*(n - 1)*9\n \n ans += (n - 1)*(n - 2)*9*9//2\nelse:\n \n ans += a[2] + (n - 3)*9 + (n - 2)*(n - 3)*9*9//2\n if a[1] != 0:\n ans += (a[1] - 1)*(n - 2)*9\n \n ans += (a[0] - 1)*(n - 1)*(n - 2)*9*9//2\n \n ans += (n - 1)*(n - 2)*(n - 3)*9*9*9//6\nprint(ans)', 'from collections import deque\nn = input()\na = [int(i) for i in list(n)]\nk = int(input())\nn = len(n)\nans = 0\n\nif k > n:\n ans = 0\nelif k == 1:\n \n ans += a[0]\n \n ans += (n - 1)*9\nelif k == 2:\n \n for i in range(1, n):\n if a[i] != 0:\n j = i\n break\n else:\n j = n - 1\n ans += a[j] + (n - j - 1)*9\n \n ans += (a[0] - 1)*(n - 1)*9\n \n ans += (n - 1)*(n - 2)*9*9//2\nelse:\n \n j, l= -1, n - 1\n for i in range(1, n):\n if a[i] != 0:\n if j == -1:\n j = i\n else:\n l = i\n break\n if j != -1 and j != n - 1:\n ans += a[l] + (n - l - 1)*9 + (a[j] - 1)*(n - j - 1)*9 + (n - j - 1)*(n - j - 2)*9*9//2\n \n ans += (a[0] - 1)*(n - 1)*(n - 2)*9*9//2\n \n ans += (n - 1)*(n - 2)*(n - 3)*9*9*9//6\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s416784783', 's553264299'] | [3316.0, 3316.0] | [21.0, 20.0] | [888, 1191] |
p02781 | u173148629 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N=int(input())\nK=int(input())\n\nd=len(str(N)) \na=int(str(N)[0]) \nif K==1:\n l=9*(d-1)\n m=a-1\n n=1\n print(int(l+m+n))\n \nif K==2:\n if d=1:\n print(0)\n else:\n l=9**2*(d-1)*(d-2)/2 \n m=(a-1)*9*(d-1) \n for i in range(1,d):\n if int(str(N)[i])!=0:\n n=(int(str(N)[i]))+9*(d-i-1)\n break\n print(int(l+m+n))\n \nif K==3:\n if d<=2:\n print(0)\n else:\n l=9**3*(d-1)*(d-2)*(d-3)/6\n m=(a-1)*9**2*(d-1)*(d-2)/2\n for i in range(1,d):\n if int(str(N)[i])!=0:\n n=(int(str(N)[i]))*9*(d-i-1)+9**2*(d-i-1)*(d-i-2)/2\n break\n print(int(l+m+n))', 'N=input()\nK=int(input())\n\ndpsm=[[0]*(K+1) for _ in range(len(N))] #dpsm[i][k]\ndp=[[0]*(K+1) for _ in range(len(N))]\n\ndpsm[0][0]=1\ndpsm[0][1]=int(N[0])-1\ndp[0][1]=1\n\nfor i in range(1,len(N)):\n for k in range(K-1,-1,-1):\n dpsm[i][k+1]+=dpsm[i-1][k]*9\n\n \n if N[i]=="0":\n for k in range(K,-1,-1):\n dpsm[i][k]+=dpsm[i-1][k]\n dp[i][k]+=dp[i-1][k]\n else:\n for k in range(K-1,-1,-1):\n dpsm[i][k+1]+=dp[i-1][k]*(int(N[i])-1)\n dp[i][k+1]+=dp[i-1][k]\n\n for k in range(K,-1,-1):\n dpsm[i][k]+=dpsm[i-1][k]\n dpsm[i][k]+=dp[i-1][k]\n \nprint(dp[-1][-1]+dpsm[-1][-1])\n'] | ['Runtime Error', 'Accepted'] | ['s389054896', 's948608126'] | [2940.0, 3064.0] | [17.0, 18.0] | [642, 665] |
p02781 | u177388368 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from math import factorial as fac\n\ndef comb(n,r):\n if ( r<0 or r>n ):\n return 0\n return fac(n)/(fac(r)*fac(n-r))\n\n\nn=int(input())\nk=int(input())\n\nnn=str(n)\nketa=len(nn)\n\nans=0\n\nif keta<k:\n print(0)\n exit()\n\nzero=0\n\nfor i in range(keta):\n if int(nn[i])==0:zero+=1\n ans+=comb(keta-i-1,k-i+zero)*9**(k-i)\n if int(nn[i])-1>=0:\n ans+=(int(nn[i])-1)*comb(keta-i-1,k-i-1+zero)*9**(k-i-1+zero)\n\nif keta-zero==k:ans+=1\n\nprint(int(ans))\n', 'from math import factorial as fac\n\ndef comb(n,r):\n if ( r<0 or r>n ):\n return 0\n return fac(n)/(fac(r)*fac(n-r))\n\n\nn=int(input())\nk=int(input())\n\nnn=str(n)\nketa=len(nn)\n\nans=0\n\nif keta<k:\n print(0)\n exit()\n\nzero=0\n\n\n\n# ans+=comb(keta-i-1,k-i+zero)*9**(k-i)\n# if int(nn[i])-1>=0:\n\n#\n\n\ndef search(n,k):\n if k<=0:return\n global ans\n nn = str(n)\n keta = len(nn)\n ans += comb(keta - 1, k ) * 9 ** k\n if int(nn[0])-1>0:\n ans+=(int(nn[0])-1)*comb(keta-1,k-1)*9**(k-1)\n ne=n-int(nn[0])*10**(keta-1)\n search(ne,k-1)\n\n\nsearch(n,k)\nfor i in range(keta):\n if nn[i]=="0":zero+=1\nif keta-zero>=k:ans+=1\nprint(int(ans))'] | ['Wrong Answer', 'Accepted'] | ['s958510740', 's951845823'] | [3188.0, 3064.0] | [19.0, 18.0] | [462, 813] |
p02781 | u186206732 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N=int(input())\nK=int(input())\n\nn=str(N)\nn_digi=len(n)\n\nimport math\n\ndef permutations_count(n, r):\n return math.factorial(n) // math.factorial(n - r)\n\n\nif n_digi < K:\n print(0)\n\nelse:\n ans=0\n \n if n_digi>K:\n ans += permutations_count(n_digi-1,K)*9\n \n keta1=int(n[0])\n nokori=n[1:]\n \n if keta1 != 1 and K!=1:\n ans += (keta1-1)*ermutations_count(n_digi-2,K-1)*9\n \n elif keta1 != 1 and K==1:\n ans += (keta1-1)\n \n elif K==1 and int(nokori)==0:\n ans += 1\n \n else:\n noko_list = list(nokori)\n aa=1\n bb=sum(noko_list)\n for j in noko_list:\n aa *=j\n \n ans += aa-bb*(K-1)\n \n \n \n\n\n', 'from functools import lru_cache\n\nN, K = map(int,input().split())\n \n@lru_cache(None)\ndef F(N, K):\n \n\n if N < 10:\n if K == 0:\n return 1\n if K == 1:\n return N\n return 0\n q,r = divmod(N,10)\n ret = 0\n if K >= 1:\n \n ret += F(q, K-1) * r\n ret += F(q-1, K-1) * (9-r)\n \n ret += F(q, K)\n return ret\n\n \nprint(F(N, K))\n', 'from functools import lru_cache\n\nN=int(input())\nK=int(input())\n \n@lru_cache(None)\ndef F(N, K):\n \n\n if N < 10:\n if K == 0:\n return 1\n if K == 1:\n return N\n return 0\n q,r = divmod(N,10)\n ret = 0\n if K >= 1:\n \n ret += F(q, K-1) * r\n ret += F(q-1, K-1) * (9-r)\n \n ret += F(q, K)\n return ret\n \n# F(100, 1), F(25, 2), F(314159, 2)\n \nprint(F(N, K))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s271266489', 's581297480', 's052885606'] | [3064.0, 3572.0, 3940.0] | [17.0, 23.0, 27.0] | [739, 518, 553] |
p02781 | u201928947 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n = list(map(int,list(input())))\nk = int(input())\nl = len(n)\ncount = 0 \nlst = [[0]*(k+1) for _ in range(l+1)] \nfor i in range(l):\n if count < k:\n lst[i+1][count] += 1\n lst[i+1][count+1] += n[i]-1\n if count == k:\n lst[i+1][count] += 1\n for j in range(k):\n lst[i+1][j] += lst[i][j]\n lst[i+1][j+1] += 9*lst[i][j]\n lst[i+1][k] += lst[i][k]\n if n[i] != 0:\n count += 1\nif count == k:\n print(lst[l][k]+1)\nelse:\n print(lst[l][k])', 'n = list(map(int,list(input())))\nk = int(input())\nl = len(n)\ncount = 0 \nlst = [[0]*(k+1) for _ in range(l+1)] \nfor i in range(l):\n if count < k:\n if n[i] != 0:\n lst[i+1][count] += 1\n lst[i+1][count+1] += n[i]-1\n if count == k:\n if n[i] != 0:\n lst[i+1][count] += 1\n for j in range(k):\n lst[i+1][j] += lst[i][j]\n lst[i+1][j+1] += 9*lst[i][j]\n lst[i+1][k] += lst[i][k]\n if n[i] != 0:\n count += 1\nif count == k:\n print(lst[l][k]+1)\nelse:\n print(lst[l][k])'] | ['Wrong Answer', 'Accepted'] | ['s047152551', 's645262605'] | [3064.0, 3064.0] | [17.0, 17.0] | [547, 603] |
p02781 | u212786022 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = input()\nK = int(input())\n\nL = len(str(N))\nN2 = list(str(N))\ndp1 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp2 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp1[0]=[1]*(L+1)\ntemp = 0\nfor i in range(L-1):\n #print(temp)\n if (N2[i] != "0" and temp <= K-1):\n temp += 1\n dp2[min(temp,K)][i+1] += 1\n elif N2[i] == "0":\n dp2[min(temp,K)][i+1] += 1\n print(dp2)\n\ndp1[1][1] = int(N2[0])-1\nfor i in range(1,K+1):\n for j in range(2,L+1):\n if (N2[j-1] != "0" and i == 1 ):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 2):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 3):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n else:\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]\nprint(dp1)\nprint(dp1[K][-1]+dp2[K][-1])', 'N = input()\nK = int(input())\n\nL = len(str(N))\nN2 = list(str(N))\ndp1 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp2 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp1[0]=[1]*(L+1)\ntemp = 0\nfor i in range(L-1):\n #print(temp)\n if (N2[i] != "0" and temp <= K-1):\n temp += 1\n dp2[min(temp,K)][i+1] += 1\n elif N2[i] == "0":\n dp2[min(temp,K)][i+1] += 1\n\ndp1[1][1] = int(N2[0])-1\nfor i in range(1,K+1):\n for j in range(2,L+1):\n if (N2[j-1] != "0" and i == 1 ):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 2):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 3):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n else:\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]\nprint(dp1[K][-1]+dp2[K][-1])', 'N = input()\nK = int(input())\n\nL = len(str(N))\nN2 = list(str(N))\ndp1 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp2 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp1[0]=[1]*(L+1)\ntemp = 0\nfor i in range(L-1):\n #print(temp)\n if (N2[i] != "0" and temp <= K-1):\n temp += 1\n dp2[min(temp,K)][i+1] += 1\n elif (N2[i] == "0" and dp2[min(temp,K)][i] == 1):\n dp2[min(temp,K)][i+1] += 1\n#print(dp2)\n\ndp1[1][1] = int(N2[0])-1\nfor i in range(1,K+1):\n for j in range(2,L+1):\n if (N2[j-1] != "0" and i == 1 ):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 2):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 3):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n else:\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]\n#print(dp1)\nprint(dp1[K][-1]+dp2[K][-1])', 'N = input()\nK = int(input())\n\nL = len(str(N))\nN2 = list(str(N))\ndp1 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp2 = [[0 for i in range(L+1)] for j in range(3+1)]\ndp1[0]=[1]*(L+1)\ntemp = 0\nfor i in range(L):\n #print(temp)\n if (N2[i] != "0" and temp <= K-1):\n temp += 1\n dp2[min(temp,K)][i+1] += 1\n elif (N2[i] == "0" and dp2[min(temp,K)][i] == 1):\n dp2[min(temp,K)][i+1] += 1\n#print(dp2)\n\ndp1[1][1] = int(N2[0])-1\nfor i in range(1,K+1):\n for j in range(2,L+1):\n if (N2[j-1] != "0" and i == 1 ):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 2):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n elif (N2[j-1] != "0" and i == 3):\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]+dp2[i-1][j-1]*(int(N2[j-1])-1)+dp2[i][j-1]\n else:\n dp1[i][j] += dp1[i-1][j-1]*9+dp1[i][j-1]\n#print(dp1)\nprint(dp1[K][-1]+dp2[K][-1])'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s327839920', 's484368336', 's822109340', 's051931387'] | [3316.0, 3316.0, 3192.0, 3192.0] | [20.0, 19.0, 18.0, 19.0] | [961, 935, 990, 988] |
p02781 | u221061152 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N,K=map(int,input().split())\ndef f(n,k):\n if k<1: return 1\n if n<10:\n if k<2: return n\n return 0\n d,m=n//10,n%10\n return f(d,k-1)*m+f(d-1,k-1)*(9-m)+f(d,k)\nprint(f(N,K))', 'N,K=int(input()),int(input())\ndef f(n,k):\n if k<1: return 1\n if n<10:\n if k<2: return n\n return 0\n d,m=n//10,n%10\n return f(d,k-1)*m+f(d-1,k-1)*(9-m)+f(d,k)\nprint(f(N,K))'] | ['Runtime Error', 'Accepted'] | ['s456032195', 's091215757'] | [3060.0, 3060.0] | [17.0, 378.0] | [179, 180] |
p02781 | u227082700 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n=input()\nif n[0]=="0"ans=1/0\nl=len(n)\nk=int(input())\nif l<6:\n n=int(n)\n ans=0\n for i in range(1,n+1):\n if len(str(i))-str(i).count("0")==k:ans+=1\n print(ans)\n exit()\nif k==1:\n ans=((l-1)*9)+int(n[0])\n print(ans)\nif k==2:\n ans=((l-1)*(l-2)//2)*81\n ans+=(int(n[0])-1)*((l-1)*9)\n ans+=int(n[1])\n ans+=(l-2)*9\n print(ans)\nif k==3:\n ans=int(n[2])+(l-3)*9\n ans+=(int(n[1])-1)*((l-2)*9)\n ans+=((l-2)*(l-3)//2)*81\n ans+=(int(n[0])-1)*((l-1)*(l-2)//2)*81\n ans+=((l-1)*(l-2)*(l-3)//6)*9*9*9\n print(ans)', 'n=input()\nl=len(n)\nk=int(input())\nif l<6:\n n=int(n)\n ans=0\n for i in range(1,n):\n if len(str(i))-str(i).count("0")==k:ans+=1\n print(ans)\n exit()\nif k==1:\n ans=((l-1)*9)+int(n[0])\n print(ans)\n exit()\nif k==2:\n ans=((l-1)*(l-2)//2)*81\n ans+=(int(n[0])-1)*((l-1)*9)\n ans+=int(n[1])\n ans+=(l-2)*9\n print(ans)\nif k==3:\n ans=int(n[2])+(l-3)*9\n ans+=(int(n[1])-1)*((l-2)*9)\n ans+=((l-2)*(l-3)//2)*81\n ans+=(int(n[0])-1)*((l-1)*(l-2)//2)*81\n ans+=((l-1)*(l-2)*(l-3)//6)*9*9*9\n print(ans)', 'n=input()\nl=len(n)\nk=int(input())\ndef f(n,k):\n l=len(n)\n if l<k:return 0\n if n[0]=="0":return f(n[1:],k)\n if k==1:\n ans=((l-1)*9)+int(n[0])\n if k==2:\n ans=((l-1)*(l-2)//2)*81+(int(n[0])-1)*((l-1)*9)\n ans+=f(n[1:],k-1)\n if k==3:\n ans=(int(n[0])-1)*((l-1)*(l-2)//2)*81+((l-1)*(l-2)*(l-3)//6)*9*9*9\n ans+=f(n[1:],k-1)\n return ans\nprint(f(n,k))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s659377683', 's950776959', 's966722577'] | [3064.0, 3064.0, 3064.0] | [17.0, 24.0, 18.0] | [514, 501, 362] |
p02781 | u255382385 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["n = input()\nk = int(input())\n\nn_list = []\nfor a in n:\n n_list.append(int(a))\nn_num = len(n_list)\n\nif n_num < k:\n print('0')\n return\n\ndp = [[[0] * (n_num + 1) for _ in range(2)]for _ in range(n_num + 1)]\n\ndp[0][0][0] = 1\nfor i in range(n_num):\n for smaller in range(2):\n for j in range(n_num):\n lim = 9 if smaller else n_list[i]\n for x in range(lim + 1):\n if x != 0:\n ns = j + 1\n else:\n ns = j\n nlt = smaller | (x < n_list[i])\n dp[i + 1][nlt][ns] += dp[i][smaller][j]\nans = dp[n_num][0][k] + dp[n_num][1][k]\nprint(ans)", "n = input()\nk = int(input())\n\nn_list = []\nfor a in n:\n n_list.append(int(a))\nn_num = len(n_list)\n\nif n_num < k:\n print('0')\nelse:\n\n dp = [[[0] * (n_num + 1) for _ in range(2)]for _ in range(n_num + 1)]\n\n dp[0][0][0] = 1\n for i in range(n_num):\n for smaller in range(2):\n for j in range(n_num):\n lim = 9 if smaller else n_list[i]\n for x in range(lim + 1):\n if x != 0:\n ns = j + 1\n else:\n ns = j\n nlt = smaller | (x < n_list[i])\n dp[i + 1][nlt][ns] += dp[i][smaller][j]\n ans = dp[n_num][0][k] + dp[n_num][1][k]\n print(ans)"] | ['Runtime Error', 'Accepted'] | ['s305593036', 's122739249'] | [3064.0, 3428.0] | [17.0, 158.0] | [656, 711] |
p02781 | u261103969 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import math\n\nn = int(input())\nk = int(input())\n\ndigit_num = math.floor(math.log10(n)) + 1\ncount = [0 for _ in range(n)]\n\nfor i in range(digit_num-1):\n j = i + 1\n if j > k:\n temp = ((j*j + 3*j + 2) * 9^(j-2)) /2\n count[i] = temp\n\nb = 0\n\nfor i in range(digit_num,k,-1):\n s = int(str(n)[i])\n if s > 1:\n temp = (s-1) * count[i+1]\n b = b + temp\n\nans = sum(count)+b\n\nprint(b)', "\nfrom collections import Counter, deque\n# import copy\n# from heapq import heappush, heappop, heapify\n# from fractions import gcd\n# import itertools\n# from operator import attrgetter, itemgetter\n# import math\n\nimport sys\n\n# import numpy as np\n\nreadline = sys.stdin.readline\nMOD = 10 ** 9 + 7\nINF = float('INF')\nsys.setrecursionlimit(10 ** 5)\n\n\ndef main():\n n = input()\n p = int(input())\n l = len(n)\n\n n_0 = int(str(n)[0])\n\n dp = [[[0] * 2 for _ in range(p + 2)] for __ in range(l)]\n dp[0][0][0] = 0\n dp[0][0][1] = 1\n dp[0][1][0] = 1\n dp[0][1][1] = (n_0 - 1)\n\n for i in range(l - 1):\n a = int(n[i + 1])\n if a != 0:\n for j in range(p + 1):\n dp[i + 1][j + 1][0] += dp[i][j][0]\n dp[i + 1][j + 1][1] += 9 * dp[i][j][1] + (a - 1) * dp[i][j][0]\n dp[i + 1][j][1] += dp[i][j][0] + dp[i][j][1]\n else:\n for j in range(p + 1):\n dp[i + 1][j + 1][1] += 9 * dp[i][j][1]\n dp[i + 1][j][0] += dp[i][j][0]\n dp[i + 1][j][1] += dp[i][j][1]\n\n print(dp[l - 1][p][0] + dp[l - 1][p][1])\n\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Accepted'] | ['s382507808', 's742143801'] | [179992.0, 3316.0] | [2113.0, 22.0] | [437, 1182] |
p02781 | u287500079 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["import math\nn = int(input())\nk = int(input())\n\nb = len(str(n)) \n\n\nif b > k:\n a = math.factorial(b - 1) // math.factorial(k) // math.factorial(b - 1 - k)\n ans = a * pow(9, k)\nelse: \n ans = 0\n\nif k == 1:\n ans += int(str(n)[0])\nelif k == 2:\n c = int(str(n)[0])\n for i in range(1, b): \n for j in range(1, c + 1): \n if j < c or i > 1:\n ans += 9\n else:\n #print(i, j, int(str(n)[i]))\n ans += int(str(n)[i])\nelse:\n c = [int(str(n)[i]) for i in range(b)] 分離\n d = 1 \n for i in range(1, b):\n if c[i] == 0:\n d += 1\n else:\n break\n if d < b: \n ans += (c[0] - 1) * 81 * math.factorial(b - 1) // math.factorial(2) // math.factorial(b - 3) \n if b - d > 2:\n ans += 81 * math.factorial(b - d - 1) // math.factorial(2) // math.factorial(b - d - 3) \n ans += (c[d] - 1) * 9 * (b - d - 1) \n #print(ans)\n \n for i in range(d + 1, b): \n for j in range(1, 10): \n e = ['0' for _ in range(b)]\n e[0] = c[0]\n e[d] = c[d]\n e[i] = j\n f = ''\n for k in range(b):\n f += str(e[k])\n f = int(f)\n if f <= n:\n ans += 1\n\n\n\n\n\n\nprint(ans)", 'n = int(input())\nk = int(input())\nl = len(str(n))\na = [int(str(n)[i]) for i in range(l)]\n\ndp = [[[0, 0] for _ in range(k + 1)] for _ in range(l)] \n\ndp[0][0][0] = 1 \ndp[0][0][1] = 0 \ndp[0][1][0] = a[0] - 1 \ndp[0][1][1] = 1 \n\n#print(a)\n\nfor i in range(1, l):\n for j in range(k + 1):\n if j > 0 and a[i] != 0:\n \n \n \n \n dp[i][j][0] = dp[i-1][j][0] * 1 \\\n + dp[i-1][j-1][0] * 9 \\\n + dp[i-1][j][1] * 1 \\\n + dp[i-1][j-1][1] * (a[i] - 1)\n \n dp[i][j][1] = dp[i-1][j-1][1] * 1\n\n elif j > 0 and a[i] == 0:\n \n \n dp[i][j][0] = dp[i-1][j][0] * 1 \\\n + dp[i-1][j-1][0] * 9\n \n dp[i][j][1] = dp[i-1][j][1] * 1\n \n elif j == 0 and a[i] != 0:\n \n \n dp[i][j][0] = dp[i-1][j][0] * 1 \\\n + dp[i-1][j][1] * 1\n \n dp[i][j][1] = 0\n elif j == 0 and a[i] == 0:\n \n dp[i][j][0] = dp[i-1][j][0] * 1\n \n dp[i][j][1] = dp[i-1][j][1] * 1\n \n\n#print(dp)\nprint(dp[l-1][k][0] + dp[l-1][k][1])'] | ['Wrong Answer', 'Accepted'] | ['s000639059', 's761173501'] | [3188.0, 3192.0] | [47.0, 18.0] | [2427, 2297] |
p02781 | u290279680 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import math\nN = len(str(input()))\nK = int(input())\nprint((math.factorial(N) // (math.factorial(N-K) * math.factorial(K)))*(9**K))', 'import math\nN = int(input())\nl = len(str(N))\nK = int(input())\ndef calc(a, b, c):\n t = 0\n if a-b-1>=0:\n t = (math.factorial(a-1) // (math.factorial(a-b-1) * math.factorial(b)))*(9**(b))\n if b==1:\n t2 = int(str(c)[0])\n else:\n t2 = (math.factorial(a-1) // (math.factorial(a-b) * math.factorial(b-1)))*(9**(b-1))*(int(str(c)[0])-1)\n t3 = 0\n try:\n n = int(str(c)[1:])\n if 2<=b<=len(str(n))+1:\n t3 = calc(len(str(n)), b-1, n)\n except:\n pass\n return t+t2+t3\n\nif l>=K:\n print(calc(l, K, N))\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s790416114', 's496884756'] | [2940.0, 3064.0] | [18.0, 19.0] | [129, 581] |
p02781 | u291028869 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["def nCr(n,r):\n ret = 1\n for i in range(r):\n ret *= n-i\n ret /= i+1\n return ret\n\ndef top(N,K):\n if K == 0:\n return 1\n L = len(N)\n ans = 0\n if L < K:\n return 0\n else:\n ans += nCr(L-1,K) * 9 ** K\n\n u = int(N[0])\n z = N.count('0')\n o = N.count('1')\n f = 0\n if z + o == L:\n f = 1\n if f == 0:\n ans += (u - 1) * nCr(L-1,K - 1) * 9 ** (K - 1)\n return ans + top(str(N[1:]),K - 1)\n else:\n if len(str(int(N[1:]))) != 1:\n return ans + top(str(int(N[1:])),K - 1)\n else:\n return ans\n\nN = str(input())\nK = int(input())\n\nprint(int(top(N,K)))", 'def nCr(n,r):\n ret = 1\n for i in range(r):\n ret *= n-i\n ret /= i+1\n return ret\n\ndef top(N,K):\n if K == 0:\n return 1\n L = len(N)\n ans = 0\n if L < K:\n return 0\n else:\n ans += nCr(L-1,K) * 9 ** K\n\n u = int(N[0])\n if int(N) % u * 10 ** (L-1) != 0 or u != 1:\n ans += (u - 1) * nCr(L-1,K - 1) * 9 ** (K - 1)\n return ans + top(str(N[1:]),K - 1)\n else:\n return ans\n\nN = str(input())\nK = int(input())\n\nprint(int(top(N,K)))', 'def nCr(n,r):\n ret = 1\n for i in range(r):\n ret *= n-i\n ret /= i+1\n return ret\n\ndef top(N,K):\n if K == 0:\n return 1\n L = len(N)\n ans = 0\n if L < K:\n return 0\n else:\n ans += nCr(L-1,K) * 9 ** K\n\n u = int(N[0])\n if int(N) % u * 10 ** (L-1) != 0:\n ans += (u - 1) * nCr(L-1,K - 1) * 9 ** (K - 1)\n return ans + top(str(N[1:]),K - 1)\n else:\n return ans\n\nN = str(input())\nK = int(input())\n\nprint(int(top(N,K)))', "def nCr(n,r):\n ret = 1\n for i in range(r):\n ret *= n-i\n ret /= i+1\n return ret\n\ndef top(N,K):\n if K == 0:\n return 1\n L = len(N)\n ans = 0\n if L < K:\n return 0\n else:\n ans += nCr(L-1,K) * 9 ** K\n\n u = int(N[0])\n z = N.count('0')\n o = N.count('1')\n f = 0\n if z + o == L:\n f = 1\n if f == 0:\n ans += (u - 1) * nCr(L-1,K - 1) * 9 ** (K - 1)\n if L == 1:\n return ans + 1\n else:\n return ans + top(str(int(N[1:])),K - 1)\n else:\n if len(str(int(N[1:]))) != 1:\n return ans + top(str(int(N[1:])),K - 1)\n else:\n if o >= K:\n return ans + 1\n else:\n return ans\n\nN = str(input())\nK = int(input())\n\nprint(int(top(N,K)))"] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s002858590', 's072227190', 's525287919', 's048423997'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0, 17.0] | [608, 460, 450, 727] |
p02781 | u292746386 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | [' r = 1\n for i in range(a):\n r *= i+1\n return r\n\ndef combinations(a, b):\n if a>=0 and b>=0 and a >= b:\n return pow(9, b) * factorial(a) // factorial(b) // factorial(a-b)\n else:\n return 0\n\ndef count(m, a, b):\n # return the count of numbers in range [0, m x 10^a] with b non zero digitals\n ## the count of numbers in range [0, m x 10^a) with b non zero digitals\n r = combinations(a-1, b) + (m-1) * combinations(a-1, b-1)\n if b == 1:\n ## m x 10^a\n r += 1\n return r\n\nN = int(input())\nK = int(input())\n\ndigit = list(map(int, str(N)))\nM = len(digit)\n\nC = 0\nif M >= K:\n for i in range(K):\n C += count(digit[i], M-i, K-i)\n\nprint(C) \n', 'def factorial(a):\n r = 1\n for i in range(a):\n r *= i+1\n return r\n\ndef combinations(a, b):\n if a>=0 and b>=0 and a >= b:\n return pow(9, b) * factorial(a) // factorial(b) // factorial(a-b)\n else:\n return 0\n\ndef count(m, a, b):\n # return the count of numbers in range [0, m x 10^a] with b non zero digitals\n ## the count of numbers in range [0, m x 10^a) with b non zero digitals\n r = combinations(a-1, b) + (m-1) * combinations(a-1, b-1)\n if b == 1:\n ## m x 10^a\n r += 1\n return r\n\ndef COUNT(N,K):\n digit = list(map(int, str(N)))\n M = len(digit)\n C = count(digit[0], M, K)\n N_ = N % pow(10, M-1)\n return C, N_\n \n\nN = int(input())\nK = int(input())\n\nC = 0\nwhile (N>0) and (K>0):\n c, N = COUNT(N, K)\n C+= c\n K-= 1\n\nprint(C) \n'] | ['Runtime Error', 'Accepted'] | ['s145515512', 's109185579'] | [2940.0, 3064.0] | [17.0, 17.0] | [702, 815] |
p02781 | u296150111 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n=input()\nk=int(input())\nketa=len(n)\n\n\n\n\ndp0=[[0]*(k+1) for _ in range(keta)]\ndp1=[[0]*(k+1) for _ in range(keta)]\ndp0[0][0]=1\ndp0[0][1]=int(n[0])-1\ndp1[0][1]=1\nfor i in range(1,keta):\n\tif n[i]==0:\n\t\tfor j in range(k+1):\n\t\t\tdp1[i][j]=dp1[i-1][j]\n\t\tdp0[i][0]=dp0[i-1][0]\n\t\tfor j in range(k+1):\n\t\t\tdp0[i][j]=dp0[i-1][j-1]*9+dp0[i-1][j]\n\telse:\n\t\tfor j in range(k+1):\n\t\t\tdp1[i][j]=dp1[i-1][j-1]\n\t\tdp0[i][0]=dp0[i-1][0]\n\t\tfor j in range(k+1):\n\t\t\tdp0[i][j]=dp1[i-1][j]+dp1[i-1][j-1]*(int(n[i])-1)+dp0[i-1][j-1]*9+dp0[i-1][j]\nprint(dp0[-1][-1]+dp1[-1][-1])\n\n\n\n', 'n=input()\nk=int(input())\nketa=len(n)\n\n\n\n\ndp0=[[0]*(k+1) for _ in range(keta)]\ndp1=[[0]*(k+1) for _ in range(keta)]\ndp0[0][0]=1\ndp0[0][1]=int(n[0])-1\ndp1[0][1]=1\nfor i in range(1,keta):\n\tif n[i]=="0":\n\t\tfor j in range(k+1):\n\t\t\tdp1[i][j]=dp1[i-1][j]\n\t\tdp0[i][0]=dp0[i-1][0]\n\t\tfor j in range(1,k+1):\n\t\t\tdp0[i][j]=dp0[i-1][j-1]*9+dp0[i-1][j]\n\telse:\n\t\tfor j in range(1,k+1):\n\t\t\tdp1[i][j]=dp1[i-1][j-1]\n\t\tdp0[i][0]=dp0[i-1][0]\n\t\tfor j in range(1,k+1):\n\t\t\tdp0[i][j]=dp1[i-1][j]+dp1[i-1][j-1]*(int(n[i])-1)+dp0[i-1][j-1]*9+dp0[i-1][j]\nprint(dp0[-1][k]+dp1[-1][k])\n\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s711891524', 's152683892'] | [3064.0, 3064.0] | [18.0, 18.0] | [607, 613] |
p02781 | u318616028 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from sys import stdin\nfrom functools import lru_cache\n\n@lru_cache(None)\ndef solver(N, K):\n \n if N < 10:\n if K == 0:\n return 1\n if K == 1:\n return N\n return 0\n \n m, r = divmod(N,10)\n ans = 0\n \n ans += solver(m, K-1) * r\n ans += solver(m-1, K-1) * (9-r)\n ans += solver(m, K)\n return ans\n\n\nn = int(input())\nk = int(input())\nprint(solver(n,k)\n', 'from sys import stdin\nfrom functools import lru_cache\n\n@lru_cache(None)\ndef solver(N, K):\n if N < 10:\n if K == 0:\n return 1\n if K == 1:\n return N\n return 0\n m, r = divmod(N,10)\n ans = 0\n if K >= 1:\n ans += solver(m, K-1) * r\n ans += solver(m-1, K-1) * (9-r)\n ans += solver(m, K)\n return ans\n\n\nn = int(input())\nk = int(input())\nprint(solver(n,k))\n'] | ['Runtime Error', 'Accepted'] | ['s541004839', 's164989473'] | [2940.0, 3940.0] | [17.0, 26.0] | [552, 421] |
p02781 | u333700164 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['dp[0][1][1]=int(n[0])-1\ndp[0][1][0]=1\ndp[0][0][1]=1\n\nfor i in range(1,l):\n for j in range(4):\n b=i-1\n now=int(n[i])\n if now==0:\n dp[i][j][0]+=dp[b][j][0]\n else:\n dp[i][j][1]+=dp[b][j][0]\n dp[i][j+1][1]+=dp[b][j][0]*(now-1)\n dp[i][j+1][0]+=dp[b][j][0]\n dp[i][j][1]+=dp[b][j][1]\n dp[i][j+1][1]+=9*dp[b][j][1]\nprint(dp[l-1][k][0]+dp[l-1][k][1])\n', 'n=input()\nk=int(input())\nl=len(n)\n\ndp=[[[0 for _ in range(2)] for _ in range(5)] for _ in range(l+1)]\n\ndp[0][1][1]=int(n[0]-1)\ndp[0][1][0]=1\ndp[0][0][1]=1\n\nfor i in range(1,l):\n for j in range(4):\n b=i-1\n now=n[i]\n if now==0:\n dp[i][j][0]+=dp[b][j][0]\n else:\n dp[i][j][1]+=dp[b][j][0]\n dp[i][j+1][1]+=dp[b][j][0]*(now-1)\n dp[i][j+1][0]+=dp[b][j][0]\nprint(dp[l-1][k][0]+dp[l-1][k][1])', 'n=input()\nk=int(input())\nl=len(n)\ndp=[[[0 for _ in range(2)] for _ in range(5)] for _ in range(l+1)]\ndp[0][1][1]=int(n[0])-1\ndp[0][1][0]=1\nfor i in range(1,L):\n for j in range(4):\n b=i-1\n now=int(n[i])\n if now=0:\n dp[i][j][0]+=dp[b][j][0]\n else:\n dp[i][j][1]+=dp[b][j][0]\n dp[i][j+1][1]+=dp[b][j][0]*(now-1)\n dp[i][j+1][0]+=dp[b][j][0]\n dp[i][j][1]+=dp[b][j][1]\n dp[i][j+1][1]+=dp[b][j][1]*9\n dp[i][1][1]+=9\nprint(dp[l-1][k][0]+dp[l-1][k][1])\n ', 'n=input()\nk=int(input())\nl=len(n)\n\ndp=[[[0 for _ in range(2)] for _ in range(5)] for _ in range(l+1)]\n\ndp[0][1][1]=int(n[0]-1)\ndp[0][1][0]=1\ndp[0][0][1]=1\n\nfor i in range(1,l):\n for j in range(4):\n b=i-1\n now=n[i]\n if now==0:\n dp[i][j][0]+=dp[b][j][0]\n else:\n dp[i][j][1]+=dp[b][j][0]\n dp[i][j+1][1]+=dp[b][j][0]*(now-1)\n dp[i][j+1][0]+=dp[b][j][0]\n dp[i][j][1]+=dp[b][j][1]\n dp[i][j+1][1]+=9*dp[b][j][1]\nprint(dp[l-1][k][0]+dp[l-1][k][1])\n', 'n=input()\nk=int(input())\nl=len(n)\n\ndp=[[[0 for _ in range(2)] for _ in range(5)] for _ in range(l+1)]\n\ndp[0][1][1]=int(n[0])-1\ndp[0][1][0]=1\ndp[0][0][1]=1\n\nfor i in range(1,l):\n for j in range(4):\n b=i-1\n now=int(n[i])\n if now==0:\n dp[i][j][0]+=dp[b][j][0]\n else:\n dp[i][j][1]+=dp[b][j][0]\n dp[i][j+1][1]+=dp[b][j][0]*(now-1)\n dp[i][j+1][0]+=dp[b][j][0]\n dp[i][j][1]+=dp[b][j][1]\n dp[i][j+1][1]+=9*dp[b][j][1]\nprint(dp[l-1][k][0]+dp[l-1][k][1])\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s069414458', 's300696964', 's435708277', 's786155870', 's578479168'] | [8988.0, 9148.0, 8964.0, 9160.0, 9184.0] | [26.0, 25.0, 27.0, 27.0, 32.0] | [381, 416, 494, 479, 484] |
p02781 | u334712262 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["# -*- coding: utf-8 -*-\nimport bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nINF = 2**62-1\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n\n error_print(e - s, 'sec')\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, K):\n M = len(N)\n ans = 1\n for i in range(K):\n ans *= M - i\n ans //= i+1\n ans *= 9\n print(ans)\n if K >= 1:\n t = 9 - int(N[0])\n for i in range(K-1):\n t *= len(N) - 1 - i\n t //= i+1\n t *= 9\n ans -= t\n if K >= 2:\n t = 9 - int(N[1])\n for i in range(K-2):\n t *= len(N) - 2 - i\n t //= i+1\n t *= 9\n ans -= t\n if K >= 3:\n t = 9 - int(N[2])\n ans -= t\n return ans\n\n\ndef main():\n N = read_str()\n K = read_int()\n print(slv(N, K))\n\n\nif __name__ == '__main__':\n main()\n", "# -*- coding: utf-8 -*-\nimport bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nINF = 2**62-1\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n\n error_print(e - s, 'sec')\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, K):\n N = int(N)\n @lru_cache(maxsize=None)\n def f(n, k):\n if k == 0:\n return 1\n m = n % 10\n l = n // 10\n if l == 0 and k == 1:\n return m\n elif l == 0:\n return 0\n return f(l, k-1)*m + f(l-1, k-1)*(9-m) + f(l, k)\n\n\n return f(N, K)\n\n\ndef f(N, K):\n M = len(N)\n N = int(N)\n ans = 0\n for i in range(N+1):\n n = str(i).count('0')\n if len(str(i)) - n == K:\n ans += 1\n # print(i)\n return ans\n\ndef main():\n N = read_str()\n K = read_int()\n print(slv(N, K))\n\n \n\n # for _ in range(1000):\n # N = str(random.randint(1, 100))\n # K = random.randint(1, 3)\n # # print(N)\n \n # a = slv(N, K)\n \n # if a != b:\n # print(N)\n \n # print(a, b)\n \n\n\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Accepted'] | ['s025774408', 's033445718'] | [6212.0, 5708.0] | [54.0, 41.0] | [1682, 2018] |
p02781 | u346812984 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import sys\nfrom collections import deque\n\nsys.setrecursionlimit(10 ** 6)\nINF = float("inf")\nMOD = 10 ** 9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef main():\n N = input()\n length = len(N)\n K = int(input())\n\n \n dp_1 = [[0] * (10) for _ in range(length)]\n\n \n dp_2 = [[0] * (10) for _ in range(length)]\n\n dp_1[0][0] = 1\n dp_1[0][1] = int(N[0]) - 1\n\n dp_2[0][1] = 1\n\n for i in range(1, length):\n \n for k in range(1, K + 2):\n dp_1[i][k] += dp_1[i - 1][k - 1] * 9\n\n \n for k in range(0, K + 2):\n dp_1[i][k] += dp_1[i - 1][k]\n\n \n if N[i] == "0":\n for i in range(K + 2):\n dp_2[i][k] += dp_2[i - 1][k]\n else:\n \n for k in range(K + 2):\n dp_1[i][k] += dp_2[i - 1][k]\n\n \n for k in range(1, K + 2):\n dp_1[i][k] += dp_2[i - 1][k - 1] * (int(N[i]) - 1)\n\n \n for k in range(1, K + 2):\n dp_2[i][k] += dp_2[i - 1][k - 1]\n\n ans = dp_1[-1][K] + dp_2[-1][K]\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n', 'import sys\nfrom collections import deque\n\nsys.setrecursionlimit(10 ** 6)\nINF = float("inf")\nMOD = 10 ** 9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef main():\n N = input()\n length = len(N)\n K = int(input())\n\n \n dp_1 = [[0] * (10) for _ in range(length)]\n\n \n dp_2 = [[0] * (10) for _ in range(length)]\n\n dp_1[0][0] = 1\n dp_1[0][1] = int(N[0]) - 1\n\n dp_2[0][1] = 1\n\n for i in range(1, length):\n \n for k in range(1, K + 2):\n dp_1[i][k] += dp_1[i - 1][k - 1] * 9\n\n \n for k in range(0, K + 2):\n dp_1[i][k] += dp_1[i - 1][k]\n\n \n if N[i] == "0":\n for k in range(K + 2):\n dp_2[i][k] += dp_2[i - 1][k]\n else:\n \n for k in range(K + 2):\n dp_1[i][k] += dp_2[i - 1][k]\n\n \n for k in range(1, K + 2):\n dp_1[i][k] += dp_2[i - 1][k - 1] * (int(N[i]) - 1)\n\n \n for k in range(1, K + 2):\n dp_2[i][k] += dp_2[i - 1][k - 1]\n\n ans = dp_1[-1][K] + dp_2[-1][K]\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s670041005', 's066189872'] | [3316.0, 3316.0] | [22.0, 21.0] | [1689, 1689] |
p02781 | u348805958 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['#!python3\n\nfrom math import factorial\n\niim = lambda: map(int, input().rstrip().split())\n\ndef cmb(a, b):\n c = a - b\n if c < b:\n b = c\n if b == 0: return 1\n\n ans = 1\n for i in range(b):\n ans *= a - i\n\n return ans // factorial(b)\n\ndef cnt(N, K):\n if K == 0:\n return 1\n\n n10 = 10 ** (K-1)\n if N < n10:\n return 0\n\n n10 *= 10\n k1 = K - 1\n n9 = 9 ** K\n n91 = 9 ** k1\n\n ans = 0\n a = n10\n i = 0\n while a < N:\n a *= 10; i += 1\n a //= 10; i -= 1\n if i > 0:\n ans = cmb(i+K, K) * n9\n #print(f"{i+K}C{K}", ans)\n\n n, b = divmod(N, a)\n if n > 1:\n ans += (n - 1) * cnt(a-1, K - 1)\n ans += cnt(b, K - 1)\n\n\n return ans\n\ndef resolve():\n N = int(input())\n K = int(input())\n\n print(cnt(N, K))\n\nif __name__ == "__main__":\n resolve()\n', '#!python3\n\n\niim = lambda: map(int, input().rstrip().split())\n\ndef resolve():\n N = list(map(int, input()))\n K = int(input())\n size = len(N)\n\n if size < K:\n print(0)\n return\n\n dp = [[[0]*(size+1) for j in range(2)] for i in range(size+1)]\n\n dp[0][0][0] = 1\n for i in range(size):\n for k in range(min(i+1, K+1)):\n dp0, dp1 = dp[i], dp[i+1]\n\n dp1[1][k+1] += 9 * dp0[1][k]\n dp1[1][k] += dp0[1][k]\n\n x, y = N[i], dp0[0][k]\n if x == 0:\n dp1[0][k] += y\n else:\n dp1[1][k] += y\n dp1[0][k+1] += y\n dp1[1][k+1] += (x-1) * y\n #print(dp1)\n\n print(dp[-1][0][K] + dp[-1][1][K])\n\nif __name__ == "__main__":\n resolve()\n'] | ['Wrong Answer', 'Accepted'] | ['s566830910', 's854995734'] | [3064.0, 3188.0] | [18.0, 18.0] | [847, 788] |
p02781 | u355853184 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = input()\nK = int(input())\nm = len(N)\ndp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]\ndp[0][0][0] = 1 \n\nfor i in range(1, m + 1):\n l = int(N[i - 1])\n for k in range(K + 1): \n if k -1 >= 0:\n if l != 0: \n dp[i][0][k] = dp[i - 1][0][k-1]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1] + dp[i - 1][0][k] + (l-1)*dp[i - 1][0][k-1]\n else: \n dp[i][0][k] = dp[i - 1][0][k]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1]\n else: \n if l != 0: \n #dp[i][0][k]\n dp[i][1][k] = dp[i - 1][1][k] + dp[i - 1][0][k] \n else: \n dp[i][0][k] = dp[i - 1][0][k] \n dp[i][1][k] = dp[i - 1][1][k] # =1\n\nprint(dp)\nprint(dp[m][0][K] + dp[m][1][K])\n\nN = input()\nK = int(input())\nm = len(N)\ndp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]\ndp[0][0][0] = 1 \n\nfor i in range(1, m + 1):\n l = int(N[i - 1])\n for k in range(K + 1): \n if k -1 >= 0:\n if l != 0: \n dp[i][0][k] = dp[i - 1][0][k-1]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1] + dp[i - 1][0][k] + (l-1)*dp[i - 1][0][k-1]\n else: \n dp[i][0][k] = dp[i - 1][0][k]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1]\n else: \n dp[i][0][k] = 0 \n dp[i][1][k] = 1 \n\n#print(dp)\nprint(dp[m][0][K] + dp[m][1][K])', 'N = input()\nK = int(input())\nm = len(N)\ndp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]\ndp[0][0][0] = 1 \n\nfor i in range(1, m + 1):\n l = int(N[i - 1])\n for k in range(K + 1): \n if k == 0: \n dp[i][0][k] = 0 \n dp[i][1][k] = 1 \n else k -1 >= 0:\n if l != 0: \n dp[i][0][k] = dp[i - 1][0][k-1]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1] + dp[i - 1][0][k] + (l-1)*dp[i - 1][0][k-1]\n else: \n dp[i][0][k] = dp[i - 1][0][k]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1]\n\n#print(dp)\nprint(dp[m][0][K] + dp[m][1][K])', 'N = input()\nK = int(input())\nm = len(N)\ndp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]\ndp[0][0][0] = 1 \n\nfor i in range(1, m + 1):\n l = int(N[i - 1])\n for k in range(K + 1): \n if k == 0: \n dp[i][0][k] = 0 \n dp[i][1][k] = 1 \n else: \n if l != 0: \n dp[i][0][k] = dp[i - 1][0][k-1]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1] + dp[i - 1][0][k] + (l-1)*dp[i - 1][0][k-1]\n else: \n dp[i][0][k] = dp[i - 1][0][k]\n dp[i][1][k] = dp[i - 1][1][k] + 9*dp[i - 1][1][k-1]\n\n#print(dp)\nprint(dp[m][0][K] + dp[m][1][K])\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s502170288', 's797095465', 's144791455'] | [9280.0, 9052.0, 9272.0] | [26.0, 24.0, 32.0] | [2146, 991, 979] |
p02781 | u363992934 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n_str = input()\nn = int(n_str)\nn_digit = len(n_str)\nk = int(input())\n\n\nMOD = 1000000007\n\n\nclass COM():\n def __init__(self, MAX, MOD):\n self.MOD = MOD\n self.MAX = MAX\n self.fac = [1] * MAX\n self.finv = [1] * MAX\n inv = [1] * MAX\n for i in range(2, MAX):\n self.fac[i] = self.fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n self.finv[i] = self.finv[i - 1] * inv[i] % MOD\n def calc_COM(self, n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n if self.MAX <= n:\n return 0\n return self.fac[n] * (self.finv[k] * self.finv[n - k] % self.MOD) % self.MOD\n def calc_PER(self, n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n if self.MAX <= n:\n return 0\n return self.fac[n] * self.finv[n - k] % self.MOD\n def calc_FAC(self, n):\n if self.MAX <= n:\n return 0\n return self.fac[n]\n\ncom = COM(100, MOD)\n\nans = 0\n\nif(n_digit > k):\n ans += com.calc_COM(n_digit-1, k) * (9 ** k)\n\nn_top = int(n_str[0])\nif(k-1 <= 0):\n \n print(ans)\n ans += n_top\nelse:\n \n ans += com.calc_COM(n_digit-1, k-1) * (9 ** (k-1)) * (n_top - 1)\n \n n_sec = 0\n count = 1\n for nc in n_str[1:]:\n n_sec = int(nc)\n if(n_sec > 0):\n break\n count += 1\n if((n_digit - count) >= k-1):\n \n left = n_digit - count\n \n ans += com.calc_COM(left-1, k-1) * (9 ** (k-1))\n \n if(k-2 <= 0):\n ans += n_sec \n else:\n \n ans += (left-1) * 9 * (n_sec - 1)\n \n sec_count = 1\n n_third = 0\n for nc in n_str[count:]:\n n_third = int(nc)\n if(n_sec > 0):\n break\n sec_count += 1\n if(left - sec_count >= k - 2):\n \n left_sec = left - sec_count\n \n ans += (left_sec-1) * 9\n \n ans += n_third\n\nprint(ans)\n', 'n_str = input()\nn = int(n_str)\nn_digit = len(n_str)\nk = int(input())\n\n\nMOD = 1000000007\n\n\nclass COM():\n def __init__(self, MAX, MOD):\n self.MOD = MOD\n self.MAX = MAX\n self.fac = [1] * MAX\n self.finv = [1] * MAX\n inv = [1] * MAX\n for i in range(2, MAX):\n self.fac[i] = self.fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n self.finv[i] = self.finv[i - 1] * inv[i] % MOD\n def calc_COM(self, n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n if self.MAX <= n:\n return 0\n return self.fac[n] * (self.finv[k] * self.finv[n - k] % self.MOD) % self.MOD\n def calc_PER(self, n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n if self.MAX <= n:\n return 0\n return self.fac[n] * self.finv[n - k] % self.MOD\n def calc_FAC(self, n):\n if self.MAX <= n:\n return 0\n return self.fac[n]\n\ncom = COM(100, MOD)\n\nans = 0\nif(n_digit < k):\n \n print(0)\nelse:\n \n ans += com.calc_COM(n_digit-1, k) * (9 ** k)\n \n n_top = int(n_str[0])\n if(k-1 <= 0):\n \n ans += n_top\n else:\n \n ans += (n_top - 1) * com.calc_COM(n_digit-1, k-1) * (9 ** (k-1))\n \n n_sec = 0\n count = n_digit\n i = 1\n for nc in n_str[1:]:\n i += 1\n count -= 1\n n_sec = int(nc)\n if(n_sec > 0):\n break\n if(count >= k-1):\n \n \n ans += 1 * com.calc_COM(count-1, k-1) * (9 ** (k-1))\n \n if(k-2 <= 0):\n ans += 1 * n_sec \n else:\n \n ans += 1 * (n_sec - 1) * com.calc_COM(count-1, k-2) * (9 ** (k-2))\n \n n_third = 0\n sec_count = count\n for nd in n_str[i:]:\n sec_count -= 1\n n_third = int(nd)\n if(n_third > 0):\n break\n if(sec_count >= k-2):\n \n \n ans += 1 * 1 * (sec_count-1) * 9\n \n ans += 1 * 1 * n_third\n\n print(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s315894824', 's199834762'] | [3192.0, 3192.0] | [19.0, 18.0] | [2943, 3196] |
p02781 | u365375535 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["from operator import mul\nfrom functools import reduce\n\ndef com(n,r):\n r = min(n-r,r)\n if r == 0: return 1\n over = reduce(mul, range(n, n - r, -1))\n under = reduce(mul, range(1,r + 1))\n return over // under\n\ndef run():\n N = int(input())\n K = int(input())\n Nnum = len(str(N))\n #1\n all1 = com(Nnum, K)*9**K\n #2\n all2 = (9-int(str(N)[0]))*com(Nnum-1, K-1)*9**(K-1)\n if K == 1:\n print(all1-all2)\n #3\n elif K == 2:\n all3 = 0\n for n in range(1, Nnum):\n N2 = int(str(N)[n])\n if N2 != 0:\n all3 += 9-N2\n break\n all3 += 9\n else:\n all3 = (Nnum-1)*9\n print(all1-all2-all3)\n #4\n else:\n all3 = 0\n count = 0\n for n in range(1, Nnum):\n N2 = int(str(N)[n])\n if N2 != 0:\n if count == 0:\n all3 += (9-N2)*com(Nnum-n-1, 1)*9\n elif count == 1:\n all3 += 9-N2\n count += 1\n if count == 2:\n break\n elif count == 0:\n all3 += 9*(Nnum-n-1)*9\n else:\n all3 += 9\n else:\n if count == 0:\n all3 = com(Nnum-1, 2)*9*9\n else\n all3 = (Nnum-1)*9\n print(all1-all2-all3)\n \n \n\nif __name__ == '__main__':\n run()", "def run():\n N = list(map(int, list(input())))\n K = int(input())\n Nlen = len(N)\n dp = [[[0]*(K+2) for _ in range(2)] for n in range(Nlen+1)]\n dp[0][0][0] = 1\n for nlen in range(Nlen):\n dN = N[nlen]\n for d in range(10):\n for j in range(2):\n for k in range(K+2):\n flagj = j or d < dN\n if (flagj == 0) and (d > dN): continue\n flagk = min(K+1, k+(d != 0))\n dp[nlen+1][flagj][flagk] += dp[nlen][j][k]\n print(dp[-1][0][K]+dp[-1][1][K])\n \nif __name__ == '__main__':\n run()"] | ['Runtime Error', 'Accepted'] | ['s879028460', 's942456003'] | [3064.0, 3064.0] | [18.0, 23.0] | [1177, 529] |
p02781 | u372501464 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N, K = map(int, input().split())\nP = list(map(int, input().split()))\nPe = [(i+1)/2 for i in P]\n\nmaxsum = -1\ncur = sum(Pe[0:K])\nmaxsum = cur\nfor i in range(1, N-K+1):\n cur = cur - Pe[i-1] + Pe[i+K-1]\n if cur > maxsum:\n maxsum = cur\n\nprint(maxsum)', 'from collections import defaultdict\nfrom functools import lru_cache\n\nN = input().strip()\nK = int(input().strip())\nlenN = len(N)\n\n\n@lru_cache(maxsize=None)\ndef f(keta, flag, k):\n if keta == lenN-1:\n if k == K:\n return 1\n else:\n return 0\n #if keta in memo and flag in memo[keta] and k in memo[keta][flag]:\n # return memo[keta][flag][k]\n nketa = keta + 1\n maxi = int(N[nketa]) if flag else 9\n res = 0\n for i in range(maxi+1):\n nflag = flag and (int(N[nketa]) == i)\n nk = k if i == 0 else k + 1\n if nk > K:\n continue\n res += f(nketa, nflag, nk)\n #memo[keta][flag][k] = res\n return res\n\nprint(f(-1, True, 0))\n'] | ['Runtime Error', 'Accepted'] | ['s306455383', 's365393859'] | [3064.0, 3820.0] | [17.0, 29.0] | [258, 775] |
p02781 | u373958718 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from functools import lru_cache\n@lru_cache(None)\nn=int(input())\nk=int(input())\ndef cal(n,k):\n if n<10:\n if k==0: return 1\n if k==1: return n\n return 0\n q,r=divmod(n,10)\n ret=0\n if k>=1:\n ret+=cal(q,k-1)*r\n ret+=cal(q-1,k-1)*(9-r)\n ret+=cal(q,k)\n return ret\n\nprint(cal(n,k))', 'from functools import lru_cache\nn=int(input())\nk=int(input())\n@lru_cache(None)\ndef cal(n,k):\n if n<10:\n if k==0: return 1\n if k==1: return n\n return 0\n q,r=divmod(n,10)\n ret=0\n if k>=1:\n ret+=cal(q,k-1)*r\n ret+=cal(q-1,k-1)*(9-r)\n ret+=cal(q,k)\n return ret\n\nprint(cal(n,k))'] | ['Runtime Error', 'Accepted'] | ['s719501497', 's821119299'] | [2940.0, 3940.0] | [17.0, 26.0] | [294, 294] |
p02781 | u401487574 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['##toketenaiiiiiiii!!!!!\n\ndef f(i,k):\n if i == 0:\n return 0\n num = int(s[-i])\n if k == 0: return 1\n if num==0:\n return ncr(i-1,k)*9**k\n return (num-1)* ncr(i-1,k-1)*9**(k-1)+ncr(i-1,k)*9**k\n\n\ndef g(i,k):\n if i == 0:\n if k==0:return 1\n else:return 0\n num = int(s[-i])\n if k == 0:\n if num ==0:return 1\n else:return 0\n\n if num==0:\n return f(i-1,k) +g(i-1,k)\n else:\n return f(i-1,k-1) + g(i-1,k-1)\n\n\n\ndef ncr(n,r):\n x = 1\n y = 1\n for i in range(r):\n x*=(n-i)\n y*=(i+1)\n return x//y\n\ns = input()\nk = int(input())\nl= len(s)\nprint(f(l,k)+g(l,k))\n', '\ndef f(i,k):\n if i == 0:\n return 0\n num = int(s[-i])\n if k == 0:\n if num ==0:return 0\n else: return 1\n if num==0:\n return 0\n return (num-1)* ncr(i-1,k-1)*9**(k-1)+ncr(i-1,k)*9**k\n\n\ndef g(i,k):\n if i == 0:\n if k==0:return 1\n else:return 0\n num = int(s[-i])\n if k == 0:\n if num ==0:return 1\n else:return 0\n\n if num==0:\n return f(i-1,k) +g(i-1,k)\n else:\n return f(i-1,k-1) + g(i-1,k-1)\n\n\n\ndef ncr(n,r):\n x = 1\n y = 1\n for i in range(r):\n x*=(n-i)\n y*=(i+1)\n return x//y\n\ns = input()\nk = int(input())\nl= len(s)\nprint(f(l,k)+g(l,k))\n'] | ['Wrong Answer', 'Accepted'] | ['s351535419', 's792282314'] | [3064.0, 3064.0] | [17.0, 18.0] | [727, 731] |
p02781 | u438662618 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n = input()\nk = int(input())\nl = len(n)\n\ndp = [[[0 for a in range(k+1)] for b in range(2)] for c in range(l+5)]\n\ndp[0][0][0] = 1\n#print(dp)\n\nfor a in range(l) :\n for b in range(2) :\n for c in range(k+1) :\n for d in range(10) :\n na = a\n nb = b\n nc = c\n if b == 0 :\n if d > int(n[a]) :\n continue\n if d < int(n[a]) :\n nb = 1\n if c == k and d > 0 :\n continue\n if d != 0 :\n nc += 1\n #print(a,b,c,na,nb,nc)\n dp[na+1][nb][nc] += dp[a][b][c]\n\n\nprint(dp[l][0][k])\nprint(dp[l][1][k])\nprint(dp[l][0][k]+dp[l][1][k])\n', 'import math\n\ndef combinations_count(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\nn = int(input())\nk = int(input())\n\nans = 0\n\nfor i in range(k, len(str(n))) :\n if k == i or k == 1:\n ans += 9**(k)\n continue\n ans += combinations_count(i-1, k) * 9**(k)\n\nprint(ans)\n', 'n = input()\nk = int(input())\nl = len(n)\n\ndp = [[[0 for a in range(k+1)] for b in range(2)] for c in range(l+5)]\n\ndp[0][0][0] = 1\n#print(dp)\n\nfor a in range(l) :\n for b in range(2) :\n for c in range(k+1) :\n for d in range(10) :\n na = a\n nb = b\n nc = c\n if b == 0 :\n if d > int(n[a]) :\n continue\n if d < int(n[a]) :\n nb = 1\n if c == k and d > 0 :\n continue\n if d != 0 :\n nc += 1\n #print(a,b,c,na,nb,nc)\n dp[na+1][nb][nc] += dp[a][b][c]\n\n#print(dp[l][0][k])\n#print(dp[l][1][k])\nprint(dp[l][0][k]+dp[l][1][k])\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s245694691', 's312621253', 's715541439'] | [3064.0, 3060.0, 3064.0] | [24.0, 17.0, 25.0] | [768, 320, 769] |
p02781 | u474423089 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from scipy.misc import comb\nN=input()\nK=int(input())\nif len(N)<K:\n print(0)\n exit()\nif K !=1:\n ans = 0\nelif len(N)<2:\n print(int(N))\n exit()\nelse:\n ans = 9\nfor i in range(2,len(N)):\n ans += 9*comb(i-1,K-1)*(9**(K-1))\nans += (int(N[0])-1)*comb(len(N)-1,K-1)*9**(K-1)\nif K==1:\n ans += 1\nelif K==2:\n ans += 9*(len(N)-2)+int(N[1])\nelse:\n ans += int(N[2])+(len(N)-3)*9+(int(N[1])-1)*(len(N)-2)*9+comb(len(N)-2,2)*81\nprint(ans)', 'from scipy.misc import comb\nimport math\nN=input()\nK=int(input())\nif K !=1:\n ans = 0\nelif len(N)<2:\n print(int(N))\n exit()\nelse:\n ans = 9\nfor i in range(2,len(N)):\n ans += 9*comb(i-1,K-1)*(9**(K-1))\nans += max(0,int(N[0])-1)*comb(len(N)-1,K-1)*9**(K-1)\nif K==1:\n ans += 1\nelif K==2:\n ans += 9*max(0,len(N)-2)+int(N[1])\nelse:\n ans += int(N[2])+max(0,len(N)-3)*9+max(0,int(N[1])-1)*max(0,len(N)-2)*9+comb(len(N)-2,2)*81\nprint(math.ceil(ans))', 'from scipy.misc import comb\nN=input()\nK=int(input())\nif len(N)<K:\n print(0)\n exit()\nif K !=1:\n ans = 0\nelif len(N)<2:\n print(int(N))\n exit()\nelse:\n ans = 9\nfor i in range(2,len(N)):\n ans += 9*comb(i-1,K-1)*(9**(K-1))\nans += (int(N[0])-1)*comb(len(N)-1,K-1)*9**(K-1)\nif K==1:\n ans += 1\nelif K==2:\n ans += 9*(len(N)-2)+int(N[1])\nelse:\n ans += int(N[2])+(len(N)-3)*9+(int(N[1])-1)*(len(N)-2)*9+comb(len(N)-2,2)*81\nprint(int(ans))', 'from scipy.misc import comb\nimport math\nN=input()\nK=int(input())\nif len(N)<K:\n print(0)\n exit()\nif K !=1:\n ans = 0\nelif len(N)<2:\n print(int(N))\n exit()\nelse:\n ans = 9\nfor i in range(2,len(N)):\n ans += 9*comb(i-1,K-1)*(9**(K-1))\nans += max(0,int(N[0])-1)*comb(len(N)-1,K-1)*9**(K-1)\nif K==1:\n ans += 1\nelif K==2:\n ans += 9*max(0,len(N)-2)+int(N[1])\nelse:\n ans += int(N[2])+max(0,len(N)-3)*9+max(0,int(N[1])-1)*max(0,len(N)-2)*9+comb(len(N)-2,2)*81\nprint(math.ceil(ans))', "N=input()\nK=int(input())\ndp_0 = [[0]*(len(N)) for i in range(K+1)]\ndp_1 = [[0]*(len(N)) for i in range(K+1)]\ndp_0[0][0]=1\ndp_0[1][0]=int(N[0])-1\ndp_1[1][0]=1\nfor i in range(len(N)-1):\n for j in range(K+1):\n if j==K:\n dp_0[j][i+1] += dp_0[j][i]\n elif j==0:\n dp_0[j][i+1] =dp_0[j][i]\n dp_0[j+1][i+1] += dp_0[j][i]*9\n else:\n dp_0[j][i+1] += dp_0[j][i]\n dp_0[j+1][i+1] += dp_0[j][i]*9\n if j != K and N[i+1] != '0':\n dp_0[j+1][i+1] += (int(N[i+1])-1)*dp_1[j][i]\n dp_0[j][i+1] += dp_1[j][i]\n dp_1[j+1][i+1] = dp_1[j][i]\n elif N[i+1] =='0':\n dp_1[j][i+1] = dp_1[j][i]\n else:\n\n dp_0[j][i+1] += dp_1[j][i]\n\nprint(dp_0[K][len(N)-1]+dp_1[K][len(N)-1])"] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s220781838', 's649166831', 's843873500', 's863250696', 's269042308'] | [14756.0, 15540.0, 14788.0, 13516.0, 3064.0] | [198.0, 165.0, 194.0, 166.0, 18.0] | [451, 462, 456, 499, 795] |
p02781 | u493130708 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = int(input())\nK = int(input())\n\ndef f(n,k):\n if k == 1:\n if n < 10:\n return n\n else:\n r = n%10\n m = (n-r)/10\n return f(m,1) + 9\n else:\n if n < 10:\n return 0\n else:\n r = n%10\n m = (n-r)/10\n return f(m,k) + f(m,k-1) * r + f(m-1,k-1) * (9-r)\n \nprint(f(N,K))', 'N = list(map(int,input()))\nK = int(input())\n\ndef f(n,k):\n if len(n) == 1:\n if k == 1:\n return n[0]\n else:\n return 0\n else:\n r = n[-1]\n m = n[:-1]\n m2 = m.copy()\n m2[-1] = m2[-1] - 1\n for i in range(len(m)):\n if m2[-i] < 0:\n m2[-i] += 10\n m2[-i-1] = m2[-i-1] - 1\n if k == 1:\n m = n[:-1]\n return f(m,1) + 9\n else:\n return f(m,k) + f(m,k-1) * r + f(m2,k-1) * (9-r)\n \nprint(f(N,K))'] | ['Wrong Answer', 'Accepted'] | ['s114276462', 's123456485'] | [3064.0, 3064.0] | [373.0, 1772.0] | [314, 453] |
p02781 | u509368316 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N=input()\nK=int(input())\nl=len(N)\ndp=[[0]*(l+1) for i in range(K+1)]\ndp[0][0]=1\nx=0\nfor i,n in enumerate(N):\n n=int(n)\n dp[0][i+1]=1\n if n==0:\n for j in range(1,K+1):\n dp[j][i+1]=dp[j][i]+dp[j-1][i]*9\n else:\n for j in range(1,K+1):\n dp[j][i+1]=dp[j][i]+dp[j-1][i]*9 if i-j>-1 else 0 if i-j<-1 else n if i==0 else (dp[j-1][i]-1)*9+n\nprint(dp[-1][-1])', 'N=input()\nK=int(input())\nl=len(N)\ndp=[[0]+[1]*l]+[[0]*(l+1) for i in range(K)]\ndp2=[[1]+[0]*l]+[[0]*(l+1) for i in range(K)]\nfor i,n in enumerate(N):\n n=int(n)\n for j in range(K):\n dp[j+1][i+1]=dp[j][i]*9+dp[j+1][i]+(dp2[j][i]*(n-1)+dp2[j+1][i] if n>0 else 0)\n dp2[j+1][i+1]=dp2[j][i] if n>0 else dp2[j+1][i]\nprint(dp[-1][-1]+dp2[-1][-1])'] | ['Runtime Error', 'Accepted'] | ['s417438886', 's996460758'] | [3064.0, 3064.0] | [17.0, 18.0] | [393, 358] |
p02781 | u515740713 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import sys \nsys.setrecursionlimit(10**6)\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nMOD = 10**9+7\nN = int(readline())\nK = int(readline())\n@lru_cache(None)\ndef f(N,K):\n if K == -1:\n return 0\n if N < 10:\n if K == 0:\n return 1\n elif K == 1:\n return N\n else:\n return 0\n ans = 0\n q, mod = divmod(N, 10)\n ans += f(q,K) + mod * f(q,K-1) + (9-mod) * f(q-1,K-1) \n return ans\nprint(f(N,K))', '# -*- coding: utf-8 -*-\nimport sys \nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nMOD = 10**9+7 \nN = readline().decode().rstrip()\nK = int(readline())\nL = len(N)\n\ndp = [[[0 for _ in range(2)] for _ in range(4)] for _ in range(L+1)]\ndp[0][0][0] = 1\nfor i in range(L):\n for j in range(4):\n for k in range(2):\n nd = int(N[i])\n for d in range(10):\n ni = i + 1; nj = j; nk = k\n if d != 0:\n nj += 1\n if nj > K:\n continue\n if k == 0:\n if d > nd:\n continue\n if d < nd:\n nk = 1\n dp[ni][nj][nk] += dp[i][j][k]\nprint(dp[L][K][0]+dp[L][K][1])'] | ['Runtime Error', 'Accepted'] | ['s222789408', 's163448684'] | [9148.0, 9292.0] | [24.0, 33.0] | [520, 826] |
p02781 | u523545435 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['def func(p):\n r=0\n for q in range(2,p-1):\n r+=q*(q-1)//2\n return r\n\nN=int(input())\nK=int(input())\n\nn=len(str(N))\nx=int(str(N)[0])\nl=0\ny=0\nz=0\nif n>=2:\n for i in range(1,n):\n if str(N)[i]==0:\n l+=1\n else:\n y=int(str(N)[i])\n if i<n-1:\n z=int(str(N)[i+1])\n\nprint(l,y)\n\ns=0\nif n-l-2>0:\n s=(n-l-1)*(n-l-2)//2\n\nans=0\n\nif K==1:\n ans=x+9*(n-1)\n\nelif K==2:\n ans=y+9*max(0,x-1)+9*max(0,n-l-2)+81*(n-2)*(n-1)//2\n\nelse:\n ans=y*z+x*81+x*81*s+729*func(n)\n\nprint(ans)\n\n\n\n\n', '#WA\n\n\n\nN=str(input())\nK=int(input())\nL=len(N)\n\n\nDP=[[[0]*5 for index1 in range(2)] for index2 in range(L+1)]\n\nDP[0][0][0]=1\n\n\n\nfor i in range(1,L+1):\n #smaller=1->smaller=1\n DP[i][1][4]+=DP[i-1][1][4]*10+DP[i-1][1][3]*9\n DP[i][1][3]+=DP[i-1][1][3]+DP[i-1][1][2]*9\n DP[i][1][2]+=DP[i-1][1][2]+DP[i-1][1][1]*9\n DP[i][1][1]+=DP[i-1][1][1]+DP[i-1][1][0]*9\n DP[i][1][0]+=DP[i-1][1][0]\n\n n=int(N[i-1])\n\n #smaller=0->smaller=1\n \n \n if n==1:\n DP[i][1][4]+=DP[i-1][0][4]\n DP[i][1][3]+=DP[i-1][0][3]\n DP[i][1][2]+=DP[i-1][0][2]\n DP[i][1][1]+=DP[i-1][0][1]\n DP[i][1][0]+=DP[i-1][0][0]\n elif n>=2:\n DP[i][1][4]+=DP[i-1][0][4]*n+DP[i-1][0][3]*(n-1)\n DP[i][1][3]+=DP[i-1][0][3]+DP[i-1][0][2]*(n-1)\n DP[i][1][2]+=DP[i-1][0][2]+DP[i-1][0][1]*(n-1)\n DP[i][1][1]+=DP[i-1][0][1]+DP[i-1][0][0]*(n-1)\n DP[i][1][0]+=DP[i-1][0][0]\n\n #smaller=0->smaller=0\n \n if n==0:\n DP[i][0][4]+=DP[i-1][0][4]\n DP[i][0][3]+=DP[i-1][0][3]\n DP[i][0][2]+=DP[i-1][0][2]\n DP[i][0][1]+=DP[i-1][0][1]\n DP[i][0][0]+=DP[i-1][0][0]\n else:\n DP[i][0][4]+=DP[i-1][0][4]+DP[i-1][0][3]\n DP[i][0][3]+=DP[i-1][0][2]\n DP[i][0][2]+=DP[i-1][0][1]\n DP[i][0][1]+=DP[i-1][0][0]\n\nprint(DP[L][0][K]+DP[L][1][K])\n\n'] | ['Wrong Answer', 'Accepted'] | ['s070929326', 's411052344'] | [3192.0, 3268.0] | [25.0, 19.0] | [550, 1573] |
p02781 | u557494880 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = int(input())\nK = int(input())\nS = str(N)\nn = len(S)\ndef c(x,y):\n X = 1\n Y = 1\n for i in range(y):\n X *= (x-i)\n Y *= (y-i)\n return X//Y\nk = 0\nans = 0\nfor i in range(n):\n if k > K:\n break\n x = int(S[i])\n y = n - 1 - i\n z = K - k\n if i == 0:\n ans += (x-1)*(9**(y-z))*c(y,z)\n continue\n if x == 0:\n k += 1\n continue\n if x == 1:\n if k == K:\n continue\n else:\n ans += (9**(y-z+1))*c(y,z-1)\n continue\n ans += (x-2)*(9**(y-z))*c(y,z)\n if k < K:\n ans += 9**(y-z+1)*c(y,z-1)\nprint(ans)', 'N = int(input())\nK = int(input())\nS = str(N)\nn = len(S)\ndef c(x,y):\n X = 1\n Y = 1\n for i in range(y):\n X *= (x-i)\n Y *= (y-i)\n return X//Y\nk = K\nans = 0\nfor i in range(n):\n if k < 0:\n break\n x = int(S[i])\n y = n - 1 - i\n if i == 0:\n k -= 1\n ans += (x-1)*(9**k)*(c(y,k))\n continue\n if x == 0:\n continue\n k -= 1\n if k >= 0:\n ans += (x-1)*(9**k)*(c(y,k))\n ans += (9**(k+1))*c(y,(k+1))\nfor i in range(1,n):\n if i < K:\n continue\n ans += (9**K)*c(i-1,K-1)\nprint(ans)', 'N = int(input())\nK = int(input())\nS = str(N)\nn = len(S)\ndef c(x,y):\n X = 1\n Y = 1\n for i in range(y):\n X *= (x-i)\n Y *= (y-i)\n return X//Y\nk = K\nans = 0\nfor i in range(n):\n if k < 0:\n break\n x = int(S[i])\n y = n - 1 - i\n if i == 0:\n k -= 1\n ans += (x-1)*(9**k)*(c(y,k))\n continue\n if x == 0:\n continue\n k -= 1\n if k >= 0:\n ans += (x-1)*(9**k)*(c(y,k))\n ans += (9**(k+1))*c(y,(k+1))\n if i == n-1:\n if k == 0:\n ans += 1\nfor i in range(1,n):\n if i < K:\n continue\n ans += (9**K)*c(i-1,K-1)\nprint(ans)', 'N = int(input())\nK = int(input())\nS = str(N)\nn = len(S)\ndef c(x,y):\n X = 1\n Y = 1\n for i in range(y):\n X *= (x-i)\n Y *= (y-i)\n return X//Y\nk = K\nans = 0\nfor i in range(n):\n if k < 0:\n break\n x = int(S[i])\n y = n - 1 - i\n if i == 0:\n k -= 1\n ans += (x-1)*(9**k)*(c(y,k))\n continue\n if x == 0:\n continue\n k -= 1\n if k >= 0:\n ans += (x-1)*(9**k)*(c(y,k))\n ans += (9**(k+1))*c(y,(k+1))\nif i == n-1:\n if k == 0:\n ans += 1\nfor i in range(1,n):\n if i < K:\n continue\n ans += (9**K)*c(i-1,K-1)\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s126993140', 's151519986', 's153973303', 's017626093'] | [3188.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0] | [619, 565, 622, 610] |
p02781 | u557565572 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['\nn = list(map(int, list(input())))\nk = int(input())\nl = len(n)\ndp0 = [[0]*(k+1) for _ in range(l+1)] \ndp1 = [[0]*(k+1) for _ in range(l+1)]\n\nfor i in range(1, l+1):\n dp0[i][0] = 1\n\ndp1[0][0] = 1\n\nfor i in range(l):\n for j in range(k):\n\n if n[i] > 0:\n\n dp0[i+1][j+1] = \\\n 9*dp0[i][j] + dp0[i][j+1] + dp1[i][j+1] + (n[i]-1)*dp1[i][j]\n dp1[i + 1][j + 1] = dp1[i][j]\n else:\n\n dp0[i+1][j+1] = \\\n 9*dp0[i][j] + dp0[i][j+1]\n dp1[i + 1][j + 1] = dp1[i][j + 1]\n\n\n\nprint(dp1[l][k])\nprint(dp0[l][k] + dp1[l][k])\n', '\nn = list(map(int, list(input())))\nk = int(input())\nl = len(n)\ndp0 = [[0]*(k+1) for _ in range(l+1)] \ndp1 = [[0]*(k+1) for _ in range(l+1)]\n\nfor i in range(1, l+1):\n dp0[i][0] = 1\n\ndp1[0][0] = 1\n\nfor i in range(l):\n for j in range(k):\n\n if n[i] > 0:\n\n dp0[i+1][j+1] = \\\n 9*dp0[i][j] + dp0[i][j+1] + dp1[i][j+1] + (n[i]-1)*dp1[i][j]\n dp1[i + 1][j + 1] = dp1[i][j]\n else:\n\n dp0[i+1][j+1] = \\\n 9*dp0[i][j] + dp0[i][j+1]\n dp1[i + 1][j + 1] = dp1[i][j + 1]\n\n\n\n# print(dp1[l][k])\nprint(dp0[l][k] + dp1[l][k])\n'] | ['Wrong Answer', 'Accepted'] | ['s158737684', 's618888214'] | [3064.0, 3192.0] | [18.0, 18.0] | [614, 616] |
p02781 | u584790715 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["rom math import factorial\n\n\ndef nCr(n, r):\n if r <= 0:\n return 0\n\n if n >= r:\n return factorial(n) // (factorial(n - r) * factorial(r))\n else:\n return 0\n\ndef main():\n N = input()\n K = int(input())\n\n ans = func(N, K)\n\n print(ans)\n\ndef func(N, K):\n if len(N) < K:\n return 0\n\n if K == 0:\n return 1\n\n n = int(N[0])\n\n if len(N) == 1:\n if K > 1:\n return 0\n else:\n return n\n\n ret = 0\n if K > 1:\n ret += func(N[1:], K-1)\n else:\n ret += 1\n l = len(N[1:])\n\n ret += (n - 1) * func('9' * l, K - 1)\n ret += func('9'* l, K)\n\n \n \n\n return ret\n \n\nif __name__ == '__main__':\n main()", "from math import factorial\n\n\ndef nCr(n, r):\n if r <= 0:\n return 0\n\n if n >= r:\n return factorial(n) // (factorial(n - r) * factorial(r))\n else:\n return 0\n\nN = input()\nK = int(input())\n\ndef rec(n, k, smaller):\n n = n.lstrip('0')\n\n if k == 0:\n return 1\n\n if len(n) < k:\n return 0\n\n if k == 1:\n if len(n) == 1:\n return int(n)\n\n\n if smaller:\n return nCr(len(n), k) * 9 ** k\n\n\n ret = 0\n ret += rec(n[1:], k-1, False)\n ret += rec('9'*(len(n)-1), k-1, True) * (int(n[0]) - 1)\n ret += rec('9'*(len(n)-1), k, True)\n\n return ret\n \nans = rec(N, K, False)\nprint(ans)\n\n"] | ['Runtime Error', 'Accepted'] | ['s571775138', 's815585102'] | [3064.0, 3064.0] | [18.0, 17.0] | [799, 658] |
p02781 | u600402037 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import sys\nfrom math import factorial\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nN = ir()\nK = ir()\nlength = 0\nfor i in range(1, 100):\n if 10 ** i > N:\n length = i\n break\n\nc = factorial(length) // factorial(K) // factorial(lenght-K)\nc_1 = factorial(length-1) // factorial(K-1) // factorial(lenght-K-1)\nprint(c)\nanswer = 0\ntop = int(str(N)[0])\nanswer = factorial(length-1) // factorial(K) // factorial(lenght-K-1) * 9 ** K \nanswer += factorial(length) // factorial(K) // factorial(lenght-K) * (top-1) * 9 ** K \nprint(answer)', '# coding: utf-8\nimport sys\nfrom functools import lru_cache\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nN = ir()\nK = ir()\n\n@lru_cache(None)\ndef solve(N, K):\n assert N >= 0\n if N < 10:\n if K == 0:\n return 1\n elif K == 1:\n return N\n else:\n return 0\n q, r = divmod(N, 10)\n ret = 0\n if K > 0:\n ret += solve(q, K-1) * r\n ret += solve(q-1, K-1) * (9-r)\n ret += solve(q, K) \n return ret\n\nanswer = solve(N, K)\nprint(answer)\n'] | ['Runtime Error', 'Accepted'] | ['s528672535', 's851076842'] | [3064.0, 3940.0] | [18.0, 26.0] | [658, 586] |
p02781 | u608088992 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import sys\n\ndef solve():\n input = sys.stdin.readline\n N = int(input())\n K = int(input())\n if N <= 1000:\n count = 0\n for i in range(1, N + 1):\n d = 0\n ci = i\n while ci > 0:\n d += (1 if ci % 10 > 0 else 0)\n ci //= 10\n if d == K: count += 1\n else:\n strN = str(N)\n dig = len(strN)\n DPsmall = [[0 for j in range(K + 1)] for i in range(dig)]\n DPsmall[0][0] = 1\n DPsmall[0][1] = int(strN[0]) - 1\n for i in range(1, dig):\n DPsmall[i][0] = 1\n for j in range(1, K + 1):\n DPsmall[i][j] += DPsmall[i-1][j-1] * 9 + DPsmall[i-1][j]\n \n DPlarge = [[0 for j in range(K + 1)] for i in range(dig)] \n DPlarge[0][0] = 1\n for i in range(1, dig):\n if strN[i] == "0": DPlarge[i][0] = DPlarge[i-1][0]\n else: DPlarge[i][0] = DPlarge[i-1][0] + 1\n for j in range(1, K + 1):\n if DPlarge[i-1][0] == j - 1: DPlarge[i][j] += (int(strN[i]) - 1 if strN[i] != "0" else 0)\n if DPlarge[i-1][0] == j: DPlarge[i][j] += (1 if strN[i] != "0" else 0)\n\n DPlarge[i][j] += DPlarge[i-1][j] \n if j > 1: DPlarge[i][j] += DPlarge[i-1][j-1] * 9 \n\n ans = DPsmall[dig-1][K] + DPlarge[dig-1][K]\n if DPlarge[dig-1][0] == K: ans += 1\n print(ans) \n #print(DPsmall)\n #print(DPlarge)\n\n return 0\n\nif __name__ == "__main__":\n solve()', 'import sys\n\ndef solve():\n input = sys.stdin.readline\n N = input().strip("\\n")\n K = int(input())\n dig = len(N)\n DP = [[0] * (K + 1) for _ in range(dig)]\n DP[0][0] = 1\n DP[0][1] = int(N[0]) - 1\n for i in range(1, dig):\n DP[i][1] = 9\n if N[i] != "0": \n DP[i][0] = DP[i-1][0] + 1\n if DP[i-1][0] <= K: DP[i][DP[i-1][0]] += 1\n if DP[i-1][0] <= K - 1: DP[i][DP[i-1][0] + 1] += int(N[i]) - 1 \n else: DP[i][0] = DP[i-1][0]\n for j in range(1, K): DP[i][j+1] += DP[i-1][j] * 9\n for j in range(1, K + 1): DP[i][j] += DP[i - 1][j]\n if DP[dig - 1][0] == K: DP[dig - 1][K] += 1\n print(DP[dig - 1][K])\n #print(DP)\n\n \n return 0\n\nif __name__ == "__main__":\n solve()'] | ['Wrong Answer', 'Accepted'] | ['s214721049', 's620681122'] | [3192.0, 3064.0] | [18.0, 18.0] | [1588, 769] |
p02781 | u619819312 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import numpy as np\nn=input()\nk=int(input())\ndp=np.zeros((len(n)+1,k+1,2))\ndp[0][0][0]=1\nfor i in range(1,len(n)+1):\n for j in range(int(n[i-1])):\n if j==0:\n dp[i][1]+=dp[i-1][0]\n else:\n dp[i][1][1:]+=dp[i-1][0][:-1]\n for j in range(10):\n if j==0:\n dp[i][1]+=dp[i-1][1]\n else:\n dp[i][1][1:]+=dp[i-1][1][:-1]\n if int(n[i-1])==0:\n dp[i][0]+=dp[i-1][0]\n else:\n dp[i][0][1:]+=dp[i-1][0][:-1]\nprint(dp[-1][0][-1]+dp[-1][1][-1])\n', 'n=input()\nk=int(input())\ndp=[[[0]*(k+1)for i in range(2)] for i in range(len(n)+1)]\ndp[0][0][0]=1\nfor i in range(1,len(n)+1):\n for j in range(int(n[i-1])):\n if j==0:\n for h in range(k+1):\n dp[i][1][h]+=dp[i-1][0][h]\n else:\n for h in range(k):\n dp[i][1][h+1]+=dp[i-1][0][h]\n for j in range(10):\n if j==0:\n for h in range(k+1):\n dp[i][1][h]+=dp[i-1][1][h]\n else:\n for h in range(k):\n dp[i][1][h+1]+=dp[i-1][1][h]\n if int(n[i-1])==0:\n for h in range(k+1):\n dp[i][0][h]+=dp[i-1][0][h]\n else:\n for h in range(k):\n dp[i][0][h+1]+=dp[i-1][0][h]\nprint(dp[-1][0][-1]+dp[-1][1][-1])'] | ['Wrong Answer', 'Accepted'] | ['s450075791', 's522709605'] | [12424.0, 3064.0] | [158.0, 20.0] | [520, 752] |
p02781 | u638456847 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['MOD = 10**9+7\nfac = [1, 1]\n\ndef prepare(n, mod):\n for i in range(2, n+1):\n fac.append((fac[-1] * i) % mod)\n\n\ndef modcmb(n, r, mod):\n if n < 0 or r < 0 or r > n:\n return 0\n\n return fac[n] * pow(fac[r], mod-2, mod) * pow(fac[n-r], mod-2, mod) % mod\n\n\ndef f(r, c):\n return modcmb(r+c, r, MOD)\n\n\ndef g(x, y):\n return ((y+2) * modcmb(x+y+2, x, MOD) - (x+1)) * pow(x+1, MOD-2, MOD)\n\n\ndef main():\n prepare(2*10**6+10, MOD)\n r1,c1,r2,c2 = map(int, input().split())\n\n ans = g(r2, c2) - g(r1-1, c2) - g(r2, c1-1) + g(r1-1, c1-1)\n ans %= MOD\n\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n', 'def f(n, k):\n \n # dp[i][smaller][j]\n \n \n n = str(n)\n L = len(n)\n\n dp = [[[0]*(k+2) for i in range(2)] for j in range(L+1)]\n dp[0][0][0] = 1\n\n for i in range(L):\n D = int(n[i])\n for smaller in range(2):\n for j in range(k+1):\n for d in range((9 if smaller else D)+1):\n dp[i+1][smaller or (d < D)][j + (d != 0)] += dp[i][smaller][j]\n\n return dp[L][0][k] + dp[L][1][k]\n\n\ndef main():\n N = int(input())\n K = int(input())\n\n print(f(N, K))\n\n\nif __name__ == "__main__":\n main()\n'] | ['Runtime Error', 'Accepted'] | ['s530854741', 's202409115'] | [82340.0, 3064.0] | [488.0, 20.0] | [628, 737] |
p02781 | u645487439 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['def solve(n,k) :\n if n <= 9 and k == 1 :\n return n\n elif n <= 9 and k >= 2 :\n return 0\n elif k == 0:\n return 0\n else :\n m = n //10\n r = n % 10\n return r * solve(m,k-1) + (9 - r) * solve(m-1,k-1) + solve(m,k)\n\nn = int(input())\nk = int(input())\nprint(solve(n,k))', 'def solve(n,k) :\n if n <= 9 and k == 1 :\n return n\n elif n <= 9 and k >= 2 :\n return 0\n else :\n m = n //10\n r = n % 10\n return r * solve(m,k-1) + (9 - r) * solve(m-1,k-1) + solve(m,k)\n\nn = int(input())\nk = int(input())\nprint(solve(n,k))\n', 'N = input()\nK = int(input())\nm = len(N)\ndp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]\ndp[0][0][0] = 1\n\nfor i in range(1, m + 1):\n l = int(N[i - 1])\n for k in range(K + 1):\n dp[i][1][k] += dp[i - 1][1][k]\n if l != 0:\n dp[i][1][k] += dp[i - 1][0][k]\n else:\n dp[i][0][k] += dp[i - 1][0][k]\n if k - 1 >= 0:\n dp[i][1][k] += 9 * dp[i - 1][1][k - 1]\n if l != 0:\n dp[i][0][k] += dp[i - 1][0][k - 1]\n dp[i][1][k] += (l - 1) * dp[i - 1][0][k - 1]\n\nprint(dp[m][0][K] + dp[m][1][K])\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s138677554', 's461085089', 's317464996'] | [3060.0, 3936.0, 3064.0] | [476.0, 73.0, 18.0] | [315, 282, 596] |
p02781 | u665038048 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = int(input())\nK = int(input())\n\ndef c(n,k):\n\tif k == 0:\n\t\treturn 1\n\telif k == 1:\n\t\treturn n\n\telif k == 2:\n\t\treturn n*(n-1)//2\n\telse:\n\t\treturn n*(n-1)*(n-2)//6\ndef f(N, K):\n\tif N == 0:\n\t\treturn 0\n\tdigit = len(str(N))\n\tret = 0\n\tif digit > K:\n\t\tret += c(digit-1, K) * (9 ** K)\n\ta = 10**(digit-1)\n\td = N // a\n\tret += (d-1) * c(digit-1, K-1) * (9 ** (K-1))\n\tret += f(N - d*a, K-1)\n\n\treturn ret\n\nprint(f(N,K))', 'N = int(input())\nK = int(input())\n\ndef c(n,k):\n\tif k == 0:\n\t\treturn 1\n\telif k == 1:\n\t\treturn n\n\telif k == 2:\n\t\treturn n*(n-1)//2\n\telse:\n\t\treturn n*(n-1)*(n-2)//6\ndef f(N, K):\n\tif N == 0 and K > 0:\n\t\treturn 0\n\n\tif K == 0:\n\t\treturn 1\n\tdigit = len(str(N))\n\tret = 0\n\tif digit > K:\n\t\tret += c(digit-1, K) * (9 ** K)\n\ta = 10**(digit-1)\n\td = N // a\n\tret += (d-1) * c(digit-1, K-1) * (9 ** (K-1))\n\tret += f(N - d*a, K-1)\n\n\treturn ret\n\nprint(f(N,K))\n'] | ['Wrong Answer', 'Accepted'] | ['s582464300', 's780150472'] | [3064.0, 3064.0] | [18.0, 17.0] | [406, 441] |
p02781 | u667084803 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = int(input())\nK = int(input())\nL = len(str(N))\n\ndef solve(num_str, k, smaller):\n if k > 0 and len(num_str) == L:\n return 0\n if k == 0 or num_str == "":\n return 1\n\n elif smaller:\n keta = len(num_str)\n if k == 1:\n return keta * 9\n elif k == 2:\n return keta * (keta-1)//2 * 9 * 9\n else:\n return keta * (keta-1) * (keta -2)//6 * 9 * 9 * 9\n else: \n num = int(num_str)\n num_str = str(num_str)\n top = int(num_str[0])\n if top:\n zero = solve(num_str[1:], k, True)\n non_zero = solve(num_str[1:], k-1, True) * (top - 1)\n just = solve(num_str[1:], k-1, False)\n return zero + non_zero + just\n else:\n return solve(num_str[1:], k, False)\nprint(solve(str(N), K, False))', 'N = int(input())\nK = int(input())\nL = len(str(N))\n\ndef solve(num_str, k, smaller):\n if num_str == "" and k > 0:\n return 0\n if k == 0 or num_str == "":\n return 1\n\n elif smaller:\n keta = len(num_str)\n if k == 1:\n return keta * 9\n elif k == 2:\n return keta * (keta-1)//2 * 9 * 9\n else:\n return keta * (keta-1) * (keta -2)//6 * 9 * 9 * 9\n else: \n num = int(num_str)\n num_str = str(num_str)\n top = int(num_str[0])\n if top:\n zero = solve(num_str[1:], k, True)\n non_zero = solve(num_str[1:], k-1, True) * (top - 1)\n just = solve(num_str[1:], k-1, False)\n return zero + non_zero + just\n else:\n return solve(num_str[1:], k, False)\nprint(solve(str(N), K, False))'] | ['Wrong Answer', 'Accepted'] | ['s535537072', 's950941425'] | [3064.0, 3064.0] | [17.0, 17.0] | [835, 831] |
p02781 | u670180528 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n=input()\nk=int(input())\ndp=[[[0]*(k+2) for _ in range(2)] for _ in range(len(n)+1)]\ndp[0][0][0]=1\nfor i,c in enumerate(n):\n\tfor f in range(2):\n\t\tfor j in range(k+1):\n\t\t\tfor l in range(10 if f else int(c)+1):\n\t\t\t\tdp[i+1][f or l<c][j+(l>0)]+=dp[i][f][j]\nprint(dp[-1][0][k]+dp[-1][1][k])', 'n=input()\nk=int(input())\ndp=[[[0]*(k+2) for _ in range(2)] for _ in range(len(n)+1)]\ndp[0][0][0]=1\nfor i,c in enumerate(n):\n\tc=int(c)\n\tfor f in range(2):\n\t\tfor j in range(k+1):\n\t\t\tfor l in range(10*f or c+1):\n\t\t\t\tdp[i+1][f or l<c][j+(l>0)]+=dp[i][f][j]\nprint(dp[-1][0][k]+dp[-1][1][k])'] | ['Runtime Error', 'Accepted'] | ['s100357129', 's308985980'] | [3064.0, 3064.0] | [17.0, 21.0] | [285, 285] |
p02781 | u686230543 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['def comb(n, k):\n if 0 <= k <= n:\n c = 1\n for i in range(k):\n c *= n-i\n c //= i+1\n return c\n else:\n return 0\n\nn = [int(i) for i in input()]\nl = len(n)\nk = int(input())\ncount = 0\nfor i in range(min(l, k+1)):\n count += 9 ** (k-i) * comb(l-i-1, k-i)\n count += 9 ** (k-i-1) * comb(l-i-1, k-i-1) * (n[i]-1)\nprint(count)', 'def comb(n, k):\n if 0 <= k <= n:\n c = 1\n for i in range(k):\n c *= n-i\n c //= i+1\n return c\n else:\n return 0\n\nn = [int(i) for i in input()]\nl = len(n)\nk = int(input())\nif l == k:\n count = 1\nelse:\n count = 0\nfor i in range(l):\n # n[:i] 0 {1..9}*k 0*(l-i-1-k)\n count += 9 ** k * comb(l-i-1, k)\n # n[:i] {1..(n[i]-1)} {1..9}*(k-1) 0*(l-i-1-k)\n if k >= 1 and n[i] > 1:\n count += 9 ** (k-1) * comb(l-i-1, k-1) * (n[i]-1)\n # Next is n[:i+1] {1..9}*(k-1) 0*(l-i-k)\n if n[i] > 0:\n k -= 1\n if k < 0:\n break\nprint(count)', 'def comb(n, k):\n c = 1\n for i in range(k):\n c *= n-i\n c //= i+1\n return c\n\nn = [int(i) for i in input()]\nl = len(n)\nk = int(input())\nif l == k:\n count = 1\nelse:\n count = 0\nfor i in range(l):\n # n[:i] 0 {1..9}*k 0*(l-i-1-k)\n count += 9 ** k * comb(l-i-1, k)\n # n[:i] {1..(n[i]-1)} {1..9}*(k-1) 0*(l-i-1-k)\n if k >= 1 and n[i] > 1:\n count += 9 ** (k-1) * comb(l-i-1, k-1) * (n[i]-1)\n else:\n break\n # Next is n[:i+1] {1..9}*(k-1) 0*(l-i-k)\n if n[i] > 0:\n k -= 1\nprint(count)', 'def comb(n, k):\n c = 1\n for i in range(k):\n c *= n-i\n c //= i+1\n return c\n\nn = [int(i) for i in input()]\nl = len(n)\nk = int(input())\nif l == k:\n count = 1\nelse:\n count = 0\nfor i in range(l):\n print(i, count)\n # n[:i] 0 {1..9}*k 0*(l-i-1-k)\n count += 9 ** k * comb(l-i-1, k)\n # n[:i] {1..(n[i]-1)} {1..9}*(k-1) 0*(l-i-1-k)\n if k >= 1:\n count += 9 ** (k-1) * comb(l-i-1, k-1) * (n[i]-1)\n else:\n break\n # Next is n[:i+1] {1..9}*(k-1) 0*(l-i-k)\n k -= 1\nprint(count)', 'def comb(n, k):\n c = 1\n for i in range(k):\n c *= n-i\n c //= i+1\n return c\n\nn = [int(i) for i in input()]\nl = len(n)\nk = int(input())\ncount = 0\nfor i in range(l):\n if n[i] > 0:\n # n[:i] 0 {1..9}*k 0*(l-i-1-k)\n count += 9 ** k * comb(l-i-1, k)\n # n[:i] {1..(n[i]-1)} {1..9}*(k-1) 0*(l-i-1-k)\n if k >= 1:\n count += 9 ** (k-1) * comb(l-i-1, k-1) * (n[i]-1)\n else:\n break\n # Next is n[:i+1] {1..9}*(k-1) 0*(l-i-k)\n k -= 1\n if i == l-1 and k == 0:\n count += 1\nprint(count)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s344819225', 's388353941', 's396127057', 's987305509', 's346421665'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [339, 551, 498, 486, 511] |
p02781 | u691018832 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(10 ** 7)\n\nfrom functools import lru_cache\n\nn, k = map(int, read().split())\n\n\n@lru_cache(None)\ndef check(n, k):\n a, b = divmod(n, 10)\n cnt = 0\n if k >= 1:\n cnt += check(a, k - 1) * b\n cnt += check(a - 1, k - 1) * (9 - b)\n cnt += check(a, b)\n return cnt\n\n\nif n < 10:\n if k == 1:\n print(n)\n else:\n print(0)\nelse:\n print(check(n, k))\n', 'import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\nsys.setrecursionlimit(10 ** 7)\n\nfrom functools import lru_cache\n\nn, k = map(int, read().split())\n\n\n@lru_cache()\ndef check(n, k):\n if n < 10:\n if k == 0:\n return 1\n if k == 1:\n return n\n return 0\n a, b = divmod(n, 10)\n cnt = 0\n if k >= 1:\n cnt += check(a, k - 1) * b\n cnt += check(a - 1, k - 1) * (9 - b)\n cnt += check(a, k)\n return cnt\n\n\nprint(check(n, k))\n'] | ['Runtime Error', 'Accepted'] | ['s745768302', 's174645094'] | [647012.0, 3812.0] | [1706.0, 267.0] | [520, 548] |
p02781 | u698176039 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["import sys \nN = list(input())\nK = int(input())\n\nL = len(N)\nif K>L:\n print(0)\n sys.exit()\n#%%\ndef cmb(l,k):\n if k<0 or l<0:\n return 0\n if k>L:\n return 0\n elif k==0 or l==0:\n return 1\n \n ret = l\n for i in range(k-1):\n ret *= (l-i-1)\n for i in range(k):\n ret //= (1+i)\n return ret\n\n\nans = 0\nK2 = K\nL2 = L\nfor i in range(L):\n if K2 < 0 or L2 < 0:\n break\n if N[i]=='0':\n L2 -= 1\n continue\n elif N[i]=='1':\n ans += 9**K2 * cmb(L2-1,K2)* int((L2-1)>0)\n else:\n ans += 9**K2 * cmb(L2-1,K2) * int((L2-1)>0)\n t = int(N[i])\n ans += (t-1)* 9**(K2-1) * cmb(L2-1,K2-1)\n print(i,L2,K2,ans)\n K2 -= 1\n L2 -= 1\n\nttmp = 0\nfor a in N:\n if a!='0':\n ttmp+=1\nif ttmp == K:\n ans += 1\nprint(int(ans))", "import sys \nN = list(input())\nK = int(input())\n\nL = len(N)\nif K>L:\n print(0)\n sys.exit()\n#%%\ndef cmb(l,k):\n if k<0 or l<0:\n return 0\n if k>L:\n return 0\n elif k==0 or l==0:\n return 1\n \n ret = l\n for i in range(k-1):\n ret *= (l-i-1)\n for i in range(k):\n ret //= (1+i)\n return ret\n\n\nans = 0\nK2 = K\nL2 = L\nfor i in range(L):\n if K2 < 0 or L2 < 0:\n break\n if N[i]=='0':\n L2 -= 1\n continue\n elif N[i]=='1':\n ans += 9**K2 * cmb(L2-1,K2)* int((L2-1)>0)\n else:\n ans += 9**K2 * cmb(L2-1,K2) * int((L2-1)>0)\n t = int(N[i])\n ans += (t-1)* 9**(K2-1) * cmb(L2-1,K2-1)\n K2 -= 1\n L2 -= 1\n\nttmp = 0\nfor a in N:\n if a!='0':\n ttmp+=1\nif ttmp == K:\n ans += 1\nprint(int(ans))"] | ['Wrong Answer', 'Accepted'] | ['s129426355', 's041010996'] | [3188.0, 3064.0] | [18.0, 18.0] | [822, 799] |
p02781 | u703442202 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n = str(input())\nk = int(input())\ndp = [[[0 for i in range(len(n))+1] for i in range(2)] for i in range(len(n))]\nfor a in range(len(n)):\n for b in range(2):\n for c in range(len(n)):\n for i in range(10):\n if b ==1:\n if i != 0:\n dp[a+1][1][c+1] += dp[a][1][c]\n else:\n dp[a+1][1][c] += dp[a][1][c]\n else:\n if n[a] > i and i ==0:\n dp[a+1][1][c] += dp[a][0][c]\n if n[a] > i and i != 0:\n dp[a+1][1][c+1] += dp[a][0][c]\n if n[a] == i and i ==0:\n dp[a+1][0][c] += dp[a][0][c]\n if n[a] == i and i !=0:\n dp[a+1][0][c+1] += dp[a][0][c]\nprint(dp) ', 'n = input()\nk = int(input())\ndp = [[[0 for i in range(len(n)+1)] for i in range(2)] for i in range(len(n)+1)]\ndp[0][0][0] = 1\nfor a in range(len(n)):\n for b in range(2):\n for c in range(len(n)):\n for i in range(10):\n if b ==1:\n if i != 0:\n dp[a+1][1][c+1] += dp[a][1][c]\n else:\n dp[a+1][1][c] += dp[a][1][c]\n else:\n if int(n[a]) > i and i ==0:\n dp[a+1][1][c] += dp[a][0][c]\n if int(n[a]) > i and i != 0:\n dp[a+1][1][c+1] += dp[a][0][c]\n if int(n[a]) == i and i ==0:\n dp[a+1][0][c] += dp[a][0][c]\n if int(n[a]) == i and i !=0:\n dp[a+1][0][c+1] += dp[a][0][c]\nif len(n) == 1:\n if k == 1:\n \t\tprint(int(n)) \n if k >= 2:\n print(0)\nelse:\n print(dp[-1][0][k] + dp[-1][1][k])\n', 'n = input()\nk = int(input())\ndp = [[[0 for i in range(k+1)] for i in range(2)] for i in range(len(n)+1)]\ndp[0][0][0] = 1\nfor a in range(len(n)):\n for b in range(2):\n for c in range(k+1):\n for i in range(10):\n if b ==1:\n if c ==k: \n if i == 0:\n dp[a+1][1][c] += dp[a][1][c]\n else:\n if i == 0:\n dp[a+1][1][c] += dp[a][1][c]\n else:\n dp[a+1][1][c+1] += dp[a][1][c]\n else:\n if int(n[a]) > i:\n if c == k:\n if i == 0:\n dp[a+1][1][c] += dp[a][0][c]\n else:\n if i == 0:\n dp[a+1][1][c] += dp[a][0][c]\n else:\n dp[a+1][1][c+1] += dp[a][0][c]\n if int(n[a]) == i:\n if c == k:\n if i == 0:\n dp[a+1][0][c] += dp[a][0][c]\n else:\n if i == 0:\n dp[a+1][0][c] += dp[a][0][c]\n else:\n dp[a+1][0][c+1] += dp[a][0][c]\n \n \nprint(dp[-1][0][-1] + dp[-1][1][-1])\n '] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s574905029', 's740666775', 's107460295'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 23.0] | [688, 824, 1106] |
p02781 | u708019102 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['print(1)', 'print(2)', 's = input()\nl = len(s)\nK = int(input())\ndef com(x,y):\n child = 1\n mother = 1\n for i in range(y):\n child = child * (x-i)\n mother = mother * (i+1)\n if x == 1 and y >=2:\n return 0\n else: \n return int(child / mother)\ntasumae = (9**K)*com(l-1,K) \nli = list(s)\ndoko = []\nif l < K:\n print(0)\n exit()\nif K == 1:\n print(tasumae+int(li[0]))\n exit()\nfor i in range(1,l):\n if li[i] != "0":\n doko.append(i)\nif K == 2:\n if not doko:\n print(tasumae)\n exit()\n ans = int(li[doko[0]]) + 9*(l-1-doko[0]) + tasumae + (int(li[0])-1)*com(l-1,1)*9\n print(ans)\n exit()\nif len(doko) = 0:\n print(tasumae)\n exit()\nans = (int(li[0])-1)*com(l-1,2)*(9**2) + (int(li[doko[0]])-1) * 9 * (l-1-doko[0]) + int(li[doko[1]]) + 9*(l-1-doko[1]) + com(l-1-doko[0],2)*(9**2) + tasumae\nprint(ans)', 'print(0)', 's = input()\nl = len(s)\nK = int(input())\ndef com(x,y):\n child = 1\n mother = 1\n for i in range(y):\n child = child * (x-i)\n mother = mother * (i+1)\n if x == 1 and y >=2:\n return 0\n else: \n return int(child / mother)\ntasumae = (9**K)*com(l-1,K) \nli = list(s)\ndoko = []\nif l < K:\n print(0)\n exit()\nif K == 1:\n print(tasumae+int(li[0]))\n exit()\nfor i in range(1,l):\n if li[i] != "0":\n doko.append(i)\nif K == 2:\n if not doko:\n print(tasumae)\n exit()\n ans = int(li[doko[0]]) + 9*(l-1-doko[0]) + tasumae + (int(li[0])-1)*com(l-1,1)*9\n print(ans)\n exit()\nif len(doko) == 0:\n print(tasumae)\n exit()\nif len(doko) == 1:\n ans = (int(li[0])-1)*com(l-1,2)*(9**2) + (int(li[doko[0]])-1) * 9 * (l-1-doko[0]) + com(l-1-doko[0],2)*(9**2) + tasumae\n print(ans)\n exit()\nans = (int(li[0])-1)*com(l-1,2)*(9**2) + (int(li[doko[0]])-1) * 9 * (l-1-doko[0]) + int(li[doko[1]]) + 9*(l-1-doko[1]) + com(l-1-doko[0],2)*(9**2) + tasumae\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s236081069', 's302658290', 's566560402', 's966364938', 's952996734'] | [2940.0, 2940.0, 3064.0, 2940.0, 3188.0] | [17.0, 17.0, 17.0, 22.0, 18.0] | [8, 8, 933, 8, 1103] |
p02781 | u708255304 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['N = int(input())\nK = int(input())\n\n\n# tmp = N\n\n# while tmp >= 10:\n# tmp //= 10\n\n\n\nif K > len(str(N)):\n print(0)\n exit()\n\nif K == 1: # done\n N = str(N)\n ans = (len(N)-1) * 9\n ans += int(N[0])\n print(ans)\n\nelif K == 2:\n N = str(N)\n \n ans = (len(N)-1) * (len(N)-2) * 9 * 9 // 2\n \n ans += 1 * int(N[1])\n \n ans += (int(N[0])-1) * 9\n \n ans += int(N[0]) * (len(N)-2) * 9\n print(ans)\nelif K == 3:\n N = str(N)\n \n ans = (((len(N)-1) * (len(N)-2) * (len(N)-3)) // 6) * (9**3) # done\n \n \n ans += 1 * 1 * int(N[2]) \n ans += 1 * 1 * (len(N)-3)*9 , 3桁目は選ばない\n ans += 1 * (int(N[1])-1) * (len(N)-2) * 9 \n \n ans += (int(N[0])-1) * 9 * (len(N)-2)*9\n \n ans += int(N[0]) * (len(N)-2) * (len(N)-3) // 2 * (9**2)\n print(ans)\n', 'N = int(input())\nK = int(input())\nN = str(N)\ndp = [[[0]*2 for _ in range(K+1)] for _ in range(len(N)+1)]\ndp[0][0][1] = 1 \n\nfor i in range(len(N)):\n x = int(N[i]) \n for j in range(K):\n \n dp[i+1][j+1][0] += dp[i][j][0]*9 \n dp[i+1][j][0] += dp[i][j][0] \n \n if x > 0:\n dp[i+1][j][0] += dp[i][j][1] \n dp[i+1][j+1][0] += dp[i][j][1]*(x-1) \n dp[i+1][j+1][1] += dp[i][j][1] \n else:\n \n dp[i+1][j][1] += dp[i][j][1] \n dp[i+1][K][0] += dp[i][K][0]\n dp[i+1][K][not x>0] += dp[i][K][1]\nprint(sum(dp[len(N)][K]))\n'] | ['Wrong Answer', 'Accepted'] | ['s550642749', 's082980186'] | [3064.0, 3192.0] | [18.0, 18.0] | [1502, 1096] |
p02781 | u711539583 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ["import math\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\nn = input()\nk = int(input())\n\ndef calc(i, k):\n return comb(len(n) - i - 1, k) * 9 ** k\n\ndef cnt(n):\n ret = 0\n for c in n:\n if c != '0':\n ret += 1\n return ret\n\nans = 0\n# if len(n) == k and cnt(n) == k:\n# ans +=1\n\nfor i in range(min(len(n), k)):\n if int(n[i]) == 0:\n continue\n if len(n)-i > k:\n print(calc(i, k))\n ans += calc(i, k)\n k -= 1\n if len(n)-i > k:\n ans += (int(n[i]) - 1) * calc(i, k)\n if k == 0:\n ans += 1\nprint(ans)\n", "import math\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\nn = input()\nk = int(input())\n\ndef calc(i, k):\n return comb(len(n) - i - 1, k) * 9 ** k\n\ndef cnt(n):\n ret = 0\n for c in n:\n if c != '0':\n ret += 1\n return ret\n\nans = 0\nif len(n) == k and cnt(n) == k:\n ans +=1\n\nfor i in range(len(n)):\n if len(n)-i > k:\n ans += calc(i, k)\n if int(n[i]) == 0:\n continue\n k -= 1\n if k < 0:\n break\n if len(n)-i > k:\n ans += (int(n[i]) - 1) * calc(i, k)\n\nprint(ans)\n", 'import math\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\nn = input()\nk = int(input())\n\ndef calc(i, k):\n return comb(len(n) - i - 1, k) * 9 ** k\n\ndef cnt(n):\n cnt = 0\n for c in n:\n if c != "0":\n cnt += 1\n return cnt\n\nans = 0\nif cnt(n) == k:\n ans += 1\n\n\nfor i in range(len(n)):\n if int(n[i]) == 0:\n continue\n if len(n)-i > k:\n ans += calc(i, k)\n k -= 1\n if k < 0:\n break\n if len(n)-i > k:\n ans += (int(n[i]) - 1) * calc(i, k)\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s783250887', 's906113614', 's786835078'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [615, 574, 559] |
p02781 | u731448038 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['n = int(input())\nk = int(input())\n\nfrom scipy.misc import comb\nfrom math import factorial\n\nn_d = len(str(n))\ndigits = str(n)\n\ndef get_num(top, k_val, d_num):\n #print(top, k_val, d_num)\n if d_num>n_d:\n return 1\n elif k_val==0:\n return 1\n elif top:\n below1 = get_num(True, k_val-1, d_num+1)\n below2 = (int(digits[d_num])-1) * get_num(False, k_val-1, d_num+1)\n below3 = get_num(False, k_val, d_num+1)\n return below1 + below2 + below3\n else:\n return factorial(n_d-d_num) / factorial(k_val) / factorial(n_d - d_num - k_val) * 9**(k_val)\n #return comb(n_d-d_num, k_val) * 9**(k_val)\n\n\n\nif k<n_d :\n #a = comb(n_d-1, k)\n a = factorial(n_d-1) / factorial(k) / factorial(n_d-1 - k)\nelse:\n a = 0\na *= 9**k\n\nc1 = get_num(True, k-1, 1)\nc2 = (int(digits[0]) - 1) * get_num(False, k-1, 1)\n\n#print(a, c1, c2)\nprint(int(a+c1+c2))', 'N= int(input())\nK= int(input())\n\nfrom math import factorial\n\nstr_n = str(N)\nlen_n = len(str(str_n))\n\ndef conb(n, r):\n return factorial(n)//factorial(r)//factorial(n-r)\n \ndef get_num(top, k_val, depth):\n if k_val==0:\n return 1\n elif k_val>(len_n-depth+1):\n return 0\n elif top:\n if int(str_n[depth - 1])==0:\n return get_num(top, k_val, depth + 1)\n else:\n b1 = get_num(top, k_val - 1, depth + 1)\n b2 = (int(str_n[depth-1])-1) * get_num(False, k_val-1, depth+1)\n b3 = get_num(False, k_val, depth + 1)\n return b1+b2+b3\n else:\n return 9**(k_val) * conb(len_n - depth + 1, k_val)\n \n \na1 = get_num(True, K-1, 2)\na2 = (int(str_n[0])-1)*get_num(False, K-1, 2)\na3 = get_num(False, K, 2)\n\n#print(a1, a2, a3)\nprint(a1+a2+a3)'] | ['Runtime Error', 'Accepted'] | ['s070943783', 's350033296'] | [13252.0, 3064.0] | [161.0, 18.0] | [899, 825] |
p02781 | u736848749 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from math import factorial\nN=int(input())\nK=int(input())\n#N,K = int(314159),int(3)\nS = list(map(int,str(N)))\nans = 0\nl = len(S)\n\ndef C(n,r):\n if n >= r:\n return factorial(n) // (factorial(n - r) * factorial(r))\n else:\n return 0\n\ndef D(i,j): \n return (9**j)*C(i,j)\n\nfor i in range(l):\n if K >= 1:\n ans = ans + (int(S[i])-1)*D(l-1,K-1) + D(l-1,K)\n K -= 1\n l -= 1\n else:\n ans += 1\n break\n\nif ans != 0:\n ans += 1\n\nprint(ans)', 'from math import factorial\nN=int(input())\nK=int(input())\nS = list(map(int,str(N))) \nans = 0\nk = K\nl = len(S) \n\ndef C(n,r): \n if n >= r:\n return factorial(n) // (factorial(n - r) * factorial(r))\n else:\n return 0\n\ndef D(i,j): \n return (9**j)*C(i,j)\n\nif K > len(S):\n print(0)\n exit()\n\nfor i in range(l):\n if k >= 1 and l != 1:\n if int(S[i]) != 0:\n ans = ans + (int(S[i])-1)*D(l-1,k-1) + D(l-1,k)\n k -= 1\n l -= 1\n else:\n if K == len(S):\n print(0)\n exit()\n else:\n l -= 1\n elif k == 1 and l == 1:\n ans = ans + int(S[i]) + D(l-1,k)\n k -= 1\n l -= 1\n else: \n break\n\nprint(ans)', "from math import factorial\nN=int(input())\nK=int(input())\n#N,K = int(314159),int(3)\nS = list(map(int,str(N)))\n\ndef C(n,r): \n return factorial(n) // (factorial(n - r) * factorial(r))\n\ndef D(i,j): \n return (9**j)*C(i,j)\n\nans = 0\nl = len(S)\nfor i in range(l):\n if K >= 1:\n print('K',K)\n print((int(S[i])-1)*D(l-1,K-1))\n print(D(l-1,K))\n ans = ans + (int(S[i])-1)*D(l-1,K-1) + D(l-1,K)\n K -= 1\n l -= 1\n else:\n ans += 1\n break\nprint(ans)\n", 'from math import factorial\nN = int(input())\nK = int(input())\nS = list(map(int,str(N))) \nans = 0\ndigit = len(S)\nk = K\n\ndef D(i,j): \n if i >= j:\n return (9**j) * (factorial(i) // (factorial(i - j) * factorial(j)))\n else:\n return 0\n\nif K > len(S):\n print(0)\n exit()\n\nfor i in range(digit):\n digit -= 1\n if int(S[i]) == 0:\n if K == len(S):\n print(0)\n exit()\n continue\n ans += D(digit,k)\n k -= 1\n if k == 0:\n ans += S[i]\n break\n ans += (int(S[i]-1))*D(digit,k)\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s333173559', 's871418231', 's904552154', 's122664999'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0, 18.0] | [487, 782, 500, 568] |
p02781 | u765386817 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['\ndef dyn(n,d00,d01,d02,d03,d10,d11,d12,d13):\n D00 = d00 + d10*int(n != 0)\n D10 = d10*int(n==0)\n D01 = d00*9 + d10*(n-1+int(n==0)) + d01 + d11*int(n!=0)\n D11 = d10*(int(n!=0)) + d11*(int(n==0))\n D02 = d01*9 + d11*(n-1+int(n==0)) + d02 + d12*int(n!=0)\n D12 = d11*(int(n!=0)) + d12*(int(n==0))\n D03 = d02*9 + d11*(n-1+int(n==0)) + d03 + d13*int(n!=0)\n D13 = d12*(int(n!=0)) + d13*(int(n==0))\n return D00,D01,D02,D03,D10,D11,D12,D13\n\nN = str(input())\nK = int(input())\nS = len(N)\nD00=0\nD01=0\nD02=0\nD03=0\nD10=1\nD11=0\nD12=0\nD13=0\n\nfor i in range(S):\n [D00,D01,D02,D03,D10,D11,D12,D13] = dyn(int(N[i]),D00,D01,D02,D03,D10,D11,D12,D13)\n print(int(N[i]),D00,D01,D02,D03,D10,D11,D12,D13)\nif K == 1:\n print(D01+D11)\nelif K==2:\n print(D02+D12)\nelse:\n print(D03+D13)\n', '\ndef dyn(n,d00,d01,d02,d03,d10,d11,d12,d13):\n D00 = d00 + d10*int(n != 0)\n D10 = d10*int(n==0)\n D01 = d00*9 + d10*(n-1+int(n==0)) + d01 + d11*int(n!=0)\n D11 = d10*(int(n!=0)) + d11*(int(n==0))\n D02 = d01*9 + d11*(n-1+int(n==0)) + d02 + d12*int(n!=0)\n D12 = d11*(int(n!=0)) + d12*(int(n==0))\n D03 = d02*9 + d12*(n-1+int(n==0)) + d03 + d13*int(n!=0)\n D13 = d12*(int(n!=0)) + d13*(int(n==0))\n return D00,D01,D02,D03,D10,D11,D12,D13\n\nN = str(input())\nK = int(input())\nS = len(N)\nD00=0\nD01=0\nD02=0\nD03=0\nD10=1\nD11=0\nD12=0\nD13=0\n\nfor i in range(S):\n [D00,D01,D02,D03,D10,D11,D12,D13] = dyn(int(N[i]),D00,D01,D02,D03,D10,D11,D12,D13)\n #print(int(N[i]),D00,D01,D02,D03,D10,D11,D12,D13)\nif K == 1:\n print(D01+D11)\nelif K==2:\n print(D02+D12)\nelse:\n print(D03+D13)\n'] | ['Wrong Answer', 'Accepted'] | ['s133772221', 's023442094'] | [3188.0, 3064.0] | [19.0, 17.0] | [795, 796] |
p02781 | u771365068 | 2,000 | 1,048,576 | Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits when written in base ten. | ['from scipy.misc import comb\n\ndef solve_one(N):\n N_len = len(N)\n ans = N[0] + 9 * (N_len-1)\n return ans\n\ndef solve_two(N):\n N_len = len(N)\n non_zero_index = 0\n index = 1\n while index < N_len:\n if N[index] != 0:\n non_zero_index = index\n break\n index += 1\n ans = N[non_zero_index] + 9 * len(N[non_zero_index+1:]) \n \n # 1~N[0]-1\n ans += (N[0]-1) * 9 *(N_len-1)\n \n for i in range(1,N_len-1):\n ans += 9*9*i\n return ans\n\nN = list(map(int, input()))\nK = int(input())\n\nN_len = len(N)\n\nans = 0\nif K == 1:\n ans = solve_one(N)\nelif K == 2:\n if N_len >= 2:\n ans = solve_two(N)\nelif K == 3:\n if N_len >= 3:\n non_zero_index = [0] * 2\n index = 1\n count = 0\n while count < 2 and index < N_len:\n if N[index] != 0:\n non_zero_index[count] = index\n count += 1\n index += 1\n \n if non_zero_index[1] < N_len:\n ans = N[non_zero_index[1]] + 9 * len(N[non_zero_index[1]+1:]) \n # N[0], 1~N[1]-1\n ans += max(N[non_zero_index[0]]-1,0) * 9 * len(N[non_zero_index[0]+1:])\n # N[0], N[1] == 0\n ans += solve_two(N[non_zero_index[1]:])\n # 1~N[0]-1\n ans += (N[0]-1) * 9**2 * comb(N_len-1,2,exact=True) \n \n # N[0] = 0\n for i in range(2,N_len-1):\n ans += 9**3 * comb(i,2,exact=True)\n\n\nprint(ans)', 'from scipy.misc import comb\n\nN = input()\nK = int(input())\n\nN_len = len(N)\n\nans = 0\nif K == 1:\n ans = int(N[0]) + 9 * (N_len-1)\nelif K == 2:\n if N_len >= 2:\n ans = (int(N[0])-1) * 9 *(N_len-1)\n ans += int(N[1]) + 9 * (N_len-2)\n for i in range(1,N_len-1):\n ans += 9*9*i\nelif K == 3:\n if N_len >= 3:\n # N[0],N[1]\n ans = int(N[2]) + 9 * (N_len-3)\n # N[0], 1~N[1]-1\n ans += max(int(N[1])-1,0) * 9 * (N_len-2)\n # N[0], N[1] = 0\n ans += 9**2 * comb(N_len-2,2,exact=True)\n # 1~N[0]-1\n ans += (int(N[0])-1) * 9**2 * comb(N_len-1,2,exact=True) \n # N[0] = 0\n for i in range(2,N_len-1):\n ans += 9**3 * comb(i,2,exact=True)\n\n\n#print(9**3*comb(N_len,3,exact=True))\nprint(ans)', 'from scipy.misc import comb\n\nN = input()\nK = int(input())\n\nN_len = len(N)\n\nans = 0\nif K == 1:\n ans = int(N[0]) + 9 * (N_len-1)\nelif K == 2:\n if N_len >= 2:\n ans = (int(N[0])-1) * 9 *(N_len-1)\n ans += int(N[1]) + 9 * (N_len-2)\n for i in range(1,N_len-1):\n ans += 9*9*i\nelif K == 3:\n if N_len >= 3:\n # N[0],N[1]\n if int(N[1]) != 0:\n ans = int(N[2]) + 9 * (N_len-3)\n \n # N[0], 1~N[1]-1\n ans += max(int(N[1])-1,0) * 9 * (N_len-2)\n \n # N[0], N[1] = 0\n ans += 9**2 * comb(N_len-2,2,exact=True)\n \n # 1~N[0]-1\n ans += (int(N[0])-1) * 9**2 * comb(N_len-1,2,exact=True) \n \n # N[0] = 0\n for i in range(2,N_len-1):\n ans += 9**3 * comb(i,2,exact=True)\n\n\n#print(9**3*comb(N_len,3,exact=True))\nprint(ans)', 'from scipy.misc import comb\nimport time\n\nN = input()\nK = int(input())\n\nN_len = len(N)\n\nans = 0\nif K == 1:\n \ttime.sleep(0.5)\n ans = int(N[0]) + 9 * (N_len-1)\nelif K == 2:\n \ttime.sleep(1)\n if N_len >= 2:\n ans = (int(N[0])-1) * 9 *(N_len-1)\n ans += int(N[1]) + 9 * (N_len-2)\n for i in range(1,N_len-1):\n ans += 9*9*i\nelif K == 3:\n \ttime.sleep(1.5)\n if N_len >= 3:\n # N[0],N[1]\n ans = int(N[2]) + 9 * (N_len-3)\n # N[0], 1~N[1]-1\n ans += max(int(N[1])-1,0) * 9 * (N_len-2)\n # N[0], N[1] = 0\n ans += 9**2 * comb(N_len-2,2,exact=True)\n # 1~N[0]-1\n ans += (int(N[0])-1) * 9**2 * comb(N_len-1,2,exact=True) \n # N[0] = 0\n for i in range(2,N_len-1):\n ans += 9**3 * comb(i,2,exact=True)\n\n\n#print(9**3*comb(N_len,3,exact=True))\nprint(ans)\n', 'from scipy.misc import comb\nimport time\n\nN = input()\nK = int(input())\n\nN_len = len(N)\n\nans = 0\nif K == 1:\n time.sleep(0.3)\n ans = int(N[0]) + 9 * (N_len-1)\nelif K == 2:\n time.sleep(0.6)\n if N_len >= 2:\n ans = (int(N[0])-1) * 9 *(N_len-1)\n ans += int(N[1]) + 9 * (N_len-2)\n for i in range(1,N_len-1):\n ans += 9*9*i\nelif K == 3:\n time.sleep(0.9)\n if N_len >= 3:\n # N[0],N[1]\n ans = int(N[2]) + 9 * (N_len-3)\n # N[0], 1~N[1]-1\n ans += max(int(N[1])-1,0) * 9 * (N_len-2)\n # N[0], N[1] = 0\n ans += 9**2 * comb(N_len-2,2,exact=True)\n # 1~N[0]-1\n ans += (int(N[0])-1) * 9**2 * comb(N_len-1,2,exact=True) \n # N[0] = 0\n for i in range(2,N_len-1):\n ans += 9**3 * comb(i,2,exact=True)\n\n\n#print(9**3*comb(N_len,3,exact=True))\nprint(ans)\n', "from scipy.misc import comb\n\nN = list(map(int, input()))\nK = int(input())\n\nN_len = len(N)\n\nans = 0\nif K == 1:\n ans = N[0] + 9 * (N_len-1)\nelif K == 2:\n if N_len >= 2:\n non_zero_index = 0\n index = 1\n while index < N_len:\n if N[index] != 0:\n non_zero_index = index\n break\n index += 1\n ans = N[non_zero_index] + 9 * len(N[non_zero_index+1:]) \n \n # 1~N[0]-1\n ans += (N[0]-1) * 9 *(N_len-1)\n \n for i in range(1,N_len-1):\n ans += 9*9*i\nelif K == 3:\n if N_len >= 3:\n non_zero_index = [0] * 2\n index = 1\n count = 0\n while count < 2 and index < N_len:\n if N[index] != 0:\n non_zero_index[count] = index\n count += 1\n index += 1\n \n #print(f'index {index}')\n if index <= N_len-2:\n ans = N[non_zero_index[1]] + 9 * len(N[non_zero_index[1]+1:]) \n \n # N[0], 1~N[1]-1\n ans += max(N[non_zero_index[0]]-1,0) * 9 * len(N[non_zero_index[0]+1:])\n \n ans += 9**2 * comb(len(N[non_zero_index[1]:]),2,exact=True)\n # 1~N[0]-1\n ans += (N[0]-1) * 9**2 * comb(N_len-1,2,exact=True) \n \n # N[0] = 0\n for i in range(2,N_len-1):\n ans += 9**3 * comb(i,2,exact=True)\n\n\n#print(9**3*comb(N_len,3,exact=True))\nprint(ans)\n#print(f'diff {9**3*comb(N_len,3,exact=True)-ans}')", 'import numpy as np\n\ndp = np.zeros((105,4,2),dtype=np.int32)\n\ns = input()\nn = len(s)\nK = int(input())\n\ndp[0][0][0] = 1\nfor i in range(n):\n for j in range(4):\n for k in range(2):\n nd = int(s[i])\n for d in range(10):\n ni = i + 1\n nj = j \n nk = k\n if d != 0:\n nj += 1\n if nj > K:\n continue\n if k == 0:\n if d > nd:\n continue\n if d < nd:\n nk = 1\n dp[ni][nj][nk] += dp[i][j][k]\nans = dp[n][K][0] + dp[n][K][1]\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s107591124', 's222473860', 's368567588', 's478507260', 's834456469', 's984096042', 's495351558'] | [14416.0, 13272.0, 14084.0, 2940.0, 13264.0, 23536.0, 13308.0] | [188.0, 163.0, 184.0, 18.0, 1059.0, 355.0, 165.0] | [1522, 787, 934, 855, 860, 1588, 672] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.