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:
data=input().split()
r=int(data[0])
D=int(data[1])
x=int(data[2])
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]*10
for i in range(10):
  if i == 0:
    x[i] = r*x2000-D
    print(x[i])
  else:
    x[i] = r*x[i-1]-D
    print(x[i])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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 _ 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 main():
    r, D, x = map(int, input().split())
    ans = []
    for _ in range(10):
        x = r * x - D
        ans.append(str(x))
    print("\n".join(ans))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

r, d, x = rm()
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 = (int(x) for x in input().split())
Disp = [0]*11
Disp[0] = x
for T in range(0,10):
    Disp[T+1] = r*Disp[T]-D
print('\n'.join(str(x) for x in Disp[1:]))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    r,D,x = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列

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




if __name__ == "__main__":
    main()

Submission status: Accepted

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

ans=[0 for i  in range(10)]
ans[0]=initial*r-D


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

for anss in ans:
    print(anss)

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 n in range(10):
  X = R*X-D
  print(X)

Submission status: Accepted

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

for n in range(10):
  a = R*a-D
  print(a)

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:
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
from decimal import Decimal
from operator import mul

INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)


# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
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

# 組合せnCr
def combinations_count(n, r):
    if n < r:
        return 0
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# 素数判定
def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True


# limit以下の素数を列挙
def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P

# 同じものを含む順列
def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        # set（集合）型で重複を削除、ソート
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

# ここから書き始める
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):
    a = r * x - d
    print(a)
    x = a

Submission status: Accepted

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

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

Submission status: Accepted

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

x_2001 = r *x_2000 -D

memo = {2000: x_2000, 2001: x_2001}


def zen(n, x, r, D):
    x.append(r *x[n -1] -D)
    return x

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

Submission status: Accepted

Solution code:
import math
import sys
input = sys.stdin.readline
X = [int(_) for _ in range(2500)]
r, d, x = map(int, input().split())
X[2000] = x
for i in range(2001, 2011):
    X[i] = r * X[i - 1] - d
[print(X[i]) for i in range(2001,2011)]

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)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
r,d,x_s = map(int,input().split())
x = x_s
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:
#!/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(1,11):
  x=r*x-d;print(x)

Submission status: Accepted

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

arr = [0] * 11
arr[0] = x 
for x in range(0,10):
    arr[x+1] = r * arr[x] - d
    print(arr[x+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
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(10):
    X = X*R - D
    print(X)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def mo(i):
    if i == 0:
        return x0
    return r*mo(i-1) - d 

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

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

Submission status: Accepted

Solution code:
cnt = 0
def f(n,r,d):
  global cnt
  n = r*n-d
  print(n)
  cnt += 1
  if cnt < 10:
  	f(n,r,d)
r,d,x = map(int,input().split())
f(x,r,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):
    print(r*x-D,sep="")
    x=r*x-D

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import itertools
x=[0]*1000
r,D,x[0]=map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict

# import fractions

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    r, D, x = il()

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

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:
def x_i(r,D,x):
    return r*x-D

try:
    r,D,x_2000=map(int, input().split())
    assert 2<=r<=5 and 1<=D<=100 and D<x_2000<=200

    for i in range(2001,2011):
        print(r*x_2000-D)
        x_2000=r*x_2000-D
except AssertionError:
    print('')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

#a = int(input())
#b = list(map(int, input().split()))
r, d, x = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

ans = []
for i in range(1,11):
    x = r*x - d
    ans.append(x)
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:
arr = input().split()
r = int(arr[0])
d = int(arr[1])
x = int(arr[2])

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
def f(n):
  if(n==2000):
    return(c);
  return(a*(f(n-1))-b)
for i in range (2001,2011):
  print(f(i))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
r,D,x2000 = (int(i) for i in input().split())
x =[0]*11
x[0] =x2000
for i in range(10):
    x[i+1] =r*x[i] -D
    print(x[i+1])

Submission status: Accepted

Solution code:
inp=input()
list=inp.split()
r,D,x=list[0], list[1], list[2]
for i in range(10):
  ans=(int(x)*int(r))-int(D)
  x=ans
  print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
r,D,x=map(int,input().split())
for _ in range(10):
    x=r*x-D
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

for _ in range(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:
# 127 B

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import sys
a=sys.stdin.readline()
res = [int(i) for i in a.split() if i.isdigit()] 
r,D,x2000 = [res[i] for i in (0,1,2)]
if (r>=2 and r<=5) and (D>=1 and D<=100) and (x2000>D and x2000<=200):
    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)
else:
    print("Error")

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60


def main():
    r, D, x = map(int, readline().split())
    for _ in range(10):
        x = r * x - D
        print(x)
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
c = [int(i) for i in input().split() if i.isdigit()] 
for i in range(1,11):
    c[2] = (c[0] * c[2]) - c[1]
    print(c[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
listr=[]
while len(listr)<=9:
  x=r*x-d
  listr.append(x)
  
[print(i) for i in listr]

Submission status: Accepted

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

def getx(f):
      return r*f-d

for i in range(2001, 2011):
      x = getx(x)
      print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

l = [s]
for i in range(1,11):
    xi = algae(r, D, l[i-1])
    l.append(xi)
    print(xi)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())

a=X

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

def num(i):
    return r*i-D

a = x
for i in range(10):
    a = num(a)
    print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
r,d,x = map(int, raw_input().split(' '))
q = 10
while(q):
  x = r*x - d
  print x
  q-=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:
import sys

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


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

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def actual(r, D, x_2000):
    x_list = []
    x_n = x_2000

    for _ in range(1, 10 + 1):
        x_next = r * x_n - D
        x_n = x_next

        x_list.append(x_next)

    return '\n'.join([str(x) for x in x_list])

r, D, x_2000 = map(int, input().split())
print(actual(r, D, x_2000))

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
r, d, x = M()
temp = x
for _ in range(10):
    a = temp*r-d
    temp = a
    print(a)

Submission status: Accepted

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

for i in range(10):
    print(p[i])

Submission status: Accepted

Solution code:

def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print(yes if b else no)
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
# from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx as nx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
r,d,x = n1()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,t,x=map(int,input().split())
a=r*x-t
b=r*a-t
c=r*b-t
d=r*c-t
e=r*d-t
f=r*e-t
g=r*f-t
h=r*g-t
i=r*h-t
j=r*i-t
print(a)
print(b)
print(c)
print(d)
print(e)
print(f)
print(g)
print(h)
print(i)
print(j)

Submission status: Accepted

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

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