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 <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  int n;
  cin>>n;
  ll cur = 100000;
  REP(i,n){
    cur *= 1.05;
    if(cur%1000 != 0){
      cur -= cur%1000;
      cur += 1000;
    }
  }
  cout<<cur<<endl;
  return 0;
}

C++: // 2011/05/31 Tazoe

#include <iostream>
using namespace std;

int main()
{
	int n;
	cin >> n;

	int dbt = 100000;
	for(int i=0; i<n; i++){
		dbt = dbt/100*105;
		dbt = (dbt+999)/1000*1000;
	}

	cout << dbt << endl;

	return 0;
}

C++: #include<stdio.h>
 
int main(){
    int  s=100000;
 
    int n;
    scanf("%d",&n);
 
 
    for(;n--;){
        if(int(s*1.05)%1000==0){
            s=int(s*1.05);
        }else{
            s= int(s*1.05) + (1000- int(s*1.05) % 1000);
        }
    }
    printf("%d\n",s);
 
    return 0;
}

C++: #include <cstdio>

using namespace std;
 
int main() {
	int n;
	long base = 100000;
	float interest = 0.05f;
	long roundNum;

	scanf("%d", &n);
	
	while (n--) {
	    base = base * (1 + interest);
	    roundNum = base % 1000;
	    
	    if (roundNum != 0) base += (1000 - roundNum);
	}
	
	printf("%ld\n", base);
	
	return 0;
}

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

int main(){
  int m = 100000,n;
  cin >> n;
  for(int i = 0 ; i < n ; i++ ){
    m += m*0.05; 
    if(m%1000 != 0)m-=m%1000,m+=1000; 
  }
  cout << m << endl;
}

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 <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <queue>

#define INF 100000000
#define EPS 1e-9

using namespace std;

typedef pair<int, int> P;
typedef long long ll;

int n;

int main() {

	cin >> n;

	ll ans = 100000;

	while (n > 0){
		n--;
		ans *= 1.05;
		if (ans % 1000 != 0){
			ans = (ans / 1000) * 1000 + 1000;
		}
	}

	cout << ans << endl;

	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int debt, n;

	cin >> n;

	debt = 100000;

	for (int i = 0; i < n; i++){
		debt *= 1.05;
		if (debt % 1000 != 0){
			debt = debt - (debt % 1000);
			debt += 1000;
		}
	}

	cout << debt << endl;
}

C++: #include<iostream>
using namespace std;
int main(void){
  int n;
  int now=100000;
  int i,j;
  cin>>n;
  for(i=0;i<n;i++){
    now*=1.05;
    if(now%1000>=1){
      now+=1000;
      now/=1000;
      now*=1000;
    }
  }
  cout<<now<<endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(void)
{
    int n,A=0,b,a1,b1,A1=100000;
    cin>>n;
    for(int i=0;i<n;i++){
        b1=A1*0.05/1000;
        a1=b1*1000+1000;
        A1+=a1;
    cout<<b1<<" "<<A1*0.05<<" ";
    }        cout<<A1<<"\n";
}

C++: #include "bits/stdc++.h"
using namespace std;

int main() {
	int N;
	double X = 100000;
	cin >> N;
	for (int i = 0; i < N; i++) {
		X *= 1.05;
		if (X != (long long)(X / 1000) * 1000) X = (long long)(X / 1000) * 1000 + 1000;
	}
	printf("%.0lf\n", X);
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>

#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)


using namespace std;


int main(void)
{
    int n;
    int money = 100000;
    cin >> n ;
    FOR(i, 1,n+1 )
    {
        money += money*0.05;
        if(money % 1000 != 0)
            money += 1000 -  (money % 1000);
    }

    cout << money << endl;
    return 0;
}

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

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

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

void test();
int  interest(int debt, float interest_rate, int n);

int main(void)
{
	test();
	return 0;
}


void test()
{
	int debt,n;
	double money;
	float interest_rate;
	debt = 100000;
	interest_rate = 1.05;
	cin >> n;

	debt = interest(debt, interest_rate, n);

	money = (double) debt / 1000;// 1000?????\???????°???°?????\??????

	money = ceil(money) * 1000;// ?°???°?????\?????????????????????????????????

	debt = money;

	cout << debt << endl;
}

int interest(int debt, float interest_rate,int n)//?????°??¢??°
{

	if (n == 1)
		return debt * interest_rate;
	else
		return interest(debt, interest_rate, n - 1) * interest_rate;
}

C++: #include<stdio.h>

int main(){
	
	int n,m=100000,s=0;
	
	scanf("%d",&n);
	
	for(int t=0;t<n;t++){
		
		m=m*1.05;
		
		if(m%1000!=0){
			s=m%1000;
			m=m+1000-s;
		}
		//printf("%d\n",m);
	}
	
	printf("%d\n",m);
	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>
using namespace std;

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

#ifndef typeof
#define typeof __typeof__
#endif // typeof

#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(typeof((c).rbegin()) i = (c).rbegin(); i != (c).rend(); i++)
#define repby(i, a, b, step) for(typeof(b) 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 main(int argc, char **argv)
{

  int n;

  while (cin >> n) {
    int debt = 100000;
    while (n--) {
      int interest = debt / 100 * 5;
      if (interest%1000)
        interest = (interest / 1000 + 1) * 1000;
      debt = debt + interest;
    }
    cout << debt << endl;
  }

  return 0;
}

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

using namespace std;

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

    cin >> n;

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

    debt /=10000;
    debt = round(debt);

    cout << int (debt * 10000) << endl; 

    return 0;
}

C++: #include <stdio.h>

int main(void) {
	int i,n,mon = 100000;
	scanf("%d",&n);
	for(i = 0; n > i; i++){
		mon *= 1.05;
		mon += 999;
		mon = (int)(mon/1000)*1000;
	}
	printf("%d\n",mon);
	return 0;
}