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:
N = int(input())

X = 0

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

print(X)

Submission status: Accepted

Solution code:
N = int(input())

X = []

for i in range(N):
  Y = i + 1
  X.append(Y)

print(sum(X))

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:
n=int(input())
print(int((n*(1+n)/2)))

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(readline())

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    ans = 0

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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((1+n)*(n//2) + (n%2)*((1+n)//2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input()) 
print(int((N+1)*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())
r=0
for i in range(N):
  r +=i+1
print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())

list = np.array(range(n+1))

print(sum(list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    N = I()
    sum = 0
    for i in range(N):
        sum +=(i+1)
    ans = sum
    print(sum)



import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

k = (n + 1) * n / 2

print(int(k))

Submission status: Accepted

Solution code:
n = int(input())

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

print(ans)

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:
# python3 (3.4.3)
import sys
input = sys.stdin.readline

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

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())
j=0
k=1
for i in range(N):
  j = j + k
  k = k + 1
print(j)

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*-coding: utf-8 -*-

num = int(input())
total = 0

for i in range(num):
  total = total + i + 1
  
print(total)

Submission status: Accepted

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

n = int(input())

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())

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

Submission status: Accepted

Solution code:
N=int(input())

def souwa(n):
    if n==1:
        return 1
    else:
        return n+souwa(n-1)

x=souwa(N)
print(x)

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(round(n*(n+1)/2))

Submission status: Accepted

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

Submission status: Accepted

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

sum = 0
for i in range(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())
print((int)((n*(n+1))/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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());
ans = 0;

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
if N == 1:
    print(1)
elif N%2 != 0:
    print((1+N)*(N//2)+(N-N//2))
else:
    print((1+N)*(N//2))

Submission status: Accepted

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

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(0.5*N*(N+1)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

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:
x = 0
n = int(input())
for i in range(n+1):
  x += i
print(x)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
def check(n):
    return sum(range(1, n + 1))


def main():
    N = int(input())
    result = check(n=N)
    print(result)


if __name__ == '__main__':
    main()

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())

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

sum  = int((1 + N)*N/2)

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())
print(sum([i+1 for i in range(n)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

#  1 2 3
#  3 2 1
#  4 4 4 = 12

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

Submission status: Accepted

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

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('{:.0f}'.format((1+N)*N/2))

Submission status: Accepted

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

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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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((1 + N) * N // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(total)

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())
print(sum([a for a in range(1,n+1)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
result = 0

for i in range(int(n)):
  result += i+1

print(result)

Submission status: Accepted

Solution code:
import sys
N = input()
sum=0

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

print(sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    t = 0
    for i in range(n):
        t += (i + 1)
    print(t)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
# coding:utf-8

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

print(candy)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ninnzuu = int(input()) + 1
goukei = 0

for i in range(ninnzuu):
    goukei = goukei + i
print(str(goukei))

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    n = int(input())
    print(sum(range(1, n + 1)))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
v=0
for k in range(int(input())):
    i = k + 1 
    v += i
print(v)

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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
s = 0
for i in range(n):
  s += i + 1
print(s)

Submission status: Accepted

Solution code:
#幼稚園の子供の数N
N = input()

list_num = list(range(1,int(N)+1))

sum_list = sum(list_num)

print(sum_list)

Submission status: Accepted

Solution code:
from sys import stdin

count = 1
n = int(stdin.readline().rstrip())
s = 0

for i in range(n):
    s += count
    count += 1

print(s)

Submission status: Accepted

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

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:
n = int(input())
k = 0

for i in range(n + 1):
  k +=  i
  i + 1

print(k)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    print(n*(n+1)//2)
resolve()

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:
child = int(input())
sum = 0
for i in range(child+1):
  sum += i
print(sum)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    N = INT()
    print(int(N*(N+1)/2))
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
ans=n*(n+1)//2
print(ans)

Submission status: Accepted

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

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

print(sigma)

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())
candies = [n for n in range(1, N+1)]
print(sum(candies))

Submission status: Accepted

Solution code:
# -*- cording: utf-8 -*-
n = int(input())
candy = 0
for i in range(n):
  candy += i + 1
print(candy)

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
N=int(input())

print(int(0.5*N*(N+1)))

Submission status: Accepted

Solution code:
N = int(input())
a = [i for i in range(N+1)]
ans = sum(a)
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:
import sys
input = sys.stdin.readline

def main():
    N = int(input())

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


if __name__ == "__main__":
    main()

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:
a = int(input())
b = a * (a + 1) / 2
print(int(b))

Submission status: Accepted

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

print(result)

Submission status: Accepted

Solution code:
N  = int(input())

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

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())
sum=0
for i in range(n):
  sum+=(i+1)
print(sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
a=N//2
b=N%2
if b==0:
	x=(N+1)*a
else:
	x=(N+1)*a+a+1
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input());print(n*-~n//2)

Submission status: Accepted

Solution code:
N = int(input())

res = 0

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
count = 0
if 1 <= n <= 100:
    for i in range(1,n+1):
        count += i
    print(count)
else:
    print('hoge!')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
kosu = [0]*100
kosu[0] = 1
for i in range(99):
    kosu[i+1] = kosu[i] + i+2
print(kosu[int(input())-1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  n = int(raw_input())
  result = 0
  for x in xrange(n):
    result += x + 1
  print result

main()

Submission status: Accepted

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

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((n * (n+1)) / 2))

Submission status: Accepted

Solution code:
n = int(input())

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

print(total)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

print(int((n+1)*n/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())
print((1+n)*n//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    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())

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

print(ans)

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())
num_list = []

for i in range(N):
  num_list.append(i + 1)
#print(num_list)
print(sum(num_list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def gokei(x):
  if x<=0:
    return 0
  p = x + gokei(x-1)
  return p

n = int(input())
print(gokei(n))

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:
i = int(input())
print(int(i*(i+1)/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum(list(range(1, int(input()) + 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:
count = 0
for i in range(int(input())):
  count += i+1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

m=n-(n-1)
print(int((n/2)*(n+m)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input()) # N = 3
b = N +1 # b =4
total = 0
for i in range(b): # i =0, 1, 2, 3
	total += i
print(total)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = 0
for i in range(1,int(input())+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:
n = int(input())
ans = 0
for i in range(n):
    ans += i + 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
def A_ChildrenandCandies():
    N = int(input())
    print(sum(range(N+1)))
    
if __name__ == "__main__":
    A_ChildrenandCandies()

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())
answer = 0
for i in range(1, n + 1):
  answer += i

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = sum([i for i in range(1, n + 1)])
print(ans)

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())
print(int(N * (N + 1 ) / 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = int(raw_input())

a = np.linspace(1, N, N)
print int(np.sum(a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
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())
temp=(1+N)*(N//2)
if N%2==0:
  print(temp)
else:
  print(temp+N//2+1)

Submission status: Accepted

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

Submission status: Accepted

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

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()
x = int(n)
y = 0.5*x*(x+1)
print(int(y))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
N = int(input())

# solve & output
print(int(N * (N + 1) / 2))

Submission status: Accepted

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

Submission status: Accepted

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

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())
cnt = 0
for i in range(1, n+1):
    cnt += i
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

b = 0

while a != 0:
  b = b + a
  a = a - 1

print(b)

Submission status: Accepted

Solution code:
N = int(input())
sum = 0
for i in range(0,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:
n = int(input())
r = 0
for i in range(n+1):
  r += i
print(r)

Submission status: Accepted

Solution code:
n = int(input())

a = range(0, n+1)
b = sum(a)
print(b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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((n+1)*n*0.5) )

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
cnt = int(input())
print(sum(list(map(lambda x: x, range(1, cnt + 1)))))

Submission status: Accepted

Solution code:
N = int(input())

ans = 0

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

Submission status: Accepted

Solution code:
# ABC043 A
child_num = int(input())

candy_num = child_num * (child_num+1) / 2

print(int(candy_num))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(res)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(N: int):
    ret = (1 + N) * N // 2
    print(ret)
    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))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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())

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

Submission status: Accepted

Solution code:

import sys


def main():
    num = int(input())
    ans = 0
    for i in range(num):
        ans += i + 1

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(ans)

Submission status: Accepted

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