From 1b2e771e2bb48a12e537533d9219bad9c4a20cd8 Mon Sep 17 00:00:00 2001
From: Arpit Agarwal <iit2019139@iiita.ac.in>
Date: Thu, 6 Feb 2020 02:42:22 +0530
Subject: [PATCH] added task-2

---
 Tasks/Task-2/Submission/iit2019139.cpp | 58 ++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 Tasks/Task-2/Submission/iit2019139.cpp

diff --git a/Tasks/Task-2/Submission/iit2019139.cpp b/Tasks/Task-2/Submission/iit2019139.cpp
new file mode 100644
index 0000000..0f11ce8
--- /dev/null
+++ b/Tasks/Task-2/Submission/iit2019139.cpp
@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+using namespace std;
+int dp[1001][1001];
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL); 
+    cout.tie(NULL);
+    int n; cin>>n;
+
+    int k; cin>>k;
+    int a[n+1][n+1];
+    for(int i=0;i<=n;i++)
+    {
+    	a[0][i]=0;
+    	a[i][0]=0;
+    }
+
+    for(int i=1;i<=n;i++){
+        for(int j=1;j<=n;j++){
+            cin>>a[i][j];
+        }
+    }
+
+    for(int i=0;i<=n;i++)
+    {
+    	dp[0][i]=0;
+    	dp[i][0]=0;
+    }
+
+    for(int i=1;i<=n;i++)
+    {
+    	for(int j=1;j<=n;j++)
+    	{
+    		dp[i][j]= dp[i][j-1]+dp[i-1][j]-dp[i-1][j-1]+a[i][j];
+		}
+	}
+
+    int s=1,e=n+1;
+
+    while(s<e){
+
+        int m=(s+e)/2;
+
+        bool flag=0;
+
+        for(int i=m;i<=n;i++){
+            for(int j=m;j<=n;j++){
+                if((dp[i][j]-dp[i-m][j]-dp[i][j-m])>=k) flag=1;
+            }
+        }
+        if(flag){ s=m; break;}
+        else e=m;
+    }
+    cout<<s<<endl;
+    return 0;
+}
\ No newline at end of file