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

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i >= _##i poi i--)
#define downtil(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i > _##i poi i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

#define poi ;
#define poipoi << "\n"

#define fuwafuwa(n, c) dokidoki((n) + (c) - 1, c)
#define dokidoki(n, c) ((n) / (c) * (c))

using namespace std;

template<class T> T lov_yet(T t){
    if(t) return t poi
    else return 0 poi
}

template<class T> T gcd(T a, T b){
    if(b) return gcd(b, a % b) poi
    else return a poi
}

int main(){
    int n, pyon = 100000 poi
    cin >> n poi
    times(n, i){
        pyon *= 1.05 poi
        pyon = fuwafuwa(pyon, 1000) poi
    }
    cout << pyon poipoi poi
    return 0 poi
}

C++: #include <iostream>
int main (void)
{
	int w;
	std::cin >> w;
	int m = 100000;
	while(0 < w)
	{
		m *= 1.05;
		if (m % 1000 != 0)
		{
			m -= m % 1000;
			m += 1000;
		}
		w--;
	}
	std::cout << m << std::endl;
}

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

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

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

int main(void) {

	//0005
	/*
	int a, b, G, R, L, r;
	while (cin >> a >> b) {
		R = a;
		L = b;
		int tmp;
		if (b > a) {
			tmp = a;
			a = b;
			b = tmp;
		}
		while (1) {
			r = a%b;
			if (r == 0)break;
			a = b;
			b = r;
		}
		G = b;
		R = R / G;
		L = L / G;
		cout << G << " " << R*L * G << endl;
	}
	*/
	//0006
	/*
	string name;
	cin >> name;
	int L = name.size();
	string Ans;
	for (int i = 0; i < L; i++) {
		Ans += name.substr(L-i-1, 1);
	}
	cout << Ans << endl;
	*/
	//0007
	int Dept = 100000;
	int week;
	cin >> week;
	for (int i = 0; i < week; i++) {
		Dept = Dept * 1.05;
		if (Dept % 1000 == 0) {
			Dept = (Dept / 1000);
		}
		else {
			Dept = (Dept / 1000 + 1);
		}
		Dept = Dept * 1000;
	}
	cout << Dept << endl;

	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main()
{
	int a = 0; int b = 100000;
	cin >> a;
	for (int i = 0; i < a; i++)
	{
		b += (b / 20);
		while (b % 1000 != 0)
		{
			b++;
		}
	}
	cout << b << endl;

	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%20)p+=p/20+1;
		else p+=p/20;
	}
	p*=1000;
	cout << p<< endl;
	return 0;
}

C++: #include <iostream>

using namespace std;

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

	int debt=100000;

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


	if (debt % 10000 != 0) {
		cout << (debt / 10000) + 1 << "0000" << endl;
	}
	else {
		cout << debt << endl;
	}

	return 0;
}

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

int main(){

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

    return 0;
}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  int n;
  cin >> n;
  int x = 100000;
  rep(i, n) x = (x * 21 / 20 + 999) / 1000 * 1000;
  cout << x << endl;
}

C++: /*http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0007&lang=jp*/

#include <iostream>
#include <cmath>

using namespace std;

int main(){
    int n,r=100;
    cin>>n;
    for (int i = 0; i < n; ++i) {
        r=ceil(r*1.05);
    }
    cout<<(int)(r*10e3)<<endl;
    return 0;
}

C++: #include <stdio.h>
#include <string.h>

int main(void){
	int week,money=100000,i;
	scanf("%d",&week);
	for(i=1;i<=week;i++){
		money=money*1.05;
		if(money%1000!=0){
			money=money+(1000-money%1000);
		}
	}
	printf("%d\n",money);
}

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

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

    int a;
    uint b = 100000;
    while (std::cin >> a) {
        for (int i=1; i <= a; i++){
            b = b*1.05;
            if (b%1000 != 0) {
                b -= b%1000;
                b += 1000;
            }
        }
        std::cout << b << std::endl;
    }
    return EXIT_SUCCESS;
}