Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"math"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func calc(n int) float64 {
	tmp := 100000.0
	for i := 0; i < n; i++ {
		tmp *= 1.05
		tmp = ceil(tmp, -3)
	}
	return tmp
}

func ceil(f float64, places int) float64 {
	shift := math.Pow(10, float64(places))
	return math.Ceil(f*shift)/shift
}

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

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

int main() {
    double money = 100;
    int result;
    int n;
    
    cin >> n;
    for(int i = 0; i < n; i++) {
        money *= 1.05;
        money = ceil(money);
    }
    result = int(money * 1000);
    cout << result << endl;
    
    return 0;
}

C++: #include <math.h>
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <string>

#define YES "YES"
#define NO "NO"
#define space ' '

using namespace std;

void func();

int main(void)
{
	
	func();

	return 0;
}


void func()
{
	int n, debt,carry;

	debt = 100000;

	cin >> n;
	while (n-- > 0)
	{
		debt = debt * 1.05;
		if (carry = debt % 1000, carry > 0)
		{
			debt += 1000-carry;

		}


		cout << debt << endl;
	}
}

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

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

C++: #include<iostream>
using namespace std;
int main()
{
	int a[10];
	for (int i = 0; i < 10; i++)
	{
		cin >> a[i];
		for (int j = 0; j < 10; j++)
		{
			if (a[0] < a[i])swap(a[i], a[0]);
		}

		for (int j = 0; j < 10; j++)
		{
			if (a[1] < a[i])swap(a[i], a[1]);
		}
			
		for (int j = 0; j < 10; j++)
		{
			if (a[2] < a[i])swap(a[i], a[2]);
		}

	}
	cout << a[0] << endl;
	cout << a[1] << endl; 
	cout << a[2] << endl;
	
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
 
int main(){
int debt = 100000, n;
cin >> n;
for(;n>0;n--){
        debt = debt * 1.05;
        if((debt % 1000)>0)
{        debt = debt - (debt % 1000);        debt += 1000;        }
        }

cout << debt << endl;
 
return 0;
}

C++: #include<iostream>
using namespace std;
int ans=1000;
int main()
{
    int n;
    while(cin>>n)
    {
        for(int i=0;i<n;i++)
        {
            ans*=1.05;
        }
        cout<<ans*100<<endl;
    }
    return 0;
}

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

C++: #include <iostream>
typedef unsigned long long ULL;
using namespace std;
inline ULL round(ULL t)
{
    cout << t << endl;
    return ((ULL)((double)t / 1000 + 0.5))*1000;
}
int main()
{
    int t;
    ULL res = 100000;
    cin >> t;
    while(t--)
    {
        res *= 1.05;
        if(res % 1000 !=0)
            res += 1000 - res % 1000;
    }
    cout << res << endl;
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;


const int Max=10000000;
bool prime[Max];
int main(void){
  int n, sum=100000;
cin >> n;


  for(int i=0; i<n; i++){
    sum = 1.05*sum;
    sum = (sum/1000+1)*1000; 
  }
  cout << sum << endl;
}

C++: #include<stdio.h>
int main()
{
	int n,x,kane=100000,kioku;
	double kane2;
	scanf("%d",&n);
	for(x=0; x<n; x++)
	{
		kioku=kane;
		kane=kane+kane*0.05;
		kane2=kane*0.001;
		kane2+=0.9;
		kane=kane2;
		kane*=1000;
	}
	printf("%d\n",kane);
	return 0;
}

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

int main(void){
    int n,debt;
    debt=100000;
    std::cin>>n;
    while(n--){
        debt*=1.05;
        if(debt%1000){
            debt+=1000-debt%1000;    
        }
    }
    std::cout<<debt<<std::endl;
    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 * n;
	interest /= 20;
	return debt + interest + EPS;
}

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

C++: #include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <math.h>

using namespace std;

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

  int debt = 100000;
  for (int i=0; i<n; i++) {
    debt += debt*0.05;

    int amari = debt % 1000;
    if (amari > 0) {
      debt -= amari;
      debt += 1000;
    }
  }
  cout << debt << endl;

  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){int n,m=1e5;
for(cin>>n;n>0;n--)m=(m*105/100+999)/1000*1000;
cout<<m<<endl;
return 0;}

C++: #include <iostream>
#include <algorithm>
int main()
{
  const int BASE = 100000;
  int n, debt = BASE;
  std::cin >> n;
  while (n--) {
    debt = (debt * 1.05 + 999) / 1000;
    debt *= 1000;
  }
  std::cout << debt << std::endl;
  return 0;
}