Pagini recente » Cod sursa (job #784264) | Cod sursa (job #2615704) | Cod sursa (job #678721) | Cod sursa (job #2123535) | Cod sursa (job #2449193)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long factorial(int n)
{
int i,p=1;
for(i=1;i<=n;i++)
p=p*i;
return p;
}
long long verif(int n, int x)
{
int nr=0,y=x;
while(n!=0 && y!=0)
{
if(n%10==0) nr++;
n=n/10;
y--;
}
if(nr==x) return 1;
else return 0;
}
int main()
{
int N,P,nr;
cin>>P;
for(int i=1;i<=35;i++)
{
cout<<i<<" "<<factorial(i)<<endl;
}
}