Cod sursa(job #1584830)
Utilizator | Data | 30 ianuarie 2016 15:20:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
int CMMDC(int a, int b)
{
int r;
while (b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
void Citire()
{
int i,a,b;
fin>>n;
for (i=1; i<=n; i++)
{
fin>>a>>b;
fout<<CMMDC(a,b)<<"\n";
}
}
int main()
{
Citire();
fin.close();
fout.close();
return 0;
}