Cod sursa(job #1697516)
Utilizator | Data | 2 mai 2016 12:38:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream fin("euclid2");
ofstream fout("euclid2");
int cmmdc(int a, int b)
{
int r;
while (b!=0 )
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int T,a,b,i;
fin>>T;
for (i=1;i<T;i++)
{
fin>>a>>b;
fout<<cmmdc(a,b);
}
return 0;
}