Welcome to yet another delayed blog post from chefs’ kitchen. We have tried earlier, and we have been trying consistently towards it, but somehow we have not been able to deliver our blog posts on time. Nevertheless, we will keep trying. Now that we are here let us have a look back at the April Lunchtime 2014 and all that happened around it. If you have been a constant visitor to our Lunchtime contests, you would have noticed that the competition for a place atop is getting fierce. We have seen several new names from across the globe bringing glory to their schools, and many others are trying hard.
The April Lunchtime is yet another beautiful tale of the fierce competition among the younger breed of programmers across the world. Our problem setter Piyush Kumar, who was making his debut as a CodeChef programmer drafted the battlefield. Welcome aboard Piyush. The problems were aptly tested by our young and vibrant tester Balajiganapathi(apologies for missing his name initially). The Lunchtime-veteran Sergey Kulik wrote editorials and Russian translations for them. With all his experience, he churned out some luscious editorials, and we are sure you enjoyed them thoroughly. Among the others who decked the problem-setting panel, there were Minako Kojima and Gedi Zheng who contributed the Mandarin translations of the problem. All the delicacies from our problem-setting panel kept the participants engrossed for the entire three-hour duration of the contest. Moreover, while some were going on with the contest with absolute ease, there were some perplexed faces as well. Amid those faces there were our winners somewhere working their way up the ladder.
The April Lunchtime 2014 was a bit on the slower side, as far as the correct submissions are concerned. And although we did received significant amount of submissions by the end of the contest, the number of correct submissions was a tad on the lower side when compared to some of the recent Lunchtimes we have had. However, that did not hamper the quality of contest and we saw some brilliant performances. Moreover, few stood above the others.
The performances that caught us and everybody else by surprise came from maicaifou, dzy493941464, shizhouxing, fancycoder, and zcc598066456. Hailing from China, these fabulous five were taking part in their first Lunchtime contest ever. Finishing the competition among the top five, dzy493941464, shizhouxing, zcc598066456, and fancycoder have been around on CodeChef and have participated in our monthly contests earlier. However, it was the debut for maicaifou. And a gleaming one, we must say. What made the competition among these five even more exciting was the fact that zcc598066456, maicaifou, and shizhouxing were from the same school – Zhenhai High School, China. Now, we do not know for sure, but it certainly would have sparked a slight inter-school rivalry. That is a good one to have.
We think you all must have such competitive rivalries going on in your schools; some might have it in sports, some in academics, and some in competitive programming. And, we would love to listen about all of them. Also, if you have toppled any of your schoolmates in this or any previous lunchtime, do share it with us. You can even share with us, the results of all the Lunchtime participants from your school. It is always good to be competitive in life, so, play hard, play fair. Now, let us have a look at the victors of our April Lunchtime 2014.
Firstly, the non-Indian top 10:
- maicaifou
- dzy493941464
- shizhouxing
- fancycoder
- zcc598066456
- tonynater
- meirambek
- jcvb
- jiry_2
- akatorihasi180
Now, our Indian Top 10:
Heartiest congratulations to all the stars of our rank tables.
Now, we look at the final stats for the contest:
- Total Users: 442
- Total Submissions: 2439
- Number of distinct users with correct submissions: 158
- Total users from India: 346
- Total users not from India: 96
The non-Indian rank table, while was dominated by students from China (7 out of 10), our Indian rank table had some popular names in meteora, akshatb42, nihalpi1, and many more. These names and many of their companions will be shining big around the Indian programming circle in coming days. So, keep a watch on them. You too can carve your name among the finest programmers around the world; all you need to do is take a start. And we believe our Lunchtime programming series can give you that.
We hope to see many of you taking part in our Lunchtime contests in coming days. And with that we will wind up this post of April Lunchtime, and move towards the May Lunchtime 2014.
For any feedback, queries, or suggestion you can always reach us at [email protected]
That is all from us, for now.
Regards,
Rudreshwar
Team CodeChef
I submitted a Python solution for the first problem in May lunchtime, got only 31 points, even though the same, exact same solution translated to Java passed all test cases. The editorial used the same method.
Now that’s disappointing, I got 13th rank when I could get 5th (or 6th, I don’t exactly remember) rank. :'(
You will get a list of N integers (a1, a2, a3… aN) and you will also get input
variable R. You have to write a program to find integers that satisfies
following condition –
count(ai) >= R
Where count(ai)means number of
occurrences of ai in the list. i.e. we need to findout those integers whose
occurance is greater than or equals to given input ‘R’ . For example for input
list
[2,5,7,8,5,9,5,4,2] and R=2 , output will be [2, 5]
As 2 comes
exactly two times and 5 comes three times in the list hence they satisfy the
condition
count(2)=2 = R
count(5) =3 > R
In case no integer
satisfies the condition you have to print “not found”.
Input
First
line contains an integer, T, the number of test cases. Then T test cases
follow.
Each test case consists of two lines. First line will have number of
integers in the list and value of R and second line will have the input list of
integers.
Output
For each test case, you have to print all those
integers that satisfy the above condition or else print “NOT FOUND”.
2
9
2
2 5 7 8 5 9 5 4 2
7 3
1 3 2 4 6 3 4
Output
2 5
NOT
FOUND
Constraints
1 <= N <= 100
1 <= R <= N
You will get a 5 digit input number and two operators, plus (+) and minus (-).
You can place these operators in any position between these 5 digits and then
calculate the expression value ignoring negative values by taking absolute. Like
for
Input
12345
Some of the possible combinations could be like
–
1-2+345 = |344| = 344
1+2-345 = |-342| = 342
12-34+5 = |-17| =
17
It is easy to find out the number of different expressions you can make.
It is P(4,2) =12. You have to find out the maximum possible number and minimum
possible number after performing all the operations.
For input 12345 Output
will be max=344, min= 17
Input number can have repeated digits and zeros as
well. Like this 45042, is a valid input number. Both operators have equal
precedence so you can evaluate from either side i.e. left to right or right to
left.
Sample Input
12345
23049
Sample Output
max=344, min=
17
max=297, min= 18
Great This is Wonderful Explanations..Awesome Thanks for sharing,,
Buy Natural Honey Online
We have been very impressed with the
quality of the product and the quality of the service/support we receive by the
friendly and knowledgeable Software Tailor staff.
软件开发
We have been very impressed with the
quality of the product and the quality of the service/support we receive by the
friendly and knowledgeable Software Tailor staff.
软件开发