Cod sursa(job #2445568)
Utilizator | Data | 4 august 2019 18:12:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int a,b;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int gcd(int a, int b)
{
int c;
while (a%b != 0)
{
c = a%b;
a = b;
b = c;
}
return b;
}
int main()
{
int i, n;
in>>n;
while(n)
{
in>>a>>b;
out<<gcd(a,b)<<endl;
n--;
}
return 0;
}