Cod sursa(job #2266538)
Utilizator | Data | 22 octombrie 2018 19:11:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a,int b){
if(!b)
return a;
return gcd(b,a%b);
}
int main()
{
fstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,n,i;
f>>n;
for(i=0;i<n;i++){
f>>a>>b;
g<<gcd(a,b);}
f.close();
g.close();
}