s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s263097374 | p02548 | u879866069 | 1600545911 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9084 | 116 | import sympy
n = int(input())
count = 0
for i in range(1, n, 1):
count += sympy.divisor_count(i)
print(count)
|
s699301292 | p02548 | u426092370 | 1600545891 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9100 | 118 | import sympy
kazu=int(input())
ans=0
for i in range(kazu):
a=sympy.divisors(i)
b=len(a)
ans+=b
print(ans) |
s710260520 | p02548 | u032625182 | 1600545887 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9040 | 171 | import os,sys
a,b,c=0
count=0
n=input()
for a in range(n):
for b in range(n):
for c in range(n):
if a*b+c==n:
count+=1
print(count) |
s531059359 | p02548 | u879866069 | 1600545874 | Python | PyPy3 (7.3.0) | py | Runtime Error | 101 | 74668 | 116 | import sympy
n = int(input())
count = 0
for i in range(1, n, 1):
count += sympy.divisor_count(i)
print(count)
|
s666906363 | p02548 | u629540524 | 1600545848 | Python | PyPy3 (7.3.0) | py | Runtime Error | 237 | 68632 | 148 | import numpy as np
N=int(input())
div = np.zeros(N+1, np.int64)
for n in range(1, N+1):
for m in range(n, N+1, n):
div[m] += 1
print(sum(div)) |
s722570151 | p02548 | u421693050 | 1600545826 | Python | Python (3.8.2) | py | Runtime Error | 582 | 643168 | 229 | import sys, math
sys.setrecursionlimit(10 ** 9 + 7)
n = int(input())
def A(a, count):
if a > n:
print(count)
elif n % a == 0:
A(a + 1, count + n // a - 1)
else:
A(a + 1, count + n // a)
A(1, 0) |
s477668615 | p02548 | u972991614 | 1600545817 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9452 | 431 | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr... |
s486592419 | p02548 | u889282850 | 1600545775 | Python | Python (3.8.2) | py | Runtime Error | 131 | 27156 | 405 | import numpy as np
N = input()
rN = int(np.sqrt(N))
setN = 0
setN2 = 0
for c in range(1, N):
for a in range(1, rN+1):
if (N-c)%a == 0:
if a*a == N-c:
setN += 1
#print(a, a, c, N-c)
elif (N-c)/a > rN:
setN += 2
else:
... |
s980758051 | p02548 | u178788290 | 1600545739 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8980 | 128 | N=int(input())
cou=0
for i in range(1:N-1):
for w in range(1:(N-i)):
if (N-i)%w==0:
cou+=1
print(cou)
|
s272786762 | p02548 | u421693050 | 1600545633 | Python | Python (3.8.2) | py | Runtime Error | 698 | 643248 | 355 | import sys
import math
def INT(): return int(input())
sys.maxsize = 10 ** 15
sys.setrecursionlimit(10 ** 9 + 7)
# -*- coding: utf-8 -*-
n = INT()
def A(a, count):
global n
if a > n:
print(count)
else:
if n % a == 0:
A(a + 1, count + n // a - 1)
else:
A(a + ... |
s389417027 | p02548 | u980753441 | 1600545617 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9044 | 555 | import collections
import numpy as np
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
... |
s707461398 | p02548 | u221272125 | 1600545616 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9264 | 225 | N = int(input())
s = [0,1]
for i in range(2,N):
for j in range(2,i**0.5+1):
if i % j == 0:
k = i//j
s.apppend(2*s[k])
break
if len(s) != i:
s.append(1)
print(sum(s)) |
s415342897 | p02548 | u331906013 | 1600545581 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9184 | 226 | import math
n = int(input())
k = int(math.sqrt(n)) if n != k ** 2 else int(math.sqrt(n)) - 1
ans = 0
for i in range(1, k + 1):
t = int((n - 1) / i)
ans += (t- i + 1) * 2
if n != i ** 2:
ans -= 1
print(ans) |
s657103663 | p02548 | u980753441 | 1600545563 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9184 | 234 | N = int(input())
ans = 0
for i in range(1, N):
if N-i == 1:
ans += 1
if N-i > 1:
c = collections.Counter(prime_factorize(N-i))
prod = np.prod(np.array(list(c.values()))+1)
ans += prod
print(ans) |
s491245549 | p02548 | u822090837 | 1600545525 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9180 | 324 | N=int(input())
import math
def num_divisors_trial_division(n):
num = 0
for i in xrange(1, int(math.sqrt(n) + 1e-9) + 1):
if n % i == 0:
num += 1
if n != i**2:
num += 1
return num
for k in range(1,N):
count=count+num_divisors_trial_division(k)
print(co... |
s297461789 | p02548 | u544865362 | 1600545462 | Python | Python (3.8.2) | py | Runtime Error | 2208 | 97828 | 662 | import sys
import math
def helper(x, N, hashset):
left = 1
right = x
ans = 0
# while left <= right:
# prod = left * right
# if prod == x:
# # print(left, right, x, N)
# if left == right:
# ans += 1
# else:
# ans += 2
# left += 1
# right -= 1
# elif prod > x:
# right -= 1
# else:... |
s453145421 | p02548 | u331906013 | 1600545428 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9092 | 226 | import math
n = int(input())
k = int(math.sqrt(n)) if n != k ** 2 else int(math.sqrt(n)) - 1
ans = 0
for i in range(1, k + 1):
t = int((n - 1) / i)
ans += (t- i + 1) * 2
if n != i ** 2:
ans -= 1
print(ans) |
s407661648 | p02548 | u050103839 | 1600545428 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9192 | 125 | N = int(input())
cnt = 0
for c in range(1, N-1):
for a in range(1, N - c // 2):
if b % a == 0:
cnt += 2
print(cnt) |
s848734532 | p02548 | u882564128 | 1600545423 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9096 | 126 | from sympy import divisors
n = int(input())
cnt = 0
for i in range(1, n):
k = n-i
cnt += len(divisors(k))
print(cnt)
|
s166806756 | p02548 | u102816329 | 1600545422 | Python | Python (3.8.2) | py | Runtime Error | 33 | 16580 | 263 | import math
N = int(input())
yakusu = [0] * N+1
yakusu[1] = 1
for i in range(2,N+1):
for j in range(1,i):
if i*j > N:
break
yakusu[i*j] += 2
yakusu[i*i] += 1
counter = 0
for num in yakusu[1:N]:
counter += num
print(counter)
|
s123466715 | p02548 | u274755552 | 1600545385 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9048 | 145 | N = input()
B = 1
C = 1
cur=0
while C <= N:
K = N - C
C += 1
while B <= N:
L = K % B
B += 1
if L = 0:
cur += 1
print(cur) |
s682418083 | p02548 | u125269142 | 1600545374 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8816 | 278 | %%time
n = int(input())
# c = N - a*b
cnt = 0
for a in range(1, n, 1):
for b in range(1, n, 1):
if n <= a*b:
break
else:
if a != b:
cnt += 2
else:
cnt += 1
break
print(cnt) |
s383401271 | p02548 | u373703188 | 1600545371 | Python | PyPy3 (7.3.0) | py | Runtime Error | 103 | 68664 | 350 | def get_divisors(n):
if n < 1:
return
i = 1
while i * i <= n:
if n % i == 0:
yield i
if i * i != n:
yield round(n / i)
i = i + 1
n = int(input())
# a * b + c = n
# a * b - n = c
cnt = 0
import sympy
for i in range(1, n):
cnt += len(list(g... |
s829560862 | p02548 | u876754484 | 1600545326 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9060 | 255 | import sympy
N = int(input())
c = 1
total = 0
while(N-c >= 1):
divnums = sympy.divisors(N-c)
# print(N-c,end=" ")
# print(str(divnums) + ", divcombies: " + str(divcombies))
total += len(divnums)
c += 1
print(total) |
s935130336 | p02548 | u785125097 | 1600545323 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9104 | 197 | n = int(input())
count = 0
for i in range(1, n):
for j in range(1, n):
for k in range(1, n):
if (i*j+k) == n:
count += 1
return
print(count) |
s255092586 | p02548 | u822090837 | 1600545310 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9108 | 390 | N=int(input())
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
count=0
for ... |
s723384044 | p02548 | u743383679 | 1600545303 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9032 | 449 | import math
import sympy
# sympy.divisors(10**9)
n = int(input())
# count = 0
# for i in range(1, n):
# count = count + math.ceil(len(sympy.divisors(i)))
# # print(math.ceil(len(sympy.divisors(i))))
# print(count)
count = 0
for a in range(1, n - 1):
if n % a != 0:
b = n // a
else:
b =... |
s614074094 | p02548 | u965937045 | 1600545281 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9184 | 98 | N=int(input())
import sympy
sum=0
for c in range(1,N):
sum+=sympy.divisor_count(c)
print(sum)
|
s103029606 | p02548 | u767438459 | 1600545246 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9052 | 111 | import math
import sympy
n=int(input())
ans=0
for i in range(1,n):
ans+=len(sympy.divisors(n-i))
print(ans) |
s684096079 | p02548 | u965937045 | 1600545204 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9160 | 417 | N=int(input())
sum=0
import sympy
# def make_divisors(n):
# lower_divisors , upper_divisors = [], []
# i = 1
# while i*i <= n:
# if n % i == 0:
# lower_divisors.append(i)
# if i != n // i:
# upper_divisors.append(n//i)
# i += 1
# return lower_divis... |
s478765305 | p02548 | u995323427 | 1600545202 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8936 | 111 | import sympy
N = int(input())
count = 0
for c in range(1, N):
count += len(sympy.divisors(c))
print(count)
|
s479743238 | p02548 | u827261928 | 1600545136 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9032 | 96 | import sympy
N=int(input())
s=0
for i in range(N-1,0,-1):
s+=sympy.divisor_count(i)
print(s) |
s033119774 | p02548 | u372802746 | 1600545134 | Python | Python (3.8.2) | py | Runtime Error | 2205 | 9536 | 169 | N=int(input())
def ans(n):
if n<=0:
return n
x = 0
for i in range(1,n+1):
if n%i==0:
x=x+1
return x +ans(n-1)
print(ans(N-1)) |
s040030926 | p02548 | u997036872 | 1600545119 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9080 | 97 | import sympy
n=int(input())
a = 0
for i in range(n):
a += len(sympy.divisors(n-i-1))
print(a) |
s256809733 | p02548 | u454472984 | 1600545089 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9092 | 167 | import sympy
import sys
sys.setrecursionlimit(10**6)
n=int(input())
ans=0
for c in range(1,n):
ab=n-c
buffer=sympy.divisors(ab)
ans+=len(buffer)
print(ans) |
s257297421 | p02548 | u060505280 | 1600545083 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9568 | 11578 | def divisor_count(n, modulus=1, proper=False):
if not modulus:
return 0
elif modulus != 1:
n, r = divmod(n, modulus)
if r:
return 0
if n == 0:
return 0
n = Mul(*[v + 1 for k, v in factorint(n).items() if k > 1])
if n and proper:
n -= 1
return ... |
s648772747 | p02548 | u421693050 | 1600545072 | Python | Python (3.8.2) | py | Runtime Error | 608 | 643160 | 342 | import sys
import math
def INT(): return int(input())
sys.maxsize = 10 ** 15
sys.setrecursionlimit(10 ** 9 + 7)
# -*- coding: utf-8 -*-
n = INT()
def A(a, count):
if a > n:
print(count)
else:
if n % a == 0:
A(a + 1, count + n // a - 1)
else:
A(a + 1, count + n ... |
s290165323 | p02548 | u421693050 | 1600544995 | Python | Python (3.8.2) | py | Runtime Error | 736 | 643352 | 358 | import sys
import math
def INT(): return int(input())
sys.maxsize = 10 ** 15
sys.setrecursionlimit(10 ** 9 + 7)
# -*- coding: utf-8 -*-
n = INT()
def A(a, count):
if a > n:
print(count)
else:
if float(n) % float(a) == 0.0:
A(a + 1, count + n // a - 1)
else:
A(a... |
s482294186 | p02548 | u221272125 | 1600544979 | Python | PyPy3 (7.3.0) | py | Runtime Error | 84 | 74640 | 401 | N = int(input())
import math
def num_divisors_trial_division(n):
num = 0
for i in range(1, int(math.sqrt(n) + 1e-9) + 1):
if n % i == 0:
num += 1
if n != i**2:
num += 1
return num
s = [0,1]
for i in range(2,N):
if i % 2 = 0:
s.append(s[i//2]*2... |
s528111343 | p02548 | u822090837 | 1600544954 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9160 | 116 | N=int(input())
import sympy
count=0
for k in range(1,N):
r=sympy.divisor_count(k)
count=count+r
print(count) |
s577068387 | p02548 | u221272125 | 1600544898 | Python | PyPy3 (7.3.0) | py | Runtime Error | 146 | 68604 | 376 | N = int(input())
import math
def num_divisors_trial_division(n):
num = 0
for i in range(1, int(math.sqrt(n) + 1e-9) + 1):
if n % i == 0:
num += 1
if n != i**2:
num += 1
return num
s = [0,1]
for i in range(2,N):
if i % 2 = 0:
s.append(s[i//2]*2... |
s262477057 | p02548 | u822090837 | 1600544861 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8968 | 108 | N=int(input())
import sympy
count=0
for k in range(1,N):
count=count+sympy.divisor_count(k)
print(count) |
s738395728 | p02548 | u729679908 | 1600544830 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9008 | 3412 |
package main
import (
"fmt"
"bufio"
"os"
"strconv"
"strings"
)
func StrStdin() string {
scanner := bufio.NewScanner(os.Stdin)
scanner.Scan()
return strings.TrimSpace(scanner.Text())
}
// 1つの符号付き整数値(64bit)入力
// Exapmle:
// ------------------
// 1000000007
//... |
s827388622 | p02548 | u827261928 | 1600544826 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9088 | 96 | import sympy
N=int(input())
s=0
for i in range(N-1,0,-1):
s+=len(sympy.divisors(i))
print(s) |
s496191137 | p02548 | u519922200 | 1600544812 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9012 | 99 | N = int(input())
import sympy
ans=0
for i in range(1,N):
ans+=sympy.divisor_count(i)
print(ans) |
s324085361 | p02548 | u373703188 | 1600544796 | Python | PyPy3 (7.3.0) | py | Runtime Error | 169 | 68692 | 434 | def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
n = int(input())
# a * b + ... |
s592101616 | p02548 | u519922200 | 1600544784 | Python | PyPy3 (7.3.0) | py | Runtime Error | 99 | 68704 | 99 | N = int(input())
import sympy
ans=0
for i in range(1,N):
ans+=sympy.divisor_count(i)
print(ans) |
s533670493 | p02548 | u967414299 | 1600544724 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9108 | 303 | import sympy
def couples(num: int) -> int:
count = 0
for i in range(num - 1):
_sub = i + 1
yakusus = sympy.divisors(num - _sub)
count += len(yakusus)
return count
def main():
num = int(input())
print(couples(num))
if __name__ == '__main__':
main()
|
s904930842 | p02548 | u263173473 | 1600544718 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9172 | 184 | n=int(input())
counter=0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n-i*k):
if((i*j+k)==n):
counter=counter+1
print(counter) |
s258303535 | p02548 | u414558682 | 1600544704 | Python | Python (3.8.2) | py | Runtime Error | 34 | 8948 | 113 | import sympy
n = int(input())
sum_v = 0
for i in range(1, n):
v = (n - 1) // i
sum_v += v
print(sum_v) |
s773936097 | p02548 | u395944336 | 1600544701 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9052 | 212 | import sympy
def main():
n = int(input())
result = 0
for c in range(1, n):
divs = len(sympy.divisors(n-c))
result += divs
print(result)
if __name__ == "__main__":
main() |
s243540993 | p02548 | u889405092 | 1600544682 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9120 | 107 | N=int(input())
total=0
import sympy
for i in range(1,N):
total=total+sympy.divisor_count(i)
print (total) |
s115238373 | p02548 | u780195050 | 1600544649 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9168 | 208 | n = int(input())
flag = True
count = 0
for i in range(1, n):
for j in range(1, n):
c = n-i*j
if c <= 0:
break
elif isinstance(c, int):
cnt += 1
print(count) |
s917593260 | p02548 | u780195050 | 1600544620 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9172 | 205 | n = int(input())
A = True
count = 0
for i in range(1, n):
for j in range(1, n):
c = n-i*j
if c <= 0:
break
elif isinstance(c, int):
cnt += 1
print(count) |
s188451234 | p02548 | u840037795 | 1600544595 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9088 | 152 | import sys
input = sys.stdin.readline
import sympy
N = int(input())
total = 0
for i in range(1,N):
total += len(sympy.divisors(i))
print(total)
|
s552029898 | p02548 | u750712894 | 1600544586 | Python | PyPy3 (7.3.0) | py | Runtime Error | 91 | 74692 | 111 | import sympy
N = int(input())
count = 0
for i in range(1,N):
count += len(sympy.divisors(N-i))
print(count) |
s979579752 | p02548 | u421693050 | 1600544572 | Python | Python (3.8.2) | py | Runtime Error | 752 | 661084 | 1012 | import sys, re
import math
import numpy as np
from decimal import Decimal
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul #
from copy impor... |
s229948749 | p02548 | u953855545 | 1600544567 | Python | Python (3.8.2) | py | Runtime Error | 199 | 42404 | 132 | from scipy.special import comb
N = int(input())
print(sum([comb(len(factorize(N-C)) + 1, 2, exact=True) for C in range(1, N)]) + 2) |
s044860680 | p02548 | u221272125 | 1600544520 | Python | PyPy3 (7.3.0) | py | Runtime Error | 138 | 68736 | 341 | N = int(input())
import math
def num_divisors_trial_division(n):
num = 0
for i in xrange(1, int(math.sqrt(n) + 1e-9) + 1):
if n % i == 0:
num += 1
if n != i**2:
num += 1
return num
ans = 0
for i in range(1,N):
n = N - i
ans += num_divisors_trial_d... |
s504421142 | p02548 | u218375549 | 1600544512 | Python | PyPy3 (7.3.0) | py | Runtime Error | 161 | 68724 | 107 | import sympy
N = int(input())
ans = 0
for i in range(N-1):
ans += len(sympy.divisors(i+1))
print(ans) |
s143221646 | p02548 | u218375549 | 1600544475 | Python | PyPy3 (7.3.0) | py | Runtime Error | 155 | 68772 | 107 | import sympy
N = int(input())
ans = 0
for i in range(N-1):
ans += sympy.divisor_count(i+1)
print(ans) |
s521671932 | p02548 | u060505280 | 1600544447 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9092 | 120 | import sympy
N = int(input())
ans = 0
for i in range(1, N):
Q = N - i
ans += sympy.divisor_count(Q)
print(ans)
|
s986951368 | p02548 | u911567364 | 1600544443 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9164 | 134 | N=int(input())
from sympy import divisor_count
c=1
summ=0
for c in range(1,N):
a=divisor_count(c)
summ+=a
c+=1
print(summ) |
s113930693 | p02548 | u212347962 | 1600544436 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9092 | 110 | import sympy
N = int(input())
ans = 0
for i in range(1, N):
ans += sympy.divisor_count(i)
print(ans) |
s502419438 | p02548 | u454472984 | 1600544401 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9096 | 128 | import sympy
n=int(input())
ans=0
for c in range(1,n):
ab=n-c
buffer=sympy.divisors(ab)
ans+=len(buffer)
print(ans) |
s059048527 | p02548 | u141419468 | 1600544376 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9056 | 374 | import sympy
N = int(input())
ans = 0
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
for i in range(N):
num = len(make_d... |
s963203660 | p02548 | u627530854 | 1600544340 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9012 | 1725 | use std::fmt::Debug;
use std::str::FromStr;
pub struct TokenReader {
reader: std::io::Stdin,
tokens: Vec<String>,
index: usize,
}
impl TokenReader {
pub fn new() -> Self {
Self {
reader: std::io::stdin(),
tokens: Vec::new(),
index: 0,
}
}
pu... |
s259480854 | p02548 | u889282850 | 1600544316 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9116 | 269 | N = input()
setN = 0
setN2 = 0
for c in range(1, N+1):
for a in range(1, N-c+1):
for b in range(1, a+1):
if a * b == N - c:
if a == b:
setN += 1
else:
setN += 2
print(setN) |
s784554861 | p02548 | u075109824 | 1600544255 | Python | Python (3.8.2) | py | Runtime Error | 2278 | 2267128 | 339 | from itertools import product
n = input()
n = int(n)
mylist = list(range(1,n+1))
# print(mylist)
perm = [p for p in product(mylist, repeat=n)]
# print(list(perm))
count =0
for x in list(perm):
# print(str(x[0])+ 'x'+ str(x[1]) + '+' +str(x[2]) + str(x[0] * x[1] +x[2]))
if x[0] * x[1] +x[2] == n:
coun... |
s336182200 | p02548 | u560464565 | 1600544177 | Python | PyPy3 (7.3.0) | py | Runtime Error | 156 | 74720 | 124 | import sympy
n = int(input())
ans = 0
for i in range(1, n+1):
tmp = sympy.divisors(n-i)
ans += len(tmp)
print(ans)
|
s244166004 | p02548 | u308237681 | 1600544174 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9092 | 142 | import math
import sympy
n = int(input())
ans = 0
for c in range(1,n):
ab = n - c
ans += sympy.divisor_count(ab)
print(ans)
|
s036419116 | p02548 | u560464565 | 1600544156 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8976 | 124 | import sympy
n = int(input())
ans = 0
for i in range(1, n+1):
tmp = sympy.divisors(n-i)
ans += len(tmp)
print(ans)
|
s229000319 | p02548 | u889405092 | 1600544140 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9100 | 107 | import sympy
N=int(input())
total=0
for i in range(1,N):
total=total+sympy.divisor_count(i)
print (total) |
s903366879 | p02548 | u476068053 | 1600544137 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9032 | 236 | import sympy
def main():
n = int(input())
dp = [0] * (n+1)
dp[0] = 0
dp[1] = 0
for i in range(2, n+1):
dp[i] = dp[i-1] + len(sympy.divisors(i-1))
print(dp[-1])
if __name__ == '__main__':
main() |
s355066324 | p02548 | u836939578 | 1600544072 | Python | PyPy3 (7.3.0) | py | Runtime Error | 144 | 74556 | 372 | divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
N = int(input())
table = [0] * (N+5)
for i in range(1, N+2):
for j in range(i, N+2, i):
table[j] += 1
ans = ... |
s374930554 | p02548 | u995323427 | 1600544040 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9108 | 133 | import sympy
N = int(input())
a = 1
b = 1
c = 1
count = 0
for c in range(1, N):
count += len(sympy.divisors(c))
print(count) |
s595368678 | p02548 | u310381103 | 1600544030 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9088 | 97 | import sympy
n=int(input())
ans=1
for i in range(2,n):
ans+=sympy.divisor_count(i)
print(ans) |
s043586826 | p02548 | u551437236 | 1600544013 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9084 | 107 | import sympy
n = int(input())
ans = 0
for i in range(1,n):
ans += len(sympy.divisors(n-i))
print(ans)
|
s267989631 | p02548 | u373703188 | 1600543955 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9152 | 173 | n = int(input())
# a * b + c = n
# a * b - n = c
cnt = 0
import sympy
for i in range(1, n):
# print(sympy.divisors(n - i))
cnt += len(sympy.divisors(n - i))
print(cnt)
|
s961868987 | p02548 | u958482966 | 1600543859 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9012 | 167 | n = int(input())
count = 0
for i in range(1,n):
for j in range(1,n):
for k in range(1,n):
if (i*j+k) == n:
count += 1
print(count) |
s997744170 | p02548 | u208133431 | 1600543831 | Python | PyPy3 (7.3.0) | py | Runtime Error | 99 | 68792 | 116 | import sympy
N = int(input())
count = 0
for i in range(0,N):
count = count + sympy.divisor_count(i)
print(count) |
s386714954 | p02548 | u054931633 | 1600543789 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9088 | 115 | import sympy
n=int(input())
ans=0
for i in range(1,n):
a=n-i
b=sympy.divisor_count(a)
ans+=b
print(ans) |
s948384821 | p02548 | u889405092 | 1600543789 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9028 | 107 | import sympy
N=int(input())
count=0
for i in range(1,N):
count=count+sympy.divisor_count(i)
print (count) |
s709034895 | p02548 | u926266624 | 1600543751 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9032 | 199 | N = int(input())
count = 0
t = 0
for c in range (1, N):
t = N-c
for a in range(1, t**0.5 +1):
if t % a == 0:
if t / a ==a:
count += 1
else
count += 2
print(count) |
s143068979 | p02548 | u077948085 | 1600543737 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9056 | 113 | import sympy
num = int(input())
count = 0
for i in range(1, num):
count += len(sympy.divisors(i))
print(count) |
s716230287 | p02548 | u945405878 | 1600543719 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9160 | 130 | # A * B = N - C
N = int(input())
count = 0
for i in range(1, N):
AB = N - i
count += len(make_divisors(AB))
print(count) |
s525387689 | p02548 | u581579603 | 1600543717 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9100 | 132 | N = int(input())
import sympy as sy
kotae = 0
for C in range(1, N):
sa = N - C
kotae += sy.divisor_count(sa)
print(kotae) |
s961052958 | p02548 | u248996551 | 1600543710 | Python | PyPy3 (7.3.0) | py | Runtime Error | 129 | 68836 | 1043 | from collections import defaultdict
import math
from functools import lru_cache
#上手くいかない時は下
# from functools32 import lru_cache
@lru_cache(None)
def prime_factorization_1(num):
if num <= 1:
return False
else:
num_sqrt = math.floor(math.sqrt(num))
prime_list = make_prime_list_2(num_sq... |
s217290535 | p02548 | u465101448 | 1600543692 | Python | PyPy3 (7.3.0) | py | Runtime Error | 84 | 68704 | 237 | N = int(input_[0])
ans = 0
for c in range(1,N):
N_ = N-c
sq_N_ = int(N_**(1/2))
for a in range(1,sq_N_+1):
if N_ % a == 0:
b = N_//a
ans += 2
if a == b:
ans -= 1
print(ans) |
s363349555 | p02548 | u889405092 | 1600543679 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9016 | 106 | import sympy
N=int(input())
count=0
for i in range(1,N)
count=count+sympy.divisor_count(i)
print (count) |
s170551533 | p02548 | u465101448 | 1600543669 | Python | PyPy3 (7.3.0) | py | Runtime Error | 148 | 68532 | 242 | %%time
N = int(input())
ans = 0
for c in range(1,N):
N_ = N-c
sq_N_ = int(N_**(1/2))
for a in range(1,sq_N_+1):
if N_ % a == 0:
b = N_//a
ans += 2
if a == b:
ans -= 1
print(ans) |
s782596938 | p02548 | u678128840 | 1600543659 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9096 | 178 | import sympy,math
N = int(input())
ttl = 0
tempNum = 0
count = 0
for i in range(1,N):
tempNum = N - i
count = len(sympy.divisors(tempNum))
ttl += count
print(ttl)
|
s279656954 | p02548 | u290187182 | 1600543420 | Python | Python (3.8.2) | py | Runtime Error | 151 | 9160 | 199 |
if __name__ == '__main__':
n = int(input())
if n < 3:
print(0)
else:
count = 1
n2=n-1
for i in range(1,n2):
count+=n2//i
print(count)
|
s031938497 | p02548 | u621596556 | 1600543408 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9168 | 125 | n = int(input())
count = 0
for i in range(1,n):
for j in range(1,n):
if(a*b < n):
count += 1
print(count) |
s000991348 | p02548 | u945405878 | 1600543380 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9156 | 125 | N = int(input())
count = 0
for i in range(1, N):
AB_product = N - i
count += count_divisors(AB_product)
print(count) |
s947665013 | p02548 | u863723142 | 1600543371 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9156 | 115 | num=int(input())
a=0
import sympy
for i in range(1,num):
temp=sympy.divisors(i)
a+=len(temp)
print(a) |
s176583340 | p02548 | u945405878 | 1600543334 | Python | PyPy3 (7.3.0) | py | Runtime Error | 81 | 74716 | 125 | N = int(input())
count = 0
for i in range(1, N):
AB_product = N - i
count += count_divisors(AB_product)
print(count) |
s640431753 | p02548 | u510582860 | 1600543297 | Python | Python (3.8.2) | py | Runtime Error | 480 | 9712 | 312 | N=int(input())
ans=1
def test(n):
buf=0
for i in range(1,n):
if i**2 > n:
break
if i**2 == n:
buf+=1
break
if n%i==0:
buf+=2
return buf
def ans(n):
if n==2:
return 1
return test(n-1) + ans(n - 1)
print(ans(N))
|
s474942401 | p02548 | u133745933 | 1600543287 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9096 | 119 | import sympy
N = int(input())
cnt = 0
for c in range(1,N):
k = len(sympy.divisors(N - c))
cnt += k
print(cnt) |
s047748399 | p02548 | u133745933 | 1600543240 | Python | PyPy3 (7.3.0) | py | Runtime Error | 94 | 68748 | 119 | import sympy
N = int(input())
cnt = 0
for c in range(1,N):
k = len(sympy.divisors(N - c))
cnt += k
print(cnt) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.