0_0_16261875_11429.cpp:1:50: error: stray '#' in program
<li class="alt"><span><span class="preprocessor">#include <stdio.h></span><span> </span></span></li><li class=""><span><span class="preprocessor">#include <string.h></span><span> </span></span></li><li class="alt"><span><span class="preprocessor">#include <algorithm></span><span> </span></span></li><li class=""><span><span class="keyword">using</span><span> </span><span class="keyword">namespace</span><span> std; </span></span></li><li class="alt"><span> </span></li><li class=""><span><span class="datatypes">int</span><span> dp[1505][2]; </span></span></li><li class="alt"><span><span class="datatypes">int</span><span> vis[1505],head[1505]; </span></span></li><li class=""><span><span class="datatypes">int</span><span> len,root; </span></span></li><li class="alt"><span> </span></li><li class=""><span><span class="keyword">struct</span><span> node </span></span></li><li class="alt"><span>{ </span></li><li class=""><span> <span class="datatypes">int</span><span> now,next; </span></span></li><li class="alt"><span>} tree[3005];<span class="comment">//因为要双向建，所以要开2倍大小</span><span> </span></span></li><li class=""><span> </span></li><li class="alt"><span><span class="keyword">void</span><span> add(</span><span class="datatypes">int</span><span> x,</span><span class="datatypes">int</span><span> y)</span><span class="comment">//建树</span><span> </span></span></li><li class=""><span>{ </span></li><li class="alt"><span> tree[len].now = y; </span></li><li class=""><span> tree[len].next = head[x]; </span></li><li class="alt"><span> head[x] = len++; </span></li><li class=""><span> </span></li><li class="alt"><span> tree[len].now = x; </span></li><li class=""><span> tree[len].next = head[y]; </span></li><li class="alt"><span> head[y] = len++; </span></li><li class=""><span>} </span></li><li class="alt"><span> </span></li><li class=""><span><span class="keyword">void</span><span> dfs(</span><span class="datatypes">int</span><span> root) </span></span></li><li class="alt"><span>{ </span></li><li class=""><span> <span class="datatypes">int</span><span> i,k; </span></span></li><li class="alt"><span> vis[root] = 1; </span></li><li class=""><span> dp[root][1] = 1; </span></li><li class="alt"><span> dp[root][0] = 0; </span></li><li class=""><span> <span class="keyword">for</span><span>(i = head[root]; i!=-1; i = tree[i].next) </span></span></li><li class="alt"><span> { </span></li><li class=""><span> k = tree[i].now; </span></li><li class="alt"><span> <span class="keyword">if</span><span>(!vis[k]) </span></span></li><li class=""><span> { </span></li><li class="alt"><span> dfs(k); </span></li><li class=""><span> dp[root][0] += dp[k][1]; </span></li><li class="alt"><span> dp[root][1] += min(dp[k][1],dp[k][0]); </span></li><li class=""><span> } </span></li><li class="alt"><span> } </span></li><li class=""><span>} </span></li><li class="alt"><span> </span></li><li class=""><span><span class="datatypes">int</span><span> main() </span></span></li><li class="alt"><span>{ </span></li><li class=""><span> <span class="datatypes">int</span><span> t,x,y,n,i,j; </span></span></li><li class="alt"><span> <span class="keyword">while</span><span>(~scanf(</span><span class="string">"%d"</span><span>,&t)) </span></span></li><li class=""><span> { </span></li><li class="alt"><span> len = 0; </span></li><li class=""><span> root = -1; </span></li><li class="alt"><span> memset(dp,0,<span class="keyword">sizeof</span><span>(dp)); </span></span></li><li class=""><span> memset(vis,0,<span class="keyword">sizeof</span><span>(vis)); </span></span></li><li class="alt"><span> memset(head,-1,<span class="keyword">sizeof</span><span>(head)); </span></span></li><li class=""><span> <span class="keyword">for</span><span>(j = 1; j<=t; j++) </span></span></li><li class="alt"><span> { </span></li><li class=""><span> scanf(<span class="string">"%d:(%d)"</span><span>,&x,&n); </span></span></li><li class="alt"><span> <span class="keyword">if</span><span>(root==-1) </span></span></li><li class=""><span> root = x; </span></li><li class="alt"><span> <span class="keyword">for</span><span>(i = 0; i<n; i++) </span></span></li><li class=""><span> { </span></li><li class="alt"><span> scanf(<span class="string">"%d"</span><span>,&y); </span></span></li><li class=""><span> add(x,y); </span></li><li class="alt"><span> } </span></li><li class=""><span> } </span></li><li class="alt"><span> dfs(root); </span></li><li class=""><span> printf(<span class="string">"%d\n"</span><span>,min(dp[root][0],dp[root][1])); </span></span></li><li class="alt"><span> } </span></li><li class=""><span> </span></li><li class="alt"><span> <span class="keyword">return</span><span> 0; </span></span></li><li class=""><span>} </span></li>
^
0_0_16261875_11429.cpp:1:163: error: stray '#' in program
<li class="alt"><span><span class="preprocessor">#include <stdio.h></span><span> </span></span></li><li class=""><span><span class="preprocessor">#include <string.h></span><span> </span></span></li><li class="alt"><span><span class="preprocessor">#include <algorithm></span><span> </span></span></li><li class=""><span><span class="keyword">using</span><span> </span><span class="keyword">namespace</span><span> std; </span></span></li><li class="alt"><span> </span></li><li class=""><span><span class="datatypes">int</span><span> dp[1505][2]; </span></span></li><li class="alt"><span><span class="datatypes">int</span><span> vis[1505],head[1505]; </span></span></li><li class=""><span><span class="datatypes">int</span><span> len,root; </span></span></li><li class="alt"><span> </span></li><li class=""><span><span class="keyword">struct</span><span> node </span></span></li><li class="alt"><span>{ </span></li><li class=""><span> <span class="datatypes">int</span><span> now,next; </span></span></li><li class="alt"><span>} tree[3005];<span class="comment">//因为要双向建，所以要开2倍大小</span><span> </span></span></li><li class=""><span> </span></li><li class="alt"><span><span class="keyword">void</span><span> add(</span><span class="datatypes">int</span><span> x,</span><span class="datatypes">int</span><span> y)</span><span class="comment">//建树</span><span> </span></span></li><li class=""><span>{ </span></li><li class="alt"><span> tree[len].now = y; </span></li><li class=""><span> tree[len].next = head[x]; </span></li><li class="alt"><span> head[x] = len++; </span></li><li class=""><span> </span></li><li class="alt"><span> tree[len].now = x; </span></li><li class=""><span> tree[len].next = head[y]; </span></li><li class="alt"><span> &nbs
|
