AllADA95 DOC ASM32-GCC ASM32 ASM64 GAWK MAWK BASH BC BF C-CLANG C NCSHARP CSHARP C++ 4.3.2 CPP CPP14-CLANG CPP14 C99 CLPS CLOJURE COBOL COFFEE LISP clisp LISP sbcl D D-CLANG D-DMD DART ELIXIR ERL FSHARP FANTOM FORTH FORTRAN GO GOSU GRV HASK ICON ICK JAR JAVA JS-RHINO JS-MONKEY JULIA KTLN LUA NEM NICE NIM NODEJS OBJC OBJC-CLANG OCAML OCT PAS-GPC PAS-FPC PDF PERL PERL6 PHP PICO PIKE PS PRLG-swi PROLOG PYTHON PYPY PYPY3 PYTHON3 PY_NBC R RACKET RUBY RUST SCALA SCM guile CHICKEN SCM qobi SED ST SQLITE SWIFT TCL TEXT UNLAMBDA VB.NET WHITESPACE

list of tutorial problems

< Previous 18  19  20  21  22  23  24  25  26  27  28 Next >
ID NAME CODE USERS ACC %
29656    Left, right or center? CROSSPDCT 128 31.57
29692    Inside or outside? INOROUT 229 28.02
29747    Lucky 7, Unlucky 13 LUCKY713 81 42.80
29748    Robin Hood RHOOD 37 45.45
29749    Hidden Couple HCOUPLE 371 31.91
30409    Generalized Fibonacci GENFIB 105 13.52
30623    PRIME HEIGHT PRMHT 0 0.00
30668    SOME MYSTERY HAPPENED FIBMYSTRY 15 20.93
30753    Ada and Economy ADAMONEY 124 28.89
30784    Ada and Pear ADAPEAR 14 13.42
30829    ARE YOU GOOD IN MATHS? BABA1 274 32.61
30831    Easy Stack STACKEZ 1744 23.72
30832    Easy Queue QUEUEEZ 1732 27.26
30840    Ada and Database ADABASET 21 40.96
30847    Traversing Tree TREEVERSE 121 21.46
30891    Sản xuất SANXUAT 0 0.00
30907    Easy Fibonacci FIBEZ 596 14.72
31066    Number Breaking BREAKING 854 32.51
31138    Just Sum SIMSUM 11 14.29
31182    Sub array Sum1 IITKESOA3P1 95 32.67
31183    Sub array Sum2 IITKESOA3P2 43 15.83
31283    Count The Players AGPC01C 52 26.44
31288    Too Late AGPC01B 57 8.27
31934    Last Digit of Power LSTDGT 81 20.87
31939    FFT and inverse FFT IITKESO207SPA1 136 23.76
32013    Red-Black Trees IITKESO207SPA2 177 85.85
32045    Coin Game IITKESO207SPA3A 168 91.39
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 34 54.64
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 228 23.42
32445    COUNT JUMPS KLUG1 92 41.63
32447    How many are placed at last positions LASTPOS 37 86.14
32470    Make Versions in Segment Tree PSEGTREE 413 45.33
32684    Calculator IITKESO207A_2P_1 0 0.00
32685    Calculator IITKESO207A_2P 232 94.01
33305    Single Source Shortest Path IITKESO207A_4P_1 197 20.08
33329    Finding Max MAXEZ 20 85.29
33792    String CAPL 22 7.67
33796    Print String PRINTIT3 47 26.49
33836    Floor Arithmetics FLARIT 14 44.19
34008    Base and Power BAPM 117 29.10
34010    Friendship FRNDAM 186 53.08
34095    Arithmetic Operations IITKESO207PA1 76 75.40
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.