Cod sursa(job #3346171)
| Utilizator | Data | 12 martie 2026 19:23:00 | |
|---|---|---|---|
| Problema | Infasuratoare convexa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#define NMAX 1000009
using namespace std;
int n,k;
long long v[NMAX];
void citire()
{
cin>>n>>k;
long long a,b,c;
cin>>v[1]>>a>>b>>c;
for(int i=2; i<=n; i++)
{
v[i]=(long long)(a*v[i-1]+b)%c;
}
}
int main()
{
citire();
long long ans,pref;
ans=pref=0;
for(int i=1; i<=n; i++)
{
pref^=v[i];
if(i>=k)
{
pref^=v[i-k];
ans^=pref;
}
}
cout<< ans << "\n";
return 0;
}
