UVa 10050 - Hartals

最新推荐文章于 2019-04-29 13:34:38 发布

AcToy

最新推荐文章于 2019-04-29 13:34:38 发布

阅读量607

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/AcToy/article/details/8723808

版权

数据结构专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题意给出了一共的天数。和party。用数组模拟就可以。记录days[i]的倍数。最后做mod 排除周五周六

// File Name: UVa10050.cpp
// Author: Toy
// Created Time: 2013年03月26日 星期二 20时52分02秒

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#define L(x) x << 1
#define R(x) x << 1 | 1

using namespace std;

int days[3700], Case, day, party, tmp, x, cmp;

int main ( ) {
    scanf ( "%d", &Case );
    while ( Case-- ) {
	memset ( days, 0, sizeof ( days ) );
	scanf ( "%d%d", &day, &party );
	for ( int i = 0; i < party; ++i ) {
	    tmp = 1;
	    scanf ( "%d", &x );
            cmp = x;
	    while ( cmp <= day ) {
		days[cmp]++;
		tmp++;
		cmp = x * tmp;
	    }
	}
	int ans = 0;
	for ( int i = 0; i <= day; ++i ) 
	    if ( days[i] &&  ( i - 1 ) % 7 != 5 && ( i - 1 ) % 7 != 6 ) ans++; 
	printf ( "%d\n", ans );
    }
    return 0;
}