Cod sursa(job #1629789)
Utilizator | Data | 4 martie 2016 18:36:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<string.h>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int GCD( int a, int b )
{
if(!b)
return a;
return GCD( b, a%b );
}
int main()
{
int nr1, nr2 , x;
f >> x;
for( int i = 1; i<=x; i++ )
{
f >> nr1 >> nr2;
g << GCD( nr1, nr2 ) << "\n";
}
f.close();
g.close();
return 0;
}