uva 10050 Hartals(枚举)
来源:互联网 发布:瑜伽教练必看书籍知乎 编辑:程序博客网 时间:2024/05/22 02:20
Problem D: Hartals
A social research organization has determined a simple set of parameters to simulate the behavior of the political parties of our country. One of the parameters is a positive integer h (called the hartal parameter) that denotes the average number of days between two successive hartals (strikes) called by the corresponding party. Though the parameter is far too simple to be flawless, it can still be used to forecast the damages caused by hartals. The following example will give you a clear idea:
Consider three political parties. Assume h1 = 3, h2 = 4 and h3 = 8 where hi is the hartal parameter for party i ( i = 1, 2, 3). Now, we will simulate the behavior of these three parties for N = 14 days. One must always start the simulation on a Sunday and assume that there will be no hartals on weekly holidays (on Fridays and Saturdays).
The simulation above shows that there will be exactly 5 hartals (on days 3, 4, 8, 9 and 12) in 14 days. There will be no hartal on day 6 since it is a Friday. Hence we lose 5 working days in 2 weeks.
In this problem, given the hartal parameters for several political parties and the value of N, your job 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 number of test cases to follow.
The first line of each test case contains an integer N ( ) giving the number of days over which the simulation must be run. The next line contains another integer P ( ) representing the number of political parties in this case. The ith of the next P lines contains a positive integer hi (which will never be a multiple 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
2143348100412152540
Sample Output
515题目大意:给出总天数,和p个part的间隔时间,周5,6固定放假。求需要罢工的天数。
解题思路:枚举加判断。(不懂小白为什么把这道题目归到线性表里)
#include<iostream>#include<string.h>using namespace std;#define N 110int num[N];int main(){int n;cin >> n;while (n--){// Init.memset(num, 0,sizeof(num));int t, p, cnt = 0;cin >> t >> p;for (int i = 0; i < p; i++)cin >> num[i];for (int j = 1; j <= t; j++)for (int i = 0; i < p; i++)if (j % num[i] == 0 && j % 7 != 0 && j % 7 != 6){cnt++;break;}cout << cnt << endl;}return 0;}
- uva 10050 Hartals(枚举)
- UVA 10050 Hartals (罢工指数,暴力枚举。)
- UVa Problem 10050 Hartals (罢工)
- uva 10050 - Hartals
- UVa 10050 - Hartals
- uva 10050 - Hartals//水题
- UVa 10050 - Hartals
- UVA 10050 - Hartals
- uva 10050Hartals
- uva-10050 Hartals
- UVa 10050 - Hartals
- UVA 10050 Hartals
- uva 10050 - Hartals
- uva 10050 Hartals
- uva 10050Hartals
- UVa 10050 Hartals
- UVa 10050 - Hartals
- UVA - 10050 - Hartals
- MTK Android 之MT6577驱动笔记
- Java 子类与父类这间的转换
- 多租户
- SGU 271 双端队列 和 栈 模拟
- OpenStack暑期学习记录-20130719
- uva 10050 Hartals(枚举)
- MFC应用程序中enable或disable菜单项
- poj 2000 Gold Coins(水题)
- Hibernate调优之select new map()
- 批一下程序员队伍里某些人的崇洋心理
- Discovery学习之路-交换机-ACL
- Symfony2 命令集锦
- Square hdu 1518
- Jenkins任务构建后notification形式通知到手机