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 * n;
	interest /= 20;
	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()
{
  int week,bal=100000,i,flg;
  cin >> week;
  for(i=0;i<week;i++)
  {
    flg = 0;
    bal = bal * 1.05;
    if(bal % 1000 == 0)
    flg = 1;
    bal /= 1000;
    bal *= 1000;
    if(!flg)
    bal += 1000;
  }
  cout << bal << endl;
  return 0;
}

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	EACH(x,vec) is >> x;
	return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	REP(i,vec.size()) {
		if (i) os << " ";
		os << vec[i];
	}
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
	REP(i,vec.size()) {
		if (i) os << endl;
		os << vec[i];
	}
	return os;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	ll n; cin >> n;
	ll ans = 100000;
	REP(i, n) {
		ans = ((ans * 105+99) / 100 + 999) / 1000 * 1000;
	}
	cout << ans << endl;
}

C++: #include <iostream>

int main (void){
	int week,res=100,i;

	std::cin >> week;

	for(i=0; i < week; i++){
		res += (int)(0.05 * res + 0.99 );
	}
	std::cout << res*1000 << std::endl;
	return 0;
}

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

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

C++: #include<cstdio>

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

C++: #include<bits/stdc++.h>
const long long INF = INT_MAX / 2;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define ll long long int
using namespace std;
ll ans = 0, sum = 0, n, k, cnt = 0, w, h;
string s;
vector<ll> v;
vector < pair<ll, ll > > vp;
vector<vector<ll> > vv(50, vector<ll>(50, INF));
vector<string> vs;
vector<char> vc;
set<ll> st;
map<char, ll> mp;

/*--------------------template--------------------*/

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

C++: //
//  main.cpp
//  CppTest
//
//  Created by Ryu on 2017/02/08.
//  Copyright ?? 2017??´ Ryu. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;

int main(int argc, const char * argv[]) {
    // insert code here...
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    long n = 0;
    cin >> n;
    
    long rest = 100000;
    for (int i = 0; i < n; i++) {
        rest *= 1.05;
    }
    
    if(rest % 10000 != 0){
        rest = rest + 10000 -  rest % 10000;
    }
    
    
    printf("%ld", rest);
    
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	unsigned long long MONAY=100000;
	int n;

	cin>>n;

	for(n=n;n>0;n--){MONAY = MONAY*1.05;
			 MONAY=MONAY+999/1000;}

	cout<<MONAY<<endl;

return 0;
}

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

int main() {
  double debt;
  int n;
  debt = 100000;
  cin >> n;
  for(int i=0;i < n;i++) {
    debt *= 1.05;
    debt /=1000;
    debt += 0.999;
    debt = floor(debt);
    debt *= 1000;
  }
  cout << (long long int)debt << endl;
}

C++: /*
C++ ???????????????????????????????????¬??????
??????AOJ-ITP1??????????????????
*/
#define _USE_MATH_DEFINES

#include <iostream> // ?¨??????\??????
#include <fstream>  // ??????????????\??????
#include <string>   // ???????????¢???
#include <vector>   // ???????????????
#include <cmath>    // ??°??????
#include <iomanip>  // stream???????????¢???
#include <algorithm>// max??¢??°??????

using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;        // ????´???°????????????????????????
using std::fixed;         // ???????????????????¨???????????????????????????????
using std::setprecision;  // ?????°????°???°?????\???????????°????????????????????¨????????\???

int main() {
	int Debt = 100000;
	int a;
	int b;
	cin >> a;
	for (size_t i = 0; i < a; i++)
	{
		// ?????±?????????????¨??????????
		Debt = Debt*1.05;
		// ????????????3???????¨??????????
		b = Debt % 1000;
		if (b > 0) {
			Debt += 1000;
		}
		// ????????????????????????
		Debt = Debt - b;
	}
	cout << Debt << endl;
	return 0;
}

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

int main(){

  int n,a=100000;

  cin >> n;

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

    if(a%1000!=0){
      a=a/1000;
      a++;
      a=a*1000;
    }

  }

  cout << a << endl;

}