Cod sursa(job #2702186)
Utilizator | Data | 3 februarie 2021 10:19:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int x, int y) {
while (y != 0) {
int r = x % y;
x = y;
y = r;
}
return x;
}
int main (){
int t;
fin >> n;
for (int i = 1; i <= t; ++i) {
int a, b;
fout << gcd(a, b);
}
return 0;
}