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:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    r, d, start = mi()
    prev = start
    for _ in range(10):
        current = r * prev - d
        print(current)
        prev = current

if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

Solution code:
import sys

r,d,x2000 = map(int, input().split())
tmp = x2000
ans = ''

for y in range(2001, 2011):
    result = r * tmp - d
    tmp = result
    print(result)

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

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

Submission status: Accepted

Solution code:
import sys
r, D, x2000 = map(int, sys.stdin.readline().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,x=map(int,input().split())
A=[]


for i in range(1,11):
    B=r*x-D
    A.append(B)
    x=B
for s in A:
    print(s)

Submission status: Accepted

Solution code:
factor, sub, year = map(int, input().split())
weight = 0

for x in range(1, 11):
    if x == 1:
        weight = factor * year * x - sub
    else:
        weight = factor * weight - sub
    print(weight)

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())
X=[x0]
for _ in range(10):
  X.append(0)
for i in range(10):
  X[i+1]=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())

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

Submission status: Accepted

Solution code:

r,d,x2000 = map(int,input().split())
X = [x2000]

for i in range(10):
    X.append(r*X[i]-d)

for i in range(1,len(X)):
    print(X[i])

Submission status: Accepted

Solution code:
# B - Algae

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

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

Submission status: Accepted

Solution code:
# B - Algae

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

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

r, D, x = MAP()

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 a 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(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:
# ABC 127: B – Algae
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 i in range(10):
    ans = r*x - d
    print(ans)
    x = ans

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

Submission status: Accepted

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

xs = []
x = x2000
for _ in range(10):
    x = r*x - D
    xs.append(x)

print('\n'.join(map(str, xs)))

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    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, raw_input().split())
for _ in range(10):
    x=r*x-D
    print x

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
n=x
for i in range(10):
    print(r*n-d)
    n=r*n-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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  r, D, x = map(int, readline().split())
  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())
i = 0
for i in range(1,11):
    x = r*x-d
    print(x)
    i+=1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ans[0] = r * x2000 - d
print(ans[0])

for i in range(1, 10):
    ans[i] = r * ans[i - 1] - d
    print(ans[i])

Submission status: Accepted

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

Submission status: Accepted

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

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:
s = input().split()

r = int(s[0])
d = int(s[1])
x_i = int(s[2])

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
def saiki(r,x,d,number):
    number +=1
    if number <=2010:
        x = r*x-d
        print(x)
        saiki(r,x,d,number)
saiki(r,x,d,2000)

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:
def solve_127b(r, D, x):
    for i in range(10):
        x = r * x - D
        print(x)

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

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:
import sys
input = sys.stdin.readline
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(10):
    x=r*x-D
    print(x)

Submission status: Accepted

Solution code:
r,D,x=map(int,input().split())
count=0
while count<10:
    print(r*x-D)
    x=r*x-D
    count+=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())
y = []
y.append(x)
for i in range(10):
    print(r*y[i]-D)
    y.append(r*y[i]-D)

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

count=0
while count<=9:
    x=r*x-d
    print(x)
    count+=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())
y=[x]
for i in range(10):
  y.append(r*y[i]-d)
  print(y[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x_i_1 = (lambda r, D: lambda xi: r * xi - D)(r, D)


for i in range(1, 10 + 1):
    current = x_i_1(x2000) if i == 1 else x_i_1(prev)
    print(current)
    prev = current

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

R, D, X = lr()
for i in range(1, 11):
    X = R * X - D
    print(X)

Submission status: Accepted

Solution code:
r, D, x=map(int, input().split())
X=[0]*11
X[0]=x
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())
def weight(r,d,x):
  x_next = r*x-d
  return x_next
for y in range(10):
  x = weight(r,d,x)
  print(x)

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

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

for _ in range(10):
  x = calc_weight(r, d, x)
  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 sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

r,d,x0=MI()
answers=[]
x=x0
for i in range(10):
    x=r*x-d
    answers.append(x)
#print(answers)
for ans in answers:
    print(ans)

Submission status: Accepted

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

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:
import sys

# import bisect
# from collections import Counter, deque, defaultdict
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
from operator import attrgetter, itemgetter

# import math

# from numba import jit
# import numpy as np

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    r, d, x1 = list(map(int, readline().split()))

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


if __name__ == '__main__':
    q2()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    r, D, x_2000 = map(int, input().split())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# python 3.4.3
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# library
# -------------------------------------------------------------



# -------------------------------------------------------------
# main
# -------------------------------------------------------------

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

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

Submission status: Accepted

Solution code:
def main():

    r,d,x = tuple([int(t)for t in input().split()])

    xs = [x]
    for i in range(10):
        xs.append(xs[i]*r-d)

    for a in xs[1:]:
        print(a)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#B
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:
# n = int(input())
r,d,x = map(int,input().split())
# A = list(map(int,input().split()))
# An = [list(map(int,input().split())) for i in range(n)]

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

Submission status: Accepted

Solution code:
r, d, x = [int(_) for _ 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  = 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(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 i in range(10):
  x = r*x - d
  print(x)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    r,d,x=INTM()
    for i in range(10):
        x=r*x-d
        print(x)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

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 = 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())
A = [r*x-D]
print(A[0])
for i in range(9):
    print(r*A[i]-D)
    A.append(r*A[i]-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:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
r,d,x=iim()

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

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

Submission status: Accepted

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

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

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

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

    tmp = r*tmp-d

Submission status: Accepted

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

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

year=[None]*11
year[0]=x2000
for i in range(0, 10):
    print(next(year[i]))
    year[i+1]=next(year[i])

Submission status: Accepted

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

d = [0] * 11
d[0] = x

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

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

Submission status: Accepted

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


def main():
    r, D, x = list(map(int, input().split()))
    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, X_1 = input().split()
r = int(r)
D = int(D)
x = int(X_1)
for i in range(10):
  x = r * x - D
  print(str(x))

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def solve():
    N, M, L = map(int, input().split())
    
    a = L
    for i in range(10):
        a = N*a - M
        print(a)

# print(solve())

# def solve()が@return voidのとき
solve()

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
r,d,x = map(int,input().split())

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

for _ in range(10):
    print(solve(r,d,x))
    x = solve(r,d,x)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

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:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

r, D, x = MAP()

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

Submission status: Accepted

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

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
input=sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A , B , C = (map(int , input().split()))
a = (A*(C+(0*B))-B)
for i in range(10):
    print(a)
    a = ((A*a)-B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, D, x = [int(_) for _ 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 _ in range(10):
  x = r*x-d
  print(x)

Submission status: Accepted

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

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