Pagini recente » Cod sursa (job #1989264) | Cod sursa (job #753803) | Cod sursa (job #3141309) | Cod sursa (job #1200114) | Cod sursa (job #109402)
Cod sursa(job #109402)
#include <fstream.h>
#include <conio.h>
int cmmdc(long a,long b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else b-=a;
}
if(a==1)
return 1;
return 0;
}
void main()
{
long n,pair[15000],nr=0,b,h=0,ok;
ifstream f("pairs.in");
f>>n;
for(int i=1;i<=n;i++)
{
f>>b;ok=0;
for(int j=1;j<=h&&ok==0;j++)
if(b==pair[j])
ok=1;
if(ok==0)
{h++;pair[h]=b;}
}
f.close();
for( i=1;i<h;i++)
for(int j=i+1;j<=h;j++)
if(cmmdc(pair[i],pair[j])==1)
nr++;
ofstream g("pairs.out");
g<<nr;
g.close();
}