Go: package main

import (
  "fmt"
)

func main() {
  var a int
  var b int
  for _, err := fmt.Scan(&a); err == nil; _, err = fmt.Scan(&a) {
    b = 0
    for i:=0; i<10; i++ {
      for j:=0; j<10; j++ {
        for k:=0; k<10; k++ {
          for l:=0; l<10; l++ {
            if (i+j+k+l == a) {
              b++
            }
          }
        }
      }
    }
  fmt.Println(b)
  }
}

C++: #include <iostream>

using namespace std;

void solve()
{
	int n;
	while(cin >> n)
	{
		if(n >= 37)
		{
			cout << 0 << endl;
		}
		else
		{
			int count = 0;
			for(int i = 0; i < 10; ++i)
			{
				for(int j = 0; j < 10; ++j)
				{
					for(int k = 0; k < 10; ++k)
					{
						for(int l = 0; l < 10; ++l)
						{
							if(i + j + k + l == n)
							{
								++count;
							}
						}
					}
				}
			}
			cout << count << endl;
		}
	}
}

int main()
{
	solve();
	return(0);
}

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

#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define vmax_v(ary) *max_element(all(ary))
#define vmin_v(ary) *min_element(all(ary))
#define vmax_id(ary) distance((ary).begin(),max_element(all(ary)))
#define vmin_id(ary) distance((ary).begin(),min_element(all(ary)))

using ll = int64_t;
using pll = pair<ll,ll>;
using vl = vector<ll>;

const ll INF=INT64_MAX;
const double EPS=1e-10;
const double PI=acos(-1.0);

void init(){cin.tie(0);ios::sync_with_stdio(false);}
//----------------------------------------------------

int main(){
    init();

    ll n;
    while(cin>>n,!cin.eof()){
      ll ct=0;
      for(int a=0;a<=9;a++){
        for(int b=0;b<=9;b++){
          for(int c=0;c<=9;c++){
            for(int d=0;d<=9;d++){
              if(a+b+c+d==n){
                ct++;
              }
            }
          }
        }
      }
      cout << ct << endl;
    }
    return 0;
}

C++: #include<stdio.h>

int main(){
        int n,m = 0;
        while( scanf("%d",&n)!=EOF){
                if(n > 50)
                        continue;
                for(int i = 0; i < 10;i++){
                        for(int j = 0; j < 10; j++){
                                for(int k = 0; k < 10;k++){
                                        for(int l = 0; l < 10;l++){
                                                if(i + j + k + l == n){
                                                        m += 1;
                                                }
                                        }
                                }
                        }
                }
                printf("%d\n",m);
                m = 0;
        }
        return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
	int n;
	while (cin >> n) {
		int ans = 0;
		for (int i = 0; i < 10; i++)
			for (int j = 0; j < 10; j++)
				for (int k = 0; k < 10; k++)
					for (int l = 0; l < 10; l++)
						if (i + j + k + l == n)
							ans++;
		cout << ans << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main() {
	int n, a, b, c, d, cnt = 0;
	while (cin >> n) {
		cnt = 0;
		for (a = 0; a < 10 && a < n; a++) {
			for (b = 0; b < 10 && b < n; b++) {
				for (c = 0; c < 10 && c < n; c++) {
					for (d = 0; d < 10 && d < n; d++) {
						if (a + b + c + d == n) {
							cnt++;
							break;
						}
					}
				}
			}
		}
		cout << cnt << endl;
	}
	return 0;
}

C++: #include<stdio.h>

int n=0;
int count=0;

int main(){
	while(scanf("%d",&n)!=EOF){
		count=0;
		for(int i=0;i<10;i++){
			for(int j=0;j<10;j++){
				for(int k=0;k<10;k++){
					for(int l=0;l<10;l++){
						if(i+j+k+l==n) count++;
					}
				}
			}
		}
		printf("%d\n",count);
	}
	

	return 0;
}

C++: /*
 * http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0008
 */
#include <iostream>
#include <vector>

using namespace	std;

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

	vector<int> m(51);
	for (int i = 0; i < 10000; i++) {
		m[ i % 10 + i / 10 % 10 + i / 100 % 10 + i / 1000 ]++;
	}

	int n;
	while (cin >> n) {
		cout << m[n] << endl;
		cin.ignore();
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int a, b, c, d, n;
	int x = 0;
	
	while(cin >> n){
		for(int i = 0;i <10;i++){
			for(int j = 0; j < 10; j++){
				for(int k = 0; k < 10; k++){
					for(int l = 0; l < 10; l++){
						if(i + j + k + l == n){
							x++;
						}
					}
				}
			}
		}
		cout << x << endl;
		x = 0;
	}
	
	return 0;
}

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

using namespace std;
int main() {
  int N;
  int money = 100;
  cin >> N;
  for (int i = 0; i < N; i++) {
    money = ceil(money * 1.05);
  }
  cout << money * 1000 << endl;
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int n,g,ans=0;
	while(1){
	cin>>n;
	for(int a=0;a<=9;a++){
		for(int b=0;b<=9;b++){
			for(int c=0;c<=9;c++){
				for(int d=0;d<=9;d++){
					g=a+b+c+d;
					if(g==n)ans++;
				}
			}
		}
	}
	cout<<ans<<endl;
	ans=0;
	}
	return 0;
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑

int main() {
	int n;
	while (cin >> n) {
		int ans = 0;
		for (int i = 0; i <= 9; ++i) {
			for (int j = 0; j = 9; ++j) {
				for (int k = 0; k <= 9; ++k) {
					for (int l = 0; l <= 9; ++l) {
						if (i + j + k + l == n) { ++ans; }
					}
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include<stdio.h>
#include<stdlib.h>
    int main(void){
    int i,j,k,l,n,m,cut;
    while(scanf("%d",&n), n!=EOF){
    cut=0;
    for(i=0;i<10;i++){
        for(j=0;j<10;j++){
            for(k=0;k<10;k++){
                for(l=0;l<10;l++){
                    m=i+j+k+l;
                    if(n==m){
                        cut++;
                    }
                }
            }
        }
    }
        printf("%d",cut);
    }
    return 0;
    }

C++: #include<iostream>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;

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

    int ans = 0;
    rep(a,10)rep(b,10)rep(c,10)rep(d,10){
      if(a+b+c+d == n)ans++;
    }
    cout << ans << endl;
  }
}

C++: #include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
int main(){
	int n,a,ans=0;
	while(cin >> n){
		rep(i,10){
			rep(j,10){
				rep(k,10){
					a=n-i-j-k;
					if(a>=0 && a<10){
						ans++;
					}
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include "stdio.h"

int main()
{
    int n;
    while(scanf("%d", &n) != EOF)
    {
        int count = 0;
        for (int a = 0; a <= 9; a++)
        {
            for (int b = 0; b <= 9; b++)
            {
                for (int c = 0; c <= 9; c++)
                {
                    for (int d = 0; d <= 9; d++)
                    {
                        if (a + b + c + d == n)
                            count++;
                    }
                }
            }
        }
        printf("%d\n", count);
    }
    return 0;
}

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

int main(){
  int n,a,b,c,d;
  while(cin >> n){
    int ans = 0;
    for(a=0;a<10;a++){
      for(b=0;b<10;b++){
        for(c=0;c<10;c++){
          for(d=0;d<10;d++){
            if(a+b+c+d == n) ans++;
          }
        }
      }
    }
    cout << ans << endl;
  }
}