Cod sursa(job #2172532)
Utilizator | Data | 15 martie 2018 16:53:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b){
int c;
if (a<b){
c=a;
a=b;
b=c;
}
c=a%b;
while (c!=0){
a=b;
b=c;
c=a%b;
}
return b;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,i,a,b;
f >> n;
for (i=1; i<=n;i++){
f >> a >> b;
g << cmmdc(a,b)<< "\n";
}
return 0;
}