Go: package main

import "fmt"

var (
	dept    int = 100000
	addDept int = dept / 100 * 5
)

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

	nWeekDept := dept + addDept*week

	if nWeekDept/addDept%2 != 0 {
		nWeekDept += addDept
	}
	fmt.Println(nWeekDept)
}

C++: /*
    ????????°??§???????????¨????????????
*/

#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <limits.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <vector>
#include <map>
#include <utility>
#define LLU unsigned long long int
#define LL long long int
#define LD long double
using namespace std;
#define LLUmax ULLONG_MAX
#define LLmax LLONG_MAX
#define dmax INT_MAX
#define vd vector<int>
#define vLL vector<long long int>
#define vLLU vector<unsigned long long int> 
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define debug printf("asd\n")
#define debugd(a) printf("--%d\n",a)
#define debugdd(a,b) printf("--%d %d\n",a,b)
#define debugarr(a,b) for(int i=0 ; i<b ; i++)printf("%d ",a[i]);printf("\n")
#define newline printf("\n")
#define forin(a,b,c) for(int a=b ; a<c ; a++)
#define forde(a,b,c) for(int a=b ; a<c ; a--)


inline void scd(int &a){scanf("%d",&a);}
inline void scdd(int &a,int &b){scanf("%d %d",&a,&b);}
inline void sctd(int &a,int &b,int &c){scanf("%d %d %d",&a,&b,&c);}
inline void scdlld(long int &a,long int &b){scanf("%I64d %I64d",&a,&b);}
inline void sclld(long long int &a){scanf("%I64d",&a);}

#define scarrd(a,b) for(int index=0 ; index<b ; index++)scanf("%d",&a[index])
#define prdlld(a,b) printf("%I64d %I64d",a,b)
#define prdd(a,b) printf("%d %d",a,b)
#define prd(a) printf("%d",a)
#define prarr(a,b) for(int i=0 ; i<b ; i++)printf("%d ",a[i])
#define iniarr(a,b) for(int i=0 ; i<b ;i++)a[i]=0
#define arr(a,b) int *a=(int *)malloc(b*sizeof(int))
#define llarr(a,b) long long int *a=(long long int *)malloc(b*sizeof(long long int))
#define st(a,b) char *a=(char *)malloc(b*sizeof(char))
#define grav 9.8
#define pi 3.14159265

