Skip to main content

Easy Problems List (Updated)

UVa Online Judge
12577 - Hajj-e-Akbar
12289 - One-Two-Three
11942 - Lumberjack Sequencing
12015 - Google is Feeling Lucky
1124 - Celebrity jeopardy
1225 - Digit Counting
12578 - 10:6:2
12342 - Tax Calculator
11936 - The Lazy Lumberjacks
12502 - Three Families
12646 - Zero or One
12478 - Hardest Problem Ever
TIMUS Online Judge (acm.timus.ru)
1000 - A+B Problem
1001 - Reverse Root
1068 - Sum
LightOJ
Lift
How Cow
Setu
February 29
Minimum Arc Distance
Hidden Secret!
IP Checking
Agent J
Unlucky Bird
Double Ended Queue


List of Numbers of Easy Problem’s from UVA [uva.onlinejudge.org]:
100 102 113 119 136 147 160 190
272 299
324 343 344 350 355 357 369 378 382 386 389
401 412 414 438 440 441 442 443 444 458 476 477 478 483 488 489 490 492 494 495 499
537 541 543 575 579 583 591
612 623 673 674 686
706 713
847 895
10008 10013 10035 10038 10050 10055 10062 10070 10071 10079 10082
10101 10110 10127 10168 10170 10194 10195
10220 10222 10235 10260 10286 10293
10300 10302 10323 10324 10340 10346 10370
10409 10424 10450 10469 10473 10499
10509 10573 10579 10591
10611 10696 10699
10714 10773 10783 10789
10812 10894
10905 10921 10922 10924 10929 10931 10935 10940 10945 10970
11000 11044 11074
11172
11233

Comments

Post a Comment

Popular posts from this blog

Big O Notation — Time & Space Complexity in Ruby!

  Big O Cheat Sheet In this post, we will look at the Big O Notation both time and space complexity! For all our examples we will be using Ruby. What is Big O Notation? Big O notation is just a fancy way of describing how your code’s performance depends on the amount of data its processing. It allows us to calculate the worst possible runtime of an algorithm, or how long it takes the algorithm to complete. In other words, it informs us of how much it will slow down based on the input size. It’s usually talked about in two ways the  time complexity ( how long an algorithm takes )and  space complexity ( how much space an algorithm uses ) Let me put this graph here we can refer to it as we go on, it’s a graph showing the complexities compare against each other. Big O complexity chart Time Complexity Before we get try wrapping our heads around the different big O notations here is a nice table that I am borrowing to show how speed will slow down based on the size of the datas...
Post a Comment
Read more

NT Part 2: Generating Primes, Prime Test, Prime Factorization

  Generating primes fast is very important in some problems. Let's cut to the chase and introduce Eratosthenes's Sieve. The main idea is the following. Suppose we want to find all primes between 2 and 50. Iterate from 2 to 50. We start with 2. Since it is not checked, it is a prime number. Now check all numbers that are multiple of    except  2. Now we move on, to number 3. It's not checked, so it is a prime number. Now check all numbers that are multiple of  ,   except  3. Now move on to 4. We see that this is checked - this is a multiple of 2! So 4 is not a prime. We continue doing this. Here's the implementation. #include <stdio.h> int primechk [ 21000 ] ;   void preprocess ( void ) { int i, j ; for ( i = 2 ; i <= 20000 ; i ++ ) { primechk [ i ] = 1 ; } for ( i = 2 ; i <= 20000 ; i ++ ) { if ( primechk [ i ] == 1 ) { for ( j = 2 ; i * j <= 20000...
Post a Comment
Read more

NT Part 6: Sieve of Eratosthenes(Details)

  About 2300 years ago from today, famous Greek mathematician Euclid proved that there are an infinite number of prime numbers. Since then people have been searching for these prime numbers. In 1849, one of the greatest mathematician of all time, Carl Fredrick Gauss, had identified almost all of the prime numbers within the first 3 hundred thousand whole numbers. In the age of computers, we can find large prime numbers in the blink of an eye. But to do that, we need to know a bit of programming and a 2000 year old algorithm. By the end of this tutorial, you will be able to figure out a solution on your own to Gauss’s problem. What is a Prime Number? A prime number is an integer number that is divisible by 1 and the number itself only. For example, 7 is divisible by 1 and 7 only. But 6 is not a prime number because 6 is be divisible by 2 and 3 as well. It is worth mentioning that 1 itself is not a prime number. Now if you are asked to determine if a number is a prime number, you can...
Post a Comment
Read more