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 <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	int n;
	cin >> n;
	int a = 100000;
	rep(i, n) {
		a = a / 100 * 105;
		a = (a + 1000 - 1) / 1000 * 1000;
	}
	cout << a << endl;
}

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

int main(void){

  int debt,week,i;
  debt = 100000;

  cin >> week;

  for(i=0; i<week; i++){
    debt = debt * 1.05;
    if(debt % 1000 > 0){
      debt += 1000 - (debt % 1000);
    }
  }

  cout << debt << endl;
  return 0;

}

C++: #include <iostream>

int next_weeks_debt(int current) {
  current *= 1.05;
  int mod = current % 1000;
  if (mod != 0) { current += 1000 - mod; }
  return current;
}

int main() {
  int weeks;
  std::cin >> weeks;

  int current = 100000;
  for (int i = 0; i < weeks; ++i) {
    current = next_weeks_debt(current);
  }

  std::cout << current << std::endl;

  return 0;
}

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

int main(){
	int n,i,ans = 100000,a,risi[2];
	cin >> n;
	for(i = 1;n >= i;i++){
		risi[0] =  ans * 0.05;
		risi[1] = risi[0];
		while(risi[1] >= 1000){risi[1] = risi[1] - 1000;}
			if(risi[1] > 0){risi[0] = risi[0] - risi[1] + 1000;}
		ans = ans + risi[0];
	}
	cout << ans << endl;
}

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

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

	scanf("%d", &n);
	for(i=0; i<n; i++){
		money = money + ceil(money * 0.05);
		if(money % 1000 != 0){
			money = money - (money % 1000) + 1000;
		}
	}

	printf("%d\n", money);

	return 0;
}

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

int main() {
    int weeks;
    scanf("%d", &weeks);

    int debt = 100000;
    for (int i = 0; i < weeks; i++) {
        debt = debt * 1.05;
        int p = debt / 100;
        int q = p / 10;
        if (p % 10 > 0) {
            q += 1;
        }
        debt = q * 1000;
    }
    printf("%d\n", debt);
}

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


long long countdebt(long long bj, int n) {
	if (n == 0)
		return bj;
	else
		countdebt(bj + (((bj / 20) % 1000 == 0) ? (bj / 20) : (((bj / 20) / 1000ll + 1ll) * 1000ll)),n-1);
}

int main() {
	int n = 0;
	cin >> n;
	cout << countdebt(100000, n) << endl;
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<sstream>
#include<iomanip>
#include<cstdlib>
#include<cmath>
#include<cstdio>
using namespace std;

int main()
{
	int n, a = 100000;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		int b = a * 5 / 100;
		a += b;
		if (a % 1000)a = (a / 1000 + 1) * 1000;
	}
	cout << a << endl;
	return 0;
}

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

int main(){
	int n;
	long debt=100, tmp; // x1000 yen

	scanf("%d", &n);

	for(; n>0; n--)
		debt=(int)ceil(debt*1.05);
	
	printf("%d000\n", debt);

 return 0;
}

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

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

int main() {
	ios :: sync_with_stdio(false);
	int n; cin >> n;
	int t = 100000;
	while(n --) {
		t = t + t / 20;
		int r = t % 1000;
		t = t - r + (r >= 500 ? 1000 : 0);
	}
	cout << t << '\n';
	return 0;
}

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

int main()
{
	int n;
	double debt = 10;//10(??????), 1000??? = 0.1(??????)
	const double risi = 0.05;

	cin >> n;
	for(int i = 0;i < n;i++)
		debt += debt * risi;
	
	cout << ceil(debt) * 10000 << endl;

	return 0;
}

C++: #include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
#include<complex>
using namespace std ;
typedef vector<int> vi ;
typedef vector<vi> vvi ;
typedef vector<string> vs ;
typedef pair<int, int> pii; 
typedef long long ll ;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()

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

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

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;


int main()
{
  int n, sum=100000;
  int i, j, k;
  int tot, ans, num;
  
  cin >> n;
  for(i=0; i<n; i++){
    sum += sum*(i+1)*0.05;
    sum = (sum/1000+1)*1000;
  }
  cout << sum << endl;
    return 0;
}

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

int main() {
    double money = 100;
    int result;
    int n;
    
    cin >> n;
    for(int i = 0; i < n; i++) {
        money *= 1.05;
        money = ceil(money);
    }
    result = int(money * 1000);
    cout << result << endl;
    
    return 0;
}

C++: #include <math.h>
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <string>

#define YES "YES"
#define NO "NO"
#define space ' '

using namespace std;

void func();

int main(void)
{
	
	func();

	return 0;
}


void func()
{
	int n, debt,carry;

	debt = 100000;

	cin >> n;
	while (n-- > 0)
	{
		debt = debt * 1.05;
		if (carry = debt % 1000, carry > 0)
		{
			debt += 1000-carry;

		}


		cout << debt << endl;
	}
}

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

C++: #include <iostream>
using namespace std;
int main(){
	int n;cin>>n;
	int debt = 100000;
	for(int i=0;i<n;i++){
		debt = (int)((debt*1.05+999)/1000)*1000;
	}
	cout << debt << endl;
}