Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int A,B,C,D,n,x,m,y,MOD,nr,rez;
- unordered_map<int,int> a;
- unordered_map<int,int>::iterator it;
- int main()
- {
- cin>>A>>B>>C>>D>>n>>x>>m>>y;
- ++a[x];
- MOD=B-A+1;
- for(int i=1;i<n;++i)
- nr=A+(x*C+D)%MOD,++a[nr],x=nr;
- it=a.find(y);
- if(it!=a.end())
- ++rez,a.erase(y);
- for(int i=1;i<m;++i)
- {
- nr=A+(y*C+D)%MOD;
- it=a.find(nr);
- if(it!=a.end())
- ++rez,a.erase(nr);
- y=nr;
- }
- cout<<rez;
- return 0;
- }
Add Comment
Please, Sign In to add comment