Cod sursa(job #1001590)
Utilizator | Data | 25 septembrie 2013 17:01:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int x, int y)
{
int r=x%y;
while(r!=0)
{
x=y;
y=r;
r=x%y;
}
return y;
}
int main()
{
int x,y,t;
f>>t;
for(int i=0;i<t;i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<endl;
}
return 0;
}