Cod sursa(job #120170)
| Utilizator | Data | 4 ianuarie 2008 14:12:22 | |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream.h>
using namespace std;
int main()
{ long long n,c=0,r,a[15000],c1,c2,i,j;
ifstream f1("pairs.in");
ofstream f2("pairs.out");
f1>>n;
for (i=1;i<=n;i++)
f1>>a[i];
for (i=1;i<=n;i++)
for (j=i+1;j<=n;j++)
{
c1=a[i];
c2=a[j];
while(a[i]%a[j])
{
r=a[i]%a[j];
a[i]=a[j];
a[j]=r;
}
if (a[j]==1) c++;
a[i]=c1;
a[j]=c2;
}
f2<<c;
return 0;
}