Submission #12662

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12662	2014-12-27 14:46:09	dohyun0324	배낭 문제 준비하기 (GA9_invknapsack)	C++98	100 / 100	0 ms	1840 KiB

invknapsack

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#include<algorithm>
using namespace std;
long long int n,k,a[310],d[310][310];
int arr[100],w,m;
long long t,t2,sum;
int main()
{
    int i,j,l;
    scanf("%lld",&t);
    t2=t;
    while(t2>0)
    {
        arr[++w]=t2%2;
        t2/=2;
    }
    reverse(arr+1,arr+w+1);
    n=8+w; m=n;
    for(i=1;i<=9;i++) a[i]=(1<<i)/2;
    for(i=10;i<=n;i++) a[i]=1;
    //scanf("%lld %lld",&n,&k);
    //for(i=1;i<=n;i++) scanf("%lld",&a[i]);
    d[0][0]=1;
    for(i=1;i<=n;i++){
        for(j=0;j<=300;j++){
            if(j-a[i]>=0) d[i][j]=d[i-1][j-a[i]];
        }
        for(j=0;j<=300;j++) d[i][j]+=d[i-1][j];
    }
    //for(i=0;i<=300;i++) printf("%d ",d[n][i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 13 / 13
• Subtask 3: 17 / 17
• Subtask 4: 29 / 29
• Subtask 5: 36 / 36