Cod sursa(job #1663916)
Utilizator | Data | 26 martie 2016 11:27:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int n,int m)
{
int x;
while(m!=0)
{
x=n%m;
n=m;
m=x;
}
return n;
}
int main()
{
int n,i,x,y;
in>>n;
for(i=1;i<=n;i++)
{
in>>x>>y;
out<<cmmdc(x,y)<<endl;
}
return 0;
}