Cod sursa(job #1746747)
Utilizator | Data | 23 august 2016 20:51:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int A,int B)
{
int aux,R;
if(A<B)
{aux=A;
A=B;
B=aux;}
while(B!=0)
{
R=A%B;
A=B;
B=R;
}
return A;
}
int main()
{
int T,a,b,i;
f>>T;
for(i=1;i<=T;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
return 0;
}