Cod sursa(job #811491)
Utilizator | Data | 12 noiembrie 2012 14:53:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
int a,b,c,i,n;
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;
}