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:
import sys
input = lambda : sys.stdin.readline().rstrip()

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

ans = [x_2000]

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

for i in range(1, 11):
    print(ans[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:
def main():
    r, d, x = map(int, input().split())
    for i in range(10):
        x = r * x - d
        print(x)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

    print('\n'.join(map(str, ans[1:])))


resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ans = []
tmp = r*x - d
ans.append(tmp)
print(tmp)
for i in range(0,9):
  x_i = ans[i]
  tmp = r*x_i - d
  ans.append(tmp)
  print(tmp)

Submission status: Accepted

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

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(a) for a in input().split())
count = 0
while count <= 9 :
    x = r * x - D
    print(x)
    count += 1

Submission status: Accepted

Solution code:
# abc127_b.py
def rec(Xi,cnt):
    if cnt>=10:
        return

    Xnext = r*Xi-D
    print(Xnext)
    rec(Xnext,cnt+1)

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

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:
from sys import stdin
def LI(): return list(map(int,stdin.readline().rstrip().split()))

tmp = LI()
r,d,x = [tmp.pop(0) for _ in range(3)]

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

Submission status: Accepted

Solution code:
def solve():
  r, d, x = map(int, input().split())
  for i in range(10):
    x = r*x-d
    print(x)
  return 0
 
if __name__ == "__main__":
  solve()

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

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:
r,D,x = map(int, input().split())
for index 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(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):
    n = r*n - d
    print(n)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor

def main():
    #N, M = map(int, input().split())
    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:
def main() -> None:
    r, D, x = 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):
  x = r*x - D
  print(x)

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, D, x2000 = map(int, input().split())
result = []
for i in range(10):
  if i == 0:
    result.append(r*x2000-D)
    continue
  result.append(r*result[i-1]-D)
[print(i) for i in result]

Submission status: Accepted

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


def main():
    r, D, x2000 = [int(i) for i in input().split()]
    xi = x2000
    for i in range(10):
        xi = r * xi - D
        print(xi)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)

def main():
    r, d, x = 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): x=(x*r)-d; print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
from collections import Counter 
from collections import defaultdict
from collections import deque
import math
import itertools
import heapq
import sys
sys.setrecursionlimit(10**6)

#n=int(input())
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
input_list = lambda : list(map(int,input().split()))


a,b,c=input_list()
before=c
for _ in range(10):
    now=before*a-b
    print(now)
    before=now

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

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def mass(r, D, x):
    return r*x - D


r, D, x = map(int, input().split())
for _ in range(10):
    x = mass(r, D, x)
    print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy
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_ne = r*x-D
  print(x_ne)
  x = x_ne

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
r,d,x=map(int,stdin.readline().split())
ans=x 
for _ in range(10):
    ans=(r*ans)-d 
    print(ans)

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
import bisect
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#####BitCount#####
def bit_count(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#############
# Main Code #
#############

r,d,x = inputIL()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    r, D, Xtt = map(int, input().split())
    ans = Xtt
    for i in range(10):
        ans = r*ans - D
        print(ans)

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:
def main():
    inp=list(map(lambda x:int(x),input().split()))
    r=inp[0]
    D=inp[1]
    x=inp[2]

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

    for i in res_array:
        print(i)


if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
r,D,x = map(int,input().split())
l = [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:
a,b,c=map(int,input().split())
ans=[c]
for i in range(10):
    ans.append(ans[i]*a-b)
    print(ans[i+1])

Submission status: Accepted

Solution code:
r, d, x2000 = list(map(int, input().split()))
# x = list(map(int, input().split()))
# abc = [int(input()) for i in range(5)]
# n = int(input())
# n, m = list(map(int, input().split()))
x = [x2000]
for i in range(10):
    b = r*x[i]-d
    x.append(b)
    print(b)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import math
import bisect


def main():
    r, d, x = map(int, input().split())
    A = []
    for _ in range(10):
        x = r * x - d
        A.append(x)
    for a in A:
        print(a)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=0
while d<10:
  c=a*c-b
  print(c)
  d+=1

Submission status: Accepted

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

Submission status: Accepted

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

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

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

ans = [None]*11
ans[0] = x

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

Submission status: Accepted

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


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


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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(10):
  d=a*c-b
  print(d)
  c=d

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


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

x2001 = r*x2000-D

print(x2001)

xx = x2001

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

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:
# B - Algae

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

Submission status: Accepted

Solution code:
x = [None]*11

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

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

Submission status: Accepted

Solution code:
def algae(r, d, x):

    ans = []
    count = x
    for i in range(1, 11):
        count = r*count - d
        ans.append(count)
    return ans

def main():
    r, d, x = map(int, input().split())
    ans = algae(r, d, x)
    for i in ans:
        print(i)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
R, D, X = map(int, input().split())

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

Submission status: Accepted

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

for j in range(1,11):
  print(X[j])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# B
r, d, x = map(int, input().split())
xi = [[] for i in range(11)]
xi[0] = x
for i in range(10):
    xi[i + 1] = xi[i] * r - d
xi = xi[1:11]
print(*xi, sep='\n')

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

resolve()

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)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
r, d, x = map(int, input().split())
x_list = [0] * 11
x_list[0] = x
for i in range(10):
    x_list[i+1] = (r * x_list[i]) - d
for _ in range(10):
    print(x_list[_+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(r * y[i] - d)

Submission status: Accepted

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

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

Submission status: Accepted

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

def f(i):
  if i==0:
    return x
  else:
    return r*f(i-1)-d

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

Submission status: Accepted

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

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

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())
t = 2000
while t <= 2009:
  x = r*x-d
  print(x)
  t += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#入力
r, D, x0 = list(map(int,input().split()))
#数列xのリストを作っておく
x = [None for _ in range(10)]
#数列xの初項をリスト中に加えておく
x.insert(0,x0)
#与えられた数列に従い代入する, 結果
for i in range(1,11):
  x[i] = r * x[i-1] - D
  print(x[i])

Submission status: Accepted

Solution code:
r, D, x0 = list(map(int,input().split()))
x = [None for _ in range(10)]
x.insert(0,x0)
for i in range(1,11):
  x[i] = r * x[i-1] - D
  print(x[i])

Submission status: Accepted

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

for i in range(1, 11):
  print(r*x2000-D)
  x2000 = r*x2000-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:
import sys
import math
from collections import Counter
import itertools
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################

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

Submission status: Accepted

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

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

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:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
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):
    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, A = map(int, input().split())

for i in range(10):

    A = r * A - D
    print(A)

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

def X(n):    
    if n == 1:return x_2000
    else:return r*X(n-1)-d
lis=[X(n) for n in range(2,12)]
[print(i) for i in lis]

Submission status: Accepted

Solution code:
A,B,C = list(map(int,input().split()))
for i 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(1, 11):
  x = r * x - D
  print(x)

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(0,10):
  X[i+1] = r*X[i] - D
  
  
print(X[1])
print(X[2])
print(X[3])
print(X[4])
print(X[5])
print(X[6])
print(X[7])
print(X[8])
print(X[9])
print(X[10])

Submission status: Accepted

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

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

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

Submission status: Accepted

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

for i in ls:
    print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
r, d, x = [int(n) for n in input().split()]
for _ 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):
    ans.append(ans[i] * r - D)
    print(ans[i + 1])