February 18 is a special date for the CCC this year.
Write a program that asks the user for a numerical month and numerical day of the month and then determines whether that date occurs before, after, or on February 18.
If the date occurs before February 18, output the word
Before. If the date occurs after February 18,
output the word After. If the date is February
18, output the word Special.
The input consists of two integers each on a separate line. These integers represent a date in 2015.
The first line will contain the month, which will be an integer in the range from 1 (indicating January) to 12 (indicating December).
The second line will contain the day of the month, which will be an integer in the range from 1 to 31. You can assume that the day of the month will be valid for the given month.
Exactly one of Before,
After or Special
will be printed on one line.
1
7Before
8
31After
2
18Special
We often include emoticons in our text messages to indicate how we
are feeling. The three consecutive characters
:-) indicate a happy face and the three
consecutive characters :-( indicate a sad
face. Write a program to determine the overall mood of a message.
There will be one line of input that contains between 1 and 255 characters.
The output is determined by the following rules:
If the input line does not contain any happy or sad emoticons,
output none.
Otherwise, if the input line contains an equal number of happy
and sad emoticons, output unsure.
Otherwise, if the input line contains more happy than sad
emoticons, output happy.
Otherwise, if the input line contains more sad than happy
emoticons, output sad.
How are you :-) doing :-( today :-)?
happy
:)
none
This:-(is str:-(:-(ange te:-)xt.
sad
In Sweden, there is a simple child’s game similar to Pig Latin called Rövarspråket (Robber’s Language).
In the CCC version of Rövarspråket, every consonant is replaced by three letters, in the following order:
the consonant itself;
the vowel closest to the consonant in the alphabet (e.g., if the consonant is d, then the closest vowel is e), with the rule that if the consonant falls exactly between two vowels, then the vowel closer to the start of the alphabet will be chosen (e.g., if the consonant is c, then the closest vowel is a);
the next consonant in the alphabet following the original consonant (e.g., if the consonant is d, then the next consonant is f) except if the original consonant is z, in which case the next consonant is z as well.
Vowels in the word remain the same. (Vowels are a, e, i, o, u and all other letters are consonants.)
Write a program that translates a word from English into Rövarspråket.
The input consists of one word entirely composed of lower-case letters. There will be at least one letter and no more than 30 letters in this word.
Output the word as it would be translated into Rövarspråket on one line.
joy
jikoyuz
ham
hijamon
You exchange text messages with your friends. Since you receive so many messages, you want to measure how long your friends have to wait for your replies.
Your message device records each received and sent message in order using the following two kinds of entries:
R X indicates a message was received
from a friend numbered \(X\);
S X indicates a message was sent to a
friend numbered \(X\).
Your message device sends and receives messages instantaneously, and for each consecutive pair of entries described above, either
a single entry W X is recorded in
between them indicating they occur \(X\) seconds apart, or
there is no entry between them and they occur one second apart.
Several rules of message etiquette are always followed:
the only messages you send are replies to messages that you have received;
you send at most one reply to any message from any particular friend;
your friends do not send a subsequent message until you have replied to their previous message.
The wait time for a message is the time that passes between when you receive it and the time you reply to it. If a friend \(X\) received a reply to each message they sent, the total wait time for friend \(X\) is the sum of all wait times for all messages from friend \(X\). Otherwise, the total wait time for friend \(X\) is \(-1\).
Your job is to determine the total wait time for each friend.
The input consists of the integer \(M\) (\(1 \leq M
\leq 20\)), followed by \(M\)
lines, where each line consists of one character
(W, R, or
S), followed by a space, followed by an
integer \(X\) (\(1 \leq X \leq 100\)). These \(M\) lines are the entries described above
(in order).
Output one line for each friend that sent a message in the form \(X\) \(T\) where \(X\) is a friend number and \(T\) is the total wait time for friend \(X\). The lines are in increasing order of the friend numbers.
5
R 2
R 3
W 5
S 2
S 32 6
3 6Friend 2 sends a message at time \(0\) and Friend 3 sends a message at time \(1\). Friend 2 receives a reply at time \(6\) and Friend 3 receives a reply at time \(7\).
14
R 12
W 2
R 23
W 3
R 45
S 45
R 45
S 23
R 23
W 2
S 23
R 34
S 12
S 3412 13
23 8
34 2
45 -1For Friend 12, a message is received at time 0 and replied to at time 13. For Friend 23, two messages are exchanged, with the first message having a wait time of 6 seconds and the second message having a wait time of 2 seconds. For Friend 34, a message is received at time 10 and replied to at time 12. Friend 45 sends a message which is never replied to.
You may know that March 14 is known as “\(\pi\)-day”, since \(3.14\) (which is the third month and fourteenth day) is a good approximation of \(\pi\).
Mathematicians celebrate this day by eating pie.
Suppose that you have \(n\) pieces of pie, and \(k\) people who are lined up for pieces of pie. All \(n\) pieces of pie will be given out. Each person will get at least one piece of pie, but mathematicians are a bit greedy at times. So, they always get at least as many of pieces of pie as the person in front of them.
For example, if you have 8 pieces of pie and \(4\) people in line, you could give out pieces of pie in the following five ways (with the first person in line being the first number in the list): \([1,1,1,5]\), \([1,1,2,4]\), \([1,1,3,3]\), \([1,2,2,3]\), \([2,2,2,2]\).
Notice that if \(k=n\), there is only one way to give out the pieces of pie: every person gets exactly one piece. Also, if \(k=1\), there is only one way to give out the pieces of pie: that single person gets all the pieces.
Write a program that determines the number of ways that the pieces of pie can be given out.
The first line of input is the integer number of pieces of pie, \(n\) \((1 \leq n \leq 250)\).
The second line of input is the integer \(k\) which is the number of people in line \((1 \leq k \leq n)\).
For at least 20% of the marks for this problem, \(n \leq 9\). For at least 50% of the marks for this problem, \(n \leq 70\). For at least 85% of the marks for this problem, \(n \leq 120\).
The output will consist of a single integer which is the number of ways that the pieces of pie can be distributed. The output is guaranteed to be less that \(2^{31}\).
8
45
6
23