C :

#include<stdio.h>

int main()
{
	int t,n,m,c1,c2,c5,k;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		k=0;
		for(c5=0;5*c5<=m;c5++)
			for(c2=0;2*c2+5*c5<=m;c2++)
			{
				c1=m-5*c5-2*c2;
				if(c1+c2+c5==n)
					k++;
			}
		printf("%d\n",k);
	}
	return 0;
}

C++ :

#include<stdio.h>

int main()
{
	int t,n,m,c1,c2,c5,k;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		k=0;
		for(c5=0;5*c5<=m;c5++)
			for(c2=0;2*c2+5*c5<=m;c2++)
			{
				c1=m-5*c5-2*c2;
				if(c1+c2+c5==n)
					k++;
			}
		printf("%d\n",k);
	}
	return 0;
}

Pascal :

program p1025;
var m,n,t,i,j,k,c,s:longint;
begin
  readln(t);
  for c:=1 to t do
   begin
     readln(n,m); s:=0;
     for i:=0 to m do
      for j:=0 to (m div 2) do
        begin
          k:=n-i-j;
          if (i+j*2+k*5=m) and (k>=0) then s:=s+1;
        end;
     writeln(s);
    end;
end.

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		while(t-->0){
			int n = in.nextInt();
			int m = in.nextInt();
			int cou = 0;
			for(int i=0;i<=m;i++)
				for(int j=0;j<=m/2+1;j++)
					for(int k=0;k<=m/5+1;k++){
						if(k+j>n || k+i>n || j+i>n)break;
						if(i+j+k==n && i+j*2+k*5==m)
							cou++;
					}
			System.out.println(cou);
		}
	}

}

Python :

import sys

def check(n,m):
    s=0
    for i in xrange(n+1):
        M = m-5*i
        N = n-i
        if  N <= M <=2*N:
            s += 1
        #print i,s
    return s

for line in sys.stdin:
     data = map(lambda x:int(x),line.split())
     if len(data)==2:
        n,m=data
        print check(n,m)