Problem:


Score : 200 points

Problem Statement

The development of algae in a pond is as follows.

Let the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:

x_{i+1} = rx_i - D

You are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.

Constraints

2 ≤ r ≤ 5

1 ≤ D ≤ 100

D < x_{2000} ≤ 200

All values in input are integers.

Input

Input is given from Standard Input in the following format:

r D x_{2000}

Output

Print 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.

Sample Input 1

2 10 20

Sample Output 1

30
50
90
170
330
650
1290
2570
5130
10250

For example, x_{2001} = rx_{2000} - D = 2 \times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \times 30 - 10 = 50.

Sample Input 2

4 40 60

Sample Output 2

200
760
3000
11960
47800
191160
764600
3058360
12233400
48933560



Sample input:
2 10 20


Sample output:
30
50
90
170
330
650
1290
2570
5130
10250

Submission status: Accepted

Solution code:
# coding: utf-8
# user: herp_sy

import math
import statistics

# fact(int)
def fact(n):
  if(n == 1):
    return 1
  else:
    return (n * fact(n - 1))

# gcd(int,int)
def gcd(a,b):
  if a == 0:
    return b
  elif b == 0:
    return a
  else:
    return gcd(b,a % b)

# lcm(int,int)
def lcm(a,b):
  return (a * b / gcd(a,b))

# qsort(array[])
def qsort(seq):
  if len(seq) < 1:
      return seq
  pivot = seq[0]
  left = []
  right = []
  for x in range(1, len(seq)):
    if seq[x] <= pivot:
        left.append(seq[x])
    else:
        right.append(seq[x])
  left = qsort(left)
  right = qsort(right)
  foo = [pivot]
  return (left + foo + right)

# , = map(int, input.split())
#  = int(input())
x = []
r,d,xs = map(int, input().split())
x.append(xs)
for i in range(0,10):
  x.append(r * x[i] - d)  
  print(x[i + 1])

Submission status: Accepted

Solution code:
[r,d,x] = [int(i) for i in input().split()]
for i in range(1,11):
  x = r*x - d
  print(x)

Submission status: Accepted

Solution code:
def main():
    r, d, current_x = [int(x) for x in input().rstrip().split(" ")]

    for i in range(10):
        current_x = (current_x * r) - d
        print(current_x)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
for i in range(10):
  c=a*c-b
  print(c)

Submission status: Accepted

Solution code:
r,D,x_0 = map(int,input().split())

x = [x_0]

def x_(r,elem,D):
    return r*elem - D

for i in range(10):
    x.append(x_(r,x[i],D))
for i in range(1,11):
    print(x[i])

Submission status: Accepted

Solution code:
r,d,x = map(int, input().split())
A = [x]
B = []
for i in range(10):
    A.append(r*A[i]-d)
    B.append(r*A[i]-d)
print(*B, sep = '\n')

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())

for i in range(10):
    x = r*(x) - d
    print(x)

Submission status: Accepted

Solution code:
r, d, x_2000 = map(int, input().split())
x = x_2000
for i in range(10):
  x = r * x - d
  print(x)

Submission status: Accepted

Solution code:
r, D, x2000 = map(int, input().split())

def saiki(x):
    return r*x - D

now = x2000
for i in range(10):
    x = saiki(now)
    print(x)
    now = x

Submission status: Accepted

Solution code:
r, D, x_2000 = map(int,input().split())
x = x_2000
i = 0
while i < 10:
    ans = r* x - D
    print(ans)
    x = ans
    i += 1

Submission status: Accepted

Solution code:
INPUT = input().split()
r = int(INPUT[0])
D = int(INPUT[1])
X = int(INPUT[2])

XX = []

ans = ""
XX.append(X)

i = 0
while i < 10:
    v = r * XX[i] - D
    XX.append(v)
    ans = ans + str(XX[i + 1]) + '\n'
    i += 1

print(ans)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
for i in range(10):
    x = (r*x) - D
    print(x)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split(" "))
