Cod sursa(job #2100370)
Utilizator | Data | 5 ianuarie 2018 15:59:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int divizor(int a,int b){
while(a!=b){
if(a>b) a=a-b;
else b=b-a;
}
return a;
}
int main()
{ int i,n,a,b;
f>>n;
for(i=1;i<=n;i++){
f>>a>>b;
g<<divizor(a,b)<<endl;
}
return 0;
}