Cod sursa(job #1869123)
Utilizator | Data | 5 februarie 2017 16:42:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int cmmdc (int a, int b)
{
int r;
while (b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main ()
{
int i, a, b, T;
f>>T;
for (i=1; i<=T; i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<'\n';
}
return 0;
}