View Code of Problem 8

#include <bits/stdc++.h>
using namespace std;

int mon[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int main(){

    int n;
    cin>>n;
    while(n--){
        string num; 
        cin>>num;
        int c = num[num.size()-1] - '0';
        int cnt=0;
        for(int i = 0; i<12; i++){
            for(int j = 1; j<=mon[i]; j++){
                if((j-1)%10==c|| (j+1)%10 ==c){
                    cnt++;
                }
            }
        }
        cout<<365-cnt<<endl;
    }
    

    return 0;
}