tell me some easy problems in Volume I ,thanks a lot.

[tzzx]

i am a beginner.so i want to practise some easy and interesting problems/
i hope these problems would give me a great of help.

[rjhadley]

One possible measure of difficulty is the percent success rate. It can be a little misleading at times however.

102 is perhaps one of the easier problems in the set. 133, 144, 151 are all reasonably straightforward as well and somewhat similar, but perhaps not too interesting.

Some more interesting, but harder problems relating to computer science topics are: 111 (dynamic programming - the description is hard to understand though), 120 (sorting), 112 (trees), 136 (can be solved with appropriate data structure).

In you are into mathematics problems perhaps try 106, 113 (short solution, but might requires some thought), 138 (linear diophantine equation), 190 (excerise is basic geometry)

Probably the best advice though is to find questions that appeal to you and try those. If you get stuck, just post question(s) in forum.

[tzzx]

could you tell me some more MATH problems on UVA.

[Dominik Michniewski]

Look at problems in Volumes 100-104. There are a lot of math retaled problems ....

DM

[tzzx]

but i have solved all of them.

if you could ,send me some on #101XX--#104XX
these are new and interesting .

[Dominik Michniewski]

Try most of problems signed by Shahriar Manzoor ...
A lot of them is related to geometry or number theory, including divisibility, prime numbers and so on. But this problem could be hard to solve sometimes like 10402 )

DM

[Red Scorpion]

In V-4, try to solve P-453(Intersecting Circle). The problem is very easy, but very hard to got AC.
In V-102, there are many of math problem,
try "Math Lovers

[rjhadley]

A variety of math problems for you that I like/have done:

Classical Algebra: 264, 412(*), 10006, 10104
Prime Numbers: 406, 543(*), 686, 10140, 10299, 10311, 10394
Enumeration: 674(*), 10312
Geometry: 10297(*), 10439
Graph Theory: 544, 10178(*), 10369, 10389
Optimization: 497, 562(*), 10405(*), 10440
Probability: 10491(*)
Other: 496(*), 10339, 10378

It depends upon how much math and computer science you know, but I have marked some of the easier ones in the list with (*).

[little joey]

This is an interesting question that everyone solving problems here asks him/herself once in a while. The problem is how to measure how 'easy' or 'difficult' a particular problem is.

The most straightforward way is to look at the Volume Stats pages and compare Number of Submissions and Acceptrate. But these figures only give a very rough indication of the 'difficulty' and are hard to oversee (14 volume pages).

I think the following is a better indication: for every problem count the number of people ranked 1 - 100 in the UVA ranklist that solved that particular problem. I call this the 'Top 100 index'. By selecting only the top 100, you sieve out the 'incidental' competitors that only visit this site a few times and leave, and also most of the 'multiple' accounts.

I did this and compiled a list of all 1123 problems, rated from 'easy' to 'difficult'. To further improve the 'accuracy', I added a 'Top 25 index'.
The list can be found at http://joachim.wulff.net/valladolid/difficult.html

Surprisingly, non of the problems has an index of 100. The easiest problems are:
index 98: 103, 108
index 97: 102, 111, 113, 120, 136, 146, 147, 347

The hardest problems are:
index 1: 207, 329, 691, 10435, 289, 829, 10059, 10064, 10103
index 0: 813, 849, 10153, 10402, 10478.

Also surprising is that problem 100 only has an index of 89.

I think this topic should be moved to Misc

[Observer]

Wow! 10297 Beavergnaw is fun!!

Are there any similar qq?? Plz tell!

[Moni]

A variety of math problems for you that I like/have done:

Classical Algebra: 264, 412(*), 10006, 10104
Prime Numbers: 406, 543(*), 686, 10140, 10299, 10311, 10394
Enumeration: 674(*), 10312
Geometry: 10297(*), 10439
Graph Theory: 544, 10178(*), 10369, 10389
Optimization: 497, 562(*), 10405(*), 10440
Probability: 10491(*)
Other: 496(*), 10339, 10378

It depends upon how much math and computer science you know, but I have marked some of the easier ones in the list with (*).

Good! This type of summry will be really helpful!
I think in every vol. section there must be a sticky post about the problem catagory of that particular vol. so all can know who has got AC by which Algorithm... and consult with them.....

[miras]

some very intrestings problems are
10000 --->BFS
10102---->BFS
459------->DFS
__________________
Made The Force Be WIth You

[Master]

Yes it is very much problematic for the solvers to find out the easy problem or a specific subject related problems. For this, I have hosted a website:

http://www.acmbeginner.tk

The solvers can visit this side to find out the easy and subject related problems and also many tricks and tutorials.

M H Rasel
acmbeginner

[xbeanx]

It is good to start easy. But, if you really want to hone your skills, I say don't back down from any problem.

I only have 30 problems solved so far, but I did them all consecutively. I started at 100 and went from there. There have been many problems that I didn't know how to approach, so I took a couple of days to research that type of problem. I think that because of this, I forced myself to learn a few new techniques. If I had've only did the problems I was capable of, I would not have learned much.

There are a lot of very smart people on this board that will help you with the problems. So the odds are that you will eventually construct a solution and learn in the process.

PS, problem 105 is also very easy, if you do not approach it from a geometry angle.

[anupam]

Volume 4 is the easist, three is easier.
--
Anupam