Cod sursa(job #1330527)
Utilizator | Data | 30 ianuarie 2015 19:17:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long cmmdc(long long a, long long b)
{
long long r;
while(b>0)
{
r=b;
b=a%b;
b=r;
}
return a;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n,a,b;
in >> n;
for(int i=0;i<n;i++)
{
in >> a >> b;
out << cmmdc(a,b);
}
return 0;
}