Go: package main

import (
	"fmt"
	"math"
)

func main() {
	var n int
	hellGate := 100.000

	fmt.Scanf("%d", &n)

	for i := 1; i <= n; i++ {
		hellGate *= 1.05
		hellGate = math.Ceil(hellGate)
	}

	fmt.Println(int(hellGate * 1000))
}

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<iostream>
using namespace std;

int main(){
	int week,i;
	int debt = 100000;

	cin >> week;

	for(i=0;i<week;i++){
		debt=debt*105/100;
		if(debt%1000){
			debt = debt - (debt%1000) + 1000;
		}
	}
	
	cout << debt << endl;
}

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

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

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

int main(){
  int n,money=100000;
  cin>>n;
  for( int i=0;i<n;i++ ){
    money=(money/100)*105;
    if(money-money/1000*1000){
      money-=(money-money/1000*1000);
      money+=1000;
    }
  }
  cout<<money<<endl;
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int n,i;
  int temp;
  double ans = 100;
  cin >> n;
  for(i = 0;i < n;i++){
    ans *= 1.05;
    ans -= 0.01;
    temp = (int)ans;
    ans = (double)temp + 1;
  }
  cout << ans << "000" << endl;
  return(0);
}

C++: #include <iostream>

using namespace std;

int main()
{
	int n, m;
	
	cin >> n;
	
  m = 100000;
	m = (((m / 100) * 5) * n) + m;
	if (m % 1000 != 0){
		m = m - (m % 1000) + 1000;
	}

	cout << m;
}

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

// advance_nはansのn桁目以降が0出なければ切り上げ、0ならそのままにする
//  12000 12345 - (12345 % 10^3
int advance_n(int ans,int n)
{
	cout << "ans % int(pow(10,n+2)))10=" << ans % int(pow(10,n)) << endl;
	cout << "pow(10,n+2)=" << pow(10,n+2) << endl;
	cout << "(ans - ans % int(pow(10,n+2)))=" << (ans - ans % int(pow(10,n+2))) << endl;
	return (ans - ans % int(pow(10,n)) + (ans % int(pow(10,n+2)) != 0)*int(pow(10,n)));
}

int how_much_debt(int n)
{
	if (n==0)
		return 100000;
	else
		return 1.05 * how_much_debt(n-1);
}

int main()
{
	int a;
	cin >> a;
	cout << advance_n(how_much_debt(a),3) << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	int long long s=100000,l;
	int n;
	cin>>n;
	for(int p=0;p<n;p++){
		s=s+s/20;
		l=(s/1000)*1000;
		if(s>l){
			s+=1000;
			s=(s/1000)*1000;
		}
	}
	printf("%lld\n",s);
}

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

void test();
int  interest(int debt, float interest_rate, int n);

int main(void)
{
	test();
	return 0;
}

void test()
{
	int debt,n;
	float interest_rate;
	debt = 100000;
	interest_rate = 1.05;
	cin >> n;

	debt = interest(debt, interest_rate, n);

	if (debt % 1000 > 0)
	{
		debt = debt - debt % 1000 + 1000;
	}
	cout << debt << endl;
}

int interest(int debt, float interest_rate,int n)
{

	if (n == 1)
		return debt * interest_rate;
	else
		return interest(debt, interest_rate, n - 1) * interest_rate;
}

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;
}

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

C++: #include<iostream>

using namespace std;

int main()
{
	int n;
	int debt = 100000;
	int temp = 100000;
	
	cin >> n;
	
	for(int i = 0; i < n; i++){
		debt *= 1.05;
	}
	
	for(int i = 0; i < n; i++){
		temp += (10000*i);
		if(temp > debt){
			break;
		}
	}
	
	cout << temp << endl;
}

C++: #define _USE_MATH_DEFINES

#include <iostream>
#include <string>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

