Go: package main
import (
	"fmt"
	"os"
	"strconv"
	"bufio"
	"math"
)

var sc = bufio.NewScanner(os.Stdin)

func main(){
	sc.Split(bufio.ScanWords)
	n := nextInt()
	ans := calc(n)
	fmt.Println(ans)
}

func calc(n int) float64{
	tmp := 100000.0
	for i:=0; i<n; i++{
		tmp+=tmp*0.05
	}
	return Round(tmp, -4)
}

func Round(f float64, places int) float64{
	shift := math.Pow(10, float64(places))
	return math.Floor(f * shift+.5)/shift
}

func next()string{
	sc.Scan()
	return sc.Text()
}

func nextInt()int{
	a, _ := strconv.Atoi(next())
	return a
}

C++: #include <cmath>
#include <cstdlib>
#include <cstdio>

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

int main() {
  long n;
  long ans;

  std::cin >> n;

  ans = 100000 * (100 + n * 5) / 100;
  ans += 5000;
  ans /= 10000;
  ans *= 10000;
  
  std::cout << ans << std::endl;

  return 0;
}

C++: #include <stdio.h>
#include <string>
#include <iostream>

using namespace std;


int main(){
    int week;
    cin >> week;
    double money =10;
    
    for(int i=2; i<week; i++){
        money=double(int(money * 1.05+0.999));
    }
    printf("%d\n",int(money)*10000);
}

C++: #include <iostream>
const int first = 100000;
int round_up(int price) // 1000円未満を切り上げ
{
    if (price%1000 == 0) {
        return price;
    }
    int complement  = 1000 - price%1000; // 補数
    return (price + complement);
}
int get_dept(int n) // n週間後
{
    int dept = first;
    for (int i=0; i<n; i++) {
        dept += dept * 0.05;
        dept = round_up(dept);
    }
    return dept;
}
int main()
{
    int n;
    std::cin  >> n;
    std::cout << get_dept(n) << std::endl;
}

C++: #include <iostream>
using namespace std;
int main(){
	int n;
	cin >> n;
	long a = 100000;
	for(int i=0;i<n;i++){
		a = (a+a/20);
		if(a%1000!=0) a = (a/1000+1)*1000;
	}
	cout << a << endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    double n=100000;
    int a;
    cin>>a;
    for(int i=0; i<a; i++){
        n*=1.05;
        n=(int)(n+999)/1000*1000;
        
    }
    cout<<(int)n<<endl;
}

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

using namespace std;

int main() {
  int m=100000, n;
  scanf("%d", &n);
  for(int i=0;i<n;i++) {
    m*=1.05;
    if (m%1000 != 0)
      m+=1000;
    m=m/1000*1000;
  }
  printf("%d\n", m);
}

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

int main() {
    int d = 100000;
    int n;
    cin >> n;
    while(n-- > 0) {
        d *= 1.05;
        if(d % 1000) {
            d = (d / 1000 + 1) * 1000;
        }
    }
        cout << d << endl;
    return 0;
}

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

int main(){

	int i,n=100000,m;

	cin >> i;
	while(i--){
		n+=n*0.05;
		m=n%1000;
		if(m){
			n+=1000-m;
		}
	}
	cout << n << endl;

	return 0;
}

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

using namespace std;

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

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

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

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

using namespace std;

main(){
	int a=100000;
	int b;
	cin >> b;
	int c=0;
	while (c<b){
		a=a+a*0.05;
		c=c+1;
		a=((a+999)/1000)*1000;
	}
	printf("%d\n",a);
}

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

int main()
{
	int n;
	float b=100000;

	cin>>n;

	for(int i=0;i<n;i++){
		b*=1.05;
		b=(int)((b+999)*0.001);
		b*=1000;
	}
	cout<<b<<endl;
}

C++: #include<stdio.h>
int main(void)
{
	int n,i,w=100000;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		w=w*1.05;
		if(w%1000>0){
			w=w-(w%1000)+1000;
		}
	}
	printf("%d\n",w);
	return 0;
}

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