Problem:


Score : 100 points

Problem Statement

There are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?

Constraints

1≦N≦100

Input

The input is given from Standard Input in the following format:

N

Output

Print the necessary number of candies in total.

Sample Input 1

3

Sample Output 1

6

The answer is 1+2+3=6.

Sample Input 2

10

Sample Output 2

55

The sum of the integers from 1 to 10 is 55.

Sample Input 3

1

Sample Output 3

1

Only one child. The answer is 1 in this case.



Sample input:
3


Sample output:
6

Submission status: Accepted

Solution code:
num = int(input())
print((1+num)*num//2)

Submission status: Accepted

Solution code:
N=int(input())

ans=0

for i in range(1,N+1):
  ans += i

print(ans)

Submission status: Accepted

Solution code:
print(sum([j for j in range(int(input())+1)]))

Submission status: Accepted

Solution code:
x = int(input())
a=0
for i in range(x):
    a += i+1 
print(a)

Submission status: Accepted

Solution code:
n = int(input())
print (int(n*(n+1)/2))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    ans = 0
    for i in range(1, N + 1):
        ans += i
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
kazu = 0
for i in range(n + 1):
  kazu += i
print(kazu)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(1, n+1):
  ans += i
print("{}".format(ans))

Submission status: Accepted

Solution code:
print(sum([x for x in range(1,int(input())+1)]))

Submission status: Accepted

Solution code:
#ABC043a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n = int(input())
print((n + 1) * n // 2)

Submission status: Accepted

Solution code:
N = int(input())
s = 0
for i in range(N+1):
    s += i
print(s)

Submission status: Accepted

Solution code:
n=int(input())
print(int((n*(1+n))/2))

Submission status: Accepted

Solution code:
n=int(input())
result=0
for i in range(1,n+1):
  result+=i
print(result)

Submission status: Accepted

Solution code:
N=int(input())
print(N * (N + 1) // 2)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
# print(factorial(N))
ans = 0
for i in range(1, N + 1):
    ans += i
print(ans)

Submission status: Accepted

Solution code:
n= int(input())
print(int((n*(n+1))/2))

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(1, n+1):
  ans += i
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
print(int((n*(n+1)/2)))

Submission status: Accepted

Solution code:

N = int(input())


ans = 0

for i in range(N):

    i += 1
    ans += i

print (ans)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(1,n+1):
  ans += i
  
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

SUM = 0

for n in range(1,N + 1):
    
    SUM = SUM + n

print(SUM)

Submission status: Accepted

Solution code:
n = int(input())
count = 0
for i in range(n+1):
  count = count + i
print(count)

Submission status: Accepted

Solution code:
N = int(input())
sum = 0
for i in range(1,N+1):
    sum = sum + i
print(sum)

Submission status: Accepted

Solution code:
sum = 0
num = int(input())
for a in range(num+1):
    sum += a
print(sum)

Submission status: Accepted

Solution code:
a = int(input())
print(sum([i+1 for i in range(a)]))

Submission status: Accepted

Solution code:
N = int(input())

def Counter(n):
    if n <= 0:
        return n
    return n + Counter(n-1)
    

print(Counter(N))

Submission status: Accepted

Solution code:
N = int(input())

C = 0

for i in range(1,N+1):
    C += i

print(C)

Submission status: Accepted

Solution code:
sum = 0
n = int(input())

for i in range(1, n + 1):
    sum += i

print(sum)

Submission status: Accepted

Solution code:
N = int(input())
sum = 0
for i in range(1,N+1):
    sum += i
print(sum)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a = II()
    ans = 0
    for i in range(a + 1):
        ans += i
    print(ans)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
n = int(input())
num = list(range(1,n+1))
print(sum(num))

Submission status: Accepted

Solution code:
print(sum(list(range(int(input())+1))))

Submission status: Accepted

Solution code:
N = int(input())
n = 0

for i in range(1,N+1):
  n += i
  
print(n)

Submission status: Accepted

Solution code:
N = int(input())
n = 0

for i in range(1,N+1,1):
  n += i
  
print(n)

Submission status: Accepted

Solution code:
a = int(input())
print((1 + a) * a // 2)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC43 A
n = int(input())
print(n*(n+1)//2)

Submission status: Accepted

Solution code:
n = int(input())
n = n*(n+1)/2
print(int(n))

Submission status: Accepted

Solution code:
n = int(input())
sum = 0
for i in range(1,n+1,1):
    sum = sum + i
print(sum)

Submission status: Accepted

Solution code:
n=int(input())
ans=0
for i in range(n+1):
  ans+=i
print(ans)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

def solve():
    N = int(input())
    ans = (N+1)*N//2
    print(ans)

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
n=int(input())
print(int((n**2+n)/2))

Submission status: Accepted

Solution code:
n = int(input())
candy = 0
for x in range(0, n+1):
  candy += x
print(candy)

Submission status: Accepted

Solution code:
n = int(input())
print(n * (1 + n) // 2)

Submission status: Accepted

Solution code:
n = int(input())
print(int((n+1)*n*(1/2)))

Submission status: Accepted

Solution code:
N = int(input())
ans = 0;
for i in range(1, N+1):
    ans += i
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
print(int((1+n)*n*(1/2)))

Submission status: Accepted

Solution code:
N =int(input())
candy = 0
for i in range(N+1):
    candy += i
print(candy)

Submission status: Accepted

Solution code:
N = int(input())

print( N * (N + 1) // 2)

Submission status: Accepted

Solution code:
n = int(input())
if n == 1:
    print(n)
else:
    print(int((1+n)*n/2))

Submission status: Accepted

Solution code:
a = int(input())
print(int(0.5*a*(a+1)))

Submission status: Accepted

Solution code:
N = int(input())
candy = 0
for i in range(1, N+1):
    candy += i
print(candy)

Submission status: Accepted

Solution code:
n = int(input())
sum = 0
for i in range(1, n + 1):
    sum = sum + i
print(sum)

Submission status: Accepted

Solution code:
n = int(input())
s = sum([i for i in range(1,n+1)])
print(s)

Submission status: Accepted

Solution code:
n=int(input())
d=n*(n+1)/2
print(int(d))

Submission status: Accepted

Solution code:
N = int(input())
S = 0
for i in range(1, N+1):
  S += i
print(S)

Submission status: Accepted

Solution code:
n= int(input())
print(int((1+n)*n/2))

Submission status: Accepted

Solution code:
N = int(input())
print(int(1/2*N*(N+1)))

Submission status: Accepted

Solution code:
n = int(input())
s = 0
for i in range(n):
  s += i + 1
print(s)

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N = n()
print((N + 1) * N // 2)

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())

N = int(input())
print(N*(N+1)//2)

Submission status: Accepted

Solution code:
n = int(input())
print((n + 1) * n // 2)

Submission status: Accepted

Solution code:
N = int(input())

ans = 0
for i in range(1, N + 1):
    ans += i
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
print(int((1+N)*N/2))

Submission status: Accepted

Solution code:
x = int(input())

print(x*(x + 1)//2)

Submission status: Accepted

Solution code:
all = int(input())
a = 0
for i in range(1, all + 1):
    a += i
print(a)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
sum = 0
for i in range(1, n+1):
    sum += i
print(sum)

Submission status: Accepted

Solution code:
n = int(input())
result = 0
for i in range(1, n+1):
    result += i

print(result)

Submission status: Accepted

Solution code:
N = int(input())
can =0
for i in range(1,N+1):
  can+=i
  
  
print(can)

Submission status: Accepted

Solution code:
n = int(input())

ans = 0
for i in range(1, n + 1):
  ans += i
  
print(ans)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    ans = (1+n)*n/2
    print(int(ans))
if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
def abc():
    x = int(input())
    print(sum(range(1, x + 1)))


abc()

Submission status: Accepted

Solution code:
Sum = 0
x=int(input())+1
for i in range(x):
    Sum = Sum + i
print(Sum)

Submission status: Accepted

Solution code:
n = int(input())

c = 0
for i in range(n+1):
    c +=i
print(c)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

ans = 0
for i in range(1, n+1):
    ans += i
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
sum = 0
i = 1
for i in range(n + 1):
    sum = sum + i
    #print(i)
    
print(sum)

Submission status: Accepted

Solution code:
n = input()
a = 0
b = 0
for i in range(n):
    b = b + 1
    a = a + b
print a

Submission status: Accepted

Solution code:
n = int(input())

sum = 0
for i in range(1, n+1):
    sum += i
print(sum)

Submission status: Accepted

Solution code:
N = int(input())
print(int(((1+N)/2)*N))

Submission status: Accepted

Solution code:
N=int(input())
i=0
for k in range(1,N+1):
    i=i+k
print(i)

Submission status: Accepted

Solution code:
childrenNum = int(input())
candySum = 0

for i in range(1, childrenNum + 1):
    candySum += i

print(candySum)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(n):
  ans += i+1
print(ans)

Submission status: Accepted

Solution code:
N = input()
sum = 0
for i in range(1,int(N) + 1):
  sum = sum + i
  
print(sum)

Submission status: Accepted

Solution code:
a = int(input())
ans = 0
for x in range(a+1):
    ans += x
print(ans)

Submission status: Accepted

Solution code:
a=int(input())
print((1+a)*a//2)

Submission status: Accepted

Solution code:
n=int(input())

print(int((1+n)*n/2))

Submission status: Accepted

Solution code:
a=int(input())

print(a*(a+1)//2)

Submission status: Accepted

Solution code:
child = int(input())

candy = 0

for i in range(child):
    candy += i+1

print(candy)

Submission status: Accepted

Solution code:
a=int(input())
s=a*(a+1)/2
print(int(s))

Submission status: Accepted

Solution code:
i=int(input())
print((i*(i+1))//2)

Submission status: Accepted

Solution code:
N = int(input())
answer = 0
for i in range(N+1):
    answer += i
print(answer)

Submission status: Accepted

Solution code:
N = int(input())
answer = 0
for i in range(N+1):
  answer += i
print(answer)

Submission status: Accepted

Solution code:
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###

N = int(input())

cnt = 0
for i in range(1, N+1):
  cnt += i

print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
print( int(n*(n+1)/2))

Submission status: Accepted

Solution code:
a = int(input())

result = 0
for i in range(a):
    # print(result, end='\n')

    # print(i)
    result = result + (i + 1)

print(result)

Submission status: Accepted

Solution code:
a = input()
print(a * (a + 1)/2)

Submission status: Accepted

Solution code:
a=int(input())
ans=0
for i in range(a+1):
  ans+=i
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(1,n+1):
    ans+=i
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
i=0
for m in range(n+1):
	i=i+m
print(i)

Submission status: Accepted

Solution code:
N = int(input())
ans = 0
for i in range(N):
  ans += i+1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
print(int((N+1)/2*N))

Submission status: Accepted

Solution code:
n=int(input())
c=0
for i in range(1,n+1):
    c+=i
print(c)

Submission status: Accepted

Solution code:
N = int(input())

ans = N*(N+1) // 2

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
m = 0
for i in range(n):
  m += i+1
print (m)

Submission status: Accepted

Solution code:
a = int(input())
y = 0
for x in range(a+1):
        y += x
print(y)

Submission status: Accepted

Solution code:
n = int(input())
l = list(range(1, n+1))

print(sum(l))

Submission status: Accepted

Solution code:
i = int(input())
sum = 0
for i in range(i+1):
    sum += i
print(sum)

Submission status: Accepted

Solution code:
n=int(input())
s=0
for i in range(1,n+1):
	s+=i
print(s)

Submission status: Accepted

Solution code:
n = int(input())
result = 0
for i in range(1,n+1):
    result += i
print(result)

Submission status: Accepted

Solution code:
n=int(input())

allnum = 0

for i in range(n+1):
  allnum += i
  
print(allnum)

Submission status: Accepted

Solution code:
n = int(input())
if n!=1:
  print(int(n*(n+1)/2))
else:
  print(1)

Submission status: Accepted

Solution code:
n = int(input())
print(int(n * (n+1)/2))

Submission status: Accepted

Solution code:
a=int(input())
answer=0
for i in range(1,a+1):
  answer+=i
print(answer)

Submission status: Accepted

Solution code:
n = int(input())

Answer = n*(n+1)/2

print(int(Answer))

Submission status: Accepted

Solution code:
n=int(input())

sum=0
for i in range(n+1):
	sum += i;

print(sum)

Submission status: Accepted

Solution code:
N = int(input())

print(((1+N)*N)//2)

Submission status: Accepted

Solution code:
N = int(input())
candy = 0
for i in range(N+1):
    candy += i
print(candy)

Submission status: Accepted

Solution code:
n=int(input())

answer=[]

for i in range(1,n+1):
    answer.append(i)

print(sum(answer))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
# 整数の入力
n = int(input())

# 計算
sum = 0

for num in range(n+1) :
    sum += num
    
# 出力
print(sum)

Submission status: Accepted

Solution code:
n = int(input())
sum = 0
for i in range(n):
  sum += i+1
print(sum)

Submission status: Accepted

Solution code:
N = int(input())

print(int((1 + N) * N / 2))

Submission status: Accepted

Solution code:
N = int(input())
g = 0
for n in range(1, N+1):
    g += n
print(g)

Submission status: Accepted

Solution code:
N = int(input())
ans = 0
for i in range(N):
    ans += i + 1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
ans = 0
for i in range(N):
    ans += i + 1

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
sum = 0
for x in range(n):
  	sum = sum + x +1
print(sum)

Submission status: Accepted

Solution code:
N = int(input())
result = N * (N + 1) // 2
print(result)

Submission status: Accepted

Solution code:
a=int(input())
b=0
for i in range(a):
    b=a+b
    a -=1
print(b)

Submission status: Accepted

Solution code:
n = int(input()) 
print(n*(n+1)//2)

Submission status: Accepted

Solution code:
n = int(input())
value = 0
for i in range(1,n+1):
    value += i
print(value)

Submission status: Accepted

Solution code:
N = int(input())
required_candy = 0
for i in range(1,N+1):
    required_candy += i

print(required_candy)

Submission status: Accepted

Solution code:
N = int(input())
print(int((1 + N) * (N / 2)))

Submission status: Accepted

Solution code:
n = int(input())
print(int((1+n)/2*n))

Submission status: Accepted

Solution code:
N = int(input()) 

print((1+N)*N//2)

Submission status: Accepted

Solution code:
N = int(input())
S = int(N*N/2+N/2)
print(S)

Submission status: Accepted

Solution code:
N = int(input())
print(sum(range(1, N+1)))

Submission status: Accepted

Solution code:
N=int(input())

print(int((N+1)*N/2))

Submission status: Accepted

Solution code:
N = int(input())
print(sum(i for i in range(1,N+1)))

Submission status: Accepted

Solution code:
N = int(input())
cnt = 0
for i in range(N+1):
    cnt += i
print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
a = list(range(1,n+1))
b = sum(a)
print(b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

a = 0
for i in range(1, n+1):
    a += i
    
print(a)

Submission status: Accepted

Solution code:
n = int(input())

ans = 0
for i in range(1, n + 1):
    ans += i
print(ans)

Submission status: Accepted

Solution code:
def main():
	N = int(input())
	print(((N+1)*N)//2)


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
n=int(input())
print(int(1/2*n*(n+1)))

Submission status: Accepted

Solution code:
N = int(input())
print(int(N * (N + 1) / 2))

Submission status: Accepted

Solution code:
n = int(input())
print(sum(list(range(n+1))))

Submission status: Accepted

Solution code:
Person = int(input())

Candy = 0

for i in range(Person):

    Candy += i+1

print(Candy)

Submission status: Accepted

Solution code:
n=int(input())
     
print(int(n*(n+1)/2))

Submission status: Accepted

Solution code:
a = int(input())
print(int(a*(a+1)/2))

Submission status: Accepted

Solution code:
n = int(input())
ans = 0

for i in range(n):
    ans += i + 1
    
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
cnt=0

for i in range(1,n+1):
    cnt+=i
print(cnt)

Submission status: Accepted

Solution code:
n=int(input())
ans=0
for i in range(n+1):
    ans+=i
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
     
sum=n*(n+1)/2
     
print(int(sum))

Submission status: Accepted

Solution code:
print(sum(range(int(input())+1)))

Submission status: Accepted

Solution code:
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import sys

sys.setrecursionlimit(10000)
INF = float('inf')

N=int(input())


a = 1
ans = 0
for i in range(N):
    ans += a
    a += 1

print(ans)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    print(int((1 + N) * N / 2))
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = int(input())
print(int((1+a)*a/2))

Submission status: Accepted

Solution code:
L = int(input())
print(int(L*(L+1)/2))

Submission status: Accepted

Solution code:
N = int(input())

ans = N*(N+1)//2

print(ans)

Submission status: Accepted

Solution code:

def read_input():
    n = int(input())
    return n


def submit():
    n = read_input()
    print(int(n * (n + 1) / 2))


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
N = int(input())
s = 0
for i in range(N):
  s += i + 1
print(s)

Submission status: Accepted

Solution code:
N = int(input())
print(sum(list(range(1, N+1))))

Submission status: Accepted

Solution code:
n=int(input())
ans = 0
for i in range(n+1):
  ans += i
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

print(sum([i for i in range(1, int(input()) + 1)]))

Submission status: Accepted

Solution code:
a=input()
a=int(a)
b=(a*(a+1))//2
print(b)

Submission status: Accepted

Solution code:
n = int(input())
l = [i + 1 for i in range(n)]

print(sum(l))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

def solve(N):
    sum = 0
    for i in range(1, N+1):
        sum += i
    print(sum)
    
if __name__ == '__main__':
    N = int(input())
    
    solve(N)

Submission status: Accepted

Solution code:
n=int(input())
sum=0

if n%2==0:
    flag=int(n/2)
    for i in range(flag):
        sum=sum+(n+1)
else:
    flag=int((n-1)/2)
    for i in range(flag):
        sum=sum+(n+1)
    sum=sum+((n+1)/2)

print(int(sum))

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    N = int(input())
    return N*(N+1)//2

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N = int(input())

number = 0
for i in range(1, N + 1):
    number += i
print(number)

Submission status: Accepted

Solution code:
# ABC043A - キャンディーとN人の子供イージー / Children and Candies (ABC Edit)
n = int(input())
total = 0
for i in range(1, n + 1):
    total += i
print(total)

Submission status: Accepted

Solution code:
n = int(input())

total = (n + 1)*n//2
print(total)

Submission status: Accepted

Solution code:
N = int(input())

print((N*(N+1))//2)

Submission status: Accepted

Solution code:
num = int(input())
cnt = 0
for i in range(num):
  cnt += i + 1
print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
sum = 0

for i in range(1, n + 1):
    sum += i

print(sum)

Submission status: Accepted

Solution code:
n = int(input())
cnt = 0
for i in range(1,n+1):
    cnt += i
print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
isum = 0
for i in range(n+1):
    isum += i
print(isum)

Submission status: Accepted

Solution code:
n= int(input())
print(int(n*(n+1)/2))

Submission status: Accepted

Solution code:
N = int(input())
ans = 0
for i in range(N):
  ans += N
  N -= 1
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
input=stdin.readline().rstrip()
input=int(input)
sum=0
for i in range(input+1):
  sum+=i
  
print(sum)

Submission status: Accepted

Solution code:
n = int(input())
print(int(n * (n + 1) / 2))

Submission status: Accepted

Solution code:
n = int(input())
res = 0
for i in range(n+1):
  res += i
print(res)

Submission status: Accepted

Solution code:
a = int(input())
sum = 0
for i in range(a+1):
  sum += i
print(sum)

Submission status: Accepted

Solution code:
n=int(input())
sum=0
for i in range(n+1):
  sum+=i
print(sum)

Submission status: Accepted

Solution code:
N =int(input())
print(int(N*(N+1)/2))

Submission status: Accepted

Solution code:
n=input()
n=int(n)
a=0
for i in range(1,n+1):
    a=a+i
print(a)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

n = int(input())

sum = 0

for i in range(1, n+1):
    sum += i
print(sum)

Submission status: Accepted

Solution code:
x = int(input())
print(int((x**2 + x) /2))

Submission status: Accepted

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
total = 0
for i in range(1, n+1):
    total += i
print(total)

Submission status: Accepted

Solution code:
N = int(input())
a = int(N * ( N + 1 ) / 2)
print(a)

Submission status: Accepted

Solution code:
n = int(input())

print(n*(1+n)//2)

Submission status: Accepted

Solution code:
n = int(input())

c = 0
for i in range(n):
    c += i +1

print(c)

Submission status: Accepted

Solution code:
def children_and_candies(N: int)->int:
    return N * (N + 1) // 2


if __name__ == "__main__":
    N = int(input())
    ans = children_and_candies(N)
    print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = range(a+1)
print(sum(b))

Submission status: Accepted

Solution code:
n = input()
ya  = 0
for i in range(1,int(n) + 1):
		
	ya += i
print(ya)

Submission status: Accepted

Solution code:
n = int(input())
cnt = 0
 
for i in range(n + 1) :
  cnt += i
print(cnt)

Submission status: Accepted

Solution code:
N = int(input())
result = 0
for i in range(N+1):
  result += i
print(result)

Submission status: Accepted

Solution code:
from sys import stdin

N = int(stdin.readline().rstrip())
result = 0

for i in range(1, N+1):
    result += i
print(result)

Submission status: Accepted

Solution code:
N = int(input())
# N = 5
cnt = 0
for i in range(N+1):
    cnt += i
print(cnt)

Submission status: Accepted

Solution code:
N = int(input())

ans = 0
for i in range(N):
    ans += i+1

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
count = 0
 
 
for i in range(N+1):
    count += i 
    
print(count)

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-

n = int(input())
x = 0
for z in range(0,n+1):
    x += z
print(x)

Submission status: Accepted

Solution code:
N = int(input())
count = 0
for i in range(N):
    count += i + 1
print(count)

Submission status: Accepted

Solution code:
N=int(input())
ans=(N*(N+1))//2
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
input = stdin.readline
N = int(input())
print(int(1/2 * N * (N+1)))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    total = 0
    for i in range(N+1):
        total += i
    print(total)
main()

Submission status: Accepted

Solution code:
n=int(input())

ans=(1+n)*n//2
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
a = N*(N+1)/2
print(int(a))

Submission status: Accepted

Solution code:
n = int(input())
print(  n * (n+1) // 2 )

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
n = I()
print((n*(n+1))//2)
#B

#C

#D
"""
s = S()
l = len(s)
for i in range(l-1):
    if s[i] == s[i+1]:
        print(i+1,i+2)
        quit()
for i in range(l-2):
    if s[i] == s[i+2]:
        print(i+1,i+3)
        quit()
print(-1,-1)
"""

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
from functools import reduce

def main():
    # 一文字のみを読み込み
    # s = input().rstrip().split(' ')
    
    # スペース区切りで標準入力を配列として読み込み
    # s = input().rstrip().split(' ')

    # 位置文字ずつ標準入力を配列として読み込み
    # s = list(input().rstrip())
    n = int(input().rstrip())
    ans = 0
    for i in range(1,n+1):
        ans = ans + i
    print(ans)    
   
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
def main():
  a = int(input())
  print(int(((a+1)*a)/2))

if __name__=='__main__':main()

Submission status: Accepted

Solution code:
N = int(input())

count = 0

for i in range(N):
	count += i+1

print(count)

Submission status: Accepted

Solution code:
n=int(input())
z=0
for i in range(1,n+1):
    z+=i
print(z)

Submission status: Accepted

Solution code:
N  = int(input())
print((1+N)*(N)//2)

Submission status: Accepted

Solution code:
N  = int(input())
ans = 0
for i in range(N+1):
  ans += i
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

res = 0
for i in range(n+1):
    res+=i
print(res)

Submission status: Accepted

Solution code:
N = int(input())

ans = 0
for i in range(N):
	ans += i+1

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
def calc(n):
    if n==1:
        return 1
    else:
        return n+calc(n-1)
print(calc(n))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    print((1+N)*N//2)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
all_list = [i for i in range(1, N+1)]
result = np.cumsum(all_list)
print(max(result))

Submission status: Accepted

Solution code:
N = int(input())

answer = 0

for i in range(1, N+1):
    answer += i

print(answer)

Submission status: Accepted

Solution code:
n = int(input())
print(int((n+1)*(n/2)))

Submission status: Accepted

Solution code:
print(sum([x for x in range(1,int(input())+1)]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
children = list(i for i in range(1, n+1))
answer = sum(children)
print(answer)

Submission status: Accepted

Solution code:
print(sum([_ for _ in range(1,int(input())+1)]))

Submission status: Accepted

Solution code:
N = int(input())
print(sum([i for i in range(1,N+1)]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())

ans = 0
for i in range(1, N + 1):
    ans += i
print(ans)

Submission status: Accepted

Solution code:
#43
n = int(input())
print(int(n*(n+1)/2))

Submission status: Accepted

Solution code:
# coding: UTF-8

N = int(input())

print(int(N*(N+1)/2))

Submission status: Accepted

Solution code:
N = int(input())
n_sum = int((1+N)*N/2)
print(n_sum)

Submission status: Accepted

Solution code:
input_str = int(input())
result = 0
# 関数を使う
## result = sum([i for i in range(1, input_str+1)])
# 等差数列の和の公式
## result = (input_str * (input_str+1))//2
for i in range(1, input_str+1):
    result += i
print(result)

Submission status: Accepted

Solution code:
input_str = int(input())
result = 0
for i in range(1, input_str+1):
    result += i
print(result)

Submission status: Accepted

Solution code:
n=int(input());print(round(n*(n+1)/2))

Submission status: Accepted

Solution code:
N=int(input())
print(str(int(N*(N+1)/2)))

Submission status: Accepted

Solution code:
n = int(input())

ans = 0
for i in range(n):
    ans += i + 1

print(ans)