Cod sursa(job #2090554)
Utilizator | Data | 18 decembrie 2017 13:41:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("euclid2.in")
ifstream out("euclid2.out")
int cmmdc(int a,int b)
{
int r;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n,i,m1,m2;
in>>n;
for(i=1;i<=n;i++)
{
in>>m1>>m2;
out<<cmmdc(m1,m2)<<'\n';
}
return 0;
}