input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
P = [i%(i+1) for i in range(1,N)]
print((sum(P))) | N = int(eval(input()))
N = N-1
ans = N*(N+1)//2
print((int(ans))) | p02924 |
n = int(eval(input()))
ans = 0
for a,b in zip(list(range(1,n)),list(range(2,n+1))):
ans += a % b
print(ans) | n = int(eval(input()))
ans = (n*(n-1))//2
print((int(ans))) | p02924 |
n = int(eval(input()))
print((sum(range(1,n)))) | n = int(eval(input()))
print(((n*(n-1))//2)) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(N):
if i == N-1:
ans += 0
else:
ans += (i+1)%(i+2)
print(ans) | N = int(eval(input()))
#sum[i,1,N-1][i] = N*(N-1)/2
print((N*(N-1)//2)) | p02924 |
print((sum(range(int(eval(input())))))) | n = int(eval(input()))-1
print((((2+n-1)*n ) >> 1)) | p02924 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
ans = 0
for y in range(1, N):
ans += y
print(ans)
| # -*- coding: utf-8 -*-
N = int(eval(input()))
ans = ((N + 1) * N) // 2
ans -= N
print(ans)
| p02924 |
if __name__ == '__main__':
n = int(eval(input()))
r = [n]
for i in range(1, n):
r.append(i)
ans = 0
for i in range(n):
ans += r[i] % (i + 1)
print(ans) | if __name__ == '__main__':
n = int(eval(input()))
t = (1 + n) * n // 2
print((t - n)) | p02924 |
N = int(eval(input()))
score = 0
for i in range(1, N):
score += i
print(score)
| N = int(eval(input()))
print(((N)*(N-1)//2))
| p02924 |
n = int(eval(input()))
a = 0
for i in range(n):
a += i
print(a) | n = int(eval(input()))
a = n*(n-1)//2
print(a) | p02924 |
N = int(eval(input()))
a = list(range(1,N))
print((sum(a))) | N = int(eval(input()))
if N%2==0:
N_=int(N/2)
print((N_*(N-1)))
else:
N_=int((N-1)/2)
print((N_*N)) | p02924 |
n = int(eval(input()))
ans=0
for i in range(n):
ans += i
print(ans) | n = int(eval(input()))
ans = n*(n-1)//2
print(ans) | p02924 |
n = int( eval(input()))
total = 0
if n ==1:
print((0))
else:
for i in range(n):
total += i
print(total) | n = int( eval(input()))
total = 0
if n ==1:
print((0))
else:
print(((n*(n-1))//2)) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(1, N):
ans += i
print(ans)
| N = int(eval(input()))
ans = (N*(N-1)) // 2
print((int(ans)))
| p02924 |
n = int(eval(input()))
print((sum([i for i in range(1, n)])))
| n = int(eval(input()))
ans = n * (n // 2)
if (n - 1) % 2 == 0:
print(ans)
else:
print((ans - int(n / 2)))
| p02924 |
N = int(eval(input()))
intSum = 0
for i in range(N):
intSum = intSum + i
print(intSum) | N = int(eval(input()))
count = int( (N-1) / 2 )
if (N-1) % 2 == 0:
intSum = N*count
else:
intSum = N*count + count + 1
print(intSum) | p02924 |
n = int(eval(input()))
ans_li = [i for i in range(1,n)]
print((sum(ans_li))) | n = int(eval(input()))
ans=0
if (n-1)%2==0:
ans+=n*((n-1)//2)
else:
ans+=n*((n-1)//2)+n//2
print(ans) | p02924 |
n=int(eval(input()))
if n==1: print((0)); exit();
if n==2: print((1)); exit();
if n%2==1:
print((((n-1)+1)*((n-1)//2)))
else:
print((((n-1)+1)*((n-1)//2)+n//2)) | n=int(eval(input()))
if n==1: print((0)); exit();
if n==2: print((1)); exit();
print((n*(n-1)//2)) | p02924 |
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
N = INT()
print((sum([i for i in range(N)])))
| import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
N = INT()
print((sum(range(N))))
| p02924 |
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
N = INT()
ans=0
for i in range(N):
ans +=i
print(ans)
| n = int(eval(input()))
print(((n*(n-1))//2)) | p02924 |
a = int(eval(input()))
sub = 0
for i in range(a):
sub+=i
print(sub) | a = int(eval(input()))
sub = a*(a-1)//2
print(sub) | p02924 |
n = []
a = []
num = int(eval(input()))
for i in range(num):
n.append(i+1)
a.append(i+1)
a.pop(0)
a.append(1)
sum = 0
for c,d in zip(n, a):
sum+= c % d
print(sum)
| num = int(eval(input()))
sum = 0
for i in range(1, num+1):
if i == num:
sum += i % 1
else:
sum += i % (i+1)
print(sum)
| p02924 |
N=int(eval(input()))
a=[i for i in range(N)]
print((sum(a))) | N=int(eval(input()))
if N % 2 ==1:
ans=int((N-1)/2) * N
else:
ans=int(N/2) * (N-1)
print((int(ans))) | p02924 |
n = int(eval(input()))
data = [i for i in range(1, n)]
print((sum(data))) | n = int(eval(input()))
print((int((n-1)*(1+n-1)//2))) | p02924 |
a = int(eval(input()))
num = 0
for i in range(1,a):
num += i
print(num) | a = int(eval(input()))
print((((a)*(a-1))//2)) | p02924 |
n=int(eval(input()))
a=[]
for i in range(1,n):
a.append(i%n)
print((sum(a))) | n=int(eval(input()))
c=0
for i in range(1,n):
c+=(i%n)
print(c) | p02924 |
n = eval(input())
n = int(n)
ret = 0
for i in range(n-1):
ret += (i+1)
print(ret)
| n = eval(input())
n = int(n)
max_value = n - 1
ret = max_value * (max_value + 1) // 2
print(ret)
| p02924 |
N = int(eval(input()))
n = [int(_) for _ in range(1, N)]
print((sum(n))) | N = int(eval(input()))
n = N - 1
ans = (n + 1) * n
ans //= 2
print(ans) | p02924 |
N = int(eval(input()))
arr = [i+1 for i in range(N)]
if N == 1:
print((0))
else:
print(((1+(N-1))*(N-1)//2)) | N = int(eval(input()))
if N == 1:
print((0))
else:
print(((1+(N-1))*(N-1)//2)) | p02924 |
N = int(eval(input()))
if N == 1:
print((0))
else:
print(((1+(N-1))*(N-1)//2)) | N = int(eval(input()))
print(((1+(N-1))*(N-1)//2)) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(2,N+1):
ans += (i-1)%i
print(ans) | N = int(eval(input()))
print(((N-1)*N//2)) | p02924 |
N = int(eval(input()))
print((sum(range(N)))) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
n = int(eval(input()))
a = [i for i in range(1,n+1)]
print((sum(a)-max(a))) | n = int(eval(input()))
a = [i for i in range(1,n+1)]
print((sum(a)-n)) | p02924 |
N=int(eval(input()))
lst=[N%1]
for i in range(2,N+1):
lst.append((i-1)%i)
print((sum(lst))) | N=int(eval(input()))
print((N*(N-1)//2)) | p02924 |
print((sum(range(1,int(eval(input())))))) | print(((lambda x:int(x)*(int(x)-1)//2)(int(eval(input()))))) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(1, N):
ans += i
print(ans) | N = int(eval(input()))
n = N - 1
ans = n * (n + 1) // 2
print(ans) | p02924 |
N = int(eval(input()))
ret = int(N * (N - 1) / 2)
zantei = 0
for i in range(1, N + 1):
if N % i > i - 1:
zantei = max(zantei, N % i - (i - 1))
print((zantei + ret)) | N = int(eval(input()))
print((N * (N - 1) // 2)) | p02924 |
N=int(eval(input()))
print((sum(range(1,N+1))-N)) | N=int(eval(input()))
print((N*(N+1)//2-N)) | p02924 |
n = int(eval(input()))
print((sum([i for i in range(1,n)]))) | n = int(eval(input()))-1
print((n*(n+1)//2)) | p02924 |
n = int(eval(input()))
ans=0
for i in range(n-1):
ans += (i+1)
print(ans) | n = int(eval(input()))
print(((n-1)*n//2)) | p02924 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p02924 |
n=int(eval(input()))
ans=0
for i in range(1,n):
ans+=i%(i+1)
ans+=n%1
print(ans)
|
n=int(eval(input()))
ans=0
#for i in range(1,n):
# ans+=i%(i+1)
#
#ans+=n%1
ans=((n-1)*(n))//2
print(ans)
| p02924 |
N = int(eval(input()))
sum = 0
for i in range(1,N):
sum += i
print(sum) | N = int(eval(input())) - 1
sum = 0
if N % 2 == 0:
sum = (1+N)*int(N/2)
else:
sum = (1+N)*int((N-1)/2) + int((N+1)/2)
print((int(sum))) | p02924 |
import sys
def input(): return sys.stdin.readline().strip()
def solve():
pass
def main():
N = int(eval(input()))
I = [x for x in range(1, N+1)]
P = [x for x in range(1, N+1)]
P = P[1:] + [P[0]]
for i in range(N):
I[i] %= P[i]
print((sum(I)))
if __name_... | import sys
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
ans = (N-1)*(1+N-1) // 2
print(ans)
if __name__ == "__main__":
main()
| p02924 |
import math
N=int(eval(input()))
total=0
for i in range(N):
total+=i
print(total) | N=int(eval(input()))
print((N*(N-1)//2 if N>2 else 1 if N==2 else 0)) | p02924 |
n = int(eval(input()))
ans =sum(range(1, n))
print(ans) | n = int(eval(input()))
ans = n*(n-1)//2
print(ans) | p02924 |
print((sum(range(1,int(eval(input())))))) | N = int(eval(input()))
print(((N-1) * N // 2)) | p02924 |
n = int(eval(input()))
p = []
ans = 0
for i in range(n):
ans += i
print(ans) | import sys
n = int(eval(input()))
if n == 2:
print((1))
sys.exit()
# temp1 = (n-1) // 2
# temp2 = 2 + n - 2
#ans = ((n-1) / 2) * (2 + (n - 2))
ans = (n-1) * (2 + (n - 2))
ans = ans // 2
#ans = temp1 * temp2
#print(ans)
print((int(ans))) | p02924 |
print((sum(range(int(eval(input())))))) | N=int(eval(input()))
print((N * (N-1) // 2)) | p02924 |
n = int(eval(input()))
ls = []
ls_re = []
for i in range(1,n+1):
ls.append(i)
for i in reversed(ls):
ls_re.append(i)
ans = 0
for i in range(n):
ans += (ls[i]%ls_re[i])
#print(ls[i]%ls_re[i],end=" ")
c = 0
for i in range(1,n):
c += i
print(c)
| n = int(eval(input()))
'''
ls = []
ls_re = []
for i in range(1,n+1):
ls.append(i)
for i in reversed(ls):
ls_re.append(i)
ans = 0
for i in range(n):
ans += (ls[i]%ls_re[i])
#print(ls[i]%ls_re[i],end=" ")
'''
c = 0
for i in range(1,n):
c += i
print(c)
| p02924 |
n = int(eval(input()))
'''
ls = []
ls_re = []
for i in range(1,n+1):
ls.append(i)
for i in reversed(ls):
ls_re.append(i)
ans = 0
for i in range(n):
ans += (ls[i]%ls_re[i])
#print(ls[i]%ls_re[i],end=" ")
'''
c = 0
for i in range(1,n):
c += i
print(c)
| n = int(eval(input()))
c = 0
an = (n-1)*n//2
print((round(an))) | p02924 |
from collections import defaultdict, deque, Counter
import sys
import heapq
import math
# input = sys.stdin.readline
sys.setrecursionlimit(1000000000)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
def main():
N = int(eval(input()))
# A, B = [int(a) for a in input().split()]
# H = [int(a) for a in in... | from collections import defaultdict, deque, Counter
import sys
import heapq
import math
# input = sys.stdin.readline
sys.setrecursionlimit(1000000000)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
def main():
N = int(eval(input()))
# A, B = [int(a) for a in input().split()]
# H = [int(a) for a in in... | p02924 |
n = int(eval(input()))
print((sum(range(0, n)))) | n = int(eval(input()))
print((int(n * (n - 1) // 2)))
| p02924 |
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
ans += (i-1)
print(ans)
| N = int(eval(input()))
ans = ((N)*(N-1))//2
print(ans)
| p02924 |
def solve(N):
answer = 0
for i in range(N):
answer += i
return answer
if __name__ == '__main__':
N = int(eval(input()))
answer = solve(N)
print(answer)
| def solve(N):
return (N * (N - 1)) // 2
if __name__ == '__main__':
N = int(eval(input()))
answer = solve(N)
print((int(answer))) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(N,1,-1):
ans = ans + i-1
print(ans) | n=int(eval(input()))
print(((n-1)*n//2))
| p02924 |
n = int(eval(input()))
cnt = 0;
for i in range(n):
cnt += i
print(cnt) | n = int(eval(input()))
if(n % 2 == 0):
print((int(n / 2) * (n - 1)))
else:
print((int((n-1) / 2) * n)) | p02924 |
N = int(eval(input()))
A= []
for i in range(N-1):
A.append(i+2)
A.append(1)
count = 0
for i in range(N):
count += (i+1)%A[i]
print(count) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
N = int(eval(input()))
n = [i + 1 for i in range(N)]
print((sum(n) - max(n))) | N = int(eval(input()))
print(((N + 1) * N // 2 - N)) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(N):
ans += i
print(ans) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
N = int(eval(input()))
P = [i for i in range(1, N)]
print((sum(P))) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
n=int(eval(input()))
ans=0
for i in range(n):
ans+=i
print(ans) | n=int(eval(input()))
ans=n*(n-1)//2
print(ans) | p02924 |
def main():
n = int(eval(input()))
sum = 0
for i in range(1, n):
sum += i
print(sum)
if __name__ == "__main__":
main() | def main():
n = int(eval(input()))
print((int((n-1) * n // 2)))
if __name__ == "__main__":
main() | p02924 |
N = int(eval(input()))
ans = 0
for i in range(1, N):
ans += i
print(ans)
| N = int(eval(input()))
print((N*(N-1)//2))
| p02924 |
n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
from decimal import Decimal
n = int(eval(input()))
ans = (Decimal((n - 1) * n) / 2)
print(ans)
| n = int(eval(input()))
ans = ((n - 1) * n) // 2
print(ans)
| p02924 |
print((sum(range(int(eval(input())))))) | N = int(eval(input()))
print((int((N - 1) * N // 2))) | p02924 |
n = int(eval(input()))
ans = 0
for i in range(n-1):
ans += i+1 % (i+2)
print(ans) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
#インポート
import sys
#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline(... | #インポート
import sys
#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline(... | p02924 |
#インポート
import sys
#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline(... | #インポート
import sys
#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline... | p02924 |
N = int(eval(input()))
mod_list = [i for i in range(1, N)]
output = (N - 1) / 2 * (1 + N - 1)
print((int(output))) | N = int(eval(input()))
output = ((N - 1) * N) // 2
print((int(output))) | p02924 |
import itertools
N = int(eval(input()))
ans = list(range(1, N))
print((sum(ans)))
| N = int(eval(input()))
print(((N * (N - 1)) // 2)) | p02924 |
n = int(eval(input()))
m = [i for i in range(n)]
print((sum(m)))
| n = int(eval(input()))
print(((n*(n-1))//2))
| p02924 |
print((sum(range(int(eval(input()))))))
| n = int(eval(input()))
print(((n - 1) * n // 2))
| p02924 |
n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(eval(input()))
print((n * (n - 1) // 2))
| p02924 |
N = int(eval(input()))
print((sum(range(N)))) | N = int(eval(input()))
ans = N * (N - 1) // 2
print((int(ans))) | p02924 |
n = int(eval(input()))
s = []
for i in range(1,n+1):
a = i % n
s.append(a)
ans = sum(s)
print(ans) | n = int(eval(input()))
print((n*(n+1)//2-n))
| p02924 |
print((sum(range(1, int(eval(input()))))))
| N = int(eval(input()))
print(((1 + (N - 1)) * (N - 1) // 2))
| p02924 |
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += i
print(ans)
| n = int(eval(input()))
n = n - 1
if n % 2 == 1:
ans = ((n+1)//2) * n
else:
ans = n + (n//2) * (n-1)
print(ans)
| p02924 |
N = int(eval(input()))
ans = sum([x for x in range(N)])
print(ans) | N = int(eval(input()))
ans = sum(range(N))
print(ans) | p02924 |
N = int(eval(input()))
count = 0
for i in range(N):
count+=i
print(count) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
N=int(eval(input()))
count=0
for i in range(1,N):
count=count+i
print(count) | N=int(eval(input()))
print(((N)*(N-1)//2)) | p02924 |
N = int(eval(input()))
Q = [i for i in range(1, N+1)]
P = sum(Q) - Q[-1]
print(P)
| N = int(eval(input()))
print((int(N * (N-1) // 2)))
| p02924 |
N = int(eval(input()))
NL = []
PL = []
ans = 0
for i in range(N):
NL.append(i+1)
PL.append(i+2)
PL[N-1] = 1
for i in range(N):
ans += NL[i] % PL[i]
print(ans) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
from itertools import accumulate
def main():
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += i
print(ans)
if __name__ == "__main__":
main()
| from itertools import accumulate
def main():
n = int(eval(input()))
print((n*(n-1)//2))
if __name__ == "__main__":
main()
| p02924 |
n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans) | n = int(eval(input()))
print(((n * (n-1))//2)) | p02924 |
num = int(eval(input()))
print((sum(range(1, num + 1)[:-1]))) | num = int(eval(input()))
print((((num - 1) * num) // 2)) | p02924 |
n = int(eval(input()))
print((sum(range(n))))
| n = int(eval(input()))
print(( ((n * (n+1))//2) - n ))
| p02924 |
n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
N = int(eval(input()))
if N==1:
print((0))
else:
print((sum([i for i in range(1,N)]))) | N = int(eval(input()))
if N==1:
print((0))
else:
print(((N-1)*N//2)) | p02924 |
n = int(eval(input()))
answer = sum(range(1, n))
print(answer) | n = int(eval(input()))
answer = n * (n - 1) // 2
print(answer) | p02924 |
N = int(eval(input()))
print((sum(range(1,N)))) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
n = int(eval(input()))
print((sum(x for x in range(1,n)))) | n = int(eval(input()))
print(((n*(n-1))//2)) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(1,N):
ans += i
print(ans) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
N = int(eval(input()))
tmp = 0
for i in range(1,N):
tmp += i
print(tmp) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
n = int(eval(input()))
print(((n-1) * (n - 1 + 1) // 2)) | n = int(eval(input()))
ans = n * (n-1) // 2
print(ans) | p02924 |
n=int(eval(input()))
print((sum(range(n)))) | n=int(eval(input()))
print((n * (n-1) // 2)) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(N):
ans += i
print(ans) | N = int(eval(input()))
ans = (N-1)*N//2
print(ans) | p02924 |
N = int(eval(input()))
A = [int(i) for i in range(1,N)]
print((N*(N-1)//2))
| N = int(eval(input()))
print((N*(N-1)//2))
| p02924 |
N = int(eval(input()))
l = []
for i in range(N):
l.append(i+1)
print((sum(l)-N)) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
a = int(eval(input()))
ans = 0
print((sum(range(1,a)))) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.