Mai intai trebuie sa te autentifici.
Cod sursa(job #3213568)
Utilizator | Data | 13 martie 2024 11:52:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#define oo 2000000
using namespace std;
ifstream fin("a.in");
ofstream fout("castel2.out");
int main()
{
int n;
int a, b;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> a >> b;
while (b)
{
int r = a % b;
a = b;
b = r;
}
fout << a<<endl;
}
}