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: Wrong Answer

Solution code:
s = input()
data =[]
for i in range(len(s)):
  data.append(s[i])
array = []
for i in range(len(data)):
  if data[i] == "0":
    array.append("0")
  elif data[i] == "1":
    array.append("1")
  elif (len(array) != 0 and data[i]== "B"):
    array.pop(-1)
  else:
    pass

mojiretu = ''

for x in array:
    mojiretu += x

print(mojiretu)

Submission status: Wrong Answer

Solution code:
s = input()
data =[]
for i in range(len(s)):
  data.append(s[i])
array = []
for i in range(1, len(data)):
  if data[i] == "0":
    array.append("0")
  elif data[i] == "1":
    array.append("1")
  elif (len(array) != 0 and data[i]== "B"):
    array.pop(-1)
  else:
    pass

mojiretu = ''

for x in array:
    mojiretu += x

print(mojiretu)

Submission status: Wrong Answer

Solution code:
n = int(input())
print("{}".format(n*(n+1)/2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()

sum = 0
for i in range(int(a)):
    sum += i + 1

print(a)

Submission status: Wrong Answer

Solution code:
a = input()

sum = 0
for i in range(int(a)):
    sum += i

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
c=0
while a==0:
  c+=a
  a-=1
print(int(c))

Submission status: Wrong Answer

Solution code:
a=int(input())
b=a
while b==0:
  a+=a-1
  b-=1
print(int(a))

Submission status: Wrong Answer

Solution code:
a=int(input())
b=a
while b==0:
  a+=a-1
  b-=1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
slist = list(s)

rst = []

for i in range(0,len(s)):
	if slist[i] == '0':
		rst[len(rst):] = slist[i]
	elif slist[i] == '1':
		rst[len(rst):] = slist[i]
	elif slist[i]== 'B':
		if len(rst) == 0:
			rst == []
		else:
			rst[len(rst)-1:len(rst)] = ''
		
	

jd = "".join(rst)
print(jd)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
print (n*(n-1)/2)

Submission status: Wrong Answer

Solution code:
s = input()
z = ""

for i in range(len(s)):
    if s[i] == "0":
      z += "0"
    elif s[i] == "1":
        z+= "1"
    elif s[i] == "B":
        z = z[:-1]

print (z)

Submission status: Wrong Answer

Solution code:
import math
n = input()
print(math.factorial(int(n)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans

Submission status: Wrong Answer

Solution code:
def fact(n):
    if n <= 0:
        return 1
    return n * fact(n - 1)
n = int(input())
print(fact(n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
tc = [ chr(i)*2 for i in range(ord('a'), ord('z')+1) ]  + [ chr(i)+chr(j)+chr(i) for i in range(ord('a'), ord('z')+1) for j in range(ord('a'), ord('z')+1)]
if len(s) == 2:
  if s[0] == s[1]:
    print(1, 2)
  else:
    print(-1, -1)
else:
  for i in tc:
    if i in s:
      t = i
      break
    else:
      t = 0
  if t == 0:
    print(-1, -1)
  else:
    for i in range(len(s)-len(t)+1):
      if s[i:i+len(t)] == t:
        if len(t) == 2:
          if i+len(t)+1 > len(s):
            print(i, i+len(t))
          
          else:
            print(i+1, i+len(t)+1)
        elif len(t) == 3:
          print(i+1, i+len(t))

Submission status: Wrong Answer

Solution code:
# coding: utf-8

stack = []
for i in input():
    if i=='0':
        stack.append(0)
    elif i=='1':
        stack.append(1)
    else:
        if(len(stack)>0):
            stack.pop()

stack.reverse()

while(len(stack)>0):
    print(stack.pop(), end='')
print()

Submission status: Wrong Answer

Solution code:
S = list(input())
a = []
for i in range(len(S)):
  if(S[i] == "0" ):
    a.append("0")
  elif(S[i] == "1"):
    a.append("1")
  else:
    if(len(a) != 0):
      del a[-1]

kotae = ""

for i in range(len(a)):
  kotae += a[i]

print(kotae)

Submission status: Wrong Answer

Solution code:
# coding: UTF8
# python3

# input = "10"
input = input() 

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = raw_input()
for i in xrange(len(s) - 2):
    if s[i] == s[i+1] or s[i] == s[i+2] or s[i+1] == s[i+2]:
        print str(i + 1) + ' ' + str(i + 3)
        break
else:
    print '-1 -1'

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()

print n * (n - 1) / 2

Submission status: Wrong Answer

Solution code:
S = input()
R = list()
for x in S:
	print(x)
	if x == "B" and len(R) != 0:
		R.pop()
	else:
		R.append(x)
print("".join(R))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python

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

Submission status: Wrong Answer

Solution code:
charseq = raw_input()
start = -1
end = -1

for i in range(len(charseq)):
    for j in xrange(i+2, len(charseq)+1):
        part = charseq[i:j]
        chars = list(part)
        for char in chars:
            if chars.count(char) > (j-i)/2:
                start = i+1 
                end = j 
                break
        if not start == -1: 
            break
    
print start, end

Submission status: Wrong Answer

Solution code:
keyinputs = raw_input()
 
output = ''
for i in xrange(len(keyinputs)):
    keyinput = keyinputs[i]
    if keyinput == '1' or keyinput == '0':
        output+= keyinput
    elif keyinput == 'B':
        if not output == '': 
            output = output[:-1]
print output

Submission status: Wrong Answer

Solution code:
keyinputs = raw_input()

output = ''
for i in xrange(len(keyinputs)):
    keyinput = keyinputs[i]
    if keyinput == '1' or keyinput == '0':
        output+= keyinput
    elif keyinput == 'B':
        if not output == '': 
            output = output[:-1]
print output

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

ans = ""
for i in range(0,len(s)):
    if s[i] == 'B':
        if(len(ans) < 0):
            pass
        else:
            ans = ans[:-1]
    else:
        ans += s[i]
print(ans)

Submission status: Wrong Answer

Solution code:
s = raw_input()
mystr = ""
for x in s:
    if (x=='B'):
        mystr = mystr[0:len(mystr)-1]
    else: mystr += x
print mystr

Submission status: Wrong Answer

Solution code:
s = list(input())
ans = ""
for i in s:
    if i != "B":
        ans += i
    elif len(ans) < 1:
        continue
    else:
        ans += "\b"
print(ans)

Submission status: Wrong Answer

Solution code:
A = []
S = input()
S=list(str(S))
for n in S:
 if n == "b":
  try:
   A.pop()
  except IndexError:
   pass
 else:
  A.append(n)
print("".join(A))

Submission status: Wrong Answer

Solution code:
from collections import Counter

s = list(raw_input())

begin = -1
end = -1
n = 3
while n <= len(s):
    i = 0
    while i <= len(s)-n:
        c = Counter(s[i:i+n])
        if len(c) > 1:
            count = c.most_common(1)[0][1]
        else:
            count = n;
        if  count * 2 > n:
            begin = i+1
            end = i+n
            print begin, end
            quit()
        i += 1
    n += 1
print -1, -1

Submission status: Wrong Answer

Solution code:
a = list(input())
ans = []
for i in a:
    if i == "0" or i == "1":
        ans.append(i)
    
    else :
        ans.remove(ans[-1])

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
def fact(n):
   if n == 0: return 0
   return n + fact(n-1)

def main():
    a = int(raw_input())
    print a
    print fact(a)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

x = int(input())

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

Submission status: Wrong Answer

Solution code:
a=int(input())

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

Submission status: Wrong Answer

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

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

L = list(range(N+1))
print(sum(L))

Submission status: Accepted

Solution code:
n = int(input())

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

    print(result)


if __name__ == "__main__":
    iroha()

Submission status: Accepted

Solution code:
def main():
    n = int(input())

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

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 i in range(1,N + 1):
    a =i + a
print(a)

Submission status: Accepted

Solution code:
n=int(input())
memo=[0]*110
memo[1]=1
for i in range(2,105):
    memo[i]=memo[i-1]+i
print(memo[n])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

c = 0
while n!=0:
    c += n
    n -= 1
print(c)

Submission status: Accepted

Solution code:
"""
ABC043 A キャンディーとN人の子供イージー
https://atcoder.jp/contests/abc043/tasks/abc043_a
"""

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

Submission status: Accepted

Solution code:
import math
from datetime import date

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Nの入力受付
N = int(input())
# 1～Nの合計を計算
SUM = 0
for i in range(N):
    SUM = SUM + i + 1
print(SUM)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(cd)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

print(m)

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:
#!/usr/bin/env python3
import sys


def solve(N: int):
    return sum(range(1, N+1))

# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
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
    print(solve(N))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    #test()
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
number = int(input())

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
print(N*(N+1)//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:
from sys import stdin, stdout
from time import perf_counter

import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7





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

Submission status: Accepted

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

Submission status: Accepted

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

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:
print(sum(range(int(input())+1)))

Submission status: Accepted

Solution code:
def main():
    n = int(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
ans = 0
for i in range(1, N+1):
    ans += i
print(ans)

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

print(ans)

Submission status: Accepted

Solution code:
n = int(input())


def factorial(i: int):
    if i == 1:
        return 1
    else:
        return i + factorial(i - 1)


print(factorial(n))

Submission status: Accepted

Solution code:
N=int(input())

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

print(x)

Submission status: Accepted

Solution code:
import sys
import math

#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

N = ini()
print(int((N*(N+1))/2))
'''
sum = 0
for i in range(N):
    sum += (i+1)
print(sum)
'''

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
def input(): return sys.stdin.readline().strip()

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

N = int(input())

if N % 2 == 1:
    print(N * (N+1)//2)
else:
    print((N+1) * N//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = 0

x = int(input())
y = x+1
for i in range(y):
    a = a+i
 

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N = int(readline())
    print(N * (N + 1) // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(sums)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# キャンディーとN人の子供イージー

N = int(input())

answer = N + N * (N - 1) // 2

if 1 <= N <= 100:
    print(answer)
elif N <= 0 or 100 < N:
    print('Out of range')

Submission status: Accepted

Solution code:
# キャンディーとN人の子供イージー

N = int(input())

answer = N + N * (N - 1) // 2

print(answer)

Submission status: Accepted

Solution code:
import math
N = int(input())

sum = math.floor((N * (1 + N))/2)

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N人の子ども
# 1人目には1個, 2人目には2個...N人目にはN個
# 必要なキャンディーの個数の合計を出力

# 入力された値を数値に変換
N = int(input())

# 1〜Nまでの範囲の整数の和
print(N * (N+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())

print(sum(range(1, N + 1)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = n*(n+1)/2
print(round(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:
sum = 0
for i in range(1,int(input()) +1):
  sum += i
  
print(sum)

Submission status: Accepted

Solution code:
input_num = int(input())

# 取得した Nから必要なキャンディーの個数を算出し出力する
i = 1
result = 0;

while i <= input_num:
    result = result + i
    i = i + 1

print(result)

Submission status: Accepted

Solution code:
# 競プロ幼稚園にはN人の子供がいます。えび先生は、子供たちを一列に並べ、一人目にはキャンディーを1個,二人目には2個,...,N人目にはN個あげるこ
# とにしました。必要なキャンディーの個数の合計は何個でしょう?

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(answer)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
child = int(input())

candy = 0

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

print(candy)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#043A

#1.入力をちゃんと受け取ること
x=input()
i=int(x)
sum=0
#2.結果を出力する
while i>0:
    sum=sum+i
    i=i-1
if i==0 :
    print(sum)

Submission status: Accepted

Solution code:
N = int(input())

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

print(total)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# AキャンディーとNにんの子供イージー

# 競プロ幼稚園にはN人の子供がいます。えび先生は、子供たちを一列に並べ、一人目にはキャンディーを1個、二人目には2個,...,N人めにはN個あげることにしました。
# 必要なキャンディーの個数の合計は何個でしょう？
# 1 <= N <= 100

# Nは子供の人数
N = int(input())
# print(N)

# answerは合計個数
answer = ((N + 1) * N // 2)

print(answer)

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:
# 043A

# N人(数値）：標準入力
N = int(input())

# 任意の範囲の連番 → range(start,stop)
# すべての合計 → sum()
print(sum(range(1,N + 1)))

Submission status: Accepted

Solution code:
a=int(input())
s=0

while a>0:
  s+=a
  a-=1
  
print(s)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

Solution code:
# 等差数列の和　Sn=n(a+1)/2

N = int(input())
# 定義
# 1 <= N <= 100

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

print(total)

Submission status: Accepted

Solution code:
N = int(input())

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

print(x)

Submission status: Accepted

Solution code:
# 入力
N=int(input())
1<=int(N)<=100
# 数え上げの計算
print(N*(N+1)//2)

Submission status: Accepted

Solution code:
N = int(input())

# 1個ずつ増えるキャンディー
# 必要なキャンディーの個数の合計を出力する。
x = N * (N + 1) // 2

print(x)

Submission status: Accepted

Solution code:
N = int(input())

i = 1
SUM = 0

while i <= N:
    SUM += i
    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())

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

# N人目にN個のキャンディーをあげる際に必要なキャンディーの合計数の式
# 等差級数の和 をxとする
x = ( N * ( N + 1 )) // 2
print(x)

Submission status: Accepted

Solution code:
N = input()
s = 0
i = 1
while i <= int(N):
	s = s + i
	i = i + 1
print(s)

Submission status: Accepted

Solution code:




#他人のコピー
n=input()
candy = (1 / 2) * int(n) * (int(n) + 1)
print(int(candy))
#他人のコピー

Submission status: Accepted

Solution code:
N = int(input())

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

print(sum_num)

Submission status: Accepted

Solution code:
n = int(input())

ame = 0

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

Submission status: Accepted

Solution code:
N =int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

t = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
number = int(input())

candy = 0

for i in range(number):
    candy_add = i + 1
    candy = candy + candy_add

print(candy)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int( input() )

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

print(candy)

Submission status: Accepted

Solution code:
n = int(input())

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#043
# 1 <= N <= 100

#入力
N = int(input())

#処理
x = N * (N + 1) // 2

#出力
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# A - キャンディーとN人の子供イージー
# https://atcoder.jp/contests/abc043/tasks/abc043_a

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

print(sum)

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

Solution code:
# 入力
N = int(input())

# 処理
x = N * (N + 1) // 2

# 出力
print(x)

Submission status: Accepted

Solution code:
# 入力
N = int(input())

# 処理
answer = N * (N + 1) // 2

# 出力
print(answer)

Submission status: Accepted

Solution code:
N = int(input())

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

print(answer)

Submission status: Accepted

Solution code:
n = int(input())

x=0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N = int(input())

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

Submission status: Accepted

Solution code:
#　N　=　子供の数
# answer = 飴の数


N = int ( input () )

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

print (answer)

Submission status: Accepted

Solution code:
# 入力
n = int(input())
# result初期化
result = 0
# １からNまで繰り返し
for i in range(1,n+1):
    # 等差数列
    count = i
    result = result + count
# 結果を表示
print(result)

Submission status: Accepted

Solution code:
# 必要なキャンディーの個数の合計を出力せよ
# 1からNまでの和はN/2(N+1)で表される

N = int(input())

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

Submission status: Accepted

Solution code:
# 043A
# N人の時のキャンディーの合計数
# 入力値 子供の人数

# 入力
n = int(input())

# 処理
answer = (n + 1) * n // 2

print(answer)

Submission status: Accepted

Solution code:
# 043_a
N = int(input())
if 1 <= N & N <= 100:
    result = 0
    for i in range(N):
        count = N - i
        result += count
        if count == 1:
            print(result)

Submission status: Accepted

Solution code:
# A - キャンディーとN人の子供イージー

# 一人目にはキャンディーを一個、二人目には二個、N人目にはN個あげていくと
# 必要なキャンディーは合計何個か？

child = int(input())

answer = int(child * (child + 1) / 2)

print(answer)

Submission status: Accepted

Solution code:
# 43a
# 競プロ幼稚園には N 人の子供がいます。えび先生は、
# 子供たちを一列に並べ、一人目にはキャンディーを
# 1個,二人目には2個,..., N 人目にはN個あげることにしました。
# 必要なキャンディーの個数の合計は何個でしょう?

# Nに入力された数字を格納する
N = int(input())

# answer(計算結果を格納するところ)を定義
answer = 0


# while文で 1以上100以下の数字で値を繰り返し処理
# Nの値をanswerに＋するたびにNの値から-1するようにする
while 1 <= N <= 100:
    answer = answer + N
    N = N - 1

print(answer)

Submission status: Accepted

Solution code:
#   AtCoder abc043 a

#   入力
n = int(input())

#   処理
candy = (1 / 2) * n * (n + 1)

#   出力
print(int(candy))

Submission status: Accepted

Solution code:
#   AtCoder abc055 a

#   入力
n = int(input())

#   処理
candy = (1 / 2) * n * (n + 1)

#   出力
print(int(candy))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#子ども　N人
# 1人目に1個、2人目に2個・・・　N人めにはN個
#必要なキャンディーの合計を求める

#N=2の時　1+2=3
#N=3の時　1+2+3=6
#N=4の時　1+2+3+4=10

#N=10の時　55

N=int(input())
#個数に対してのキャンディーの合計を示す
sum_candy=(N * (N+1) / 2)
print(int(sum_candy))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

sum_candy = n*(n+1)/2

print(int(sum_candy))

Submission status: Accepted

Solution code:
# 子供の人数を取得
N = int(input())

# 子供の人数分のキャンディの個数を計算
Childrencnt = 1
Candysum = 0
for Childrencnt in range(1, N+1):
    Candysum = Candysum + Childrencnt

# キャンディの合計個数を出力
else:
    print(Candysum)

Submission status: Accepted

Solution code:
N = int(input())

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

print(candy)

Submission status: Accepted

Solution code:
N = int(input())

# 1+2+3+4+...+(N-2)+(N-1)+N
# N+(N-1)+(N-2)+...+4+3+2+1
# 上と下を足し算して、２で割る

a = N+1
b = N

print(int( a * b * 0.5 ))

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# 競プロ幼稚園には N人の子供がいます。
# えび先生は、子供たちを一列に並べ、一人目にはキャンディーを1個,
# 二人目には 2個,..., N人目には N個あげることにしました。
# 必要なキャンディーの個数の合計は何個でしょう?

# 標準入力から子供の人数（N）を取得する
input_num = int(input())

# 取得した Nから必要なキャンディーの個数を算出し出力する
i = 1
result = 0;

while i <= input_num:
    result = result + i
    i = i + 1

print(result)

Submission status: Accepted

Solution code:
N = int(input())

result = 0;
for n in range(N + 1):
    result += n
print(result)

Submission status: Accepted

Solution code:
N = int(input())

if N % 2 == 0:
    result = (N / 2) * (1 + N)
else:
    result = ((N - 1) / 2) * N + N

print(int(result))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())  

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

Submission status: Accepted

Solution code:
# 式：y = N*(N+1)/2

N = int(input()) # 人数Nを代入

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

print(candy)

Submission status: Accepted

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