Cod sursa(job #2924112)
Utilizator | Data | 25 septembrie 2022 17:51:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.in");
int euclid(int a,int b)
{
int r=a%b;
while(r)
{
a=b;b=r;r=a%b;
}
return b;
}
int main()
{
int nrofpairs;
pair<int,int> apair;
fin>>nrofpairs;
for(int i=nrofpairs;i;--i)
{
fin>>apair.first>>apair.second;
fout<<euclid(apair.first,apair.second)<<'\n';
}
return 0;
}