Go: package main

import "fmt"

var (
	dept    float64 = 100000
	addDept float64 = dept * 0.05
)

func main() {
	var week int
	var nWeekDept float64
	fmt.Scan(&week)

	nWeekDept = dept + (addDept * float64(week))

	if int(nWeekDept)%1000 != 0 {
		nWeekDept += addDept
	}
	fmt.Println(nWeekDept)
}

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 <queue>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i = (b-1); i >= a; i--)
#define rrep(i,n) RFOR(i,0,n)
#define INF 999999999

//4??????
//int dy[]={0, 0, 1, -1};
//int dx[]={1, -1, 0, 0};

//8??????
//int dy[]={0,0,1,-1,1,1,-1,-1};
//int dx[]={1,-1,0,0,1,-1,1,-1};

ll mod = (ll)1e9+7;

void solve(){
    ll n; cin >> n;
    ll ans = 100000;
    rep(i,n){
        ans *= 1.05;
        if(ans % 1000){
            ans -= ans % 1000;
            ans += 1000;
        }
    }
    cout << ans << endl;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    solve();

    return 0;
}

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

int main(void){
    int n;
    double ans;
    cin >> n;
    ans=100*pow(1.05,n);
    if((ans-int(ans))>0.0) ans++;
    ans*=1000;
    ans = int(ans);
    cout << ans << endl;
    return 0;
}

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

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

    return 0;
}

C++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0007
#include <iostream>
using namespace std;
int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int n; cin >> n;
	int debt = 100000;
	for (int i = 0; i < n;i++) {
		debt *= 1.05;
		if (debt % 1000 != 0) {
			debt = (debt / 1000) * 1000  + 1000;
		}
	}
	cout << debt << endl;
}

C++: #include <stdio.h>

int main(void){
	float debt = 100;
	int buf;
	int n;
	
	int i;
	
	scanf("%d",&n);
	
	for(i = 0;i < n;i++){
		debt = debt*1.050;
		buf = (int)debt;
		if(debt - buf >= 0.001){
			buf++;
			debt = (float)buf;
		}
	}
	
	printf("%d000\n",(int)debt);
	
	return 0;
}

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

int round(double num);

int main(){
	int n=100;
	int w;
	cin >> w;

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

	cout << n << endl;

	return 0;
}

int round(double n){
	int m=n;

	if(n>m) return m+1;
	if(n==m) return m;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
 
typedef long long ll;
typedef pair<int, int> ii;

int main(){

	int n;
	cin >> n;
	
	ll ans = 100000;
	rep(i, n){
		ans *= 1.05;
		ans += 999;
		ans -= (ans % 1000);
	}

	cout << ans << endl;

	return 0;
}

C++: #include <iostream>
#include <stdio.h>
int main(){

	int n,i,kane=100000,a,b;

	std::cin>>n;

	for(i=0;i<n;i++){
		kane=kane*1.05;
		if(kane%1000!=0){
			a=kane%1000;
			b=1000-a;
			kane=kane+b;
			}
		}
	
	std::cout<<kane<<std::endl;

		return 0;
		}

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

// advance_nはansのn桁目以降が0出なければ切り上げ、0ならそのままにする
//  12000 12345 - (12345 % 10^3
int advance_n(int ans,int n)
{
	return (ans - ans % int(pow(10,n)) + (ans % int(pow(10,n)) != 0)*int(pow(10,n)));
}

int how_much_debt(int n)
{
	if (n==0)
		return 100000;
	else{
		// cout << "(advance_n (how_much_debt(n-1),3))=" << (advance_n (how_much_debt(n-1),3)) << endl;
		return 1.05 * (advance_n (how_much_debt(n-1),3));
	}
		
}

int main()
{
	int a;
	cin >> a;
	// cout << how_much_debt(a) << endl;
	cout << "advance_n(100000*1.05,3)=" << advance_n(how_much_debt(a),3) << endl;
}

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

int kiriage(double num){

num/=1000;
num=ceil(num);
num*=1000;
return (int)num;
}

int main(){

double money=100000;
int i,n;

cin >> n;

for(i=0;i<n;i++){
money*=1.05;
money=kiriage(money);
}


cout << money;

}

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

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

using namespace std;

int main(){
  int remaind = 10;
  int n;
  
  cin >> n;

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

  cout << remaind * 10000 << endl;
  
  return 0;
}

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;
}