Cod sursa(job #3344406)
| Utilizator | Data | 1 martie 2026 22:40:51 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin ("euclid2.in");
ofstream cout ("euclid2.out");
int n,m,x,y,teste;
int cmmdc(int a, int b)
{
while (b)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
cin>>teste;
for (int i=1;i<=teste;i++)
{
cin>>x>>y;
cout<<cmmdc(x,y)<<endl;
}
return 0;
}
