F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_16899695_10430.cpp:1:50: error: stray '#' in program
 <li class="alt"><span><span class="preprocessor">#include <math.h></span><span>  </span></span></li><li class=""><span><span class="preprocessor">#include <stdio.h></span><span>  </span></span></li><li class="alt"><span><span class="preprocessor">#include <string.h></span><span>  </span></span></li><li class=""><span><span class="preprocessor">#include <vector></span><span>  </span></span></li><li class="alt"><span><span class="preprocessor">#include <string></span><span>  </span></span></li><li class=""><span><span class="preprocessor">#include <algorithm></span><span>  </span></span></li><li class="alt"><span><span class="preprocessor">#define MAXN 1010</span><span>  </span></span></li><li class=""><span><span class="preprocessor">#define INF 0x7fffffff</span><span>  </span></span></li><li class="alt"><span><span class="preprocessor">#define eps 1e-10</span><span>  </span></span></li><li class=""><span><span class="preprocessor">#define MAX(x,y) ((x)>(y)? (x):(y))</span><span>  </span></span></li><li class="alt"><span><span class="preprocessor">#define MIN(x,y) ((x)<(y)? (x):(y))</span><span>  </span></span></li><li class=""><span><span class="preprocessor">#define MEM(a) (memset((a),0,sizeof(a)))</span><span>  </span></span></li><li class="alt"><span><span class="preprocessor">#define FRE freopen("input.txt","r",stdin)</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></li><li class="alt"><span>string name[MAXN];  </span></li><li class=""><span><span class="datatypes">int</span><span> num[MAXN],k,n;  </span></span></li><li class="alt"><span>vector <<span class="datatypes">int</span><span>> review[MAXN];  </span></span></li><li class=""><span><span class="datatypes">bool</span><span> ok[MAXN];  </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="keyword">while</span><span>(scanf(</span><span class="string">"%d%d"</span><span>,&k,&n) && n)  </span></span></li><li class="alt"><span>    {  </span></li><li class=""><span>        memset(ok,0,<span class="keyword">sizeof</span><span>(ok));  </span></span></li><li class="alt"><span>        memset(num,0,<span class="keyword">sizeof</span><span>(num));  </span></span></li><li class=""><span>        <span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span> i=1;i<=n;i++)  </span></span></li><li class="alt"><span>            review[i].clear();  </span></li><li class=""><span>        <span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span> i=1;i<=n;i++)  </span></span></li><li class="alt"><span>        {  </span></li><li class=""><span>            <span class="datatypes">char</span><span> temp[20];  </span></span></li><li class="alt"><span>            scanf(<span class="string">"%s"</span><span>,temp);  </span></span></li><li class=""><span>            name[i]=temp;  </span></li><li class="alt"><span>            <span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span> j=0;j<k;j++)  </span></span></li><li class=""><span>            {  </span></li><li class="alt"><span>                <span class="datatypes">int</span><span> tmp;  </span></span></li><li class=""><span>                scanf(<span class="string">"%d"</span><span>,&tmp);  </span></span></li><li class="alt"><span>                review[i].push_back(tmp);  </span></li><li class=""><span>            }  </span></li><li class="alt"><span>        }  </span></li><li class=""><span>        <span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span> i=1;i<=n;i++)  </span></span></li><li class="alt"><span>            sort(review[i].begin(),review[i].end());  </span></li><li class=""><span>        <span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span> i=1;i<=n;i++)  </span></span></li><li class="alt"><span>            <span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span> j=0;j<k;j++)  </span></span></li><li class=""><span>            {  </span></li><li class="alt"><span>                <span class="keyword">if</span><span>(j!=0 && (review[i][j]==review[i][j-1])) </span><span class="comment">//重复票判problem</span><span>  </span></span></li><li class=""><span>                {  </span></li><li class="alt"><span>                    ok[review[i][j]]=1;  </span></li><li class=""><span>                    <span class="keyword">continue</span><span>;  </span></span></li><li class="alt"><span>                }  </span></li><li class=""><span>                <span class="keyword">if</span><span>(name[i]==name[review[i][j]]) </span><span class="comment">//同组织判problem</span><span>  </span></span></li><li class="alt"><span>                    ok[review[i][j]]=1;  </span></li><li class=""><span>                <span class="keyword">else</span><span>  </span></span></li><li class="alt"><span>                    num[review[i][j]]+=1;   </span></li><li class=""><span>            }  </span></li><li class="alt"><span>        <span class="datatypes">int</span><span> ans=0;  </span></span></li><li class=""><span>        <span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span> i=1;i<=n;i++)  </span></span></li><li class="alt"><span>            <span class="keyword">if</span><span>(ok[i]) ans++;  </span></span></li><li class=""><span>            <span class="keyword">else</span><span>  </span></span></li><li class="alt"><span>            {  </span></li><li class=""><span>                <span class="keyword">if</span><span>(num[i]!=k) ans++;   </span></span></li><li class="alt"><span>            }  </span></li><li class=""><span>        <span class="keyword">if</span><span>(ans==0)  </span></span></li><li class="alt"><span>            printf(<span class="string">"NO PROBLEMS FOUND\n"</span><span>);  </span></span></li><li class=""><span>        <span class="keyword">else</span><span>  </span></span></li><li class="alt"><span>            printf(<span class="string">"%d PROBLEMS FOUND\n"</span><span>,ans);  </span></span></li><li class=""><span>    }  </span></li><li class="alt"><span>    <span class="keyword">return</span><span> 0;  </span></span></li><li class="">


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-06-24 21:25:50, Gzip enabled