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

NT Part 4: Mobius Function Part 1. The Introduction

  What is mobius function? This function is notated as  .  This function has lots of definitions. However, the main definition is the following.  is   if   or   is square-free and has even number of prime divisors.  is   if   is square-free and has odd number of prime divisors.  is   if   is not square-free.  also has a lot of interesting properties that make   so important.  for all  ,  and   is multiplicative. (A function   is multiplicative if   for all  . ) How do we calculate   fast? Again, we can tweak the Eratosthenes's Sieve a little bit. void preprocess ( void ) { int i, j ; for ( i = 1 ; i <= 111100 ; i ++ ) { mu [ i ] = 1 ; primechk [ i ] = 1 ; } primechk [ 1 ] = 0 ; for ( i = 2 ; i <= 111100 ; i ++ ) { if ( primechk [ i ] == ...
Post a Comment
Read more

NT Part 1:GCD, LCM, Euclidean Algorithm

  The definitions of GCD and LCM are well-known, (and taught in middle school I think) I will skip the definitions. Also, since  ,  calculating GCD is equivalent to calculating LCM. Now, how do we calculate the GCD of two numbers? A naive solution would be iterating over all positive integers no more than  . This will get the GCD in  ,  very very slow. We can calculate the GCD of   in   using Euclidean Algorithm. This algorithm uses the easy-to-prove fact  ,  where   is the remainder when   is divided by  ,  or just a%b. We can now use the following code. #include <iostream> using namespace std ; int gcd ( int u, int v ) { return u % v == 0 ? v : gcd ( v,u % v ) ; } int main ( void ) { int x, y ; cin >> x >> y ; cout << gcd ( x,y ) ; } How do we prove that this algorithm is  ?  Well, let's suppose that we started with  . Then...
Post a Comment
Read more

কোডফোর্সেস বেসিক প্রবলেম লিস্ট ১

IMPLEMENTATION  Problem 1: Codeforces 835A Problem 2: Codeforces 935B Problem 3: Codeforces 868A Problem 4: Codeforces 868B LOOPS (NOT NESTED) Problem 1: Codeforces 839A Problem 2: Codeforces 939A Problem 3: Codeforces 893A Problem 4: Codeforces 935A Problem 5: Codeforces 961A Problem 6: Codeforces 828A Problem 7: Codeforces 867A Problem 8: Codeforces 939B NESTED LOOPS  Problem 1: Codeforces 894A Problem 2: Codeforces 897A Problem 3: Codeforces 822B Problem 4: Codeforces 828B Problem 5: Codeforces 886A (Can also be solved using sorting) Problem 6: Codeforces 907A Problem 7: Codeforces 22B MATH Problem 1: Codeforces 869B  (Uses a loop) Problem 2: Codeforces 875A  (Uses a nested loop) Problem 3: Codeforces 922B  (Uses a nested loop)
Post a Comment
Read more