Cod sursa(job #2065093)
| Utilizator | Data | 13 noiembrie 2017 13:06:38 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <iostream>
using namespace std;
int gcd(int a, int b)
{
int r;
while(b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
ifstream in("euclid.in");
ofstream out("euclid.out");
int t;
in >> t;
for(int i = 0;i < t;++i)
{
int a, b;
in >> a >> b;
out << gcd(a, b) << "\n";
}
in.close();
out.close();
}
