Pagini recente » Cod sursa (job #3224813) | Cod sursa (job #2459155) | Cod sursa (job #575320) | Cod sursa (job #2560561) | Cod sursa (job #109684)
Cod sursa(job #109684)
#include<fstream.h>
#define dim 100001
long v[dim],l,nr[15];
long prim(long a,long b)
{long r;
do
{r=a%b;a=b;b=r;}
while(r);
return a;
}
void adun()
{long t,i;
nr[0]=nr[0]++;
t=nr[0]/10;nr[0]=nr[0]%10;
i=1;
while(t) {nr[i]+=t;t=nr[i]/10;nr[i]=nr[i]%10;i++;}
i--;if(i>l) l=i;
}
int main()
{long n,i,ok,j;
ifstream f("pairs.in");
ofstream g("pairs.out");
f>>n;
f>>v[1];
for(i=2;i<=n;i++)
{f>>v[i];
for(j=1;j<i;j++)
{ok=prim(v[i],v[j]);
if(ok==1) adun();
}
}
f.close();
for(i=l;i>=0;i--) g<<nr[i];g<<'\n';
g.close();
return 0;
}