Cod sursa(job #2752867)
Utilizator | Data | 19 mai 2021 20:55:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
int cmmdc(int a, int b)
{ while(b!=0)
{ int r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{ f>>n;
int x,y;
for(int i=1;i<=n;i++)
{ f>>x>>y;
g<<cmmdc(x,y)<<'\n';
}
g.close();
f.close();
return 0;
}