ans = a * c - b
print(ans)
for i in range(9):
    ans *= a
    ans -= b
    print(ans)

Submission status: Accepted

Solution code:
r, d, x = [int(elem) for elem in input().split()]

for i in range(0, 10):
  x = r * x - d
  print(x)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split()) 
for _ in range(10): 
    x = r*x - d
    print(x)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().rstrip().split())

for _ in range(10):
    x = x * r - D
    print(x)

Submission status: Accepted

Solution code:
r ,D , x = map(int,input().split())
def func(r, D, x):
    return r * x - D

for i in range(10):
    print(func(r,D,x))
    x = func(r,D,x)

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())

for i in range(10):
    x = r*x-d
    print(x)

Submission status: Accepted

Solution code:
r, D, x2000 = map(int, input().split())
for i in range(10):
  x2000 = r*x2000-D
  print(x2000)

Submission status: Accepted

Solution code:
r, D, x_2000 = map(int, input().split())
for i in range(10):
    x_next = r * x_2000 - D
    print(x_next)
    x_2000 = x_next

Submission status: Accepted

Solution code:
r,D,x=map(int,input().split())
for i in range(1,11):
    x=r*x-D
    print(x)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
 
for i in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

Solution code:
r,d,x = map(int, input().split())

for i in range(10):
    x = x * r - d
    print(x)

Submission status: Accepted

Solution code:
l = input().split()
r = int(l[0])
d = int(l[1])
x = int(l[2])
for i in range(0, 10):
    x = r * x -d
    print(int(x))

Submission status: Accepted

Solution code:
r , D, x = map(int, input().split())
for i in range(10):
    print(r*x-D)
    x = r*x-D

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())

for i in range(10):
    n=r*x-d
    print(n)
    x=n

Submission status: Accepted

Solution code:
r,D,x = map(int,input().split())

for i in range(10):
    ans = r*x-D
    print(ans)
    x = ans

Submission status: Accepted

Solution code:
r,D,x = list(map(int,input().split()))
res = r*x - D
for i in range(10):
  print(res)
  res = res*r - D

Submission status: Accepted

Solution code:
r,D,x=list(map(int,input().split()))
for n in range(10):
  x=r*x-D
  print(x)

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())

def ike(n,r,d,x):
    if n == 0:
        return x
    return r*ike(n-1,r,d,x)-d

if __name__ == "__main__":
    for i in range(10):
        print(ike(i+1,r,d,x))

Submission status: Accepted

Solution code:
r,D , x = (int(x) for x in input().split())


def answer(r, d, x):
    return r*x - D


for i in range(10):
    x = answer(r, D, x)
    print(x)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
answerL=[]
index=0
while index < 10:
    newX = r*x-d
    answerL.append(newX)
    x = newX
    index+=1
for answer in answerL:
    print(answer)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
num = [x]
for i in range(10):
    tmp = num[i]*r - d
    num.append(tmp)
    
for i in range(1, len(num)):
    print(num[i])

Submission status: Accepted

Solution code:
r,D,x2000=map(int, input().split())

c=x2000
for i in range(2001,2011):
	c = r * c - D
	print(c)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
for i in range(10):
    x = (r * x) - d
    print(x)

Submission status: Accepted

Solution code:
r, D, x = list(map(int, input().split()))
for i in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

Solution code:
r,D,x_2000 = map(int,input().split())
x_ = x_2000

for i in range(10):
  x_ = r * x_ - D
  print(x_)

Submission status: Accepted

Solution code:
r, d, x = [int(i) for i in input().split()]

for i in range(10):
  x = r*x - d
  print(x)

Submission status: Accepted

Solution code:
r, d, x = [int(i) for i in input().split()]

for i in range(10):
  x = r*x - d
  print(x)

Submission status: Accepted

Solution code:
r, D, x = [int(x) for x in input().split()]

for _ in range(10):
  x = r*x - D
  print(x)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())

