Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)

	for scanner.Scan() {
		count := 0
		for i := 9; i >= 0; i-- {
			numCpy, _ := strconv.Atoi(scanner.Text())
			if numCpy-i >= 0 {
				for j := 9; j >= 0; j-- {
					numCpyi := numCpy - i
					if numCpyi-j >= 0 {
						for k := 9; k >= 0; k-- {
							numCpyj := numCpyi - j
							if numCpyj-k >= 0 {
								for l := 9; l >= 0; l-- {
									numCpyk := numCpyj - k
									if numCpyk-l == 0 {
										count++
										break
									}
								}
							}
						}
					}
				}
			}
		}
		fmt.Println(count)
	}

}

C++: #include<iostream>
using namespace std;
int main(){
	int a,b=0;
	while(cin>>a){
		for(int a1=1;a1<10;a1++){
			for(int a2=1;a2<10;a2++){
				for(int a3=1;a3<10;a3++){
					for(int a4=1;a4<10;a4++){
						if(a1+a2+a3+a4==a){
							b++;
						}
					}
				}
			}
		}
		cout<<b<<endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int main(){
        int a;
        while(cin>>a){
           LL c=0;
           REP(i,10){
               REP(j,10){
                   REP(k,10){
                       REP(l,10){
                           if(i+j+k+l==a)c++;
                       }
                   }
               }
           }
           cout<<c<<endl;
        }
	return(0);
}

C++: #include <iostream>

using namespace std;

int main() {
	int num;
	int a,b,c,d,cnt=0;
	while(cin>>num, !cin.eof()){
		cnt=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==num) cnt++;
		cout<<cnt<<endl;
	}
	return 0;
}

C++: #include<stdio.h>

int saiki(int n){
	int a,b,c,d;
	for(int i=0;i<10;i++){
		
	}
}

int main(void){
	int n,cnt;
	while(scanf("%d",&n)!=-1){
		cnt=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)cnt++;
					}
				}
			}
		}
		printf("%d\n",cnt);
	}
	return 0;
}

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

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

	return 0;
}

C++: #include <iostream>

using namespace std;

int main(int argc, char **argv)
{
	int n, tmp, count;
	while(cin >> n){
		count = 0;
		for(int i = 0; i <= 9; i++){
			if(i > n){
				break;
			}
			for(int j = 0; j <= 9; j++){
				if((i + j) > n){
					break;
				}
				for(int k = 0; k <= 9; k++){
					tmp = i + j + k;
					if(tmp > n){
						break;
					}
					for(int l = 0; l <= 9; l++){
						if(n == (tmp+l)){
							count++;
							break;
						}
					}
				}
			}
		}
		
		cout << count << endl;
	}
	
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
	int n, count=0;
	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) count++;
				}
			}
		}
	}
	cout << count << endl;
	return 0;
}

C++: #include<stdio.h>
int main()
{
  int i,j,k,l,cou,n;
  scanf("%d",&n);
  for(i=0;i<=9;i++){
    for(j=0;j<=9;j++){
      for(k=0;k<=9;k++){
	for(l=0;l<=9;l++){
	  if(i+j+k+l==n)cou++;
	}
      }
    }
  }
  printf("%d\n",cou);
  return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<cstring>
#include<sstream>
using namespace std;
 
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl  
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
#define lb(v,n) lower_bound(v.begin(),v.end(),n)
#define ub(v,n) upper_bound(v.begin(),v.end(),n)
#define mae(v) max_element(v.begin(),v.end())
#define mie(v) min_element(v.begin(),v.end())
#define INF 0x7FFFFFFF
#define mod 1000000007
typedef long long ll;
////////////////////////////////////////////////////////////

int main(){
	int n;

	while( cin >> n ){
		ll cnt = 0;
		rep(a,0,10){
			rep(b,0,10){
				rep(c,0,10){
					
					int d = n - a - b - c;
					if( d>=0 && d < 10 ){
						cnt++;
						//cout << "a:" << a << " b:" << b << " c:" << c << endl;
					}
				}
			}
		}

		cout << cnt << endl;
	}

	ret 0;
}

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

int main(void){
     int n,i=0;

     while(cin >> n,!cin.eof()){
	  for(int a=0;a<10;a++){
	       for(int b=0;b<10;b++){
		    for(int c=0;c<10;c++){
			 for(int d=0;d<10;d++){
			      if(n == a+b+c+d){
				   i = i+1;
			      }
			 }
		    }
	       }
	  }
	  cout << i << endl;
	  i=0;
     }


     return 0;
}

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

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

int main()
{
	int n;

	while(std::cin >> n)
	{

		int a=0,b=0,c=0,d=0;
		
		int count=0;
	
		for(a=0; a<=9; ++a)
		{
			for(b=0; b<=9; ++b)	
			{
				for(c=0; c<=9; ++c)
				{	
					for(d=0; d<=9; ++d)
					{
						if(a+b+c+d==n)
						{
							++count;
						}
					}
				}
			}
		}

		std::cout << count << '\n';
	}
}