Cod sursa(job #1207303)
Utilizator | Data | 12 iulie 2014 18:56:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
long n,i,a,b;
int gcd(long a, long b){
if(!b)return a;
return gcd(b,a%b);
}
int main()
{ ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(i=1;i<=n;i++){
f>>a>>b;
g<<gcd(a,b)<<endl;
}
}