for i in range(10):
    x = r * x - d
    print(int(x))

Submission status: Accepted

Solution code:
def input_from_console():
    r, d, x2000 = map(int, input().split())
    return r, d, x2000


def solve(r, d, x2000):
    x_prev = x2000
    x_list = []
    for i in range(10):
        x = r * x_prev - d
        x_list.append(x)
        x_prev = x
    return x_list


def main():
    r, d, x2000 = input_from_console()
    x_list = solve(r, d, x2000)
    print('\n'.join(map(str, x_list)))


if __name__ == "__main__":
    import sys
    if sys.gettrace():  # If in debug mode or not.
        check_cases()
    else:
        main()

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
y=0
for i in range(10):
    y=r*x - d
    print(y)
    x = y

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
for a in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

Solution code:
def algae(r,d,x):
    for i in range(10):
        x = r*x-d
        print(x)    
r,d,x = map(int, input().split())
algae(r,d,x)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())

ans = []

for i in range(10):
        x = r * x - d
        ans.append(x)
        print(x)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
xs = [x]
for i in range(10):
    xs.append(xs[-1] * r - d)
print("\n".join(map(str, xs[1:])))

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split(" "))

for i in range(10):
  x = r * x - d
  print(x)

Submission status: Accepted

Solution code:
r,d,x =map(int,input().split())
for i in range(10):
    x = r*x-d
    print(x)

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
for i in range(10):
    x = r * x - d
    print(int(x))

Submission status: Accepted

Solution code:
r,d,x = map(int, input().split())
ans = r*x-d
print(ans)
for i in range(9):
    ans = r*ans -d
    print(ans)

Submission status: Accepted

Solution code:
rdx = input().split()

r = int(rdx[0])
d = int(rdx[1])
x = int(rdx[2])

for i in range(10):
    x = r * x - d
    print(x)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
def f(x, r = r, D = D):
    return r*x - D
for i in range(10):
    x = f(x)
    print(x)

Submission status: Accepted

Solution code:
r, d, x = tuple(int(i) for i in input().split(" "))


def a():
    n = x
    while True:
        num = r * n - d
        yield num
        n = num


gen = a()
for i in range(10):
    num = next(gen)
    print(num)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
for _ in range(10):
  x = r*x - D
  print(x)

Submission status: Accepted

Solution code:
r, D, x=map(int, input().split())
for i in range(10):
    print(r*x-D)
    x=r*x-D

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
for k in range(10):
  x = r*x -d
  print(x)

Submission status: Accepted

Solution code:
#abc127b

r,d,x=map(int,raw_input().split())
i=10
while i:
 res=r*x-d
 print res
 x=res
 i-=1

Submission status: Accepted

Solution code:
r,D,x = map(int,input().split())
for i in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

Solution code:
r, D, x = [int(t) for t in input().split()]
ans = x
for i in range(10):
    ans = r*ans - D
    print(ans)

Submission status: Accepted

Solution code:
r, D, x_2000= map(int, input().split(' '))
xs = [x_2000]
for x in range(10):
	xs.append(r*xs[len(xs)-1]-D)
xs.pop(0)
print('\n'.join(map(str, xs)))

Submission status: Accepted

Solution code:
def input_from_console():
    r, d, x2000 = map(int, input().split())
    return r, d, x2000


def solve(r, d, x2000):
    x_prev = x2000
    x_list = []
    for i in range(10):
        x = r * x_prev - d
        x_list.append(x)
        x_prev = x
    return x_list


def main():
    r, d, x2000 = input_from_console()
    x_list = solve(r, d, x2000)
    print('\n'.join(map(str, x_list)))

if __name__ == "__main__":
    DEBUG = False
    if not DEBUG:
        main()

Submission status: Accepted

Solution code:
r,D,x = map(int,input().split())

for i in range(10):

    x = x *r -D
    print(x)

Submission status: Accepted

Solution code:
r,d,x0 = map(int, input().split())

