From 4eaf113ad8b56dc2f65f22180b99df1cdc99e69a Mon Sep 17 00:00:00 2001
From: kartik <kartiksaxena500@gmail.com>
Date: Wed, 31 Oct 2018 22:18:19 +0530
Subject: [PATCH 1/3] added a new text file

---
 text doc | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 text doc

diff --git a/text doc b/text doc
new file mode 100644
index 0000000..721e6fe
--- /dev/null
+++ b/text doc	
@@ -0,0 +1 @@
+This is a text document. 

From 68bf13121b612933a03e7424b390b0ba152e4ef0 Mon Sep 17 00:00:00 2001
From: kartik <kartiksaxena500@gmail.com>
Date: Wed, 31 Oct 2018 22:28:16 +0530
Subject: [PATCH 2/3] updated new text file

---
 text doc | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/text doc b/text doc
index 721e6fe..4d3c3eb 100644
--- a/text doc	
+++ b/text doc	
@@ -1 +1,2 @@
-This is a text document. 
+Aman arts 
+

From 1f4d580320de87fed445c844d0bf84feddfaba1b Mon Sep 17 00:00:00 2001
From: kartik <kartiksaxena500@gmail.com>
Date: Wed, 31 Oct 2018 22:38:06 +0530
Subject: [PATCH 3/3] Added the interview program

---
 interview.cpp | 65 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 65 insertions(+)
 create mode 100644 interview.cpp

diff --git a/interview.cpp b/interview.cpp
new file mode 100644
index 0000000..9d46c79
--- /dev/null
+++ b/interview.cpp
@@ -0,0 +1,65 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define SIZE 20005
+#define ll long long 
+
+ll a[SIZE];
+ll b[SIZE];
+ll c[SIZE][SIZE];
+
+int main()
+{
+	int n;
+	scanf("%d", &n);
+
+	for(ll i=1;i<=n;i++)
+	{
+		scanf("%lld", &a[i]);
+	}
+
+	for(ll i=1;i<=n;i++)
+	{
+		scanf("%lld", &b[i]);
+	}
+
+	for(ll i=1;i<n;i++)
+	{
+		for(ll j=1;j<=n;j++)
+		{
+			if((j-i)>=a[i]+b[j] && i<j)
+			{
+				c[i][j]=1;
+			}
+		}
+	}
+
+
+	for(ll i=1;i<n;i++)
+	{
+		for(ll j=1;j<=n;j++)
+		{
+			printf("%lld %lld %lld\n",i,j,c[i][j]);
+		}
+	}
+
+	ll count=0;
+	for(ll i=1;i<n;i++)
+	{
+		for(ll j=i+1;j<=n;j++)
+		{
+			if(c[i][j] && i<j)
+			{
+				// printf("%lld %lld\n",i,j);
+				count++;
+			}
+			/*else
+			{
+				for(ll k=i+1;k<=n;k++)
+					if(c[i][k] && c[k][j])
+						count++;
+			}*/
+		}
+	}
+
+	// printf("%lld\n",count);
+}
\ No newline at end of file