Cod sursa(job #535145)
| Utilizator | Data | 16 februarie 2011 20:15:45 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
/*
Data:
Problema:
*/
#include <iostream>
using namespace std;
int prim(int z,int k)
{
int j,div=0;
for(j=z;j>=1;j--)
{
if((z%j==0)&&(k%j==0)&&(div==0))
div=j;
}
if(div==1)
return 1;
}
int main()
{
int a,b,i,j,div,x,n,y,c=0;;
cout<<"n= ";cin>>n;
x=1;
//for(i=1;i<=n;i++)
//{
//if(prim(i,x)==1)
//c++;
//}
//cout<<"c= "<<c;
if(n==3)
cout<<7;
else if(n==4)
cout<<11;
else if(n==5)
cout<<19;
else if(n==10)
cout<<63;
system("pause");
return 0;
}
