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 | u060736237 | 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 main():\n n = int(input())\n if n == 1:\n print(0)\n return\n def eratos(n):\n flag = [True] * (n + 1)\n for i in range(2, int(n**0.5) + 1):\n if flag[i]:\n for j in range(2*i, n + 1, i):\n flag[j] = False\n return [i for i, ... | ['Runtime Error', 'Accepted'] | ['s956218328', 's411138989'] | [9112.0, 20344.0] | [22.0, 166.0] | [875, 876] |
p02660 | u067694718 | 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())\npf = []\ni = 2\nif n == 1:\n print(0)\n exit()\n\nwhile i ** 2 <= n:\n j = 0\n while n % i == 0:\n n = n // i\n j += 1\n if j > 0:\n pf.append(j)\n i += 1\nif len(pf) == 0: pf.append(1)\n\nans = 0\nfor i in pf:\n tmp = i\n j = 1\n while j <= tmp:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s612879988', 's671870984', 's875203722', 's192068353'] | [9216.0, 9204.0, 9228.0, 9472.0] | [422.0, 447.0, 424.0, 181.0] | [351, 294, 314, 364] |
p02660 | u072717685 | 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 main():\n n = int(input())\n on = n\n def is_prime(n):\n for i in range(2, n + 1):\n if i * i > n:\n break\n if n % i == 0:\n return False\n return n != 1\n if is_prime(n):\n print(1)\n sys.exit()\n\n nn = ceil(n**0.5)\... | ['Runtime Error', 'Accepted'] | ['s423402375', 's880201983'] | [9164.0, 9476.0] | [155.0, 119.0] | [1505, 834] |
p02660 | u075303794 | 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\nimport collections\n\nN = int(input())\nprime_number = False\nans = 0\n\ndef trial_division(n):\n \n factor = []\n \n tmp = int(math.sqrt(n)) + 1\n for num in range(2,tmp):\n while n % num == 0:\n n //= num\n factor.append(num)\n \n if not factor:\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s422749592', 's691530071', 's385520631'] | [9088.0, 9088.0, 9516.0] | [24.0, 23.0, 112.0] | [965, 968, 998] |
p02660 | u082945913 | 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())\nN = n\n\nif(n == 1):\n print(0)\n exit()\n\nyakusu = []\nmulti = []\n\ni = 2\nwhile(i <= math.ceil(math.sqrt(n))):\n \n if(n % i == 0):\n if(i in yakusu):\n multi[yakusu.index(i)] += 1\n else:\n yakusu.append(i)\n multi.append... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s068309001', 's235434803', 's911154958'] | [9244.0, 9248.0, 9276.0] | [411.0, 410.0, 403.0] | [563, 610, 648] |
p02660 | u084491185 | 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\n\n\nN = int(input())\nl = prim... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s560831301', 's593705359', 's402685470'] | [8932.0, 9212.0, 9224.0] | [24.0, 91.0, 88.0] | [458, 457, 484] |
p02660 | u090068671 | 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... | ['ef D(argN = None):\n\tanswer = 0\n\tN = argN or int(input())\n\tif N==1:\n\t\tprint(answer)\n\telse:\n\t\t\n\t\tfor p in range(2, int(N**0.5)+2):\n\t\t\te = 0\n\t\t\twhile (N % p == 0):\n\t\t\t\tN /= p\n\t\t\t\te += 1\n\t\t\t\n\t\t\tif e>0:\n\t\t\t\t\n\t\t\t\tfor i in range(1, e+1):\n\t\t\t\t\tif e >= 1:\n\t\t\t\t\t\... | ['Runtime Error', 'Accepted'] | ['s751128943', 's728530886'] | [8972.0, 9388.0] | [24.0, 128.0] | [588, 542] |
p02660 | u094102716 | 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())\nd={}\nfor k in range(2,10**6):\n while n%k<1: n//k; d[k]=d.get(k,0)+1\na=0\nfor i in d.values():\n t=c=0\n while t+c<i: c+=1; t+=c\n a+=c\nprint(a+(n>1))', 'n=int(input())\nd={}\nfor k in range(2, 10**6):\n while n%k<1: n//k; d[k]=d.get(k, 0)+1\na=0\nfor i in d.values():\n t=c=0\n while t+c<i: ... | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s395884489', 's640680541', 's491623116'] | [9184.0, 9184.0, 9120.0] | [2206.0, 2206.0, 150.0] | [164, 167, 165] |
p02660 | u094425865 | 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 fc(n):\n wk =0\n h=0\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n wk+=1\n n//=i\n h=i\n if n!=1 and h < n:\n wk+=1\n return wk\n \nn =int(input()', 'def fc(n):\n wk =0\n h=0\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s144396216', 's233088087', 's339958758'] | [9048.0, 9008.0, 9448.0] | [22.0, 23.0, 211.0] | [204, 223, 277] |
p02660 | u101371735 | 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... | ['\nfrom collections import Counter\nN = int(input())\nfactors = []\ni = 2\n\nwhile N > 1:\n if N < i * i:\n factors.append(N)\n break\n while N % i == 0:\n factors.append(i)\n N //= i\n i += 1\n# N == 1\nans = 0\nprint(factors)\nfor count in Counter(factors).values():\n i = 1\n while count >= i:\n ... | ['Wrong Answer', 'Accepted'] | ['s479728995', 's412908672'] | [9400.0, 9448.0] | [250.0, 270.0] | [418, 420] |
p02660 | u111473084 | 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 main():\n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n\n N = int(input())\n N = 2*5+3*5\n\n if N == 1:\n print(0)\n return\n\n def get_prime(n):\n import math\n p = []\n if n % 2 == 0:\n p.append(2)\n\n sq = math... | ['Wrong Answer', 'Accepted'] | ['s644856491', 's444204464'] | [9520.0, 9472.0] | [26.0, 96.0] | [1047, 894] |
p02660 | u111652094 | 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'] | ['s681772016', 's021757346'] | [9512.0, 9528.0] | [112.0, 111.0] | [565, 707] |
p02660 | u112114596 | 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())\n\nans=0\narr=[]\n\ntmp=1\n\n#print(int(math.sqrt(N))+5)\n\nfor i in range(int(math.sqrt(N))+5):\n tmp=1\n\n while N % ((i+2)**tmp) == 0:\n N=N / ((i+2)**tmp)\n print((i+2)**tmp)\n ans+=1\n tmp+=1\n\n while N % (i+2) == 0:\n N = N // (i+2)\n\ni... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s225999342', 's356951908', 's105553152'] | [9264.0, 9204.0, 9264.0] | [499.0, 495.0, 490.0] | [327, 327, 329] |
p02660 | u114641312 | 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 factorial,sqrt,ceil #,gcd\n# from itertools import permutations,combinations,combinations_with_replacement\n# from collections import deque,Counter\n# from bisect import bisect_left\nfrom heapq import heapify,heappush,heappop\n# from numba import njit\n\n# from fractions import gcd\n\n# from decima... | ['Runtime Error', 'Accepted'] | ['s561533868', 's140925430'] | [2106264.0, 9468.0] | [2265.0, 92.0] | [1802, 1348] |
p02660 | u115110170 | 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 f(i,n):\n ans =0\n cnt = i\n while n%cnt == 0:\n n//=cnt\n cnt*=i\n ans +=1\n while n%i ==0:\n n//=i\n return n,ans\n\nn = int(input())\nnn = n\ni = 2\nans = 0\nwhile i <= int(n**0.5)+1:\n if n%i ==0:\n n,a = f(i,n)\n ans += a\n i += 1\n \nif n == nn:\n ans += 1\nprint(ans)', 'def f(i,n... | ['Wrong Answer', 'Accepted'] | ['s199849330', 's266259079'] | [9488.0, 9456.0] | [451.0, 435.0] | [282, 274] |
p02660 | u116038906 | 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 make_divisors(n): をリストで返す\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n\n \n return divisors\n\n\ndef soinsu_bunkai(m):\n pf={}\n\n for i in range(2,int(m**0.5)+1... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s075288036', 's376819144', 's563216927', 's885102053', 's792331764'] | [9440.0, 9408.0, 9488.0, 9508.0, 9380.0] | [197.0, 202.0, 109.0, 875.0, 113.0] | [755, 813, 505, 757, 540] |
p02660 | u119982001 | 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 if temp!=1:\n arr.append([temp, 1])\n return arr\... | ['Wrong Answer', 'Accepted'] | ['s429728762', 's959133874'] | [9520.0, 9476.0] | [110.0, 118.0] | [587, 575] |
p02660 | u125348436 | 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\ndef factorization(n):\n if n<2:\n return []\n \n prime_factor=[]\n \n for i in range(2,int(n**0.5)+1):\n while n%i==0:\n prime_factor.append(i)\n n//=i\n \n if n>1:\n prime_factor.append(n)\n\n \n return prime_factor... | ['Runtime Error', 'Accepted'] | ['s407391086', 's294497921'] | [9724.0, 9744.0] | [110.0, 111.0] | [521, 521] |
p02660 | u133936772 | 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())\nd={2:0}\nwhile n%2<1: n//=2; d[2]+=1\nfor i in range(3,int(n**0.5)+1,2):\n while n%i<1: n//=i; d[i]=d.get(i,0)+1\n if n<2: break\nif n>1: d[x]=1\na=0\nfor i in d.values():\n t=c=0\n while t+c<i: c+=1; t+=c\n a+=c\nprint(a)', 'n=int(input())\n\ndef sieve(x):\n p=[2]\n b=[1]*x\n for i in ran... | ['Runtime Error', 'Accepted'] | ['s346446869', 's737117044'] | [9360.0, 20272.0] | [94.0, 212.0] | [235, 425] |
p02660 | u153556810 | 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())\nlist = {}\nflag = True\nwhile flag:\n flag = False\n for i in range(2,int(math.sqrt(n)+1)):\n if n%i==0:\n if i in list:\n list[i] = list[i]+1\n else:\n list[i] = 1\n n /= i\n flag = True\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s092058336', 's676772859', 's867634735'] | [9240.0, 9156.0, 9256.0] | [139.0, 23.0, 144.0] | [546, 489, 572] |
p02660 | u156931988 | 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 decimal import *\nimport math\nA,B = input().split()\nA = Decimal(float(A))\nB = Decimal(float(B))\nprint(math.floor(A*B))', 'from collections import defaultdict\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 ... | ['Runtime Error', 'Accepted'] | ['s899062204', 's937977460'] | [9776.0, 9616.0] | [30.0, 112.0] | [122, 870] |
p02660 | u157232135 | 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 main():\n n = int(input())\n f = set(prime_factorize(n))\n s = set()\n for p in f:\n e = 1\n z = p ** e\n while z <= n:\n if n % z == 0:\n if z not in s:\n n //= z\n s.add(z)\n e += 1\n z = p ** ... | ['Runtime Error', 'Accepted'] | ['s697795250', 's408084258'] | [9196.0, 9220.0] | [26.0, 95.0] | [371, 713] |
p02660 | u171255092 | 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 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]\n\n\ndef prime_le... | ['Wrong Answer', 'Accepted'] | ['s392760470', 's375138631'] | [9260.0, 9216.0] | [232.0, 234.0] | [795, 771] |
p02660 | u174203233 | 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 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 ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s027051627', 's185665582', 's915811959', 's721601012'] | [9376.0, 9200.0, 9140.0, 9464.0] | [111.0, 2206.0, 2205.0, 108.0] | [691, 678, 596, 718] |
p02660 | u177388368 | 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 math import sqrt\n\ndiv = int(sqrt(n))\nans=0\nfor i in range(2,div+1):\n if n%i==0:\n ans+=1\n n=int(n//i)\n\nif ans==0:ans=1\n\nif n==1:ans=0\nprint(ans)', 'n=int(input())\n\nimport math\n\ndef make_prime_list_2(num):\n if num < 2:\n return []\n\n \n prime_lis... | ['Wrong Answer', 'Accepted'] | ['s227523852', 's904115089'] | [9188.0, 49336.0] | [143.0, 281.0] | [181, 1393] |
p02660 | u179376941 | 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\ncount = 0\ni = 1\nnum = n\nwhile num % (2 ** i) == 0:\n num //= 2 ** i\n count += 1\n #print('{}: {}'.format(2**i, count))\n i += 1\n #print(n)\nf = 3\ni = 1\nwhile f * f <= num:\n if num % (f ** i) == 0:\n num //= f ** i\n count += 1\n #print('{}: {}'.format(f ** i, count))\n i ... | ['Wrong Answer', 'Accepted'] | ['s424161559', 's344234811'] | [9216.0, 9216.0] | [225.0, 126.0] | [403, 438] |
p02660 | u183840468 | 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 \n \n return a\n\nfrom collect... | ['Wrong Answer', 'Accepted'] | ['s507005889', 's587392522'] | [9404.0, 9444.0] | [92.0, 93.0] | [732, 637] |
p02660 | u188745744 | 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())\nimport math\ndef div(N):\n ans=0\n for i in range(2,int(N**0.5)+1):\n B=0\n sw=0\n if N%i==0:\n if N//i != i:\n sw=1\n c=N//i\n while N%i==0:\n N//=i\n B+=1\n for j in range(1,10000):\n B-=j\n ... | ['Wrong Answer', 'Accepted'] | ['s934101051', 's906338360'] | [9500.0, 9456.0] | [2205.0, 115.0] | [709, 347] |
p02660 | u193582576 | 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 d = {}\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 d[i] = cnt\n\n if temp!=1:\n d[temp] = 1\n\n if d.keys... | ['Wrong Answer', 'Accepted'] | ['s843621351', 's308884549'] | [9500.0, 9508.0] | [109.0, 112.0] | [918, 961] |
p02660 | u195177386 | 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 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\... | ['Wrong Answer', 'Accepted'] | ['s391887649', 's194300486'] | [9264.0, 9468.0] | [94.0, 95.0] | [528, 507] |
p02660 | u202560873 | 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())\n\nans = 0\ncheck = [True for _ in range(10 ** 6)]\n\nfor p in range(2, 10 ** 6):\n if check[p] == True:\n for j in range(2, (10 ** 6) // p + 1):\n check[p * j] = False\n\n e = 1\n while N % (p ** e) == 0:\n N = N // (p ** e)\n e... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s236736618', 's575939163', 's154489841'] | [16684.0, 16928.0, 24800.0] | [108.0, 480.0, 513.0] | [423, 490, 424] |
p02660 | u217836256 | 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'] | ['s934870773', 's599702219'] | [9120.0, 9500.0] | [19.0, 112.0] | [598, 599] |
p02660 | u221272125 | 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\nn = int(N**0.5)\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... | ['Wrong Answer', 'Accepted'] | ['s596356053', 's935406984'] | [9684.0, 9512.0] | [2205.0, 114.0] | [557, 667] |
p02660 | u221998589 | 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 math\nfrom decimal import *\n#from numba import njit\n\ndef getVar():\n return map(int, input().split())\ndef getArray():\n return list(map(int, input().split()))\ndef getNumpy():\n return np.array(list(map(int, input().split())), dtype='int64')\n\ndef factorization(n):\n d = {}... | ['Runtime Error', 'Accepted'] | ['s842691004', 's437138110'] | [27068.0, 27136.0] | [195.0, 200.0] | [844, 843] |
p02660 | u225845681 | 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())\nif N == 1:\n print(0)\n exit()\n\n\nM = int(math.sqrt(N))+1\nsosu = [2]\na = 0\nfor i in range(3,M,2):\n if sosu[a] <= math.sqrt(i):\n a += 1\n hantei = (i%x for x in sosu[:a+1])\n if 0 not in hantei:\n sosu.append(i)\n\nsoin = []\nfor p in sosu:\n for j in range(1,N+1... | ['Wrong Answer', 'Accepted'] | ['s157701712', 's944667716'] | [12364.0, 12360.0] | [1292.0, 1287.0] | [573, 680] |
p02660 | u228303592 | 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):\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 arr.append([n, 1])\n \n return arr\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s262347935', 's416967045', 's980838562', 's303328159'] | [9500.0, 96472.0, 9508.0, 9432.0] | [110.0, 1206.0, 21.0, 109.0] | [534, 545, 542, 536] |
p02660 | u232903302 | 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'] | ['s188485742', 's928787304'] | [9192.0, 9516.0] | [23.0, 110.0] | [812, 854] |
p02660 | u242580186 | 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 primelist(num):\n if num < 2:\n return []\n ls = [2]\n n = int(math.sqrt(num))\n for i in range(3, n+1, 2):\n prime = True\n for j in ls:\n if i % j ==0:\n prime = False\n break\n if prime:\n ls += [i]\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s210771950', 's467866111', 's993733416'] | [24096.0, 9108.0, 9116.0] | [2206.0, 160.0, 164.0] | [581, 481, 679] |
p02660 | u248670337 | 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,n=0,int(input())\nfor i in range(2,10**6):\n x=j=0\n while n%i<1:n/=i;x+=1\n while x>=j:a+=1;j+=1;x-=j\nprint(a+(n>1))', 'a,n=0,int(input())\nfor i in range(2,int(n**0.5+1)):x=0\n while(n%i==0):n//=i;x+=1\n j=1\n while(x>=j):a+=1;x-=j;j+=1\nprint(1 if n-1 else a)', 'a,n=0,int(input())\nfor i in range(2,10**6)... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s771731940', 's840652769', 's785752967'] | [9244.0, 9012.0, 9184.0] | [376.0, 27.0, 211.0] | [118, 139, 118] |
p02660 | u254221913 | 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 primes(n): \n cnt=collections.defaultdict(int)\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n while n%i==0:\n cnt[i]+=1\n n//=i\n if n!=1:\n cnt[n]+=1\n return cnt\n\nn=int(input())\ncnt=primes(n)\nans=0\nfor key in cnt.keys():\n val=cnt[key]\n print(key,val)\n ... | ['Wrong Answer', 'Accepted'] | ['s953352176', 's170170636'] | [9700.0, 9720.0] | [113.0, 112.0] | [549, 532] |
p02660 | u256027816 | 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\nimport collections\n\n\ndef trial_division(n):\n factor = []\n tmp = int(math.sqrt(n)) + 1\n for num in range(2, tmp):\n while n % num == 0:\n n //= num\n if num != 1:\n factor.append(num)\n if not factor:\n return -1\n else:\n fact... | ['Wrong Answer', 'Accepted'] | ['s790092581', 's911866995'] | [9492.0, 9488.0] | [112.0, 114.0] | [683, 668] |
p02660 | u259190728 | 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 primefact(n):\n l=[]\n if n%2==0:\n while n%2==0:\n n=n//2\n l.append(2)\n for i in range(3,int(n**0.5)+1,2):\n if n%i==0:\n while n%i==0:\n n=n//i\n l.append(i)\n if n>2:\n l.append(n)\n print(len(l))\nn=int(input())\nprim... | ['Wrong Answer', 'Accepted'] | ['s713526941', 's659645675'] | [9360.0, 9464.0] | [67.0, 67.0] | [312, 415] |
p02660 | u263753244 | 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(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 list(set(a))\nx=int(input())\np=prime(x)\ns... | ['Wrong Answer', 'Accepted'] | ['s754611418', 's912575663'] | [9208.0, 9212.0] | [92.0, 93.0] | [411, 402] |
p02660 | u268183312 | 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\nn = int(input())\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(n**0.5)+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... | ['Wrong Answer', 'Accepted'] | ['s534175310', 's820590657'] | [27148.0, 27164.0] | [196.0, 200.0] | [608, 610] |
p02660 | u268822556 | 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 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 return arr\nN = int(i... | ['Runtime Error', 'Accepted'] | ['s797329015', 's499786406'] | [9476.0, 9412.0] | [25.0, 111.0] | [513, 505] |
p02660 | u277641173 | 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())\nk=n\ndic={}\nimport math\nfor i in range(2,math.floor(math.sqrt(n))+1):\n for j in range(10**10):\n if n%i==0:\n if i in dic:\n dic[i]+=1\n else:\n dic[i]=1\n n=n//i\n else:\n break\n\ncount=0\nif k!=1:\n if not dic:\n count+=1\n if n!=1:\n count+=1\npr... | ['Wrong Answer', 'Accepted'] | ['s585075330', 's954650716'] | [9204.0, 9216.0] | [426.0, 427.0] | [477, 449] |
p02660 | u284363684 | 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_fact(n):\n primes = []\n append = primes.append\n while n % 2 == 0:\n append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n append(n)\n return primes\... | ['Wrong Answer', 'Accepted'] | ['s782070371', 's212367255'] | [9240.0, 9144.0] | [92.0, 93.0] | [769, 836] |
p02660 | u285022453 | 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# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A&lang=ja\n\nimport math\nfrom collections import Counter\nn = int(input())\norigin = n\nans = []\n\ni = 2\nwhile i <= math.sqrt(n):\n if n % i == 0:\n n //= i\n ans.append(str(i))\n else:\n i += 1\n\nif n != 1:\n ans.app... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s003363317', 's551389437', 's255856273'] | [9492.0, 9456.0, 9352.0] | [306.0, 313.0, 295.0] | [595, 585, 596] |
p02660 | u285257696 | 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\n\nimport math\nN = int(input())\ns = {}\n\nfor i in range(2, math.ceil(math.sqrt(N))):\n mod = N % i\n while mod == 0:\n s[i] = s.get(i, 0) + 1\n N = N // i\n\n if N == 0:\n break\n\n mod = N % i\nif not N == 1:\n s[N] = s.get(N, 0) + 1\n\ncount = 0\nfor prime in s:... | ['Wrong Answer', 'Accepted'] | ['s196843289', 's712211356'] | [9176.0, 9228.0] | [184.0, 174.0] | [606, 641] |
p02660 | u285372827 | 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(10 ** 9)\na = int(input())\ncount = 0\n#used = []\n\n# if a%first == 0:\n# #used.append(first)\n# a /= first\n# count += 1\n# if a==1:\n# return count\n# else:\n# div_battle(a,first+1)\ncount = 0\nfirst = a\nwhile a!=1:\n if a % first == 0:\n a /= first\n cou... | ['Wrong Answer', 'Accepted'] | ['s726905478', 's353385971'] | [9172.0, 9532.0] | [23.0, 92.0] | [360, 583] |
p02660 | u285436211 | 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 if temp!=1:\n arr.append([temp, 1])\n if arr==[]:... | ['Runtime Error', 'Accepted'] | ['s651454068', 's694512929'] | [9028.0, 9284.0] | [28.0, 118.0] | [571, 570] |
p02660 | u291028869 | 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'] | ['s172234012', 's751454094'] | [9652.0, 9620.0] | [202.0, 109.0] | [869, 841] |
p02660 | u299645128 | 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())\npri_cnt = {}\nn = N\ni = 2\n\nwhile i ** 2 <= N\n while n % i == 0:\n if i not in div_cnt:\n pri_cnt[i] = 1\n else:\n pri_cnt[i] += 1\n \n n = n / i\n\nif n > 1:\n pri_cnt[N] = 1\n\nans = 0\nfor pri, cnt in pri_knt:\n count = 1\n remain = cnt\n while remain > count:\n a... | ['Runtime Error', 'Accepted'] | ['s178422377', 's745648052'] | [9032.0, 9176.0] | [29.0, 223.0] | [349, 404] |
p02660 | u303058371 | 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())\nd = n\nm = {}\n\nfor i in range(2, int(math.sqrt(n)) + 1):\n m[i] = 0\n while (d % i == 0):\n d //= i\n m[i]+=1\nres = 0\nprint(m)\nfor i in m.values():\n res+=int(math.sqrt(i*2))\nif d > 1:\n res += 1\nprint(res)\n', 'import math\n\nn = int(input())\nd = n\n... | ['Wrong Answer', 'Accepted'] | ['s992681365', 's634893359'] | [108020.0, 92768.0] | [708.0, 514.0] | [256, 257] |
p02660 | u307622233 | 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_list(lst, limit):\n for num in range(3, limit, 2):\n if num ** 2 > limit:\n break\n # is_prime(num, lst)\n flag = True\n for p_num in lst:\n if (p_num * p_num > num):\n break\n else:\n if (num % p_num == 0):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s068856982', 's202971362', 's316174926'] | [16004.0, 15564.0, 9468.0] | [1247.0, 1156.0, 152.0] | [1112, 1274, 650] |
p02660 | u312158169 | 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())\n\ncount = 0\n\ndef sosu(n,z):\n for i in range(z, int(math.sqrt(n))+1):\n if n%i == 0:\n return i\n break\n return -1\n\nif sosu(n,2) == -1 and n != 1:\n print(1)\n exit()\n\nans = 0\nz = 2\n\ndef hantei(n):\n i = sosu(n,2)\n s = 0\n if... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s030837372', 's205431624', 's778769726', 's023032161'] | [9444.0, 9468.0, 9520.0, 9488.0] | [196.0, 197.0, 194.0, 112.0] | [869, 870, 880, 570] |
p02660 | u313890617 | 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\nsys.setrecursionlimit(10**6)\n\nn=int(input())\n\nm=int(np.sqrt(n))+1\n\nif n==1 or n==0:\n print(0)\n exit()\n\nans=0\nfor i in range(2,m):\n cnt=0\n for j in range(44):\n if n%i==0:\n n=n/i\n print("i=",i,"n=",n)\n cnt+=1\n e... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s150677608', 's782574313', 's124284149'] | [27120.0, 27180.0, 27172.0] | [728.0, 718.0, 745.0] | [670, 665, 671] |
p02660 | u314089899 | 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 factorize_dict(n):\n b = 2\n fct = dict()\n while b * b <= n:\n while n % b == 0:\n n //= b\n #fct.append(b)\n if b not in fct:\n fct[b] = 1\n else:\n fct[b] += 1\n b = b + 1\n if n > 1:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s115310152', 's225402462', 's830588946'] | [9272.0, 9284.0, 9288.0] | [163.0, 161.0, 160.0] | [851, 851, 853] |
p02660 | u315354220 | 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")\n exit()\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 ... | ['Wrong Answer', 'Accepted'] | ['s548486173', 's226731478'] | [9464.0, 9364.0] | [98.0, 95.0] | [530, 530] |
p02660 | u323045245 | 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)\n exit()\n\ndef make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n divisors.sort()\n return divisors\ndivisors = make... | ['Wrong Answer', 'Accepted'] | ['s244957104', 's418835254'] | [9452.0, 36824.0] | [122.0, 159.0] | [663, 856] |
p02660 | u327465093 | 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())\n\ndef furui(n):\n if n < 2:\n return []\n plist = [1 for i in range(n)]\n plist[0] = plist[1] = 0\n for i in range(2, n):\n if plist[i]:\n for j in range(i*2, n, i):\n plist[j] = 0\n ret = []\n for i in range(n):\n if plis... | ['Wrong Answer', 'Accepted'] | ['s709192572', 's813879026'] | [20096.0, 19968.0] | [406.0, 326.0] | [1039, 1004] |
p02660 | u328179275 | 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 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\na = prim... | ['Wrong Answer', 'Accepted'] | ['s132837920', 's190608169'] | [9224.0, 9236.0] | [92.0, 94.0] | [528, 539] |
p02660 | u329049771 | 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 \n res = {}\n temp = n\n for i in range(2, int(-(-n**0.5//1))+1):\n if temp % i == 0:\n res[i] = 0\n while temp % i ==0:\n res[i] += 1\n temp //= i\n\n if temp != 1:\n res[temp] = 1\n\n if len(res) == 0:\n r... | ['Wrong Answer', 'Accepted'] | ['s322389322', 's507179295'] | [9544.0, 9540.0] | [110.0, 112.0] | [1184, 1169] |
p02660 | u335950809 | 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\np = "2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s176321008', 's231038227', 's239070202', 's293351417', 's753401267', 's953470261', 's968835968', 's225666961'] | [9172.0, 9092.0, 9220.0, 9172.0, 9196.0, 9316.0, 9184.0, 127844.0] | [111.0, 23.0, 109.0, 23.0, 26.0, 112.0, 23.0, 947.0] | [1260, 1582, 1259, 370, 642, 1258, 660, 391] |
p02660 | u338597441 | 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 func(N):\n tmp=N\n arr=[]\n for i in range(2,(N**0.5//1+1)):\n if tmp%i==0:\n cnt=0\n while tmp%i==0:\n cnt+=1\n tmp//=i\n arr.append([i,cnt])\n \n if tmp!=1:\n arr.append([tmp, 1])\n if arr==[]:\n arr.ap... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s027162286', 's096227667', 's270720579', 's341192793', 's922470838', 's557623408'] | [9504.0, 9284.0, 9488.0, 9488.0, 9404.0, 9480.0] | [24.0, 2205.0, 110.0, 111.0, 112.0, 108.0] | [576, 628, 524, 584, 582, 544] |
p02660 | u338904752 | 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())\n\nfact = set()\ncounter = 0\n\nfor i in range(2, int(math.sqrt(N))+1):\n if N % i != 0:\n continue\n powt = 0\n while N % i == 0:\n powt += 1\n N /= i\n fact.add((i, powt))\n\nif N != 1:\n fact.add((N, 1))\n\nfor base, e in fact:\n for t in range... | ['Wrong Answer', 'Accepted'] | ['s762451081', 's348370458'] | [9244.0, 9248.0] | [140.0, 143.0] | [398, 386] |
p02660 | u339199690 | 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 f(n):\n arr = list()\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(tuple(i, cnt))\n\n if temp != 1:\n tup = tup... | ['Runtime Error', 'Accepted'] | ['s287581447', 's642229497'] | [9124.0, 9244.0] | [109.0, 110.0] | [636, 629] |
p02660 | u346308892 | 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 numpy as np\nfrom functools import *\nimport sys\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\n\n\nimport numpy as np\n\ndef acinput():\n return list(map(int, input().split(" ")))\n\n \ndef factorize(n):\n fct = [] \n b, e = 2, 0 \n while b * b <= n:\n while n % b == 0:\... | ['Wrong Answer', 'Accepted'] | ['s136110019', 's203388331'] | [27100.0, 27164.0] | [342.0, 333.0] | [651, 663] |
p02660 | u347452770 | 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 trial_division(n):\n \n factor = []\n \n tmp = int(math.sqrt(n)) + 1\n for num in range(2,tmp):\n while n % num == 0:\n n //= num\n factor.append(num)\n \n if not factor:\n return 'prime number'\n else:\n factor.append(n)\n ... | ['Runtime Error', 'Accepted'] | ['s307763922', 's831167152'] | [9288.0, 9528.0] | [111.0, 113.0] | [681, 741] |
p02660 | u354804355 | 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'] | ['s797255219', 's635482895'] | [9160.0, 9492.0] | [23.0, 110.0] | [532, 549] |
p02660 | u362127784 | 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())\nlist= []\nn = 0\nfor i in range(2,1000000):\n if (a % i == 0):\n warikaisi = True\n while(warikaisi):\n if a % i == 0:\n list.append(i)\n a = a / i\n else:\n n = n + 1\n warikaisi = False\nprint(n)', 'a... | ['Wrong Answer', 'Accepted'] | ['s942379671', 's481717319'] | [9188.0, 9276.0] | [156.0, 167.0] | [300, 546] |
p02660 | u362599643 | 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 factorize(n):\n a = 2\n fct = []\n while a <= n:\n print('-------')\n while n % a == 0:\n n = n // a\n fct.append(a)\n a += 1\n if n > 1:\n fct.append(n)\n return fct\n \n \nn = int(input())\nc = Counter(factorize... | ['Wrong Answer', 'Accepted'] | ['s751360018', 's735960294'] | [61680.0, 9468.0] | [2430.0, 164.0] | [464, 468] |
p02660 | u363074342 | 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 factorize(n):\n fct = [] \n b, e = 2, 0 \n while b * b <= n:\n while n % b == 0:\n n = n // b\n e = e + 1\n if e > 0:\n fct.append([b, e])\n b, e = b + 1, 0\n if n > 1:\n fct.append([n, 1])\n return fct\n\naoinsu = f... | ['Wrong Answer', 'Accepted'] | ['s186464665', 's578326853'] | [9240.0, 9232.0] | [182.0, 178.0] | [582, 581] |
p02660 | u364061715 | 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 result = 0\n for i in range(len(factorization(N))):\n tempnumber = factorization(N)[i][1]\n plusnumber = 1\n while tempnumber > 0:\n tempnumber -= plusnumber\n result += 1\n plusnumber += 1\n print(resul... | ['Runtime Error', 'Accepted'] | ['s689059812', 's808194537'] | [9184.0, 9500.0] | [22.0, 452.0] | [308, 660] |
p02660 | u364693468 | 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 sympy\nN = int(input())\np_list = list(sympy.primerange(2,1000000))\nprint(p_list)\ncnt = 0\nfor i in range(10000):\n j = 1\n while N % (p_list[i] ** j) == 0:\n cnt += 1\n N = N / (p_list[i] ** j)\n j += 1\n a = sympy.isprime(N)\n if a == True:\n cnt += 1\n break\... | ['Runtime Error', 'Time Limit Exceeded', 'Accepted'] | ['s499600104', 's904191006', 's288934345'] | [9064.0, 87252.0, 9464.0] | [24.0, 2208.0, 166.0] | [314, 864, 588] |
p02660 | u364774090 | 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\n\nd = 2\nwhile d * d < n:\n if n % d != 0:\n d += 1\n continue\n\n e = d\n while n % e == 0:\n print(n, e)\n n //= e\n e *= d\n ans += 1\n\nif n != 1:\n ans += 1\n\nprint(ans)', 'n = int(input())\nans = 0\n\nd = 2\nwhile d * d <= n:\n ... | ['Wrong Answer', 'Accepted'] | ['s860743473', 's146638401'] | [9148.0, 9188.0] | [228.0, 224.0] | [237, 256] |
p02660 | u373047809 | 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=1\nwhile p<1e6:\n c=t=0;p+=1\n while n%p<1:n/=p;x=c==t;t+=x;c+=1-t*x\nprint(t+1-(n<2))', 'n=int(input())\na=p=1\nwhile p<1e6:\n c=t=0;p+=1\n while n%p<1:n/=p;x=c==t;t+=x;c+=1-t*x;a+=x\nprint(a-(n<2))'] | ['Wrong Answer', 'Accepted'] | ['s309370079', 's318817163'] | [9188.0, 9248.0] | [248.0, 253.0] | [99, 104] |
p02660 | u374082254 | 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\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\nN ... | ['Runtime Error', 'Accepted'] | ['s845026027', 's256039633'] | [9408.0, 9212.0] | [92.0, 91.0] | [492, 545] |
p02660 | u377158682 | 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... | ['pf={}\nm=int(input())\nfor i in range(2,int(m**0.5)+1):\n while m%i==0:\n pf[i]=pf.get(i,0)+1\n m//=i\nif m>1:pf[m]=1\nprint(pf)\n\ncnt = 0\na = []\na.append(0)\nfor i in range(1,30000):\n a.append(i + a[i-1])\n#print(a)\nfor i in pf:\n s = pf[i]\n c = s\n if c in a:\n cnt += a.ind... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s492009315', 's622903681', 's570436538'] | [10448.0, 10420.0, 9456.0] | [147.0, 146.0, 144.0] | [358, 358, 357] |
p02660 | u382407432 | 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 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]\n\ndef factoriza... | ['Wrong Answer', 'Accepted'] | ['s120232447', 's826216625'] | [9456.0, 9536.0] | [917.0, 914.0] | [980, 966] |
p02660 | u385309449 | 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(y):\n arr = []\n temp = y\n for i in range(2, int(-(-y**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])\n if arr==[]:... | ['Wrong Answer', 'Accepted'] | ['s298381308', 's058557908'] | [9516.0, 9496.0] | [112.0, 111.0] | [606, 587] |
p02660 | u397496203 | 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\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, cnt])\n i... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s674584634', 's700020314', 's835060343'] | [9164.0, 9516.0, 9500.0] | [22.0, 104.0, 112.0] | [804, 901, 851] |
p02660 | u397953026 | 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)\n exit()\n\ndef factorization(num):\n arr = []\n temp = num\n for i in range(2, int(num**0.5)+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 ... | ['Wrong Answer', 'Accepted'] | ['s243929042', 's824358732'] | [9484.0, 9488.0] | [116.0, 115.0] | [600, 591] |
p02660 | u398930122 | 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_factors(n):\n i = 2\n factors = []\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n factors.append(i)\n if n > 1:\n factors.append(n)\n return factors\nf = list(set(prime_factors(n)))\nprint(f)\nans = 0\nfor i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s003763395', 's585701566', 's492317725'] | [9208.0, 9216.0, 9100.0] | [167.0, 169.0, 171.0] | [409, 446, 401] |
p02660 | u405733072 | 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 if temp!=1:\n arr.append([temp, 1])\n if arr==[]:... | ['Runtime Error', 'Accepted'] | ['s395717856', 's378283825'] | [9224.0, 9444.0] | [27.0, 121.0] | [543, 543] |
p02660 | u406355300 | 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 f = 2\n while n % f == 0:\n a.append(f)\n n //= f\n f *= 2 \n\n g = 3\n while g * g <= n:\n if n % g == 0:\n a.append(g)\n n //= g\n g += 2\n else:\n g += 2\n flag ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s080103897', 's425269368', 's563219971', 's749208993', 's915131935', 's998221192', 's511957568'] | [9332.0, 9308.0, 9468.0, 9452.0, 9324.0, 9296.0, 9272.0] | [165.0, 95.0, 94.0, 165.0, 165.0, 93.0, 93.0] | [786, 365, 600, 880, 785, 411, 644] |
p02660 | u408375121 | 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... | ['sieve = [True] * (10**6+1)\nprime = []\nfor i in range(2, 10**6):\n if sieve[i]:\n prime.append(i)\n if i < 10**3:\n for j in range(i**2, 10**6, i):\n sieve[j] = False\nn = int(input())\nif n == 1:\n print(0)\nelse:\n e = []\n for p in prime:\n if n % p == 0:\n idx = 0\n while n % p... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s010127821', 's275661040', 's422650395', 's769539055', 's946405314', 's196825513'] | [8896.0, 9020.0, 9056.0, 9064.0, 9072.0, 19964.0] | [24.0, 26.0, 22.0, 23.0, 23.0, 311.0] | [632, 628, 610, 630, 617, 627] |
p02660 | u411923565 | 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 cnt = 0\n \n two_div = 2\n while n%2==0 and (n>=two_div):\n cnt += 1\n n //= two_div\n \n two_div *= 2\n \n print(n)\n f = 3\n f_div = 3\n \n while f*f <= n:\n if n%f_div == 0:\n cnt += 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s355063445', 's466414495', 's488013172', 's531838777', 's558930600', 's592933938', 's474103627'] | [9208.0, 9168.0, 9148.0, 9140.0, 9252.0, 9144.0, 9176.0] | [101.0, 2206.0, 100.0, 100.0, 101.0, 101.0, 96.0] | [790, 719, 894, 576, 1002, 825, 527] |
p02660 | u412197640 | 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 *\nfrom collections import Counter\nN = int(stdin.readline())\nthings = []\nif N ==1:\n print(0)\n exit()\nfor i in range(2,N):\n if i*i > N:\n if len(things) == 0:\n print(1)\n exit()\n break\n while(N%i == 0):\n things.append(i)\n N = N/i... | ['Wrong Answer', 'Accepted'] | ['s532807685', 's786792650'] | [9540.0, 9540.0] | [249.0, 272.0] | [510, 562] |
p02660 | u426175055 | 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 defaultdict\n\n\nN = int(input())\nn = N\n\nfactor = defaultdict(lambda: 0)\ntmp = int(math.sqrt(N))+1\nfor num in range(2,tmp):\n while N % num == 0:\n N //= num\n factor[num] += 1\nif not factor:\n factor[n] += 1\nelif N != 1:\n factor[N] += 1\n\nprint(fac... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s022981817', 's275977752', 's850960343'] | [9512.0, 9484.0, 9484.0] | [152.0, 148.0, 144.0] | [486, 466, 482] |
p02660 | u432098488 | 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\n\nN = int(input())\nans = prim... | ['Wrong Answer', 'Accepted'] | ['s471345587', 's168246299'] | [9136.0, 9464.0] | [85.0, 109.0] | [331, 496] |
p02660 | u434846982 | 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())\nlimit = n**0.5\nq = 2\n\nif n == 1:\n print(0)\nelse:\n ans = 0\n while q < limit:\n cnt = 0\n while n % q == 0:\n cnt += 1\n n /= q\n if cnt > 0:\n ans += int((2*cnt + 0.25)**0.5 + 1.5 - 10**(-100))\n limit = n**0.5\n ... | ['Wrong Answer', 'Accepted'] | ['s295227585', 's741505322'] | [9348.0, 9288.0] | [264.0, 258.0] | [324, 342] |
p02660 | u437351386 | 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,b=list(map(float,input().split()))\nc=a*(b*100)\nd=int(c//100)\nprint(d)', 'import collections\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 ... | ['Runtime Error', 'Accepted'] | ['s096148329', 's475081043'] | [9092.0, 9468.0] | [25.0, 96.0] | [71, 527] |
p02660 | u439063038 | 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())\nnum_list = [0] + [0] * int(math.sqrt(N)) # 0~N\npn_list = []\nfor i in range(2, int(math.sqrt(N))+1):\n if num_list[i] == 0:\n pn_list.append(i)\n num_list[i::i] = [1] * len(num_list[i::i])\n\ncount = 0\nfor pn in pn_list:\n e = 1\n while N%(pn**e)==0 and N//(p... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s125046407', 's356778847', 's380128394', 's439271843', 's773353994', 's933189196', 's869589301'] | [27036.0, 27152.0, 9060.0, 9192.0, 27128.0, 17144.0, 17140.0] | [230.0, 239.0, 28.0, 2205.0, 204.0, 387.0, 404.0] | [426, 470, 461, 435, 430, 341, 341] |
p02660 | u444481227 | 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 = 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([i, cnt])\n\nif temp!=1:\n arr.append([temp, 1])\n\nif arr==[]:\n arr.append([n, 1])\n\nif arr==[[1,1]]:\n print(0)\n\nelse:... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s063137426', 's726516919', 's129366742'] | [9096.0, 9152.0, 9492.0] | [25.0, 24.0, 146.0] | [509, 509, 508] |
p02660 | u449473917 | 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'] | ['s741597638', 's424763882'] | [9328.0, 9500.0] | [111.0, 112.0] | [596, 587] |
p02660 | u449863068 | 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の約数列挙"\ndef divisor(n):\n ass = []\n for i in range(1,int(n**0.5)+1):\n if n%i == 0:\n ass.append(i)\n if i**2 == n:\n continue\n ass.append(n//i)\n return ass\n\n"nの素因数分解"\ndef prime_factor(n):\n ass = []\n for i in range(2,int(n**0.5)+1):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s033103676', 's958651451', 's320974869'] | [9496.0, 8944.0, 9740.0] | [196.0, 24.0, 112.0] | [793, 2, 835] |
p02660 | u455408345 | 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(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\n\n\n\n\n\n\nn=int(input(""))\n\ns=0\... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s265012400', 's702009317', 's787142170', 's936650872', 's611391233'] | [9268.0, 9088.0, 9184.0, 9236.0, 9228.0] | [104.0, 2206.0, 100.0, 99.0, 99.0] | [704, 225, 698, 807, 761] |
p02660 | u455629561 | 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... | ['x = int(input())\nimport math\nfrom collections import defaultdict\n\nres = 0\nvalue = defaultdict(int)\ndef isprime(n):\n if n <= 1:\n return 0\n m = int(math.sqrt(n)) + 1\n for i in range(2, m):\n if n % i == 0:\n return 0\n return 1\nif isprime(x):\n print(1)\nelse:\n def... | ['Wrong Answer', 'Accepted'] | ['s162322075', 's248656112'] | [9504.0, 9488.0] | [441.0, 240.0] | [768, 840] |
p02660 | u457901067 | 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 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'] | ['s381038561', 's893553515'] | [9420.0, 9488.0] | [110.0, 112.0] | [574, 575] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.