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++: #pragma GCC optimize "O3"
#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>
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#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 FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define REP_FROM(i,m,n) for (int i = (m); (i) < int(n); ++(i))
#define REP_REV(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define REP_FROMREV(i,m,n) for (int i = (n)-1; (i) >= int(m); --(i))
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#ifndef LOCAL
#define cerr if (false) cerr
#endif
using namespace std;
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();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

template <class T> inline void setmax(T & a, T const & b) { a = max(a, b); }
template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }
template <class T> T sq(T x) { return x * x; }
template <class T> T clamp(T a, T l, T r) { return min(max(a, l), r); } // [l, r]
const double EPS = 1e-10;
const double PI  = acos(-1.0);

const int debt = 100000;

int solve(int n) {
	n++;
	int interest = (debt / 20) * n;
	return debt + interest;
}

int main(int argc, char *argv[]) {
	// Something to do
	int n;
	while(cin >> n) {
		cout << solve(n) << endl;
	}
	return 0;
}

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

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

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

using _i64 = int64_t;
using _u64 = uint64_t;
using _f64 = double;

#define _for(i, start, end) for(_i64 i = (_i64)start; i < (_i64)end; ++i)
#define _rep(i, number) _for(i, 0, number)
#define _foreach(e, data) for(auto& e : data)
#define _all(data) data.begin(), data.end()

template<typename type>
_i64 _size(const type& data) { return static_cast<_i64>(data.size()); }
template<typename type, size_t size>
_i64 _size(const type (&)[size]) { return static_cast<_i64>(size); }

enum _flag : bool { able = true, disable = false };

struct _time {
    _time(_flag flag) { check = flag; if(!check) { return; } gettime(start); }
    ~_time() {
        if(!check) { return; }; gettime(end);
        _i64 elapse = chrono::duration_cast<chrono::milliseconds>(end - start).count();
        cout << endl << "Time: " << elapse << " ms" << endl;
    }
    private:
    using _timer = chrono::time_point<chrono::system_clock>;
    _timer start, end; bool check;
    void gettime(_timer& time) { time = chrono::system_clock::now(); }
};

struct _ini { _ini() { ios::sync_with_stdio(false); cin.tie(nullptr); } } _ini;

int main() {
    {
        _time time(disable);
        _i64 n, debt = 100000; cin >> n;
        _rep(i, n) {
            debt *= 1.05;
            if(debt % 1000 != 0) { debt += 1000 - debt % 1000; }
        }
        cout << debt << endl;
    }
    return 0;
}

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

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

C++: #include <iostream>

double round_up(double n){
        int i=(int)n;
        if(i%1000>0){
                i-=i%1000;
                i+=1000;
        }
        return i;
}

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

        double result=100000;
        for(int i=n;i;i--){
                result*=1.05;
                result=round_up(result);
        }
        std::cout << result;
        return 0;
}

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

int main() {
	int money = 100;
	int n;
	cin >> n;

	while(n--) { money += money % 20 ? money / 20 + 1 : money / 20; }

	cout << money << "000" << endl;
	return 0;
}

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

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;

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

llong Round(llong x){
	double y = (double)x;

	y /= 1000;
	
	y = ceil(y);

	x= (llong)y*1000;

	return x;
}

int main(){
	ios::sync_with_stdio(false);

	int n;
	llong m = 100000;

	cin >> n;

	for (int i = 0; i < n; i++){
		m = m + (llong)m/20;
		m = Round(m);
	}

	cout << m << endl;
}

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

int n, m = 100000;

int main()
{
	cin >> n;

	for (int i = 0; i < n; i++)
		m += (m / 20 + 999) / 1000 * 1000;

	cout << m << endl;

	return 0;
}

C++: #include <iostream>
#include <math.h>

using namespace std;

int calcDebt(int debt){
	double tmp = debt * 1.05;
	int result = (int) ceil(tmp);
	if(result % 1000 == 0){
		return result;
	}else{
		return (result / 1000 + 1) * 1000;
	}
}

int main(int argc, char *argv[]) {
	int result = 100000;
	int n;
	scanf("%d", &n);
	for(int i=0; i<n; i++){
		result = calcDebt(result);
	}
	printf("%d", result);
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <stdio.h>

using namespace std;

int main()
{
	unsigned long m=100000,n;

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

	cout<<m<<endl;

	return 0;
}

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

int main()
{
  int n;
  int m = 100000;
  cin >> n;
  for(int i = 0; i < n; i++){
    m += m / 20;
    if(m % 1000){
      m += 1000 - m % 1000;
    }
  }
  cout << m << endl;
}