t = x0
for i in range(10):
	t = r*t-d
	print(t)

Submission status: Accepted

Solution code:
r,D,x2000 = map(int,input().split())

L = [x2000]

for i in range(10) :
    calc = r*L[-1] - D
    L.append(calc)

print(*L[1:], sep="\n")

Submission status: Accepted

Solution code:
r, d, x2000 = list(map(int, input().split()))
x = x2000
for i in range(10):
  x = r*x -d
  print(x)

Submission status: Accepted

Solution code:
r,D,x=map(int,input().split())
tmp=x
for i in range(10):
    print(r*tmp-D)
    tmp=r*tmp-D

Submission status: Accepted

Solution code:
r, D, x0 = list(map(int, input().split()))
for i in range(10):
  x1 = r * x0 - D
  x0 = x1
  print(x1)

Submission status: Accepted

Solution code:
# ABC127B - Algae
r, d, x = list(map(int, input().rstrip().split()))
for i in range(10):
    x = r * x - d
    print(x)

Submission status: Accepted

Solution code:
r, D, x = [int(s) for s in input().split()]

for _ in range(10):
  x = r * x - D
  print(x)

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
for i in range(10):
  x*=r
  x-=d
  print(x)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())

for i in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

Solution code:
r, d, x = list(map(int, input().split()))
for i in range(10):
    x = r * x - d
    print(x)

Submission status: Accepted

Solution code:
N = 10
R, D, X2000 = map(int,input().split())
for i in range(N):
  X2000 = (X2000 * R) - D
  print(X2000)

Submission status: Accepted

Solution code:
R, D, X2000 = [int(i) for i in input().split()]
ans = [R * X2000 - D]
for _ in range(9):
    ans.append(R * ans[-1] - D)
print('\n'.join(map(str, ans)))

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
y = 0
for _ in range(10):
    y = r*x - d
    x = y
    print(y)

Submission status: Accepted

Solution code:
def abc127b():
    r, D, x2k = (int(s) for s in input().split(" "))
    x = x2k
    for n in range(2001, 2011):
        x = r * x - D
        print(x)
def main():
    abc127b()
main()

Submission status: Accepted

Solution code:
r, D, x = list(map(int, input().split()))
for i in range(10):
  x = r*x-D
  print(x)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())

for i in range(10) :
    x = r * x - D
    print(x)

Submission status: Accepted

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


def solve(r, D, x_2000):
    temp = x_2000
    for i in range(2001, 2010+1):
        temp = r * temp - D
        print(temp)
        

# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    r, D, x_2000 = map(int, input().split())
    solve(r, D, x_2000)
    # Failed to predict input format
    pass

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
a = 0
for i in range(10):
    a = r*x-d
    x = a
    print(a)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
for _ in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

Solution code:
r,D,x2000 = map(int,input().split())
x = x2000
for i in range(10):
  x = x * r - D
  print(x)

Submission status: Accepted

Solution code:
r, D, x_2000 = list(map(int, input().split()))
sum_glass = x_2000
for i in range(1, 11):
    sum_glass = sum_glass*r - D
    print(sum_glass)

Submission status: Accepted

Solution code:
r,D,x = [int(n) for n in input().split()]
for i in range(10):
  print(r*x - D)
  x = r*x - D

Submission status: Accepted

Solution code:
s=input().split()
r=int(s[0])
d=int(s[1])
x=int(s[2])

for i in range(10):
    x=r*x-d
    print(x)

Submission status: Accepted

Solution code:
r,d,xi = map(int, input().split())

def f(x):
    return r*x - d
  
if __name__=="__main__":
    xii = xi
    for _ in range(10):
        xii = f(xii)
        print(xii)

Submission status: Accepted

Solution code:
x,y,z=input().split()
x=int(x)
y=int(y)
z=int(z)
for i in range(10):
  z = x * z - y
  print(z)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
for i in range(0, 10):
  x = r*x - D
  print(x)

