Cod sursa(job #1533976)
Utilizator | Data | 23 noiembrie 2015 09:50:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int T,a,b,i;
int cmmdc(int x,int y);
void citire();
int main()
{
citire();
return 0;
}
void citire()
{
f>>T;
for(i=0;i<T;i++)
{f>>a>>b;
cmmdc(a,b);
}
}
int cmmdc(int x, int y)
{int k;
while(b)
{
k=a%b;
a=b;
b=k;
}
g<<a+b<<"\n";
}