Skip to content

problem solving1 #1208

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

problem solving1 #1208

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
7bd7be7
task
Draksha-Saikumar Jun 26, 2020
da984e8
problem1
Draksha-Saikumar Jun 28, 2020
e276f9f
problem2
Draksha-Saikumar Jun 28, 2020
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
50 changes: 50 additions & 0 deletions lists.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,50 @@
<html>
<head>
<style>
ul.a {
list-style-type: circle;
}

ul.b {
list-style-type: square;
}

ol.c {
list-style-type: upper-roman;
}

ol.d {
list-style-type: lower-alpha;
}
</style>
</head>
<body>

<p>Example of unordered lists:</p>
<ul class="a">
<li>Coffee</li>
<li>Tea</li>
<li>Coca Cola</li>
</ul>

<ul class="b">
<li>Coffee</li>
<li>Tea</li>
<li>Coca Cola</li>
</ul>

<p>Example of ordered lists:</p>
<ol class="c">
<li>Coffee</li>
<li>Tea</li>
<li>Coca Cola</li>
</ol>

<ol class="d">
<li>Coffee</li>
<li>Tea</li>
<li>Coca Cola</li>
</ol>

</body>
</html>
29 changes: 29 additions & 0 deletions src/lab/exp8/problem2.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
#include<stdio.h>
#include<stdlib.h>
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;
}
25 changes: 25 additions & 0 deletions src/lab/exp9/problem1.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
#include<stdio.h>
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<N ;i++)
scanf("%d",weight+i);
int Sum;
scanf("%d",&Sum);
int no_ways = func(N,weight,Sum);
if(!no_ways)
no_ways = -1;
printf("%d\n",no_ways);
return 0;
}