Brush 2

Author: hackerkid

Diff for: 1016-Brush-2.cpp

@@ -0,0 +1,54 @@
+#include <vector>
+#include <set>
+#include <stdio.h>
+#include <iostream>
+using namespace std;
+
+int main()
+{
+
+	int t;
+	int n;
+	int x;
+	int y;
+	int w;
+	int temp;
+	int count;
+
+	scanf("%d", &t);
+
+	for (int j = 1; j <= t; j++) {
+		scanf("%d", &n);
+		scanf("%d", &w);
+		vector <int> a;
+
+
+		for (int i = 0; i < n; i++) {
+			scanf("%d %d", &x, &y);
+			a.push_back(y);
+		}
+
+		set <int> s(a.begin(), a.end());
+		a.assign(s.begin(), s.end());
+
+		temp = a[0];
+		count = 1;
+
+		for (int i = 0; i < a.size(); i++) {
+			if(temp + w < a[i]) {
+
+				temp = a[i];
+				
+				count++;
+			}
+
+		}
+
+		printf("Case %d: %d\n", j, count);
+
+
+	}
+
+
+}
+			

Diff for: README.md

@@ -38,4 +38,7 @@ This is a normal Memoization with Bit masking type problem. Normal recursion wit
 This is one is a really simple graph problem. Keep marking the visited nodes to avoid visiting them again
 
 ###1014 - Ifter Party
-This is also a normal Ad-Hoc problem. The simplified task is to find the divisors of p - l which are greater than l
+This is also a normal Ad-Hoc problem. The simplified task is to find the divisors of p - l which are greater than l.
+
+###1016 - Brush II
+This is yet another adhoc problem. What you need to do is to ietrate over all the y points in ascending order in such a way that you increase the counter only when the difference of ym, ym+1, ....yn becomes greater than w. The counter would give you the answer.