Pagini recente » Cod sursa (job #2659721) | Cod sursa (job #340205) | Cod sursa (job #175708) | Cod sursa (job #1143024) | Cod sursa (job #2626099)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("muzica.in");
ofstream fout("muzica.out");
const int MOD = 65537;
#define int long long
vector <int> v[MOD];
int res = 0;
void cauta(int p)
{
int r = p % MOD;
for(int i = 0; i < v[r].size(); i++)
if(v[r][i] == p)
{
res++;
swap(v[r][i], v[r][v[r].size() - 1]);
v[r].pop_back();
return ;
}
}
main()
{
int n, m;
fin >> n >> m;
int a, b, c, d, e;
fin >> a >> b >> c >> d >> e;
for(int i = 1; i <= n; i++)
{
int x;
fin >> x;
v[x % MOD].push_back(x);
}
cauta(a);
cauta(b);
for(int i = 3; i <= m; i++)
{
a = (b * 1LL * c + d * 1LL * a) % e;
cauta(a);
swap(a, b);
}
fout << res;
}