Cod sursa(job #2377445)
Utilizator | Data | 10 martie 2019 12:24:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,n,k,i;
f>>n;
int cmmdc;
for (k=1;k<=n;k++)
{
cmmdc=1;
f>>a;
f>>b;
for (i=2;i<=min(a,b);i++)
{
if (a%i==0&&b%i==0) cmmdc=i;
}
g<<cmmdc<<"\n";
}
g.close();
f.close();
//varianta de 30 de puncte
return 0;
}