Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <stdio.h>
- int main(){
- int n;
- std::cin >> n;
- int a[5]={0};
- int k1=0, k2=0, k13=0, k26=0, k=0;
- for(int i=0; i<5 && i<n; i++){
- std::cin >> a[i];
- if(a[i]%2==0){
- k2++;
- if(a[i]%13==0)
- k26++;
- }
- else{
- k1++;
- if(a[i]%13==0)
- k13++;
- }
- }
- k=k1*k26+k13*k2-k13*k26;
- //printf("k1=%d k2=%d k13=%d k26=%d k=%d\n",k1,k2,k13,k26,k);
- for(int i=5; i<n; i++){
- if(a[0]%2==0){
- k2--;
- if(a[0]%13==0)
- k26--;
- }
- else{
- k1--;
- if(a[0]%13==0)
- k13--;
- }
- for(int j=0; j<4; j++)
- a[j]=a[j+1];
- std::cin >> a[4];
- if(a[4]%13==0){
- if(a[4]%2==0){
- k26++;
- k2++;
- k+=k1;
- }
- else{
- k13++;
- k1++;
- k+=k2;
- }
- }
- else{
- if(a[4]%2==0){
- k2++;
- k+=k13;
- }
- else{
- k1++;
- k+=k26;
- }
- }
- //printf("k1=%d k2=%d k13=%d k26=%d k=%d\n",k1,k2,k13,k26,k);
- }
- std::cout << k;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement