#include<iostream>
using namespace std;
const int a[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};
bool leapYear(int n)
{
return (((n%4==0)&&(n%100!=0))||(n%400==0));
}
bool isSun(int n)
{
return (n%7==0?true:false);
}
void solve()
{
int num,i,j,count;
count=0;
i=1901;
num=1;
while(i<2000)
{
int t=(leapYear(i)?1:0);
for(j=0;j<12;j++)
{
num+=a[t][j];
if(isSun(num))
count++;
}
i++;
}
cout<<count<<endl;
}
int main(void)
{
solve();
return 0;
}
Answer:
| 171 |