摘要：
dfs#include <iostream>#include <algorithm>using namespace std;int ar[25],n,b,ans=0x3f3f3f3f;void dfs(int i,int high){ int j; if (high>=b) { if (high<ans)ans=high; return; } for (j=i;j<n;j++) { dfs (j+1,ar[j]+high); }}int main(){ int i,j; cin>>n>>b; for (i=0;i<n;i+ 阅读全文
摘要：
#include <stdio.h>int min(int a,int b,int c){ if(a<=b&&a<=c)return a; if(b<=a&&b<=c)return b; if(c<=a&&c<=b)return c;}int main(){ int n,i,j=1,k=1,l=1,ans[1505]; ans[1]=1; for (i=2;i<=1500;i++) { ans[i]=min(ans[j]*2,ans[k]*3,ans[l]*5); if(ans[i]==ans 阅读全文
摘要：
#include <stdio.h>#include <stdlib.h>int cmp(const void *x,const void *y){ return *(int *)x-*(int *)y;}int Min(int a,int b){ return a<b?a:b;}int main(){ int ar[1001],n,i,min,m; scanf("%d",&m); while (m--) { scanf("%d",&n); for(i=0;i<n;i++)scanf("%d& 阅读全文