Cod sursa(job #2867338)
Utilizator | Data | 10 martie 2022 12:05:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
struct citire{
int a, b;
inline void read(){
fin>>a>>b;
}
}v[10000];
int GCD(int a, int b){
if(!b) return a;
return GCD(b, a%b);
}
int main()
{ int n, i;
fin>>n;
for(i=1;i<=n;i++) v[i].read(),
fout<<GCD(v[i].a, v[i].b)<<"\n";
return 0;
}