Add files via upload

Author: AliOsm

Benghazi Programming Contest/1.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int t, abc[3], d, e;
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		for(int i = 0; i < 3; ++i) {
+			scanf("%d", abc + i);
+		}
+
+		scanf("%d %d", &d, &e);
+
+		sort(abc, abc + 3);
+
+		bool can = false;
+
+		do {
+			if(abc[0] + abc[1] <= d && abc[2] <= e) {
+				can = true;
+				break;
+			}
+		} while(next_permutation(abc, abc + 3));
+
+		if(can) {
+			puts("YES");
+		} else {
+			puts("NO");
+		}
+	}
+
+	return 0;
+}

Benghazi Programming Contest/1.jpg

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int t, n, sum;
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		sum = 0;
+
+		scanf("%d", &n);
+
+		for(int i = 0, tmp; i < n; ++i) {
+			scanf("%d", &tmp);
+			sum += tmp;
+		}
+
+		if(sum & 1) {
+			puts("YES");
+		} else {
+			puts("NO");
+		}
+	}
+
+	return 0;
+}

Benghazi Programming Contest/10.cpp

@@ -0,0 +1,96 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int t, n, m, best;
+int dx[] = {1, 2, 1, 2, -1, -2, -1, -2};
+int dy[] = {2, 1, -2, -1, 2, 1, -2, -1};
+long long masks[64];
+
+void rec(int i, int j, bool isWhite, int knights, long long orResult);
+
+int cellToIndex(int i, int j) {
+	return m * i + j;
+}
+
+bool isValid(double n, long long orResult) {
+	return bitset<64>(orResult).count() >= n;
+}
+
+inline void recNext(int i, int j, bool isWhite, int knights, long long orResult) {
+	if(j + 2 < m) {
+		rec(i, j + 2, isWhite, knights, orResult);
+	} else {
+		if (isWhite) {
+			if(i % 2 == 0) {
+				rec(i + 1, 1, isWhite, knights, orResult);
+			} else {
+				rec(i + 1, 0, isWhite, knights, orResult);
+			}
+		} else {
+			if(i % 2 == 0) {
+				rec(i + 1, 0, isWhite, knights, orResult);
+			} else {
+				rec(i + 1, 1, isWhite, knights, orResult);
+			}
+		}
+	}
+}
+
+void rec(int i, int j, bool isWhite, int knights, long long orResult) {
+	if(isWhite) {
+		if(isValid(n * m / 2.0, orResult)) {
+			rec(0, 1, false, knights, orResult);
+			return;
+		}
+	} else {
+		if(isValid(n * m, orResult)) {
+			best = min(best, knights);
+			return;
+		}
+	}
+
+	if(i >= n || j >= m) {
+		return;
+	}
+
+	recNext(i, j, isWhite, knights + 1, orResult | masks[cellToIndex(i, j)]);
+	recNext(i, j, isWhite, knights, orResult);
+}
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		scanf("%d %d", &n, &m);
+
+		for(int i = 0; i < n; ++i) {
+			for(int j = 0; j < m; ++j) {
+				int currentCellIndex = cellToIndex(i, j);
+				masks[currentCellIndex] |= (1LL << currentCellIndex);
+
+				for(int k = 0; k < 8; ++k) {
+					int ni = i + dx[k];
+					int nj = j + dy[k];
+
+					if(ni < 0 || ni >= n || nj < 0 || nj >= m) {
+						continue;
+					}
+
+					masks[currentCellIndex] |= (1LL << (cellToIndex(ni, nj)));
+				}
+			}
+		}
+
+		best = 1e9;
+		rec(0, 0, true, 0, 0LL);
+		
+		printf("%d\n", best);
+	}
+
+	return 0;
+}

Benghazi Programming Contest/10.jpg

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int t, n, a[N];
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		scanf("%d", &n);
+
+		for(int i = 0; i < n; ++i) {
+			scanf("%d", a + i);
+		}
+
+		sort(a, a + n);
+
+		int result = 2e9;
+		for(int i = 1; i < n; ++i) {
+			result = min(result, a[i] - a[i - 1]);
+		}
+
+		printf("%d\n", result);
+	}
+
+	return 0;
+}

Benghazi Programming Contest/2.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int t, a, b, x, y;
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		scanf("%d %d %d %d", &a, &b, &x, &y);
+
+		if(a * b <= x * y) {
+			puts("YES");
+		} else {
+			puts("NO");
+		}
+	}
+
+	return 0;
+}

Benghazi Programming Contest/2.jpg

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int t, n, k, a[N];
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		scanf("%d %d", &n, &k);
+
+		for(int i = 0; i < n; ++i) {
+			scanf("%d", a + i);
+		}
+
+		int i = 0, current = 0;
+		for(; i < n; ++i) {
+			current += a[i];
+			current -= k;
+
+			if(current < 0) {
+				break;
+			}
+		}
+
+		if(i != n) {
+			printf("NO %d\n", i + 1);
+		} else {
+			puts("YES");
+		}
+	}
+
+	return 0;
+}

Benghazi Programming Contest/4.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int t, n, p, x, y, a[N];
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		scanf("%d %d %d %d", &n, &p, &x, &y);
+
+		for(int i = 0; i < n; ++i) {
+			scanf("%d", a + i);
+		}
+
+		int result = 0;
+		for(int i = 0; i < p; ++i) {
+			if(a[i] == 0) {
+				result += x;
+			} else {
+				result += y;
+			}
+		}
+
+		printf("%d\n", result);
+	}
+
+	return 0;
+}

Benghazi Programming Contest/4.jpg

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int t, xa, xb, xc;
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		scanf("%d %d %d", &xa, &xb, &xc);
+
+		if(xa > 50) {
+			puts("A");
+		} else if(xb > 50) {
+			puts("B");
+		} else if(xc > 50) {
+			puts("C");
+		} else {
+			puts("NOTA");
+		}
+	}
+
+	return 0;
+}

Benghazi Programming Contest/5.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int t, n, a[N], b[N], suma, sumb;
+
+int main() {
+#ifndef ONLINE_JUDGE
+	freopen("input.in", "r", stdin);
+#endif
+
+	scanf("%d", &t);
+
+	while(t-- != 0) {
+		suma = sumb = 0;
+
+		scanf("%d", &n);
+
+		for(int i = 0; i < n; ++i) {
+			scanf("%d", a + i);
+		}
+
+		for(int i = 0; i < n; ++i) {
+			scanf("%d", b + i);
+			sumb += b[i];
+		}
+
+		int result = sumb;
+		for(int i = 0; i < n; ++i) {
+			suma += a[i];
+			sumb -= b[i];
+			result = max(result, suma + sumb);
+		}
+
+		printf("%d\n", result);
+	}
+
+	return 0;
+}