Cod sursa(job #538660)
| Utilizator | Data | 21 februarie 2011 20:04:25 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
int a[100000];
using namespace std;
int main()
{ int n,i,x,a,b,r;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a>>b;
while((a!=0)&&(b!=0))
{
if(a>b)
{
a=a%b;
}
else
{
b=b%a;
}
}
if(a==0) fout<<b<<endl;
if(b==0) fout<<a<<endl;
}
fin.close();
fout.close();
return 0;
}
