Cod sursa(job #2176630)
Utilizator | Data | 17 martie 2018 21:01:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd (int a, int b)
{
while (b != 0)
{
int r = a%b;
a = b;
b = r;
}
return a;
}
int main()
{
int T, a, b;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>T;
while (T > 0)
{
fin>>a>>b;
fout<<gcd(a,b)<<endl;
T--;
}
return 0;
}