|
|
Flyer Problems
[Submission Status] [Current Rankings]The contest has ended. Congratulations to the winners:
Problem 1: Names
Given any name, write a program which can predict if it is a male name or a female name. Input formatThe first line N, is the number of names. This is followed by N lines each containing one name per line. Only first names will be provided and the names will not contain spaces. Output formatThe output must contain N lines. Line i is "male" if the ith name is male, else it must be "female". Sample Input
3 Sample Output
male Constraints
N <= 5000 Scoring
Score = 100*(no. of correct answers)/N Problem 2: Smooth numbers
Define k-smooth number to be a number with all its prime factors <= k. Write a program to find the n-th 5-smooth number (modulo 100000007) in linear time. Input formatThe first line N, is the number of test cases. This will be followed by N integers, a1, ..., an one per line. Output formatThe output must contain N lines. Line i is the aith smooth number modulo 100000007. Sample Input
3 Sample Output
1 Constraints
N, ai <= 100000 Scoring
Score = 100*(no. of correct answers)/N |
Hint for level 11 of Kryptic up!