Page 1 of 2
Newcomer problems
Posted: Tue Nov 11, 2003 8:08 pm
by carlosbp2002
Where can i find problems from a novice like me ?
I heard about adhoc problems,, but how do i know when a problem belong to this category ??
Anybody can tell me some easy(no too easy of course) problems ??
Posted: Wed Nov 12, 2003 1:48 pm
by bery olivier
I guess the easier is 272 : Tex quotes
Posted: Thu Nov 13, 2003 1:34 am
by szymcio2001
bery olivier wrote:I guess the easier is 272 : Tex quotes
I think that 10055 is easier
Posted: Thu Nov 13, 2003 5:52 am
by Whinii F.
I would recommend these few typical problems in some categories:
Dynamic Programming:
10003 Cutting Sticks
10192 Vacation
10306 e-Coins
10051 Tower of Cubes
Backtracking:
399 Another Puzzling Problem
Graph Theory:
10004 Bicoloring
10099 The Tourist Guide
10147 Highways
10305 Ordering Tasks
Some ad-hocs:
10107 What is the Median?
10116 Robot Motion
10164 Number Game
10191 Longest Nap
10194 Football (aka Soccer)
10221 Satellites
10530 Guessing Game
Geometry:
10112 Myacm Triangles
10167 Birthday Cake
10348 Submarines
Maybe few of these problems could be too hard or in a wrong category, but plz forgive me about that.
And, I'll bet 10071 (Back to High School Physics) is the EASIEST problem in ths problemset..
(Maybe 10469 will make a good match huh)
Posted: Thu Nov 13, 2003 12:36 pm
by Russell John
Along with 10055, try out 10071 as well.
You also might find some easier problems between 100490 and 99.
Posted: Tue Dec 16, 2003 2:58 pm
by WR
I've also started just a few weeks ago, and apart from those
problems already mentioned (like 272) I found problems
499, 10370, 541, 10035, 10297 and 10197 rather easy.
Posted: Wed Dec 17, 2003 9:37 am
by shamim
Hey, How come nobody mentioned 113.
Posted: Sun Jun 27, 2004 12:50 pm
by Rajib
Mathematical problem like this, is not so easy. This problem is easy but not most easy. They are talking about most easy problems for new solvers.
Re: Newcomer problems
Posted: Sun Jun 27, 2004 9:05 pm
by Alessandro
carlosbp2002 wrote:I heard about adhoc problems,, but how do i know when a problem belong to this category ??
All programming contests problems can be reduced to a few types of problems, mainly:
Dynamic Programming
Greedy
Complete Search
Flood Fill
Shortest Path
Recursive Search Techniques
Minimum Spanning Tree
Knapsack
Computational Geometry
Network Flow
Eulerian Path
Two-Dimensional Convex Hull
BigNums
Heuristic Search
Approximate Search
(taken from the USACO website)
The AdHoc problems are those ones that don't belong to anyone set above; usually, you have to find the solution only with your brain
The CEOIs are full of AdHoc problems... just search for them to see some examples.
Goodbye
Uh, I think my things are easy.
Posted: Mon Feb 13, 2006 1:10 pm
by scidong
Uh, I think my things are easy.
...
Posted: Sat Jun 10, 2006 11:25 am
by Solmon K.
10783 is very easy too!
Posted: Sat Jun 10, 2006 4:31 pm
by Zaspire
Igor's UVa Tools
Posted: Sat Jan 06, 2007 6:42 pm
by ebrahim
I use next2solve @ Igor's UVa Tools:
http://shygypsy.com/acm/cgi-bin/next2solve.pl?id=00000
You can put your UVa ID instead of 00000.
Posted: Sat Jan 06, 2007 9:56 pm
by Carlos
does this script still work after we disabled cgi statistics?
Posted: Sat Jan 06, 2007 10:19 pm
by ebrahim
I don't know whether it's data is up-to-date or not, but anyway it works!