Cod sursa(job #2426868)
Utilizator | Data | 29 mai 2019 19:08:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmd(int a,int b)
{
if (b==0) return a;
return cmd(b,a%b);
}
int main()
{
int n,a,b;
in>>n;
for(int i=1;i<=n;i++)
{
in>>a>>b;
out<<cmd(a,b)<<endl;
}
return 0;
}