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)*10))*10000)
}

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>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>

using namespace std;

int main()
{
	int N; cin >> N;
	const int base = 100000;
	int ans = base;
	
	for(int i = 0; i < N; i++)
	{
		ans += (ans * 0.05);
		
		cout << ans << " ";
		
		int diff = (ans % 1000);
		if( diff != 0 )ans += (1000 - diff);
		
		cout << ans << endl;
	}
	
	cout << ans << endl;
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
	int n;
	double r=0.05;
	int y = 100000;
	cin >> n;

	for(int i=0;i<n;i++){
		y = ( 1 + r ) * y;
		if(y%1000 != 0){
			y = y - y%1000;
			y = y + 1000;
		}
	}
	cout << y << endl;

}

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

int main(void){
    int i,n;
    double ans;
    cin >> n;
    ans=100000;
    for(i=0;i<n;i++){
        ans*=1.05;
        ans/=1000;
        ans=int(ans+0.9999999);
        ans=double(ans)*1000;
    }
    //ans*=1000;
    ans=int(ans);
    cout << ans << endl;
    return 0;
}

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

using namespace std;

int main() {
    int n, debt = 100000;

    cin >> n;

    for(int i = 0;i < n;i++){
        debt *= 1.05;
    }

    if(debt % 10000 != 0){
        debt = (debt - (debt % 10000)) + 10000;
    }

    cout << debt << endl; 

    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int a=100000,b=0,t=0;
    cin>>t;
    
    if(t==0)cout<<a<<endl;
    else if(t<=100){
      for(int k=1;k<=t;k++){
         b=a*1.05;
         b=(b+900)/1000*1000;
         a=b;
       }
     cout<<a<<endl;
    }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define BOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;

int main(){
    
    double i=100000;
    int n; cin>>n;
    REP(j,n){
        i=((double)((ll)(i*1.05)))+1.0;
    }
    
    cout<<(ll)i;
    
    return 0;
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;

long int money = 100000;
int s = 100000;
int a[124],b[124];

int main(){
	int n;
	int tmp;
	cin>>n;
	//while(n!=0){
		money = 100000;
	for(int i=0;i<n;i++){
		money*=1.05;
		//if(i==n-1) cout << "\nbefore  \n" << money <<"\nafter"<<endl;
		if(i==24){
			tmp = money/100;
			//cout<<tmp<<endl;
		}
		tmp = money%1000;
		if(tmp!=0){
			money/=1000;
			money++;
			money*=1000;
			
		}
		b[i+1] = money;
		//if(i==n-1)	cout << money << endl;
	}
		//cout<<b[n]<<endl;
		
		
 
    
    //scanf("%d",&n);
 
 
    for(int i=0;i<n;i++){
        if(int(s*1.05)%1000==0){
            s=int(s*1.05);
        }else{
            s= int(s*1.05) + (1000- int(s*1.05) % 1000);
        }
    	a[i+1] = s;
    }
    //printf("%d\n",s);
	
		for(int i=0;i<n;i++)
		if(a[i+1]!=b[i+1])
			cout<<i+1<<" a = "<<a[i+1]<<" b = "<<b[i+1]<<endl;
	//cout << money << endl;
		//cin >> n;
	//}
	return 0;
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <complex>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VEC;
typedef vector<VEC> MAT;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))
#define T1 first
#define T2 second.first
#define T3 second.second.first
#define T4 second.second.second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define EPS 1.0e-9

int main(){
	LL p = 100;
	int n;
	cin>>n;
	REP(i,n){
		if(p%100)p+=p/20+1;
		else p+=p/20;
	}
	p*=1000;
	cout << p<< endl;
	return 0;
}