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

1007为什么会WA?

Posted by loversam at 2011-07-25 17:19:48
import java.util.*;
import java.io.*;
public class Main{
	static Map<Integer, String> Result = new TreeMap<Integer, String>();
	public static void main(String args[]){
		Scanner cin  = new Scanner(System.in);
		int n = cin.nextInt(), m = cin.nextInt();
		//System.out.println(n+m);
		for(int i = 0; i < m; i++){
			String str = cin.next();
			Result.put(run(str), str);
		}
		Collection<String> res = Result.values();
		Iterator<String> it = res.iterator();
		while(it.hasNext()){
			System.out.println(it.next());
		}
}
	public static int run(String str){
		int count = 0;
		for(int i = 0;i < str.length(); i++)
			for(int j = i+1; j <str.length() - i; j++){
				if((int)str.charAt(i) > (int)str.charAt(j)){
					count ++;
				}
			}
		return count;
	}
}

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