Cod sursa(job #1875436)
Utilizator | Data | 11 februarie 2017 02:42:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int a, int b)
{
int t;
while (b != 0)
{
t = b;
b = a % b;
a = t;
}
return a;
}
int main()
{
int n,a,b;
in>>n;
for( int i=1;i<=n;i++)
{
in>>a>>b;
out<<cmmdc(a,b)<<endl;
}
return 0;
}