Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- using namespace std;
- int main(){
- queue<int> q;
- int n;
- cin>>n;
- for(int i=0;i<5;i++){
- int a;
- cin>>a;
- q.push(a);
- }
- int ch13=0;
- int nech13=0;
- int chN13=0;
- int nechN13=0;
- int ans=0;
- for(int i=5;i<n;i++){
- int a;
- cin>>a;
- q.push(a);
- if(q.front()%2==0){
- if(q.front()%13==0){
- ch13++;
- }
- else{
- chN13++;
- }
- }
- else{
- if(q.front()%13==0){
- nech13++;
- }
- else{
- nechN13++;
- }
- }
- if(q.back()%2==0){
- if(q.back()%13==0){
- ans+=nechN13;
- }
- ans+=nech13;
- }
- else{
- if(q.back()%13==0){
- ans+=chN13;
- }
- ans+=ch13;
- }
- q.pop();
- }
- cout<<ans;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement