Coding Contest - April 14, 2012
 Coding Contest - April 14, 2012
Prove your skill in coding, to solve difficult and not so difficult challenges.
| |
|---|---|
| |
| Type of Event: | Event |
| From: | 2012/04/14 14:30 |
| Till: | 2012/04/14 20:00 |
| Recurring: | no |
| Organizer: | syn2cat |
| Cost: | 0 EUR0 $ 0 £ 0 CHF |
| Mandatory registration: |
|
| Attendees: | Destructive, Kwisatz Log-in to RSVP |
| Contact Person(s): | Destructive (mail) |
| Keywords: | coding, contest, programming |
| Location | |
| Where: | Hackerspace, Strassen (11, rue du Cimetière, L-8018 Strassen, Luxembourg) |
| Map: |
Loading map...
|
| Tools | |
| QrCode: | 
|
| Add to your calendar: | Download … further results |
| Alternate picture: | None |
| Announce globally: | yes |
The goal of this contest is not to find the best coder, but to enjoy coding together and to motivate others to start coding. If you can write a "hello world" program in any language, you are welcome. There will be certainly someone to help you to solve the tasks.
We will use the following example problem to make us familiar with the contest system.
Contents |
Sample problem
Mr. Foo has to determine if his students have passed the year. As he has many students which have written many tests, he can't use his calculator, because it would take him too long. He knows that you are a skilled hacker, so he has asked you to make a program to automate his task.
He has S students. Each student has written N tests. The test scores ranges from 0 to 60 (both inclusive). A student has passed his year if he has an average score of more or equal to 30. The average is not rounded.
Input
You are given an input file. The first line consists of 2 integers: the number of students S (1 <= S <= 1000) and the number of tests N (1 <= N <= 1000). S lines follow, which consists of N integers, representing the scores of a student.
Output
You have to create an output file which contains one line per student. Each containing 'PASSED' if he has passed his year, otherwise 'FAILED'.
Input example
4 2
29 30
30 30
50 60
0 58
Output example
FAILED
PASSED
PASSED
FAILED