Submission status: Accepted

Solution code:
r, D, init = map(int, input().split())
for i in range(10):
  ans = init*r - D
  print(ans)
  init = ans

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
for i in range(10):
  s[2]=s[0]*s[2]-s[1]
  print(s[2])

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
for i in range(10):
	x=r*x-d
	print(x)

Submission status: Accepted

Solution code:
import sys

r, D, x2000 = map(lambda x: int(x), sys.stdin.readline().split(" "))

prev = x2000
for i in range(0, 10):
    ret = r * prev - D
    print(ret)
    prev = ret

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split());exec('x=r*x-d;print(x);'*10)

Submission status: Accepted

Solution code:
r, d, x = [int(i) for i in input().split()]
for i in range(10):
    x = r*x -d
    print(x)

Submission status: Accepted

Solution code:
str = input().split()

r = int(str[0])
D = int(str[1])
x2000 = int(str[2])

for i in range(10):
  print(r*x2000-D)
  x2000 = r*x2000-D

Submission status: Accepted

Solution code:
#coding:utf-8
r,D,x = map(int,input().split())
x2001 = r * x - D
x2002 = r * x2001 - D
x2003 = r * x2002 - D
x2004 = r * x2003 - D
x2005 = r * x2004 - D
x2006 = r * x2005 - D
x2007 = r * x2006 - D
x2008 = r * x2007 - D
x2009 = r * x2008 - D
x2010 = r * x2009 - D
print(x2001)
print(x2002)
print(x2003)
print(x2004)
print(x2005)
print(x2006)
print(x2007)
print(x2008)
print(x2009)
print(x2010)

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
for i in range(10):
    x=X=r*x-d
    print(X)

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))

for i in range(1,11):
    c *= a
    c -= b
    print(c)

Submission status: Accepted

Solution code:
r, D, x2000 = map(int, input().split())
lst = []
prev = x2000
for _ in range(10):
    ans = r * prev - D
    lst.append(ans)
    prev = ans

for i in lst:
    print(i)

Submission status: Accepted

Solution code:
import sys

def main():
    r,D,x2k=input().split()

    moGram(r,D,x2k,2010)


def moGram(r, D, x2k, i) :

    if i == 2000 :
        return x2k
    else :
        oldGram = moGram(r, D, x2k, i-1) 
        gram = int(r)*int(oldGram) - int(D)
        print(gram)
        return gram

main()

Submission status: Accepted

Solution code:
r,D,x = [int(i) for i in input().split()]
n=2000
X=r*x-D
x=X
while n <=2009: 
  print(x) 
  X=r*x-D
  x=X
  n=n+1

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

def solve(r: int, D: int, x: int):
    arr = []
    arr.append(x)
    for i in range(10):
        arr.append(r * arr[i] - D)
        print(arr[i + 1])
    

# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    x = int(next(tokens))  # type: int
    solve(r, D, x)



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r,d,x=map(int, input().split())
a=[0]*11
a[0]=x
for i in range(1,11):
  a[i]=r*a[i-1]-d
for i in range(1,11):
  print(a[i])

Submission status: Accepted

Solution code:
import sys

a, b, c = map(int, input().split())

x = a*c -b

for i in range(0,10):	
	print(x)
	x = a*x-b

Submission status: Accepted

Solution code:
R,D,X=input().split()
r=int(R)
d=int(D)
x0=int(X)
x1=r*x0-d
x2=r*x1-d
x3=r*x2-d
x4=r*x3-d
x5=r*x4-d
x6=r*x5-d
x7=r*x6-d
x8=r*x7-d
x9=r*x8-d
x10=r*x9-d
print(x1)
print(x2)
print(x3)
print(x4)
print(x5)
print(x6)
print(x7)
print(x8)
print(x9)
print(x10)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
2<=r<=5
1<=D<=100
D<=x<=200
i = 1

while i <= 10 :
    x = r*x - D
    i += 1
    print(x)

