Cod sursa(job #2379704)
Utilizator | Data | 13 martie 2019 22:17:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
int x,y,n,i;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int A, int B)
{
if (B==0) return A;
if (A > B) return gcd(A-B, B);
return gcd(A, B-A);
}
int main(){
f>>n;
for(i=1;i<=n;i++){
f>>x>>y;
g<<gcd(x,y);
}
return 0;
}