View Code of Problem 8

#include<stdio.h>
#include<math.h>
int main()
{

	int n,weishu;
	char a[8];
	int yue[12]={31,28,31,30,31,30,31,31,30,31,30,31};
	scanf("%d",&n);
	
		for(int k=0;k<n;k++)//车牌数 
		{
			int zongshu=0;
			gets(a);
			weishu=a[7]-'0';
				for(int i=0;i<12;i++)//月 
				{
					for(int j=1;j<=yue[i];j++)//日 
					{
						if(weishu-1==(j-10)||weishu-1==j-20||weishu-1==j||weishu+1==(j-10)||weishu+1==j-20||weishu+1==j)
						zongshu++;	
					}		
				}	
				printf("%d",365-zongshu);
		}
		
	
	return 0;
}