View Code of Problem 81

#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
struct node{
   int year,month,day;
}s[3];
int isYeap(int year)
{
		if(year%4==0&&year%100!=0||year%400==0)
			return 1;
		else 
			return 0;
}
int main(){
	int n,sum=0;
	scanf("%d%d%d",&s[0].year,&s[0].month,&s[0].day);
	
			switch(s[0].month)
			{
			case 1: sum=0;  break;
			case 2: sum=31; break;
			case 3: sum=59; break;
			case 4: sum=90; break;
			case 5: sum=120; break;
			case 6: sum=151; break;
			case 7: sum=181; break;
			case 8: sum=212; break;
			case 9: sum=243; break;
			case 10: sum=273; break;
			case 11: sum=304; break;
			case 12: sum=334; break;
			}
			sum=sum+s[0].day;
			if(isYeap(s[0].year)==1)
				sum++;
			printf("%d\n",sum);

	
	return 0;
}