标签：uva   acm   模拟   

题目如下：

Problem D: Hartals

Consider three political parties. Assume h₁ = 3,h₂ = 4 and h₃ = 8 where h_i is the hartal parameter for party i(i = 1, 2, 3). Now, we will simulate the behavior of these three partiesfor N = 14 days. One must always start the simulation on a Sunday and assumethat there will be no hartals on weekly holidays (on Fridays andSaturdays).

The simulation above shows that there will be exactly 5 hartals (on days3, 4, 8, 9 and 12) in 14 days. There will be no hartal on day 6 since itis a Friday. Hence we lose 5 working days in 2 weeks.

In this problem, giventhe hartal parameters for several political parties and the value of N, yourjob is to determine the number of working days we lose in those N days.

Input 

The first line of the input consists of a single integer T giving the numberof test cases to follow.

The first line of each test case contains an integerN ()giving the number of days over which the simulationmust be run. The next line contains another integer P ()representing the number of political parties in this case. The i-th of thenext P lines contains a positive integer h_i (which will never be amultiple of 7) giving the hartal parameter for party i ().

Output 

For each test case in the input output the number of working days we lose.Each output must be on a separate line.

Sample Input 

2
14
3
3
4
8
100
4
12
15
25
40

Sample Output 

5
15

简单的模拟题，没啥好说的，直接上代码。

AC的代码如下：

UVA Problem D: Hartals,布布扣,bubuko.com

UVA Problem D: Hartals

标签：uva   acm   模拟   

原文地址：http://blog.csdn.net/u013840081/article/details/26739921