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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02660 | u460980455 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\nn=int(input())\nnoso=[]\ncount=0\nif n==1:\n count=0\nelif sosu(n)==1:\n count=1\nelse:\n for x in range(2,int(n/2)+2):\n if x>n:\n break\n if x in noso:\n pass\n elif x<=10:\n xx=x\n while n%xx==0:\n noso.append... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s118139828', 's447617452', 's273979940'] | [9204.0, 9088.0, 9244.0] | [26.0, 20.0, 91.0] | [556, 762, 759] |
p02660 | u462192060 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from sys import stdin\n\ndef main():\n read = stdin.readline\n N =int(read())\n count = 0\n start = 2\n while(1):\n if N <= start:\n break\n for i in range(start,N+1):\n if N%i == 0:\n count += 1\n N = N//i\n start = i+1\n break\n print(count)\n \n \n\n \... | ['Wrong Answer', 'Accepted'] | ['s860315871', 's375468575'] | [9176.0, 9260.0] | [2206.0, 160.0] | [339, 775] |
p02660 | u464205401 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n=int(input())\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n if temp!=1:\n arr.append([temp, 1]... | ['Wrong Answer', 'Accepted'] | ['s056911039', 's109282256'] | [9500.0, 9328.0] | [109.0, 112.0] | [541, 542] |
p02660 | u465101448 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from collections import Counter\n\nN=int(input())\nN_=N\nf_=[]\nfor n in range(2,int(N**(1/2))+2): \n while N_ % n==0: \n N_=int(N_/n)\n f_.append(n)\n \nif len(f_) == 0:\n f_.append(N)\n \n\nC=Counter(f_)\nans=0\nfor c in C.keys():\n for c_ in range(1,C[c]+1):\n if N % c**c... | ['Wrong Answer', 'Accepted'] | ['s408611957', 's651095370'] | [9624.0, 9576.0] | [147.0, 161.0] | [385, 381] |
p02660 | u474561976 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import io,sys\nsys.setrecursionlimit(10**6)\n\ndef prime(n):\n nums = [True]*n\n primes = []\n for i in range(2,n):\n if nums[i]:\n primes.append(i)\n for j in range(2*i,n,i):\n nums[j] = False\n return primes\n\ndef main():\n from collections import Counter\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s211037141', 's916592895', 's527319588'] | [20440.0, 20568.0, 20268.0] | [209.0, 2206.0, 239.0] | [1025, 1111, 627] |
p02660 | u474925961 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ["import sys\n\nif sys.platform =='ios':\n sys.stdin=open('input_file.txt')\n \nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nn=int(input())\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if... | ['Runtime Error', 'Accepted'] | ['s058719627', 's087349057'] | [9108.0, 9524.0] | [26.0, 106.0] | [706, 707] |
p02660 | u479719434 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from math import sqrt\nfrom bisect import bisect\n\n\ndef main():\n N = int(input())\n factor = {}\n max_count = 1\n while N > 1:\n for i in range(2, int(sqrt(N))):\n if N % i == 0:\n N = N // i\n if i in factor:\n factor[i] += 1\n ... | ['Wrong Answer', 'Accepted'] | ['s288337355', 's068743234'] | [9168.0, 9228.0] | [113.0, 110.0] | [896, 901] |
p02660 | u482157295 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\ndum = prime_factorize(int(inpu... | ['Runtime Error', 'Accepted'] | ['s916466362', 's248987384'] | [9260.0, 9232.0] | [90.0, 101.0] | [546, 608] |
p02660 | u483391772 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\nn = int(input())\narr = []\ntemp = n\nfor i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append(cnt)\n\nif temp!=1:\n arr.append(1)\nif arr==[]:\n arr.append(1)\nfor i in range(len(arr)):\n ... | ['Runtime Error', 'Accepted'] | ['s311678836', 's330354042'] | [9084.0, 9492.0] | [21.0, 109.0] | [460, 600] |
p02660 | u485979475 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import sys\nn=int(input())\n\nif n == 1:\n print(0)\n sys.exit()\n\norgn=n\ncounter=0\nfor i in range(2,int((n**0.5) + 1) ):\n if n % i == 0:\n counter += 1\n n //= i\n wari=i**2\n while n % wari == 0:\n counter +=1\n n //= wari\n wari *= i\n ... | ['Wrong Answer', 'Accepted'] | ['s883002065', 's996931612'] | [9468.0, 9464.0] | [145.0, 146.0] | [433, 447] |
p02660 | u487767879 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\nfrom collections import Counter\nA= int(input())\nresArray = []\ntmpA = A\ni = 1\nwhile i <= math.sqrt(A):\n #print (i)\n i += 1\n if tmpA == 1:\n break\n\n if i >2 and i %2 == 0:\n continue\n\n\n while tmpA % i == 0:\n tmpA = tmpA / i\n resArray.append(i)\n\nre... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s041361058', 's119387549', 's851182995', 's920152792', 's555896662'] | [9068.0, 9540.0, 17052.0, 16968.0, 9400.0] | [24.0, 351.0, 246.0, 245.0, 370.0] | [553, 544, 469, 452, 589] |
p02660 | u489762173 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\n\nN = int(input())\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n ... | ['Wrong Answer', 'Accepted'] | ['s481218548', 's375193956'] | [9496.0, 9468.0] | [92.0, 92.0] | [686, 677] |
p02660 | u494037809 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def solve(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1])\n\n if arr==[]:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s379708779', 's838389233', 's260495820'] | [9424.0, 9208.0, 9448.0] | [110.0, 21.0, 109.0] | [377, 399, 518] |
p02660 | u496009935 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import copy\nn=int(input())\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\... | ['Wrong Answer', 'Accepted'] | ['s432664394', 's510180375'] | [9204.0, 9344.0] | [102.0, 103.0] | [493, 494] |
p02660 | u497277272 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ["\nimport math\n\ndef factorization(n):\n factor_list = []\n tmp = int(math.sqrt(n)) + 1\n for num in range(2, tmp+1):\n count = 0\n while n % num == 0:\n count += 1\n n //= num\n \n if count != 0:\n factor = [num, count]\n factor_lis... | ['Wrong Answer', 'Accepted'] | ['s818543790', 's943657098'] | [9192.0, 9108.0] | [138.0, 120.0] | [1109, 1002] |
p02660 | u497592162 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\n \n\ndef is_prime(n):\n for i in range(2, int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n return True\n \ndef getPrimeExp(n):\n n_sqrt = int(math.sqrt(n))\n array = [True]*(n_sqrt+1)\n result = []\n for i in range(2, n_sqrt+1):\n if array[i]:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067815664', 's280070873', 's468933961', 's369644646'] | [20472.0, 20352.0, 20416.0, 19996.0] | [355.0, 352.0, 349.0, 309.0] | [1481, 1323, 1344, 922] |
p02660 | u502126017 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n=int(input())\n\nimport math\n\ndef factorization(n): \n arr = []\n temp = n\n for i in range(2, int(math.sqrt(n))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append(cnt)\n\n if temp!=1:\n arr.appe... | ['Wrong Answer', 'Accepted'] | ['s563204375', 's189010022'] | [9220.0, 9188.0] | [109.0, 113.0] | [616, 623] |
p02660 | u504836877 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\n\np = [0]*10**6\nfor i in range(2, 10**6):\n if p[i] == 0:\n p[i] = 1\n j = 2\n while i*j < 10**6:\n p[i*j] = -1\n j += 1\n\nL = []\nfor i in range(10**6):\n if p[i] < 1:\n continue\n j = 1\n while pow(i, j) <= N:\n L.append(pow(i,... | ['Wrong Answer', 'Accepted'] | ['s565293657', 's060440791'] | [23568.0, 16796.0] | [1221.0, 1164.0] | [600, 610] |
p02660 | u506086925 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def divisor(n): \n i = 1\n table = []\n while i * i <= n:\n if n%i == 0:\n table.append(i)\n table.append(n//i)\n i += 1\n table = list(set(table))\n return table\ndef prime_decomposition(n):\n i = 2\n table = []\n while i * i <= n:\n while n % i == 0:\n n... | ['Runtime Error', 'Accepted'] | ['s971463372', 's072223254'] | [9248.0, 9244.0] | [23.0, 304.0] | [604, 611] |
p02660 | u511449169 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\n\n\ndef make_divisors(n):\n lower_divisors, upper_divisors = [], []\n i = 1\n while i*i <= n:\n if n % i == 0:\n lower_divisors.append(i)\n if i != n // i:\n upper_divisors.append(n//i)\n i += 1\n return lower_divisors + upper_divisors[::-1]\... | ['Time Limit Exceeded', 'Accepted'] | ['s516493313', 's551276950'] | [10184.0, 9492.0] | [2206.0, 112.0] | [1707, 592] |
p02660 | u512099209 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from itertools import combinations\nfrom functools import reduce\nfrom operator import mul\n\nN = int(input())\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n !=... | ['Wrong Answer', 'Accepted'] | ['s053692455', 's875236345'] | [9648.0, 9464.0] | [89.0, 96.0] | [706, 510] |
p02660 | u512212329 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ["from collections import defaultdict\nfrom itertools import accumulate\n\n\ndef main():\n n = int(input())\n prime_counter = defaultdict(int)\n acc = tuple(accumulate(range(1, 42))) # 10^12 < 2^39\n\n f = 2\n while f * f <= n:\n if n % f == 0:\n n //= f\n prime_counter[f] +... | ['Wrong Answer', 'Time Limit Exceeded', 'Wrong Answer', 'Accepted'] | ['s245210181', 's431272154', 's991506420', 's215266359'] | [9364.0, 870944.0, 17016.0, 9708.0] | [163.0, 2234.0, 366.0, 82.0] | [615, 424, 577, 800] |
p02660 | u523087093 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\n\ndef isPrime(num):\n if num < 2:\n return False\n elif num == 2:\n return True\n elif num % 2 == 0:\n return False\n\n for i in range(3, math.floor(math.sqrt(num))+1, 2):\n if num % i == 0:\n return False\n return True\n\n\ndef find_all_prime(num):\n... | ['Time Limit Exceeded', 'Wrong Answer', 'Wrong Answer', 'Time Limit Exceeded', 'Accepted'] | ['s308938208', 's511196812', 's578969985', 's661591626', 's641647997'] | [12632.0, 12276.0, 12264.0, 12620.0, 9468.0] | [2206.0, 2058.0, 2061.0, 2206.0, 108.0] | [890, 872, 927, 882, 875] |
p02660 | u536034761 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\nn = N\nans = 0\nnum = [2]\nfor i in range(3, int(N ** 0.5)):\n if all(i % x != 0 for x in num):\n num.append(i)\n if n % i == 0:\n index = 1\n while n % i**index == 0:\n ans += 1\n n = n // (i**index)\n index += 1\n if n == 1:\n break\nprint(ans)', 'N = int(input())\nan... | ['Wrong Answer', 'Accepted'] | ['s920454802', 's705437712'] | [9620.0, 9440.0] | [2206.0, 147.0] | [279, 314] |
p02660 | u536781361 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['history = set([])\n\n\nimport sympy\n\ndef func(n):\n if n == 1:\n return \n l = sympy.divisors(n)\n for i in sorted(l[1:]):\n if i in history:\n continue\n if len(sympy.factorint(i)) > 1:\n continue\n print(i, n)\n history.add(i)\n _ = n // i\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s765735549', 's821673391', 's702520179'] | [9144.0, 9068.0, 9644.0] | [25.0, 23.0, 359.0] | [451, 317, 1060] |
p02660 | u540761833 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\ndef prime_dict(n):\n a = {}\n if n%2 == 0:\n a[2] = 1\n n//=2\n while n%2 == 0:\n a[2] += 1\n n //= 2\n f = 3\n while f*f <= n:\n if n%f == 0:\n if f not in a:\n a[f] = 1\n else:\n a[f] += 1\n ... | ['Wrong Answer', 'Accepted'] | ['s542205413', 's455944404'] | [9136.0, 9440.0] | [2206.0, 93.0] | [417, 490] |
p02660 | u541929993 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N=int(input())\nn=N\np=2\ndcmp={}\nwhile n>1:\n if n%p==0:\n dcmp[p]=1+(dcmp[p] if p in dcmp else 0)\n n//=p\n else:\n p+=1\ncnt=0\nfor k,v in dcmp.items():\n i=1\n while True:\n dcmp[k]-=i\n if dcmp[k]<0:\n break\n i+=1\n cnt+=1\n\n', 'N=int(inp... | ['Wrong Answer', 'Time Limit Exceeded', 'Wrong Answer', 'Accepted'] | ['s107829039', 's245847669', 's286986561', 's755906892'] | [9176.0, 8996.0, 9092.0, 9196.0] | [2206.0, 2206.0, 27.0, 150.0] | [285, 282, 292, 412] |
p02660 | u559250296 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['a=int(input())\n\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp... | ['Wrong Answer', 'Accepted'] | ['s285548419', 's421564809'] | [9456.0, 9432.0] | [112.0, 106.0] | [387, 642] |
p02660 | u561862393 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import sys\ninput = sys.stdin.readline\nimport numpy as np\nfrom decimal import *\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n ... | ['Wrong Answer', 'Accepted'] | ['s522320977', 's765825878'] | [27268.0, 27240.0] | [184.0, 202.0] | [889, 934] |
p02660 | u580273604 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N=int(input())\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\nl=prime_factor... | ['Wrong Answer', 'Accepted'] | ['s772437553', 's309673803'] | [9116.0, 8992.0] | [102.0, 99.0] | [418, 398] |
p02660 | u585963734 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['#import math\n \ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1... | ['Wrong Answer', 'Accepted'] | ['s313614224', 's254129972'] | [9504.0, 9500.0] | [112.0, 112.0] | [674, 676] |
p02660 | u586639900 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from math import sqrt\nfrom collections import defaultdict\n\nN = int(input())\ndic = defaultdict(int)\n\ndef func(N):\n if N == 1:\n return 1\n \n for i in range(2, max(int(sqrt(N))+1, 3)):\n if N % i == 0:\n N = N // i\n dic[i] += 1\n return func(N)\n\nfunc(N)\n\ndef func2(k):\n n = 1\n co... | ['Wrong Answer', 'Accepted'] | ['s392087713', 's121542428'] | [9360.0, 9480.0] | [120.0, 102.0] | [463, 576] |
p02660 | u587589241 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import sys\nn=int(input())\nif n==1:\n print(0)\n sys.exit()\ndef f(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n i... | ['Runtime Error', 'Accepted'] | ['s754220390', 's479367639'] | [9096.0, 9496.0] | [26.0, 112.0] | [658, 588] |
p02660 | u588558668 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['m=int(input())\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1]... | ['Runtime Error', 'Accepted'] | ['s512728559', 's355071965'] | [9092.0, 9500.0] | [21.0, 111.0] | [538, 539] |
p02660 | u589783652 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\n\np = 2\ncounter = 0\nwhile N != 1:\n ind = 0\n n = -1\n while N % p == 0:\n N //= p\n ind += 1\n while (n+1)(n+2)//2 <= ind:\n n += 1\n counter += n\n p += 1\n\nprint(counter)', 'import math\n\nN = int(input())\n\np = 2\ncounter = 0\nwhile N != 1:\n if p > math.sqrt(N):\n counter +=... | ['Runtime Error', 'Accepted'] | ['s845666840', 's717524822'] | [9180.0, 9192.0] | [25.0, 388.0] | [194, 275] |
p02660 | u590748872 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\nn = int(input())\nans = 0\nk = int(math.sqrt(n)) + 1\nprime = set()\nn1 = n\n\n\nfor i in range(2,k):\n while n1%i==0:\n prime.add(i)\n n1 = n1//i\n if n1==1: break\n\n\nfor i in range(2,k):\n p = 1\n while n%(i**p)==0 and i in prime:\n ans+=1\n n = n//(i**p)\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s419358063', 's836636090', 's014295490'] | [9176.0, 9196.0, 9072.0] | [524.0, 2205.0, 473.0] | [384, 198, 263] |
p02660 | u593346450 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math \n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1]... | ['Wrong Answer', 'Accepted'] | ['s085151822', 's300590039'] | [9500.0, 9500.0] | [105.0, 105.0] | [865, 852] |
p02660 | u593590006 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | [' n=int(input())\n from math import sqrt as S \n pf=[]\n for i in range(2,int(S(n))+1):\n if n%i==0:\n c=0 \n while n%i==0:\n n//=i \n c+=1 \n pf.append([i,c])\n if n>1:\n pf.append([n,1])\n cnt=0 \n def search(x):\n ... | ['Runtime Error', 'Accepted'] | ['s486640510', 's076619347'] | [9008.0, 9228.0] | [22.0, 150.0] | [482, 391] |
p02660 | u595905528 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\nans = 0\ni = 2\nwhile(N**0.5>i):\n tmpi = i\n while(N%tmpi==0):\n ans+=1\n N/=tmpi\n tmpi*=i\n i+=1\nif N != 1:\n ans = 1\nprint(ans)', 'N = int(input())\nans = 0\ni = 2\nN\nl=2\nflag=True\nwhile(N**0.5>l):\n if N%l==0:\n flag=False\n break\n l+=1... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s194614440', 's631929101', 's121264062'] | [9436.0, 9464.0, 9472.0] | [364.0, 662.0, 641.0] | [172, 394, 400] |
p02660 | u596368396 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ["N = int(input())\n\n# import math\n#\n\n\n\n\n#\n# while True:\n# p = min(candidate)\n\n\n# break\n\n#\n\n#\n\n#\n#\n# if N == 1:\n# print(0)\n# exit()\n#\n\n\n# print('hoge')\n#\n# n = N\n# c = 0\n# used = {}\n#\n# for l in L:\n# if n % l == 0:\n\n# l2 = l\n# while... | ['Wrong Answer', 'Accepted'] | ['s505669479', 's142041887'] | [9236.0, 9452.0] | [147.0, 93.0] | [1440, 2173] |
p02660 | u598296382 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\nN = int(input())\ndef pf(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\nc = c... | ['Wrong Answer', 'Accepted'] | ['s821669319', 's233797721'] | [9412.0, 9376.0] | [99.0, 102.0] | [466, 457] |
p02660 | u600402037 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['# coding: utf-8\nimport sys\nimport numpy as np\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nU = 10 ** 8 + 10\nis_prime = np.zeros(U, np.bool)\nis_prime[2] = 1\nis_prime[3::2] = 1\nfor p in range(3, U, 2):\n if p*p > U:\n break\n if i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s258485472', 's347891770', 's543289088'] | [124836.0, 27688.0, 9212.0] | [926.0, 112.0, 96.0] | [630, 627, 581] |
p02660 | u601426916 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['#D\nimport math\nN = int(input())\nNsyo = N\ncount = 0\ndiv = 2\ndivcount = 0\ndivlist = []\nwhile N > 1 and div <= math.sqrt(N):\n if N%div == 0:\n while N%div == 0:\n N = N/div\n divcount = divcount+1\n divlist.append(divcount)\n divcount = 0\n else:\n pass\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s815473208', 's854161204', 's551435772'] | [9284.0, 9124.0, 9292.0] | [340.0, 325.0, 412.0] | [568, 268, 578] |
p02660 | u602773379 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\n\ndef prime(num):\n\tarray=[]\n\ttmp=int(math.sqrt(n))+1\n\tfor i in range(2,tmp):\n\t\twhile num % i == 0:\n\t\t\tnum/=i\n\t\t\tarray.append(i)\n\t\n\tif array==[]:\n\t\treturn [num]\n\telse:\n\t\treturn array\n \nn=int(input())\nP=prime(n)\ntmp=P[0]\n\nif 1 in P:\n\tprint(0)\nelse:\n\tans=0\n\tfor... | ['Wrong Answer', 'Accepted'] | ['s483686163', 's069754836'] | [9116.0, 9292.0] | [116.0, 117.0] | [476, 530] |
p02660 | u606146341 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\na, b = map(str, input().split())\na = int(a)\nb = float(b)\n\nb = int(b * 100)\nans = a * b // 100\n\nans = int(math.floor(ans))\nprint(ans)', 'n = int(input())\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n ... | ['Runtime Error', 'Accepted'] | ['s772129735', 's270112999'] | [9112.0, 9484.0] | [25.0, 111.0] | [144, 603] |
p02660 | u608178601 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\n\nN=int(input())\nans=0\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n... | ['Wrong Answer', 'Accepted'] | ['s547330717', 's138130768'] | [9484.0, 9468.0] | [94.0, 89.0] | [502, 522] |
p02660 | u613920660 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\n\ndef prime(x):\n if x==1:\n prime=False\n else:\n prime=True\n for i in range(2,int(math.sqrt(x)+1)):\n if x%i==0:\n prime=False\n break\n return prime\n\ndef count_prime(N):\n if prime(N): \n big_prime=True\n \n ... | ['Runtime Error', 'Accepted'] | ['s714286825', 's980908056'] | [9044.0, 17020.0] | [22.0, 366.0] | [1336, 1324] |
p02660 | u618107373 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import sys\nsys.setrecursionlimit(100000)\n\n\ndef ins(): return input().split()\ndef ii(): return int(input())\ndef iil(): return list(map(int, ins()))\ndef lin(): return list(input())\ndef iin(): return map(int, ins())\n\nfrom collections import defaultdict\nfrom math import sqrt\n\narr = []\nmax_p = int(50000)\nl1... | ['Wrong Answer', 'Accepted'] | ['s183372421', 's388786888'] | [10468.0, 17672.0] | [45.0, 229.0] | [707, 727] |
p02660 | u621582427 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def factorize(n):\n x = 2\n f = []\n while x**2 <= n:\n c = 0\n if n % x != 0:\n break\n else:\n while n % x == 0:\n n //= x\n c += 1\n f.append([x, c])\n\n if n > 1:\n f.append([n, 1])\n return f\n\nn = int(inpu... | ['Wrong Answer', 'Accepted'] | ['s371099161', 's173114370'] | [9224.0, 9220.0] | [24.0, 317.0] | [505, 515] |
p02660 | u628047647 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n = int(input())\ni = 2\nans = 0\nwhile True:\n if i * i > n:\n break\n if n % i == 0:\n cnt = 0\n while n % i == 0:\n n /= i\n cnt += 1\n k = 1\n while cnt >= k:\n cnt -= k\n k += 1\n ans += k - 1\n i += 1\nprint(ans)', 'n = int(input())\ni = 2\nans = 0\nwhile True:\n if i *... | ['Wrong Answer', 'Accepted'] | ['s033794813', 's225067910'] | [9260.0, 9264.0] | [241.0, 224.0] | [242, 263] |
p02660 | u628285938 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1])\n\n if arr=... | ['Runtime Error', 'Accepted'] | ['s773109692', 's009291794'] | [9192.0, 9496.0] | [24.0, 106.0] | [584, 587] |
p02660 | u629670559 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def factorization(n):\n\tarr = []\n\ttemp = n\n\tfor i in range(2, int(-(-n**0.5 // 1)) + 1):\n\t\tif temp % i == 0:\n\t\t\tcnt = 0\n\t\t\twhile temp % i == 0:\n\t\t\t\tcnt += 1\n\t\t\t\ttemp //= i\n\t\t\tarr.append([i,cnt])\n\n\tif temp != 1:\n\t\tarr.append([temp, 1])\n\n\tif arr == []:\n\t\tarr.append([n,1])\n\n\t... | ['Wrong Answer', 'Accepted'] | ['s695432247', 's125336089'] | [9460.0, 9348.0] | [112.0, 110.0] | [324, 305] |
p02660 | u637897856 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n = int(input())\n \nfrom collections import Counter\n \nf = Counter()\n \nfor i in range(2, min(int(n ** 0.5 + 1), n + 1)):\n while n % i == 0:\n f[i] += 1\n n //= i\n \n \ndef bsearch(test, lo, hi):\n while lo != hi:\n mid = (lo + hi + 1) // 2\n if test(mid):\n lo = mid\n else:\n hi = ... | ['Wrong Answer', 'Accepted'] | ['s299009458', 's872587427'] | [9688.0, 9628.0] | [154.0, 152.0] | [474, 623] |
p02660 | u638033979 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1])\n\n if arr=... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s535534194', 's624594938', 's750462958'] | [9496.0, 9500.0, 9504.0] | [111.0, 114.0, 103.0] | [567, 567, 604] |
p02660 | u638282348 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from statistics import median\nN = int(input())\nA, B = zip(*tuple(tuple(map(int, input().split())) for _ in range(N)))\nprint(int((median(B) - median(A)) * (1 + (not N & 1))) + 1)', 'from itertools import accumulate\nfrom bisect import bisect_right\ndef prime_factorize_dict(n):\n d = dict()\n while not n & 1:\... | ['Runtime Error', 'Accepted'] | ['s544906138', 's263103003'] | [10972.0, 63760.0] | [32.0, 184.0] | [177, 527] |
p02660 | u644126199 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['arr = []\ntemp = int(input())\nsu =0\nfor i in range(2, int(-(-temp**0.5//1))+1):\n if temp%i==0:\n cnt=0\n store =i\n while temp%i==0 and temp !=i :\n cnt+=1\n \n temp //= i\n arr.append(i)\n su +=1\n i *=store\n \n \nif temp!=1:\n if all(temp>s for s in arr):\n a... | ['Wrong Answer', 'Accepted'] | ['s216476720', 's201443635'] | [9488.0, 9412.0] | [143.0, 148.0] | [405, 402] |
p02660 | u645504441 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\n\ndef p(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\n\nn = int(input())\ns ... | ['Wrong Answer', 'Accepted'] | ['s228750377', 's148248023'] | [9464.0, 9468.0] | [92.0, 93.0] | [529, 547] |
p02660 | u648881683 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ["import sys, collections\ninput = lambda: sys.stdin.readline().rstrip() \nsys.setrecursionlimit(10**7)\nINF = 10**20\ndef I(): return int(input())\ndef F(): return float(input())\ndef S(): return input()\ndef LI(): return [int(x) for x in input().split()]\ndef LI_(): return [int(x)-1 for x in input().split()]\ndef LF(... | ['Wrong Answer', 'Accepted'] | ['s273005523', 's269977346'] | [9760.0, 20592.0] | [109.0, 248.0] | [683, 1107] |
p02660 | u648901783 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\n\nimport heapq \n\n\n\n\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i,i, cnt])\n\n if temp!=1... | ['Wrong Answer', 'Accepted'] | ['s604699010', 's340064657'] | [9544.0, 9448.0] | [112.0, 111.0] | [851, 849] |
p02660 | u652656291 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\nimport math\n\nn = int(input())\nB = [1,2,6,10,15,21,28,36,45,55]\nans = 0\n\ndef is_prime(n):\n if n == 1: return False\n\n for k in range(2, int(math.sqrt(n)) + 1):\n if n % k == 0:\n return False\n return True\nif is_prime(n) == True:\n print(1)\n exit()\n\ndef prim... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s071094043', 's175460227', 's232263929', 's338535122', 's358512674', 's511710132', 's624107082', 's643484747', 's848802813', 's536280630'] | [9480.0, 9476.0, 9444.0, 9480.0, 9480.0, 9480.0, 9472.0, 9492.0, 9480.0, 9440.0] | [169.0, 180.0, 114.0, 174.0, 174.0, 174.0, 179.0, 113.0, 156.0, 179.0] | [717, 732, 296, 723, 724, 725, 730, 739, 753, 735] |
p02660 | u667854389 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from math import floor,sqrt\nN=int(input())\n\np = [1]*floor(sqrt(10**6))\np[0]=p[1]=0\nprime=[]\nfor i in range(2,len(p)):\n if p[i]==0:\n continue\n prime.append(i)\n for j in range(i*2,len(p),i):\n p[j]=0\n\nans=0\nfor x in prime:\n cnt=0\n while N%x==0:\n cnt+=1\n N/=x\n... | ['Wrong Answer', 'Accepted'] | ['s247183132', 's066006724'] | [9280.0, 20084.0] | [23.0, 432.0] | [357, 386] |
p02660 | u677267454 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n\n if n != 1:\n a.append(n)\n\n return a\n\n\nN = int(input())\nsosu... | ['Wrong Answer', 'Accepted'] | ['s783001996', 's748366668'] | [9232.0, 9224.0] | [91.0, 90.0] | [672, 645] |
p02660 | u685983477 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ["from collections import defaultdict\nfrom collections import deque\nfrom itertools import accumulate\nimport math\ndef main():\n a,b=map(float, input().split())\n print(int((a*(b*100))//100))\n\n\nif __name__ == '__main__':\n main()\n", "import math\nfrom collections import defaultdict\ndef prime_decompositi... | ['Runtime Error', 'Accepted'] | ['s175993385', 's918542650'] | [9284.0, 9752.0] | [26.0, 113.0] | [232, 1051] |
p02660 | u686036872 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\n\ndef factorizatio(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp,... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s072482097', 's075074350', 's125668991', 's303891453', 's553104362', 's606543274', 's693164381', 's892016219', 's981472250', 's261432613'] | [9492.0, 9400.0, 9460.0, 9456.0, 9492.0, 9460.0, 9460.0, 9464.0, 9064.0, 9500.0] | [102.0, 25.0, 163.0, 404.0, 110.0, 432.0, 156.0, 94.0, 25.0, 108.0] | [567, 544, 451, 290, 565, 332, 449, 545, 309, 594] |
p02660 | u686230543 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n = int(input())\nprimes = dict()\np = 2\n\nwhile p * p < n:\n if n % p == 0:\n primes[p] = 0\n while n % p == 0:\n n //= p\n primes[p] += 1\n p += 1\nif p * p == n:\n primes[p] = 2\nelif n >= p:\n primes[n] = 1\n\ncount = 0\nfor e in primes.values():\n c = 1\n while e >= c:\n e -= c\n c +... | ['Wrong Answer', 'Accepted'] | ['s597118896', 's236789362'] | [9204.0, 9148.0] | [267.0, 231.0] | [329, 337] |
p02660 | u688375653 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1])\n\n if arr=... | ['Runtime Error', 'Accepted'] | ['s166144835', 's594469773'] | [9164.0, 9424.0] | [25.0, 114.0] | [669, 910] |
p02660 | u689710606 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\n\nn = int(input())\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n ... | ['Wrong Answer', 'Accepted'] | ['s329353165', 's672294596'] | [9460.0, 9376.0] | [99.0, 100.0] | [618, 604] |
p02660 | u692746605 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N=int(input())\n\na={}\nc=0\nwhile N%2==0:\n N//=2\n c+=1\nif c!=0:\n a[2]=c\n\nf,c=3,0\nwhile f*f<=N:\n if N%f==0:\n N//=f\n c+=1\n a[f]=c\n else:\n f+=2\n c=0\nif N!=1:\n if N in a:\n a[N]+=1\n else:\n a[N]=1\n\nt=0\nfor v in a.values():\n i=1\n while v>=i:\n t+=1\n i+=1\n v-=... | ['Wrong Answer', 'Accepted'] | ['s670266663', 's347368944'] | [9088.0, 9224.0] | [145.0, 133.0] | [299, 299] |
p02660 | u693025087 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['# -*- coding: utf-8 -*-\n# map(int, input().split())\nimport math\n\nN = int(input())\nif N == 1:\n print(0)\n exit()\n\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+... | ['Wrong Answer', 'Accepted'] | ['s786748909', 's173658819'] | [9488.0, 9488.0] | [111.0, 113.0] | [610, 595] |
p02660 | u693173434 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n=int(input())\ncount=0\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.appen... | ['Wrong Answer', 'Accepted'] | ['s368062254', 's217137738'] | [9488.0, 9492.0] | [112.0, 111.0] | [537, 559] |
p02660 | u694649864 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['\nN = int(input())\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\n\ndef ha... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s026728322', 's789316082', 's615933580'] | [9296.0, 9288.0, 9276.0] | [93.0, 91.0, 91.0] | [1059, 1162, 1061] |
p02660 | u699008198 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n = int( input() )\nA = []\nB = []\n\nfor i in range( n ):\n a, b = map( int, input().split() )\n A.append( a )\n B.append( b )\n\nA = sorted( A )\nB = sorted( B )\n\nif n % 2 == 0:\n i = n // 2\n print(( B[ i ] + B[ i - 1 ] ) - ( A[ i ] + A [ i - 1 ] ) + 1 )\nelse:\n i = ( n + 1 ) // 2 - 1\n print( B[ i ] - A... | ['Runtime Error', 'Accepted'] | ['s363171480', 's750300377'] | [9196.0, 9488.0] | [23.0, 110.0] | [313, 550] |
p02660 | u699944218 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\n\nA = prim... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s142423466', 's887721228', 's558116812'] | [9184.0, 9492.0, 9504.0] | [93.0, 109.0, 110.0] | [736, 570, 615] |
p02660 | u701893485 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\n\ndef prime_factorize(n):\n a = []\n while n%2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f*f <= n :\n if n % f ==0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\n\n\nif __na... | ['Runtime Error', 'Accepted'] | ['s297986169', 's863884360'] | [9464.0, 9464.0] | [93.0, 91.0] | [691, 700] |
p02660 | u714410759 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def get_prime_factorizations(n):\n """\n [summary]\n\n Parameters\n ----------\n n : int\n the number factorized by prime numbers.\n\n Returns\n -------\n dict[int: int]\n prime and exponent pair\n ex.) if n == 40, the function return {2:3, 5:1} \n """ \n root_n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s011310783', 's761100030', 's294333563'] | [66096.0, 66000.0, 65968.0] | [191.0, 168.0, 190.0] | [1151, 791, 1170] |
p02660 | u714732628 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n = int(input())\nli = []\nif n==1:\n print(0)\nelse:\n for i in range(1000000):\n if n==1:\n break\n if i==0 or i==1 or n%i!=0:\n continue\n j = i\n cnt = 0\n while(n%j==0):\n if flg==0:\n flg = 1\n n /= j\n cnt += 1\n li.append(cnt)\n if flg==0:\n print(1)\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s255200434', 's340357818', 's638074896', 's841095493', 's963475672'] | [9172.0, 9020.0, 9300.0, 9264.0, 9304.0] | [216.0, 23.0, 237.0, 249.0, 248.0] | [427, 315, 548, 392, 522] |
p02660 | u715912777 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from collections import Counter\nfrom itertools import combinations\nimport numpy as np\n\n\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s544078083', 's055942774'] | [27280.0, 27168.0] | [245.0, 180.0] | [2145, 1923] |
p02660 | u723583932 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['\nn=int(input())\nbunkai=[]\n\ndef different_value(e):\n cnt=0\n i=1\n while e-i>=0:\n e-=i\n i+=1\n cnt+=1\n return cnt\n\ndef soinsuu(x):\n for i in range(2,int((n+1)**0.5)+1):\n cnt=0\n while x%i==0:\n x//=i\n cnt+=1\n if cnt==0:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s069845198', 's476253723', 's501405044'] | [9352.0, 9352.0, 9476.0] | [130.0, 127.0, 127.0] | [575, 575, 549] |
p02660 | u724844363 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n = int(input())\n\n\ndef Pf(n):\n l = {}\n if n == 1:\n return 0\n else:\n i = 2\n tnp = 0\n while n > 1 and i < int(n**0.5)+1:\n if n % i == 0:\n tnp += 1\n n //= i\n else:\n l[i] = tnp\n tnp = 0\n... | ['Wrong Answer', 'Accepted'] | ['s682475231', 's613155870'] | [92996.0, 9492.0] | [636.0, 90.0] | [864, 917] |
p02660 | u726284577 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\nn=int(input())\nans=0\nd=1\nm=0\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.ap... | ['Wrong Answer', 'Accepted'] | ['s497260612', 's690815667'] | [9428.0, 9412.0] | [95.0, 92.0] | [607, 586] |
p02660 | u731603651 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\nn = int(input())\ndiv = 2\nres = 0\nm = int(math.sqrt(n))\nwhile div < m:\n cnt = 0\n if ((n // div) * div != n):\n div += 1\n continue\n while (n // div) * div == n:\n cnt += 1\n n = n // div\n #print(div, cnt)\n tmp = 1\n while tmp < cnt:\n res += 1\... | ['Wrong Answer', 'Accepted'] | ['s492894831', 's621364968'] | [9192.0, 9136.0] | [262.0, 273.0] | [406, 407] |
p02660 | u731807761 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import numpy as np\nimport sys\n#import copy\n\n\ndef xnxn(n=0):\n """\n args:\n int n: a number of lows to read\n example:\n input 1\n retrun 1\n\n input 1 2 3\n return [1,2,3]\n input 1 2 3\n 4\n return [[1,2,3],\n [4]]... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s249930019', 's251205634', 's589396541'] | [27128.0, 27096.0, 27168.0] | [1717.0, 112.0, 214.0] | [2622, 591, 3013] |
p02660 | u734195782 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\ndef check(n):\n count = 0\n end = int(math.sqrt(n)+1)\n for i in range(2,end):\n if n%i==0:\n count += 1\n n/=i\n if n%i==0:\n l = 2\n count2 = 0\n while n%i==0:\n n/=i\n count2+=1\n ... | ['Wrong Answer', 'Accepted'] | ['s308421491', 's925649010'] | [9280.0, 9224.0] | [209.0, 217.0] | [542, 586] |
p02660 | u736729525 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['\nanswer = 0\n\ndef prime(N):\n f = []\n c = 0\n r = int(N**0.5)\n for i in range(2, r+2):\n while N % i == 0:\n c+= 1\n N = N //i\n if c != 0:\n f.append((i,c))\n c = 0\n if N!=1:\n f.append((N,1))\n return f\nN = int(input())\nimport... | ['Wrong Answer', 'Accepted'] | ['s273834931', 's478706858'] | [9488.0, 9572.0] | [124.0, 125.0] | [555, 1512] |
p02660 | u752115287 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import collections\n\nn = int(input())\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n ... | ['Wrong Answer', 'Accepted'] | ['s017998619', 's206773726'] | [9492.0, 9484.0] | [92.0, 93.0] | [586, 662] |
p02660 | u756311765 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1])\n\n if arr=... | ['Wrong Answer', 'Accepted'] | ['s371306882', 's105488157'] | [9508.0, 9504.0] | [110.0, 111.0] | [675, 773] |
p02660 | u761638117 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\n\nimport collections\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s443698458', 's709177179', 's843311783'] | [9484.0, 9404.0, 9464.0] | [97.0, 24.0, 96.0] | [500, 482, 510] |
p02660 | u762540523 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ["from functools import lru_cache\n\n\ndef PrimeFactorization(m):\n pf = {}\n i = 2\n while i ** 2 < n:\n while n % i == 0:\n pf[i] = pf.get(i, 0) + 1\n n //= i\n i += 1\n if n > 1:\n pf[n] = 1\n return pf\n\n\n@lru_cache(maxsize=100000)\ndef f(x):\n return i... | ['Runtime Error', 'Accepted'] | ['s444995740', 's100537940'] | [9572.0, 9752.0] | [25.0, 316.0] | [526, 526] |
p02660 | u763534217 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['def factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt])\n\n if temp!=1:\n arr.append([temp, 1])\n\n if arr=... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s368478574', 's586911023', 's657308295', 's768120212'] | [9484.0, 9484.0, 9484.0, 9496.0] | [111.0, 109.0, 109.0, 111.0] | [515, 551, 609, 616] |
p02660 | u763550415 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\n\nn = int(input())\nMax = 10**6\ncount = 0\n\ndef sosu(x):\n for i in range(2,int(math.sqrt(n))+1):\n if n % i == 0:\n return False\n return True\n\nif sosu(n):\n print(count +1)\n exit()\n\nalst = [0] * Max\nalst[0] = 2\nalst[1] = 1\nfor i in range(2,Max):\n for j in range(i, Max, i):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s195985040', 's257937132', 's540858457', 's046941989'] | [44248.0, 44592.0, 44236.0, 9280.0] | [942.0, 914.0, 931.0, 174.0] | [722, 663, 722, 608] |
p02660 | u768896740 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['# n = int(input())\nn = 16\nif n == 1:\n print(0)\n exit()\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp%i==0:\n cnt=0\n while temp%i==0:\n cnt+=1\n temp //= i\n arr.append([i, cnt]... | ['Wrong Answer', 'Accepted'] | ['s269572308', 's150526210'] | [9492.0, 9496.0] | [21.0, 104.0] | [677, 668] |
p02660 | u770558697 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['n = int(input())\nif n == 1:\n print(0)\nelse:\n answer = 0\n for factor in factorization(n):\n x = factor[1]\n kouho = int((2*x)**0.5)-1\n if (kouho)*(kouho+1)/2 <=x and x < (kouho+1)*(kouho+2)/2:\n kaisu = kouho\n else:\n kaisu = kouho+1\n answer += ... | ['Runtime Error', 'Accepted'] | ['s586109340', 's912101949'] | [9188.0, 9500.0] | [25.0, 113.0] | [330, 684] |
p02660 | u773077120 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\np, score = 2, 0\nwhile p ** 2 <= N:\n e = 1\n while N >= (p ** e) and N % (p ** e) == 0:\n N = N // (p ** e)\n score += 1\n e += 1\n else:\n p = p + 1 if p == 2 else p + 2\nelse:\n if N != 1 and score == 0:\n score += 1\nprint(score)', 'N = int(input())\nn, p, score = N, 2, 0\nwhi... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s037046290', 's322387838', 's607194308', 's641315318', 's827515243', 's352057201'] | [9188.0, 8940.0, 9192.0, 252876.0, 9200.0, 9200.0] | [417.0, 23.0, 468.0, 2226.0, 413.0, 369.0] | [257, 266, 268, 400, 257, 249] |
p02660 | u779728630 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['N = int(input())\n\np_dic = {}\ni=2\nwhile i < N:\n if N % i == 0:\n p_dic[i] = 0\n while N % i == 0:\n p_dic[i] += 1\n N /= i\n i += 1\n\ndef foo(x):\n r = 0\n base = 1\n while x >= base:\n x -= base\n r+=1\n base += 1\n return r\n\nans = 0\nfor v in p_dic.values():\n# print(v, foo(v)... | ['Wrong Answer', 'Accepted'] | ['s883474222', 's031287188'] | [9268.0, 9276.0] | [2205.0, 382.0] | [324, 358] |
p02660 | u780698286 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from collections import Counter\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n retur... | ['Runtime Error', 'Accepted'] | ['s059159343', 's498865918'] | [9460.0, 9308.0] | [31.0, 102.0] | [348, 608] |
p02660 | u781262926 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['from numba import njit\n@njit\ndef factorint(n):\n d = {}\n for i in range(2, int(sqrt(n))+1):\n c = 0\n q, r = divmod(n, i)\n while not r:\n c += 1\n n = q\n q, r = divmod(n, i)\n if c:\n d[i] = c\n if n != 1:\n d[n] = 1\n ret... | ['Runtime Error', 'Accepted'] | ['s841445862', 's151200070'] | [106244.0, 9228.0] | [1316.0, 155.0] | [461, 454] |
p02660 | u787059958 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\nA, B = input().split()\n\nprint(int(math.floor(float(A) * float(B))))\n', 'n = int(input())\n\nd = 2\nans = 0\nwhile d * d <= n:\n if (n % d != 0):\n d += 1\n continue\n z = d\n while n % z == 0:\n n //= z\n z *= d\n ans += 1\n\n while n % d == 0:\n \... | ['Runtime Error', 'Accepted'] | ['s158415083', 's891497728'] | [9096.0, 9184.0] | [24.0, 220.0] | [80, 293] |
p02660 | u798260206 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['import math\n\na,b = map(float,input().split())\nans = math.floor(a*b)\nprint(ans)', 'def prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f +... | ['Runtime Error', 'Accepted'] | ['s184033935', 's932198139'] | [9092.0, 9460.0] | [25.0, 101.0] | [78, 566] |
p02660 | u798818115 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['# coding: utf-8\n# Your code here!\nimport bisect\n\nline=[i*(i+1)//2 for i in range(10**7+1)]\n\nN=int(input())\n\nif N==1:\n print(0)\n exit()\n\ndo=[0 for i in range(10**6+1)]\n\nfor i in range(2,int(N**0.5)+1):\n while N%i==0:\n N/=i\n do[i]+=1\n\nans=0\njudge=True\n\nfor _,item in enumerat... | ['Time Limit Exceeded', 'Accepted'] | ['s818235565', 's650405967'] | [412636.0, 56560.0] | [2140.0, 804.0] | [434, 348] |
p02660 | u805332733 | 2,000 | 1,048,576 | Given is a positive integer N. Consider repeatedly applying the operation below on N: * First, choose a positive integer z satisfying all of the conditions below: * z can be represented as z=p^e, where p is a prime number and e is a positive integer; * z divides N; * z is different from all integers chos... | ['\ndef resolve():\n N = int(input())\n prime_factors = factorization(N)\n tri_dict = {\n 1 : 1,\n 2 : 1,\n 3 : 2 ,\n 4 : 2 ,\n 5 : 2 ,\n 6 : 3 ,\n 7 : 3 ,\n 8 : 3 ,\n 9 : 3 ,\n 10 : 4 ,\n 11 : 4 ,\n 12 : 4 ,\n 13 : 4 ,\n 14 : 4 ,\n 15 : 5 ,\n 16 : 5 ,\... | ['Runtime Error', 'Accepted'] | ['s450465635', 's450886089'] | [9248.0, 9456.0] | [25.0, 112.0] | [816, 699] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.