using namespace std;

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

	int m = 100000;
	for (int i = 0; i < n; i++)
	{
		m += (int)(0.05 * m);
		m = (m / 1000 + (m%1000 == 0 ? 0 : 1)) * 1000;
	}

	cout << m << endl;
}

C++: #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
  int n;
  cin>>n;
  double m = 100000;
  for(int i = 0; i < n; i++){
    m*=1.05;
    m/=1000;
    m=ceil(m);
    m*=1000;
   // cout<<i<<','<<m<<endl;
	printf("%.0lf\n",m);  
}
  cout<<m<<endl;
}

C++: #include <stdio.h>

using namespace std;


int main(){
	int debt = 100000,n;
	scanf("%d",&n);

	for(int i=0;i<n;i++){
		debt=(debt/100)*105;
		if((debt%1000)>0){
			debt+=(1000-(debt%1000));
		}
	}

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

    return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int n,m;
	
	m=100000;
	scanf("%d",&n);
	
	while(n>0)
	{
		m=(m*105)/100;
		if(m%1000>0)
		{
			m=((m/1000)+1)*1000;
		}
		n--;
	}
	
	printf("%d\n",m);
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int a=100000,b=0,t;
    cin>>t;
      for(int k=0;k<t;k++){
         b=a*1.05;
         b=(b+999)/1000*1000;
         a=b;
       }
     cout<<a<<endl;
}

C++: #include <cstdio>
#include <cstdlib>

int main(){
 int n;
 scanf("%d",&n);
 
 int ans = 100000;
 for(int i = 0;i < n;i++){
  ans *= 1.05;
  if(ans % 1000 > 0) ans = ans % 1000 + 1000;
 }
 printf("%d\n",ans);
 return 0;
}

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

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

C++: #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>

using namespace std;
using Int = long long;
typedef pair<int,int> Pi; typedef pair<Int,Int> Pl;
constexpr int mod = 1e9+7;
constexpr int INF32 = numeric_limits<int>::max();
constexpr Int INF64 = numeric_limits<Int>::max();
#define END {cout<<ans<<'\n'; return 0;}
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define Pr(t) priority_queue<t>
#define gPr(t) priority_queue<t,vector<t>,greater<t>>
#define V(t) vector<t>
#define rer(i,l,r) for(int(i)=(l); (i)<(r); ++(i))
#define rep(i,n) rer(i,0,n)
#define gnr(i,l,r) for(int (i)=(r)-1; (i)>=(l); --(i))
#define pri(a) cout<<(a)<<'\n'
#define pri2(a,n) {rep(i,n-1)cout<<a[i]<<' '; if(n)cout<<a[n-1]<<'\n';}
#define prip(p) cout<<(p).fi<<' '<<(p).se<<'\n'
template<class T> inline bool cmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool cmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int n,m,_,x,y,q;
string s,sb;
bool ok;
char cf,cb;

int main(){
  cin.tie(nullptr); ios::sync_with_stdio(0);
  //cout<<fixed<<setprecision(20);
  
  cin>>n; x=100000;
  rep(i,n){
    x+=x/20;
    x=x-((x%1000)?(x%1000):1000)+1000;
  }
  pri(x);
}

C++: #include <stdio.h>

int main() {
    int weeks = 0;
    double money = 100.0d;
    scanf("%d", &weeks);

    for (int i = 0; i < weeks; ++i) {
        money *= 1.05d;
        int temp = (int) money;
        if (temp < money) {
            temp++;
        }
        money = temp;
    }

    int result = (int) money;
    result *= 1000;
    printf("%d\n", result);

    return 0;
}

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

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

C++: #include <iostream>

using namespace std;

int main(){
	int now_money = 100000;
	int N;
	cin >> N;
	for(int i = 0; i < N; i++){
		now_money += now_money * 5 / 100;
		if(now_money % 1000 != 0){
			now_money -= now_money % 1000;
			now_money += 1000;
		}
	}
	cout << now_money << endl;
	return 0;
}