Cod sursa(job #1117914)
Utilizator | Data | 23 februarie 2014 21:04:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream in("euclid2.in",ios::in);
ofstream out("euclid2.out",ios::out);
int T,a[1000],b[1000];
in>>T;
for(int i=0;i<T;++i)
{
in>>a[i];
in>>b[i];
}
for(int i=0;i<T;++i)
{
while(a[i]!=b[i])
{
if(a[i]>b[i])
a[i]=a[i]-b[i];
else
b[i]=b[i]-a[i];
}
out<<a[i];
out<<"\n";
}
return 0;
}