提交记录 #458

#include <stdio.h>
int leap_year( int );     
int year_days( int );     
int days(int,int,int);   
int jisuan(); 
int leap_year( int year )  
{   return ( (year%4==0 && year%100!=0) || year%400==0 ) ? 1 : 0;  
}  
int year_days(int year)   
{   return leap_year( year ) ? 366 : 365;  
}  
int days( int year, int month, int day ) 
{   int months[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31}, i;  
      
    if  ( leap_year( year ) && month >2 )  
        day++;  
      
    for ( i=1; i<month; i++ )  
        day += months[i];  
  
    return day;  
}
int jisuan(int y2, int m2, int d2) {
    int y1 = 2012, m1 = 4, d1 = 8,i;
    int day1 = days(y1, m1, d1);
    int day2 = days(y2, m2, d2);
    int re = 0;
    int yearsDiff = y2 - y1;

    if (yearsDiff == 0) {
        re = day2 - day1;
    } else {
        for ( i = y1; i < y2; i++) {
            int daysInYear = year_days(i);
            if (i == y1) {
                re += daysInYear - day1;
            } else if (i == y2 - 1) {
                re += day2;
            } else {
                re += daysInYear;
            }
        }
    }
    return re;
}

void calculateRestriction(int daysDiff) {
    // 假设2012年4月8日是周日（索引为0，如果以周一为索引1则需要调整）
    int weekDayIndex = (daysDiff + 7 ) % 7;  // 加7-1确保正数结果，然后取模7
    char restrictions[7][100] = {"Free.", "1 and 6.", "2 and 7.", " 3 and 8.", "4 and 9.", "5 and 0.", "Free."};
    printf("%s\n", restrictions[weekDayIndex]);
}

int main() {
    int year, month, day;
    scanf("%d %d %d", &year, &month, &day);
    int dd = jisuan(year, month, day);
    calculateRestriction((dd+1)%7);  // 不再需要加1
    return 0;
}