Cod sursa(job #811743)
Utilizator | Data | 12 noiembrie 2012 21:34:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int x,int y)
{
int z;
while (z!=0)
{
z=x%y;
x=y;
y=z;
}
return x;
}
int main()
{
int i,a,b,n;
in>>n;
for(i=0;i<n;i++)
{
in>>a>>b;
out<<cmmdc(a,b)<<"\n";
}
in.close();
out.close();
return 0;
}