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(ans)
}

C++: #include<iostream>
#include<cmath>
using namespace std;
int main() {
	int n; cin >> n;
	int ans = 100000;
	float temp = 100000;
	for (int i = 0; i < n; i++) {
		temp += ans * 0.05;
		ans = round(temp / 10000) * 10000;
	}
	cout << ans << endl;
}

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

int main(){
    int n;
    cin>>n;
    double a=100;
    for(int i=0;i<n;i++){
        a*=1.05;
        if((a-(int)a)>0)a+=(1-(a-(int)a));
    }
    cout<<(int)a<<0<<0<<0<<endl;
}

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;
if((int)base < 1000 && (int)base %1000 !=0) {
int tmp = (int)base / 1000;
base = tmp*1000 + 1000;
}

}
printf("%d\n",(int)base);
}

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

int main(){
int n,b=100000,c,d,tmp;
double f=100000;
	cin>>n;
	for(int i=0;i<n;i++){
		f*=0.05;
		tmp=f;
		b=b+tmp;
		d=b;
		b/=1000;
		b*=1000;
		if(d-b>0)b+=1000;
		f=b;
	}
	cout<<b<<endl;
	return 0;
}

C++: #include <iostream>

int main(){
        int n;
        while(std::cin >> n){
                int result=100000;
                while(n--){
                        result*=1.05;
                        if(result%1000!=0)result+=1000-result%1000;
                }

                std::cout << result << std::endl;
        }

        return 0;
}

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

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

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

C++: #include <bits/stdc++.h>
//#include <iostream>
//#include <Windows.h>
using namespace std;

int main(){
int n;
double a=100;
cin>>n;
while(n--){
	a+=a*5/100;
        a=ceil(a);
}
cout<<a*1000;
return 0;
}

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

using namespace std;


int main(){
    int week;
    cin >> week;
    double money =10;
    
    for(int i=0; i<week; i++){
        money=money * 1.05;
    }
    printf("%d\n",int(money+0.9)*10000);
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑


int main() {
	long long n, ans = 100000;
	cin >> n;
	while (n--) { ans = (ans + ans / 20 + 999) / 1000 * 1000; }
	cout << ans << endl;
}

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

int main(){
	long n;
	cin >> n;
	n = 5;
	double money = 100000;
	for (long i = 1; i <= n; i++){
		money *= 1.05;
		if (fmod(money, 1000) != 0) money += 1000 - fmod(money, 1000);
	}
	cout << (long)money << endl;
	return 0;
}

C++: #include<stdio.h>
int main(void){
	int i;
	
	
	int n;
	scanf("%d",&n);
	
	int d=100000;
	
	for(i=0;i<n;i++){
		d+=d/20;
		
		if(d%1000!=0){
			d=d/1000*1000+1000;
		}
	}
	
	printf("%d\n",d);
	
	return 0;
}

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

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

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

C++: #include<iostream>
#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;
        ans=int(ans+0.999);
    }
    ans*=1000;
    ans=int(ans);
    cout << ans << endl;
    return 0;
}

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

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

	cin >> n;

	for(int i = 1; i <= n; i++) {
		money += money * 0.05;
		if(money % 1000 != 0) {
			money /= 1000;
			money++;
			money *= 1000;
		}
	}

	cout << money << endl;
}

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

int main() {
	int n;
	double d = 100000;
	cin >> n;
	for (int i = 0; i < n; i++) {
		d *=  1.05 / 1000;
		if (d - floor(d) > 0.00001) {
			d = ceil(d) * 1000;
		}else d *= 1000;
	}
	cout << d <<endl;
		
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;


const int Max=10000000;
bool prime[Max];
int main(void){
  int n, sum=100000;
cin<<n;


  for(int i=0; i<n; i++){
    sum = 1.05*sum;
    sum = (sum/1000+1)*1000; 
  }
  cout << sum << endl;
}

C++: #include <stdio.h>

int main(){
	int n,i;
	double money=100000;
	scanf("%d",&n);
	
	for(i=0;i<n;i++){
		money*=1.05;
		if((int)money%1000 != 0){
			money=(double)((int)(money/1000)*1000+1000);
		}
	}
	
	printf("%d\n",(int)money);
	
	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+19)/20;
M+=m;
}
cout<<M*1000;
}

C++: #include <iostream>


using namespace std;

int main(){
  int n;
  double money=100000;
  cin >> n;
  if(n<100){
  for(int i = 0;i<n;i++){
    money+=(money*0.05);
  }
 money= ((int)money/10000)*10000+10000;
  cout << money<<endl;
  }
  return 0;
}

C++: #include <iostream>
//#include <vector>
//#include <math.h>
#include <string>

int main(void);
int kiriage(int num);


int main(){
	int n;					//n週
	int debut = 100000;		//借金
	std::cin >> n;

	for (int i = 0; i < n; i++)
	{
		debut *= 1.05;
		std::string str_debut = std::to_string(debut);
		if ((str_debut[str_debut.length() - 1] == '0') &&
			(str_debut[str_debut.length() - 2] == '0') &&
			(str_debut[str_debut.length() - 3] == '0')
			){
			;
		}
		else{
			debut = kiriage(debut);
		}
	}

	std::cout << debut << std::endl;

	//while (1);
	return 0;
}

//1000円未満を切り上げる関数
int kiriage(int num){
	num = num / 1000 * 1000 + 1000;
	
	return num;
}

C++: #include <stdio.h>


int main(void){
    int debt=1000; // *100yen
    int n;

    scanf("%d", &n);
 //   printf("%d ->\n", debt);
    for (int i=0; i<n; i++){
        debt *= 1.05;
 //       printf("(%d)", debt);
        if (debt % 10){
            debt += (10 - (debt % 10));
        }
 //       printf("%d ->\n", debt);   
    }
    printf("%d000", debt);
    return 0;
}