From 7bd7be7b3a2cb494c7a361221dec7eff5c736c48 Mon Sep 17 00:00:00 2001 From: Draksha-Saikumar <66103541+Draksha-Saikumar@users.noreply.github.com> Date: Fri, 26 Jun 2020 21:47:10 +0530 Subject: [PATCH 1/3] task --- lists.html | 50 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 50 insertions(+) create mode 100644 lists.html diff --git a/lists.html b/lists.html new file mode 100644 index 00000000..fb456368 --- /dev/null +++ b/lists.html @@ -0,0 +1,50 @@ + + + + + + +

Example of unordered lists:

+ + + + +

Example of ordered lists:

+
    +
  1. Coffee
    2. +
  2. Tea
    3. +
  3. Coca Cola
    4. +
+ +
    +
  1. Coffee
    2. +
  2. Tea
    3. +
  3. Coca Cola
    4. +
+ + + From da984e8317bb2a22e1e6d4fa32bfd107564c7b6e Mon Sep 17 00:00:00 2001 From: Draksha-Saikumar <66103541+Draksha-Saikumar@users.noreply.github.com> Date: Sun, 28 Jun 2020 15:38:44 +0530 Subject: [PATCH 2/3] problem1 --- src/lab/exp9/problem1.c | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 src/lab/exp9/problem1.c diff --git a/src/lab/exp9/problem1.c b/src/lab/exp9/problem1.c new file mode 100644 index 00000000..6452dc56 --- /dev/null +++ b/src/lab/exp9/problem1.c @@ -0,0 +1,25 @@ +#include +int func(int N,int *weight,int S){ + if(!S) + return 1; + + if(!N) + return 0; + + return func(N-1,weight,S-weight[N-1])+func(N-1,weight,S); +} +main(){ + int N; + scanf("%d",&N); + int weight[N],i; + + for(i=0;i Date: Sun, 28 Jun 2020 15:59:55 +0530 Subject: [PATCH 3/3] problem2 --- src/lab/exp8/problem2.c | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 src/lab/exp8/problem2.c diff --git a/src/lab/exp8/problem2.c b/src/lab/exp8/problem2.c new file mode 100644 index 00000000..772c8555 --- /dev/null +++ b/src/lab/exp8/problem2.c @@ -0,0 +1,29 @@ +#include +#include +int compare(const void *a,const void *b){ + return *((int *)a)>*((int *)b); +} +int search(int *a,int start,int end,int num){ + if(start>end) + return 0; + int mid = (start+end)>>1 ; + if(a[mid]>num) + return (end-mid+1)+search(a,start,mid-1,num); + else + return search(a,mid+1,end,num); +} +main(){ + int N; + scanf("%d",&N); + int arr[N]; + int i,j; + for(i=0;i< N;i++) + scanf("%d",arr+i); + qsort(arr,N,sizeof(int),compare); + int ans=0; + for(i=0;i< N;i++) + for(j=i+1;j< N;j++) + ans+=search(arr,0,N-1,arr[i]+arr[j]); + printf("%d\n",ans); + return 0; +}