Skip to content
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.

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

Bj1 #238

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

Bj1 #238

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
43 changes: 43 additions & 0 deletions 2.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
#include<stdio.h>
int b[25];
int main()
{
unsigned long long int i,j,k,n,sum;
int flag=0;
scanf("%llu%llu",&n,&k);
unsigned long long int a[n];


for(i=0;i<n;i++)
{
scanf("%llu",&a[i]);

}

for(i=1;i<(1<<n);i++)
{
sum=0;
for(j=0;j<n;j++)
{
if(i&(1<<j)==(1<<j))
{
sum=sum+a[j];
}

if(sum==k)
{
flag=1;
break;
}

}

if(flag==1)
break;
}
if(flag==1)
{printf("yes");}
else
{printf("no");}
return 0;
}
51 changes: 51 additions & 0 deletions 5.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
#include<stdio.h>
int main()
{

long long int n,v,sum,count,j,i,least,x;
int t,p;
scanf("%d",&t);

for(p=1;p<=t;p++)
{
scanf("%lld%lld",&n,&v);
long long int a[n];

for(i=0;i<n;i++)
{scanf("%lld",&a[i]);}

for(i=0;i<n-1;i++)
{least=i;
for(j=i+1;j<n;j++)
{
if(a[j] < a[least])
{least=j;}
}
x=a[i];
a[i]=a[least];
a[least]=x;
}

sum=0;
count=0;
int flag=0;
for(i=n-1;i>=0;i--)
{
sum=sum + a[i];
count++;
if(sum >= v)
{ flag=1;
break;}


}

if(flag==0)
{printf("-1\n");}

else if (flag==1)
{printf("%lld\n",count);}

}

}
5 changes: 5 additions & 0 deletions c.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
#include<stdio.h>
int main()
{
printf("hello world");
}