View Code of Problem 8

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
	while(n--){
		string s;
		cin>>s;
		int ans=0;
		int x=s[s.size()-1]-'0';
		for(int i=1;i<13;++i){
			for(int m=1;m<=a[i];++m){
				int l=m%10;
				if(l==(x+1)%10||l==(x+9)%10)
				++ans;
			}
		}
		cout<<365-ans<<endl;
	}
}