input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
ans=0
N=int(eval(input()))
for i in range(N-1):
ans=ans+i+1
print(ans) | N=int(eval(input()))
print((N*(N-1)//2)) | p02924 |
def calc(n):
r = 0
for i in range(1, n):
r += i
return r
n = int(eval(input()))
r = calc(n)
print(r)
|
def calc(n):
return (1 + n - 1) * (n-1) // 2
n = int(eval(input()))
r = calc(n)
print(r)
| p02924 |
#!/usr/bin/env python3
N = int(eval(input()))
ans = 0
for i in range(1,N):
ans += i
print(ans)
| #!/usr/bin/env python3
N = int(eval(input()))
ans = (1+(N-1))*(N-1)//2
print(ans)
| p02924 |
n = int(eval(input()))
s = 0
for i in range(n):
s += i
print(s) | n = int(eval(input()))
print((n * (n-1) // 2))
| p02924 |
n = int(eval(input()))
answer = 0
for i in range(1, n):
answer += i
print(answer) | #!/usr/bin/env python3
import sys
def solve(N: int):
answer = (N-1)*N//2
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # t... | p02924 |
N = int(eval(input()))
if N == 1:
print((0))
else:
num = 0
for i in range(1, N):
num += i
print(num) | N = int(eval(input()))
if N == 1:
print((0))
else:
print(((N-1)*N//2)) | p02924 |
n = int(eval(input()))
ans = 0
for i in range(n - 1):
ans += i + 1
print(ans) | n = int(eval(input()))
if n % 2 == 1:
print((n * (n // 2)))
else:
print(((n * n - n) // 2)) | p02924 |
N = int(eval(input()))
sum = 0
for i in range(N):
sum += i
print(sum) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
n = int(eval(input()))
s = 0
for i in range(n-1):
s += i + 1
print(s) | 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 |
n = int(eval(input()))
total = 0
for i in range(n):
total += i
print(total) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
a=int(eval(input()))
c=0
for i in range(a):
c = c+i
print(c) | N = int(eval(input()))
print(((N-1)*N//2)) | p02924 |
N=int(eval(input()))
P=[]
ans=0
for i in range(N):
P.append(i+1)
print((sum(P) - N)) | N=int(eval(input()))
print(((N+1) * (N // 2) - N if N%2==0 else (N+1) * (N // 2) + int(N/2+1) - N)) | p02924 |
N = int(eval(input()))
print((sum(i % (i + 1) for i in range(1, N))))
| N = int(eval(input()))
print((int(N * (N - 1) // 2)))
| p02924 |
def main():
n = int(eval(input()))
p = [i for i in range(1, n+1)]
ans = sum([p[i] % (p[i]+1) for i in range(n-1)])
# for i in range(n-1):
# ans += p[i] % (p[i]+1)
print(ans)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
ans = n * (n-1)//2
print(ans)
if __name__ == "__main__":
main()
| p02924 |
N=int(eval(input()))
S=0
for i in range(N):
S+=i
print(S) | N=int(eval(input()))
print((N*(N-1)//2)) | p02924 |
n = int(eval(input()))
l = [i+1 for i in range(n)]
print((sum(l)-max(l))) | n = int(eval(input()))
print(((1 + n-1)*(n-1)//2)) | p02924 |
N = int(eval(input()))
print((sum(v for v in range(N))))
| N = int(eval(input()))
print((N * (N - 1) // 2))
| p02924 |
n=int(eval(input()))
p=[i+1 for i in range(n)]
ans=sum(p)-p[n-1]
print(ans) | n=int(eval(input()))
ans=n*(n-1)//2
print(ans) | p02924 |
import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
total = 0
for i in range(1, N):
total += i
print(total)
| import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
total = sum(range(1, N))
print(total)
| 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(ans) | p02924 |
def main():
N = int(eval(input()))
ans = sum(range(1, N + 1)) - N
print(ans)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
ans = N * (N - 1) // 2
print(ans)
if __name__ == "__main__":
main() | p02924 |
n = int(eval(input()))
print((sum([i+1 for i in range(n-1)]))) | n = int(eval(input()))
count = 0
for i in range(n-1):
count += i+1
print(count) | p02924 |
N = int(eval(input()))
M = 0
for i in range(N - 1):
M += (i + 1) % (i + 2)
print(M) | N = int(eval(input()))
print((N * (N + 1) // 2 - N))
| p02924 |
N=int(eval(input()))
s=N
ans=0
m=N
for i in range(N-1,0,-1):
if i%s<m%s:
ans+=m%s
m=s-1
s-=1
else:
ans+=i%s
s-=1
print(ans)
| N=int(eval(input()))
if N%2==0:
s=int(N/2)
print((s*(N-1)))
if N%2==1:
s=int((N-1)/2)
print((s*N))
| p02924 |
n = list(x for x in range(1, int(eval(input())) + 1))
p = [max(n)]
p.extend(n)
m = []
ans = 0
for i in range(len(n)):
m.append(p[i] % (i+1))
for i in range(len(n)):
ans += m[i]
print(ans) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
N = int(eval(input()))
if N == 1:
print((0))
exit()
M = 1
for i in range(2, N):
m = i % (i+1)
M += m
print(M) | N = int(eval(input()))
N = N-1
if N % 2 == 0:
print(((N+1) * (N//2)))
else:
n = N-1
print(((n+1) * (n//2) + N)) | p02924 |
print((sum(range(int(eval(input()))))))
| n = int(eval(input()))
print((n*(n-1)//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-1)*n)//2))
| p02924 |
N=int(eval(input()))
n1=[x+1 for x in range(N)]
n2=n1[1:]+[n1[0]]
s=0
for x,y in zip(n1,n2):
s+=x%y
print(s) | N=int(eval(input()))
ans=int((N-1)*N//2)
print(ans) | p02924 |
#!/usr/bin/env python
# coding: utf-8
# In[19]:
P = int(eval(input()))
# In[20]:
# i_list = list(range(1, P+1))
# p_list = i_list[1:]
# p_list.append(i_list[0])
# # print(i_list, p_list)
# ans = 0
# for i in range(P):
# ans += i_list[i]%p_list[i]
# print(ans)
ans = sum(range(1,P))
... | #!/usr/bin/env python
# coding: utf-8
# In[21]:
P = int(eval(input()))
# In[22]:
# i_list = list(range(1, P+1))
# p_list = i_list[1:]
# p_list.append(i_list[0])
# # print(i_list, p_list)
# ans = 0
# for i in range(P):
# ans += i_list[i]%p_list[i]
# print(ans)
# ans = sum(range(1,P))... | p02924 |
'''Haha this is python? How could you tell, Sherlock?'''
n = int(eval(input()))
print(((n * (n - 1)) // 2)) | n=int(eval(input()))
suu=n*(n-1)//2
print(suu)
w=[1,2,3,4] | p02924 |
n = int(eval(input()))
num_list = [i+1 for i in range(n)]
print((sum(num_list) - n)) | n = int(eval(input()))
print((sum(range(1, n + 1)) - n)) | p02924 |
import sys
def input():
return sys.stdin.readline().rstrip()
n = int(eval(input()))
h = [int(i) for i in range(n)]
print((sum(h[:n])))
| import sys
def input():
return sys.stdin.readline().rstrip()
n = int(eval(input()))
s = int((n*(n-1))//2)
print(s) | p02924 |
ans=0
for i in range(int(eval(input()))):
ans+=i
print(ans) | n=int(eval(input()))
print(((n-1)*n//2)) | p02924 |
F = [0, 0, 1]
while True:
try:
N = int(eval(input()))
if N > len(F) - 1:
for i in range(len(F), N+1):
F.append(F[i-1] + i - 1)
print((F[N]))
except:
break | R = [0, 0, 1]
while True:
try:
N = int(eval(input()))
if N <= 2:
print((R[N]))
else:
print(((N-1)*(N-2)//2 + N - 1))
except:
break | p02924 |
n = int(eval(input()))
n_list = [i for i in range(1,n)]
print((sum(n_list))) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
N = int(eval(input()))
N_array = [x for x in range(1, N + 1, 1)]
N_array.pop(N - 1)
print((sum(N_array))) | N = int(eval(input()))
print((sum(range(1, N)))) | p02924 |
N = int(eval(input()))
list = [i+1 for i in range(N)]
sum = 0
for i in range(1,N):
sum += i
print(sum) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
N = int(eval(input()))
P = [i for i in range(1, N + 1)]
# 1 2 3 4 5 6 7 8 9 10 11 12 13
# 2 3 4 5 6 7 8 9 10 11 12 13 1
print((sum(P) - P[-1]))
| N = int(eval(input()))
ret = 0
for i in range(1, N):
ret += i
# 1 2 3 4 5 6 7 8 9 10 11 12 13
# 2 3 4 5 6 7 8 9 10 11 12 13 1
print(ret)
| 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()))
print((N * (N-1) // 2))
| p02924 |
n=int(eval(input()))
print((n*(n+1)//2-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()))
print((n * (n - 1) // 2))
| p02924 |
N=int(eval(input()))
res = 0
for i in range(1,N+1):
if i == N:
res += 0
else:
res += i%(i+1)
print(res) | N=int(eval(input()))
n=N-1
res = n*(n+1)//2
print(res) | p02924 |
n=int(eval(input()))
print((sum([i for i in range(1,n)]))) | n=int(eval(input()))
print((n*(n-1)//2)) | p02924 |
print((sum([_ for _ in range(int(eval(input())))]))) | N=int(eval(input()))
print((int((N-1)*N//2))) | p02924 |
def main():
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
if i != N:
ans += i % (i+1)
return ans
if __name__ == '__main__':
print((main())) | def main():
N = int(eval(input()))
return N*(N-1)//2
if __name__ == '__main__':
print((main())) | p02924 |
# 初期入力
N = int(eval(input()))
N_list =[i for i in range(1,N+1)]
ans =sum(N_list) -N
print(ans) | # 初期入力
N = int(eval(input()))
#N_list =[i for i in range(1,N+1)]
N_list_sum =N*(N+1)//2
ans =N_list_sum -N
print(ans) | p02924 |
n = int(eval(input()))
ans=0
for i in range(n):
if i==n-1:
break
else:
ans+=i+1
print(ans) | n = int(eval(input()))
ans = int((n-1)*n//2)
print(ans) | p02924 |
N = int(eval(input()))
lis = []
for i in range(1,N):
lis.append(i)
print((sum(lis))) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
n=int(eval(input()))
t=n-1
ans=t*(t+1)
print((ans//2))
| n=int(eval(input()))-1
print((n*(n+1)//2)) | p02924 |
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)
# input = sys.stdin.readline
def main():
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans +=... | import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)
# input = sys.stdin.readline
def main():
n = int(eval(input())) - 1
ans = 0
if n % 2:
print(((1 + n) *... | p02924 |
n = int(eval(input()))
print((sum(range(1, n))))
| n = int(eval(input()))
print(((n * (n - 1))// 2))
| p02924 |
N = int(eval(input()))
c = list()
for n in range(1, N+1):
c.append(n)
d = c[:]
del d[0]
d.append(1)
cont = 0
for e, f in zip(c, d):
mod = e % f
cont += mod
print(cont) | 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 = 0
if n%2 != 0:
ans = n*((n-1)//2)
else:
ans = n*((n//2)-1) + n//2
print((int(ans))) | p02924 |
N = int(eval(input()))
ans = 0
for i in range(1, N):
ans += i
print(ans) | N = int(eval(input()))
ans = 0
if N%2 == 0:
ans = N//2 * (N-1)
else:
ans = (N-1)//2 * N
print(ans) | p02924 |
a = int(eval(input()))
sum = 0
for i in range(a):
sum += i
print(sum)
| a = int(eval(input()))
sum = 0
sum = (a-1)* a // 2
print(sum)
| p02924 |
N = int(eval(input()))
lis = [i for i in range(1, N)]
print((sum(lis)))
| N = int(eval(input()))
ans = N * (N - 1) // 2
print(ans)
| p02924 |
N = int(eval(input()))
count = 0
for i in range(N):
count += i
print(count) | N = int(eval(input()))
count = N * (N - 1) // 2
print(count) | p02924 |
import sys
N = int(eval(input()))
max = 0
for _ in range(1,N):
max = max + _
print(max)
| n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n = int(eval(input()))
ans = 0
for i in range(n-1,0,-1):
ans += i%(i+1)
print(ans)
| n = int(eval(input()))
ans = (n-1)*n//2
print(ans)
| p02924 |
n = int(eval(input()))
print((0 if n == 1 else sum([(i - 1)%i for i in range(2, n + 1)]))) | n = int(eval(input()))
print(((n - 1)*n//2)) | p02924 |
N = int(eval(input()))
m = 0
for n in range(1,N):
if n == N:
m += 0
else:
m += n % (n+1)
print(m) | n = int(eval(input()))
print((int((n-1)*n//2))) | p02924 |
n = int(eval(input()))
res = 0
for i in range(1,n):
res += i%(i+1)
print(res) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n=int(eval(input()))
p=[]
total=0
for i in range(n,0,-1):
p.append(i)
p.reverse()
for i in range(1,n):
total+=i%p[i]
print(total)
| n=int(eval(input()))
print((n*(n-1)//2))
| p02924 |
n=int(eval(input()))
if n == 1:
print('0')
else:
total = 0
for i in range(n):
total += i
print(total) | n=int(eval(input()))
total = n*(n-1)//2
print(total) | p02924 |
n =int(eval(input()))
ans = sum([i for i in range(n)])
print(ans) | n =int(eval(input()))
ans = n * (n - 1) // 2
print(ans) | p02924 |
li = [i for i in range(1, int(eval(input()))+ 1)]
print((sum(li[:-1]))) | n = int(eval(input()))
print(((n * (n - 1)) // 2)) | p02924 |
n = int(eval(input()))
print((sum((list(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()))
ans=0
ans = (n-1)*(n)//2
print(ans) | p02924 |
n = int(eval(input()))
print((int(n*(n-1)//2)))
| n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
N = int(eval(input()))
ans = 0
for num in range(N):
ans += num
print(ans) | N = int(eval(input()))
a = N - 1
print((int(a*(a+1)//2)))
| p02924 |
import math
N = int(eval(input()))
sum =0
for i in range(N):
sum += i
print(sum) |
import math
N = int(eval(input()))
print((int(N * (N - 1) // 2))) | p02924 |
n=int(eval(input()))
a=0
if n==1:
print((0))
elif n==2:
print((1))
else:
for i in range(1,n):
a+=(n-i)
print(a)
| n=int(eval(input()))
a=(n-1)*n//2
print((int(a)))
| 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(i for i in range(n)))) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n = int(eval(input()))
ans = n%1
for i in range(2,n+1):
ans += (i-1)%i
# print(i-1,i,ans)
print(ans) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n = int(eval(input()))
print((sum([i for i in range(n)]))) | n = int(eval(input()))
print((n * (n - 1) // 2)) | p02924 |
import sys
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: [int(x) for x in ns().split()]
nall = lambda: [int(x) for x in sys.stdin.readlines()]
def main():
n = ni()
print((sum(range(n))))
if __name__ == '__main__':
main()
| import sys
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: [int(x) for x in ns().split()]
nall = lambda: [int(x) for x in sys.stdin.readlines()]
def main():
n = ni()
print((n * (n - 1) // 2))
if __name__ == '__main__':
main()
| p02924 |
N = int(eval(input()))
L = [i for i in range(1,N+1)]
print((sum(L[:-1]))) | N = int(eval(input()))
print(((N-1)*(1+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 |
N = int(eval(input()))
total = 0
for i in range(N):
total += i
print(total) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
N = int(eval(input()))
print((sum([i for i in range(N)]))) | N = int(eval(input()))
tmp = 0
for i in range(N):
tmp += i
print(tmp) | p02924 |
N=int(eval(input()))
if N==1:
print((0))
exit(0)
a=[i for i in range(1,N)]
print((sum(a))) | N=int(eval(input()))
if N==1:
print((0))
exit(0)
#a=[i for i in range(1,N)]
#print(sum(a))
if (N-1)%2==0:
print((N*((N-1)//2)))
else:
print((N*((N-1)//2)+((N-1)//2)+1)) | p02924 |
# coding: utf-8
n = int(eval(input()))
ans = 0
for i in range(1,n):
ans += i
print(ans) | # coding: utf-8
n = int(eval(input()))
ans = (n*(n-1))//2
print(ans) | p02924 |
n = int(eval(input()))
sum = 0
for i in range(n):
sum += i
print(sum)
| n = int(eval(input()))
if n % 2 == 0:
sum = int(n/2)
sum = sum *(n-1)
else:
sum = int((n-1)/2)
sum = sum * n
print((int(sum)))
| p02924 |
N = int(eval(input()))
output = 0
for i in range(1,N):
output += i
print(output) | N = int(eval(input()))
output = int(N*(N-1)//2)
print(output) | p02924 |
n = int(eval(input()))
total = 0
for i in range(n-1):
total += i+1
print(total) | n = int(eval(input()))
total = 0
print((n*(n-1)//2)) | p02924 |
n = int(eval(input()))
if n==1:
print((0))
else:
print((sum([i for i in range(n)]))) | n = int(eval(input()))
print(((n-1)*n//2)) | p02924 |
import sys
sys.setrecursionlimit(int(1e6))
N = int(eval(input()))
M_sum = 0
M_sum = sum(range(1, N))
M_sum += N % 1
print(M_sum)
| import sys
sys.setrecursionlimit(int(1e6))
N = int(eval(input()))
n = N - 1
if bool(n%2):
ans = (n//2) * (n) + n
else:
ans = (n//2) * (n+1)
print(ans)
| p02924 |
N = int(eval(input()))
ans = 0
P = []
P.append(N)
for i in range(N-1):
P.append(i+1)
for i in range(N):
ans = ans + (P[i] % (i+1))
print(ans) | N = int(eval(input()))
ans = 0
for i in range(N):
ans += i
print(ans) | p02924 |
N = int(eval(input()))
M = [x+1 for x in range(N)]
print((sum(set(M))-N)) | N = int(eval(input()))
ans = N*(N-1)//2
print(ans) | p02924 |
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += i
print(ans)
| 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([i for i in range(n)]))) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n=int(eval(input()))
print((n*(n-1)//2)) | 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())) - 1
print((n*(n+1)//2)) | p02924 |
n = int(eval(input()))
sum = 0
for i in range(n):
sum += i
print(sum) | n = int(eval(input()))
sum = n * (n - 1) // 2
print(sum) | p02924 |
n = int(eval(input()))
ans = sum(range(n))
print(ans) | n = int(eval(input()))
ans = n * (n-1)//2
print(ans) | p02924 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.