Go: package main

import "fmt"

var (
	dept    float64 = 100000
	addDept float64 = dept * 0.05
)

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

	nWeekDept = dept + (addDept * float64(week))

	if int(nWeekDept)%1000 != 0 {
		nWeekDept += addDept
	}
	fmt.Println(nWeekDept)
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld\n",a)

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//bitset<32> bset1;
//char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n, p, q, r, s, t, u, v, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);//NULL
    cout.tie(nullptr);//NULL

    cin>>n;

    x=100000;
    while(n--)
    {
        x*=21;
        y=ceil(x/(double)20);
        c =((y%1000==0)? 0 : (1000-(y%1000)));
        x=y+c;
    }
    cout<<x<<endl;
    return 0;
}

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

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

C++: 

#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;
int main()
{
	long double a = 100000;
	int s;
	cin >> s;
	for (int i = 0; i < s; i++) {
		a *= 1.05;
	}
	cout << a;
	return 0;

}

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

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++: #include <iostream>
using namespace std;

int main() {
	// your code goes here
	int n=100000,money;
	cin >> money;
	for(int i=0;i<money;i++){
		n*=1.05;
		n+=999;
		n-=n%1000;
	}
	cout << n << endl;
	return 0;
}

C++: #include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{   
    int a;
    int x = 100;
    for (; a > 0; a--) {
        x = ceil((float)x * 1.05);
        printf("%d\n", x);
    }
    printf("%d\n", x * 1000);
    return 0;
}

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

using namespace std;

void calc_m(int *Money, int n){
  int org = 100000;
  Money[0] = org;
  for(int i=1;i<100;i++){
    Money[i] = Money[i-1]*1.05;
    double tmp = ceil((double)Money[i]*pow(10.0, -3));
    Money[i] = (int)tmp*pow(10.0, 3);
  }
}
  

int main(){

  int Money[100];
  calc_m(Money, 100);
  
  int n;
  
  while(cin >> n){
    cout << Money[n] << endl;
  }

}

C++: #include<iostream>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<climits>
#include<ctime>
#include<cstring>
#define REP(i,p,n) for(int i=p;i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep_split(tok,a_str,re) for(char *tok = strtok((char *)a_str.c_str(),re); tok != NULL; tok = strtok(NULL,re))
#define all(c) (c).begin(), (c).end()

using namespace std;
template<class T> inline void chmax(T& a, T b) { if(b > a) a = b; }
template<class T> inline void chmin(T& a, T b) { if(b < a) a = b; }

int main() {
	int N;
	double money = 100000;

	cin >> N;
	rep(i,N) {
		money = money * 1.05;
		money = ceil(money/1000) * 1000;
	}
	cout << (int)money << endl;
	
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(void) {
	int n;

	cin >> n;

	int debt = 100000;
	for (int i = 1; i <= n; i++) {
		debt = (debt * 1.05);
		if (debt % 1000) {
			debt /= 1000;
			debt *= 1000;
			debt += 1000;
		}
	}

	cout << debt << endl;

	return 0;
}

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

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

  scanf("%d", &n);
  for (int i = 0; i < n; i++){
    debt *= 1.05;
    if (debt % 1000 != 0){
      debt = (debt / 1000 + 1) * 1000;
    }
  }
  printf("%d\n", debt);

  return (0);
}

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

using namespace std;

int main(void){
	int debt = 100000;
	float const rate = 0.05;
	int term = 0;
	cin >> term;
	for (int i=0; i<term; ++i){
		float tmp = debt * (1 + rate) / 1000;
		debt = (int)(ceil(tmp) * 1000);
	}
	cout << debt << endl;
	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
  int n,ten1=100000,ten2;
  cin>>n;
  rep(i,n){
    ten1+=ten1/20;
  }
  ten2=ten1/1000*1000;
  if(ten1!=ten2)ten2+=1000;
  cout<<ten2<<endl;
}

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

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++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n;
    cin>>n;
    ll a=100000;
    while (n--) {
        a=(a*105)/100;
        a=(a+999)/1000*1000;
    }
    cout<<a<<endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

int roundUp(int x, int index);

int main(void)
{
    int i;
    int n;
    double intrst;
    int debt;
    
    cin >> n;
    
    debt = 100000;
    intrst = 0.05;
    for (i = 0; i < n; i++) {
        debt *= 1.0 + intrst;
        debt += 900;
        debt /= 1000;
        debt *= 1000;
    }
    cout << debt << endl;
    
    return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	int m;
	int s=100000;
	cin>>m;
	for(int i=0;i<m;i++){
       s = s*1.05;
		if(s%1000!=0)
	 s = ((s/1000)+1)*1000;
	}
	cout<<s<<endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int n,j;
	long long k = 100000;
	cin >> n;
	for (int i = 0; i < n; i++) {
		k += k / 20;
		j = k % 1000;
		if (j != 0) {
			k += 1000 - j;
		}
	}
	cout << k << endl;
	return 0;
}