Cod sursa(job #2412421)
Utilizator | Data | 22 aprilie 2019 11:25:47 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
long long cmmdc(long long x,long long y){
if(y>x){int aux=x; x=y; y=aux;}
long long c;
while(y){
c=x%y;
x=y;
y=c;
}
return x;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
long long a,b;
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
return 0;
}