Cod sursa(job #473250)
Utilizator | Data | 28 iulie 2010 14:50:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
#include<math.h>
long n;
long a[500][2];
ifstream f("euclid2.in");
ofstream g("euclid2.out");
void euclid(long a,long b)
{
if(a>b) a=a-b;
else b=b-a;
if(a==b) g<<a;
}
int main()
{
int i;
f>>n;
i=0;
for(i=0;i<n;i++)
{
f>>a[i][1]>>a[i][2];
euclid(a[i][1],a[i][2]);
}
f.close();
g.close();
return 0;
}