Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 38 additions & 0 deletions 17EGICS071_ASS6_2.C
Original file line number Diff line number Diff line change
@@ -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;
}
34 changes: 34 additions & 0 deletions 17EGICS071_Araay11.c.c
Original file line number Diff line number Diff line change
@@ -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;
}