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