From ede1c89cebc5d2e63c40a5fc22a8fd958e672cf6 Mon Sep 17 00:00:00 2001
From: nehasoni464 <47269263+nehasoni464@users.noreply.github.com>
Date: Sat, 25 Apr 2020 16:32:29 +0530
Subject: [PATCH 1/2] Add files via upload

---
 17EGICS071_Araay11.c.c | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 17EGICS071_Araay11.c.c

diff --git a/17EGICS071_Araay11.c.c b/17EGICS071_Araay11.c.c
new file mode 100644
index 0000000..f1e43df
--- /dev/null
+++ b/17EGICS071_Araay11.c.c
@@ -0,0 +1,34 @@
+#include<stdio.h>
+#include<conio.h>
+#include<math.h>
+int main()
+{ int n,sum1=0,sum2=0,i,t;
+  printf("Enter size of an array");
+  scanf("%d",&n);
+  int a[n];
+  printf("Enter elements of an array");
+  for(i=0;i<n;i++)
+  {
+  	scanf("%d",&a[i]);
+  	
+  }
+  printf("sum of ");
+  if(0<n&& n<pow(10,6)){
+  
+  for(i=0;i<n;i++)
+  {
+  	sum2+=a[i];
+  	if(sum2>sum1)
+  		{
+  		sum1=sum2;
+  		printf("%d   ",a[i]);
+  		}
+  	if(sum2<0){
+  		sum2=0;
+  		sum1=0;
+	  }
+  }}
+  printf("\nLargest sum : %d",sum1);
+getch();
+  return 0;
+}

From 7fcf238b79bb7d7f4495690cea9fac7593fb3e2b Mon Sep 17 00:00:00 2001
From: nehasoni464 <47269263+nehasoni464@users.noreply.github.com>
Date: Tue, 28 Apr 2020 10:06:22 +0530
Subject: [PATCH 2/2] Create 17EGICS071_ASS6_2.C

---
 17EGICS071_ASS6_2.C | 38 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 38 insertions(+)
 create mode 100644 17EGICS071_ASS6_2.C

diff --git a/17EGICS071_ASS6_2.C b/17EGICS071_ASS6_2.C
new file mode 100644
index 0000000..c421584
--- /dev/null
+++ b/17EGICS071_ASS6_2.C
@@ -0,0 +1,38 @@
+#include<stdio.h>
+#include<conio.h>
+int c =0;
+int count_pair(int a, int b , int k)
+{ 
+  if(k==(a+b))
+   { c++;
+   	return c;
+   	}
+	else{
+		return 0;
+	}
+}
+int main()
+{
+	int n,t, i,j,result , count;
+	printf("Enter the size of an aaray");
+	scanf("%d",&n);
+	int a[n];
+	printf("Enter the elments");
+	for(i=0;i<n;i++)
+	{ scanf("%d",&a[i]);}
+	printf("Enter the target value");
+	scanf("%d",&t);
+	for(i=0;i<n;i++)
+	{ for(j=i+1;j<n;j++){
+	
+		result= count_pair(a[i],a[j],t);
+		if(result>0)
+		{ i++;
+		  count=result;
+		}
+}
+	}
+	printf("Count :%d",count);
+	getch();
+	return 0;
+}