Cod sursa(job #1367889)
Utilizator | Data | 2 martie 2015 11:16:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
int cmmdc(int a, int b)
{
while (a!=b)
{
if (a>b) a=a-b;
else b=b-a;
}
return a;
}
int main()
{
f>>n;
for (int i=1; i<=n; ++i)
{
f>>a>>b;
g<<__gcd(a,b)<<'\n';
}
f.close();
g.close();
return 0;
}