Cod sursa(job #561907)
Utilizator | Data | 21 martie 2011 22:21:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long n, a,b,c,i;
int main()
{
f>>n;
for(i=1;i<=n;i++) { f>>a>>b;
while(b) { c=a%b;
a=b;
b=c;
}
g<<a<<"\n";
}
f.close();
g.close();
return 0;
}