Go: package main

import "fmt"

func roundUp1000(dept float64) float64 { 
	iDept := int(dept)
	if iDept-(iDept/1000*1000) != 0 { 
		iDept = ((iDept / 1000) + 1) * 1000 
	}
	return float64(iDept)
}

func main() {
	var week int
	fmt.Scan(&week)

	dept := 100000.0
	for i := 0; i < week; i++ {

		dept *= 1.05
		dept = roundUp1000(dept)
	}

	fmt.Println(int(dept))
}

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

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define BOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;

int main(){
    
    double i=100000;
    int n; cin>>n;
    REP(i,n){
        i=((double)((ll)(i*1.05)));
    }
    
    cout<<(ll)i;
    
    return 0;
}

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

int main()
{
    int n, debt = 100000;
    double rate = 0.05;
    
    cin >> n;
    for (int i = 0; i < n; i++) {
        debt *= (1.00 + rate);
        if ((debt % 1000) != 0){
            debt = debt / 1000 * 1000 + 1000;
        }
    }
    cout << debt << endl;
    
    return 0;
}

C++: #include <iostream>
#include <math.h>
using namespace std;
int main(){
	int n , i , w , h ;
	double x , y , z;
	cin >> n ;
	x = 100000;
	for( i=1 ; i<=n ; i++ ){
		x = x*1.05;
		w = x ;
		x = w/100;
		x = x/10;
		x = ceil( x );
		x = x*1000 ;
	}
	cout << x << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(void){
	int n;
	int sum;
	int i;
	cin>>n;
	sum=100000;
	for(i=1;i<=n;i++){
		sum*=1.05;
		if(sum%1000)	sum=sum-sum%1000+1000;
	}
	cout<<sum<<endl;
	return 0;
	
}

C++: #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <vector>
using namespace std;

const double interest = 0.05;
const double roundYen = 1000.0;

int weeklyAdd(double debt) {
  debt = debt * (1 + interest);
  debt = ceil(debt / roundYen) * roundYen;
  // std::cout << debt << '\n';
  return debt;
}

int main(int argc, char const *argv[]) {
  // int week = 5;
  int week;
  std::cin >> week;
  double debt = 100000;

  for (size_t i = 0; i < week; i++) {
    debt = weeklyAdd(debt);
  }
  std::cout << debt << '\n';

  return 0;
}

C++: //"push hoge"と言われたらhogeを最後に入れ、"pop"と言われたら最後尾を取りだす。"quit"で終わり。
#include<iostream>
using namespace std;

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

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

C++: #include<iostream>
int main(){int n,s=100000,i;std::cin>>n;for(i=0;i<n;i++)s*=1.05,s+=(1000-(s%1000==0?1000:s%1000));std::cout<<s<<"\n";}

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 <queue>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i = (b-1); i >= a; i--)
#define rrep(i,n) RFOR(i,0,n)
#define INF 999999999

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

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

ll mod = (ll)1e9+7;

void solve(){
    ll n; cin >> n;
    ll ans = 100000;
    rep(i,n){
        ans *= 1.05;
        if(ans % 1000){
            ans -= ans % 1000;
            ans += 1000;
        }
    }
    cout << ans << endl;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    solve();

    return 0;
}

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

C++: #include<iostream>

int n,money = 100000;

void OneWeek(int &a){
	a += a*0.05;
	if(a%1000 != 0){
		a -= a%1000;
		a += 1000;
	}
}

int main(){
	std::cin >> n;
	for(int i=0; i<n; i++)
		OneWeek(money);
	std::cout << money << std::endl;
	return 0;
}

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


int main(){

int money=100000;
int i,n;

cin >> n;

for(i=0;i<n;i++){
money*=1.05;

if(money%1000!=0){
money+=1000-(money%1000);
}
}


cout << money << endl;

}

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<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<string>
using namespace std;


int main() {

	int dept = 100000;

	int n;

	cin >> n;

	for (int i = 0; i < n; i++) {
		dept = (int)((double)dept*1.05);

		if (dept % 1000 != 0) {

			dept = dept - (dept % 1000) + 1000;
		}





	}
	printf("%d\n", dept);

	//system("pause");
	return 0;
}

C++: #include<cstdio>

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

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

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

    cout << n;

	cin >> n;
    return 0;
}

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

int main(void) {
    int n = 5;
    
    int64_t remain = 100000;
    
    for(int i = 0; i < n; i++) {
        remain *= 1.05;
        if(remain % 1000 > 0)
            remain = (remain - remain % 1000) + 1000;
    }
    
    std::cout << remain << std::endl;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <algorithm>
#include <limits.h>
#include <cmath>
#include <time.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define SQR(X) ((X)*(X))
int test = 0;
/* ここからが本編 */
int main(void)
{
  int i,j,k,l;
  int rep = 100000;
  int n;
  cin >> n;
  rep(i,n) {
    ull a = rep;
    rep += rep*5/100/1000*1000;
    if( (a*5) % (1000*100)) {
      rep += 1000;
    }
  }
  cout << rep << endl;
  return 0;
}

C++: #include<iostream>

using namespace std;

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