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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

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:
#ABC127-B
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
r,d,x=IL()
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:
# -*- coding:utf-8 -*-

def solve():
    r, D, x2000 = list(map(int, input().split()))
    x = [0] * 11
    x[0] = x2000
    for i in range(1, 11):
        x[i] = r*x[i-1] - D
        print(x[i])

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

Submission status: Accepted

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

Submission status: Accepted

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


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heappush,heappop
import re

def int_raw():
    return int(input())

def ss_raw():
    return input().split()

def ints_raw():
    return list(map(int, ss_raw()))

INF = 1<<29


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

Submission status: Accepted

Solution code:
r, D, x = list(map(int, input().split()))
for 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 = 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())
Box = []
Box.append(x)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

sys.setrecursionlimit(10000)
INF = float('inf')


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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

r, d, a = na()
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 [0]*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:
import sys
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def II(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def SI(): return input()
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')

r, D, x = LI()

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

Submission status: Accepted

Solution code:
import sys


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


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

Submission status: Accepted

Solution code:
from collections import defaultdict as ddic, deque, Counter
from itertools import permutations, combinations, product
import bisect, heapq

rr = raw_input
rri = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())

def solve(r, D, x):
    ans = []
    for i in xrange(10):
        x = r * x - D
        ans.append(x)
    return ans
ans = solve(*rrm()) 
print "\n".join(map(str, ans))

Submission status: Accepted

Solution code:
r, d ,x = map(int, input().split())
array = []
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:
def getN():
    return int(input())

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

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())

r,D,x = inpl()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

if __name__ == '__main__':
    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,xt = map(int,input().split())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

if __name__=="__main__":
    solve()

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(y) for y in input().strip().split()]
for i in range(10):
  x = r*x-d
  print(x)

Submission status: Accepted

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

ans = [x2000]

for i in range(10) :
    ans.append(ans[-1]*r - D)
ans.pop(0)
print(*ans,sep="\n")

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  r,d,x0=LI()
  for i in range(10):
    x=r*x0-d
    print(x)
    x0=x

main()
# print(main())

Submission status: Accepted

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

from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20; INF = float("INF"); ans = 0; tmp = 0; ansli = []; tmpli = []; candili = []
eps = 1.0 / 10 ** 10; mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]; ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]; ddn9 = ddn + [(0, 0)]
"""for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:"""
def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]#WideIntPoint
def ws(): return sys.stdin.readline().split()
def i(): return int(sys.stdin.readline())
def s(): return input()
def hi(n): return [i() for _ in range(n)]
def hs(n): return [s() for _ in range(n)]#HeightString
def mi(n): return [wi() for _ in range(n)]#MatrixInt
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]

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

Submission status: Accepted

Solution code:


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#! python3
#  solve127A.py

age,cost = map(int,input().split())

if age <= 5:
    cost = 0
elif 6 <= age <= 12:
    cost = cost//2
elif 7 <= age:
    cost = cost

print(cost)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
lmax = 0
rmin = 10**5
for i in range(M):
    L, R = map(int, input().split())
    lmax = max(lmax, L)
    rmin = min(rmin, R)
ans = rmin - lmax
if ans >= 0:
    print(ans + 1)
else:
    print(0)

Submission status: Runtime Error

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: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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


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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
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: Runtime Error