int main()
{
	int a=100000;
	int n;
	scd(n);
	a+=(a*5*n)/100;
	a+=1000*n;
	printf("%d\n",a);
	
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
#define int long long

signed main(){
        //int a;
        //while( scanf("%lld", &a) != EOF ){}

        int n;
        scanf("%lld",&n);
        int m=100000;
        for(int i=0;i<n;i++){
                m=m*1.05;
                m=((m-1)/1000+1)*1000;
        }
        printf("%lld\n", m);

        return 0;
}

C++: #include <iostream>

int main()
{
    int const FIRST = 100000;
    int n, debt = FIRST;

    std::cin >> n;

    for(int i = 0; i < n; i++) {
        debt /= 20;
        debt *= 21;
        if(debt % 1000 != 0)
            debt = debt / 1000 * 1000 + 1000;
    }

    std::cout << debt << std::endl;

    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main(){
double n,money = 100000;
int r;
cin >> n;
for(;n;n--)
money*=1.05;
money=money/10000+0.5;
r=(int)money*10000;
cout << r << endl;
return 0;
}

C++: #include <cstdio>
 
int main()
{
    int money = 100000;
    int n;
    float a = 0.05;
     
    scanf("%d", &n);
    while (n != 0){
        money += money * a;
        if ((money % 1000) != 0){
            money -= money % 1000;
            money += 1000;
        }
        n--;
    } 
    printf("%d\n", money);
     
    return (0);
}

C++: #include <iostream>

int main(void) {
    int n;
    std::cin >> n;
    int cost = 100000;
    double cost_temp;

    for (int i = 0; i < n; i++) {
        cost_temp = cost * 1.05;
        cost = cost_temp;
        if (cost % 1000 != 0) {
            cost += 1000;
        }
        cost = (cost / 1000) * 1000;
    }
    std::cout << cost << std::endl;

    return 0;
}

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

int main() {
    int n;
    while (cin >> n) {
        long long debt = 100000;
        for (int i = 0; i < n; i++) {
            debt += debt / 20;
            debt += (debt % 1000 == 0) ? 0 : 1000 - (debt % 1000);
        }
        cout << debt << endl;
    }
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <string>
#include <sstream>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define repn(i, n) for(int i = 1; i <= (int)n; ++i)
#define pb push_back
#define lb lower_bound
#define mp make_pair
#define ite iterator
#define max2(x, y) ((x) > (y)) ? (x) : (y)
#define max3(x,y,z) max2((x), max2((y),(z)))
#define max4(v,w,x,y) max2(max2((v),(w)), max2((x),(y)))
#define min2(x, y) ((x) > (y)) ? (y) : (x)
#define min3(x,y,z) min2((x), min2((y),(z)))
#define min4(v,w,x,y) min2(min2((v),(w)), min2((x),(y)))
#define ul unsigned long
#define ull unsigned long long
#define INF 1000000007
#define MOD 1000000007
#define fs first
#define sd second

template<typename T>
bool elem(set<T> st, T val){
	return (st.find(val) != st.end());
}

template<typename T>
void printv(vector<T> vt){
    rep(i, vt.size() - 1)
        cout << vt[i] << " ";
    cout << vt[vt.size() - 1] << endl;
}

typedef vector<int> vint;
typedef vector<ul> vul;
typedef vector<ull> vull;
typedef pair<int, int> pii;


int main(void){
    int n;
    cin >> n;
    int mon = 100000;
    rep(unused, n){
        mon += mon/20;
        if(mon % 1000) mon -= (mon % 1000) - 1000;
    }
    cout << mon << endl;
    return 0;
}

C++: #include <iostream>
#include <string>
#include <cstdlib>
#include <cctype>
#include <math.h>

static bool input(int& n)
{
    if (0x00 == &n) {
        std::cerr << "n is null" << std::endl;
        return false;
    }

    std::string tmp("");
    char c = 0;

    std::cin >> c;
    if (std::isdigit(static_cast<int>(c))) {
        tmp = c;
    	n = std::atoi(tmp.c_str());
    }

    return true;
}

static int calcBalanceOfDebt(int n)
{
    double balance = 100000;

    for (int i = 1; i <= n; i++) {
        balance *= 1.05;
        balance /= 1000;
        balance = (int)ceil(balance);
	balance *= 1000;
    }

    return static_cast<int>(balance);
}

int main()
{
    int num = 0;

    input(num);
    std::cout << calcBalanceOfDebt(num) << std::endl;

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int roan[105];

int main()
{
//	cut here before submit 
//	freopen ("testcase.DH", "r", stdin );
	memset (roan, 0, sizeof (roan ) );
	int n;
	scanf ("%d", &n );
	roan[0] = 100000;

	for (int i = 1; i <= 100; i++ ){
		double curr = (double)roan[i-1];
		curr *= 1.05;
		curr /= 1000.;
//		cout << "curr: " << curr << endl;
		curr = ceil (curr );
//		cout << "curr: " << curr << endl;
		curr *= 1000.;
		roan[i] = 	curr;
	} // end for
	cout << roan[n] << endl;
/*
	rep (i, 101 ){
		cout << roan[i] << endl;
	} // end rep
*/
//	printf ("%d\n", res );
		
	return 0;
}

C++: #include<stdio.h>
int main(){
	int n;
	int sum=100000;
	scanf("%d",&n);
	while(n){
		sum*=1.05;
		if(sum%1000!=0)sum=(sum/1000+1)*1000;
		n--;}
	printf("%d\n",sum);
	return 0;}