Cod sursa(job #2499935)
Utilizator | Data | 26 noiembrie 2019 23:23:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
long long a,b,r,n,i;
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>a>>b;
out<<cmmdc(a,b)<<endl;
}
return 0;
}