Cod sursa(job #2718403)
Utilizator | Data | 8 martie 2021 18:33:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
void CMMDC(int a,int b)
{
while(a != b)
if(a > b)
a=a-b;
else
b=b-a;
fout<<a<<'\n';
}
int main()
{ long long n,a,b;
int i;
fin>>n;
for (i=0;i<n;i++)
{
fin>>a>>b;
CMMDC(a,b);
}
return 0;
}