input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
sum=0
for i in range(1,n+1):
if(i%15!=0 and i%3!=0 and i%5!=0 ):
sum=sum+i
print(sum) | n = int(eval(input()))
ans = 0
for i in range(1, n+1):
if i%3 == 0 or i%5==0:
pass
else:
ans += i
print(ans) | p02712 |
import sys
input = sys.stdin.readline # 改行コード「\n」を呼んでしまうため、文字数など、注意！！
n = int(input().replace("\n",""))
anslist = []
for i in range(1, n+1):
if (i % 3 == 0) and (i % 5 == 0):
continue
# print('FizzBuzz', end=' ')
elif i % 3 == 0:
continue
# print('Fizz', end=' ')... | import sys
input = sys.stdin.readline # 改行コード「\n」を呼んでしまうため、文字数など、注意！！
n = int(input().replace("\n",""))
anslist = []
for i in range(1, n+1):
# print(i)
if i % 15 == 0:
continue
# print('FizzBuzz', end=' ')
elif i % 3 == 0:
continue
# print('Fizz', end=' ')
... | p02712 |
N = int(eval(input()))
a = 0
for i in range(1, N + 1):
if i % 5 != 0 and i % 3 != 0:
a += i
print(a)
| N = int(eval(input()))
print((sum([i for i in range(1, N+1) if i%5!=0 and i%3!=0]))) | p02712 |
N = int(eval(input()))
print((sum([i for i in range(1, N+1) if i%5!=0 and i%3!=0]))) | k = int(eval(input()))
a = (1 + k) * k // 2
three = (3+3*(k//3)) * (k // 3) // 2
five = (5+5*(k//5)) * (k // 5) // 2
fifteen = (15+15*(k//15)) * (k // 15) // 2
print((a-three-five+fifteen)) | p02712 |
from math import floor
N = int(eval(input()))
S = int((N * (N+1)) / 2)
fizz = floor(N/3)
buzz = floor(N/5)
fizzbuzz = floor(N/15)
print((S - int(3 * fizz * (fizz+1)/2) -
int(5*buzz*(buzz+1) /2) +
int(15 * fizzbuzz * (fizzbuzz+1)/2))) | from math import floor
def sum(x):
return int(x *(x+1)/2)
N = int(eval(input()))
S = sum(N)
fizz = floor(N/3)
buzz = floor(N/5)
fizzbuzz = floor(N/15)
print((S - 3 * sum(fizz) - 5*sum(buzz) + 15 * sum(fizzbuzz))) | p02712 |
def main():
n = int(eval(input()))
s = 0
for i in range(1, n+1):
if i % 3 == 0 and i % 5 == 0:
pass
elif i%3 == 0:
pass
elif i%5 == 0:
pass
else:
s += i
print(s)
if __name__ == "__main__":
main() | def main():
n = int(eval(input()))
s = 0
for i in range(1, n+1):
if not (i % 3 == 0 or i % 5 == 0):
s += i
print(s)
if __name__ == "__main__":
main()
| p02712 |
N=int(eval(input()))
ans=0
for i in range(1,N+1):
if not (i%3==0 or i%5==0):
ans+=i
print(ans) | N=int(eval(input()))
Fizz=list(range(3,N+1,3))
Buzz=list(range(5,N+1,5))
FizzBuzz=list(range(15,N+1,15))
ans=sum(range(1,N+1))-sum(Fizz)-sum(Buzz)+sum(FizzBuzz)
print(ans)
| p02712 |
n = int(eval(input()))
res = []
for i in range(n + 1):
if i % 3 != 0 and i % 5 != 0:
res.append(i)
print((sum(res))) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
res = 0
for i in range(1, n + 1):
if i % 3 == 0 or i % 5 == 0:
continue
else:
res += i
print(res)
if __name__ == '__ma... | p02712 |
import sys
def in_ctrl():
_input = [_.rstrip() for _ in sys.stdin.readlines()]
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
N = int(_input[0])
# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
return N
def out_ctrl(s):
print(s)
if __name__ == "__main__":
N ... | from sys import stdin
def __sum(n):
return n*(n+1)//2
if __name__ == "__main__":
_in = [_.rstrip() for _ in stdin.readlines()]
N = int(_in[0]) # type:int
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
cnt = __sum(N)-3*__sum(N//3)-5*__sum(N//5)+15*__sum(N//15)
# ^^^^^^^^^^^... | p02712 |
count=0
N=int(eval(input()))
for i in range(N):
if (i+1)%3==0 and (i+1)%5==0:
continue
elif (i+1)%3==0:
continue
elif (i+1)%5==0:
continue
else:
count+=(i+1)
print(count) | N=int(eval(input()))
ans=0
for i in range(1,N+1):
if i%3==0 or i%5==0:continue
else:
ans+=i
print(ans) | p02712 |
n = int(eval(input()))
us = set(i for i in range(1, n + 1))
m3 = set(i for i in range(3, n + 1, 3))
m5 = set(i for i in range(5, n + 1, 5))
print((sum(list(us - m3 - m5)))) | n = int(eval(input()))
sum = 0
for i in range(1, n + 1):
if i % 3 != 0 and i % 5 != 0:
sum += i
print(sum) | p02712 |
N = int(eval(input()))
sum = 0
for i in range(N):
if (i + 1) % 3 != 0 and (i + 1) % 5 != 0:
sum += (i + 1)
print(sum) | N = int(eval(input()))
def isnot_fizzbuzz(number: int) -> bool:
if (number) % 3 != 0 and (number) % 5 != 0:
return True
return False
def main():
sum = 0
for number in range(1, N + 1):
if isnot_fizzbuzz(number) == True:
sum += number
print(sum)
if __name__... | p02712 |
N = int(eval(input()))
ans = 0
for i in range(1,N+1):
if i%3 == 0 or i%5 == 0:
ans += 0
else:
ans += i
print(ans) | N = int(eval(input()))
ans = 0
for i in range(1,N+1):
if i%3 == 0 or i%5 == 0:
continue
else:
ans += i
print(ans) | p02712 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): retur... | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | p02712 |
n = int(eval(input()))
fizzbuzz = 0
ans = 0
for i in range(1, n+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
| n = int(eval(input()))
n15 = n // 15
n5 = n // 5
n3 = n // 3
ans = n*(n+1)//2 - 5*n5*(n5+1)//2 - 3*n3*(n3+1)//2 + 15*n15*(n15+1)//2
print(ans)
| p02712 |
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
if i % 15 != 0 and i % 3 != 0 and i % 5 != 0:
ans = ans + i
print(ans)
| from functools import lru_cache
N = int(eval(input()))
@lru_cache(maxsize=1000)
def main(K):
ans = 0
for i in range(1, N+1):
if i % 15 != 0 and i % 3 != 0 and i % 5 != 0:
ans = ans + i
return(ans)
print((main(N))) | p02712 |
N = int(eval(input()))
list = []
for i in range(1,N+1):
list.append(i)
for i in range(1,(N+3)//3):
list[3*i-1] = 0
for i in range(1,(N+5)//5):
list[5*i-1] = 0
print((sum(list))) | n = int(eval(input()))
ans = 0
for i in range(n+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | p02712 |
n = int(eval(input()))
ans = 0
for i in range(n+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | N = int(eval(input()))
ans = 0
for i in range(N+1):
if i%3!=0 and i%5!=0 :
ans += i
print(ans) | p02712 |
N = int(eval(input()))
FizzBuzz = []
Fizz = []
Buzz = []
ano = []
plus = 0
for i in range(N+1):
if i % 3 == 0 and i % 5 == 0:
FizzBuzz.append(i)
elif i % 3 == 0:
Fizz.append(i)
elif i % 5 == 0:
Buzz.append(i)
else:
ano.append(i)
for a in ano:
plus += a... | N = int(eval(input()))
none_num = [i for i in range(1, N+1) if i%3 != 0 and i%5 != 0]
none = sum(none_num)
print(none) | p02712 |
N = int(eval(input()))
none_num = [i for i in range(1, N+1) if i%3 != 0 and i%5 != 0]
none = sum(none_num)
print(none) | K = int(eval(input()))
x = (K+1) * K//2
num_devisible_three = (3+3*(K//3))*(K//3)//2
num_devisible_five = (5+5*(K//5))*(K//5)//2
num_devisible_fifteen = (15+15*(K//15))*(K//15)//2
print((x-num_devisible_three-num_devisible_five+num_devisible_fifteen)) | p02712 |
N = int(eval(input()))
total = 0
for i in range(1, N + 1):
if i % 3 != 0 and i % 5 != 0:
total += i
print(total) | print((sum(i for i in range(1, int(eval(input())) + 1) if i % 3 != 0 and i % 5 != 0))) | p02712 |
N = int(eval(input()))
s = 0
i = 1
while i <= N:
if i % 3 != 0 and i % 5 != 0:
s += i
i += 1
print(s) | N = int(eval(input()))
l = [i for i in range(1, N + 1) if i % 3 != 0 and i % 5 != 0]
s = sum(l)
print(s) | p02712 |
N = int(eval(input()))
total = 0
for i in range(1, N+1):
if i % 3 != 0 and i % 5 != 0:
total += i
print(total) | print((sum(i for i in range(int(eval(input()))+1) if i%3!=0 and i%5!=0))) | p02712 |
print((sum(i for i in range(int(eval(input()))+1) if i%3!=0 and i%5!=0))) | print((sum(i for i in range(int(eval(input()))+1) if i%3 and i%5))) | p02712 |
N = int(eval(input()))
total = 0
for i in range(1, N+1):
if i % 3 != 0 and i % 5 != 0:
total = total+i
print(total) | N = int(eval(input()))
total = 0
for i in range(1, N+1):
if (i % 3) != 0 and (i % 5) != 0:
total = total+i
print(total) | p02712 |
N = int(eval(input()))
ans = 0
for i in range(1,N+1):
if i%3 and i%5:
ans += i
print(ans) | N = int(eval(input()))
N3 = N//3
N5 = N//5
N15 = N//15
ans = N*(N+1)/2 - 3*N3*(N3+1)/2 -5*N5*(N5+1)/2 + 15*N15*(N15+1)/2
print((int(ans))) | p02712 |
a=0
for i in range(int(eval(input()))+1):
if i%3!=0 and i%5!=0:
a+=i
print(a) | n=int(eval(input()))
a=[0,1,3,3,7,7,7,14,22,22,22,33,33,46,60]
b=[0,1,1,0,1,0,0,1,1,0,0,1,0,1,1]
print((60*(n//15)+120*(n//15)*(n//15-1)//2+sum(b[:n%15+1])*(15*(n//15))+a[n%15])) | p02712 |
n = int(eval(input())) #スペース抜きの複数行,１文字ずつ
A = []
for i in range(1, n + 1):
if i % 15 == 0:
A.append(0)
elif i % 3 == 0:
A.append(0)
elif i % 5 == 0:
A.append(0)
else:
A.append(i)
print((sum(A))) | N = int(eval(input())) #スペース抜きの複数行,１文字ずつ
A = []
for i in range(1,N+1):
if i % 3 == 0:
A.append(0)
elif i % 5 == 0:
A.append(0)
else:
A.append(i)
print((sum(A))) | p02712 |
N = int(eval(input())) #スペース抜きの複数行,１文字ずつ
A = []
for i in range(1,N+1):
if i % 3 == 0:
A.append(0)
elif i % 5 == 0:
A.append(0)
else:
A.append(i)
print((sum(A))) | N = int(eval(input()))
sum = 0
for i in range(1, N + 1):
if i % 3 == 0:
continue
elif i % 5 == 0:
continue
else:
sum += i
print(sum) | p02712 |
n=int(eval(input()))
ans=0
for i in range(1,n+1):
if i%3 * i%5 != 0:ans+=i
print(ans) | n = int(eval(input()))
ans = 0
for i in range(n+1):
if i%3 != 0 and i%5 != 0:
ans = ans + i
print(ans) | p02712 |
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]... | import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]... | p02712 |
n = int(eval(input()))
sum = 0
for i in range(1,n+1):
if not(i%15==0 or i%5==0 or i%3==0):
sum += i
print(sum) | n = int(eval(input()))
print((sum(i for i in range(1,n+1) if i%5!=0 and i%3!=0 if i%15 != 0))) | p02712 |
N = int(eval(input()))
ans = 0
for i in range(1,N+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | N = int(eval(input()))
total = int(1/2 * N * (N+1))
wa3 = (N//3 * (N//3 + 1)) // 2 * 3
wa5 = (N//5 * (N//5 + 1)) // 2 * 5
wa15 = (N//15 * (N//15 + 1)) // 2 * 15
print((total - wa3 - wa5 + wa15)) | p02712 |
print((sum(set(i for i in range(1,int(eval(input()))+1,1) if not(i%3==0 or i%5==0))))) | print((sum((i for i in range(int(eval(input()))+1) if i%3 and i%5)))) | p02712 |
#-*- coding: utf-8 -*-
n = int(eval(input()))
sum = 0
for i in range(1,n + 1):
if i % 3 != 0 and i % 5 != 0 and i % 15 != 0:
sum += i
print(sum) | #-*- coding: utf-8 -*-
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | p02712 |
N = int(eval(input()))
count = 0
for i in range(1 ,N+1):
if i % 3 != 0 and i % 5 != 0:
count += i
print(count)
| N = int(eval(input()))
count = int(0)
for i in range(1 ,N+1):
if i % 3 != 0 and i % 5 != 0:
count += i
print(count)
| p02712 |
N=int(eval(input()))
sum=0
for i in range(1,N+1):
if i%3==0 or i%5==0:
sum+=0
else:
sum+=i
print(sum) | N=int(eval(input()))
sum=0
for i in range(1,N+1):
if i%3!=0 and i%5!=0:
sum+=i
print(sum) | p02712 |
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
| N = int(eval(input()))
def sum(n):
return (n + 1) * n // 2
print((sum(N) - sum(N // 3) * 3 - sum(N // 5) * 5 + sum(N // 15) * 15))
| p02712 |
print((sum([i for i in range(1, int(eval(input()))+1) if i%3!=0 and i%5!=0]))) | n = int(eval(input()))
def s(n):
return n*(n+1)//2
print((s(n) - s(n//3)*3 - s(n//5)*5 + s(n//15)*15)) | p02712 |
n=int(eval(input()))
a=0
for i in range(n+1):
if i%3!=0 and i%5!=0:
a+=i
print(a)
| n=int(eval(input()))
c=0
for i in range(n+1):
if i%3==0 or i%5==0:
continue
else:
c+=i
print(c) | p02712 |
N = int(eval(input()))
l = [i for i in range(1, N + 1)]
s = []
for i in l:
if i % 3 != 0 and i % 5 != 0:
s.append(i)
print((sum(s)))
| N = int(eval(input()))
l = [i for i in range(1, N + 1)]
s = 0
for i in l:
if i % 3 != 0 and i % 5 != 0:
s += i
print(s) | p02712 |
N = int(eval(input()))
ans = 0
for i in range(N):
if (i + 1) % 3 != 0 and (i + 1) % 5 != 0:
ans += i + 1
print(ans) | N = int(eval(input()))
ans = int(N * (N + 1) / 2 - (N // 3) * (N // 3 + 1) / 2 * 3 - (N // 5) * (N // 5 + 1) / 2 * 5 + (N // 15) * (N // 15 + 1) / 2 * 15)
print(ans) | p02712 |
n=int(eval(input()))
ans=0
def fb(num):
if num%3==0 or num%5==0:
return False
else:
return True
for i in range(1,n+1):
if fb(i):
ans+=i
print(ans)
| n=int(eval(input()))
def func():
s=0
for i in range(1,n+1):
if not(i%3==0 or i%5==0):
s+=i
else:
continue
return s
print((func()))
| p02712 |
n = int(eval(input()))
ans = 0
for i in range(n+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | print((sum([i for i in range(int(eval(input()))+1) if i%3!=0 and i%5!=0]))) | p02712 |
N = int(eval(input()))
ans = 0
for i in range(N+1):
if i % 3 == 0 or i % 5 == 0:
pass
else:
ans += i
print(ans) | N=int(eval(input()))
ans=0
for i in range(N+1):
if i%3!=0 and i%5!=0:
ans+=i
print(ans) | p02712 |
n = int(eval(input()))
sum=0
for i in range(1,n+1):
if i%5 == 0 or i%3 == 0:
continue
sum += i
print(sum) | n = int(eval(input()))
count=0
for i in range(1,n+1):
if i%5 != 0 and i%3 != 0:
count += i
print(count) | p02712 |
n = int(eval(input()))
l = []
for i in range(n):
if (i+1)%3 != 0 and (i+1)%5 != 0:
l.append(i+1)
else:
l.append(0)
print((sum(l))) | n = int(eval(input()))
ans = 0
for i in range(n+1):
if i%3 == 0 or i%5 == 0:
ans += 0
else:
ans += i
print(ans) | p02712 |
N = int(eval(input()))
print((sum(n for n in range(1+N) if n%3!=0 and n%5!=0))) | print((sum(n for n in range(1+int(eval(input()))) if n%3 and n%5))) | p02712 |
N=int(eval(input()))
s=0
for i in range(1,N+1):
if i%15==0:
s=s
elif i%3==0:
s=s
elif i%5==0:
s=s
else:
s=s+i
print(s) | n = int(eval(input()))
answer = 0
for i in range(1, n + 1): # range内を出力(i)していく
if i % 3 != 0 and i % 5 != 0:
answer += i # iを足していったものがanswer
print(answer) # 実際に見えるように出力
| p02712 |
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
if i % 3 == 0 or i % 5 == 0:
continue
ans += i
print(ans)
| N = int(eval(input()))
#A = list(map(int, input().split()))
amount = (N+1) * N // 2
three = N // 3
three = (three + 1) * 3 * three // 2 if three > 0 else 0
five = N // 5
five = (five + 1) * 5 * five // 2 if five > 0 else 0
fifteen = N // 15
fifteen = (fifteen + 1) * 15 * fifteen // 2 if fifteen > 0 else 0
prin... | p02712 |
n = int(eval(input()))
cnt = 0
for i in range(1, n+1):
if i%3!=0 and i%5!=0:
cnt += i
print(cnt) | N = int(eval(input()))
ans = 0
for i in range(1, N+1):
if i%3!=0 and i%5!=0:
ans += i
print(ans) | p02712 |
def solve(n):
ans = 0
for i in range(1, n+1):
if (i % 3 == 0 and i % 5 == 0) or (i % 3 == 0) or (i % 5 == 0):
continue
else:
ans += i
print(ans)
if __name__ == "__main__":
n = int(eval(input()))
solve(n) | def solve(n):
arr = [i for i in range(1, n+1) if i % 3 != 0 and i % 5 != 0]
print((sum(arr)))
if __name__ == "__main__":
n = int(eval(input()))
solve(n) | p02712 |
N = int(eval(input()))
total = 0
for i in range(1, N+1):
if (i % 3) != 0 and (i % 5) != 0:
total = total+i
print(total) | N = int(eval(input()))
total = 0
for i in range(1,N+1):
if (i % 3) != 0 and (i % 5) != 0:
total += i
print(total) | p02712 |
N = int(eval(input()))
ans = 0
for i in range(1,N+1):
if i % 3 == 0 or i % 5 == 0:
ans += 0
else:
ans += i
print(ans)
| N = int(eval(input()))
ans = []
for i in range(N+1):
if i % 3 != 0 and i % 5 != 0:
ans.append(i)
print((sum(ans))) | p02712 |
N=int(eval(input()))
a=[]
z=0
for i in range(1,N+1):
if i%3==0:
z=0
elif i%5==0:
z=0
elif i%3==0 and i%5==0:
z=0
else:
a.append(i)
print((sum(a))) | N=int(eval(input()))
count=[]
for i in range(1,N+1):
if i%3!=0 and i%5!=0:
count.append(i)
print((sum(count))) | p02712 |
n = int(eval(input()))
a = [i for i in range(1, n+1) if i % 3 != 0 and i % 5 != 0]
print((sum(a)))
| # 別解法 o(1)
def gauss(n):
return n * (n+1) // 2
n = int(eval(input()))
ans = gauss(n) - gauss(n//3) * 3 - gauss(n//5) * 5 + gauss(n//15) * 15
print(ans) | p02712 |
N = int(eval(input()))
l = []
for i in range(N+1):
if not i % 3 == 0 and not i % 5 == 0:
l.append(i)
print((sum(l))) | N = int(eval(input()))
l = [i for i in range(N+1) if not i % 3 == 0 and not i % 5 == 0]
print((sum(l))) | p02712 |
N = int(eval(input()))
a = [0] * N
for i in range(1,N+1):
if i%3 == 0 and i%5 == 0:
pass
elif i%3 == 0:
pass
elif i%5 == 0:
pass
else:
a[i-1] = i
print((sum(a))) | N = int(eval(input()))
ans = 0
for i in range(1,N+1):
if i%3==0 and i%5==0:
pass
elif i%3==0:
pass
elif i%5==0:
pass
else:
ans += i
print(ans)
| p02712 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if i % 3 == 0 or i % 5 == 0:
continue
ans += i
print(ans)
| n = int(eval(input()))
total = {}
for i in (1, 3, 5, 15):
total[i] = i * (n // i) * (n // i + 1) // 2
print((total[1] - total[3] - total[5] + total[15]))
| p02712 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if i % 15 != 0 and i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | n = int(eval(input()))
ans = 0
for i in range(n + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | p02712 |
def main():
n = int(eval(input()))
ans = sum([i for i in range(1, n+1) if i%3!=0 and i%5!=0])
print(ans)
if __name__ == "__main__":
main() | def main():
n = int(eval(input()))
print((sum([i for i in range(1, n+1) if i%3 and i%5])))
if __name__ == "__main__":
main()
| p02712 |
s = 0
for i in range(1, int(eval(input()))+1):
if i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
s += i
print(s) | print((sum(0 if i%3 == 0 or i%5 == 0 else i for i in range(1, int(eval(input()))+1))))
| p02712 |
N = int(eval(input()))
a = 0
for i in range(N):
if (i+1)%3 != 0 and (i+1)%5 != 0:
a += i+1
print(a)
| import math
N = int(eval(input()))
S = int(N*(N+1)/2)
S -= 3*int(math.floor(N/3)*(math.floor(N/3)+1)/2)
S -= 5*int(math.floor(N/5)*(math.floor(N/5)+1)/2)
S += 15*int(math.floor(N/15)*(math.floor(N/15)+1)/2)
print(S) | p02712 |
n = int(eval(input()))
A = list(range(1, n+1))
B = list()
for i in range(1, n+1):
if i % 5 == 0 or i % 3 == 0:
B.append(i)
ans = list(set(A) - set(B))
print((sum(ans))) | n = int(eval(input()))
n3 = n // 3
n5 = n // 5
n15 = n // 15
print((n*(n + 1)//2 - 3*n3*(n3 + 1)//2 - 5*n5*(n5 + 1)//2 + 15*n15*(n15 + 1)//2)) | p02712 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | N= int(eval(input()))
sum = 0
for i in range(1, N+1):
if (i % 3 != 0 and i % 5 != 0 ):
sum += i
print(sum)
| p02712 |
N = int(eval(input()))
A = []
for i in range(N+1):
if i % 15 == 0:
pass
elif i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
A.append(i)
print((sum(A))) | N = int(eval(input()))
A = []
for i in range(N+1):
if i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
A.append(i)
print((sum(A))) | p02712 |
N = int(eval(input()))
lst = []
for i in range(1, N + 1):
if (i % 3) == 0 or (i % 5) == 0:
pass
else:
lst.append(i)
print((sum(lst)))
| N = int(eval(input()))
a = []
for i in range(1, N + 1):
if i % 3 == 0 or i % 5 == 0:
pass
else:
a.append(i)
print((sum(a)))
| p02712 |
n = int(eval(input()))
x = 0
for i in range(1, n+1):
if i%3!=0 and i%5!=0:
x+=i
print(x) | n = int(eval(input()))
x = 0
for i in range(1, n+1):
if i%3 and i%5:
x+=i
print(x) | p02712 |
N = int(eval(input()))
S = 0
for i in range(0,N):
if (i+1) % 3 != 0 and (i+1) % 5 != 0:
S = S + i+1
print(S) | N = int(eval(input()))
S = 0
for x in range(0,N+1):
if (x % 3) != 0 and (x % 5) != 0:
S += x
else:
S += 0
print(S) | p02712 |
n = int(eval(input()))
s = []
for i in range(n+1):
if i%3!=0 and i%5!=0:
s.append(i)
print((sum(s)))
| n = int(eval(input()))
ans = 0
for i in range(n+1):
if i%3!=0 and i%5!=0:
ans = ans + i
print(ans)
| p02712 |
primes = [0, 0] + [1] * 9999
for i in range(2, 101):
if primes[i]:
for j in range(i*i, 10001, i):
primes[j] = 0
while True:
try:
N = int(eval(input()))
except:
break
print((sum(primes[i] & primes[N-i+1] for i in range(1, N+1)))) | primes = [0, 0] + [1] * 9999
for i in range(2, 101):
if primes[i]:
for j in range(i*i, 10001, i):
primes[j] = 0
while True:
try:
N = int(eval(input()))
except:
break
print((sum(primes[i] and primes[N-i+1] for i in range(1, N+1)))) | p00590 |
import math
r = 9999
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for j in range(2*i+1,r,i+1)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while True:
try:
n = int(input())
count = 0
... | import math
r = 9999
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for j in range(2*i+1,r,i+1)]
prime = []
for i in range(r):
if p[i]:
prime.append(i)
while True:
try:
n = int(input())
count = 0
... | p00590 |
def prime_table(n):
list = [True for _ in range(n + 1)]
i = 2
while i * i <= n:
if list[i]:
j = i + i
while j <= n:
list[j] = False
j += i
i += 1
table = [i for i in range(n + 1) if list[i] and i >= 2]
return table
table = p... | def prime_table_boolean(n):
list1 = [True for _ in range(n + 1)]
i = 2
while i * i <= n:
if list1[i]:
j = i + i
while j <= n:
list1[j] = False
j += i
i += 1
list1[1] = False
del list1[0]
#table = [i for i in xrange(n + 1) ... | p00590 |
import re
s = list(re.sub(r'[BC]+', 'B', input().strip().replace('BC', 'D')))
n = len(s)
#print(s)
end = n - 1
count = 0
if n >= 3:
i = 0
while i < end:
if s[i] == 'A' and s[i + 1] == 'D':
s[i] = 'D'
s[i + 1] = 'A'
count = count + 1
j = i - 1
while j >= 0 an... | s = input().strip().replace('BC', 'D')
n = len(s)
count = 0
a_count = 0
for i in range(n):
if s[i] == 'A':
a_count += 1
elif a_count > 0 and s[i] == 'D':
count += a_count
else:
a_count = 0
print(count) | p03018 |
import sys
input=sys.stdin.readline
def main():
S = input().strip()
ans = 0
while 1:
i = S.find("ABC")
if i < 0:
break
li = 0
for l in range(i-1,-1,-1):
if S[l] == "A":
li += 1
else:
break
... | import sys
input=sys.stdin.readline
def main():
S = input().strip()
S = S.replace("BC","D")
ans = 0
a = 0
for c in S:
if c == "A":
a += 1
elif c == "D":
ans += a
else:
a = 0
print(ans)
if __name__ == '__main... | p03018 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: list(map(int, read().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: list(map(int, read().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
... | p03018 |
#!/usr/bin/env python3
import sys
def solve(s: str):
s = s.replace('BC', 'X')
ans = 0
while('AX' in s):
ans += s.count('AX')
s = s.replace('AX', 'XA', len(s))
print(ans)
return
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools ... | #!/usr/bin/env python3
import sys
def solve(s: str):
s = s.replace('BC', 'X')
ans = 0
cur = 0
for i in range(len(s)):
if(s[i] == 'A'):
cur += 1
elif(s[i] == 'X'):
ans += cur
else:
cur = 0
print(ans)
retur... | p03018 |
from sys import stdin
s = (stdin.readline().rstrip())
ans = 0
while s.count("ABC") != 0:
ans += s.count("ABC")
s = s.replace("ABC","BCA")
print(ans) | from sys import stdin
s = (stdin.readline().rstrip())
s = s.replace("BC","D")
ans = 0
acc = 0
for i in s:
if i == "B" or i == "C":
acc = 0
continue
if i == "A":
acc += 1
if i == "D":
ans += acc
print(ans) | p03018 |
def main():
s = input().replace('BC', 'X')
count = 0
N = len(s)
for i in range(N - 1):
if s[i] == 'A':
n = 1
while i + n < N:
if s[i + n] == 'A':
n += 1
continue
elif s[i + n] == 'X':
... | def main():
s = input().replace('BC', 'X')[::-1]
N = len(s)
count = 0
tmp = 0
for i in range(N):
if s[i] == 'X':
tmp += 1
elif s[i] == 'A':
count += tmp
else:
tmp = 0
print(count)
if __name__ == '__main__':
main()
| p03018 |
#!/usr/bin/env python3
import sys
def conv2num(c):
if c == "A":
return 1
elif c == "D":
return 2
elif c == "B":
return 3
else:
return 4
def solve(s: str):
res = 0
s = s.replace("BC","D")
s = [ conv2num(c) for c in s ]
i = 0
endi... | #!/usr/bin/env python3
import sys
def conv2num(c):
if c == "A":
return 1
elif c == "D":
return 2
elif c == "B":
return 3
else:
return 4
def solve(s: str):
res = 0
s = s.replace("BC","D")
s = [ conv2num(c) for c in s ]
acnt = 0
f... | p03018 |
#!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
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!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
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03018 |
import sys
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
S = list(rs())
cur = 'D'
answer = 0
A_cnt = 0
for s in S:
if cur == 'A':
if s == 'A':
A_cnt += 1
el... | import sys
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
S = rs()
S = S.replace('BC', 'D')
cnt_A = 0
answer = 0
for s in S:
if s == 'A':
cnt_A += 1
elif s == 'D':
a... | p03018 |
S = input().replace("BC", "D")
ans = a = 0
for s in S:
if s == "A":
a += 1
elif s == "D":
ans += a
else:
a = 0
print(ans) | def main():
S = input().replace("BC", "D")
ans = a = 0
for s in S:
if s == "A":
a += 1
elif s == "D":
ans += a
else:
a = 0
print(ans)
main() | p03018 |
import sys
def main():
input = sys.stdin.readline
S = list(input().strip())
n = len(S)
ans = 0
cnt = 0
for i in range(n):
if S[i:i+3] == ['A', 'B', 'C']:
cnt += 1
S[i] = 'B'
S[i+1] = 'C'
S[i+2] = 'A'
S = S[::-1]
... | import sys
def main():
input = sys.stdin.readline
S = input().strip()
n = len(S)
T = ''
i = 0
while i < n:
if S[i] == 'A':
T += 'A'
i += 1
elif S[i:i+2] == 'BC':
T += 'D'
i += 2
else:
T += S[i]... | p03018 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | p03018 |
s = input().strip()
x = s[0]
for i in range(1,len(s)):
if s[i]=="C" and s[i-1]=="B":
x = x[:-1]+"T"
else:
x += s[i]
cnt = 0
ca = 0
for i in range(len(x)):
if x[i]=="A":
ca += 1
elif x[i]=="T":
cnt += ca
elif x[i]=="B" or x[i]=="C":
ca = 0
print... | s = input().strip()
x = [s[0]]
for i in range(1,len(s)):
if s[i]=="C" and s[i-1]=="B":
x.pop()
x.append("T")
else:
x.append(s[i])
cnt = 0
ca = 0
for i in range(len(x)):
if x[i]=="A":
ca += 1
elif x[i]=="T":
cnt += ca
elif x[i]=="B" or x[i]=="C":... | p03018 |
import re
s = input().replace("BC", "X")
cnt = 0
while "AX" in s:
if "AXAX" in s:
tmp = re.subn("AXAX", "XXAA", s)
s = tmp[0]
cnt += tmp[1] * 3
tmp = re.subn("AX", "XA", s)
s = tmp[0]
cnt += tmp[1]
print(cnt) | cnt, tmp = 0, 0
for c in input().replace("BC", "X"):
if c == "A":
tmp += 1
elif c == "X":
cnt += tmp
else:
tmp = 0
print(cnt) | p03018 |
# coding: utf-8
# Your code here!
s=list(input().replace("BC","Z"))
ans=0
def seisan(list):
count=0
N=len(list)-1
for index,content in enumerate(list):
if content=="A":
count+=(N-index)
N-=1
return count
temp=[]
while s:
this=s.pop(0)
if this=="... | # coding: utf-8
# Your code here!
s=list(input().replace("BC","Z"))[::-1]
ans=0
def seisan(list):
count=0
N=len(list)-1
for index,content in enumerate(list):
if content=="A":
count+=(N-index)
N-=1
return count
temp=[]
while s:
this=s.pop(-1)
if ... | p03018 |
s = input().replace("BC", "D")
ans = 0
cnt = 0
for i in s[::-1]:
if i == "D":
cnt += 1
elif i == "A":
ans += cnt
else:
cnt = 0
print(ans) | s = input().replace("BC", "D")
a = 0
c = 0
for i in s[::-1]:
if i == "D":
c += 1
elif i == "A":
a += c
else:
c = 0
print(a) | p03018 |
S = list(input().replace("BC", "D"))
l = []
ans = 0
for i in range(len(S)-1):
if(S[i] == "A" and S[i+1] == "D"):
l.append(i+1)
l.append(i-1)
S[i] = "D"
S[i+1] = "A"
ans += 1
while(len(l)):
target = l[0]
if(target < len(S) - 1 and target >= 0):
i... | S = list(input().replace("BC", "D"))
l = []
ans = 0
a_cnt = 1
d_cnt = 1
for i in range(len(S)-1):
if (S[i] == "A" and S[i + 1] == "D"):
ans += a_cnt
S[i] = "D"
S[i + 1] = "A"
else:
if(S[i] == "A" and S[i+1] == "A"):
a_cnt += 1
else:
a... | p03018 |
ans=0
for x in input().replace('BC','y').replace('A','x').replace('B',' ').replace('C',' ').split():
c=0
for t in x:
if t=='y':
ans+=c
else:c+=1
print(ans) | def f():
ans,c=0,0
for t in input().replace('BC','y').replace('A','x'):
if t=='y':ans+=c
elif t=='x':c+=1
else:c=0
print(ans)
if __name__ == "__main__":
f() | p03018 |
import sys
readline = sys.stdin.readline
S = readline().rstrip()
S = S.replace("BC","X")
S = S.replace("B",".").replace("C",".")
arr = S.split(".")
ans = 0
for a in arr:
cnt = 0
for i in range(len(a)):
if a[i] == "X":
ans += (i - cnt)
cnt += 1
print(ans) | import sys
readline = sys.stdin.readline
S = readline().rstrip().replace("BC","X")
# AAXXX のようにAとXだけで構成されている部分は、
# Xを全て左に移動する
# BとCが残っている部分で切れる
parts = S.replace("B",",").replace("C",",").split(",")
ans = 0
for part in parts:
# Xを探し、Xにあったら、そのときのインデックス - それまでにXを見つけた数する
cnt = 0
for i in range(len... | p03018 |
# coding:utf-8
import math
def main():
s = list(input())
s.reverse()
cnt = 0
total = 0
while True:
chk = False
for i in s:
if i == 'C' and cnt < len(s) - 2:
if s[cnt+1] == 'B' and s[cnt+2] == 'A':
s[cnt] = 'A'
... | # coding:utf-8
import math
def main():
s = list(input())
substr = ''
total = []
cnt = 0
m = False
for i in s:
if i == 'A' and m == False:
cnt += 1
elif i == 'A':
cnt = 1
m = False
elif i == 'B' and m == False:
... | p03018 |
from copy import deepcopy
def solve():
s = [_ for _ in input()]
ans = 0
chlist = []
for i in range(len(s) - 2):
if s[i] == 'A':
chlist.append(i)
found = True
while found:
found = False
tmp_cl = deepcopy(chlist)
for it in range(len(tmp_cl)... | def solve2():
s = input()
s = s.replace('BC', 'X')
ans = 0
acc_A = 0
for ele in s:
if ele == 'A':
acc_A += 1
elif ele == 'X':
ans += acc_A
else:
acc_A = 0
print(ans)
if __name__ == '__main__':
solve2()
| p03018 |
from sys import stdin
s = stdin.readline().rstrip()
point = 0
while True:
if "ABC" not in s:
break
else:
point += s.count("ABC")
s = s.replace("ABC","BCA")
print(point) | from sys import stdin
s = stdin.readline().rstrip()
s = s.replace("BC","D")
point = 0
count = 0
for i in s:
if i == "A":
count += 1
elif i == "D":
point += count
else:
count = 0
print(point) | p03018 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(2147483647)
input=lambda:sys.stdin.readline().rstrip()
def solve():
n = int(eval(input()))
edge = [[] for _ in range(n)]
for v in range(1,n):
u = int(eval(input()))-1
edge[u].append(v)
dp = [None]*n
def dfs(s):
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
E=[[] for _ in range(n)]
for v in range(1,n):
u=int(eval(input()))-1
E[u].append(v)
E[v].append(u)
dp=[None]*n
... | p03822 |
import sys
from heapq import heapify,heappush,heappop
sys.setrecursionlimit(10**7)
N=int(eval(input()))
List=[[] for i in range(N)]
for i in range(1,N):
a=int(eval(input()))
List[a-1].append(i)
def f(x):
if len(List[x])==0:
return 0
L=[]
heapify(L)
for a in List[x]:
heappush(L,f(a))
... | import sys
from heapq import heapify,heappush,heappop
sys.setrecursionlimit(10**7)
input=sys.stdin.readline
N=int(eval(input()))
List=[[] for i in range(N)]
for i in range(1,N):
a=int(eval(input()))
List[a-1].append(i)
def f(x):
if len(List[x])==0:
return 0
L=[]
heapify(L)
for a in List[... | p03822 |
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
N = int(eval(input()))
G =[[] for _ in range(N + 1)] #iさんが勝った相手のリストを要素とするリスト
for i in range(2, N + 1):
a = int(eval(input()))
G[a].append(i)
# print (G)
set_lst = [set() for _ in range(N + 1)] #使った数字を管理する
tmp_lst = [0] * (N... | import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
N = int(eval(input()))
G =[[] for _ in range(N + 1)] #iさんが勝った相手のリストを要素とするリスト
for i in range(2, N + 1):
a = int(eval(input()))
G[a].append(i)
# print (G)
def calc(x): #xからの移動先を検討
tmp = 0
lst = []
for next_ in G... | p03822 |
def main():
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
N = int(eval(input()))
G =[[] for _ in range(N + 1)] #iさんが勝った相手のリストを要素とするリスト
for i in range(2, N + 1):
a = int(eval(input()))
G[a].append(i)
# print (G)
set_lst = [set()... | def main():
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
N = int(eval(input()))
G =[[] for _ in range(N + 1)] #iさんが勝った相手のリストを要素とするリスト
for i in range(2, N + 1):
a = int(eval(input()))
G[a].append(i)
# print (G)
def calc(x): #xからの... | p03822 |
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n = int(eval(input()))
rev_g = [[] for _ in range(n+1)]
for i in range(n-1):
a = int(eval(input()))
rev_g[a].append(i+2)
def f(v):
m = len(rev_g[v])
if m == 0:
return 0
q = []
for nv in rev_g[v]:
... | import sys
sys.setrecursionlimit(10**7)
n = int(eval(input()))
rev_g = [[] for _ in range(n+1)]
for i in range(n-1):
a = int(eval(input()))
rev_g[a].append(i+2)
def f(v):
m = len(rev_g[v])
if m == 0:
return 0
q = []
for nv in rev_g[v]:
q.append(f(nv))
q.sort... | p03822 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.