Go: package main

import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"math"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		debt := float64(100000)
		for i:=1; i<=n; i++ {
			debt = debt*1.05
			debt = math.Ceil(debt*0.001) * 1000
		}		
		fmt.Println(int(debt))
	}
}

C++: //--------------------------------------------------template----------------------------------------//
//c
#include <stdio.h>
#include <time.h>
#include <math.h>
//c++
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <complex>
#include <cmath>
//c++11
#include <tuple>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
//#define sort(v,n) sort(v,v+n)
//#define vsort(v) sort(v.begin(),v.end())
#define vvsort(v) sort(v.rbegin(),v.rend())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
int n;

int main() {
	cin >> n;
	ll now = 100000;
	for (int i = 0; i < n; i++) {
		now = now + now*0.05;
		if (now % 1000 != 0) {
			now /= 1000;
			now++;
			now *= 1000;
		}
	}
	cout << now << endl;
	return 0;
}

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

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

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

C++: #include <iostream>

using namespace std;

int main() {

	int n, debt=100000;

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

	return 0;

}

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

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

int main()
{
    int n, d = 100000;
    cin >> n;
    for(; n-- ;)
    {
       if(int(d*1.05)%1000 == 0) d = (int)d*1.05;
       else
       {
            d = (int)d*1.05 + (1000- int(d*1.05)%1000);
       }
    }
    cout << d << endl;
}

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

long long int ans[110] ;

void init ( ) ;

int main ( )
{
	int N ;
	init ( ) ;
	while ( scanf ( "%d" , &N ) == 1 ) {
		printf ( "%lld\n" , ans[N] ) ;
	}
	return 0 ;
}

void init ( )
{
	ans[0] = 100000 ; 
	for ( int i = 1 ; i < 101 ; i++ ) {
		long long int tmp = ans[i-1] * 105 / 100 ;
		if ( tmp % 1000 > 0 ) {
			long long int s = tmp % 1000 ;
			tmp = tmp + 1000 - s ;
		}
		ans[i] = tmp ;
	}
}

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


int brack(int n){
	int x = 100000;
	int y = 0;
	for (int i = 0; i < n; i++){
		x *= 1.05;
		y = x % 1000;
		if (y != 0){
			x -= y;
			x += 1000;
		}
	}
	return x;
}


int main(){
	int n;
	cin >> n;
	cout << brack(n) << endl;

	return 0;
}

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld\n",a)

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//bitset<32> bset1;
//char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n, p, q, r, s, t, u, v, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);//NULL
    cout.tie(nullptr);//NULL

    cin>>n;

    x=100000;
    while(n--)
    {
        x*=21;
        y=ceil(x/(double)20);
        c =((y%1000==0)? 0 : (1000-(y%1000)));
        x=y+c;
    }
    cout<<x<<endl;
    return 0;
}

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

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

C++: 

#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;
int main()
{
	long double a = 100000;
	int s;
	cin >> s;
	for (int i = 0; i < s; i++) {
		a *= 1.05;
	}
	cout << a;
	return 0;

}

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

int main(void) {
    int n = 5;
    
    int64_t remain = 100000;
    
    for(int i = 0; i < n; i++) {
        remain *= 1.05;
        if(remain % 1000 > 0)
            remain = (remain - remain % 1000) + 1000;
    }
    
    std::cout << remain << std::endl;
}

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

int main() {
	// your code goes here
	int n=100000,money;
	cin >> money;
	for(int i=0;i<money;i++){
		n*=1.05;
		n+=999;
		n-=n%1000;
	}
	cout << n << endl;
	return 0;
}

C++: #include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{   
    int a;
    int x = 100;
    for (; a > 0; a--) {
        x = ceil((float)x * 1.05);
        printf("%d\n", x);
    }
    printf("%d\n", x * 1000);
    return 0;
}

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

using namespace std;

void calc_m(int *Money, int n){
  int org = 100000;
  Money[0] = org;
  for(int i=1;i<100;i++){
    Money[i] = Money[i-1]*1.05;
    double tmp = ceil((double)Money[i]*pow(10.0, -3));
    Money[i] = (int)tmp*pow(10.0, 3);
  }
}
  

int main(){

  int Money[100];
  calc_m(Money, 100);
  
  int n;
  
  while(cin >> n){
    cout << Money[n] << endl;
  }

}