Programming Contest for Newbies 2005

Post here if you don't find any other place for your post. But please, stay on-topic: algorithms, programming or something related to this web site and its services.

Moderator: Board moderators

Observer
Guru
Posts: 570
Joined: Sat May 10, 2003 4:20 am
Location: Hong Kong

Programming Contest for Newbies 2005

Post by Observer »

Advertisement

Image

2005-02-12 12:00-16:00 UTC @ http://acm.uva.es/contest

"Hey! Not a network-flow problem again!!" my friends and I always complain. Why do the tasks here always rely on advanced algorithms? Why don't the problemsetters think about us newbies? We know we can't be quiet. We've got to do something. But how?

Our contest will be quite different from others. You do not need to know very hard algorithms. All you need here is simply a clear mind and some basic knowledge of programming. For example:
- Input/output Processing
- Sorting and Searching
- Graph Traversing
- Simple Maths
- Recursion and Backtracking

Our problems are relatively easy; we would like to make even beginners to be able to solve a couple of them within the 4-hour duration.

We invite everyone interested in programming to join our contest. You won't be disappointed.

Observer and Friends @ 2005
7th Contest of Newbies
Date: December 31st, 2011 (Saturday)
Time: 12:00 - 16:00 (UTC)
URL: http://uva.onlinejudge.org
..
A great helper
Posts: 454
Joined: Thu Oct 18, 2001 2:00 am
Location: Hong Kong

Post by .. »

Seems interesting, and the timing is good for all Chinese :wink:
My signature:
  • Please make discussion about the algorithm BRFORE posting source code.
    We can learn much more in discussion than reading source code.
  • I HATE testing account.
  • Don't send me source code for debug.
Observer
Guru
Posts: 570
Joined: Sat May 10, 2003 4:20 am
Location: Hong Kong

Post by Observer »

We would like to thank everyone who have helped us make this contest a success. Special thanks must be given to Per Austrin and Marian Dvorsky, who pointed out the mistakes in our tasks. And also I thank all the system adminstrators for their generous support to our contest.

If you have any suggestions for us, please let us know~ :P

P.S. Please accept our apology for any inconvenience we've caused. :oops:
7th Contest of Newbies
Date: December 31st, 2011 (Saturday)
Time: 12:00 - 16:00 (UTC)
URL: http://uva.onlinejudge.org
stubbscroll
Experienced poster
Posts: 151
Joined: Tue Nov 16, 2004 7:23 pm
Location: Norway
Contact:

Re: Programming Contest for Newbies 2005

Post by stubbscroll »

Observer wrote: Our problems are relatively easy; we would like to make even beginners to be able to solve a couple of them within the 4-hour duration.
Hmm, I found the problems rather hard (I only managed to solve one). Seems I need some more practise, so I can reach beginner status :)
Adrian Kuegel
Guru
Posts: 724
Joined: Wed Dec 19, 2001 2:00 am
Location: Germany

Post by Adrian Kuegel »

I also expected more easier problems looking at the contest description. Therefore I didn't think enough about the problems before coding them and got lots of wrong submissions.
But that shouldn't be a complain that the problems were too difficult, its my own fault if I don't use my brain :wink:
..
A great helper
Posts: 454
Joined: Thu Oct 18, 2001 2:00 am
Location: Hong Kong

Post by .. »

Well.....
I feel that I am too old for a real time contest now......
So strong are the "Newbies" nowadays......... I only solved 2 problems for the "Newbies" ~_~
My signature:
  • Please make discussion about the algorithm BRFORE posting source code.
    We can learn much more in discussion than reading source code.
  • I HATE testing account.
  • Don't send me source code for debug.
little joey
Guru
Posts: 1080
Joined: Thu Dec 19, 2002 7:37 pm

Post by little joey »

C'mon Wai, who's old :wink:

A good problemset, but hardly qualifying as 'newbie'. Wonder what an 'elite' contest would look like...

Did anyone solve A without a prefab bigint class?
..
A great helper
Posts: 454
Joined: Thu Oct 18, 2001 2:00 am
Location: Hong Kong

Post by .. »

little joey wrote:C'mon Wai, who's old :wink:
OK :wink: You are much more qualified than me to use the word "old"
little joey wrote:A good problemset, but hardly qualifying as 'newbie'. Wonder what an 'elite' contest would look like...
I would expect a contset for "dummies" :D
little joey wrote:Did anyone solve A without a prefab bigint class?

I feel strange about A too, how can solve it without a pre-write bigint class?
My signature:
  • Please make discussion about the algorithm BRFORE posting source code.
    We can learn much more in discussion than reading source code.
  • I HATE testing account.
  • Don't send me source code for debug.
stubbscroll
Experienced poster
Posts: 151
Joined: Tue Nov 16, 2004 7:23 pm
Location: Norway
Contact:

Post by stubbscroll »

little joey wrote:C'mon Wai, who's old :wink:

A good problemset, but hardly qualifying as 'newbie'. Wonder what an 'elite' contest would look like...

Did anyone solve A without a prefab bigint class?
I was not able to solve A. My personal bigint library has no proper division or modulo function yet (only division/modulo of bigint by normal int)... I tried to use the routines from the "Programming challenges" book, but I couldn't get it to work. When looking back at the two hours wasted on A, I should have spent those two hours programming my own division routine instead.
Observer
Guru
Posts: 570
Joined: Sat May 10, 2003 4:20 am
Location: Hong Kong

Post by Observer »

Well I didn't use a pre-write bigint class... :)

Anyway, by "newbies" we mean it does not require in-depth knowledge of specific algorithms. If this term bothers you, please let us change it next time :wink:
7th Contest of Newbies
Date: December 31st, 2011 (Saturday)
Time: 12:00 - 16:00 (UTC)
URL: http://uva.onlinejudge.org
Eduard
Experienced poster
Posts: 183
Joined: Fri Sep 26, 2003 2:54 pm
Location: Armenia,Yerevan

Post by Eduard »

Hello.
My opinion is that this contest was much harder then last Waterloo contest.I spent much time on problem F and can't solve it.Please give me some hint about your algo.May be we can use the fact that 1<=f<=5.Please give some hint.
Eduard
someone who like to solve informatic problems.
http://acm.uva.es/cgi-bin/OnlineJudge?AuthorInfo:29650
Destination Goa
Experienced poster
Posts: 123
Joined: Thu Feb 10, 2005 4:46 am

Post by Destination Goa »

Heh... During first hour I solved 3 problems from Waterloo contest (including N*log(N) number of inverses). Though, all were WA until I refreshed the page :lol:

Others didn't go easy though... I liked E - that lexicographicness was real pain in the a** :)
marian
New poster
Posts: 30
Joined: Sun Oct 27, 2002 4:01 pm
Contact:

Post by marian »

little joey wrote:Did anyone solve A without a prefab bigint class?
Yeah, I did.
Destination Goa
Experienced poster
Posts: 123
Joined: Thu Feb 10, 2005 4:46 am

Post by Destination Goa »

I solved it with in-contest-fab bigint (though not a class, but 'div' function) :D
nukeu666
New poster
Posts: 44
Joined: Sun Feb 13, 2005 1:13 am
Location: India
Contact:

Post by nukeu666 »

i found this site few days ago
its GREAT!
till now i always wanted to practice coding but didnt where to start...

the problems in this noobie contest will come on volume 108 soon i hope...
even tho i cudnt get a single accepted entry, i learnt a good amount :roll:
Post Reply

Return to “Other words”