Difference between revisions of "Sphere Online Judge"
m (rm col from confusing table) |
m (Reverted edits by Yiyuan (talk) to last revision by 202.3.77.11) |
||
(17 intermediate revisions by 10 users not shown) | |||
Line 1: | Line 1: | ||
== Sphere Online Judge (SPOJ) == | == Sphere Online Judge (SPOJ) == | ||
− | [http://spoj | + | [http://spoj.pl/problems/classical/ The Sphere Online Judge Problemset] |
+ | SPOJ is a programming site with a collection of selected but wide range of problems. It contains problems of all difficulties covering standard and non-standard algorithms. Moreover its problem set is increasing as one could post his/her own homemade problem. It also covers all the problems of the prestigious ACM International Collegiate Programming Contests(ICPC). | ||
== About == | == About == | ||
− | The SPOJ Project is developed by | + | The SPOJ Project is developed and maintained by Sphere Research Labs, based in Gdynia, Poland |
− | [http://spoj | + | [http://spoj.pl/info/]. |
== Problems == | == Problems == | ||
+ | SPOJ classifies problems into four categories - Classical problems, challenge problems, tutorial problems, and Partial Score problems. The classical problems work just like other online judges, where credit is given only on successful completion of the problem. | ||
+ | |||
+ | The other three categories provide partial credit for submission (provided you meet a minimal threshold.) | ||
+ | |||
+ | Challenge problems are meant to challenge the user into completing the problem while abiding by secondary constraints. Problems are ranked based on how well you complete the problem, whether it's by obtaining the best result or through another metric. Tutorial problems and partial score problems act similarly provide partial credit, and are meant for the user to become familiar with a method of programming. | ||
+ | |||
+ | Unlike other online judges SPOJ does not organize problems in volumes by their index - they are normally referenced by their tag. However, this site will reference these problems by their displayed numerical index. | ||
+ | |||
+ | Please use the [[Template:Problem | Problem Template]] when adding new problems; see [[Help:Editing]] for a step-by-step guide. | ||
{| border="1" | {| border="1" | ||
|"Volume" || '''SPOJ Link''' | |"Volume" || '''SPOJ Link''' | ||
|- | |- | ||
− | | [[SPOJ Volume I|Volume I]] || [http://spoj | + | | [[SPOJ Volume I|Volume I]] || [http://spoj.pl/problems/classical/sort=0,start=0 Problems 1-54] |
+ | |- | ||
+ | | [[SPOJ Volume II|Volume II]] || [http://spoj.pl/problems/classical/sort=0,start=50 Problems 55-110] | ||
+ | |- | ||
+ | | [[SPOJ Volume III|Volume III]] || [http://spoj.pl/problems/classical/sort=0,start=100 Problems 112-202] | ||
+ | |- | ||
+ | | [[SPOJ Volume IV|Volume IV]] || [http://spoj.pl/problems/classical/sort=0,start=150 Problems 203-292] | ||
|- | |- | ||
− | | [[SPOJ Volume | + | | [[SPOJ Volume V|Volume V]] || [http://spoj.pl/problems/classical/sort=0,start=200 Problems 293-383] |
|- | |- | ||
− | | [[SPOJ Volume | + | | [[SPOJ Volume VI|Volume VI]] || [http://spoj.pl/problems/classical/sort=0,start=250 Problems 384-685] |
|- | |- | ||
− | | [[SPOJ Volume | + | | [[SPOJ Volume VII|Volume VII]] || [http://spoj.pl/problems/classical/sort=0,start=300 Problems 687-903] |
|- | |- | ||
− | | [[SPOJ Volume | + | | [[SPOJ Volume XI|Volume XI]] || Problems 1001-1100 |
|- | |- | ||
− | | [[SPOJ Volume | + | | [[SPOJ Volume XXII|Volume XXII]] || Problems 2101-2200 |
|- | |- | ||
− | | [[SPOJ | + | | [[SPOJ Tutorial|Tutorial]] || [http://spoj.pl/problems/tutorial/ All Tutorial Problems] |
|- | |- | ||
− | | [[SPOJ | + | | [[SPOJ Challenge|Challenge]] || [http://spoj.pl/problems/challenge/ All Challenge Problems] |
|- | |- | ||
− | | [[SPOJ | + | | [[SPOJ Partial|Partial]] || [http://www.spoj.pl/problems/partial All Partial Score Problems] |
|} | |} | ||
[[Category:Sphere Online Judge]] | [[Category:Sphere Online Judge]] |
Latest revision as of 11:12, 4 May 2012
Sphere Online Judge (SPOJ)[edit]
The Sphere Online Judge Problemset SPOJ is a programming site with a collection of selected but wide range of problems. It contains problems of all difficulties covering standard and non-standard algorithms. Moreover its problem set is increasing as one could post his/her own homemade problem. It also covers all the problems of the prestigious ACM International Collegiate Programming Contests(ICPC).
About[edit]
The SPOJ Project is developed and maintained by Sphere Research Labs, based in Gdynia, Poland [1].
Problems[edit]
SPOJ classifies problems into four categories - Classical problems, challenge problems, tutorial problems, and Partial Score problems. The classical problems work just like other online judges, where credit is given only on successful completion of the problem.
The other three categories provide partial credit for submission (provided you meet a minimal threshold.)
Challenge problems are meant to challenge the user into completing the problem while abiding by secondary constraints. Problems are ranked based on how well you complete the problem, whether it's by obtaining the best result or through another metric. Tutorial problems and partial score problems act similarly provide partial credit, and are meant for the user to become familiar with a method of programming.
Unlike other online judges SPOJ does not organize problems in volumes by their index - they are normally referenced by their tag. However, this site will reference these problems by their displayed numerical index.
Please use the Problem Template when adding new problems; see Help:Editing for a step-by-step guide.
"Volume" | SPOJ Link |
Volume I | Problems 1-54 |
Volume II | Problems 55-110 |
Volume III | Problems 112-202 |
Volume IV | Problems 203-292 |
Volume V | Problems 293-383 |
Volume VI | Problems 384-685 |
Volume VII | Problems 687-903 |
Volume XI | Problems 1001-1100 |
Volume XXII | Problems 2101-2200 |
Tutorial | All Tutorial Problems |
Challenge | All Challenge Problems |
Partial | All Partial Score Problems |