Cod sursa(job #2093398)
Utilizator | Data | 23 decembrie 2017 16:48:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long Euclid(long a,long b)
{
if(b==0) return a;
return Euclid(b,a%b);
}
int main()
{
long N,A,B,r;
ios_base::sync_with_stdio(false);
f.tie(NULL);
f>>N;
for(int i=0;i<N;i++)
{
f>>A>>B;
g<<Euclid(A,B)<<"\n";
}
return 0;
}