岩山放牛娃

为啥总是rutime error？？？？

Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 14656 Accepted: 3615<br />Description<br />You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. You

<br />#include<iostream><br />#include<stdio.h><br />#include<algorithm><br />using namespace std;<br />int a[1005];<br />int d[1005];<br />int mat[1005][1005];<br />bool v[1005];<br />int fa[1005];<br />int ans[1005];<br />int n;<br />void dijskra(){<br /

#includeusing namespace std;int c[100002][12];int d[100002][12];int main(){ int x,t,n; while(scanf("%d",&n)!=EOF){ memset(c,0,sizeof(c)); memset(d,0,sizeof(d)); for(int i=1;i=5+i;j--) if(c[i]

树形dp（有向树k中值问题）；计算机算法设计与分析

#include#includeusing namespace std;string ss0;string ss1;int f(int x,int y){ int flag1=1;int c1=-1;c2=-1;int p=0; int flag2=0;int num=0; for(int i=x;i++){  switch(s[i]){   case'[':p++;flag1=0; break;   case']':p--;flag1=0;break;   case'+':flag1=0;if(!p) c

#include#include#include#includeusing namespace std;const int INF=100000000;int w[310][310];int vis[310];int v[310];int d[310][310];int n,m,Q;void dijkstra(int u){ memset(v, 0, sizeof(v));  for(int i = 0; i   for(int i = 0; i     int x, m = INF;    for(int

<br />#include<iostream><br />using namespace std;<br />int main(){<br />    //freopen("in.txt","r",stdin);<br />  //  freopen("out.txt","w",stdout);<br />    int m;string s;<br />    while(scanf("%d",&m),m){<br />        cin>>s;<br />int max=0;int rr=0;<b