Pagini recente » Cod sursa (job #1100174) | Cod sursa (job #569000) | Cod sursa (job #2985560) | Cod sursa (job #1751596) | Cod sursa (job #2664762)
#include<iostream>
using namespace std;
int fireduct(int a,int b,int n)
{
int k=1,ok=0;
while(k!=n)
{if(a<b)
if(b%a==0 || (a%k==0 && b%k==0))
ok=0;
else ok=1;
///{break;}
if(b<a)
if(a%b==0)
ok=0;
else ok=1;
k++;}
return ok;
}
int fireduct2(int a,int b,int n)
{
int k=2,ok=0;
for(k=2;k<=n;k++)
{if(a<b)
if(a%k==0 && b%k==0|| ok==0)
ok=0;
else return 1;
///{break;}
/// if(b<a)
/// if(a%b==0)
/// ok=0;
/// else ok=1;
}
return ok;
}
int fireduct3(int a,int b,int n)
{
int k=2,ok=0;
for(k=2;k<=n;k++)
{if(b<a)
if(a%k==0 && b%k==0|| ok==0)
ok=0;
else return 1;
///{break;}
/// if(b<a)
/// if(a%b==0)
/// ok=0;
/// else ok=1;
}
return ok;
}
int main()
{
int num1,num2,n,i,j,t;
cin>>n;
num1=num2=1;
cout<<num1<<"/"<<num2<<" ";
t=1;
for(i=1;i<=n;i++)
{num1=i;
for(j=1;j<=n;j++)
{num2=j;
if( fireduct(num1,num2,n)==1 || (num1==1 ||num2==1) && (fireduct3(num1,num2,n)==0 || fireduct2(num1,num2,n)==0 ))
{t++; cout<<num1<<"/"<<num2<<" ";}}}
cout<<t;
return 0;
}
///num1%num2!=0 && num2%num1!=0) ||