Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- long long a[5];
- int main()
- {
- int n;
- long long W,URM,X,Y,Z,sol;
- cin>>n>>W>>X>>Y>>Z;
- ++a[W%5];
- for(int i=2;i<=n;++i)
- URM=(W*X+Y)%Z,++a[URM%5],W=URM;
- sol=0;
- for(int i=0;i<5;++i)
- for(int j=i;j<5;++j)
- for(int k=j;k<5;++k)
- if((i+j+k)%5==0)
- {
- if(i==j&&j==k)
- sol+=(a[i]*(a[i]-1)*(a[i]-2)/6);
- else if(i==j)
- sol+=(a[i]*(a[i]-1)/2*a[k]);
- else if(j==k)
- sol+=(a[j]*(a[j]-1)/2*a[i]);
- else
- sol+=(a[i]*a[j]*a[k]);
- }
- cout<<sol<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement