input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, a, b = list(map(int, input().split()))
x = []
cnt = 0
flag = True
while cnt < n:
if flag:
for j in range(a):
if cnt + j >= n:
break
x.append(1)
cnt += a
flag = False
else:
for j in range(b):
if cnt + j >= n:
break
x.append(0)
cnt += b
flag = True
cnt = 0
for i in range(n):
if x[i] == 1:
cnt += 1
print(cnt)
| n, a, b = list(map(int, input().split()))
ans = n // (a + b) * a
rem = n % (a + b)
print((ans + min(rem, a))) | p02754 |
n,a,b = [int(i) for i in input().split()]
#k=n//(a+b)
#ans=a*k+a*(n-(a+b))
ans=0
while n >= 0:
ans+=min(a,n)
n-=(a+b)
print(ans)
| n,a,b = [int(i) for i in input().split()]
if n!=(a+b): print((a*(n//(a+b))+min(a,n%(a+b))))
else: print(a)
| p02754 |
# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, a, b = list(map(int,ipti().split()))
ab = a + b
c = n // ab
d = n % ab
ans = c * a + min(a, d)
print(ans)
if __name__ == '__main__':
main() | n, blue, red = list(map(int, input().split()))
# n / (blue + red) = quot ... rem
quot = n // (blue + red) # 商 quotient
rem = n % (blue + red) # 余り remainder
ans = blue * quot + min(blue, rem)
print(ans) | p02754 |
N,A,B=list(map(int,input().split()))
M=0
ans=0
for i in range(10**18):
if M+A+B<=N:
M=M+A+B
ans+=A
elif M+A<=N:
ans+=A
break
else:
A=N-M
ans+=A
break
print(ans) | N,A,B=list(map(int,input().split()))
M=0
ans=0
C=A+B
c=N//C
ans=A*c
if N-C*c<A:
ans+=N-C*c
else:
ans+=A
print(ans) | p02754 |
N, A, B = list(map(int, input().split()))
print(((N//(A+B))*A + min(N%(A+B),A)))
| N, A, B = list(map(int, input().split()))
m = N%(A+B)
print(((N//(A+B))*A + (A if m > A else m))) | p02754 |
n,a,b=list(map(int,input().split()))
x=a
y=b
ct=0
while n>0:
while n>0 and x>0:
x=x-1
n=n-1
ct=ct+1
while n>0 and y>0:
y=y-1
n=n-1
x=a
y=b
print(ct) | n,a,b=list(map(int,input().split()))
ct=a+b
num=(n//ct)*a
s=n%ct
result=num
result += min(s,a)
print((int(result))) | p02754 |
N,A,B = list(map(int,input().split()))
ans1 = []
ans2 = []
while len(ans1) <= N:
for i in range(A):
ans1.append("b")
for i in range(B):
ans1.append("r")
for i in range(N):
if ans1[i] == "b":
ans2.append(ans1[i])
print((len(ans2))) | N,A,B = list(map(int,input().split()))
C = N // (A + B)
D = N % (A + B)
ans = A * C
if D >= A:
ans += A
else:
ans += D
print(ans) | p02754 |
n, a, b = list(map(int, input().split()))
i = 1
cnt = 0
while n > 0:
if i % 2 != 0:
if n-a > 0:
n -= a
cnt += a
else:
cnt += n
n = 0
else:
n -= b
i += 1
print(cnt) | n, a, b = list(map(int, input().split()))
ans = a * (n//(a+b)) + min(n%(a+b), a)
print(ans)
| p02754 |
N, A, B = list(map(int, input().split()))
a = 0
b = 0
while True:
if a + b + A >= N:
ans = N - b
break
else:
a += A
if a + b + B >= N:
ans = a
break
else:
b += B
print(ans) | N, A, B = list(map(int, input().split()))
ans = (N//(A+B))*A
if N%(A+B)<=A:
ans += N%(A+B)
elif N%(A+B) !=0:
ans += A
print(ans) | p02754 |
N,A,B = list(map(int, input().split()))
L = []
b = 0
ans = 0
cnt = 0
while True:
if A == 0: break
L.append(A)
b += A
cnt += A
if cnt > N:
ans = b - (cnt - N)
break
L.append(B)
cnt += B
if cnt > N:
ans = b
break
print(ans) | N,A,B = list(map(int, input().split()))
L = []
b = 0
ans = 0
if A == 0:
ans = 0
elif N < A:
ans = N
elif N < A+B:
ans = A
else:
x = N // (A+B)
y = N % (A+B)
ans = A * x + min(y, A)
print(ans) | p02754 |
N, A, B = list(map(int, input().split()))
all_count = 0
blue_count = 0
while all_count < N:
if all_count + A >= N:
blue_count += N - all_count
break
all_count += A
all_count += B
blue_count += A
print(blue_count) | N, A, B = list(map(int, input().split()))
operation_count = N // (A+B)
blue_count = A * operation_count
if N % (A+B) > 0:
rest = N % (A+B)
blue_count += min([rest, A])
print(blue_count)
| p02754 |
[N, A, B]= list(map(int, input().split()))
ball = []
ans = 0
for k in range(N//(A+B)) :
for i in range(A) :
ball.append('b')
for j in range(B) :
ball.append('r')
mod = N % (A+B)
for l in range(N % (A+B)) :
for m in range(A) :
if mod > 0 :
ball.append('b')
mod -= 1
else :
break
for n in range(B):
if mod > 0 :
ball.append('r')
mod -= 1
else :
break
#print(ball)
ans = ball.count('b')
print(ans) | N, A, B= list(map(int, input().split()))
ans = 0
div = N//(A+B) * A
mod = N % (A+B)
ans = div + min(mod, A)
print(ans) | p02754 |
N, A, B = list(map(int, input().split()))
answer = N // (A + B) * A
if N % (A + B) <= A:
answer += N % (A + B)
else:
answer += A
print(answer) | N, A, B = list(map(int, input().split()))
print((N // (A + B) * A + min(A, N % (A + B)))) | p02754 |
N, A, B = list(map(int, input().split()))
i = 0
b = 0
r = 0
while i < N:
if (i+A <= N):
b += A
i += A
elif(i+A > N):
b += N-i
break
if (i+B <= N):
r += B
i += B
elif(i+B > N):
r += N-i
break
print(b)
|
N, A, B = list(map(int, input().split()))
i = 0
b = 0
r = 0
c = N//(A+B)
#print(c)
d = N%(A+B)
#print(d)
if d <= A:
b = c*A + d
else:
b = (c+1)*A
print(b)
| p02754 |
n, a, b = list(map(int, input().split()))
ans = n // (a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans) | n, a, b = list(map(int, input().split()))
ans1 = n//(a + b) * a
ans2 = min(n % (a + b), a)
print((ans1 + ans2)) | p02754 |
N,A,B = list(map(int,input().split()))
balls = []
odd = 1
while len(balls)<=N:
if odd == 1:
for i in range(1,A+1):
balls = balls + ["b"]
odd = 0
else:
for i in range(1,B+1):
balls = balls + ["r"]
odd = 1
balls = balls[:N]
print((balls.count("b"))) | N,A,B = list(map(int,input().split()))
balls = A + B
N_surplus = N%balls
if N_surplus < A:
blues = (N//balls)*A + N_surplus
else:
blues = (N//balls)*A + A
print(blues) | p02754 |
def main():
N, A, B = (int(i) for i in input().split())
ans = (N//(A+B)) * A
less = N - (N//(A+B)) * (A+B)
print((ans + min(less, A)))
if __name__ == '__main__':
main()
| def main():
N, A, B = (int(i) for i in input().split())
ans = (N//(A+B)) * A
print((ans + min(N % (A+B), A)))
if __name__ == '__main__':
main()
| p02754 |
n, a, b = list(map(int, input().split()))
a_count = 0
n_count = 0
while n_count < n:
for i in range(a):
if n_count >= n:
break
a_count += 1
n_count += 1
n_count += b
print(a_count)
| n, a, b = list(map(int, input().split()))
ans = n // (a+b)*a
rem = n % (a+b)
ans += min(rem, a)
print(ans) | p02754 |
n, b, r = list(map(int, input().split()))
ans = 0
while n > 0:
ans += min(n, b)
n -= b + r
print(ans)
| n, b, r = list(map(int, input().split()))
ans = n // (b + r) * b
n = n % (b + r)
ans += min(n, b)
print(ans)
| p02754 |
n,a,b=list(map(int,input().split()))
sum=0
while n>sum:
sum+=(a+b)
x=sum//(a+b)-1
left=n-x*(a+b)
if left<=a:
print((a*x+left))
else:
print((a*x+a)) | n,a,b=list(map(int,input().split()))
x=n//(a+b)
left=n-x*(a+b)
if left<=a:
print((a*x+left))
else:
print((a*x+a)) | p02754 |
import sys
n,a,b=list(map(int,input().split()))
if a == 0:
print((0))
sys.exit()
lst = []
is_blue = True
count = 0
for i in range(n):
if is_blue:
lst.append('b')
count += 1
if count == a:
is_blue = False
count = 0
else:
lst.append('r')
count += 1
if count == b:
is_blue = True
count = 0
result = list([x for x in lst if x == 'b'])
print((len(result))) | n,a,b = list(map(int,input().split()))
ans = n // (a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans) | p02754 |
N,A,B= list(map(int, input().split()))
s=0
c=0
while c+A<N:
c=c+A+B
s=s+A
if c>=N:
print(s)
else:
print((s+N-c)) | N,A,B= list(map(int, input().split()))
c=(A+B)*(N//(A+B))
s=A*(N//(A+B))
if c+A<=N:
print((s+A))
else:
print((s+N-c)) | p02754 |
n,a,b=list(map(int, input().split()))
balls= 0
blue = 0
for i in range(10**18):
if i % 2 == 0:
if (balls + a) >= n:
fill = n - balls
balls = balls + fill
blue = blue + fill
break
balls = balls + a
blue = blue + a
else:
if (balls + b) >= n:
fill = n - balls
balls = balls + fill
break
balls = balls + b
print(blue) | n,a,b=list(map(int, input().split()))
balls= 0
blue = 0
time = n // (a+b)
tmp = n % (a+b)
if tmp < a:
blue = time*a + tmp
else:
blue = (time+1)*a
print(blue) | p02754 |
a=input().split()
N,A,B=int(a[0]),int(a[1]),int(a[2])
st_a,st_b='',''
for i in range(A):
st_a+='b'
for i in range(B):
st_b+='r'
sum=0
b=''
while sum<=N:
b+=st_a
sum+=A
if(sum>=N):
break
b+=st_b
sum+=B
c=b[0:N]
print((c.count('b'))) | a=input().split()
N,A,B=int(a[0]),int(a[1]),int(a[2])
b=int(N/(A+B))
ans=int(A*b)
if(N-b*(A+B)<=A):
ans=ans+N-b*(A+B)
else:
ans+=A
print((int(ans)))
| p02754 |
import sys
N, A, B = list(map(int, input().split()))
count = 0
while True:
for i in range(A):
N -= 1
count += 1
if N == 0:
print(count)
sys.exit()
for j in range(B):
N -= 1
if N == 0:
print(count)
sys.exit() | N, A, B = list(map(int, input().split()))
answer = N // (A+B) * A
remainder = N % (A+B)
answer += min(remainder, A)
print(answer) | p02754 |
N, A, B = list(map(int, input().split()))
list = []
count = 0
if A > N:
print(N)
if A < N and A+B > N:
print(A)
else:
while len(list) <= N:
i = 0
for i in range(A):
list.append('b')
if len(list) <= N:
i = 0
for i in range(B):
list.append('r')
for i in range(N):
if list[i] == 'b':
count += 1
print(count)
| N, A, B = list(map(int, input().split()))
a = N // (A+B)
if N % (A+B) >= A:
print((a*A+A))
else:
print((a*A + N % (A+B))) | p02754 |
# n = int(input())
n, a, b = list(map(int, input().split()))
# a = list(map(int, input().split()))
row = []
while len(row) < n:
i = 0
while i != a:
row.append("b")
# print(i)
i += 1
j = 0
while j != b:
row.append("r")
# print(j)
j += 1
cnt = 0
k = 1
for r in row:
if k == n+1:
break
k += 1
if r == "b":
cnt += 1
print(cnt) | n, a, b = list(map(int, input().split()))
x = n//(a+b)
print((a*x + min(a, n%(a+b))))
| p02754 |
def main():
n, a, b = list(map(int, input().split()))
leng = 0
ans = 0
while n >= leng:
if a < (n - leng):
ans += a
leng += (a + b)
else:
ans += n - leng
leng += (a + b)
print(ans)
# if a >= n:
# print(n)
# else:
# print(a)
if __name__ == '__main__':
main() | def main():
n, a, b = list(map(int, input().split()))
tmp = n // (a + b)
if n - tmp * (a + b) > a:
print((tmp * a + a))
else:
print((tmp * a + n - tmp * (a + b)))
# TLE
# while n >= leng:
# if a < (n - leng):
# ans += a
# leng += (a + b)
# else:
# ans += n - leng
# leng += (a + b)
# if a >= n:
# print(n)
# else:
# print(a)
if __name__ == '__main__':
main() | p02754 |
n, a, b = (int(x) for x in input().split())
if a == 0:
print('0')
exit()
count_a = n // (a + b)
leave = n % (a + b)
if leave >= a: leave = a
ans = a * count_a + leave
print(ans) | # 高橋くんが根性ありすぎるので, ループではTLE
# 単純に商と剰余の和と思いがちだが, そうでないことに注意
n, a, b = (int(x) for x in input().split())
if a == 0:
print('0')
exit()
count_a = n // (a + b)
leave = n % (a + b)
# 剰余がaを超えていた場合, aにする
if leave >= a: leave = a
ans = a * count_a + leave
print(ans) | p02754 |
n, b, r = list(map(int, input().split()))
num = 0
res_b = 0
cnt = n//2 + n%2
for _ in range(cnt):
num += b
if num > n:
res_b += b - (num - n)
else:
res_b += b
num += r
if num > n:
break
print(res_b) | n, b, r = list(map(int, input().split()))
cnt_blk = n // (b+r)
res_b = cnt_blk*b
num = cnt_blk*(b+r) + b
if num > n:
res_b += b - (num - n)
else:
res_b += b
print(res_b) | p02754 |
List = list(map(int, input().split()))
Set0 = List[0]//(List[1]+List[2])
E = List[0] - (List[1]+List[2])*Set0
if E >= List[1]:
Blue = Set0 * List[1] + List[1]
else:
Blue = Set0 * List[1] + E
print(Blue) | List = list(map(int, input().split()))
Set0 = List[0]//(List[1]+List[2])
Blue = Set0 * List[1] + min(List[0] - (List[1]+List[2])*Set0, List[1])
print(Blue) | p02754 |
n,a,b=list(map(int,input().split()))
if a==0:
print("0")
exit()
ans = 0
while n>0:
if n>=a:
ans += a
n -= a
else:
ans += n
n = -1
n -= b
print(ans) | n,a,b=list(map(int,input().split()))
if a==0:
print("0")
exit()
tmp1 = n // (a+b)
tmp2 = n-(tmp1*(a+b))
if tmp2 >= a:
print(((tmp1*a)+a))
else:
print(((tmp1*a)+tmp2)) | p02754 |
N, A, B = list(map(int, input().split()))
total_list = []
count = 0
break_flag = False
for i in range(int(10e100)):
if break_flag:
break
for i in range(A):
total_list.append("b")
if len(total_list) <= N:
count += 1
else:
break_flag = True
break
for i in range(B):
total_list.append("r")
if len(total_list) >= N:
break_flag = True
break
if len(total_list) >= N:
break
print(count) | N, A, B = list(map(int, input().split()))
amari = N % (A + B)
sho = N // (A + B)
blue_num = 0
if amari < A:
blue_num += A * sho + amari
else:
blue_num += A * sho + A
print(blue_num)
| p02754 |
n,a,b = list(map(int,input().split()))
l = []
while True:
for _ in range(a):
l.append("r")
for _ in range(b):
l.append("b")
if len(l) >= n:
print((l[0:n].count("r")))
exit () | n,a,b = list(map(int,input().split()))
x = -(-n//(a+b))
total = (a+b)*(x-1)
total_a = a*(x-1)
if n - total >= a:
print((total_a + a))
else:
print((total_a + (n-total))) | p02754 |
import math
N, A, B = (int(x) for x in input().split(' '))
ans = 0
#
for i in range(N):
if i % (A+B) < A:
ans += 1
#結果出力
print(ans) | import math
N, A, B = (int(x) for x in input().split(' '))
tmp = A * math.floor(N/(A+B))
if ( N % (A+B) ) > A:
print((tmp+A))
else:
print((tmp+( N % (A+B))))
| p02754 |
n, a, b = list(map(int, input().split()))
red = 0 ; blue = 0
while n >= 0 :
if n > a :
n -= a
blue += a
else :
blue += n
break
if n > b :
n -= b
red += b
else :
red += b
break
print(blue)
| n, a, b = list(map(int, input().split()))
red = 0 ; blue = 0
if n >= a + b :
stack = n // (a+b)
red += b * stack
blue += a * stack
n -= (a+b) * stack
if n > a :
n -= a
blue += a
else :
blue += n
if n > b :
n -= b
red += b
else :
red += n
print(blue)
| p02754 |
# ABC158 B - Count Balls
N,A,B = list(map(int,input().split()))
A_A = 0
B_B = 0
for i in range(N):
if N >= A:
A_A +=A
N -=A
else:
A_A +=N
break
if N >= B:
B_B +=B
N -=B
else:
B_B +=N
break
print(A_A)
| # ABC158 B - Count Balls
M,A,B = list(map(int,input().split()))
import math
C = math.floor(M/(A+B))
N = M%(A+B)
E = C*A
A_A = 0
B_B = 0
for i in range(N):
if N >= A:
A_A +=A
N -=A
else:
A_A +=N
break
if N >= B:
B_B +=B
N -=B
else:
B_B +=N
break
print((A_A+E))
| p02754 |
# ABC158 B - Count Balls
M,A,B = list(map(int,input().split()))
import math
C = math.floor(M/(A+B))
N = M%(A+B)
E = C*A
A_A = 0
B_B = 0
for i in range(N):
if N >= A:
A_A +=A
N -=A
else:
A_A +=N
break
if N >= B:
B_B +=B
N -=B
else:
B_B +=N
break
print((A_A+E))
| # ABC158 B - Count Balls
M,A,B = list(map(int,input().split()))
import math
C = math.floor(M/(A+B))
N = M%(A+B)
E = C*A
if N >= A:
E+=A
else:
E+=N
print(E)
| p02754 |
import sys
n, a, b = list(map(int, input().split()))
if a == 0 or n == 0:
print((0))
sys.exit()
for i in range(n //(a + b) + 1):
if (a + b) * i <= n < (a + b) * (i + 1):
j = i
break
if n - (a + b) * j >= a:
print((a * j + a))
sys.exit()
else:
print((a * j + n- (a + b)*j ))
sys.exit() | import sys
n, a, b = list(map(int, input().split()))
if a == 0 or n == 0:
print((0))
sys.exit()
j = n //(a + b)
if n - (a + b) * j >= a:
print((a * j + a))
sys.exit()
else:
print((a * j + n- (a + b)*j ))
sys.exit() | p02754 |
n,a,b=list(map(int,input().split()))
p=n//(a+b)
if n%(a+b)==0:
r=0
elif n%(a+b)>=a:
r=a
else:
for i in range(a):
if n%(a+b)==i:
r=i
ans=p*a+r
print(ans) | n,a,b=list(map(int,input().split()))
p=n//(a+b)
if n%(a+b)==0:
r=0
elif n%(a+b)>=a:
r=a
else:
r=n%(a+b)
ans=p*a+r
print(ans) | p02754 |
n,a,b = list(map(int,input().split()))
blue = ''.join(['b' for i in range(a)])
red = ''.join(['r' for i in range(b)])
s = str()
while len(s) < n:
s += blue
if len(s) >= n:
break
s += red
print((s[:n].count('b'))) | n,a,b = list(map(int,input().split()))
ans = int(n / (a + b))
rem = n % (a + b)
if rem > a:
print((ans * a + a))
else:
print((ans * a + rem)) | p02754 |
N,A,B=list(map(int,input().split()))
n=0
S=''
flag=False
while True:
for i in range(A):
S+='b'
n+=1
if n==N:
flag=True
break
if flag:
break
for i in range(B):
S+='r'
n+=1
if n==N:
flag=True
break
if flag:
break
cnt=0
for i in S:
if i=='b':
cnt+=1
print(cnt) | N,A,B=list(map(int,input().split()))
cycle=A+B
a=N//cycle
b=N%cycle
if b>A:
b=A
cnt=a*A+b
print(cnt) | p02754 |
N, A, B = list(map(int,input().split()))
l = []
while (len(l) < N):
tmp = ['b' for i in range(A) if (len(l) + i) < N]
tmp2 = ['r' for i in range(B) if (len(l) + len(tmp) + i) < N]
l += (tmp + tmp2)
print((l.count('b')))
|
N, A, B = list(map(int, input().split()))
out = N // (A + B) * A
rem = min(N % (A + B), A)
print((out + rem))
| p02754 |
N, A, B = list(map(int,input().split()))
list = []
for _ in range(N):
[list.append('b') for i in range(A)]
[list.append('c') for j in range(B)]
a = list[:N:]
print((a.count("b")))
| N, A, B = list(map(int,input().split()))
ans = A*(N//(A+B)) + min(N%(A+B),A)
print(ans)
| p02754 |
import sys
n,a,b=list(map(int,input().split()))
count=0
if a==0:
print('0')
sys.exit()
else:
while n>=a:
n=n-a
count+=1
if n>=b:
n=n-b
elif n<b:
n=0
ball=a*count+n
print(ball) | n,a,b=list(map(int,input().split()))
kosuu=n//(a+b)
amari=n%(a+b)
if a>amari:
print((a*kosuu+amari))
else:
print((a*kosuu+a)) | p02754 |
input_lines=list(map(int,input().split()))
balls=[]
count=0
for i in range(10**100):
for j in range(input_lines[1]):
balls.append('b')
for j in range(input_lines[2]):
balls.append('r')
if len(balls)>input_lines[0]:
break
for i in range(input_lines[0]):
if balls[i]=='b':
count+=1
print(count) | n,a,b=list(map(int,input().split()))
answer=n//(a+b)*a+min(n%(a+b),a)
print(answer) | p02754 |
N, A, B = list(map(int, input().split(" ")))
balls = []
isFinish = True
count = 0
while isFinish:
if len(balls) >= N:
isFinish = False
for i in range(A):
if len(balls) >= N:
isFinish = False
break
balls.append('b')
count += 1
for i in range(B):
if len(balls) >= N:
isFinish = False
break
balls.append('r')
print(count) | def main():
N, A, B = list(map(int, input().split(" ")))
if (A + B) == 0:
print((0))
return
amari = N % (A+B)
kaisuu = N // (A+B)
print((kaisuu*A+min(amari, A)))
main()
| p02754 |
N,A,B = list(map(int,input().split()))
ans = list()
a = "a"
b = "b"
while N > 0:
for _ in range(A):
ans.append(a)
N = N - 1
if N == 0:
print((ans.count(a)))
exit()
for _ in range(B):
ans.append(b)
N = N - 1
if N == 0:
print((ans.count(a)))
exit() | N,A,B = list(map(int,input().split()))
if A == 0:
print(A)
exit()
n = N // (A + B)
nn = N % (A + B)
if n != 0 and nn <= A:
print((int(A*n + nn)))
elif n != 0 and nn > A:
print((int(A*(n+1))))
elif n == 0 and N >= A:
print(A)
elif n == 0 and N < A:
print(N) | p02754 |
N, b, r = list(map(int, input().split()))
s = 0
t = 0
for i in range(10**100):
t = t+b+r
s += 1
if N<=t:
if (t-N)<r:
print((s*b))
exit()
else:
print(((s-1)*b+N-t+b+r))
exit() | N, b, r = list(map(int, input().split()))
t = N//(b+r)
s = N%(b+r)
if s>=b:
print(((t+1)*b))
else:
print((t*b + s)) | p02754 |
N, A, B = list(map(int, input().split()))
List=[]
while len(List) < N:
for i in range(A):
List.append("b")
for i in range(B):
List.append("r")
for i in range (len(List)-N):
del List[N]
print((List.count("b")))
| N, A, B = list(map(int, input().split()))
brset = A + B
inside = N // (A+B)
count = inside*A
if inside*brset + A <= N:
count += A
else:
count += N - (inside*brset)
print(count)
| p02754 |
n,a,b=list(map(int,input().split()))
x,y=0,0
i=0
while(n>0):
if(i%2==0):
x+=min(n,a)
n-=min(n,a)
else:
y+=min(b,n)
n-=min(n,b)
i+=1
print(x)
| n,a,b=list(map(int,input().split()))
x=n//(a+b)
y=n%(a+b)
if(y>=a):
print((x*a+a))
else:
print((a*x+y)) | p02754 |
Nf,Af,Bf = (input().split(' '))
N = int(Nf)
A = int(Af)
B = int(Bf)
a = N % (A + B)
b = N // (A + B)
if a < A + 1:
print((A*b+a))
else:
print((A*b+A)) | N,A,B = list(map(int,input().split()))
a = N//(A+B)
b = N%(A+B)
if b >= A:
b = A
print((a*A+b)) | p02754 |
n, a, b = list(map(int, input().split()))
count = 0
while n > 0:
for i in range(a):
count += 1
n -= 1
if n == 0:
break
if n != 0:
for j in range(b):
n -= 1
if n == 0:
break
print(count) | n, a, b = list(map(int, input().split()))
x = n//(a+b)
y = n%(a+b)
if y <= a:
print((x*a + y))
else:
print((x*a + a)) | p02754 |
a,b,c = list(map(int,input().split()))
d = 0
l = a // (b+c)
k = a % (b+c)
if b == 0:
print('0')
elif b + c >= a:
if b < a:
print(b)
elif b > a:
print(a)
elif b + c < a:
if a % (b + c) == 0:
print((int(l)))
elif a % (b + c) != 0:
if b > k:
print((int(l*b + k)))
elif b < k:
print((int(l*b + b))) | N, A, B = list(map(int, input().split()))
div = N//(A+B)
mod = N % (A+B)
print((div*A+min(mod, A))) | p02754 |
N,A,B = list(map(int,input().split()))
s=0
if(N%(A+B)>A):
s+=A
else:
s+=N%(A+B)
s+=N//(A+B)*A
print(s) | N,A,B = list(map(int,input().split()))
print(((N//(A+B))*A + min(N%(A+B),A))) | p02754 |
n,a,b = list(map(int,input().split()))
su = 0
blue = 0
nn = 5**100
for i in range(nn):
for x in range(0,a):
if su < n:
su += 1
blue += 1
for y in range(0,b):
if su >= n:
break
su += 1
else:
continue
break
print((str(blue))) | n,a,b = list(map(int,input().split()))
su = 0
blue = 0
mo = n%(a+b)
mu = int(n/(a+b))
if mo > a:
ma = mo-a
blue = n-ma-b*mu
elif mo <= a:
blue = n- b*mu
print((str(blue))) | p02754 |
n, a, b = list(map(int, input().split()))
ans = 0
while n > a+b:
ans += a
n -= a+b
ans += min(n, a)
print(ans) | n, a, b = list(map(int, input().split()))
ans = n // (a+b) * a
tmp = n % (a+b)
ans += min(a, tmp)
print(ans)
| p02754 |
n,a,b = list(map(int,input().split()))
rest = n%(a+b)
n -= rest
ans = n//(a+b)*a
if rest >= a:
ans += a
elif rest < a:
ans += rest
print(ans) | n,a,b = list(map(int,input().split()))
rest = n%(a+b)
ans = n//(a+b)*a
if rest >= a:
ans += a
elif rest < a:
ans += rest
print(ans) | p02754 |
N, A, B = list(map(int, input().split()))
current_n = N
b_cnt = 0
flag = True
while current_n != 0:
if flag:
if current_n - A > 0:
current_n = current_n - A
b_cnt += A
else:
b_cnt += current_n
current_n = 0
flag = False
else:
if current_n - B > 0:
current_n = current_n - B
else:
current_n = 0
flag = True
print(b_cnt)
| N, A, B = list(map(int, input().split()))
q, r = divmod(N, A+B)
if r >= A:
print((q*A+A))
else:
print((q*A+r))
| p02754 |
n, a, b = list(map(int, input().split()))
if a == 0:
print((0))
else:
syou = n//(a+b)
amari = n%(a+b)
if amari < a:
print((syou*a+amari))
else:
print(((syou+1)*a)) | n, a, b = list(map(int, input().split()))
print((n//(a+b) * a + min(n%(a+b), a))) | p02754 |
n,a,b = list(map(int, input().split()))
x = n // (a+b)
amari = n % (a+b)
if amari <= a:
print((x*a+amari))
else:
print((x*a+a)) | n,a,b = list(map(int, input().split()))
s = n//(a+b)
rest = n%(a+b)
print((s*a+min(a,rest))) | p02754 |
# 入力の取得
i = list(map(int, input().split()))
kazoeru = i[0]
ao = i[1]
aka= i[2]
kaisuu = i[0]/(i[1]+i[2])
number = 0
list = []
# リスト作成
while number <= kaisuu:
# 青いボールを追加
ball = 0
while ball < ao:
list.append("ao")
ball += 1
# 赤いボールを追加
ball = 0
while ball < aka:
list.append("aka")
ball += 1
#回数加算
number += 1
# 青ボールを数える
number = 0
aonokazu = 0
while number < kazoeru:
if list[number] == "ao":
aonokazu += 1
number += 1
print(aonokazu) | # 入力の取得
i = list(map(int, input().split()))
kazoeru = i[0]
ao = i[1]
aka= i[2]
kaisuu = i[0]/(i[1]+i[2])
answer = divmod(kazoeru, (i[1]+i[2]))
if ao == 0:
print((0))
exit()
#商の分を計算
aa = ao * answer[0]
#あまりの分を計算
if answer[1] == 0:
print(aa)
exit()
#あまり6で、青が6なら
# あまりが青より多いなら(あまり4、青2)
if answer[1] >= ao:
aa += ao
#あまりが青より少ないなら(あまり1、青3)
else:
aa += answer[1]
print(aa) | p02754 |
N,A,B = list(map(int,input().split()))
ans = 0
for i in range(10**100):
if N > A+B:
N -= (A+B)
ans += A
else:
break
if N >= A:
ans += A
print(ans)
else :
ans += N
print(ans) | N, A, B = list(map(int, input().split()))
ans = N // (A + B) * A
rem = N % (A + B)
ans += min(rem, A)
print(ans) | p02754 |
N, A, B = [int(v) for v in input().strip().split(" ")]
loop, m = divmod(N, A + B)
cnt_b = 0
cnt_all = 0
for _ in range(loop):
cnt_b += A
if m < A:
cnt_b += m
else:
cnt_b += A
print(cnt_b) | N, A, B = [int(v) for v in input().strip().split(" ")]
loop, m = divmod(N, A + B)
print((loop * A + (m if m < A else A))) | p02754 |
n,a,b = list(map(int, input().split()))
shou = n // (a+b)
amari = n % (a+b)
if amari >= a:
print((shou * a + a))
else: print((shou * a + amari)) | n,a,b = list(map(int, input().split()))
shou = n // (a+b)
amari = n % (a+b)
ans = shou*a+a if amari >= a else shou*a+amari
print(ans) | p02754 |
n, a, b = [int(i) for i in input().split()]
s = []
for _ in range(n//(a+b)+1):
s += [1 for _ in range(a)] + [0 for _ in range(b)]
print((sum(s[:n])))
|
n, a, b = [int(i) for i in input().split()]
sy = n // (a+b)
am = n % (a+b)
print((sy*a + min(am, a)))
| p02754 |
N, A, B = [int(y) for y in input().split(' ')]
count = 0
while N >= A:
count += 1
N -= A+B
if A == 0:
print((0))
elif N > 0:
print((count*A + N))
else:
print((count*A)) | N, A, B = [int(y) for y in input().split(' ')]
count = N // (A+B)
residue = N % (A+B)
if A == 0:
print((0))
elif residue > A:
print((count*A + A))
elif residue > 0:
print((count*A + residue))
else:
print((count*A)) | p02754 |
def main():
N, A, B = list(map(int, input().split()))
ret = 0
rep, rest = divmod(N, A + B)
ret += rep * A
ret += min(A, rest)
print(ret)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| def main():
N, A, B = list(map(int, input().split()))
AB = A + B
q, r = divmod(N, AB)
print((A * q + min(r, A)))
if __name__ == '__main__':
main()
| p02754 |
N, A, B = list(map(int,input().split()))
ans = 0
x = 0
Ball = []
while x < N:
x = x + A + B
for i in range(A):
Ball.append('b')
for i in range(B):
Ball.append('r')
Ball = Ball[0:N]
ans = Ball.count('b')
print(ans) | N, A, B = list(map(int,input().split()))
x = N // (A + B)
y = N % (A + B)
ans = x * A + min(y,A)
print(ans) | p02754 |
n, b, r = list(map(int,input().split()))
l = list()
k = 0
for i in range(0,n,b+r):
for j in range(b):
l.append('b')
for j in range(r):
l.append('r')
for j in range(b):
l.append('b')
for j in range(r):
l.append('r')
print((l[0:n].count('b'))) | n, b, r = list(map(int,input().split()))
a = n//(b+r) * b
c = n%(b+r)
a += min(c,b)
print(a) | p02754 |
N,A,B = [int(x) for x in input().split()]
n = 0
blue = 0
if A == 0:
print((0))
else:
for i in range(10**7):
n = n + A
blue = blue + A
if n >= N:
blue = blue - (n-N)
break
else:
n = n + B
if n >= N:
break
print(blue) | N,A,B = list(map(int,input().split()))
a = N//(A+B)*A
if N%(A+B) <= A:
print((a + N%(A+B)))
else:
print((a + A)) | p02754 |
n,b,r=list(map(int,input().split()))
alist=[]
count=0
while len(alist)<n:
for i in range(b):
alist.append('b')
for i in range(r):
alist.append('r')
del alist[n:]
for i in alist:
if i=='b':
count+=1
print(count)
| n,b,r=list(map(int,input().split()))
ans=n//(b+r)*b
sur=n%(b+r)
ans+=min(sur,b)
print(ans) | p02754 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, A, B = lr()
time, remain = divmod(N, (A+B))
answer = A * time + min(A, remain)
print(answer)
| # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, A, B = lr()
time = N // (A+B)
remain = N - (A+B) * time
answer = A * time + min(A, remain)
print(answer)
| p02754 |
n, a, b = list(map(int, input().split(' ')))
tmp = 0
count = 0
if a == 0:
print((0))
elif n % (a+b) == 0:
print((a*(n // (a+b))))
elif n % (a+b) == a:
print((a*(n // (a+b)+1)))
else:
while count < 10**100:
n -= a
tmp += a
if n <= 0:
print((tmp + n))
break
n -= b
if n <= 0:
print(tmp)
break
| n, a, b = list(map(int, input().split(' ')))
if a == 0:
print((0))
elif n % (a+b) <= a:
print((a*(n // (a+b))+ n % (a+b)))
else:
print(( a*(n // (a+b))+a)) | p02754 |
N, A, B = list(map(int, input().split()))
num = 0
blue = 0
red = 0
for i in range(10**18):
if i % 2 == 0 and N >= num:
num += A
blue += 1
elif i % 2 == 1 and N >= num:
num += B
red += 1
else:
break
# print(num)
# print(blue)
# print(red)
if blue > red:
aa = N - A * blue - B * red
ans_b = A * blue + aa
else:
aa = N - A * blue - B * red
ans = B * red + aa
ans_b = N - ans
print(ans_b) | N, A, B = list(map(int, input().split()))
A_amari = A % 2
B_amari = B % 2
# print(A_amari)
# print(B_amari)
if A+B == 0:
print((0))
exit()
else:
cnt = N // (A+B)
amari = N % (A+B)
# print(cnt)
# print(amari)
if amari <= A:
print((A*cnt+amari))
else:
if amari <= B or amari > A:
print((A*(cnt+1))) | p02754 |
n, a, b = list(map(int, input().split()))
array = []
for t in range(10 ** 18):
if len(array) >= n:
break
for p in range(a):
array.append('blue')
for q in range(b):
array.append('red')
f = n // (a+b)
g = n % (a+b)
if g <= a:
print((f * a + g))
else:
print((f * (a+1))) | n, a, b = list(map(int, input().split()))
f = n // (a+b)
g = n % (a+b)
if g <= a:
print((a * f + g))
else:
print((a * (f+1))) | p02754 |
import sys
input = sys.stdin.readline
N, A, B = [int(x) for x in input().split()]
AB = A + B
if AB == 0:
print((0))
sys.exit()
ans = A * (N // AB)
ans_mod = N % AB
if ans_mod == 0:
print(ans)
sys.exit()
if ans_mod >= A:
ans += A
elif ans_mod < A:
ans += ans_mod
print(ans) | import sys
input = sys.stdin.readline
n, a, b = [int(x) for x in input().split()]
if a == 0:
print((0))
sys.exit()
if b == 0:
print(n)
sys.exit()
ab = a + b
n_ab = n // ab
ans = n_ab * a
remain = n - ab * n_ab
ans += min(a, remain)
print(ans) | p02754 |
a,b,c = list(map(int,input().split()))
s = b + c
counter = 1
ans = 0
while True:
if a < s * counter:
ans = b*(counter-1)
if a - (s * (counter-1)) <= b:
ans += a - (s * (counter-1))
else:
ans += b
break
else:
counter += 1
print(ans)
| a,b,c = list(map(int,input().split()))
s = b + c
counter = a//s
ans = b*counter
if a - (s * counter) <= b:
ans += a - (s * counter)
else:
ans += b
print(ans) | p02754 |
N,A,B =list(map(int,input().split()))
D =[]
for i in range(N):
for j in range(A):
D.append("A")
for k in range(B):
D.append("B")
#print(D)
F =D[0:N]
#print(F)
print((F.count("A")))
| N,A,B =list(map(int,input().split()))
v = N//(A+B)
z = N %(A+B)
if z < A:
print((A*v + z))
else:
print((A*v + A))
| p02754 |
N, A, B = list(map(int, input().split()))
C = N // (A + B) * A
D = N % (A + B)
E = 0
for i in range(D):
if 0 < (i + 1) % (A + B) <= A:
E += 1
print((C+E)) | N, A, B = list(map(int, input().split()))
C = N // (A + B) * A
D = N % (A + B)
if 0 <= D and D <= A:
print((C + D))
else:
print((C + A)) | p02754 |
N, A, B = list(map(int, input().split(' ')))
blue = ''
red = ''
count = int(N / (A + B))
for i in range(A):
blue = blue + 'b'
for i in range(B):
red = red + 'r'
one_roop = blue + red
string = ''
for i in range(count):
string = string + one_roop
if N % (A + B) != 0:
string = string + one_roop[0:N % (A + B)]
print((string.count('b'))) | N, A, B = list(map(int, input().split(' ')))
count = int(N / (A + B))
blue_balls = count * A
if N % (A + B) != 0:
if N % (A + B) > A:
blue_balls += A
else:
blue_balls += N % (A + B)
print(blue_balls) | p02754 |
N, A, B = list(map(int, input().split()))
l = []
l_a = ['b' for i in range(A)]
l_b = ['r' for i in range(B)]
for val in range(N):
l += l_a
l += l_b
cnt = 0
for val in range(N):
if l[val] == 'b':
cnt += 1
print(cnt) | N, A, B = list(map(int, input().split()))
x = N // (A + B)
y = N % (A + B)
if y < A:
print((x*A + y))
else:
print((x*A + A)) | p02754 |
n,a,b=list(map(int,input().split()))
x=n%(a+b)
y=n//(a+b)
c=list(i for i in range(1,a+1))
if x in c:
print((a*y+x))
elif x==0:
print((a*y))
else:
print((a*(y+1))) | n,a,b=list(map(int,input().split()))
x=int(n/(a+b))
y=n%(a+b)
if a==0:
print((0))
elif y==0:
print((a*x))
elif 0<y<a+1:
print((a*x+y))
else:
print((a*(x+1))) | p02754 |
N, A, B=list(map(int,input().split()))
llist=[N]
for i in range(N-1):
if i<A or (i>B+1) and A>1 :
llist.append("blue")
else :
llist.append("red")
print((llist.count("blue"))) |
n, a, b = list(map(int, input().split()))
period = a+b
times = n//period
k = n%period
n = a if k >a else k
print((times*a + n)) | p02754 |
N, A, B = list(map(int, input().split()))
C = N // (A + B) + (0 if N % (A + B) == 0 else 1)
blue = 0
total = 0
while total < N:
addition = min(N - total, A + B)
total += addition
blue += min(addition, A)
print(blue) | N, A, B = list(map(int, input().split()))
C = N // (A + B)
D = N % (A + B)
R = C * A + min(A, D)
print(R) | p02754 |
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, A, B = list(map(int, sys.stdin.readline().split()))
ret = 0
cnt = N // (A + B)
if N % (A + B) == 0:
print((int(A * cnt)))
elif N < A + B:
print((min(N, A)))
else:
ret += A*cnt
if N - (A+B)*cnt <= A:
ret += N - (A+B)*cnt
else:
ret += A
print(ret)
if __name__ == '__main__':
main()
| import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, A, B = list(map(int, sys.stdin.buffer.readline().split()))
n = N//(A+B)
m = N%(A+B)
print((A*n + min(m, A) if m > A else A*n + m))
if __name__ == '__main__':
main()
| p02754 |
n,a,b=list(map(int,input().split()))
full=[]
while len(full)<n:
for _ in range(a):
full.append("b")
for _ in range(b):
full.append("r")
if len(full)>n:
del full[n:-1]
print((full.count("b")))
| N, A, B = list(map(int, input().split()))
m = N%(A+B)
print(((N//(A+B))*A + (A if m > A else m))) | p02754 |
n,a,b=list(map(int,input().split()))
aa=n//(a+b)
ss=n%(a+b)
ans=0
for i in range(aa):
ans+=a
if ss>a:
ans+=a
else:
ans+=ss
print(ans) | n,a,b=list(map(int,input().split()))
aa=n//(a+b)
ss=n%(a+b)
ans=0
ans=ans+aa*a
if ss>a:
ans+=a
else:
ans+=ss
print(ans) | p02754 |
N,A,B=list(map(int,input().split()))
count=0
while N>0:
for i in range(A):
if N>0:
count+=1
N-=1
else:
break
for i in range(B):
if N>0:
N-=1
else:
break
print(count) | N,A,B=list(map(int,input().split()))
a=int(N//(A+B))
b=N%(A+B)
if b>A:
b=A
print((A*a+b)) | p02754 |
N,A,B = list(map(int,input().split()))
k = N//(A+B)
m = N%(A+B)
if m>=A:
n = A
else:
n = m
print((k*A+n)) | N,A,B = list(map(int,input().split()))
n = N//(A+B)
k = N%(A+B)
n1 = min(k,A)
print((A*n+n1)) | p02754 |
N,A,B = list(map(int,input().split()))
n = N//(A+B)
m = N%(A+B)
k = min(m,A)
print((n*A+k)) | N,A,B = list(map(int,input().split()))
a = N//(A+B)
b = N%(A+B)
if b>A:
print((a*A+A))
else:
print((a*A+b)) | p02754 |
N, A, B = input().rstrip().split(' ')
N = int(N)
A = int(A)
B = int(B)
n = int(N / (A+B)) * A
m = N % (A+B)
b = ''
r = ''
br = ''
for _ in range(A):
b += 'b'
for _ in range(B):
r += 'r'
br = b+r
print((n + br[:m].count('b'))) | N, A, B = input().rstrip().split(' ')
N = int(N)
A = int(A)
B = int(B)
n = int(N / (A+B)) * A
m = N % (A+B)
if m > A:
m = A
print((n + m)) | p02754 |
def main():
n,a,b = list(map(int,input().split()))
blue=""
red=""
for i in range(0,a):
blue+='b'
for i in range(0,b):
red+='r'
ans=""
while n>len(ans):
ans+=blue
ans+=red
print((ans[:n].count('b')))
main() | def main():
n,a,b = list(map(int,input().split()))
ans=0
count=int(n/(a+b))
ans+=count*a
amari=n-count*(a+b)
if amari <= a:
ans+=amari
else:
ans+=a
print(ans)
main() | p02754 |
L = input().split()
N = int(L[0])
A = int(L[1])
B = int(L[2])
blue = 0
for i in range(N):
if i % (A + B) >= 0 and i % (A + B) <= (A - 1):
blue += 1
print(blue) | In = input().split()
N = int(In[0])
A = int(In[1])
B = int(In[2])
x = N // (A + B)
y = N - (A + B)*x
ans = x * A
if y <= A:
ans += y
else:
ans += A
print(ans) | p02754 |
line = input().rstrip().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
i = 0
ans = 0
while i <= n:
if i + a <= n:
ans += a
else:
t = n - i
ans += t
i += a + b
print(ans) | line = input().rstrip().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
i = 0
ans = 0
t = int(n / (a + b))
ans = t * a
if n > (a + b) * t:
t2 = n - (a + b) * t
if t2 > a:
ans += a
else:
ans += n - (a + b) * t
print(ans) | p02754 |
N, A, B = list(map(int, input().split(' ')))
def main():
blue = red = 0
for i in range(10 ** 100):
blue += A
if blue + red > N:
blue -= blue + red - N
break
red += B
if blue + red > N:
red -= blue + red - N
break
return blue
print((main()))
| N, A, B = list(map(int, input().split(' ')))
def main():
blue = (N // (A+B)) * A
blue += min(A, N % (A+B))
return blue
print((main()))
| p02754 |
n, a, b = list(map(int, input().split()))
ans = 0
test = 0
while n > test:
test += a + b
if n >= test:
ans += a
else:
x = test - n
if x > b:
ans += a - (x - b)
else:
ans += a
print(ans) | n, a, b = list(map(int, input().split()))
q = n // (a + b)
x = a * q
w = n % (a + b)
if w >= a:
y = a
else:
y = w
ans = x + y
print(ans) | p02754 |
N, A, B = list(map(int, input().split()))
ball = []
import sys
cnt = 0
while 1:
for i in range(A):
ball += [0]
cnt += 1
if len(ball)==N:
print(cnt)
sys.exit()
for j in range(B):
ball += [1]
if len(ball)==N:
print(cnt)
sys.exit() | N, A, B = list(map(int, input().split()))
kaisu = N//(A+B)
n = N-((A+B)*kaisu)
if n >= A:
print((A*(kaisu+1)))
else:
print((A*kaisu+n)) | p02754 |
n,a,b = list(map(int, input().split()))
x = ''
y = ''
z = ''
zz =''
for i in range(a):
x = x + '0'
for i in range(b):
y = y + '1'
zz = x + y
for i in range(int(n/len(zz))+1):
z = z + x + y
print((z[:n].count('0'))) | n,a,b = list(map(int, input().split()))
x = n//(a+b)
y = n%(a+b)
z = 0
if y <= a :
z = y
else :
z = a
print((x*a+z)) | p02754 |
n, a, b = list(map(int, input().split()))
ans = 0
while n > 0:
if n >= a:
ans += a
n -= a
else:
ans += n
break
n -= b
print(ans) | n, a, b = list(map(int, input().split()))
ans = int(n/(a+b)) * a
if n%(a+b) <= a:
ans += n%(a+b)
else:
ans += a
print(ans) | p02754 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.