USACO -Friday the Thirteenth

Friday the Thirteenth

Is Friday the 13th really an unusual event?

That is, does the 13th of the month land on a Friday less often thanon any other day of the week? To answer this question, write a programthat will compute the frequency that the 13th of each month lands onSunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday overa given period of N years. The time period to test will be from January1, 1900 to December 31, 1900+N-1 for a given number of years, N. N ispositive and will not exceed 400.

Note that the start year is NINETEEN HUNDRED, not 1990.

There are few facts you need to know before you can solve this problem:

• January 1, 1900 was on a Monday.
• Thirty days has September, April, June, and November, all the resthave 31 except for February which has 28 except in leap years when ithas 29.
• Every year evenly divisible by 4 is a leap year (1992 = 4*498 so1992 will be a leap year, but the year 1990 is not a leap year)
• The rule above does not hold for century years. Century yearsdivisible by 400 are leap years, all other are not. Thus, the centuryyears 1700, 1800, 1900 and 2100 are not leap years, but 2000 is a leapyear.

Do not use any built-in date functions in your computer language.

Don't just precompute the answers, either, please.

PROGRAM NAME: friday

INPUT FORMAT

One line with the integer N.

SAMPLE INPUT (file friday.in)

20

OUTPUT FORMAT

Seven space separated integers on one line. These integers representthe number of times the 13th falls on Saturday, Sunday, Monday,Tuesday, ..., Friday.

SAMPLE OUTPUT (file friday.out)

36 33 34 33 35 35 34

这里我没用朴素的算法去区分闰年与平年，而是用了一个著名的公式：蔡勒公式

摘自百度文库：

 
 

  
  W =〔 [C/4] - 2C + y + [y/4] + [13 * (M+1) / 5] + d - 1 〕% 7
 
 
 
 

  
  （或者是：w= 〔y+[y/4]+[c/4]-2c+[26(m+1)/10]+d-1 〕% 7）
 
 
 
 

  
  若要计算的日期是在1582年10月4日或之前，公式则为
 
 
 
 

  
  w=y+[y/4]+[c/4]-2c+[13(m+1）/5]+d+2
 
 
 
 

  
  以1572年9月3日为界：
 
 
 
 

  
  1572年9月3日后：w = (d + 2*m+3*(m+1)/5+y+y/4-y/100+y/400)%7;
 
 
 
 

  
  1572年9月3日前：w = (d+2*m+3*(m+1)/5+y+y/4+5） % 7;
 
 
 
 

  
  注意：
 
 
 
 

  
  当年的1,2月要当成上一年的13,14月进行计算
 
 
 
 

  
   
 
 
 
 

  
  
  
  

   
   w：星期； w对7取模得：0-星期日，1-星期一，2-星期二，3-星期三，4-星期四，5-星期五，6-星期六
  
  
  
  

   
   c：世纪减1（年份前两位数）
  
  
  
  

   
   y：年（后两位数）
  
  
  
  

   
   m：月（m大于等于3，小于等于14，即在蔡勒公式中，某年的1、2月要看作上一年的13、14月来计算，比如2003年1月1日要看作2002年的13月1日来计算）
  
  
  
  

   
   d：日
  
  
  
  

   
   [ ]代表取整，即只要整数部分。
  
  
  
  

   
   适用范围：  蔡勒公式只适合于1582年10月15日之后的情形。
  
  
  
  

   
   代码：
  
  
  
  

   
   
/*
ID:ronggua1
PROG:friday
LANG: C++
*/
#include <iostream>
#include<fstream>
#include<memory.h>
using namespace std;
int main()
{
     ifstream fin("friday.in");
     ofstream fout("friday.out");
     int n,i,j,year,month,c,y,w,time[7];
     fin>>n;
      memset(time,0,sizeof(time));
      for(i=1900;i<1900+n;i++)
      for(j=1;j<=12;j++)
      {
        year=i;month=j;
        if(month==1||month==2)
        {
            year--;
            month+=12;
        }
        c=year/100;
        y=year-c*100;
        w=(y+y/4+c/4-2*c+26*(month+1)/10+13-1)%7;
        w=(w+7)%7;
//w可能为负数要加上7，这一步很重要。
   
   
        switch(w)
        {
        case 6:time[0]++;break;
        case 0:time[1]++;break;
        case 1:time[2]++;break;
        case 2:time[3]++;break;
        case 3:time[4]++;break;
        case 4:time[5]++;break;
        case 5:time[6]++;break;
        }
      }
      for(i=0;i<6;i++)
        fout<<time[i]<<" ";
       fout<<time[6]<<"\n";
        //fout<<time[i]<<" ";
  return 0;
}