Cod sursa(job #631406)
Utilizator | Data | 7 noiembrie 2011 22:27:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
long int cmmdc(long int a, long int b){
long int r;
while(b!=0){
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{fstream f("euclid2.in",ios::in), g("euclid2.out",ios::out);
long int a,b,t;
f>>t;
for(int i=1;i<=t;i++){
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
return 0;
}