C :

#include <stdio.h>
int main(){
    int m,n,i,j[9]={1,2,6,24,120,720,5040,40320,362880};
    scanf("%d",&m);
    while(m--){
        scanf("%d",&n);
        if(!n || n>409113){
            puts("No");
            continue;
        }
        for(i=8;i>=0;i--)
            if(n>=j[i])
                n-=j[i];
        puts(n?"No":"Yes");
    }
    return 0;
}

C++ :

#include<iostream>
#include<cstdio>
using namespace std;
int a[15]={1,2,6,24,120,720,5040,40320,362880};
int n;
bool b[100000]={0};

int main()
{
	int n,m,i,j,t;
	cin>>m;
	bool flag;
	for(j=1;j<=m;++j)
	{	
	cin>>n;
	
	flag=false;
	
	int z=n;
		
	for(i=8;i>=0;--i)
	{
		if(z>=a[i]&&z>0)
		z-=a[i];
		if(z==0)
		flag=true;
	}
	
	
	if(flag==false||n==0)
	cout<<"No"<<endl;
	if(flag==true&&n!=0)
	cout<<"Yes"<<endl;
	
	
		
	}
	return 0;
	}

Pascal :

var m,n,s:longint;
    i,j,max:longint;
    a:array[1..9]of longint;
begin
  a[1]:=1;
  max:=1;
  for i:=2 to 9 do
  begin
    a[i]:=a[i-1]*i;
    max:=max+a[i];
  end;
  readln(m);
//  while not eof do
  for i:=1 to m do
  begin
    readln(s);
    if (s<=0) or (s>max) then
    begin
      writeln('No');
      continue;
    end;
    for j:=9 downto 1 do
      if s>=a[j] then s:=s-a[j];
    if s=0 then writeln('Yes')
    else writeln('No');
  end;
end.