Cod sursa(job #2228283)
Utilizator | Data | 3 august 2018 10:36:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b){
int r;
r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{
int a, b, t, i;
f>>t;
for(i=1; i<=t; i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<"\n";
}
return 0;
}