Submission status: Accepted

Solution code:
R, D, X =  list(map(int,input().split()))


for i in range(10):
    print(R*X-D)
    X=R*X-D

Submission status: Accepted

Solution code:
#coding utf-8
r,D,s=map(int,input().split())
x =[0 for i in range(11)]
x[0]=s

for i in range(1,11):
  x[i]=r*x[i-1]-D
  print(x[i])

Submission status: Accepted

Solution code:
def spaceinput():
    return list(map(int,input().split(" ")))

r,D,xx=spaceinput()

for i in range(10):
    
    xx=xx*r-D
    print(xx)

Submission status: Accepted

Solution code:
r,D,x = input().split()

for i in range(10):
  i = i + 1
  x = int(r) * int(x) - int(D)
  print(x)

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np

def main(args):
    r = int(args[0])
    d = int(args[1])
    x = int(args[2])
    ar = np.zeros([10], dtype=int)

    ar[0] = r*x-d
    for i in range(1,len(ar)):
        ar[i] = r*ar[i-1]-d

    for i in ar:
        print(i)

if __name__ == "__main__":
    main(stdin.readline().rstrip().split())

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
for i in range(10):
  x = r * x - d
  print(x)

Submission status: Accepted

Solution code:
r, d, x=map(int, input().split())
for _ in range(10):
	x=r*x-d
	print(x)

Submission status: Accepted

Solution code:
r,D,x2000 = map(int, input().split())
def algae(x2000):
    #for i in range(10):
        ans = r * x2000 - D
        #new_ans = algae(r, D, ans)
        
        return ans
      
next_value = algae(x2000)
for i in range(10):
    print(next_value)
    next_value = algae(next_value)

Submission status: Accepted

Solution code:
# coding: utf-8

import sys

r, D, x = map(int, sys.stdin.readline().split(" ", 3))

for i in range(10):
    x = r * x - D
    print("%s"%x)

Submission status: Accepted

Solution code:
r, D, X = map(int, input().split())


def calcWeight(r, D, X, stepper):
    if stepper == 10:
        return X
    weight = r*X-D
    stepper += 1
    print(weight)
    return calcWeight(r, D, weight, stepper)


calcWeight(r, D, X, 0)

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())

for i in range(1,11):
    new_x=r*x-d
    print(new_x)
    x=new_x

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())

sum = x
for i in range(10):
    sum = r*sum-d
    print(sum)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split(' '))
for i in range(10):
    xx = r * x - D
    print(xx)
    x = xx

Submission status: Accepted

Solution code:
# coding:utf-8
if __name__=='__main__':
  r,D,x = map(int, input().split())
  for i in range(10):
    x = r*x-D
    print(x)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
for i in range(10):
    nextx = r * x - d
    print(nextx)
    x = nextx

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
s = []
a = x
for i in range(10):
    b = r * a - d
    s.append(b)
    a = b

for i in range(10):
    print(s[i])

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())


for i in range(10):
  print(r * x - d)
  x = r * x - d

Submission status: Accepted

Solution code:
R, D, X2000 = map(int, input().split(" "))

x = X2000
for i in range(10):
    x = R*x - D 
    print(x)

Submission status: Accepted

Solution code:
a,b, c = map(int, input().split())
now = 0
for num in range(10):
    if num == 0:
        now = a * c -b
    else:
        now = a * now -b
    print(now)

Submission status: Accepted

Solution code:
a,b,c=input().split()
aa = int(a)
cc = int(c)
bb = int(b)
for i in  range(10):
    d= aa * cc - bb
    cc = d
    print (int(d))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
x = a*c - b
print(x)
for i in range(1, 10):
  x = a*x - b
  print(x)

Submission status: Accepted

