Sphere Online Judge
sign in
News
Problems
basics
challenge
classical
none
partial
riddle
tutorial
Status
Ranking
Forum
SPOJ
time:
2024-12-21
03 : 26 : 14
All
ADA95
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
15
16
17
18
19
20
21
22
23
24
25
Next
>
ID
NAME
CODE
USERS
ACC %
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
224
23.15
32445
COUNT JUMPS
KLUG1
90
41.33
32447
How many are placed at last positions
LASTPOS
34
86.06
32470
Make Versions in Segment Tree
PSEGTREE
395
45.09
32684
Calculator
IITKESO207A_2P_1
0
0.00
32685
Calculator
IITKESO207A_2P
226
94.00
33305
Single Source Shortest Path
IITKESO207A_4P_1
197
20.08
33329
Finding Max
MAXEZ
14
82.76
33792
String
CAPL
20
7.10
33796
Print String
PRINTIT3
45
25.68
33836
Floor Arithmetics
FLARIT
8
44.12
34008
Base and Power
BAPM
113
28.73
34010
Friendship
FRNDAM
181
52.73
34137
Memory Game 1
IITKESO207PA3Q1
85
39.92
34138
Memory Game 2
IITKESO207PA3Q2
77
31.13
34139
Topological Sorting
TOPOSORT2
104
59.22
34166
Print The Pattern
ABACABA
119
20.82
34170
CHT Practice
CHTPRAC
56
23.94
34182
Tower of Hanoi Movement - Easy
TOHMOVE1
92
35.95
34194
1+1
PSATEST
63
65.55
34195
Memory Game 3
IITKESO207PA4Q1
78
36.88
34213
Favourite Word
IITKESO207PA4Q2
88
67.25
34264
Book Gift
BOOKGFT
896
43.26
34277
Dynamic Network
IITKESO207PA5Q1
85
68.29
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
25
65.67
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
80.00
34415
Check factorization
CERI2018I
8
71.43
34416
Euler Totient of factorized integer
CERI2018J
9
48.65
34417
Sum of divisors
CERI2018K
5
60.00
34418
Number of divisors of factorial
CERI2018L
9
62.96
34425
Vertical strips pattern
VSTRIPS
6
81.82
34426
Horizontal strips pattern
HSTRIPS
0
0.00
34474
Möbius function
MMFMOB
25
49.35
© Spoj.com. All Rights Reserved. Spoj uses
Sphere Engine
™ © by
Sphere Research Labs
.