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 <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;

long int money = 100000;
int s = 100000;
int a[124],b[124];

int main(){
	int n;
	int tmp;
	cin>>n;
	//while(n!=0){
		money = 100000;
	for(int i=0;i<n;i++){
		money*=1.05;
		//if(i==n-1) cout << "\nbefore  \n" << money <<"\nafter"<<endl;
		if(i==24){
			tmp = money/100;
			//cout<<tmp<<endl;
		}
		tmp = money%1000;
		if(tmp!=0){
			money/=1000;
			money++;
			money*=1000;
			
		}
		b[i+1] = money;
		//if(i==n-1)	cout << money << endl;
	}
		//cout<<b[n]<<endl;
		
		
 
    
    //scanf("%d",&n);
 
 
    for(int i=0;i<n;i++){
        if(int(s*1.05)%1000==0){
            s=int(s*1.05);
        }else{
            s= int(s*1.05) + (1000- int(s*1.05) % 1000);
        }
    	a[i+1] = s;
    }
    //printf("%d\n",s);
	
		for(int i=0;i<n;i++)
		if(a[i+1]!=b[i+1])
			cout<<i+1<<" a = "<<a[i+1]<<" b = "<<b[i+1]<<endl;
	//cout << money << endl;
		//cin >> n;
	//}
	return 0;
}

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 <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <complex>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VEC;
typedef vector<VEC> MAT;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))
#define T1 first
#define T2 second.first
#define T3 second.second.first
#define T4 second.second.second

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define EPS 1.0e-9

int main(){
	LL p = 100;
	int n;
	cin>>n;
	REP(i,n){
		if(p%100)p+=p/20+1;
		else p+=p/20;
	}
	p*=1000;
	cout << p<< endl;
	return 0;
}

C++: #include <iostream>
#include <cstring>
#include <cstdio>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)

const int MAX_D = 130;

struct Integer{
    Integer(int i = 0){
        memset(digits, 0, sizeof(digits));
        n = 0;

        while(i > 0){
            digits[n++] = i % 10;
            i /= 10;
        }
    }
    Integer(const std::string& s){
        memset(digits, 0, sizeof(digits));
        n = 0;

        bool f = false;
        for(int j=(int)s.size()-1;j>=0;j--){
            if(!std::isdigit(s[j])){continue;}

            if(s[j] != '0'){
                digits[n++] = s[j] - '0';
                f = true;
            }else if(f){
                digits[n++] = s[j] - '0';
            }
        }
    }
    int digits[MAX_D], n;
};

Integer operator*(const Integer& lhs, const Integer& rhs){
    Integer res;
    for(int i=0;i<MAX_D;i++){
        for(int j=0;j<MAX_D;j++){
            if(i + j >= MAX_D){continue;}
            int x = lhs.digits[i] * rhs.digits[j] + res.digits[i+j];
            res.digits[i+j] = x % 10;
            if(i + j + 1 < MAX_D){
                res.digits[i+j+1] += x / 10;
            }
        }
    }

    return res;
}

Integer operator+(const Integer& lhs, const Integer& rhs){
    Integer res;
    for(int i=0;i<MAX_D;i++){
        int x = lhs.digits[i] + rhs.digits[i] + res.digits[i];
        res.digits[i] = x % 10;
        if(i+1 < MAX_D){
            res.digits[i+1] = x / 10;
        }
    }

    return res;
}

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

    Integer x(100000), k1(105), k2(1000);
    REP(i, N){
        x = x * k1;
        
        FOR(j, 2, MAX_D){
            x.digits[j-2] = x.digits[j];
        }

        if(x.digits[0] || x.digits[1] || x.digits[2]){
            REP(i, 3){x.digits[i] = 0;}
            x = x + k2;
        }
    }

    bool f = false;
    for(int i=MAX_D-1;i>=0;i--){
        if(x.digits[i] != 0){
            f = true;
        }

        if(f){
            printf("%d", x.digits[i]);
        }
    }
    puts("");
}

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

int main() {
	double m = 100;
	int n;

	std::cin >> n;
	for (int i = 0; i < n; ++i) {
		m *= 1.05;
		m = std::ceil(m);
	}
	std::cout << m * 1000 << std::endl;
	return 0;
}

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

ll gcd(ll a, ll b)
{
  ll tmp;

  while(b){
    tmp = a;
    a = b;
    b = tmp%b;
  }

  return a;
}

inline ll lcm(ll a, ll b){ return a*(b/gcd(a, b)); }

ll a, b;

int main()
{
  while(cin >> a >> b){
    cout << gcd(a, b) << " " << lcm(a, b) << endl;
  }

  return 0;
}

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

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

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

int main() {
    ios::sync_with_stdio(false);
    int x=100000, n;
    cin >> n;
    for(int i=0;i<n;i++){
      x *= 1.05;
      if(x%1000 == 0) ;
      else x = (x/1000)*1000 + 1000;
    }
    cout << x << endl;
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
int main(){

	int n,i,kane=100000,a,b;

	std::cin>>n;

	for(i=0;i<n;i++){
		kane=kane*1.05;
		if(kane%1000!=0){
			a=kane%1000;
			b=1000-a;
			kane=kane+b;
			}
		}
	
	std::cout<<kane;

		return 0;
		}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;

int main()
{
	string str = "";

	while (getline(cin, str)){
		int n = 0;
		stringstream ss(str);
		ss >> n;
		int roan = 100000;
	
		for (int i = 0; i < n; ++i){
			roan = (int)(roan*1.05);
		} // end for
		roan += 5000;
		roan = (roan/10000)*10000;
		cout << roan << endl;	
	} // end while

	return 0;
}