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>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class itr, class func> void array_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr, class func> void nint_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += string(out(*i)) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcount(n)

int main(){
    int n;
    cin >> n;
    int money = 100;
    for(int i = 0; i < n; i++){
        money = (money * 21 + 19) / 20;
    }
    cout << money * 1000 << endl;
}

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

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

	int tot = 100000;
	int n;
	cin >> n;
	for(int i = 0; i < n; i++){
		long double now = 0.05 * tot;
		for(int j = 5000;; j += 1000){
			if(j >= now){
				tot += j;
				break;
			}
		}
	}
	cout << tot << '\n';
	return 0;
}
// Write Here

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

int n,i;
double debt=100;
int main(){
	scanf("%d",&n);
	for(i=0;i<n;i++){
	debt*=1.05;
	debt=ceil(debt);
	}
	printf("%.0f\n",debt*1000);
}

C++: #include<cstdio>
int main()
{
	int n;
	scanf("%d", &n);
	int t = 100000;
	for(int i = 1; i <= n; i++)
	{
		int in = t * 0.05;
		if(in % 1000) in = (in / 1000 + 1) * 1000;
		t += in;
	}
	printf("%d", t);
	return 0;
}

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

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

int main(){
	double debt = 100000.0;
	int n, r;
	cin >> n;
	while ( n-- > 0 ){
		debt *= 1.05;
		r = (int)debt % 1000;
		if ( r != 0 ){
			debt = debt - r + 1000;
		}
	}
	cout << debt << endl;
	
	return 0;
}

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

#define N 100000

using namespace std;

int main(void){
long int debt = 0;

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


  return 0;
}

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

const static double	de_PI	= 3.14159265358979323846;
const static int	de_MOD	= 1000000007;
const static int	de_MAX	= 999999999;
const static int	de_MIN = -999999999;

int main(void) {

	//std::ifstream in("123.txt");	std::cin.rdbuf(in.rdbuf());

	int a = 0;
	std::cin >> a;

	double n = 100000;
	for (int i = 0; i < a; i++) {
		n = n*1.05;
		n = static_cast<int>(ceil(n / 1000));
		n = n * 1000;
	}

	std::cout << std::setprecision(20) << n << std::endl;
}

C++: #include <iostream>
using namespace std;
 
int main(){
    int a, b;
    int price = 100000;

    cin >> a;
    for (int i = 0; i < a; i++) {
        price *= 1.05;
        b = price % 1000;
        if (b != 0) {
            price += 1000;
            price -= b;
        }
    }
    cout << price << endl;

    return 0;
}

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

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

C++: #include<iostream>
int main(){
	int a,b,i,n;
	a=100000;
	std::cin>>n;
	for(i=0;i<n;i++){
		a=a*1.05;
		b=a;
		if(a%1000!=0){
			b=a-a%1000;
			a=b+1000;
			}
		}
	std::cout<<a<<std::endl;

    return 0;
}

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

using namespace std;

int roundUp(int x, int index);

int main(void)
{
    int i;
    int n;
    double intrst;
    int debt;
    
    cin >> n;
    
    debt = 100000;
    intrst = 0.05;
    for (i = 0; i < n; i++) {
        debt *= 1.0 + intrst;
        debt = roundUp(debt, 4);
    }
    
    cout << debt << endl;
    
    return 0;
}

int roundUp(int x, int index)
{
    int exp10;
    
    exp10 = pow(10, index - 1);
    x += exp10 - 1;
    x /= exp10;
    x *= exp10;
    
    return x;
}

C++: #include <bits/stdc++.h>
using namespace std;
long money = 100000;
void up() {
    int judge = money % 1000;
    cout << judge << endl;
    if(judge) {
        money -= judge; money += 1000;
    }
}

int main(void) {
    int n; cin >> n;
    for(int r = 0; r < n; r++) {
        money *= 1.05; up();
    }
    cout << money << endl;
    return(0);
}

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

int main(void){
    int i,n;
    double ans;
    cin >> n;
    ans=100.000;
    for(i=0;i<n;i++){
        ans*=1.05;
        cout << i+1 << ":::" << ans << "->";
        ans=(int)(ans+0.999);
        cout << ans << "->";
        ans=(double)ans;
        cout << ans << endl;
    }
    ans*=1000;
    printf("%d\n",(int)ans);
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  int sum = 100000;
  cin>>n;
  for(int i=0;i<n;i++){
    sum = (int)(sum*1.05);
    if(sum % 1000 != 0){
      sum += 1000-(sum%1000);
    }
  }
  cout<<sum<<endl;
}

C++: #include <iostream>

using namespace std;

int main(int argc, char *argv[]) {
  int n;
  double debt = 100000;
  
  cin >> n;
  for (int i = 0; i < n; i++) {
    debt *= 1.05;
    debt = (int)(debt / 1000 + 0.9) * 1000;
  }
  cout << debt << endl;
  return 0;
}

C++: #include<stdio.h>

main(void){
    int money = 100000, num;
    
    scanf("%d", &num);
    
    for( ; num >= 0; num--){
        money += money * 0.05;
    }
    
    printf("%d\n", (money/10000)*10000);

    return 0;
}