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

var sc = bufio.NewScanner(os.Stdin)

func main(){
	for sc.Scan(){
		n := nextInt()
		cnt := 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{
							cnt++
						}
					}
				}
			}
		}
		fmt.Println(cnt)
	}
}

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

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

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

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

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

const int N = 9;

int main(void) {
  int n = 0;

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

    std::cout << count << std::endl;
  }
   
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
int n,a,b,c,d;
while(cin>>n){
int ans=0;
if(n<=36){
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(n==a+b+c+d) ans=ans+1;}
else {ans=0;}
cout<<ans<<endl;}
return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	while(cin >> N){
		int N,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(N == (a+b+c+d)){
							count ++;
						}
					}
				}
			}
		}
		cout << count << endl;
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
  int n;
  int a,b,c,d;
  int ans=0;
  cin >> n;
  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;
  return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main()
{
	int a = 0, b = 0;
	while (cin >> a)
	{
		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 == a)
						{
							b++;
						}
					}
				}
			}
		}
	}
	cout << b << endl;
	
	return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <vector>

namespace {

int combination(int a, int b, int c, int d)
{
  // (a,a,a,a)
  if (a == d) {
    return 1;
  }
  // (a,a,a,d) or (a,b,b,b)
  else if (a == c || b == d) {
    return 4;
  }
  // (a,a,c,c)
  else if (a == b && c == d) {
    return 6;
  }
  // (a,a,c,d) or (a,b,b,d) or (a,b,c,c)
  else if (a == b || b == c || c == d) {
    return 12;
  }
  // (a,b,c,d)
  else {
    return 24;
  }
}

int calc(int n)
{
  int com = 0;
  int a, b, c, d;

  for (a = 0; a <= 9; ++a) {
    for (b = a; b <= 9; ++b) {
      for (c = b; c <= 9; ++c) {
        for (d = c; d <= 9; ++d) {
          const int sum = a + b + c + d;
          if (sum == n) {
            com += combination(a, b, c, d);
          }
          else if (sum > n) {
            return com;
          }
        }
      }
    }
  }

  return com;
}

} // unnamed namespace

int main()
{
  int n;
  while (std::cin >> n) {
    std::cout << calc(n) << std::endl;
  }

  return 0;
}

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

int main() {
  for(int N; cin >> N; ) {
    int ans = 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) ans++;
    cout << ans << endl;
  }
}

C++: #include<iostream>
int t[51],i,j,x,a,b;int main(){for(;i++<10000;t[x]++)for(j=x=0,b=i;j++<4;b/=10)x+=b%10;for(;!(std::cin>>a).eof();)printf("%d\n",t[a]);}

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

int main(){
	
	int n;
	int a, b, c, d;
	int combsum=0;

	while(cin >> n){
		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 )
							combsum++;

		cout << combsum << endl;
                combsum = 0;
	}
	return 0;
}

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

int main(){
  int a,b,c,d,n;
  int ans=0;
  while(scanf("%d",&n) != EOF){
    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;
  }
    return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
  int n=0;
  int C=0;
  int a,b,c,d;
  cin>>n;
  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){
					  C++;
				  }
			  }
		  }
	  }
  }
  cout<<C<<endl;
  return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
typedef long long int LLI;
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
  int n;
  while(cin>>n){
    int co=0;
    rep(a,10)rep(b,10)rep(c,10)rep(d,10)if(a+b+c+d==n)co++;
    cout<<co<<endl;
  }
}

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

using namespace std;

int main(){
    int n;
    while(cin >> n){
        int a = 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++){
                        int x = i + j + k + l;
                        if(n==x){
                            a++;
                        }
                    }
                }
            }
        }
        cout << a << endl;
    }
}

C++: #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
main(){
	int n;
	while(cin>>n){
		int sum=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)++sum;
		cout<<sum<<endl;
	}
}

C++: #include <stdio.h>

int main( void ){
    int nCount = 0,input;
    scanf( "%d",&input );

    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 == input ) nCount++;

    printf( "%d\n",nCount );
    return 0;
}

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


int dfs(int c,int s){
    if( c == 0 ) return s == 0;
    int ans = 0;
    for(int i = 0 ; i < 10 ; i++){
        ans += dfs(c-1, s-i);
    }
    return ans;
}

int main() {
    int n;
    while(cin >> n) cout << dfs(4, n) << endl;
}

C++: #include<iostream>

using namespace std;

#define MAX 256

int kai (int x){
	if(x == 1 || x == 0)return 1;
	return x * kai(x - 1);
}

int miku(int x){
	if(x > 36)return 0;
	if(x < 10)return kai(x + 3) / ( kai(x) * 6);
	if(x > 19)return miku(36 - x);
	if(x > 9 && x < 19)return kai(x + 3) / ( kai(x) * 6) - (miku(x - 10) * 4);
}

int main(void){
	int n,i = 0;
	int ans[MAX];
	
	while( cin >> n != EOF){
		ans[i] = miku(n);
		i++;
	}
	
	for(int j = 0;j < i;j++){
		cout << ans [j] <<endl;
	}

	return 0;
}

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int ans[5][37]={ 1 };
    for(int i=1; i<=4; i++) {
        ans[i][0]=ans[i-1][0];
        for(int j=1; j<=36; j++) {
            ans[i][j]=ans[i][j-1]+ans[i-1][j];
            if(j>9) ans[i][j]-=ans[i-1][j-10];
        }
    }

    int n;
    while(cin>>n) {
        if(n>36) cout<<"0\n";
        else cout<<ans[4][n]<<'\n';
    }
    return 0;
}