Go: package main

import (
	"fmt"
	"math"
)

const (
	INTEREST float64 = 0.05
	DEBT     int     = 100000
)

func main() {
	var x int
	interestDebt := DEBT
	fmt.Scanf("%d", &x)
	for i := 0; i < x; i++ {
		interestCalc := MakeCalcInterest(float64(interestDebt)) + int(interestDebt)
		interestDebt = RoundUp(float64(interestCalc))
	}
	fmt.Printf("%d\n", interestDebt)
}

func MakeCalcInterest(x float64) int {
	return int((x * INTEREST))
}

func RoundUp(x float64) int {
	return int(math.Ceil(x*0.001) * 1000)
}

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

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

using namespace std;


int main()
{
	int i,n;
	cin >> n;
	
	int gaku = 100;

	for( i = 0; i < n; i++ ) {
		gaku = ceil(gaku * 1.05);
	}
	
	cout << gaku * 1000 << endl;
	return 0;
}

C++: #include <iostream>
int main()
{
  const int BASE = 100000;
  int n, debt = BASE;
  std::cin >> n;
  while (n--) {
    debt = (debt * 1.05 + 999) / 1000;
    debt *= 1000;
  }
  std::cout << debt << std::endl;
  return 0;
}

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

using namespace std;

int main()
{
	int n;
	int money = 100000;
	
	scanf("%d", &n);
	for(int i=0 ; i<n ; ++i){
		money += (int)ceil(money * 0.05 / 1000.0) * 1000;
	}
	
	printf("%d\n", money);
	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 * 105 / 100;
  }
  cout << (x + 5000) / 10000 * 10000 << endl;
}

C++: #include <iostream>

using namespace std;

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

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

        return 0;
}

C++: #include <iostream>

#define N (1000)

int debt(const int amount, const int weeks)
{
    int ret;
    int fraction; /* 1000円未満額の端数 */
    
    ret = amount;
    for (int i = 0; i < weeks; i++){
        // 利子計算
        ret *= 1.05;
    }
    
    fraction = ret % N;
    
    ret /= N;  // 切り捨てて
    if (fraction != 0){
        // 端数があるなら
        // 切り上げる
        ret++;
    }
    ret *= N;
    
    return ret;
}

int main()
{
    int n;
    
    std::cin >> n;
    
    std::cout << debt(100000, n) << std::endl;
    
    return 0;
}

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

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  int n;
  cin>>n;
  ll cur = 100000;
  REP(i,n){
    cur *= 1.05;
    if(cur%1000 != 0){
      cur -= cur%1000;
      cur += 1000;
    }
  }
  cout<<cur<<endl;
  return 0;
}

C++: // 2011/05/31 Tazoe

#include <iostream>
using namespace std;

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

	int dbt = 100000;
	for(int i=0; i<n; i++){
		dbt = dbt/100*105;
		dbt = (dbt+999)/1000*1000;
	}

	cout << dbt << endl;

	return 0;
}

C++: #include<stdio.h>
 
int main(){
    int  s=100000;
 
    int n;
    scanf("%d",&n);
 
 
    for(;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 <cstdio>

using namespace std;
 
int main() {
	int n;
	long base = 100000;
	float interest = 0.05f;
	long roundNum;

	scanf("%d", &n);
	
	while (n--) {
	    base = base * (1 + interest);
	    roundNum = base % 1000;
	    
	    if (roundNum != 0) base += (1000 - roundNum);
	}
	
	printf("%ld\n", base);
	
	return 0;
}

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

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

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 <fstream>
#include <queue>

#define INF 100000000
#define EPS 1e-9

using namespace std;

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

int n;

int main() {

	cin >> n;

	ll ans = 100000;

	while (n > 0){
		n--;
		ans *= 1.05;
		if (ans % 1000 != 0){
			ans = (ans / 1000) * 1000 + 1000;
		}
	}

	cout << ans << endl;

	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int debt, n;

	cin >> n;

	debt = 100000;

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

	cout << debt << endl;
}

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

C++: #include<iostream>
using namespace std;
int main(void)
{
    int n,A=0,b,a1,b1,A1=100000;
    cin>>n;
    for(int i=0;i<n;i++){
        b1=A1*0.05/1000;
        a1=b1*1000+1000;
        A1+=a1;
    cout<<b1<<" "<<A1*0.05<<" ";
    }        cout<<A1<<"\n";
}

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

int main() {
	int N;
	double X = 100000;
	cin >> N;
	for (int i = 0; i < N; i++) {
		X *= 1.05;
		if (X != (long long)(X / 1000) * 1000) X = (long long)(X / 1000) * 1000 + 1000;
	}
	printf("%.0lf\n", X);
}