«

[Unknown Hero]

Today was holded regional contest in programming in Croatia.

I didn't make it up to national contest, but NrmMyth will maybe make it with his score! (great job mate) k: k:

Here are exams:

1. Abbrevation(shortcut)
Read a sentence which consists of one or more words that are separated with one space.
We make an abbrevation of read sentence by picking up the begining letter of every word in sentence, excapt if that word is one of the following: 'i','pa','te','ni','niti','a','ali','nego','no' , and 'ili'
In that case we ignore the word. BUT, if the sentence begins with one of the words, we consider that word very importants, so we don't ignore it (at the begining, later on, we ignore it).
Write a program that will determine a abbrevation for a read sentence. Abbrevation MUST be written with CAPS ('A' instead of 'a').

Entering parameters:
In first and only line, there is a sentence. Only permited characters inside the sentence are small letters of english alphabet ('a'...'z') and space.
Sentence wont have more than 100 characters.

Exiting parameters:
In first and only line write a abbrevation of read sentence.

Test examples:
abb.in
mirko soft
abb.out
MS

abb.in
biti ali i ne biti
abb.out
BNB

abb.in
ali ja sam i jucer jeo
abb.out
AJSJJ

[Unknown Hero]

2. Exam
Luka dislikes learning, but anyways, he will like to pass the most difficulty exam on the first year. During his last visit to university's canteen, he overheard that all students of second year know which questions will be in his exam. The truth is that no one actually knows it, but everyone thinks that someone else knows.
Luka now chooses person A from the second year and asks him what questions will be in the exam. Person A responds that he doesn't know, but that he thinks that person B knows. Then Luka asks the same question to person B, etc.
Write a program that will determine which student Luka should first ask about the exam, so that the number of questioned students is the biggest possible.

Entering parameters:
In the first line there is a whole number N, 2<=N<=1000, the number of students. Students are marked with numbers from 1 to N.
In every of next N lines there is one number. First number determines ordinal number of student that first student will send Luka to ask him about the exam, second number determines ordinal number of student that second student will send Luka to ask him about Exams, and so on.

Exiting parameters:
In first and only line write an ordinal number of student that Luka have to ask first about the exam, so that the number of students that he will meet on that way could be the biggest possible.
If there are more these students, then write a number of that student that has the smallest ordinal number.

Test examples:
exam.in
3
3
3
1
exam.out
2

exam.in
4
2
3
4
1
exam.out
1

exam.in
6
2
3
4
3
1
1
exam.out
5




Two more to go. I will post those two after at least one of members tries to solve one or both of previous two exams. k:

[NrmMyth]

Thanks for commend.
But i think the lowest points are 50% of all points(which I don't have).
Sorry for disapointment. k:

I think that's a great ideat to translate the exams in this topic.
Salute!

???If it were more time!!! :

[NrmMyth]

For the library program I have to tell you that it will be done until next sunday (after this) [] becouse I have to write my work from math for tuesday. And it is large!

[NrmMyth]

If you want to be tested. Try USACO.

[NrmMyth]

Originally posted by NrmMyth@Mar 20 2005, 10:24 PM
If you want to be tested. Try USACO.

Today the March competition has ended.
Final results will be at thursday.

[NrmMyth]

IMO this topic should be cleaned of trash and pined. k:

By trash i mean all posts that aren't problems and their solutions.

Also it has to be nicely done!

[Kon-Tiki]

What I see better, is to get together and set up some exams with different difficulty rating, along with possible solutions in pseudo-code for them, then pin it and lock it. These questions can then still be discussed in here.

[NrmMyth]

Great, why not do this then, I'll help if I can. k:

[Kon-Tiki]

Let's see if there're any others who want to join in too k: