Cod sursa(job #3162620)
Utilizator | Data | 29 octombrie 2023 15:38:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n,a,b,r;
int gcd(int a,int b)
{
if(b==0 ) return a;
return gcd(b,a%b);
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>a>>b;
fout<<gcd(a,b)<<endl;
}
fin.close();
fout.close();
return 0;
}