Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func calc(n int) float64 {
	tmp := 100000.0
	for i := 0; i < n; i++ {
		tmp *= 1.05
		tmp = ceil(tmp, -3)
	}
	return tmp
}

func ceil(f float64, places int) float64 {
	shift := math.Pow(10, float64(places))
	return math.Ceil(f*shift)/shift
}

func main() {
	scanner.Split(bufio.ScanWords)
	n := nextInt()
	ans := calc(n)
	fmt.Println(int(ans))
}

C++: #include <stdio.h>
typedef long long ll;

int main(void) {
  ll i, n, ans = 100000;
  scanf("%lld", &n);
  for(i = 0; i < n; ++i) {
    ans = ans + ans / 20;
    if(ans % 1000) ans -= ans % 1000, ans += 1000;
  }
  printf("%lld\n", ans);
  return 0;
}

C++: #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
main(){
    int N;
    int debt = 100000;
    cin >> N;
    for(int i = 0;i < N;i++){
        debt *= 1.05;
        debt = (debt+999)/1000*1000;
    }
    cout << debt << endl;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;


int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
    int debt = 100000,   n;
    cin >> n;
    rep(i, n) {
        debt *= 1.05;
        if (debt % 1000 > 0) {
            debt = (debt / 1000 + 1) * 1000;
        }
    }
    cout << debt << "\n";
	return 0;
}

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

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

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {
	CI n;
	return;
}


int main(void) {
	input();
	long double money = 100000;
	
	for (int i = 0; i < n; i++) {
		money *= 1.05;
		if ((int)money % 1000 != 0) {
			money = money - ((int)(money) % 1000) + 1000;
		}
		
	}
	
	CO money E
	

	return 0;
}

C++: #include <iostream>

using namespace std;

int main() {

	int n, debt=100000;

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

	cout << debt << endl;

	return 0;

}

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

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

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

int main(){
int n,M,m;
M=100;
cin>>n;
for(int i=0;i<n;i++){
m=(M+9)/20;
M+=m;
}
cout<<M*1000;
cin>>m;
}

C++: #include<iostream>
#include<string>
#include<queue>
#include<stack>
using namespace std;
int main(){
	stack<int>st;
	bool bo=false;
	int n,a=10000;
	cin>>n;
	for(int i=0;i<n;i++){
		a+=a*0.05;
	}
	if(a/100==0 && a/10==0 && a%10==0){
		bo=true;
	}
	a/=1000;
	if(bo==true){
	}
	else if(bo==false){
		a=a+1;
	}
	cout<<a*1000<<endl;
	return 0;
}

C++: #include<string>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<functional>
#include<map>
#include<set>
#include<cmath>

#define REP(i,s,e) for(int i=int(s);i<int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)

#define EPS 1e-6

using namespace std;

int main(){

	int n;
	cin >> n;

	int d=100000;
	rep(i,n){

    d=1.05*d;

	if(d%1000!=0)
	d=d+1000-d%1000;

	}

	cout << d << endl;


	return 0;
}

C++: #include<iostream>

using namespace std;

double money = 100000;

int i;

int main()
{
	cin>>i;
	for(i;i>0;--i)
	{
		money *= 1.05;
		money = (long)(money/100+0.9)*100;
	}
	printf("%.0lf\n",money);
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;



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

C++: #include<iostream>
#include<stdio.h>
int main(){
	
	int n,i,a,b,okane=100000;

    std::cin>>n;
	for(i=0;i<n;i++){	
		okane=okane*1.05;
		if(okane%1000!=0){
			a=okane%1000;
			b=1000-a;
			okane=okane+b;
			
			
			
			
			}

		}
    std::cout<<okane;

	
	
	
	
	
	

	return 0;
}

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

#define INITIAL_DEBT 100000 // 10万

int main()
{
        int n;
        cin >> n;
        
        int debt = INITIAL_DEBT;
        for(int i=1; i<=n; i++){
                debt *= 1.05; // 利子(5%/1week)
                int rem = debt%1000; // 1,000円以下の端数
                if( rem ){ debt = debt - rem + 1000; }
        }
        cout << debt << endl;
                
        return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
int n;
scanf("%d",&n);
double base = 100000;
for(int i=0;i<n;i++){
base*=1.05;
}
printf("%d\n,(int)base);
}

C++: import java.math.BigDecimal;
import java.util.Scanner;

class Main {

    public static final int DEPT = 100000;

    public static final BigDecimal INTEREST = new BigDecimal(0.05);

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int week = Integer.parseInt(s.next());

        BigDecimal repay = new BigDecimal(DEPT);

        for (int i = 0; i < week; ++i) {
            repay = repay.add(repay.multiply(INTEREST));

        }

        s.close();
        System.out.println(repay.divide(new BigDecimal(10000), 0,
                BigDecimal.ROUND_CEILING).multiply(new BigDecimal(10000)));

    }
}

C++: #include<iostream>
using namespace std;
int main()
{
  int n;

  cin >> n;

  int ans = 100000;

  for(int i = 0;i < n;i++)
    {
      ans += ans*5/100;

      if(ans % 1000 != 0)
	{
	  ans += 1000 - ans % 1000;
	}
     
    }
  
  
  
  cout << ans << endl;
}

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

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