Cod sursa(job #1097632)
Utilizator | Data | 3 februarie 2014 18:31:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int x,int y)
{
while (x!=y)
{
if (x>y)
x=x-y;
else
y=y-x;
}
return x;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long t,i;
int x,y;
f>>t;
for (i=0;i<t;i++)
{
f>>x;
f>>y;
g<<cmmdc(x,y)<<"\n";
}
f.close();
g.close();
return 0;
}