Pagini recente » Cod sursa (job #2869885) | Cod sursa (job #1469567) | Cod sursa (job #426598) | Cod sursa (job #2795029) | Cod sursa (job #109623)
Cod sursa(job #109623)
#include<fstream.h>
#include<math.h>
long v[100001],m[100001];
int prim(long x, long y){
long i;
if(x<=y){
if(x%2==0 && y%2==0) return 0;
for(i = 2; i <= x/2; i++)
if(x%i == 0 && y%i==0) return 0;
return 1;
}
else{ if(x%2==0 && y&2==0) return 0;
for(i = 2; i <= y/2; i++)
if(x%i == 0 && y%i==0) return 0;
return 1;
}
}
int verificare(long x,long y){
long i;
for(i=1;i<=y;i++) if(x==v[i]) return 0;
else return 1;
}
int main(){
long i,j,n,ct=0;
long nr=0;
ifstream f("pairs.in");
ofstream g("pairs.out");
f>>n;
for(i=1;i<=n;i++){ f>>m[i];
if(verificare(m[i],i)) {nr++;v[i]=m[i];}
}
for(i=1;i<=nr;i++){
for(j=i+1;j<=nr;j++){
if(prim(v[i],v[j])==1) ++ct;
}
}
g<<ct<<"\n";
f.close();
g.close();
return 0;
}