Cod sursa(job #2780423)
Utilizator | Data | 6 octombrie 2021 23:05:05 | |
---|---|---|---|
Problema | Calcul | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream fin("muzica.in");
ofstream fout("muzica.out");
unordered_set<long long int> v(100001);
long long n, m, a, b, c, d, e, f, k;
int main() {
fin >> n >> m >> a >> b >> c >> d >> e;
for (int i = 0; i < n; i++) {
fin >> f;
v.insert(f);
}
for (int i = 0; i < m; i++) {
if (v.find(a) != v.end()) {
k++;
v.erase(a);
}
f = (c * b + d * a) % e;
a = b; b = f;
}
fout << k;
}