list of tutorial problems

ID NAME CODE USERS ACC %
32046    Knapsack Problem IITKESO207SPA3B 148 90.96
32047    Optimal BST IITKESO207SPA3C 132 92.27
32048    Largest bunch of zeros IITKESO207SPA3D 157 93.35
32073    The Permutation Game TPGAME 29 67.65
32105    Maybe a Minimum Spanning Tree IITKESO207SPA3E 122 91.04
32106    Simple Dijkstras algorithm IITKESO207SPA3F1 130 92.41
32107    Simple Dijkstras algorithm again IITKESO207SPA3F2 124 95.72
32108    Lexicographic Permutations IITKESO207SPA4A 133 93.01
32109    Relaying the roads IITKESO207SPA4B 133 95.99
32260    Implement FFT and its inverse IITKESO207A_1P_1 223 23.21
32445    COUNT JUMPS KLUG1 89 41.07
32447    How many are placed at last positions LASTPOS 34 86.06
32470    Make Versions in Segment Tree PSEGTREE 369 44.23
32684    Calculator IITKESO207A_2P_1 0 0.00
32685    Calculator IITKESO207A_2P 227 94.03
33305    Single Source Shortest Path IITKESO207A_4P_1 197 20.08
33329    Finding Max MAXEZ 14 82.76
33792    String CAPL 20 7.34
33796    Print String PRINTIT3 44 25.27
33836    Floor Arithmetics FLARIT 8 44.12
34008    Base and Power BAPM 111 28.60
34010    Friendship FRNDAM 181 52.89
34137    Memory Game 1 IITKESO207PA3Q1 85 39.92
34138    Memory Game 2 IITKESO207PA3Q2 77 31.13
34139    Topological Sorting TOPOSORT2 99 56.71
34166    Print The Pattern ABACABA 70 16.43
34170    CHT Practice CHTPRAC 54 24.42
34182    Tower of Hanoi Movement - Easy TOHMOVE1 89 36.34
34194    1+1 PSATEST 62 67.54
34195    Memory Game 3 IITKESO207PA4Q1 78 36.88
34213    Favourite Word IITKESO207PA4Q2 88 67.25
34264    Book Gift BOOKGFT 789 44.45
34277    Dynamic Network IITKESO207PA5Q1 83 68.42
34293    Flight IITKESO207PA5Q2 90 79.33
34295    Road Network IITKESO207PA5Q3 90 86.43
34318    Few to cover NOTINDY 5 6.09
34338    Strongly Connected Components IITKESO207PA6Q1 74 83.44
34350    Metro City IITKESO207PA6Q2 78 77.40
34351    Uncompress It! IITKESO207PA6Q3 71 76.85
34396    Do not print 0 CERI2018A 15 49.06
34397    A function table CERI2018B 14 47.27
34398    Congruent primes CERI2018C 6 37.84
34399    Largest prime factor CERI2018D 24 65.15
34400    A recurrence relation CERI2018E 31 64.40
34401    Encrypt a message CERI2018F 12 74.07
34402    Break a cryptosystem CERI2018G 9 81.25
34414    Polynomial evaluation CERI2018H 8 75.00
34415    Check factorization CERI2018I 8 71.43
34416    Euler Totient of factorized integer CERI2018J 9 54.55
34417    Sum of divisors CERI2018K 5 60.00
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.