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

Submission status: Accepted

Solution code:
# x_(i+1) = x_i * r - D を x_(2010)まで計算し、出力する
# 単純に上の式でループを回すだけ
r,d,x = map(int,input().split()) 
x_i = [x]*11 # x_(2000~2010)
for i in range(1,11,1):
  x_i[i] = x_i[i-1]*r - d
  print(x_i[i])

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:
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

Submission status: Accepted

Solution code:
r, d, x = list(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()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x_200i = r*x_2000 - D
print(x_200i)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from collections import deque

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [r, D, x] = string_to_int(inputs[0])

    ret = deque([x])
    for _ in range(0, 10):
        ret.append(r * ret[-1] - D)

    ret.popleft()
    ret_str = ""
    for i in ret:
        ret_str += "{:d}\n".format(i)
    ret_str.strip()

    return ret_str


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

for i in range(10):
    print(x_i[i + 1])

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

Submission status: Accepted

Solution code:
def cal_x(r,D,x,counter):
    y = r*x-D
    print(y)
    counter += 1
    if counter <10:
        cal_x(r,D,y,counter)


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

Submission status: Accepted

Solution code:
r, d, x2000 = map(int, input().split())
x = x2000
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(1, 11):
  x = r*x - D
  print (x)

Submission status: Accepted

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

N = 10
while(N):
    x_next = r * x - D
    x = x_next
    print(x)
    N -= 1

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

ls = [x]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(9):
    kusa_list.append(kusa_list[i]*r-d)

for kusa in kusa_list:
    print(kusa)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

L = [x]
add = int(0)
for i in range(10):
    L.append(add)
    L[i+1]=r*L[i]-D
    print(L[i+1])

Submission status: Accepted

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

x_before = x

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

Submission status: Accepted

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

num = x

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

Submission status: Accepted

Solution code:
r,d, x = map(int,input().split())
for a in range(1,11):
    y = x*r-d
    print('{}'.format(y))
    x = y

Submission status: Accepted

Solution code:
#ある池に生えている藻類は、以下のように成長します。
#西暦 i 年になる瞬間に生えている重さの合計を xi グラムとすると、 i≥2000 に対して、以下の式が成り立ちます:
#xi+1=rxi−Dr,
#D, x2000 が与えられます。x2001, ..., x2010 を計算し、順に出力してください。

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,10+1):
    ans = r*x-D
    print(ans)
    x = ans

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for n in lst:
    print(n)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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, x = [int(i) for i in input().split()]
i = 1
while i<=10:
  x = r*x - D
  print(x)
  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_list = [x]
for i in range(10):
    ans_list.append(r*ans_list[i]-d)
for i in range(1, 11):
    print(ans_list[i])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(0,10):
    x.append(r*x[i]-D)
    print(x[i+1])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split(" ")
r = int(data[0])
D = int(data[1])
x2000 = int(data[2])


def xn(n,xn1):
	return r*xn1-D

x = x2000

for n in range(10):
	x = xn(n,x)
	print(x)

Submission status: Accepted

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

x = x2000
for i in range(10):
  print('{}'.format(x*r-D))
  x = x*r-D

Submission status: Accepted

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

Submission status: Accepted

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

    for i in range(10):
        gram = gram_list[i]*r - d
        gram_list.append(gram)
        #print(gram)

    set(gram_list)
    for i in range(10):
        print(gram_list[i+1])

main()

Submission status: Accepted

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

Submission status: Accepted

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

r, D, x_2000 = map(int,input().split())
x = r * x_2000 - D
print(x)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x=[0]*11
for i in range(0,11,1):
    if i == 0:
        x[0] = x_2000
    elif i>0:
        x[i] =r*x[i-1] - D
        print(x[i])

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
def fib(n):
  if n == 0:
    return c
  else:
    return a * fib(n-1) -b
  
