Cod sursa(job #2462231)
Utilizator | Data | 26 septembrie 2019 21:52:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, i, a, b, r;
int main()
{
f >> n;
for(i = 1; i <= n; i++) {
f >> a >> b;
while(b) {
r = a%b;
a = b;
b = r;
}
g << a << '\n';
}
return 0;
}