Newcomer problems

carlosbp2002 · Post by **carlosbp2002** » Tue Nov 11, 2003 8:08 pm

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 ??

bery olivier · Post by **bery olivier** » Wed Nov 12, 2003 1:48 pm

I guess the easier is 272 : Tex quotes

szymcio2001 · Post by **szymcio2001** » Thu Nov 13, 2003 1:34 am

bery olivier wrote:I guess the easier is 272 : Tex quotes

I think that 10055 is easier

Whinii F. · Post by **Whinii F.** » Thu Nov 13, 2003 5:52 am

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)

Russell John · Post by **Russell John** » Thu Nov 13, 2003 12:36 pm

Along with 10055, try out 10071 as well.

You also might find some easier problems between 100490 and 99.

WR · Post by WR » Tue Dec 16, 2003 2:58 pm

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.

shamim · Post by **shamim** » Wed Dec 17, 2003 9:37 am

Hey, How come nobody mentioned 113.

Rajib · Post by **Rajib** » Sun Jun 27, 2004 12:50 pm

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.

Alessandro · Post by **Alessandro** » Sun Jun 27, 2004 9:05 pm

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

scidong · Post by **scidong** » Mon Feb 13, 2006 1:10 pm

Uh, I think my things are easy.

Solmon K. · Post by **Solmon K.** » Sat Jun 10, 2006 11:25 am

10783 is very easy too!

Zaspire · Post by **Zaspire** » Sat Jun 10, 2006 4:31 pm

http://online-judge.uva.es/board/viewto ... ght=#45582

ebrahim · Post by **ebrahim** » Sat Jan 06, 2007 6:42 pm

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.

Post by **Carlos** » Sat Jan 06, 2007 9:56 pm

does this script still work after we disabled cgi statistics?

ebrahim · Post by **ebrahim** » Sat Jan 06, 2007 10:19 pm

I don't know whether it's data is up-to-date or not, but anyway it works!

OJ Board