input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def main():
n = int(eval(input()))
ans = 0
for i in range(n-1):
ans += i+1
print(ans)
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
# for i in range(n-1):
# ans += i+1
# print(ans)
print((((n-1) * n) // 2))
if __name__ == '__main__':
main() | p02924 |
N = int(eval(input()))
M = 0
for i in range(1, N):
M = M + i
print(M) | N = int(eval(input()))
s = (N-1) * N // 2
print(s) | 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-1)%2==0):
ans = (n)*((n-1)//2)
else:
ans = (n)*((n-1)//2) + n//2
print(ans) | p02924 |
n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(eval(input()))
print((int(n*(n-1)//2)))
| p02924 |
print((sum([i for i in range(1, int(eval(input())))]))) | N = int(eval(input()))
if N % 2 == 0:
print(((N-1)*N//2))
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(ans)
| p02924 |
n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans) | n = int(eval(input()))
ans = 0
print((n*(n-1)//2)) | p02924 |
N = int(eval(input()))
if N !=1:
result = sum(range(1,N))
else:
result = 0
print(result) | N = int(eval(input()))
result = N * (N-1)//2
print(result) | p02924 |
N = int(eval(input()))
print((sum(range(1, N))))
| N = int(eval(input()))
print(((N-1) * N //2))
| p02924 |
N=int(eval(input()))
total=[ a for a in range(N) ]
print((sum(total))) | N=int(eval(input()))
print(('{}'.format((N*(N-1)//2)))) | p02924 |
n = int(eval(input()))
if n == 1:
print((0))
elif n == 2:
print((1))
else:
print((sum(range(1, n)))) | n = int(eval(input()))
if n == 1:
print((0))
elif n == 2:
print((1))
else:
print(((1 + n - 1) * (n - 1) // 2)) | p02924 |
n = int(eval(input()))
a = list(i for i in range(1, n+1))
p = a.copy()
p.append(p[0])
p.pop(0)
c = 0
for i in range(n):
c += a[i] % p[i]
print(c)
| n = int(eval(input()))
c = 0
for i in range(1, n+1):
x = i + 1 if i < n else 1
c += i % x
print(c)
| 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()))
sum = 0
for i in range(1,n):
sum += i
print(sum) | n = int(eval(input()))
print((int(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()))
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()))
if n%2:
p = ((n-1)//2)*n
print((int(p)))
else:
p = (n//2)*(n-1)
print((int(p))) | p02924 |
n = int(eval(input()))
count = 0
if n==0:
print(count)
exit()
else:
for i in range(n-1):
count += i+1
print(count) | n = int(eval(input()))
count = (n-1)*n//2
print(count) | 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 |
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(eval(input()))
ans = sum([i for i in range(1,n)])
print(ans) | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(eval(input()))
ans = int(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 * (N - 1)) // 2)) | p02924 |
def main():
n = int(eval(input()))
not_n = (int(i) for i in range(1,n))
print((sum(not_n)))
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
not_n = ((n-1) * n)// 2
print(not_n)
if __name__ == '__main__':
main() | p02924 |
#abc139d
N = int(eval(input()))
if N>2:
ans=0
add = [i for i in range(2,N,1)]
print((ans+sum(add)+1))
elif N==2:
print("1")
elif N==1:
print("0") | #139D
#ここから試験用コード
'''
import itertools
for N in range(1,13):
l = [i for i in range(1,N+1)]
ans = 0
ans_permutation = list()
for permutation in itertools.permutations(l, N):
temp_ans = 0
permutation = [0] + list(permutation)
for i in range(1,N+1):
t... | p02924 |
print((sum(range(1, int(eval(input())))))) | n = int(eval(input()))
print(((n - 1) * n // 2)) | p02924 |
n = int(eval(input()))
if n == 1:
print((0))
else:
print((sum(range(1, n)))) | n = int(eval(input()))
print((n * (n - 1) // 2))
| p02924 |
print((sum(range(int(eval(input())))))) | n = int(eval(input()))
print((n * (n - 1) // 2)) | p02924 |
n = int(eval(input()))
p2 = [ i + 1 for i in range(n-1)]
p2.append(0)
print((sum(p2))) | n = int(eval(input()))
print((n*(n-1)//2))
| p02924 |
a = int(eval(input()))
result = 0
for i in range(a - 1):
result = result + i + 1
print(result) | a = int(eval(input()))
print((int(a * (a - 1) // 2))) | p02924 |
N = int(eval(input()))
n = [x for x in range(1, N+1)]
print((sum(n[:-1]))) | N = int(eval(input()))
print(((N+1) * N // 2 - N)) | p02924 |
N = int(eval(input()))
M = 0
for i in range(1, N+1):
M += i
M = M - N
print(M) | N = int(eval(input()))
M = 0
M = N * (N-1) // 2
print((int(M))) | p02924 |
n = int(eval(input()))
A = [i for i in range(1, n+1)]
B = [i for i in range(2, n+1)]
B.append(1)
ans = 0
for a, b in zip(A, B):
ans += a % b
print(ans)
| n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += i % (i+1)
print(ans) | p02924 |
n = int(eval(input()))
ans = 0
for i in range(1, n):
ans += i % (i+1)
print(ans) | n = int(eval(input()))
if n % 2 == 0:
print(((n-1)*int(n/2)))
else:
print((n*int((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 |
n=int(eval(input()))
s=0
for i in range(n):
s+=i
print(s)
| n=int(eval(input()))
s=n*(n-1)//2
print(s)
| p02924 |
N = int(eval(input()))
res = 0
for i in range(N):
res += i
print(res) | N = int(eval(input()))
N -= 1
print((N*(N+1)//2)) | p02924 |
a = int(eval(input()))
sum=0
for i in range(1,a):
sum+=i
print(sum)
| a = int(eval(input()))
print((a*(a-1)//2))
| p02924 |
N=int(eval(input()))
P=[]
for i in range(N-1):
P.append(i+2)
P.append(1)
ans=0
for i in range(N):
ans+=(i+1)%P[i]
print(ans) | 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()))
ans = [i for i in range(0, n)]
print((sum(ans))) | n = int(eval(input()))
ans = (n-1)*n // 2
print(ans) | p02924 |
N = int(eval(input()))
sum = 0
for i in range(1, N):
sum += i
if N == 1:
print((0))
else:
print(sum) | N = int(eval(input()))
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()))
print(((n-1)*n // 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()))
if N % 2 == 1:
print((N * (N//2)))
else:
print((N * (N//2-1) + (N//2))) | p02924 |
N = int(eval(input()))
print((sum([i for i in range(N)]))) | N = int(eval(input()))
print(((N-1)*N//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(range(N)))) | N = int(eval(input()))
print(((N*(N-1))//2)) | p02924 |
n = int(eval(input()))
m = 0
for i in range(n):
t = i + 1
if t == n:
m += 0
else:
m += t % (t + 1)
print(m)
| n = int(eval(input()))
m = n * (n - 1) // 2
print(m)
| p02924 |
print((sum(range(1,int(eval(input())))))) | n=int(eval(input()))
n-=1
print((n*(n+1)//2)) | p02924 |
n = int(eval(input()))
r = 0
for i in range(1, n):
r += i
print(r) | n = int(eval(input()))
print((n * (n - 1) // 2)) | p02924 |
n=int(eval(input()))
if n==1:
print((0))
exit()
print((n*(n-1)//2))
| n=int(eval(input()))
print((n*(n-1)//2))
| p02924 |
print((sum(range(1, int(eval(input())))))) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n = int(eval(input()))
m=0
for i in range(n):
m += i
print(m)
| n = int(eval(input()))
m = int(((n-1)*n)//2)
print(m) | p02924 |
#n = int(input())
#L = list(map(int, input().split()))
import math
import sys
import fractions
N = int(sys.stdin.readline()[:-1])
sum = 0
for i in range(N):
sum += i
print(sum)
| #n = int(input())
#L = list(map(int, input().split()))
import math
import sys
import fractions
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 |
a=int(eval(input()))
print((sum(range(1,a+1))-a))
| a=int(eval(input()))
print((a*(a+1)//2-a))
| p02924 |
N = int(eval(input()))
s = [i for i in range(N)]
print((sum(s))) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
N=int(eval(input()))
print((sum(set(range(N))))) | N=int(eval(input()))
print((N*(N-1)//2)) | p02924 |
#!/usr/bin/env python3
import sys
def solve(N: int):
print((sum([i for i in range(1,N)])))
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tok... | #!/usr/bin/env python3
import sys
def solve(N: int):
print(((N-1)*(N)//2))
return
# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
... | p02924 |
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')
def sol():
N = int(eval(input()))
... | N=int(eval(input()));print((N*(N-1)//2)) | p02924 |
import sys
input = sys.stdin.readline
def main():
ans = 0
n = int(eval(input()))
for i in range(1, n):
ans += i%(i+1)
print(ans)
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))-1
ans = (1+n)*(n//2)
if n%2 != 0:
ans += n//2+1
print(ans)
if __name__ == '__main__':
main() | 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 |
print((sum(range(int(eval(input())))))) | n = int(eval(input()))
print((n * (n-1) // 2)) | p02924 |
N = int(eval(input()))
a = [i for i in range(1, N+1)]
p = a.copy()
p = p[1:] + [p[0]]
print((sum([ai%pi for ai, pi in zip(a, p)])))
| N = int(eval(input()))
print(((N-1) * N // 2))
| p02924 |
num = int(eval(input()))
arr = [i for i in range(1,num+1)]
print((sum(arr[:-1]))) | num = int(eval(input()))
print((int(num*(num-1)//2))) | p02924 |
n = int(eval(input()))
num = 0
for i in range(n):
num = num + i
print(num)
| n = int(eval(input()))
num = 0
num = n*(n-1)//2
print(num)
| p02924 |
n = int(eval(input()))
m = 0
for i in range(n-1):
m += (i+1)
print(m)
| n = int(eval(input()))
m = (n-1)*n//2
print(m) | p02924 |
import sys
from collections import deque
import itertools
from collections import deque
sys.setrecursionlimit(10 ** 9)
# map(int, sys.stdin.read().split())
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
print((int(N*(N-1)//2)))
if __name__ =... | import sys
from collections import deque
import itertools
from collections import deque
sys.setrecursionlimit(10 ** 9)
# map(int, sys.stdin.read().split())
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
print((N*(N-1)//2))
if __name__ == "__... | 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()))
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()))
result = 0
for i in range(1, n):
result += i
print(result) | n = int(eval(input()))
print(((n*(n-1))//2)) | p02924 |
N = int(eval(input()))
candi =int((N+1)/2*N -N)
if N%2 == 0:
an = [ i for i in range(1,N+1)]
an.reverse()
nex_num = N
count =0
for i in an:
if nex_num == i:
nex_num = (i//2) + 1
count += (i%nex_num) #next_numを割るところに使う
nex_num = nex_num -1
... | N = int(eval(input()))
print(((N-1)*N//2)) | p02924 |
a=int(eval(input()))
b=[i for i in range(a)]
c=int(sum(b))
print(c) | a=int(eval(input()))
b=int(a*(a-1)//2)
print(b) | p02924 |
import sys
inputs = sys.stdin.readlines()
N = int(inputs[0])
s = 0
for i in range(1, N+1):
s += i
print((s-N)) | import sys
inputs = sys.stdin.readlines()
N = int(inputs[0])
print(((N-1)*N // 2)) | p02924 |
n = int(eval(input()))
ans = 0
if n>1:
for i in range(n):
ans+=i
print(ans) | n = int(eval(input()))
ans = 0
if n>1:
ans=((n-1)*n)//2
print(ans) | p02924 |
N=int(eval(input()))
ans=0
for i in range(N):
ans+=i
print(ans) | N = int(eval(input()))
if N == 1:
print((0))
elif N == 2:
print((1))
else:
print(((N * (N-1)) // 2)) | p02924 |
import sys
N = int(sys.stdin.readline())
print((sum(n + 1 for n in range(N - 1))))
| import sys
N = int(sys.stdin.readline())
print((int((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()))
res = 0
for i in range(N):
res += i
print(res)
| N = int(eval(input()))
res = (N - 1) * N // 2
print(res)
| p02924 |
import os, sys, re, math
N = int(eval(input()))
print((sum([i for i in range(1, N)])))
| import os, sys, re, math
N = int(eval(input()))
s = (1 + (N - 1)) * (N // 2)
if (N - 1) % 2 == 1:
s -= N // 2
print(s)
| p02924 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
from collections import deque
N = int(eval(input()))
p = deque()
for i in range(N):
p.append(i+1)
x = p.popleft()
p.append(x)
#p = [2,3,4,5,6,7,8,9,10,11,12,13,1]
#print(p)
count = 0
for i i... |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
N = int(eval(input()))
count = 0
for i in range(N):
if i == (N-1):
count += (i+1) % (1)
else:
count += (i+1) % (i+2)
print(count)
| p02924 |
N = int(eval(input()))
# {1, 2, ..., N}
# {P1, P2, ..., Pn} として {2, 3, ..., N, 1} を選べる
print((sum([i for i in range(N)])))
| N = int(eval(input()))
# {1, 2, ..., N}
# {P1, P2, ..., Pn} として {2, 3, ..., N, 1} を選べる
count = 0
for i in range(N):
count += i
print(count) | p02924 |
N = int(eval(input()))
# {1, 2, ..., N}
# {P1, P2, ..., Pn} として {2, 3, ..., N, 1} を選べる
count = 0
for i in range(N):
count += i
print(count) | N = int(eval(input()))
# {1, 2, ..., N}
# {P1, P2, ..., Pn} として {2, 3, ..., N, 1} を選べる
print(((N-1) * N // 2))
| p02924 |
#!/usr/bin/env python3
import sys
# import math
# import numpy as np
# from functools import lru_cache
args = sys.argv
if len(args) == 2:
from IPython import embed
em = True
else:
em = False
# sys.setrecursionlimit(10000)
#### input
N = int(eval(input()))
# a, b = map(int, input().split())
# ... | #!/usr/bin/env python3
import sys
# import math
# import numpy as np
# from functools import lru_cache
args = sys.argv
if len(args) == 2:
from IPython import embed
em = True
else:
em = False
# sys.setrecursionlimit(10000)
#### input
N = int(eval(input()))
# a, b = map(int, input().split())
# ... | p02924 |
n=int(eval(input()))
s=0
for i in range(1,n):
s+=i
print(s) | n=int(eval(input()))
print(((n-1)*n//2)) | p02924 |
N = int(eval(input()))
c = [i for i in range(1, N)]
print((sum(c))) | N = int(eval(input()))
sum = 0
for i in range(1, N):
sum += i
print(sum) | p02924 |
n = int(eval(input()))
sum = 0
for i in range(1, n):
sum += i
print(sum) | n = int(eval(input()))
ans = int((n*(n-1))//2)
print(ans) | 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()))
ans = 0
for i in range(n-1):
ans += i+1
print(ans) | n = int(eval(input()))
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()))
print((N*(N-1)//2))
| p02924 |
n=int(eval(input()))
a=0
for i in range(1,n):
a+=i
print(a) | n=int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n=int(eval(input()))
list1=[]
count2=1
ans_sum=[]
#list2=list(0 for _ in range(n))
for i in range(n):
list1.append(i+1)
for i in range(n):
count=count2
ans=[]
for j in range(n):
ans.append(list1[j]%count)
if count==n:
count=1
else:
count+=1
... | n=int(eval(input()))
ans=n*(n-1)//2
print((int(ans)))
| p02924 |
N = int(eval(input()))
P = [(x + 2) for x in range(N-1)] + [1]
M = [i % P[i-1] for i in range(N)]
print((sum(M))) | N = int(eval(input()))
#P = [(x + 2) for x in range(N-1)] + [1]
#M = [i % P[i-1] for i in range(N)]
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()))
print((n*(n-1)//2))
| p02924 |
n = int(eval(input()))
answer = sum([i for i in range(n)])
print(answer) | import sys
input = sys.stdin.readline
a = int(eval(input()))
print((int((a-1)*(a)//2))) | p02924 |
n = int(eval(input()))
p_lst = [e for e in range(1,n+1)]
first, last = 1, n-1
res = (n-1)*(first+last)/2
print((int(res))) | n = int(eval(input()))
first, last = 1, n-1
res = (n-1)*n//2
print((int(res))) | p02924 |
n = int(eval(input()))
x= n-1
a = x*n
print((int(a//2)))
| n = int(eval(input()))
x= n-1
a = x*n
print((a//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 |
N = int(eval(input()))
print((sum([i for i in range(N)])))
| N = int(eval(input()))
# print(sum([i for i in range(N)]))
print((N*(0 + N-1)//2))
| p02924 |
n = int(eval(input()))
print((sum(range(n)))) | n = int(eval(input()))
print(((n)*(n-1)//2)) | p02924 |
n = int(eval(input()))
if n == 1:
print((0))
exit()
li = [i for i in range(n)]
ans = sum(li)
print(ans) | n = int(eval(input()))
ans = n * (n - 1) // 2
print(ans) | p02924 |
n = int(eval(input()))
print((n*(n-1)//2)) | n = int(eval(input()))
ans = (n-1)*n//2
print(ans) | p02924 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.