Pagini recente » Cod sursa (job #1353991) | Cod sursa (job #1981769) | Cod sursa (job #196898) | Cod sursa (job #3137044) | Cod sursa (job #2742614)
#include <iostream>
#include <fstream>
#include <unordered_set>
using namespace std;
int main() {
unordered_set<long long>Vasile(100001);
ifstream fin("muzica.in");
ofstream fout("muzica.out");
long long n, m, a, b, c, d, e, x, tot = 0, aux;
fin>>n>>m>>a>>b>>c>>d>>e;
for (int i = 0; i < n; ++i) {
fin>>x;
Vasile.insert(x);
}
for (int i = 0; i < m; ++i) {
if (Vasile.find(a) != Vasile.end()){
tot++;
Vasile.erase(a);
}
aux = (b * c + a * d) % e;
a = b;
b = aux;
}
fout<<tot;
return 0;
}