Cod sursa(job #2640478)
Utilizator | Data | 6 august 2020 16:15:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a,int b)
{
while(a!=b)//12 != 42 30
{
if(a>b)
{
a=a-b;
}
else
b=b-a;
}
return a;
}
int main()
{ int a,b,T;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>T;
cin>>T;
for(int i=1;i<=T;i++)
{
f>>a>>b;
cin>>a>>b;
g<<cmmdc(a,b);
cout<<cmmdc(a,b);
}
g.close();
return 0;
}