UVa-10050-Hartals

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 2. Data Structures :: Lists

// 10050 - Hartals
#include <iostream>
#include <cstring>
using namespace std;
int day[3651];
int main(void)
{
	int t, n, p, i, j, k, h, s;
	while(cin >> t)
	while(t--)
	{
		s = 0;
		memset(day, 0, sizeof(day));
		cin >> n >> p;
		for(i=0; i<p; i++)
		{
			cin >> h;
			for(j=h; j<=n; j+=h)
				day[j] = 1;
		}
		for(k=1; k<=n; k++)
			if(day[k] && k%7!=0 && (k+1)%7!=0)
				s++;
		cout << s << endl;
	}
	return 0;
}