Cod sursa(job #2433784)
| Utilizator | Data | 29 iunie 2019 00:01:14 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
while(a!=b)
{
if(a>b) a-=b;
else b-=a;
}
return a;
}
int main()
{
int T, i, a, b;
f>>T;
for(i=1;i<=T;i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<"\n";
}
f.close();
g.close();
return 0;
}
