Go: package main

import (
  "fmt"
)

func main() {
  var a int
  var b int
  b = 100000
  fmt.Scan(&a)
  for i:= 0; i<a; i++ {
    b *= 105
    b /= 100
    if (b%1000 != 0) {
      b -= b%1000
      b += 1000
    }
  }
  fmt.Println(b)
}

C++: #include<iostream>
using namespace std;
#define RENT 100000
int main(){
	int n;
	while(cin>>n){
		int ans;
		ans=RENT;
		for(int i=0;i<n;i++){
			ans=ans*1.05;
			if(ans%1000>0){
				ans=ans+1000-ans%1000;
			}
		}
		
		
		cout<<ans<<endl;
	}
}

C++: #include <iostream>

using namespace std;

int main(){
  int n;
  while(cin >> n){
    int m = 100000;
    while(n--){
      m = m*1.05;
      m = (int)(m / 1000 + ((m % 1000)?1:0)) * 1000 ;
    }
    cout << m << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <cstdlib>
using namespace std;

// 一行取って、一番初めのTを習得
template <class T> int streamvar(std::istream& in, T& var)
{
    string s;
    if (!in) {
        return 1;
    }
    getline(in, s);
    istringstream is(s);
    is >> var;
    if (is.fail()) 
        return 1;
    return 0;
}
// 一行取って、T vectorに格納する
template <class T> int streamvec(std::istream& in, std::vector<T> &v)
{
    v.clear();
    string s;

    if (!in) 
        return 1;
    getline(in, s);
    if (in.fail()) 
        return 1;
    istringstream is(s);
    while (1) {
        T tmp;
        is >> tmp;
        if (is.fail())
            break;
        v.push_back(tmp);
    }
    return 0;
}

#define EPS 1e-6
int main(void)
{
    int n;
    while (cin >> n) {
        long long m = 100000;
        for (int i = 0; i < n; i++) {
            m = (double)m * 1.05;
            if (m % 1000) {
                m -= m % 1000;
                m += 1000;
            }
        }
        cout << m << endl;
    }
    return 0;
}

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

int main() {
	//1週間ごとに5%の利子を借金に加え、さらに借金の 1,000 円未満を切り上げます。
	int n;
	cin >> n;
	int money = 100000;
	for	(int i = 0; i < n; i++){
		money *= 1.05;
		if (money % 1000 > 0)	money = (money / 1000 + 1)*1000;
	}
	cout << money << endl;
	return 0;
}

C++: import sys
import math as m
n=int(input())
out=100000
for i in range(n):
	out=m.ceil(out*1.05/1000)*1000
print(out)

#for i in sys.stdin:
#	a,b=map(int,i.split())
#	print(gcd(a,b),lcm(a,b))

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int s = 100000;
	int n;
	cin >> n;
	while (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 <iostream>
using namespace std;

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

	return 0;
}

C++: #include <iostream>

int main(){
  int money = 100000;
  int n;

  std::cin >> n;

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

  std::cout << money << std::endl;

}

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

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

#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define dep(i, a, n) for(int i = a; i >= (n); i--)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll
#define INF 100000000

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

signed main() {
	ll n, sum = 100;
  cin >> n;
  rep(i, n) {
    sum = ceil(sum * 1.05);
  }
  cout << sum * 1000 << endl;
	return 0;
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define REP(i,e) for (int i = 0; i != int(e); i++)
#define FORIT(i, A) for (auto i : A)
#define ISEQ(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << endl
#define SZ(x) ((int)(x).size())

int main(int argc, char const *argv[])
{
	int a;
	long m = 100000;
	scanf("%d", &a);
	REP(i,a)
	{
		m = (float)m * 1.05;
		int a = m % 1000;
		if (a > 0)
			m += 1000 - a;
	}
	printf("%ld\n", m);
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

template<typename T> inline T gcd(T a, T b) {
  return __gcd(a, b);
}

template<typename T> inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}

template<typename T> inline T floor(T a, T b) {
  return a - a % b;
}

template<typename T> inline T ceil(T a, T b) {
  return floor(a + b - 1, b);
}

template<typename T> inline T round(T a, T b) {
  return floor(a + b / 2);
}

int main() {
  int n;
  cin >> n;
  int k = 100000;
  for (int i = 0; i < n; ++i) {
    k = ceil(k * 105 / 100, 1000);
  }
  cout << k << endl;
}

C++: // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef map<int, int> MAPII;
typedef multimap<int, char, greater<int> > MuMAPIC;
typedef vector<pair<int, int> > VPII;
typedef multimap<int, string, greater<int> > MuMIS;

#define MP make_pair
#define FAST_IO  cin.tie(0); ios::sync_with_stdio(false);
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
//for gcc (???test)
// #define FOREACH_IT(it,c) for(typeof(c)::iterator it=(c).begin(); it!=(c).end(); ++it)
//for Visual Studio
#define foreach_it(type,it,c) for(type::iterator it=c.begin(),c_end=c.end();it!=c_end;++it)
// for Debug.
#define DUMP_VVI(b) FOR(i,0,b.size()){FOR(j,0,b[i].size())printf("%d ",b[i][j]);puts("");}
#define D_OUT(str,value) if(dbgF){cout<<str<<" : "<<value<<endl;}
// ??\??????push_back(d)???array[d]???????????????1?????§?????????
// int INPUT_INT() {int d;cin>>d;return d;}
template<class T>T IN(){T d;cin>>d;return d;}
// ?????§??¬?´???°???Greatest Common Divisor???
LL gcd(LL a, LL b){ return (b > 0) ? gcd(b, a%b) : a; }
// ????°???¬?????°???Least Common Multiple???
LL lcm(LL a, LL b){ return a / gcd(a, b) * b; }

// ------------------- include, typedef, define END. -------------------

LL oh_no_plus(LL now){
	LL afterPlus=0;
	// 5% ???????????????????????????
	afterPlus = now + now*0.05;
	// ?????????????????? 1,000 ??????????????????????????????
	afterPlus = ceil(afterPlus/1000.0);
	return afterPlus * 1000;
}

int main(){
	FAST_IO;
	// for D_OUT(str, value)  ... cout<< str <<" : "<< value <<endl;
	bool dbgF = true;
	
	//??????????????????????????????.
	int n;
	while(cin>>n){
		LL ans = 100000;
		FOR(i,0,n){
			ans = oh_no_plus(ans);
		}
		cout << ans << endl;
	}
	
	return 0;
}

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

int main(){
  int n;
  int ans=100000;

  cin >> n;

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

  cout<<ans<<"\n";
}

C++: #include <iostream>
using namespace std;
int main(){
    int a=100000,b=0,t;
    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<<b<<endl;
    }
}

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

int main() {
	int a=100000,n;
	cin>>n;
	while(n-->0){
		a*=1.05;
		a=(a+999)/1000;
		a*=1000;
	}
	cout<<a;
	return 0;
}