Go: package main

import (
        "fmt"
        "math"
)

var interests [101]float64

func main() {
        var m int
        fmt.Scanf("%d", &m)
        fmt.Printf("%d\n", int(math.Ceil(interest(m)*100))*1000)
}

func interest(m int) (i float64){
        if interests[m] > 0 {
                return interests[m]
        }

        if m == 0 {
                interests[0] = 1.0
                return interests[0]
        }

        if m == 1 {
                interests[1] = 1.05
                return interests[1]
        }
        interests[m] = interest(m/2) * interest(m/2) * interest(m%2)
        return interests[m]
}

C++: #include <iostream>
using namespace std;

int main(){
	int n;
	int all[101];
	all[0] = 100000;
	for(int i=1; i<=100; i++){
		all[i] = all[i-1]*1.05;
		if(all[i]%1000){
			all[i] -= (all[i]%1000);
			all[i] += 1000;
		}
		//cout<<all[i]<<endl;
	}
	while(cin>>n){
		cout<<all[n]<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main(){
	long long int ans=100000;
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		ans=ans*105/100;
	}
	cout<<ans<<endl;
    return 0;
}

C++: #include <stdio.h>
int main(){
    int n,i,kin2;
    double kin=100000,risoku=0.05;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        kin=kin+(kin * risoku);
        kin2=(int)(kin/1000+0.9);
        kin = kin2*1000;
    }
    kin2 = (int)kin;
    printf("%d\n",kin2);
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
	double money = 100000;
	int n;
	cin >> n;
	for( int i=0; i<n; i++ ){
		money = (double)money * 1.05;
		int up = money / 1000;
		if( (int)(money - up) > 0 )
			money = (up+1)*1000;
		else
			money = up * 1000;
	}
	int m = (int)money;
	cout << m << endl;
	return 0;
}

C++: 
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;
int main()
{
	int a = 100000;
	int s;
	cin >> s;
	for (int i = 0; i < s; i++)
	{
		a *= 1.05;
		a = a - (a % 1000);
	}
	cout << a << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i,N) for(int i = 0; i < (int)N; i++)


int main(){
	int n;
	cin >> n;
	LL money = 100000;
	REP(i,n){
		money += money*5/100;
		REP(i,3){
			if(money % (int)pow(10,i+1) != 0){
				money /= 1000;
				money *= 1000;
				money += 1000;
				break;
			}
		}
	}
	cout << money << endl;
	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>

using namespace std;

int gcd( int, int );

int main()
{
	unsigned int moto = 100000;
	int n;

	scanf("%d", &n );

	for ( int i = 0; i < n; i++ )
	{
		moto *= 1.05;
		if ( moto % 1000 )
		{
			moto /= 1000;
			moto *= 1000;
			moto += 1000;
		}
	}

	printf("%d\n", moto );

	return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;

int main() {
	int n, i;
	double a = 100000;
	cin >> n;
	for (i = 0; i<n; i++) {
		a *= 1.05;
		ceil(a);
		while ((int)a % 1000 != 0) {
			a += 1;
		}
	}
	cout << (int)a << endl;
}

C++: #include<iostream>
using namespace std;
int main(){

	int n;
	int loan;

	cin >> n;
	loan;

	loan = 100000;

	for(int i=0; i<n; i++){
		loan = loan+loan*0.05;
		loan = loan+999;
		loan = loan/1000*1000;
	}

	cout << loan << endl;
	
	return 0;
}

C++: #include<cstdio>

int main() {
	int n, debt;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		debt = debt + debt*0.05;
	}
	printf("%d\n", debt);

	return 0;
}

C++: #include<iostream>

using namespace std;

int main() { 
    int weeks; 

    while( cin >> weeks ) {

	int sum = 100000;
	
    for(int i=0;i<weeks;i++){
    	
    sum *= 1.05;
    if( sum % 1000 !=0 )
    sum = ( sum / 1000 +1 ) * 1000;
    
	}
    cout << sum << "\n";
	}
    return 0; 
}

C++: 
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>

using namespace std;


bool solve(){
	
	long a = 100000;
	int n;
	cin>> n;
	for(int i=0;i<n;i++){
		a = a*1.05;
		if(a%1000){
			a -= a%1000;
			a += 1000;
		}
	}
	cout<< a;
	cout<< endl;
	
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	solve();

	return 0;
}

C++: #include <stdio.h>




int main(){

  int b=100000,n;
  scanf("%d",&n);
 
  for(int i = 0;i<n;i++){
    b*=1.05;
    if(b%1000!=0)b=(b/1000+1)*1000;
  }

  printf("%d\n",b);

  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
#include <iterator>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;

#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i, a, cont, next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i, a, b, step) repfn(i, a, i < b, i + step)
#define repab(i, a, b) repby(i, (a), (b), 1)
#define rep(i, n) repab(i, 0, (n))
#define pb push_back
#define sz(c) int((c).size())

int rndup1000(int x) {
  int mod = x % 1000;
  if (mod)
    return x - mod + 1000;
  else
    return x;
}

int main(int argc, char **argv)
{
  int n;
  int debt = 100000;
  cin >> n;
  while (n--) {
    debt = rndup1000((debt/100)*105);
  }
  cout << debt << endl;
  return 0;
}

C++: #include <iostream>
#include <cmath>

using namespace std;

int main(int argc, char const* argv[])
{
  int weeks;
  cin >> weeks;

  int debt = 100;
  for (int i = 0; i < weeks; i++) {
    debt = ceil(debt * 1.05);
  }

  cout << debt * 1000 << endl;
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <iomanip>
#include <stack>
#include <set>
#include <cstdio>
#include <bitset>
#include <functional>
#include <tuple>
#include <list>
#include <deque>
using namespace std;
typedef pair<int, int> P;

#define FOR(i, a, n) for (ll i = (ll)a; i<(ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)

typedef long long ll;
typedef vector<int> VI;

int main() {
    int n; cin >> n;
    int debt=100000;
    for(int i=1; i<=n; ++i){
        debt *= 1.05;
        if(debt%1000!=0) debt = (debt/1000+1)*1000;
    }
    cout << debt << endl;
    
	return 0;
}

C++: #include <iostream>
#include<cmath>
using namespace std;

int main() {
	int n;cin>>n;
	int a=100;
	for(int i=0;i<n;i++)
	{
		a=(int)ceil(a*1.05);
	}
	cout<<a*1000<<endl;
	return 0;
}

C++: #include<iostream>
#include<cmath>
using namespace std;

double round(double src, int n){
	double dst;
	dst = src*pow(10, -n-1);
	dst = (double)(int)(dst+0.9);
	return dst*pow(10, n+1);
}

int main(){
	double a=100000;
	int n, r;
	cin >> n;
	for (int i=0; i<n; i++){
	a=round(a*1.05, 2);
	cout << a << endl;
	}
	
	return 0;
}