Cod sursa(job #2921365)
Utilizator | Data | 30 august 2022 14:36:00 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b,r;
int cmmdc (int a,int b){
if(!=b) return a;
return cmmdc (b,a%b);
}
int main()
{
f>>n;
for(int i=1;i<=n;i++) {
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}