Cod sursa(job #811296)
Utilizator | Data | 11 noiembrie 2012 20:58:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
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 x, int y)
{
int z;
while(y!=0)
{
z=x%y;
x=y;
y=z;
}
return x;
}
int main()
{
int i,t,a,b;
in>>t;
for(i=1;i<=t;i++)
{
in>>a>>b;
out<<cmmdc(a,b)<<"\n";
}
return 0;
}