Cod sursa(job #2099161)
Utilizator | Data | 4 ianuarie 2018 00:47:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a ,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
f>>n;
for(int i=0;i<n;i++)
{
f>>a>>b;
g<<gcd(a,b)<<endl;
}
return 0;
}