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:
r, D, x = map(int, input().split())
for _ in range(10):
    ans = r * x - D
    print(ans)
    x = ans

Submission status: Accepted

Solution code:
r,D,x = map(int,input().split())
ans = [0]*10

for i in range (1,11):
	if i == 1:
		ans[0] = r*x-D
		print(ans[0])
	else:
		ans[i-1] = r*ans[i-2]-D
		print(ans[i-1])

Submission status: Accepted

Solution code:
R, D, X = map(int, open(0).read().split())
X = R * X - D
for i in range(10):
    print(X)
    X = R * X - D

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 calc(r,d,x,i):    
    x_n = r*x-d
    print(x_n)
    if i == 9:    
        return 1
    else:
        return calc(r, d, x_n,i+1)


calc(r,D,x2000,0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x2000 = map(int, input().split())
y=x2000
i=1
while i<11:
    u = r*y - d
    print(r*y - d)
    y = u
    i+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x=list(map(int, input().split()))
memo={0:x}
for i in range(10):
  memo[i+1]=memo[i]*r -(d)
for i in memo:
  if i!=0:
    print(memo[i])

Submission status: Accepted

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

Submission status: Accepted

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

X = [0]*10
X.insert(0,x)

for i in range(10):
    X[i+1] = r*X[i]-D

for i in range(1,len(X),1):
    print(X[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, x2000 = map(int, input().split())

xh = x2000

for _ in range(10):
  xi = r*xh - d
  print(xi)
  xh = xi

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:
num = list(map(int,input().split()))
length = num[2]
for i in range(10):
	print(num[0]*length-num[1])
	length = num[0]*length-num[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())
lst = [x]

for i in range(11):
    lst.append(r * lst[i] - D)

[print(lst[i]) for i in range(1, 11)]

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
A=[x]
for i in range(10):
  A.append(A[i]*r-d)
  print(A[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=map(int,input().split())
ans = [x]
for i in range(10):
    ans.append(ans[i]*r - D)
ans.pop(0)
for j in range(len(ans)):
    print(ans[j])

Submission status: Accepted

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

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 = list(map(int, input().split()))

x_ = [0] * 10

for i in range(10):
    if i == 0:
        x_[i] = r*x - D
    else:
        x_[i] = r*x_[i-1] - D
    print(x_[i])

Submission status: Accepted

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

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 = r * x2000 - d
for i in range(10):
  print(x)
  x = r * x - d

Submission status: Accepted

Solution code:
def cal(r,D,x):
    while True:
        x = r*x - D
        yield x

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

cnt = 0
for x in cal(r,D,x):
    print(x)
    cnt += 1
    if(cnt == 10):
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
r = a
d = b
x_init = c
result = []

def main(_r, _d, _x, _i):
    result.append(int(_r) * int(_x) - int(_d))
    return result[_i]

for i in range(10):
    if i == 0:
        main(r, d, x_init, i)
    else:
        main(r, d, result[i - 1], i)
    print(result[i])

Submission status: Accepted

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

old_x = x_2000
for i in range(10):
    new_x = r * old_x - D
    print(new_x)
    old_x = new_x

Submission status: Accepted

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

Submission status: Accepted

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

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:
(A, B, C), = [list(map(int, s.split())) for s in open(0)]
last_g = C
for i in range(10):
    g = A * last_g - B
    last_g = g
    print(g)

Submission status: Accepted

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

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

print(*ans[1:])

Submission status: Accepted

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

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

Submission status: Accepted

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

current = r * x - D
print(current)

for i in range(9):
    current = r * current - D
    print(current)

Submission status: Accepted

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

Submission status: Accepted

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

x = [0] * 11
x[0] = x0

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

ans = []

A2001 = ((r * (X2000) ) - D)

ans.append(A2001)

for i in range(9):
    A = ( (r * (ans[i])) - D )
    ans.append(A) 
    
for i in ans:
    print(i)

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:
a = 1
A,B,C = map(int,input().split())
for _ in range(10):
  C = C * A-B
  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, x2000 = map(int, input().split())

Ans = list()

for i in range(11):
    if i == 0:
        Ans.append(x2000)
    else:
        Ans.append(r*Ans[i-1] - d)
        print(Ans[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:
a,b,c = map(int, input().split())
x=c
for i in range(10):
  x=a*x-b
  print(x)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
x0=c
x1=a*c-b
x2=a*(x1-x0)+x1
x3=a*(x2-x1)+x2
x4=a*(x3-x2)+x3
x5=a*(x4-x3)+x4
x6=a*(x5-x4)+x5
x7=a*(x6-x5)+x6
x8=a*(x7-x6)+x7
x9=a*(x8-x7)+x8
x10=a*(x9-x8)+x9

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:
a,b,c=map(int,input().split())
for i in range(10):
  print(a*c-b)
  c=a*c-b

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())
lst=[x]
for i in range(10):
    lst.append(r*lst[-1]-D)
for i in range(1,11):
    print(lst[i])

Submission status: Accepted

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

Submission status: Accepted

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

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

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,x0 = map(int, input().split())
for i in range(10):
  x0 =r*x0-d
  print(x0)

Submission status: Accepted

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

x =[x0]

for i in range(1,11):
    x.append(x[i-1]*r -D)
print(*x[1:11], sep='\n')

Submission status: Accepted

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

count = 0
while count < 10:
  x = r*x-d
  print(x)
  count += 1

Submission status: Accepted

Solution code:
# 15:29
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):
    x=r*x-D
    print(x)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
ans=[0]*10
ans[0]=r*x-d
for i in range(1,10):
    ans[i]=r*ans[i-1]-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(x)

Submission status: Accepted

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

for i in range(2001, 2011):
    x = r*x-d
    print(x)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Sum = x_2000

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

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
ans = 0
for i in range(10):
  if i == 0:
    ans = r * x -d
    print(ans)
  else:
    ans = r * ans - 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(x)

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 _ in range(1, 11):
  print(r*x - D)
  x = r*x - D

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = x

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

Submission status: Accepted

Solution code:
r,D,x_2000 = map(int,input().split())
x = x_2000
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:
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(
            think(2, 10, 20),
            [30, 50, 90, 170, 330, 650, 1290, 2570, 5130, 10250]
        )

    def test_2(self):
        self.assertEqual(
            think(4, 40, 60),
            [200, 760, 3000, 11960, 47800, 191160, 764600, 3058360, 12233400, 48933560]
        )


def solve():
    r, d, x = read()
    result = think(r, d, x)
    write(result)


def read():
    return read_int(3)


def read_int(n):
    return read_type(int, n)


def read_float(n):
    return read_type(float, n)


def read_type(t, n):
    return list(map(lambda x: t(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(r, d, x):
    length = 10
    result = [x]
    for i in range(length):
        result.append(result[-1] * r - d)
    return result[1:]


def write(result):
    for r in result:
        print(r)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
r=l[0]
D=l[1]
x=l[2]
t=[x]
for i in t:
  m=i*r-D
  t.append(m)
  if(len(t)==11):
    break
for p in t[1:]:
	print(p)

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_2000 = map(int, input().split())

ans = []
ans.append(x_2000)
for i in range(1, 11):
  ans.append(r * ans[i-1] - D)
  print(ans[i])

Submission status: Accepted

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

W = X
for i in range(10):
  W = r*W-d
  print(W)
  X +=W

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    r, d, x = rli()
    nx = x
    for i in range(10):
        nx = r*nx-d
        print(nx)


if __name__ == '__main__':
    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,x2000=map(int,input().split())
S=[0]*20
S[0]=x2000
for i in range(1,11):
  S[i]=(S[i-1]*r-D)
  print(S[i])

Submission status: Accepted

Solution code:
def main():
    i = list(map(int, input().split()))

    if i[0] < 2 or 5 < i[0]:
        return
    if i[1] < 1 or 100 < i[1]:
        return
    if i[2] <= i[1] or i[1] > 200:
        return

    for j in range(10):
        a = i[0] * i[2] - i[1]
        print(a)
        i[2] = a 

if __name__ == "__main__":
    main()

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())
for _ in range(10):
    x = r * x2000 - D
    print(x)
    x2000 = x

Submission status: Accepted

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

a = [x]

for i in range(1, 11):
    a.append(r * int(a[i-1]) - d)
    print(a[i])

Submission status: Accepted

Solution code:
r,D,x=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import numpy as np
def print_ans(r, D, x):
    """Test Case
    >>> print_ans(2, 10, 20)
    30
    50
    90
    170
    330
    650
    1290
    2570
    5130
    10250
    >>> print_ans(4, 40, 60)
    200
    760
    3000
    11960
    47800
    191160
    764600
    3058360
    12233400
    48933560
    """
    for _ in range(10):
        x = r * x - D
        print(x)

if __name__ == '__main__':
    r, D, x = map(int, input().rstrip().split())
    print_ans(r, D, x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, C,B = map(int, input().split())

for i in range(1,11):
    kotae=A*B-C
    print(kotae)
    B=kotae

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):
  x = r * x - D
  print(x)

Submission status: Accepted

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

X = [x]
for i in range(10):
    ans = r*X[i]-D
    X.append(ans)
    print(ans)

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
num = 1
while num<=10:
    print(r*x-d)
    x = r*x-d
    num += 1

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):
    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().split() )
for _ in range(10):
  x = r*x - D
  print( int(x) )

Submission status: Accepted

Solution code:
from collections import defaultdict,deque, Counter
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
ans = 0


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

Submission status: Accepted

Solution code:
x=[0]*11
r,d,x[0]=map(int,input().split())

for i in range(10):
  x[i+1]=x[i]*r-d

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

Submission status: Accepted

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

for i in range(2001,2011):
    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:
# ABC 127: B – Algae
r, d, x2000 = [int(s) for s in input().split()]

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

Submission status: Accepted

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

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):
  s = r*x-d
  print(s)
  x = s

Submission status: Accepted

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

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

x = x2000

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def gcd(a, b):
    # greatest common divisor
    while b > 0:
        a, b = b, a % b

    return a


r, d, x = inpl()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

pre = x

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

def main():
    r,D,x=map(int,input().split())
    l=[x]
    for i in range(10):
        l.append(l[i]*r-D)
    l=list(map(str,l))
    print(' '.join(l[1:]))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 2019-11-13 08:30:54(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np 

def main():
    r, d, x0 = [int(x) for x in sys.stdin.readline().split()]
    x = x0
    for _ in range(10):
        x = r * x - d
        print(x)

if __name__ == "__main__":
    main()

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):
	x = r*x -D
	print(x)

Submission status: Accepted

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

prv=x_2000
for i in range(10):
  v=r*prv-D
  print(v)
  prv=v

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

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

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 _ in range(10):
    x = r*x-D
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = list(map(int, input().split()))
r = tmp[0]
d = tmp[1]
x0 = tmp[2]

xn = [0] * 11
xn[0] = x0
for i in range(1,11):
  xn[i] = r * xn[i-1] - d
  print (xn[i])

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
l = [r * x - D]
print(r * x - D)
for i in range(9):
  l.append(r * l[-1] - D)
  print(l[-1])

Submission status: Accepted

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

Submission status: Accepted

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

xi = x
ans = []
for i in range(2001,2011):
  xi = r * xi - D
  ans.append(xi)

for i in ans:
  print(i)

Submission status: Accepted

Solution code:
growth_rate, decayed_weight, initial_weight  = map(int, input().split(" "))

def calc(weight):
    return growth_rate * weight - decayed_weight

weight = initial_weight
for _ in range(10):
    weight = calc(weight)
    print(weight)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    r,d,x=map(int,input().split())
    A=[0]*11
    A[0]=x
    for i in range(10):
        A[i+1]=r*A[i]-d
    for i in range(1,11):
        print(A[i])
resolve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-

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,x0=map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

r,d,x = inpl()
a = [0] * 11
a[0] = x
for i in range(10):
    a[i+1] = a[i] * r - d
print(*a[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, x2000 = map(int, input().split())
x = [x2000]
for i in range(10):
  x.append(x[i] * r - D)
  print(x[i+1])

Submission status: Accepted

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

_x = x_2000
for i in range(10):
    _res = r * _x - D
    print(_res)
    _x = _res

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())
li=[0]*10
li[0]=(r*x)-d
for i in range(1,10):
  li[i]=(r*li[i-1])-d

for j in range(0,10):
  print(li[j])

Submission status: Accepted

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

x = [x2000]

for i in range(10):
  x.append(r*x[i]-d)
x.pop(0)
for i in x:
  print(i)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
[r,d,x0]=map(int,raw_input().split())

a = [x0]
for i in range(10):
	a += [r * a[-1] - d]
	print a[-1]

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())
x_=[x]
for i in range(10):
  y=r*x_[i]-D
  print(y)
  x_ +=[y]

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

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

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(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 main():
    r, D, x2000 = map(int, input().split())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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

    return


# Generated by 1.1.6 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())

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

Submission status: Accepted

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

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