Original title of Blue Bridge Cup

Catalog

Topic 1 ：

The first question is ： Time to show

answer ：

The second question is ：

Third question ：

  analysis ：

test questions C： Brush question Statistics

---

Topic 1 ：

The first question is ： Time to show

answer ：

#include<stdio.h>
int main()
{
	long long int n = 0;
	scanf("%lld", &n);
	long long int time = 0;
	time = n % (24 * 60 * 60 * 1000);
	int HH = time /( 60 * 1000 * 60);
    time = time % (60 * 1000 * 60);
	int MM = time / (60 * 1000);
	time = time % (60 * 1000);
	int SS = time / 1000;
	printf("%02d:%02d:%02d", HH, MM, SS);


	return 0;
}

The second question is ：

test questions A： Nine to ten
The total score of this question ：5 branch
【 Problem description 】
Hexadecimal positive integer ( 2022 ) 9 (2022)_9(2022) 
9
​
  How much is it converted to decimal ？
(2022)9​=2∗93+2∗91+2∗90=1478

Third question ：

test questions B： Shunzi date
The total score of this question ：5 branch
【 Problem description 】
Xiao Ming likes shunzi very much . Shunzi refers to three consecutive numbers ：123、456 etc. . Shunzi date refers to the date on the yyyymmdd In representation , There are any three consecutive digits that are a shunzi date . for example 20220123 It's a shunzi date , Because it has a shunzi ：123; and 20221023 Is not a shunzi date , It doesn't have a straight son . Xiao Ming wants to know in the whole 2022 In the middle of the year , How many shunzi dates are there altogether .
 

  analysis ：

This question tests the ability of reasoning . Since the year has been determined , So just judge 2022mmdd Whether shunzi contains .

mm Yes 12 Species value , namely 01~12. Only 01、11 and 12, There is no chance of a surplus in other months .
about 2022-01-dd, Only 2022-01-23 eligible
about 2022-11-dd, Only 2022-11-23 eligible
about 2022-12-dd, Only 2022-12-30 and 2022-12-31 eligible
answer ：
So the answer is ：4

test questions C： Brush question Statistics

The time limit ：1.0s Memory limit ：256.0MB The total score of this question ：10 branch
【 Problem description 】
Xiao Ming decided to brush the questions and prepare for the Blue Bridge Cup competition from next Monday . He plans to do... Every day from Monday to Friday a questions , Do... Every day on Saturdays and Sundays b questions . Please help Xiao Ming calculate , According to the plan, he will realize that the number of questions is greater than or equal to n topic ？
【 Input format 】
The input line contains three integers a,b and n.
 

#include<stdio.h>
int main()
{
	int a=0, b=0, n=0;
	scanf("%d %d %d", &a, &b, &n);
	int sum = 0;
	int i = 1;
	int c = 0;
	while (sum < n)
	{
		if (i % 7 == 0)
		{
			sum = sum +b;
			
		}
		else if ((i + 1) % 7 == 0)
		{
			sum = sum + b;
		}
		else
		{
			sum = sum + a;
		}
		i++;
	}
	printf("%d", i-1);
	return 0;