blob: d8eb85f267f3d1fdc98788c5805fd9e83fc32a7e (
plain) (
tree)
|
|
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
class Obmo {
public:
int z, k, nsd;
set<int> obm;
Obmo () {
z = 0;
k = 0;
obm.clear();
}
void dodaj (int val) {
if (!obm.count()) {
nsd = val;
obm.insert(val);
return;
}
if (obm.count() == 1) {
nsd = gcd(val, nsd);
obm.insert(val);
return;
}
if (val % nsd == 0) {
obm.insert(val);
return;
}
for (auto itr = obm.begin(); itr != obm.end(); itr++) {
if *itr:q
}
}
void odvzemi (int val) {
if (obm.count() == 2) {
obm.erase(val);
nsd = gcd(*obm.begin())
}
}
int get (void) {
return nsd;
}
};
int main (void) {
cout << "hw" << endl;
}
|