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

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

Binary Search & The Kahini!

Suppose you are given an array of numbers and you need to find whether the number X is in the array. The straight forward approach to do that would be to run a loop and compare each number in the array with X. This is what the pseudo code would look like: function findNumber ( A , x ) for i = 0 to length of array A if A [ i ] == x return true return false For example, let’s assume you are given this array: [7, 14, 17, 21, 35, 60, 92, 121, 155] And, you were looking for the number 92. The loop would start checking each of the number in the array against 92 and would find after iterating through the array 7 times. The worst case time complexity of this approach would be O(n). However, whenever the array itself is in sorted order (like in this case where the numbers are increasing in value from left to right of the array), you can perform something that is much more efficient: binary search. The prerequisite of binary search is that the array should be sor...

NT Part 3: Playing with Modulars, and Euler Phi Function

Quick stuff first, fast exponentiation in logarithm time. Let us calculate in modular in . It uses binary expansion of , and is very very straightforward. ll exp ( ll x, ll n ) { if ( n == 0 ) return 1 ; if ( n == 1 ) return x ; if ( n % 2 == 0 ) return exp ( ( x * x ) % mod,n / 2 ) ; if ( n % 2 == 1 ) return ( x * exp ( ( x * x ) % mod,n / 2 ) ) % mod ; } Now, let us talk about modular inverses. By using Extended Euclidean Algorithm, we can get the inverse of modulo . #include <iostream> int inv ( int a, int m ) { int temp = m, q, t, u = 0 , v = 1 ; if ( m == 1 ) return 0 ; while ( a > 1 ) { q = a / m ; t = m ; m = a % m ; a = t ; t = u ; u = v - q * u ; v = t ; } if ( v < 0 ) v + = temp ; return v ; } int main ( void ) { int a, m ; std :: cin ...

This lifeless coder is welcoming you!

Search This Blog