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 than on any other day of the week? To answer this question, write a program that will compute the frequency that the 13th of each month lands on Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday over a given period of N years. The time period to test will be from January 1, 1900 to December 31, 1900+N-1 for a given number of years, N. N is non-negative and will not exceed 400.

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 rest have 31 except for February which has 28 except in leap years when it has 29.
  • Every year evenly divisible by 4 is a leap year (1992 = 4*498 so 1992 will be a leap year, but the year 1990 is not a leap year)
  • The rule above does not hold for century years. Century years divisible by 400 are leap years, all other are not. Thus, the century years 1700, 1800, 1900 and 2100 are not leap years, but 2000 is a leap year.

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 represent the number of times the 13th falls on Saturday, Sunday, Monday, Tuesday, ..., Friday.

SAMPLE OUTPUT (file friday.out)

36 33 34 33 35 35 34

 
 
ContractedBlock.gif ExpandedBlockStart.gif View Code
 
   
/*
ID: lxlenovos1
PROG: friday
LANG: C++
*/

#include
< iostream >
#include
< fstream >
#include
< string >
#include
< vector >
#include
< string .h >

using namespace std;

bool testloop( int n )
{
if ( n % 100 == 0 )
{
if ( n % 400 == 0 )
return true ;
else
return false ;
}
else
{
if ( n % 4 == 0 )
return true ;
else
return false ;
}

}

int fday( int n )
{
int i, endday, alldays;

endday
= 1 ; // stand for Mon when 1900.1.1
for ( i = 1900 ; i < n; i ++ )

{
if ( testloop( i ) )
{
alldays
= 366 ;
}
else
{
alldays
= 365 ;
}

endday
= ( endday += alldays % 7 ) % 7 ;
}

return endday;
}

int year[ 12 ] = { 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 };
int yearleap[ 12 ] = { 31 , 29 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 };

int resultweek[ 7 ] = { 0 , 0 , 0 , 0 , 0 , 0 , 0 };

void addresult( int n )
{
switch ( n )
{
case 1 : resultweek[ 2 ] ++ ; break ;
case 2 : resultweek[ 3 ] ++ ; break ;
case 3 : resultweek[ 4 ] ++ ; break ;
case 4 : resultweek[ 5 ] ++ ; break ;
case 5 : resultweek[ 6 ] ++ ; break ;
case 6 : resultweek[ 0 ] ++ ; break ;
case 0 : resultweek[ 1 ] ++ ; break ;

default : break ;
}
}

int main( void )

{
ofstream fout(
" friday.out " );
ifstream fin(
" friday.in " );

/* cout << testloop( 1900 );
cout << testloop( 1901 );
*/

/* cout << fday( 1901 ); */

int n, i, j, thday;
int * tempyear;
int firstday;
int z = 1 ;
// cin >> n;
fin >> n;

// cout << "the result is " << endl;

int endyear = n + 1900 - 1 ;

for ( i = 1900 ; i <= endyear; i ++ )
{
firstday
= fday( i );

if ( testloop( i ) )
{
// leap year
tempyear = yearleap;
}
else
{
// not leap year
tempyear = year;
}

for ( j = 0 ; j < 12 ; j ++ )
{
// int month = *( tempyear + j );

if ( j == 0 )
{
firstday
= ( firstday += 13 % 7 - 1 ) % 7 ;
}
else
{
int temp = * ( tempyear + j - 1 );
firstday
= ( firstday += temp % 7 ) % 7 ;
}

addresult( firstday );
// cout << "z is " << z << endl;
// z++;
}
}

for ( j = 0 ; j < 7 ; j ++ )
// cout << resultweek[j] << endl;
{
fout
<< resultweek[j];

if ( j == 6 )
fout
<< endl;
else
fout
<< " " ;
}
}

转载于:https://www.cnblogs.com/lxgeek/archive/2011/05/03/2035523.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值