Solution code:
import sys
r, D, x2000 = map(int, sys.stdin.readline().split())
x2001 = r * x2000 - D
x2002 = r * x2001 - D
x2003 = r * x2002 - D
x2004 = r * x2003 - D
x2005 = r * x2004 - D
x2006 = r * x2005 - D
x2007 = r * x2006 - D
x2008 = r * x2007 - D
x2009 = r * x2008 - D
x2010 = r * x2009 - D
print(x2001)
print(x2002)
print(x2003)
print(x2004)
print(x2005)
print(x2006)
print(x2007)
print(x2008)
print(x2009)
print(x20010)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r = int(input())
d = int(input())
x = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main()
{
    int I,d,r,x1,x2,x3,x4,x5 ,x6 ,x7 ,x9 ,x8 ,x10;
    cin >> I>> d>>r;
    x1=r*I-d;
    x2=r*x1-d;
    x3=r*x2-d;
    x4=r*x3-d;
    x5=r*x4-d;
    x6=r*x5-d;
    x7=r*x6-d;
    x8=r*x7-d;
    x9=r*x8-d;
    x10=r*x9-d;
    cout << x1 <<endl;
    cout <<x2 <<endl;
    cout <<x3 <<endl;
    cout <<x4 <<endl;
    cout <<x5 << endl;
    cout <<x6 <<endl;
    cout <<x7 <<endl;
    cout <<x8 <<endl;
    cout <<x9<<endl;
    cout <<x10<<endl;






    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
import math

# input

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

xans = np.ones(10)

def Linear_Recursive(x, r, D, N):
    
    if N==0:
        xans = x
        return xans
    
        
    
    xans = r*Linear_Recursive(x, r, D, N-1) - D # linear eq.
    
    return xans
  
for i in range(10):
    xans[i] = Linear_Recursive(x, r, D, i+1)
    
    pritnt(x[i])

Submission status: Runtime Error

Solution code:
import numpy as np
import math

# input

r, D, x = [float(_) for _ in input().split()]

xans = np.ones(10)

def Linear_Recursive(x, r, D, N):
    
    if N==0:
        xans = x
        return xans
    
        
    
    xans = r*Linear_Recursive(x, r, D, N-1) - D # linear eq.
    
    return xans
  
for i in range(10):
    xans[i] = Linear_Recursive(x, r, D, 10)
    
    pritnt(x[i])

Submission status: Runtime Error

Solution code:
import numpy as np
import math

# input

r, D, x = [float() for _ in input().split()]

xans = np.ones(10)

def Linear_Recursive(x, r, D, N):
    
    if N==0:
        xans = x
        return xans
    
        
    
    xans = r*Linear_Recursive(x, r, D, N-1) - D # linear eq.
    
    return xans
  
for i in range(10):
    xans[i] = Linear_Recursive(x, r, D, 10)
    
    pritnt(x[i])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

x_ = [0] * 10

for i in range(10):
    if i == 0:
        x_[i] = r*x - D
    else:
        x_[i] = r*x[i-1] - D
    print(x_[i])

Submission status: Runtime Error

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

for i in range(10) :
  x = rx + D
  print(x)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
l=list(map(int,input().split()))
r=l[0]
D=l[1]
x=l[2]
t=[x]
for i in t:
  m=i*r-D
  t.append(m)
  if(len(t)=11):
    break
for p in t[1:]:
	print(p)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

tmp = r * x - D
print(tmp)

for i in range(1 to 10):
  tmp = tmp * x - D
  print(temp)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

def func(a):
    return r*func(a-1) - D

for i in range(10):
  print(func(x))

Submission status: Runtime Error

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

def func(a):
    return r*func(a-1) - D

for i in range(10):
  func(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
r, D, x = [int(i) for i in input().split()]
i = 1
whie i<=10:
  x = r*x - D
  print(X)
  i += 1

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x + 1 = rx - d

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

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

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

Solution code:
!/work/yota509/env_python3/bin/python3                                                              
# -*- coding: utf-8 -*-                                                                              


def read_input():
    a,b,c=map(int, input().split())
    if 2<=a<=5 and 1<=b<=100 and b<c<=200:
        return a,b,c
    else :
        print("Error")
        exit()

def main():
    num = 10
    # r=None                                                                                         
    # d=None                                                                                         
    # x=None                                                                                         

    r,D,x=read_input()
    sum_x=x

    for i in range(num):
        sum_x=r*sum_x-D
        print(sum_x)
        sum_x=sum_x



if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
if a <= 5:
  print('0')
else:
  if a <= 12:
    print(int(b/2))
  else:
    print(b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
str = input().split()

r = int(str[0])
D = int(str[1])
x2000 = int(str[2])

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

Submission status: Runtime Error

Solution code:
#coding:utf-8
r,D,x = map(int,input().split())
x2001 = r * x - 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
X = '''x2001
x2002
x2003
x2004
x2005
x2006
x2007
x2008
x2009
x2010'''
print(int(X))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r,D,x2000 = map(int, input().split())
next_value = algae(x2000)
for i in range(10):
    #next_value = algae(x2000)
    print(next_value)
    next_value = algae(next_value)

Submission status: Runtime Error

Solution code:
from sys import stdin
import numpt as np

def main(args):
    r = args[0]
    d = args[1]
    x = args[2]
    ar = np.zeros([10])

    ar[0] = r*x-d
    for i in range(1,len(ar)):
        ar[i] = r*ar[i-1]-d

    for i in ar:
        print(i)

if __name__ == "__main__":
    main([int(x) for x in stdin.readline().rstrip().split()])

Submission status: Runtime Error

Solution code:
#coding:utf-8
r,D,x = map(int,input().split())
x2001 = r * x - 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
X = [x2001,x2002,x2003,x2004,x2005,x2006,x2007.x2008,x2009,x2010]
print(X)

Submission status: Runtime Error

Solution code:
#coding:utf-8
r,D,x = map(int,input().split())
x2001 = r * X - 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
X = [x2001,x2002,x2003,x2004,x2005,x2006,x2007.x2008,x2009,x2010]
print(X)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#coding:utf-8
r,D,x = map(int,input().split())
x2001 = r * X - 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
X = [x2001,x2002,x2003,x2004,x2005,x2006,x2007.x2008,x2009,x2010]
print(split(X))

Submission status: Runtime Error

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

if a>=13:
    print(b)
elif a >= 6:
    print(int(b / 2))
else:
    print(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A = list(map(int, input().split())) 
count = 0
ans = 0

for i in range(10):
    ans = (r*f) - D 
    count = count + 1
    print(ans)
    if(count == 10):
        break

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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


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

Submission status: Runtime Error

Solution code:
r = int(input())
D = int(input())
x = int(input())

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

Submission status: Runtime Error

Solution code:
r, D, f = map(int, input().split())
count = 0
ans = 0

for i in range(10):
    ans = (r*f) - D 
    count = count + 1
    print(ans)
    if(count = 10):
        break

Submission status: Runtime Error

Solution code:
r = int(input())
D = int(input())
x = int(input())

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

Submission status: Runtime Error

Solution code:
rdx = list(map(lambda x: int(x), input().split()))
r = rdx[0]
d = rdx[1]
x = rdx[2]

memo = [0 for i in range(d+1)]

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

Submission status: Runtime Error

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