View Code of Problem 81

#include<stdio.h>
#include<string.h>
#include<math.h>
int fun(int n){
    if(n%4==0){
        if(n%100==0){
            if(n%400==0){
                return 1;
            }else{
                return 0;
            }
        }else{
            return 1;
        }
    }else{
        return 0;
    }
}
int main(){
    int a[100],b[100],c[100],i,j=0,min,temp,k,ge,shi,bai,qian,nian,yue,ri,n;
    scanf("%d%d%d",&n,&yue,&ri);
    if(fun(n)==0){
        if(yue==1)j=ri;
        if(yue==2)j=31+ri;
        if(yue==3)j=31+28+ri;
        if(yue==4)j=31+28+31+ri;
        if(yue==5)j=31+28+31+30+ri;
        if(yue==6)j=31+28+31+30+31+ri;
        if(yue==7)j=31+28+31+30+31+30+ri;
        if(yue==8)j=31+28+31+30+31+30+31+ri;
        if(yue==9)j=31+28+31+30+31+30+31+31+ri;
        if(yue==10)j=31+28+31+30+31+30+31+31+30+ri;
        if(yue==11)j=31+28+31+30+31+30+31+31+30+31+ri;
        if(yue==12)j=31+28+31+30+31+30+31+31+30+31+30+ri;
    }else{
        if(yue==1)j=ri;
        if(yue==2)j=31+ri;
        if(yue==3)j=31+29+ri;
        if(yue==4)j=31+29+31+ri;
        if(yue==5)j=31+29+31+30+ri;
        if(yue==6)j=31+29+31+30+31+ri;
        if(yue==7)j=31+29+31+30+31+30+ri;
        if(yue==8)j=31+29+31+30+31+30+31+ri;
        if(yue==9)j=31+29+31+30+31+30+31+31+ri;
        if(yue==10)j=31+29+31+30+31+30+31+31+30+ri;
        if(yue==11)j=31+29+31+30+31+30+31+31+30+31+ri;
        if(yue==12)j=31+29+31+30+31+30+31+31+30+31+30+ri;
    }
    printf("%d",j);

    return 0;
}