Solution code:
r,D,x2000=map(int,input().split())
x2001=r*x2000-D
x2002=r*x2001-D
x2003=r*x2002-D
x2004=r*x2003-D
x2005=r*x2004-D
x2006=r*x2005-D
x2007=r*x2006-D
x2008=r*x2007-D
x2009=r*x2008-D
x2010=r*x2009-D
print(x2001)
print(x2002)
print(x2003)
print(x2004)
print(x2005)
print(x2006)
print(x2007)
print(x2008)
print(x2009)
print(x2010)

Submission status: Accepted

Solution code:
r, D, x2000 = map(int,input().split())
tmp = x2000
for i in range(10):
  X = r * tmp - D
  tmp = X
  print(X)

Submission status: Accepted

Solution code:
r, D, x2000 = [int(i) for i in input().split()]

xNext = r * x2000 - D;
for i in range(10):
    print(xNext);
    xNext = r * xNext - D;

Submission status: Accepted

Solution code:
def main():
    r, d, x = map(int, input().split())
    for i in range(10):
        x = r * x - d
        print(x)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#input
x = [0,0,0,0,0,0,0,0,0,0,0] #先頭は x_2000
r, D, x[0] = list(map(int, input().split()))
for i in range(1,11):
    x[i] = r * x[i-1] - D

#output
for i in range(1,11):
    print(x[i])

Submission status: Accepted

Solution code:
r,d,a=map(int,input().split())
x=a
for i in range(10):
  x=r*x-d
  print(x)

Submission status: Accepted

Solution code:
import sys
a, b, c = map(int, raw_input().split())
i=0
while 1:
  c = a*c - b
  print c
  i = i + 1
  if i > 9 :
      sys.exit()

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())

def calu_weight(r, d, x):
    return r*x-d

w_l = []

for i in range(0,10):
    if i == 0:
        #初期値使用(xはinput)
        w_l.append(calu_weight(r,d,x))
        print(calu_weight(r,d,x))
    else:
        w_l.append(calu_weight(r,d,w_l[i-1]))
        print(calu_weight(r,d,w_l[i-1]))

Submission status: Accepted

Solution code:
r, D, x2000 = [int(x) for x in input().split(' ')]

x = x2000
for i in range(10):
  x = r * x - D
  print(x)

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())

ans = x
for i in range(10):
    ans = ans*r - d
    print(ans)

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
for i in range(10):
    x = r * x - d
    print(str(x))

Submission status: Accepted

Solution code:
import sys

r,D,x2000= (int(i) for i in input().split(" "))  
x=x2000
for i in range(10):
    x=r*x-D
    print(x)

Submission status: Accepted

Solution code:
r, D, x0 = map(int, input().split())

def algae(r, D, x0):
    x = x0
    for i in range(10):
        x = r * x - D
        print(x)

algae(r, D, x0)

Submission status: Accepted

Solution code:
x={}
i=list(map(int,input().split()))
for s in range(10):
  x[s]=int((i[2]-(i[1]/(i[0]-1)))*i[0]**(s+1)+(i[1]/(i[0]-1)))
  print(x[s])

Submission status: Accepted

Solution code:
r,D,x=[int(i) for i in input().split()]
for i in range(10):
    x = int((r*x) - D)
    print(x)

Submission status: Accepted

Solution code:
r, D, x = (int(i) for i in input().split())

for i in range(10):
  x = r*x-D
  print(x)

Submission status: Accepted

Solution code:
from sys import stdin

r, d, x2000 = [int(x) for x in stdin.readline().rstrip().split()]

ans = x2000
for i in range(10):
  ans = r * ans - d
  print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
     
r, d, x = map(int, input().split())

for i in range(10):
    x = r * x - d
    print(int(x))

Submission status: Accepted

Solution code:
r,d,x = map(int, input().split())
for i in range(10):
  x =r*x-d
  print(x)

Submission status: Accepted

Solution code:
r,D,zero=list(map(int,input().split()))
one=r*zero-D
two=r*one-D
three=r*two-D
four=r*three-D
five=r*four-D
six=r*five-D
seven=r*six-D
eight=r*seven-D
nine=r*eight-D
ten=r*nine-D
print(one)
print(two)
print(three)
print(four)
print(five)
print(six)
print(seven)
print(eight)
print(nine)
print(ten)

