Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- using namespace std;
- int main(){
- int n;
- cin>>n;
- queue<int> q;
- int k1=0, k13=0;
- int a, ans=0;
- for(int i=0;i<3;i++){
- cin>>a;
- q.push(a);
- }
- for(int i=3;i<n;i++){
- if(q.front()%13==0){
- k13++;
- }
- else{
- k1++;
- }
- cin>>a;
- if(a%13==0){
- ans+=k1+k13;
- }
- else{
- ans+=k13;
- }
- q.pop();//убираю 1 элемент очереди
- q.push(a);//добавляю а
- }
- cout<<ans;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement