sogo_nds-CSDN博客

转载取石子游戏

#include #include #include using namespace std; const int MAXM=102; const int MAXH=10002; setde; int dp[MAXH]; inline int sg(int cur) { if(dp[cur]!=-1) { return

2013-01-18 19:21:06 263

原创 01背包一维

#includeint main(){ int i,j,n,m,weight[3500],value[3500],c[13000]; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) scanf("%d%d",&weight[i],&value[i]); memset(c,0,13000); for(i=1;i<

2013-01-18 19:19:59 259

原创 01背包

#include#includeint c[3500][12882];int main(){ int i,j,n,m,weight[3500],value[3500]; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) scanf("%d%d",&weight[i],&value[i]); for(i=0;i<=n

2013-01-18 19:10:37 208

原创 zjut Longest Bracket Seq

http://acm.zjut.edu.cn/ShowContestProblem.aspx?ShowID=K&MID=729#include#includeusing namespace std;int main(){ string s; while(cin>>s){ int trait=1<<20; int i,p,l=0,t; int ans=0; int a[

2013-01-06 16:06:54 214

原创 zjut Longest Bracket Seq

#include#includeusing namespace std;int main(){ string s; int i,ans,bra=0,l=0,t=0; while(cin>>s){ l=0; t=0; ans=0; for(i=0;s[i]!='(' && i<s.length();i++); if(i==s.length()){ cout<<"0 1"

2013-01-04 23:25:44 232

原创台阶

#includeusing namespace std;int a[30];void init(){ a[0]=a[1]=1; a[2]=2; for(int i=3;i<31;i++) a[i]=a[i-1]+a[i-2];}int main(){ init(); int b; while(cin>>b){ cout<<a[b]<<endl;

2013-01-04 18:09:38 199

原创找名字

#include#includeusing namespace std;int main(){ int n; cin>>n; string u; getline(cin,u); while(n--){ string s1,s2; getline(cin,s1); getline(cin,s2); string c; c.assign(s

2013-01-04 18:08:22 335

原创矩阵鞍点

#includeusing namespace std;int main(){ int a,b,n,m; int d[105][105]; while(cin>>a>>b){ int i,j; int ans=1; int p[105]={0}; int q[105]={0}; for(i=0;i<a;i++){ for(j=0;j<b;j

2013-01-04 17:06:43 404

原创 zjut1221 表达式个数

#include#include#include#includeusing namespace std;int main(){ int sum,ans; int op; int n,m; int i,t; while(scanf("%d%d",&n,&m)){ sum=1; ans=0; for(op=0;op<pow((double)2,n-1

2013-01-04 00:01:35 248

原创 zjut1220 N个胜利者

#include#include#includeusing namespace std;struct child{ int id; int next;};int main(){ int n,m,k,total; int count; int head; child a[55]; while(scanf("%d%d%d",&n,&m,&k)){

2013-01-03 23:18:08 910

原创 c++

#include#include#includeusing namespace std;int main(){ system("pause"); return 0;}

2013-01-03 20:42:27 166

原创大数乘

string multi(string a,string b){ string c; int i,j; int t,p; int sign; size_t zero; sign=0; if(a[0]=='-'){ a=a.erase(0,1); sign=sign^1; } if(b[0]=='-'){ b=b.erase(0,1); s

2013-01-03 20:29:14 273

原创 zjut 1218 n!中的0

#include#include#includeusing namespace std;int ans[1005]={0};string s[1005];string multi(string a,string b){ string c; int i,j; int t,p; int sign; size_t zero; sign=0; if(a[

2013-01-03 20:17:55 365

原创 zjut1217 大数乘

#include#include#includeusing namespace std;int main(){ string a,b,c; int i,j; int t,p; int sign; size_t zero; while(cin>>a>>b && a!="0" || b!="0"){ sign=0; if(a[0]=='-'){

2013-01-03 19:31:16 219