Cod sursa(job #1437034)
Utilizator | Data | 16 mai 2015 19:31:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b){
int temp;
while(b){
temp = a;
a = b;
b = temp % b;
}
return (a < 0) ? -a : a;
}
int a, b, n;
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in >> n ;
for(int i = 0; i < n; i++){
in >> a >> b;
out << gcd(a,b) << endl;
}
}