Cod sursa(job #3216077)
Utilizator | Iosub Dragos Casian dragosdragonn | Data | 15 martie 2024 17:03:14 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
int cmmdc(int x,int y)
{
int r;
while(y)
{
r=x%y;
x=y;
y=r;
}
return x;
}
void citire()
{
fin>>n;
int x,y;
for(int i=0;i<n;i++)
{
fin>>x>>y;
fout<<cmmdc(x,y)<<'\n';
}
}
int main()
{
citire();
return 0;
}