Submission status: Accepted

Solution code:
i=list(map(int,input().split()))
n=0
a=i[2]
while True:
  a=a*i[0]-i[1]
  print(a)
  n=n+1
  if n==10: 
    break

Submission status: Accepted

Solution code:
r,D,x=map(int,input().split())
for i in range(10):
  x = x * r - D
  print(x)

Submission status: Accepted

Solution code:
r, d, x=map(int, input().split())


a=r*x-d
b=r*a-d
c=r*(b-a)+b
d=r*(c-b)+c
f=r*(d-c)+d
g=r*(f-d)+f
h=r*(g-f)+g
i=r*(h-g)+h
j=r*(i-h)+i
k=r*(j-i)+j

v=[a,b,c,d,f,g,h,i,j,k]
for i in v:
    print(i)

Submission status: Accepted

Solution code:
r,D,x = map(int, input().split())

for i in range(10):
    x = r*x - D
    print(x)

Submission status: Accepted

Solution code:
r,D,x = map(int, input().split())

#x(i+1)=r*x(i)−D

for i in range(10):
  print(r*x-D)
  x=r*x-D

Submission status: Accepted

Solution code:
r,D,x_2000=input().split()

r=int(r)
D=int(D)
x=int(x_2000)
for i in range(10):
    x=r*x-D
    print(x)

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
for i in range(10):
    x = r * x - d
    print(x)

Submission status: Accepted

Solution code:
r, D, x = [int(_) for _ in input().split()]

for j in range(10):
  x = r * x - D
  print(x)

Submission status: Accepted

Solution code:
def calc():
    i_list = input().split()
    r = int(i_list[0])
    d = int(i_list[1])
    x2000 = int(i_list[2])

    x_last = x2000

    for i in range(1,11):
        x_next = x_last * r - d
        print(x_next)
        x_last = x_next

    return


if __name__ == '__main__':
    calc()

Submission status: Accepted

Solution code:
r, d, x = (int(i) for i in input().split())

for i in range(10):
  x = r * x - d
  print(x)

Submission status: Accepted

Solution code:
def calc1():
  A=list(map(int,input().split()))
  r=A[0]
  D=A[1]
  x=A[2]
  B=[]
  g=(r*x)-D
  B.append(g)
  for z in range(1,10):
    C=B[z-1]
    g=(r*C)-D
    B.append(g)
  
  for x in range(len(B)):
    print(B[x])
    
if __name__=="__main__":
  calc1()

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
prev_x = x
for i in range(10):
  x = r*prev_x - D
  print(x)
  prev_x = x

Submission status: Accepted

Solution code:
r,D,x=list((map(int,input().split())))
for _ in range(10):
    x=x*r-D
    print(x)

Submission status: Accepted

Solution code:
r, D, x2000 = map(int, input().split())
xi = x2000
ans = 0
for i in range(2001, 2011):
    ans = r * xi - D
    print('{}'.format(ans))
    xi = ans

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
inputData = input()
r, D, x2000 = map(int, inputData.split())

x = []


def dfx(r, D, xLast):
    ans = xLast * r - D
    x.append(ans)
    if (len(x)) < 10:
        dfx(r, D, ans)
    else:
        for i in range(len(x)):
            print(x[i])


x = dfx(r, D, x2000)

Submission status: Accepted

Solution code:
import collections
import math 
N,A,B = map(int, input().split())
s = B
for i in range(10):
    s = s*N-A
    print(s)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    r,D,x = map(int,input().split())
    xs = list()
    xs.append(x)
    for i in range(10):
        xst = r*xs[i]-D
        xs.append(xst)
        if i != 0:
            print(xs[i])
    print(xs[10])
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r , d , now = map(int,input().split())
for i in range(10):
  nex = r * now - d
  print (nex)
  now = nex