View Code of Problem 8

#include<iostream>
#include<stdio.h>
#include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
int main(){
    int times;
    int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
    cin>>times;
    while(times--)
    {
        string a;
        int tem=0;
        cin>>a;
        int len=a.length();
        int num=a[len-1]-'0';
        //cout<<num<<endl;
        for(int i=0;i<12;i++)
        {
            for(int j=1;j<=day[i];j++)
                if((j-1)%10==num||(j+1)%10==num)
                tem++;
        }
        cout<<365-tem;
        if(times>=1)
            cout<<endl;
    }
return 0;
}

Double click to view unformatted code.


Back to problem 8