for i in range(10):
  print(fib(i+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,D,a=map(int,input().split())
mylist=[a]
for i in range(1,11):
    b = r*(mylist[i-1]) - D
    mylist.append(b)
for List in mylist[1:]:
  print(List)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#西暦i年の藻類x_iグラム
#x_i+1=r*x_i-D

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

res = []
res.append(x)

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

for p in range(1,len(res)):
    print(res[p])

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())
ans = []
num = x

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

for i in ans:
    print(i)

Submission status: Accepted

Solution code:
R_up, Down, First_number = map(int, input().split())
Tmp_number = First_number
for _ in range(10):
    Tmp_number = R_up*Tmp_number-Down
    print(Tmp_number)

Submission status: Accepted

Solution code:
from sys import stdin


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

x = []
x.append(r * x_2000 - D)
for i in range(1,10):
    x.append(r * x[i-1] - D)

for i in range(0,10):
    print(x[i])

Submission status: Accepted

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

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

xi = x0

for i in range(10):
    print(rec(xi))
    xi = rec(xi)

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
x_list = []
x_list.append(x)
for i in range(11):
    x_2 = r*x_list[i] -d
    x_list.append(x_2)

for i in range(10):
    print(x_list[i+1])

Submission status: Accepted

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

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:
import numpy as np

N = input().split(" ")
r = int(N[0])
D = int(N[1])
x = int(N[2])
y = []
y.append(r*x-D)
for i in range(9):
    print(y[i])
    y.append(r*y[i]-D)
print(y[len(y)-1])

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:
# using main() makes code faster from the point of view of "access to variables in global name-space"
# def main():

# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
import sys
sys.setrecursionlimit(10**7)
from itertools import accumulate, combinations, permutations # https://docs.python.org/ja/3/library/itertools.html
from math import factorial
def combinations_count(n, r):
    # faster than the following code
    # def combinations_count(n, r):
    #     return factorial(n) // (factorial(n - r) * factorial(r))
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n
    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]
    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot
    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])
    return result
def combination_with_repetition_count(n, r):
    return combinations_count(n + r - 1, r)
from collections import deque, Counter # https://docs.python.org/ja/3/library/collections.html#collections.deque
from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
from operator import itemgetter 
# ex1: List.sort(key=itemgetter(1))
# ex2: sorted(tuples, key=itemgetter(1,2))
from functools import reduce
from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
def gcds(numbers):
    return reduce(gcd, numbers)
def lcm(x, y):
    return (x * y) // gcd(x, y)
def lcms(numbers):
    return reduce(lcm, numbers, 1)

# first create factorial_list
# fac_list = mod_factorial_list(n)
INF = 10 ** 18
MOD = 10 ** 9 + 7
modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
def modinv(a, p = MOD):
    # evaluate reciprocal using Fermat's little theorem:
    # a**(p-1) is identical to 1 (mod p) when a and p is coprime
    return modpow(a, p-2, p)
def modinv_list(n, p = MOD):
    if n <= 1:
        return [0,1][:n+1]
    else:
        inv_t = [0,1]
        for i in range(2, n+1):
            inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
        return inv_t
def modfactorial_list(n, p = MOD):
    if n == 0:
        return [1]
    else:
        l = [0] * (n+1)
        tmp = 1
        for i in range(1, n+1):
            tmp = tmp * i % p
            l[i] = tmp
        return l
def modcomb(n, k, fac_list = [], p = MOD):
    # fac_list = modfactorial_list(100)
    # print(modcomb(100, 5, modfactorial_list(100)))
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    if len(fac_list) <= n:
        a = factorial(n) % p
        b = factorial(k) % p
        c = factorial(n-k) % p
    else:
        a = fac_list[n]
        b = fac_list[k]
        c = fac_list[n-k]
    return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
def modadd(a, b, p = MOD):
    return (a + b) % MOD
def modsub(a, b, p = MOD):
    return (a - b) % p
def modmul(a, b, p = MOD):
    return ((a % p) * (b % p)) % p
