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:
#d=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
#import numpy as np
#n=int(input())
#li=input().split()
#import fractions
#n=int(input())
#S=input()
#import math

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

Submission status: Accepted

Solution code:
import math
import sys
sys.setrecursionlimit(10 ** 6 + 10)
from collections import defaultdict

def kari():
    map(int, input().split())

    num, num2 = map(int, input().split())
    data = [list(map(int, input().split())) for i in range(num2)]

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 _ in range(10):

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
r, d, x = map(int, input().split())
for i in range(10):
    x = r * x - d
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(B if A >= 13 else 0 if A <= 5 else int(B/2))
"""
r,D,x2000=map(int, input().split())
xNext=x2000*r-D
for i in range(10):
  print(xNext)
  xNext=xNext*r-D

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]

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

d = x2000
for i in range(10):
    # dp.append(r * x2000 - D)
    d = r * d - D
    print(d)

Submission status: Accepted

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

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


for i in range(10):
  x = next(r,d,x)
  print(x)

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [r, D, x] = [long(input_raw[0]), long(input_raw[1]), long(input_raw[2])]
    for i in range(10):
        x = r*x - D

        print x

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

r,D,x=MAP()

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def ii(): return int(stdin.readline())
def li(): return map(int, stdin.readline().split())

r, d, x = tuple(li())

def grow(x):
    return r * x - d
for i in range(10):
    x = grow(x)
    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())
x_i = r * x - D
print(x_i)
for i in range(9):
    x_i = r * x_i - D
    print(x_i)

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:
if __name__ == '__main__':
    [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, raw_input().split())

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

Submission status: Accepted

Solution code:
import sys

r, d, x0 = list(map(int, sys.stdin.readline().strip().split(" ")))
tmp = x0

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
#coding:utf-8
r, d, x = map(int, input().split())
tmp = x
for i in range(10):
    ans = r * tmp - d
    print(ans)
    tmp = 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:
import sys
range = xrange
input = raw_input

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

X = [xend]
while len(X)<11:
    X.append(X[-1]*r - d)
print '\n'.join(str(x) for x in 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, k = map(int, input().split())
for i in range(10):
        k = r*k - d
        print(k)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
#!venv/bin/python
 
import math
import numpy as np
import random
import copy
import statistics 
import bisect
import heapq
from collections import defaultdict 

r, D, x_s = [ int(x) for x in input().split() ]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions
from collections import deque

INF = 10 ** 10

r, D, x = [int(x) for x in stdin.readline().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):
    ans=(x*r-d)
    print(ans)
    x=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=list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

for _ in range(10):
    x = next(x)
    print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit

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

_x = x2000

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m, k = input().split()
R = int(n)
D = int(m)
X = int(k)

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

Submission status: Accepted

Solution code:


def read_input():
    r, d, x = map(int, input().split())
    return r, d, x


def submit():
    r, d, x = read_input()

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

    return

if __name__ == '__main__':
    submit()

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

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

Submission status: Accepted

Solution code:

r,d,x2000 = map(int,input().strip().split())

x2001 = r*x2000 - d
x2002 = r*x2001 - d
x2003 = r*x2002 - d
x2004 = r*x2003 - d
x2005 = r*x2004 - d
x2006 = r*x2005 - d
x2007 = r*x2006 - d
x2008 = r*x2007 - d
x2009 = r*x2008 - d
x2010 = r*x2009 - d

print(x2001)
print(x2002)
print(x2003)
print(x2004)
print(x2005)
print(x2006)
print(x2007)
print(x2008)
print(x2009)
print(x2010)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
rr = lambda: sys.stdin.readline().strip()
rri = lambda: int(rr())
rrs = lambda: [int(_) for _ in rr().split()]

r, D, x = rrs()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

def main():
    input = sys.stdin.readline
    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:
p = input().split()
r,d,x = int(p[0]),int(p[1]),int(p[2])
for i in range(10):
    x = r*x-d
    print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

r,d,x = li()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
ans = [0] * 10

ans[0] = R*X-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:
import sys
import math
from itertools import permutations
input = sys.stdin.readline

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

arr=[x]

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
    from math import gcd
except Exception:
    from fractions import gcd
readInt = lambda: int(sys.stdin.readline())
readIntN = lambda: [int(v) for v in sys.stdin.readline().split(' ')]



def main():
    # Failed to predict input format
    r, D, x = readIntN()
    for i in range(10):
        x = r * x - D
        print(x)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(10):

    x = r * x - d

    print(x)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# from sys import exit
r, D, x2000 = [int(n) for n in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = s_inpl()   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = inpl()	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import math
import copy
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from itertools import permutations
# 組み合わせ {}_len(seq) C_n: combinations(seq, n)
from itertools import combinations
from bisect import bisect_left, bisect_right
# import numpy as np

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W

# 四方向: 右, 下, 左, 上
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]

def i_inpl(): return int(input())
def s_inpl(): return map(int,input().split())
def l_inpl(): return list(map(int, input().split()))
INF = float("inf")

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

r, D, x = l_inpl()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x=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, raw_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(2000, 2010):
    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:
read = input 
rn = lambda :map(int, read().split())
r, d, x = rn()
for i in range(10):
    x = r * x - d
    print(x)

Submission status: Accepted

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

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

for i in range(1,11):
    x[i] = r * x[i-1] - d
    print(x[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:
listK = list(map(int,input().split()))
r = listK[0]
D = listK[1]
x0 = listK[2]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
# gcd
from fractions import gcd
# 切り上げ，切り捨て
# from math import ceil, floor
# リストの真のコピー（変更が伝播しない）
# from copy import deepcopy
# 累積和。list(accumulate(A))としてAの累積和
from itertools import accumulate
# l = ['a', 'b', 'b', 'c', 'b', 'a', 'c', 'c', 'b', 'c', 'b', 'a']
# S = Counter(l)  # カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
# print(S.most_common(2))  # [('b', 5), ('c', 4)]
# print(S.keys())  # dict_keys(['a', 'b', 'c'])
# print(S.values())  # dict_values([3, 5, 4])
# print(S.items())  # dict_items([('a', 3), ('b', 5), ('c', 4)])
# from collections import Counter
# import math
# from functools import reduce
#
# input関係の定義
# fin = open('in_2.txt', 'r')
# sys.stdin = fin
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


if __name__ == '__main__':
    r, D, x = mi()
    for i in range(10):
        x = r * x - D
        print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000


r,D,x = map(int,input().split())
ans = [0 for i in range(11)]
ans[0] = x
for i in range(10):
    ans[i+1] = r*ans[i]-D

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
input = sys.stdin.readline

# N = int(input())
# L = [int(x) for x in input().split()]
r, D, x = map(int, input().split())
# S = input()

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

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

solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

r,D,x = IL()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:


r,D,x2000=[int(c) for c in input().split()]

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

Submission status: Accepted

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

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


main()

Submission status: Accepted

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


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

xi = x2000

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
sp = input().split()
li = list(map(int,sp))

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

Submission status: Accepted

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

for i in range(2001, 2011):
    X = R * X - D
    print(X)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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:
def getlist():
	return list(map(int, input().split()))

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

Submission status: Accepted

Solution code:

from math import *

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(r, D, x2000):
    x = x2000
    for i in range(1, 10+1):
        x = r*x - D
        print(x)


def main():
    r, D, x2000 = read_int_n()
    (slv(r, D, x2000))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from itertools import product
import bisect
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}
# b = list(map(lambda x: math.ceil(x/10)*10, a))


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

Submission status: Accepted

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

Submission status: Accepted

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

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