OJ Board

Code: Select all

// Hartals.cpp : Defines the entry point for the console application.
// UVA 10050

#include <iostream>
#include <string>
using namespace std;

int main()
{
	int cases;
	cin >> cases; // number of cases
	
	int offs = 0; // number of working days lost
	int nDays; // total number if simultion days
	int parties; // number of parties
	
	bool* days; // array used for days counted

	for (int i = 0; i < cases; i++) {
		cin >> nDays;
		days = new bool[nDays + 1]; // + 1 to pass off by one 
		cin >> parties;

		for (int j = 0; j < parties; j++) {
			int hParam; // hartal parameter
			cin >> hParam;

			for (int k = 1; k <= nDays; k++) {
				if (days[k] && k % hParam == 0 && k % 7 != 0 && k % 7 != 6) { // checks : 1- day is counted before 2- day must be a hartal 3- day is saturday 4- day is sunday
					offs++; 
					days[k] = false; // flags the day as counted
				}
			}
		}
		delete days;
		cout << offs;
		if (i != cases - 1)
			cout << endl; // used to skip last newline
		offs = 0;
	}

	return 0;
}

Code: Select all

#include <iostream>
using namespace std;

int week[3650];
int hartals[101];

int main() {
	int T, P, N, h, l, d, c, x;
	cin >> T;
	for (int t = 0; t < T; t++) {
		for (int i = 0; i < 3650; i++) {
			week[i] = 0;
		}
		for (int i = 0; i <= 100; i++) {
			hartals[i] = 0;
		}

		cin >> N;
		cin >> P;
		for (int p = 0; p < P; p++) {
			cin >> h;
			if (hartals[h]) continue;
			hartals[h] = 1;

			l = 5;
			d = -1;
			while (d < N) {
				d += h;
				x = d % 7;
				if ((x != 5) && (x != 6)) {
					week[d] = 1;
				}
			}
		}

		c = 0;
		for (d = 0; d < N; d++) {
			if (week[d]) {
			//	cout << d << " ";
				c++;
			}
		}

		cout << c << endl;
	}
}

Code: Select all

10
14
3
3
4
8
100
4
12
15
25
40
21
3
21
6
5
10
1
1
100
1
30
3650
1
1
1
1
1
20
1
20
21
1
21
21
1
22

Code: Select all

5
15
5
8
2
2608
1
0
0
0

Code: Select all

1
2672
2
795
1945

Code: Select all

3

Code: Select all

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <limits.h>
using namespace std;

int main()
{
	int t, n, p, h[130], cnt;
	bool b[3660];
	cin >> t;
	for(int z = 0; z < t; z++)
	{
		memset(b, 0, sizeof(b));
		cnt = 0;
		cin >> n >> p;
		for(int i = 0; i < p; i++)
			cin >> h[i];
		for(int i = 0; i < p; i++)
		{
			for(int k = h[i]-1; k < n; k+=h[i])
			{
				if(k%5 != 0 && k%6 != 0 && !b[k])//if it's not Friday nor Saturday and it's not been marked before(it's all zero-based)
				{
					b[k] = 1;
					cnt++;
				}
			}
		}
		printf("%d\n", cnt);
	}
	return 0;
}

Code: Select all

1
14
1
14

Code: Select all

10
1685
3
1473
975
726
2614
7
1371
2162
2487
906
2179
1858
16
3585
2
908
1112
882
9
29
640
493
431
577
653
523
243
4
1379
12
32
956
1198
451
89
562
837
143
719
34
951
365
2620
10
2
2530
461
1658
297
1929
1923
152
463
2202
2690
6
2545
2348
1959
209
577
967
2130
12
888
877
813
2049
954
310
1765
1920
1951
1294
1033
1032
814
1
794
370
4
120
121
87
226

Code: Select all

4
121
5
183
86
946
16
19
1
9