def moddiv(a, b, p = MOD):
    return modmul(a, modpow(b, p-2, p))


# initialize variables and set inputs
#initialize variables
    # to initialize list, use [0] * n
    # to initialize two dimentional array, use [[0] * N for _ in range(N)]
# set inputs
    # open(0).read() is a convenient method:
    # ex) n, m, *x = map(int, open(0).read().split())
    #     min(x[::2]) - max(x[1::2])
    # ex2) *x, = map(int, open(0).read().split())
    #     don't forget to add comma after *x if only one variable is used
# calculate and output
    # output pattern
    # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6

# functions used
r = lambda: sys.stdin.readline().strip() #single: int(r()), line: map(int, r().split())
R = lambda: list(map(int, r().split())) # line: R(), lines: [R() for _ in range(n)]
Rmap = lambda: map(int, r().split())

# set inputs
r_, d, x = R()
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 i in range(10):
    print(r * x - d)
    x = r * x - d

Submission status: Accepted

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

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

Submission status: Accepted

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

kechadon2000 = saitama2000 * r - D
koibumi2000 = kechadon2000 * r - D
yokuderu2000 = koibumi2000 * r - D
taberuna2000 = yokuderu2000 * r - D
kitasaitama2000 = taberuna2000 * r - D
toroban2000 = kitasaitama2000 * r - D
tendiku2000 = toroban2000 * r - D
EkiBEN2000 = tendiku2000 * r - D
X_DAY2000 = EkiBEN2000 * r - D
hayasaitama2000 = X_DAY2000 * r - D

print(kechadon2000)
print(koibumi2000)
print(yokuderu2000)
print(taberuna2000)
print(kitasaitama2000)
print(toroban2000)
print(tendiku2000)
print(EkiBEN2000)
print(X_DAY2000)
print(hayasaitama2000)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,D,x=map(int,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()]

x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)
x = r * x - d
print(x)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

for i in range (10) :
    num = mo(num)
    print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def func(r, x, d):
    return r * x - d

def main():
    r, d, x0 = map(int, input().split())

    lst = list()
    lst.append(x0)
    for i in range(0, 10):
        lst.append(func(r, lst[i], d))
    
    for it in lst:
        if (it == x0):
            continue
        print(it)
    
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, d, x2k = map(int, input().split())
x = x2k
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=list(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())
for i in range(2001, 2010 + 1):
    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 = list(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 = int(r*x - D)
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x_i = x_2000
x_j = 0
for i in range(10):
    x_j= r * x_i - D
    x_i = x_j
    print(x_j)

Submission status: Accepted

Solution code:
def solve(string):
    r, d, x = map(int, string.split())
    ans = []
    for _ in range(10):
        x = r * x - d
        ans.append(str(x))
    return "\n".join(ans)


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

xlist = []

xlist.append(r*x0-d)

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

x_current = x_2000

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

Submission status: Accepted

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

x = x0
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()]
def calu(r,D,x):
    X =x
    for j in range(10):
       X = r*X-D
       print(X)

calu(r,D,x)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, D, x_2000 = list(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, x0 = map(int, input().split())
x_tmp = x0
 
for i in range(1, 11):
  x = r * x_tmp - D
  x_tmp = x
  print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def calc(r, D, x):
  return (r * x) - D

for _ in range(10):
  x = calc(r, D, x)
  print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r_D_x2000 = input()

r = int(r_D_x2000.split(" ")[0])
D = int(r_D_x2000.split(" ")[1])
x2000 = int(r_D_x2000.split(" ")[2])

x = 0

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

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))
r = li[0]
D = li[1]
x2000 = li[2]
def a(x):
  return r * x - D

for i in range(10):
  x2000 = a(x2000)
  print(x2000)

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 a[1:11]:
    print(i)

Submission status: Accepted

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

for i in range(10):
  print(int((x0-d/(r-1))*pow(r,i+1)+d/(r-1)))

Submission status: Accepted

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