Cod sursa(job #1621301)
Utilizator | Data | 29 februarie 2016 18:12:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
#include <algorithm>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
int t,a,b;
fin>>t;
for(;t;--t)
{
fin>>a>>b;
//while(a%=b) a^=b^=a^=b;
fout<<__gcd(a,b)<<'\n';
}
return 0;
}