Cod sursa(job #1812451)
Utilizator | Data | 22 noiembrie 2016 09:27:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
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;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a>>b;
fout<<Cmmdc(a,b)<<"\n";
}
fout.close();
return 0;
}