Cod sursa(job #1378085)
Utilizator | Data | 6 martie 2015 10:29:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f;
ofstream g;
int main()
{ f.open("euclid2.in");
g.open("euclid2.out");
int T,a,b,i;
f>>T;
for(i=1;i<=T;i++)
{f>>a>>b;
cout<<__gcd(a,b)<<endl;}
f.close();
g.close();
return 0;
}