Description

"AHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH!!!!!!!!!!!!"

~by anonymous singer

This problem is partial judge.

You need to deal with something "big enough".

Each input will contain two big integer a, b which are up to 5000 digits.

You need to calculate a+b and a-b.

The input will end by EOF.

 

 

 

Input

a and b is both up to 5000 digits and separated by a blank

The input will end by EOF

Output

For each input print the result of a+b and a-b.

Each result is end by a \n

Sample Input  Download

Sample Output  Download

Partial Judge Code

12469.cpp

Partial Judge Header

12469.h

Tags

Discuss

Description

Into the unknown~ ~ ~ ~

~ by anonymous queen

As a programmer, you know that into the unknown will cause your program fatal error. Although you despise the unknown behavior, you still like this song. You decide to study how lyric work.

Give you n words. Each word contains at least one vowel( 'a', 'e', 'i', 'o', 'u' ) and only contains lower case character.

Every four words can compose a lyric in two lines form.

Each line only contains two words and separated by a single blank.

A lyric is good if and only if:

1. the first line's first word contains as many vowels as the second line's first word

2. the first line's second word contains as many vowels as the second line's second word.

3. the last vowel of first line's second word is same as the last vowel of second line's second word

EXAMPLE:

about proud

hooray round

This example is a good lyric.

Because "about" has 3 vowels so is "hooray",

"proud" has 2 vowels so is "round"

and the last vowel of "proud" is "u" so is "round".

Your task is finding how many good lyric can be composed from the n words.

Make the answer as big as possible.

Note: Each word can be only used for one time!

 

 

Download the C++ reference.
You will see the file named "12534.cpp" but that's OK.
Just download the file and change the filename extension(副檔名) into "zip" then you can upzip the file and use the reference.
The link is below.

reference.zip

Input

The first line contains only one integer n(1 <= n <= 100000)

The following n lines each lines contain only one string.

Each string's length will not exceed 200.

Output

Print the largest number of lyric that you can compose from n words.

Remember to print \n at the end of output.

 

Sample I/O explain:

14

wow

this

is

the

first

mcdics

codeforces

round

hooray

i

am

proud

about

that

You can compose at most three lyric:

about proud

hooray round

 

wow first

this is

 

i that

mcdics am

 

Sample Input  Download

Sample Output  Download

Tags

Discuss

Description

Gordon Ramsay: What are you ?

A poor chef: An idiot sandwich.

You are Gordon Ramsay's chief advisor. He's going to judge a lot of sandwiches whether it is an idiot sandwich or not. However, recording the result is too tired for him, so he yells at you for help.

You are given n​ sandwiches. Gordon will tell you the label of each sandwich in the following formats:

• Ramsay <lvl>: All sandwiches followed with this format are idiot sandwiches. And the number lvl is the level of the intelligence of the corresponding idiot sandwich.

• <name>: All sandwiches with name not equals to "Ramsay" are masterpiece(in Gordon's opinion, it's a normal sandwich), and name is its name.

And you're asked to record each sandwich with the following formats:

• For idiot sandwiches, record An idiot sandwich with intelligence level <lvl> only., where lvl is the intelligence level of the sandwich.

• For normal sandwiches, record <name>. Masterpiece of sandwiches., where name is the name of the sandwich.

Note that this problem is special judge, you have to implement the functions that marked with TODO in function.h.

Do remember to submit your code with language C++11 or higher! Otherwise you will get Compile Error!

Input

Output

For each sandwich, output its record.

Sample Input  Download

Sample Output  Download

Partial Judge Code

12540.cpp

Partial Judge Header

12540.h

Tags

Discuss