Cod sursa(job #345400)
Utilizator | Urs David davidurs1 | Data | 2 septembrie 2009 20:54:26 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream.h>
void main()
{
int x[100],a,b,i,j,t,max;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>t;
for(i=1; i<=t; i++)
{
f>>a; f>>b;
max=0;
if(a > b)
{
for(j=1; j<=b; j++)
if(b%j==0 && a%j==0 && j>max) max=j;
g<<max;
}
else if(a<b)
{
for(j=1; j<=a; j++)
if(a%j==0 && b%j==0 && j>max) max=j;
g<<max;
}
else g<<a;
g<<endl;
}
}