Go: package main

import (
        "fmt"
        "math"
)

var interests [101]float64

func main() {
        var m int
        fmt.Scanf("%d", &m)
        fmt.Printf("%d\n", int(math.Ceil(interest(m)*10))*10000)
}

func interest(m int) (i float64){
        if interests[m] > 0 {
                return interests[m]
        }

        if m == 0 {
                interests[0] = 1.0
                return interests[0]
        }

        if m == 1 {
                interests[1] = 1.05
                return interests[1]
        }
        interests[m] = interest(m/2) * interest(m/2) * interest(m%2)
        return interests[m]
}

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;}

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

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

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

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

	return 0;
}

C++: #include<iostream>

using namespace std;

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

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef vector<int> VI;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    const double rate  = 1.05;
    int debt = 100000;

    int n;
    cin >> n;
    
    REP(i, 0, n) {
        debt *= rate;
        debt = ceil(debt / 1000.0) * 1000;
    }
    
    cout << debt << endl;

    return 0;
}

C++: #include <cstdio>

int main(void)
{
	int n,hensai=100000;

	std::scanf("%d",&n);
	for (int i=0;i<n;++i){
		hensai = hensai*1.05;
		if (hensai%1000){
			hensai -= hensai%1000;
			hensai += 1000;
		}
	}

	std::printf("%d\n",hensai);
}

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

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

	cin>>n;
	for(int i=0;i<n;i++){
		money=money*1.05+0.99999;
		cout<<money<<endl;
	}
	cout<<money*1000<<endl;
}

C++: #include <cstdio>

int main(void) {
	int money = 100000;
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		money *= 1.05;
		if(money % 1000)
			money = money - (money % 1000) + 1000;
	}
	printf("%d\n", money);
	return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <vector>
using namespace std;

const double interest = 0.05;
const int roundYen = 1000;

int weeklyAdd(double debt) {
  debt = debt * (1 + interest);
  debt = ceil(debt / roundYen) * roundYen;
  // std::cout << debt << '\n';
  return debt;
}

int main(int argc, char const *argv[]) {
  // int week = 5;
  int week;
  std::cin >> week;
  double debt = 100000;

  for (size_t i = 0; i < week; i++) {
    debt = weeklyAdd(debt);
  }
  std::cout << debt << '\n';

  return 0;
}

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

int main()
{
	int bor_money = 100000, n;

	cin >> n;

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

		if (0 < (bor_money % 1000)) {
			bor_money /= 1000;
			bor_money += 1;
			bor_money *= 1000;
		}
	}
	cout << bor_money << endl;
    return 0;
}

C++: #include <iostream>

using namespace std;

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

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

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 = roundUp(debt, 4);
    }
    cout << debt << endl;
    
    return 0;
}

int roundUp(int x, int index)
{
    int exp10;
    
    exp10 = pow(10, index - 1);
    x += exp10 - exp10 / 10;
    x /= exp10;
    x *= exp10;
    
    return x;
}