蓝桥杯算法训练VIP-黑色星期五-题解（C语言代码）

解题思路:

注意事项:

参考代码:

#include<stido.h>

int main()

{

int a[12]={31,29,31,30,31,30,31,31,30,31,30,31};

int b[12]={31,28,31,30,31,30,31,31,30,31,30,31};

int year,week=4,count=0;

scanf("%d",&year);

if(year>1998)

{

for(int i=1998;i<year;i++)

{

if(i%4==0&&i%100!=0||i%400==0)

week+=2;

else 

week++;

if(week>=8)

week=1;

}

}

if(year%4==0&&year%100!=0||year%400==0)

{

for(int i=0;i<12;i++)

{

for(int j=1;j<=a[i];j++)

{

if(week==8)

week=1; 

if(j==13&&week==5)

count++;

week++;

}

}

}

else

{

for(int i=0;i<12;i++)

{

for(int j=1;j<=b[i];j++)

{

if(week==8)

week=1;

if(j==13&&week==5)

count++;

week++;

}

}

}

printf("%d",count);

return 0;

}