Cod sursa(job #1357091)
Utilizator | Data | 23 februarie 2015 19:19:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int cmmdc(int a,int b)
{
int r;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int a,b,n,i;
in>>n;
for(i=1;i<=n;++i)
{
in>>a>>b;
out<<cmmdc(a,b)<<"\n";
}
return 0;
}