Submission #12174

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12174	2014-12-21 15:00:59	imsifile	배낭 문제 준비하기 (GA9_invknapsack)	C++98	64 / 100	0 ms	1092 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>
#define maxn 300
typedef long long lld;
lld t, dy[303], mx;
int mi, ba[303], n;
int main(){
  int i, j, a;
  dy[0]=1;
  scanf("%d", &t);
  if(t==1){
    printf("1 1\n1");
    return 0;
  }
  for(i=0;; i++){
    mx=0, mi=0;
    for(j=0; j<=maxn; j++){
      if(mx<dy[j] && dy[j]<=t)mx=dy[j];
      if(mx==dy[j])mi=j;
    }
    if(mx==t)break;
    if(mi==0)a=1;
    else{
      for(a=1; a<=mi; a++){
        if(dy[mi]+dy[mi-a]<=t)break;
      }
    }
    ba[i]=a;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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