Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

鉴后来人。。。WA的可以看看有没有这个问题。。。

Posted by 735320654 at 2013-07-18 20:21:02 on Problem 2535
可能会有多种结果。。。输出的时候是用空格输出的。。。
输出位置代码如下:
for (i=0;i<m;i++)
        {
            int a=0;
            for (j=0;j<n;j++)
            {
                if(max[j]==fen[j][i])
                {
                    a=-1;break;
                }
                if(min[j]==fen[j][i])a++;
            }
            if(a>n/2)
            {
                flag=1;
                printf("%d ",i+1);//注意。。。
            }
        }
        if(!flag)printf("0");
            printf("\n");

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator