Cod sursa(job #610509)
Utilizator | Data | 27 august 2011 16:22:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if (!b) return a;
return cmmdc(b, a % b);
}
int main(){
int a,b,n;
f>>n;
for(int i=1; i<=n;i++){
f>>a>>b;
g<<cmmdc(a,b);
}
}