Cod sursa(job #1959355)
| Utilizator | Data | 9 aprilie 2017 13:32:29 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int Euclid(int a, int b)
{
if(b==0) return a;
Euclid(b,a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long T;
long long a,b;
f>>T;
for(long i=1; i<=T; i++)
{
f>>a>>b;
g<<Euclid(a,b)<<endl;
}
return 0;
}
