Cod sursa(job #2300135)
Utilizator | Data | 10 decembrie 2018 21:45:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
int r = a % b;
while(r!=0)
{
a = b;
b = r;
r = a%b;
}
return b;
}
int main()
{
int n, a, b;
f>>n;
for(int i=1; i<=n; i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
return 0;
}