Cod sursa(job #2251340)
Utilizator | Data | 1 octombrie 2018 14:07:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a, int b){
int t;
while(b){
t = b;
b = a % b;
a = t;
}
return a;
}
int main()
{
int n, a, b;
for(int i=1; i<=n; i++){
f >> a >> b;
g << gcd(a, b)<<'\n';
}
return 0;
}