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