跳到主要內容

UVA10420

Problem B
List of Conquests
Input: standard input
Output: standard output
Time Limit: 2 seconds
In Act I, Leporello is telling Donna Elvira about his master's long list of conquests:
``This is the list of the beauties my master has loved, a list I've made out myself: take a look, read it with me. In Italy six hundred and forty, in Germany two hundred and thirty-one, a hundred in France, ninety-one in Turkey; but in Spain already a thousand and three! Among them are country girls, waiting-maids, city beauties; there are countesses, baronesses, marchionesses, princesses: women of every rank, of every size, of every age.'' (Madamina, il catalogo è questo)
As Leporello records all the ``beauties'' Don Giovanni ``loved'' in chronological order, it is very troublesome for him to present his master's conquest to others because he needs to count the number of ``beauties'' by their nationality each time. You are to help Leporello to count.

Input

The input consists of at most 2000 lines, but the first. The first line contains a number n, indicating that there will be n more lines. Each following line, with at most 75 characters, contains a country (the first word) and the name of a woman (the rest of the words in the line) Giovanni loved. You may assume that the name of all countries consist of only one word.

Output

The output consists of lines in alphabetical order. Each line starts with the name of a country, followed by the total number of women Giovanni loved in that country, separated by a space.

Sample Input

3
Spain Donna Elvira
England Jane Doe
Spain Donna Anna

Sample Output

England 1
Spain 2



解法: 儲存記數


import java.util.*;

public class UVA10420 {

public static void main(String[] args) {

LinkedList<Nation> nation_coll = new LinkedList<Nation>();
Scanner sc = new Scanner(System.in);

int nLine = Integer.parseInt(sc.nextLine());

for (int i = 0; i < nLine; i++) {

String[] items = sc.nextLine().split(" ");

String name = items[0];

Nation aNation;

if (nation_coll.isEmpty()) {
aNation = new Nation(name, 1);
nation_coll.add(aNation);
} else {
boolean isExisted = false;

for (int idx = 0; idx < nation_coll.size(); idx++) {

Nation currNation = nation_coll.get(idx);

if (name.compareTo(currNation.getName()) < 0) {
aNation = new Nation(name, 1);
nation_coll.add(idx, aNation);
isExisted = true;
break;
} else if (name.compareTo(currNation.getName()) == 0) {
int currCount = currNation.getCount();
currCount++;
currNation.setCount(currCount);
nation_coll.set(idx, currNation);
isExisted = true;
break;
}

}

if (!isExisted) {
aNation = new Nation(name, 1);
nation_coll.add(aNation);
}

}

}

for (int j = 0; j < nation_coll.size(); j++) {
Nation aNation = nation_coll.get(j);
System.out.print(aNation.getName());
System.out.print(" ");
System.out.println(aNation.getCount());
}

sc.close();
}

}

class Nation {

private String _name;
private int _count;

public Nation(String name, int i) {

_name = name;
_count = i;
}

public String getName() {
return _name;
}

public void setName(String arg) {
_name = arg;
}

public int getCount() {
return _count;
}

public void setCount(int arg) {
_count = arg;
}

}
標籤：

留言

張貼留言

這個網誌中的熱門文章

UVA11349

J - Symmetric Matrix Time Limit: 1 sec Memory Limit: 16MB You`re given a square matrix M. Elements of this matrix are M ij : {0 < i < n, 0 < j < n}. In this problem you'll have to find out whether the given matrix is symmetric or not. Definition: Symmetric matrix is such a matrix that all elements of it are non-negative and symmetric with relation to the center of this matrix. Any other matrix is considered to be non-symmetric. For example: All you have to do is to find whether the matrix is symmetric or not. Elements of a matrix given in the input are -2 32  <= M ij  <= 2 32  and 0 < n <= 100. INPUT: First line of input contains number of test cases T <= 300. Then T test cases follow each described in the following way. The first line of each test case contains n - the dimension of square matrix. Then n lines follow each of then containing row i. Row contains exactly n elements separated by a space character. j-th number in row i i...
張貼留言
閱讀完整內容

UVA11005

Problem B Cheapest Base Input:  Standard Input Output:  Standard Output When printing text on paper we need ink. But not every character needs the same amount of ink to print: letters such as 'W', 'M' and '8' are more expensive than thinner letters as ' i ', 'c' and '1'. In this problem we will evaluate the cost of printing numbers in several bases. As you know, numbers can be expressed in several different bases. Well known bases are binary (base 2; digits 0 and 1), decimal (base 10; digits 0 to 9) and hexadecimal (base 16; digits 0 to 9 and letters A to F). For the general base  n  we will use the first  n  characters of the string "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ", which means the highest base in this problem is 36. The lowest base is of course 2. Every character from this string has an associated cost, represented by an integer value between 1 and 128. The cost to print a number in a certain base is the s...
張貼留言
閱讀完整內容

UVA11461

A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). Input The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. Output For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). Sample Input 1 4 1 10 0 0 Sample Output 2 3 大意:給兩個數字 求範圍內平方不大於第二個數字的數量 解法: 以最大數取根號後往回看 import java.util.Scanner; public class UVA11461 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int start = sc.nextInt(); int last = sc.nextInt(); if (last == 0) break; System.o...
張貼留言
閱讀完整內容