题目链接:回忆的碎片
题目大意:给你一些数,每个数可以选一次,也可能不选,问不能组成的最小正整数为多少
题目思路:三种思路:一、排完序后滚动着往里面扫,如果当前的值大于sum+1,就直接输出,否则继续。二、01背包。三、暴力模拟01背包,直接每扔一个数加一遍
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int t,n,a[105];
scanf("%d",&t);
int Case = 1;
while(t--){
scanf("%d",&n);
for(int i = 0;i < n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
printf("Case #%d: ",Case);Case++;
int sum = a[0];
if(a[0] != 1) puts("1");
else{
int flag = 0;
for(int i = 1;i < n;i++){
if(a[i] > sum+1) {printf("%d\n",sum+1);flag = 1;break;}
else sum += a[i];
}
if(flag == 0) printf("%d\n",sum+1);
}
}
return 0;
}
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int main(){
int t,n,a[105],dp[10005],sum,x;
scanf("%d",&t);
int Case = 1;
while(t--){
sum = 0;
scanf("%d",&n);
memset(dp,0,sizeof(dp));
for(int i = 0;i < n;i++)
scanf("%d",&a[i]),sum += a[i];
dp[0] = 1;
for(int i = 0;i < n;i++){
for(int j = sum;j >= a[i];j--){
if(dp[j-a[i]]) dp[j] = 1;
}
}
for(int i = 1;;i++){
if(!dp[i]){printf("Case #%d: %d\n",Case++,i);break;}
}
}
return 0;
}
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int main(){
int t,n,a[105],vis[10005],s,x;
vector<int>v;
scanf("%d",&t);
int Case = 1;
while(t--){
scanf("%d",&n);
memset(vis,0,sizeof(vis));
v.clear();
v.push_back(0);
vis[0] = 1;
for(int i = 0;i < n;i++){
scanf("%d",&x);
s = v.size();
for(int j = 0;j < s;j++){
if(!vis[v[j]+x]) v.push_back(v[j]+x),vis[v[j]+x] = 1;
}
}
for(int i = 1;;i++){
if(!vis[i]){
printf("Case #%d: %d\n",Case,i);Case++;break;
}
}
}
return 0;
}