update

Author: KB-perByte

Gen2_0_PP/Homeworks/codeforces_112D.cpp

@@ -0,0 +1,37 @@
+#include <cstdio>
+#include <cmath>
+#include <cstring>
+#include <string>
+#include <algorithm>
+#include <iostream>
+#include<queue>
+using namespace std; 
+ 
+int vis[100005];
+int main()
+{ 
+	int i,j;
+	int n;
+	int x,y;
+	cin>>n;
+memset(vis,-1,sizeof(vis));
+ for (i=1;i<=n;i++)
+ {
+	 int ans=0;
+	 scanf("%d%d",&x,&y);
+	 int len=sqrt((double)x);
+	 for (j=1;j<=len;j++)
+	 {
+		if (x%j) continue;
+		if (i-y>vis[j])  ans++; 
+		  vis[j]=i;
+		if (j*j==x) continue;
+		if (i-y>vis[x/j]) ans++;
+		vis[x/j]=i;
+	 }
+	 printf("%d\n",ans); 
+ }
+	return 0;
+	
+} 
+

Gen2_0_PP/Homeworks/codeforces_676B.cpp

@@ -0,0 +1,38 @@
+#include <cstdio>
+#include <cstring>
+#include <iostream>
+ 
+using namespace std;
+ 
+const int maxn = 15, lim = 1024;
+int has[maxn][maxn], n;
+
+void fill(int r, int c, int lft) {
+	if (r > n) return ;
+	has[r][c] += lft;
+ 
+	if (has[r][c] > lim) {
+		int left = has[r][c] - lim;
+		has[r][c] = lim; 
+		fill(r + 1, c, left / 2);
+		fill(r + 1, c + 1, left / 2);
+	}
+}
+ 
+int main()
+{
+	int t;
+	cin >> n >> t;
+	memset(has, 0, sizeof(has));
+	while(t--) {
+		fill(1, 1, lim);
+	}
+	int ans = 0;
+	for (int i = 1; i <= n; i++) {
+		for (int j = 1; j <= i; j++) {
+			ans += has[i][j] == lim;
+		}
+	}
+	cout << ans << endl;
+	return 0;
+}

Gen2_0_PP/Homeworks/geekForGeeks_buildingRecievingSunlight.py

@@ -0,0 +1,21 @@
+#arr = [2,4,12,5,7,24,6,3]
+
+
+def fucSunlight(arr, i):
+    global maxx, cntt
+    if i >= len(arr):
+        return
+    if arr[i] > maxx:
+        cntt+=1
+        maxx = arr[i]
+    fucSunlight(arr, i+1)
+
+tCs = int(input())
+while(tCs):
+    maxx = 0
+    cntt = 0
+    tCs -= 1
+    sz = int(input())
+    arr = list(map(int,input().split()))
+    fucSunlight(arr,0)
+    print(cntt)