DOCSLIB.ORG

Dc Prf-SPOJ-Classical.Ps

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

  1766
Copy Link

Archives of the Sphere Online Judge

classical problemset
Editors:

1

Hem nt Verma Nghia Nguyen Hoang

  • Ł z Kuszner
  • Lukas Mai

balaji Stephen Merriman u.swarnaprakash Blue Mary Andrés Leonardo Rojas Adrian Kosowski Duarte Adrian Kuegel

  • Brian
  • R hul Garg
  • Yash

Neal Zane Robert Rychcicki

  • Chinh Nguyen
  • VOJ problem setters

  • Paweł Dobrzycki
  • ?????

Patryk Pomy alski Konrad Piwakowski

  • Frank R fael Arteaga
  • Zhang Taizhi

iorel alii Mauro Persano

  • Tomek Czajka
  • P.Kasthuri Rangan-

Pripoae Toni Sebastian Kanthak

  • Reinier César Mujica
  • Bartłomiej Kowalski

Hdez Ivan Alfonso

  • Radu Grigore
  • Olamendy

  • k Gor on
  • Martin Bader

Lovro Puzar dqd

  • Lordxfas x
  • Piotr Piotrowski

Rusl n Sennov Tomasz Goluch
Camilo Andrés Varela León Spooky Jin Bin Paritosh Aggarwal Thanh-Vy Hua Le Đôn Khue Roman Sol Csaba Noszaly Wanderley Guimaraes Analysis Mode (Bogardan Michał Czuczman Hellkite) Jelani Nelson (Minilek) Abhilash I Daniel Gómez Didier Paul Draper Ngô Minh Đu+’c Bobby Xiao Neal Wu Darek Dereniowski Prasanna Nguye^~n Ha Du+o+ng Piotr Łowiec Nguyen Minh Hieu Robin Nittka Qu Jun Ahmed Aly Fabio Avellaneda Adam Dzedzej Hoang Hong Quan Ajay Somani

  • abhijith reddy d
  • Rahul

Tomas. Bob
Nguyen Van Quang Huy Nikola P Borisov

Diego Satoba
Mir Wasi Ahmed

Luka Kalinovcic yandry pérez
Pawel Gawrychowski Matthew Reeder Rafal clemente
Marco Gallotta

Pavel Kuznetsov Robert Gerbicz Chen Xiaohong Simon Gog
Tomasz Niedzwiecki Andrés Mejía-Posada Andres Galvis Slobodan Alfonso2 Peterssen Krzysztof Kluczek Jose Daniel Rdguez Abel Nieto Rodriguez Bogusław K. Osuch Gogu Marian
Kashyap KBR John Rizzo Race with time Michał Małafiejski Ivan Metelsky Phenomenal
Le Trong Dao

Muntasir Azam Khan
Nguyen Dinh Tu

2

Last updated: 2009-10-09 09:00:05

3

Preface

This electronic material contains a set of algorithmic problems, forming the archives of the Sphere Online Judge (http://www.spoj.pl/), classical problemset. The document can be accessed at the following URLs:

in PostScript format: http://www.spoj.pl/problems/classical.ps in Portable Document Format: http://www.spoj.pl/problems/classical.pdf

These resources are constantly updated to synchronise with the ever-changing hypertext version of the problems, and to include newly added problems. If you have obtained this document from another source, it is strongly recommended that you should download the current version from one of the aforementioned URLs.

Enjoy problem-solving at the Sphere Online Judge!

Disclaimer from the Editors. Despite our best efforts, it is possible that this document contains errors or that some of the content differs slightly from its original hypertext form. We take no responsibility for any such faults and their consequences. We neither authorise nor approve use of this material for any purpose other than facilitating problem solving at the Sphere Online Judge site; nor do we guarantee its fitness for any purpose whatsoever.

The layout of the problems in this document is the copyright of the Editors named on the cover (as determined by the appropriate footers in the problem description). The content is the copyright of the respective Editor unless the copyright holder is otherwise stated in the ’resource’ section. The document as a whole is not protected by copyright, and fragments of it are to be regarded independently. No responsibility is taken by the Editors if use or redistribution of this document violates either their or third party copyright laws. When referring to or citing the whole or a fragment of this document, please state clearly the aforementioned URLs at which the document is to be found, as well as the resources from which the problems you are referring to originally came.

Remarks concerning this document should be sent to the following e-mail address: [email protected].

4

Table of Contents

1. Problem TEST (1. Life, the Universe, and Everything) 2. Problem PRIME1 (2. Prime Generator) 3. Problem SBSTR1 (3. Substring Check (Bug Funny)) 4. Problem ONP (4. Transform the Expression) 5. Problem PALIN (5. The Next Palindrome) 6. Problem ARITH (6. Simple Arithmetics) 7. Problem BULK (7. The Bulk!) 8. Problem CMPLS (8. Complete the Sequence!) 9. Problem DIRVS (9. Direct Visibility)
10. Problem CMEXPR (10. Complicated Expressions) 11. Problem FCTRL (11. Factorial) 12. Problem MMIND (12. The Game of Master-Mind) 13. Problem HOTLINE (13. Hotline) 14. Problem IKEYB (14. I-Keyboard) 15. Problem SHPATH (15. The Shortest Path) 16. Problem TETRA (16. Sphere in a tetrahedron) 17. Problem CRYPTO1 (17. The Bytelandian Cryptographer (Act I)) 18. Problem CRYPTO2 (18. The Bytelandian Cryptographer (Act II)) 19. Problem CRYPTO3 (19. The Bytelandian Cryptographer (Act III)) 20. Problem CRYPTO4 (20. The Bytelandian Cryptographer (Act IV)) 21. Problem TRICENTR (22. Triangle From Centroid) 22. Problem PIR (23. Pyramids) 23. Problem FCTRL2 (24. Small factorials) 24. Problem POUR1 (25. Pouring water) 25. Problem BSHEEP (26. Build the Fence) 26. Problem SBANK (27. Sorting Bank Accounts) 27. Problem HMRO (28. Help the Military Recruitment Office!) 28. Problem HASHIT (29. Hash it!) 29. Problem BLINNET (30. Bytelandian Blingors Network) 30. Problem MUL (31. Fast Multiplication) 31. Problem NHAY (32. A Needle in the Haystack) 32. Problem TRIP (33. Trip) 33. Problem RUNAWAY (34. Run Away) 34. Problem EQBOX (35. Equipment Box) 35. Problem CODE1 (36. Secret Code) 36. Problem PROPKEY (37. The Proper Key) 37. Problem LABYR1 (38. Labyrinth) 38. Problem PIGBANK (39. Piggy-Bank) 39. Problem STONE (40. Lifting the Stone) 40. Problem WORDS1 (41. Play on Words) 41. Problem ADDREV (42. Adding Reversed Numbers) 42. Problem BOOKS1 (43. Copying Books) 43. Problem SCYPHER (44. Substitution Cipher) 44. Problem COMMEDIA (45. Commedia dell Arte) 45. Problem SCRAPER (47. Skyscraper Floors)

5

46. Problem BEADS (48. Glass Beads) 47. Problem HAREFOX (49. Hares and Foxes) 48. Problem INCARDS (50. Invitation Cards) 49. Problem TOUR (51. Fake tournament) 50. Problem JULKA (54. Julka) 51. Problem JASIEK (55. Jasiek) 52. Problem DYZIO (56. Dyzio) 53. Problem SUPPER (57. Supernumbers in a permutation) 54. Problem PICAD (58. Crime at Piccadily Circus) 55. Problem BIA (59. Bytelandian Information Agency) 56. Problem DANCE (60. The Gordian Dance) 57. Problem BRCKTS (61. Brackets) 58. Problem IMP (62. The Imp) 59. Problem SQRBR (63. Square Brackets) 60. Problem PERMUT1 (64. Permutations) 61. Problem BALL1 (65. Ball) 62. Problem CRSCNTRY (66. Cross-country) 63. Problem CUTOUT (67. Cutting out) 64. Problem EXPR1 (68. Expression) 65. Problem MOULDS (69. Moulds) 66. Problem RELATS1 (70. Relations) 67. Problem TREE1 (71. Tree) 68. Problem BAC (73. Bacterial) 69. Problem DIVSUM (74. Divisor Summation) 70. Problem EDIT1 (75. Editor) 71. Problem EDIT2 (76. Editor Inverse) 72. Problem BRICKS (77. New bricks disorder) 73. Problem MARBLES (78. Marbles) 74. Problem EASYPIE (82. Easy Problem) 75. Problem BUNDLE (83. Bundling) 76. Problem SHORTCUT (84. Shortcut) 77. Problem DICE1 (85. Dice Contest) 78. Problem RAIN1 (86. November Rain) 79. Problem FOOTBALL (87. Football) 80. Problem TREE2 (88. Which is Next) 81. Problem HANGLET (89. Hang or not to hang) 82. Problem MINIMAX (90. Minimizing maximizer) 83. Problem TWOSQRS (91. Two squares or not two squares) 84. Problem CUTSQRS (92. Cutting off Squares) 85. Problem MAYA (94. Numeral System of the Maya) 86. Problem STPAR (95. Street Parade) 87. Problem SHOP (96. Shopping) 88. Problem PARTY (97. Party Schedule) 89. Problem DFLOOR (98. Dance Floor) 90. Problem BUS (99. Bus) 91. Problem BABTWR (100. Tower of Babylon) 92. Problem FISHER (101. Fishmonger)

6

93. Problem LITEPIPE (102. GX Light Pipeline Inc) 94. Problem HIGH (104. Highways) 95. Problem ALICEBOB (105. Alice and Bob) 96. Problem BINSTIRL (106. Binary Stirling Numbers) 97. Problem MAYACAL (107. Calendar of the Maya) 98. Problem MORSE (108. Decoding Morse Sequences) 99. Problem EXCHNG (109. Exchanges)
100. Problem CISTFILL (110. Fill the Cisterns) 101. Problem SEGVIS (112. Horizontally Visible Segments) 102. Problem FAMILY (115. Family) 103. Problem INTERVAL (116. Intervals) 104. Problem RHOMBS (118. Rhombs) 105. Problem SERVERS (119. Servers) 106. Problem SOLIT (120. Solitaire) 107. Problem TTABLE (121. Timetable) 108. Problem STEVE (122. Voracious Steve) 109. Problem PAYING (123. Paying in Byteland) 110. Problem RENT (130. Rent your airplane and make money) 111. Problem SQDANCE (131. Square dance) 112. Problem HELPR2D2 (132. Help R2-D2!) 113. Problem PHONY (134. Phony Primes) 114. Problem MAWORK (135. Men at work) 115. Problem TRANS (136. Transformation) 116. Problem PARTIT (137. Partition) 117. Problem POSTERS (138. Election Posters) 118. Problem MAZE (139. The Long and Narrow Maze) 119. Problem LONER (140. The Loner) 120. Problem GLUE (142. Johnny and the Glue) 121. Problem ALIENS (145. Aliens) 122. Problem MULTIPLY (146. Fast Multiplication Again) 123. Problem TAUT (147. Tautology) 124. Problem MLAND (148. Land for Motorways) 125. Problem FSHEEP (149. Fencing in the Sheep) 126. Problem PLONK (150. Where to Drink the Plonk?) 127. Problem COURIER (151. The Courier) 128. Problem SCALES (153. Balancing the Stone) 129. Problem ROCK (154. Sweet and Sour Rock) 130. Problem PALSEC (160. Choosing a Palindromic Sequence) 131. Problem PAINTTMP (174. Paint templates) 132. Problem POLY1 (175. Polygon) 133. Problem SUM1SEQ (176. Sum of one-sequence) 134. Problem ABWORDS (177. AB-words) 135. Problem ROADNET (178. Road net) 136. Problem WORDEQ (179. Word equations) 137. Problem CONTPACK (180. How to pack containers) 138. Problem SCUBADIV (181. Scuba diver) 139. Problem WINDOW1 (182. Window)

7

140. Problem ASCIRC (183. Assembler circuits) 141. Problem ATMS (184. Automatic Teller Machines) 142. Problem CHASE1 (185. Chase) 143. Problem LITELANG (186. The lightest language) 144. Problem FLBRKLIN (187. Flat broken lines) 145. Problem RECTNG1 (188. Rectangles) 146. Problem MUSKET (196. Musketeers) 147. Problem EMPTY (199. Empty Cuboids) 148. Problem MONODIG (200. Monodigital Representations) 149. Problem POLYGAME (201. The Game of Polygons) 150. Problem ROCKETS (202. Rockets) 151. Problem POTHOLE (203. Potholers) 152. Problem SLEEP (204. Sleepwalker) 153. Problem ICERINK (205. Icerink) 154. Problem BITMAP (206. Bitmap) 155. Problem THREECOL (207. Three-coloring of binary trees) 156. Problem STORE (208. Store-keeper) 157. Problem MAP (209. The Map) 158. Problem ALTARS (210. The Altars) 159. Problem PRIMIT (211. Primitivus recurencis) 160. Problem WATER (212. Water among Cubes) 161. Problem PANIC (215. Panic in the Plazas) 162. Problem SOPARADE (217. Soldiers on Parade) 163. Problem PHRASES (220. Relevant Phrases of Annihilation) 164. Problem VONNY (224. Vonny and her dominos) 165. Problem JEWELS (226. Jewelry and Fashion) 166. Problem ORDERS (227. Ordering the Soldiers) 167. Problem SHAMAN (228. Shamans) 168. Problem SORTING (229. Sorting is easy) 169. Problem ZEBRA (231. The Zebra Crossing) 170. Problem HOLIDAY1 (234. Getting Rid of the Holidays (Act I)) 171. Problem VFMUL (235. Very Fast Multiplication) 172. Problem ROMAN (236. Converting number formats) 173. Problem SUMITR (237. Sums in a Triangle) 174. Problem HOLIDAY2 (238. Getting Rid of the Holidays (Act II)) 175. Problem BTOUR (239. Tour de Byteland) 176. Problem BLOCKS (241. Arranging the Blocks) 177. Problem STABLEMP (243. Stable Marriage Problem) 178. Problem SQRROOT (245. Square Root) 179. Problem CHOCOLA (247. Chocolate) 180. Problem CTAIN (260. Containers) 181. Problem TRIPART (261. Triangle Partitioning) 182. Problem CONNECT (262. Connections) 183. Problem PERIOD (263. Period) 184. Problem CORNET (264. Corporative Network) 185. Problem CAVE (272. Cave Exploration) 186. Problem WMELON (274. Johnny and the Watermelon Plantation)

8

187. Problem WATERWAY (275. The Water Ringroad) 188. Problem CTGAME (277. City Game) 189. Problem BICYCLE (278. Bicycle) 190. Problem INUMBER (279. Interesting number) 191. Problem LIFTS (280. Lifts) 192. Problem MUDDY (282. Muddy Fields) 193. Problem NAPTIME (283. Naptime) 194. Problem SCITIES (286. Selfish Cities) 195. Problem NETADMIN (287. Smart Network Administrator) 196. Problem PON (288. Prime or Not) 197. Problem POLYEQ (290. Polynomial Equations) 198. Problem CUBERT (291. Cube Root) 199. Problem ALIBB (292. Alibaba) 200. Problem OFBEAT (293. Officers on the Beat) 201. Problem TWORK (296. Teamwork is Crucial) 202. Problem AGGRCOW (297. Aggressive cows) 203. Problem CABLETV (300. Cable TV Network) 204. Problem BOOK (301. Booklets) 205. Problem CANTON (302. Count on Cantor) 206. Problem UCUBE (303. The Unstable Cube) 207. Problem RATTERN (309. The Room Pattern) 208. Problem PITPAIR (318. Pythagorean Legacy) 209. Problem WINDMILL (325. The Tall Windmills) 210. Problem PLATON (327. Platon and Socrates) 211. Problem BISHOPS (328. Bishops) 212. Problem CALLS (329. Calls) 213. Problem HARDQ (332. Hard Question) 214. Problem PHDISP (334. The Philosophical Dispute) 215. Problem EOPERA (336. Exchange Operations) 216. Problem SEQ (339. Recursive Sequence) 217. Problem POKER (344. Poker) 218. Problem MIXTURES (345. Mixtures) 219. Problem COINS (346. Bytelandian gold coins) 220. Problem EXPEDI (348. Expedition) 221. Problem AROUND (349. Around the world) 222. Problem LANDSCAP (350. Landscaping) 223. Problem HAN01 (351. Ha-noi!) 224. Problem ACT (359. Alpha Centauri Tennis) 225. Problem IGARB (362. Ignore the Garbage) 226. Problem LISA (364. Pocket Money) 227. Problem PHIDIAS (365. Phidias) 228. Problem FARMER (366. Farmer) 229. Problem EMPODIA (367. Empodia) 230. Problem CSTREET (368. Cobbled streets) 231. Problem MATH1 (369. Math I) 232. Problem ONEZERO (370. Ones and zeros) 233. Problem BENEFACT (372. The Benefactor)

9

234. Problem GREED (373. Greedy island) 235. Problem MATRIX (374. Count maximum matrices) 236. Problem QTREE (375. Query on a tree) 237. Problem ACS (376. A concrete simulation) 238. Problem TAXI (377. Taxi) 239. Problem PERMUT2 (379. Ambiguous Permutations) 240. Problem BINGO (380. Bullshit Bingo) 241. Problem CHICAGO (381. 106 miles to Chicago) 242. Problem DECORATE (382. Decorate the wall) 243. Problem EUROPEAN (383. European railroad tracks) 244. Problem FOOL (384. Any fool can do it) 245. Problem GAME (385. Game schedule required) 246. Problem HELP (386. Help the problem setter) 247. Problem TOURS (387. Travelling tours) 248. Problem MENU (388. Menu) 249. Problem HOSPITAL (389. Use of Hospital Facilities) 250. Problem BILLIARD (390. Billiard) 251. Problem RAILROAD (391. Railroads) 252. Problem SPIN (392. Spin) 253. Problem HEXAGON (393. Hexagon) 254. Problem ACODE (394. Alphacode) 255. Problem APRIME (395. Anti-prime Sequences) 256. Problem HITOMISS (396. Hit or Miss) 257. Problem CONDUIT (397. I Conduit) 258. Problem RPGAMES (398. Roll Playing Games) 259. Problem TRANK (399. Team Rankings) 260. Problem TOANDFRO (400. To and Fro) 261. Problem TRANSL (401. Translations) 262. Problem HIKE (402. Hike on a Graph) 263. Problem FRACTION (403. Sort fractions) 264. Problem SCANNER (404. Scanner) 265. Problem TCUTTER (405. Tin Cutter) 266. Problem LOGIC (406. Logic) 267. Problem RNUMBER (407. Random Number) 268. Problem JRIDE (408. Jill Rides Again) 269. Problem DELCOMM (409. DEL Command) 270. Problem VHUFFM (410. Variable Radix Huffman Encoding) 271. Problem NUMQDW (411. Number of quite different words) 272. Problem COVER (412. K-path cover) 273. Problem WPUZZLES (413. Word Puzzles) 274. Problem BONFIRE (414. Equatorial Bonfire) 275. Problem DIV15 (416. Divisibility by 15) 276. Problem LAZYPROG (417. The lazy programmer) 277. Problem NECKLACE (418. Necklace) 278. Problem TRANSP (419. Transposing is Fun) 279. Problem AROAD (421. Another Road Problem) 280. Problem TRANSP2 (422. Transposing is Even More Fun)

10

281. Problem ASSIGN (423. Assignments) 282. Problem HAJIME (425. Kill evil instantly) 283. Problem PARTPALI (428. Particular Palindromes) 284. Problem TCNUMFL (449. Simple Numbers with Fractions Conversion) 285. Problem CLTZ (515. Collatz) 286. Problem ZZPERM (518. Zig-Zag Permutation) 287. Problem DIV (526. Divisors) 288. Problem DIV2 (530. Divisors 2) 289. Problem INCR (598. Increasing Subsequences) 290. Problem QUEST4 (660. Dungeon of Death) 291. Problem QUEST5 (661. Nail Them) 292. Problem SUBS (665. String it out) 293. Problem VOCV (666. Con-Junctions) 294. Problem LSORT (676. Sorting is not easy) 295. Problem BROW (677. A place for the brewery) 296. Problem HANOI07 (681. Building the Tower) 297. Problem PAIRINT (682. Pairs of Integers) 298. Problem ASSIGN4 (684. Another Assignment Problem) 299. Problem SEQPAR (685. Partition the sequence) 300. Problem REPEATS (687. Repeats) 301. Problem SAM (688. Toy Cars) 302. Problem LWAR (693. Lethal Warfare) 303. Problem DISUBSTR (694. Distinct Substrings) 304. Problem UFAST (695. Unite Fast) 305. Problem LIAR (696. Liar Liar) 306. Problem MWORDS (697. Matrix Words) 307. Problem PLHOP (698. Plane Hopping) 308. Problem HKNAP (699. Huge Knap Sack) 309. Problem BPRED (700. Branch Prediction) 310. Problem EXPAND (702. Barn Expansion) 311. Problem SERVICE (703. Mobile Service) 312. Problem PSTRING (704. Remove The String) 313. Problem SUBST1 (705. New Distinct Substrings) 314. Problem TFSETS (707. Triple-Free Sets) 315. Problem NICEDAY (709. The day of the competitors) 316. Problem PRO (726. Promotion) 317. Problem MAXIMUS (729. Move your armies) 318. Problem IVAN (734. Ivan and his interesting game) 319. Problem MDST (735. Minimum Diameter Spanning Tree) 320. Problem TREE (738. Another Counting Problem) 321. Problem NEG2 (739. The Moronic Cowmpouter) 322. Problem TRT (740. Treats for the Cows) 323. Problem STEAD (741. Steady Cow Assignment) 324. Problem LPERMUT (744. Longest Permutation) 325. Problem TEM (757. Thermal Luminescence) 326. Problem CH3D (760. Convex Hull 3D) 327. Problem MIS (764. Delay-noise Analysis)

11

328. Problem ARCHPLG (780. The Archipelago) 329. Problem TRIOPT (827. Trigonometric optimization) 330. Problem OPTM (839. Optimal Marks) 331. Problem WM06 (850. Soccer Choreography) 332. Problem SWAPS (861. Counting inversions) 333. Problem DNA (866. DNA Translation) 334. Problem CUBES (867. Perfect Cubes) 335. Problem IMPORT (869. Galactic Import) 336. Problem BASE (870. Basically Speaking) 337. Problem SEQUENCE (871. Letter Sequence Analysis) 338. Problem MARKUP (872. Mark-up) 339. Problem TRANSMIT (898. Transmitters) 340. Problem WSCIPHER (899. Ws Cipher) 341. Problem SPLIT (900. Split Windows) 342. Problem INDEXGEN (901. Index Generation) 343. Problem HANGOVER (902. Hangover) 344. Problem DOUBLEVI (903. Double Vision) 345. Problem IMAGE (904. Image Perimeters) 346. Problem MATRIX2 (912. Submatrix of submatrix) 347. Problem QTREE2 (913. Query on a tree II) 348. Problem FTOUR (944. Free Tour) 349. Problem IM (962. Intergalactic Map) 350. Problem EN (964. Entrapment) 351. Problem PB (967. Parking Bay) 352. Problem BIRTHDAY (972. Birthday) 353. Problem MOBILE (987. Mobile) 354. Problem MATRIOSH (999. Generalized Matrioshkas) 355. Problem EQDIV (1000. Equidivisions) 356. Problem BROUL (1001. Babylonian Roulette) 357. Problem UJ (1002. Uncle Jack) 358. Problem QUILT (1003. Little Quilt) 359. Problem POLYCODE (1004. Polygon Encoder) 360. Problem AIBOHP (1021. Aibohphobia) 361. Problem ANGELS (1022. Angels and Devils) 362. Problem COMCB (1024. Complete Chess Boards) 363. Problem FASHION (1025. Fashion Shows) 364. Problem FAVDICE (1026. Favorite Dice) 365. Problem FPOLICE (1027. Fool the Police) 366. Problem HUBULLU (1028. Hubulullu) 367. Problem MATSUM (1029. Matrix Summation) 368. Problem EIGHTS (1030. Triple Fat Ladies) 369. Problem UPSUB (1031. Up Subsequence) 370. Problem GSS1 (1043. Can you answer these queries I) 371. Problem CTRICK (1108. Card Trick) 372. Problem SUDOKU (1110. Sudoku) 373. Problem NSTEPS (1112. Number Steps) 374. Problem TOE1 (1161. Tic-Tac-Toe ( I ))

Recommended publications
  • Prolog W Formie Dialogu Pomiędzy Studentem I (Cokolwiek) Sokratycznym Profesorem

    Prolog W Formie Dialogu Pomiędzy Studentem I (Cokolwiek) Sokratycznym Profesorem

    Teksty Drugie 2007, 1-2, s.127-143 Prolog w formie dialogu pomiędzy studentem i (cokolwiek) sokratycznym Profesorem. Bruno Latour Tłumaczenie zbiorowe pod kierunkiem Krzysztofa Abriszewskiego http://rcin.org.pl Bruno UTOUR Prolog w formie dialogu pomiędzy studentem i (cokolwiek) sokratycznym Profesorem^ {Gabinet w London School of Economics, późne wtorkowe popołudnie w lutym, przed pójściem do Beaver na kwartę piwa. Słychać ciche, ale natarc^we pukanie. Student za­ gląda do gabinetu.) Student: - Czy nie przeszkadzam? Profesor: - Nie, to i tak są moje godziny pracy. Proszę wejść i usiąść. S: - Dziękuję. P: - Mniemam, że... czuje się Pan trochę zagubiony? S: - Właściwie tak. Muszę przyznać, iż trudno mi zastosować Teorię Aktora-Sieci w moich badaniach nad organizacjami. P: - Nic dziwnego - nie można zastosować jej do niczego! S: - Ale uczono nas... mam na myśli... wydawało mi się, że to tutaj całkiem gorący towar. Czy mówi Pan, że jest zupełnie bezużyteczna? P: - Mogłaby być użyteczna, ale tylko jeśli nie „stosuje” się do niczego. S: - Przepraszam, ale czy to ma być jakaś sztuczka Zen? Muszę Pana ostrzec, że jestem jedynie doktorantem w badaniach nad organizacjami, więc proszę nie ocze­ kiwać... Nie jestem w temacie, jeśli chodzi o francuską myśl, przeczytałem trochę Mille Plateaux, ale nie bardzo zrozumiałem, o co tam chodzi... 1 Tłumaczenia zbiorowego pod kierunkiem Krzysztofa Abriszewskiego dokonali: Adrian Gahbler, Andrzej Kilanowski, Paweł Mil, Radosław Naworski, Natalia Organista, Dawid Piekło, Robert Szatkowski, Wojciech Wańczyk, Jakub Wolski. ^ http://rcin.org.pl Prezentacje P: - Przepraszam. Nie chciałem się wymądrzać. Chodzi o to, że ANT (skrót od ang. Actor-Network Theory - przyp. tłum.) przede wszystlsim jest negatywnym ro­ zumowaniem.
  • World Record Lunch

    World Record Lunch

    World Record Lunch A group of people is trying to beat the world record for the largest number of people having lunch at the same time. In order achieve this goal, they are using the country's largest bridge and they have decided to arrange the tables following the shape of the letter 'S'. The table layout can be described by 4 integers: NH, NV, H and V. The two first integers, NH and NV, represent respectively the number or rows and number of columns in the layout. The last two integers represent respectively the number of tables in each row and column. For a given layout, the tables are numbered consecutively, starting with table #1 in the top-right corner. The following figure illustrates several possible layouts: Thousands of groups of people are expected to come, and the organizers have to define where to seat everyone. Each group needs a certain number of tables and they do not share tables with other groups. Furthermore, a group wants their tables to be together and not split among rows and columns, that is, they want a set of consecutive tables either on the same row or on the same column. If this condition cannot be met, the group prefers to go away and have lunch at another place. The groups also enjoy having some privacy and prefer unoccupied adjacent tables, that is, no one at the table exactly before the first table of the group, and no one at the table exactly after the last table of the group. If this happens, we say that the group found a private place.
  • Theoretical and Practical Aspects of Programming Contest Ratings

    Theoretical and Practical Aspects of Programming Contest Ratings

    Department of Informatics Faculty of Mathematics, Physics and Informatics Comenius University, Bratislava, Slovakia Theoretical and Practical Aspects of Programming Contest Ratings Dizertaèná práca v odbore doktorandského ¹túdia: 11-80-9 teoretická informatika RNDr. Michal Fori¹ek ©koliteľ: prof. RNDr. Branislav Rovan, Ph.D. Bratislava, 2009 iii Acknowledgements First and foremost, I would like to thank my advisor prof. Branislav Rovan for being an exceptional and inspirational teacher and advisor. I'm also grateful to other faculty members { and students { at our university. Thanks to many of them, both studying and teaching here has been a pleasure, and that is one of the factors that significantly influenced my career choices so far. But without any doubt my biggest thanks must go to my fiancée Jana. Without her constant love, support and understanding I would not be able to finish this Thesis. iv Contents Abstract (English) 1 Abstrakt (Slovensky) 3 1 Introduction 5 1.1 Goals of the Thesis . .5 1.2 Outline of this Thesis . .6 1.3 Motivation . .7 2 Background 11 2.1 Programming contests landscape . 11 2.1.1 Important programming contests . 11 2.1.2 Programming contests terminology . 14 2.1.3 Overview of the existing research on competitions . 16 2.2 Rating Systems and Rating Algorithms . 20 2.2.1 Introduction . 21 2.2.2 Overview of the Elo rating system . 22 2.2.3 TopCoder's event format . 23 2.2.4 TrueSkill(TM) rating algorithm . 25 2.2.5 eGenesis rating algorithm . 25 2.3 Item Response Theory . 26 2.3.1 Introduction and motivation .
  • PROGRAMMING EXERCISES EVALUATION SYSTEMS an Interoperability Survey

    PROGRAMMING EXERCISES EVALUATION SYSTEMS an Interoperability Survey

    PROGRAMMING EXERCISES EVALUATION SYSTEMS An Interoperability Survey Ricardo Queirós1 and José Paulo Leal2 1CRACS & INESC-Porto LA & DI-ESEIG/IPP, Porto, Portugal 2CRACS & INESC-Porto LA, Faculty of Sciences, University of Porto, Porto, Portugal Keywords: Learning Objects, Standards, Interoperability, Programming Exercises Evaluation. Abstract: Learning computer programming requires solving programming exercises. In computer programming courses teachers need to assess and give feedback to a large number of exercises. These tasks are time consuming and error-prone since there are many aspects relating to good programming that should be considered. In this context automatic assessment tools can play an important role helping teachers in grading tasks as well to assist students with automatic feedback. In spite of its usefulness, these tools lack integration mechanisms with other eLearning systems such as Learning Management Systems, Learning Objects Repositories or Integrated Development Environments. In this paper we provide a survey on programming evaluation systems. The survey gathers information on interoperability features of these systems, categorizing and comparing them regarding content and communication standardization. This work may prove useful to instructors and computer science educators when they have to choose an assessment system to be integrated in their e-Learning environment. 1 INTRODUCTION These surveys seldom address the PES interoperability features, although they generally One of the main goals in computer programming agree on the importance of the subject, due to the courses is to develop students’ understanding of the comparatively small number of systems that programming principles. The understanding of implement them. This lack of interoperability is felt programming concepts is closely related with the at content and communication levels.
  • Spoj, Topcoder, Github Í Experience May 2014 – Software Engineering Intern, Google, New York

    Spoj, Topcoder, Github Í Experience May 2014 – Software Engineering Intern, Google, New York

    2609 Orchard Ave Los Angeles, CA-90007 Krishna Bharadwaj H +1 310-691-4078 B [email protected] Spoj, TopCoder, Github Í www.krishnabharadwaj.info Experience May 2014 – Software Engineering Intern, Google, New York. Present Worked on the inline browse data computation for git repositories Sep 2012 – Co-founder & Technology Lead, SMERGERS, Bangalore. Jul 2013 SMERGERS is a SME focused Mergers & Acquisitions Platform. Aug 2011 – Full stack Web Developer, BlockBeacon, PricePoint, Bangalore. Aug 2012 Worked remotely with startups in Santa Monica and San Francisco as an independent consultant. Aug 2011 – Founder & Developer, Refer a Geek, Bangalore. Sep 2012 Refer a Geek aimed at bringing the Referral model of recruting beyond any one company. Jul 2009 – Software Engineer, National Instruments India R&D, Bangalore. Jun 2011 Designed and developed physical layer algorithms for WCDMA/HSPA+ in LabVIEW. Education Fall 2013 – Masters in Computer Science, University of Southern California, Los Angeles. Present Student Programmer, Information Sciences Institute(USC) - Working with Dr. Mehdi Yahyanejad June 2009 BE, Information Science, B. M. S. College of Engineering, Bangalore. Microsoft Student Partner, Placement Coordinator & BMS Linux Users Group. Technical Skills & Interests Programming C/C++, Python, LabVIEW, PHP, Javascript Expertise Data Structures & Algorithms – Spoj, TopCoder, Github Databases MySQL, Oracle, MongoDB Web Dev HTML, CSS, jQuery, Django, CodeIgniter OS Windows & Linux system administraton A Others Qt, NumPy, Matplotlib, LTEX
  • INTRODUCTION to PROGRAMMING Dr

    INTRODUCTION to PROGRAMMING Dr

    INTRODUCTION TO PROGRAMMING Dr. Dipanjan Roy IIIT, Lucknow 2 Dr. Dipanjan Roy, IIIT, Lucknow A warm welcome to all of you! 3 Dr. Dipanjan Roy, IIIT, Lucknow Why are you here? 4 Dr. Dipanjan Roy, IIIT, Lucknow What is your expectation from this class? 5 Dr. Dipanjan Roy, IIIT, Lucknow Is programming important for your career? Why? 6 Dr. Dipanjan Roy, IIIT, Lucknow What is Programming? . It is the process of creating a set of instructions that tell a computer how to perform a task. It is sequence of instruction along with data for a computer. Programming can be done using a variety of programming "languages," such as SQL, Java, Python, C++, etc. 7 Dr. Dipanjan Roy, IIIT, Lucknow Hierarchy of Computer Languages High Assembly Machine Computer Level Language Language Hardware Language 8 Dr. Dipanjan Roy, IIIT, Lucknow Programming Languages . C . C++ . Java . Python . JavaScript . R . Ruby . SCALA . C# 9 Dr. Dipanjan Roy, IIIT, Lucknow Types of Programming 1. Web Development Programming 2. Desktop Application Programming 3. Distributed Application Programming 4. Core Programming 5. System Programming 6. Programming Scientist https://www.wikihow.com/Become-a-Programmer 10 Dr. Dipanjan Roy, IIIT, Lucknow How to become a programmer? WRITE CODE OPTIMIZE/ COMPILE IMPROVE DEBUG EXECUTE 11 Dr. Dipanjan Roy, IIIT, Lucknow Important Tips and Links . Resources: . https://www.geeksforgeeks.org . https://www.tutorialspoint.com/index.htm . https://stackoverflow.com/ 12 Dr. Dipanjan Roy, IIIT, Lucknow Important Tips and Links . Online Coding Platform: . https://www.topcoder.com . https://www.coderbyte.com/ . https://www.hackerrank.com/dashboard . https://www.codechef.com/ . https://www.spoj.com/ .
  • If I Am Not Good at Solving the Problems on the Competitive Programming Sites Like Codechef Or Hackerrank, Where Am I Lagging? - Quora

    If I Am Not Good at Solving the Problems on the Competitive Programming Sites Like Codechef Or Hackerrank, Where Am I Lagging? - Quora

    9/28/2014 If I am not good at solving the problems on the competitive programming sites like CodeChef or Hackerrank, where am I lagging? - Quora QUESTION TOPICS If I am not good at solving the problems on the RELATED QUESTIONS competitive programming sites like CodeChef or HackerRank CodeChef: I am in my third year of Hackerrank, where am I lagging? university now. What should be my Codeforces strategy so that I am comfortable with I am a second year undergrad at one of the IITs and very decent with my CPI Sphere Online Judge solving problems of gene... (continue) (SPOJ) as of now. I have tried quite a few times to start with the likes of above mentioned sites but even the basic level questions take a long time for me to Computer Programming: Why am I CodeChef unable to concentrate in problem solving, get completed? If I know the programming language, if I understand the coding, reading, poor at math? TopCoder questions, where is the fallacy on my part that is preventing me from getting Competitive over them(solving questions) quickly and efficiently? I am quite motivated towards Programming programming, but there is a phase when I am unable to solve most of the problems. Software Follow Question 190 Comment Share 2 Downvote How do I ge... (continue) Programming Languages I am new to competitive programming, just joined CodeChef 10 days back. I am Indian Institutes of Sumit Saurabh finding the easy level questions very Technology (IITs) Edit Bio • Make Anonymous difficu... (continue) Computer Science Write your answer, or answer later.
  • Competitive Sport Programming and Open Source Technologies

    Competitive Sport Programming and Open Source Technologies

    Competitive Sport Programming and Open Source Technologies - Ravi Kiran S ( Final Year, CSE ) - Sukin Kumar ( Final Year, CSE ) What is competitive sport programming? What are all the various competitions that happen all over the world? Various Global Programming Competitions: ● ACM-ICPC ( International Collegiate Programming Contest ) ● Google Codejam ● Facebook Hackercup ● Codechef Snackdown and many more... ACM-ICPC: Intro: ● The ACM ICPC is considered as the "Olympics of Programming Competitions". It is quite simply, the oldest, largest, and most prestigious programming contest in the world. ● The ACM-ICPC (Association for Computing Machinery - International Collegiate Programming Contest) is a multi-tier, team-based, programming competition. Headquartered at Baylor University, Texas, it operates according to the rules and regulations formulated by the ACM. The contest participants come from over 2,000 universities that are spread across 80 countries and six continents. Contest Structure: ● Online Round ● ICPC Regional Round ( Regional Sites: Amritapuri, Chennai, Kolkata, Kharagpur, Gwalior in India ) ● ICPC World Finals ACM-ICPC: Eligibility: ● Enrolled in a degree program at an institution. Contest Format: ● It is a team contest. ● Each team should have three members and one reserve (3 + 1). ● Each team must be headed by a coach, who must be a university faculty or staff member. ● The contest can have several problems (8 to 10 in general), of varying difficulty levels and mostly being algorithmic in nature. More Information: ● https://www.codechef.com/icpc Google Codejam: Intro: ● Code Jam calls on programmers around the world to put their skills to the test by solving multiple rounds of algorithmic puzzles. The online rounds conclude in the World Finals, which rotates globally.
  • Next-Generation Programming Learning Platform: Architecture and Challenges

    Next-Generation Programming Learning Platform: Architecture and Challenges

    SHS Web of Conferences 77, 01004 (2020) https://doi.org/10.1051/shsconf /20207701004 ETLTC2020 Next-Generation Programming Learning Platform: Architecture and Challenges Yutaka Watanobe1,∗, Chowdhury Intisar1,∗∗, Ruth Cortez1,∗∗∗, and Alexander Vazhenin1,∗∗∗∗ 1Department of Computer Science and Engineering, University of Aizu Abstract. With the rapid development of information technology, programming has become a vital skill. An online judge system can be used as a programming education platform, where the daily activities of users and judges are used to generate useful learning objects (e.g., tasks, solution codes, evaluations). Intelligent software agents can utilize such objects to create an ecosystem. To implement such an ecosystem, a generic architecture that covers the whole lifecycle of data on the platform and the functionalities of an e-learning system should take into account the particularities of the online judge system. In this paper, an architecture that implements such an ecosystem based on an online judge system is proposed. The potential benefits and research challenges are discussed. 1 Introduction of the oldest major OJSs, UVa Online Judge, started pro- viding service in 1995 [1]. A number of OJSs are currently With the growing significance of technology and the ubiq- operated by various organizations and related tools are ac- uitous availability of information, a number of initiatives tively researched [2]. in computer education have been promoted by various or- Although learning materials have been dramatically ganizations. Programming has become a vital skill not improved, most major OJSs have shortcomings regarding only for information technology but also for industry and their educational use. For example, black-box tests are a academia.
  • Topcoder SRM Solution

    Topcoder SRM Solution

    Codeforces #172 Tutorial xiaodao Contents 1 Problem 2A. Word Capitalization2 2 Problem 2B. Nearest Fraction3 3 Problem A. Rectangle Puzzle5 4 Problem B. Maximum Xor Secondary9 5 Problem C. Game on Tree 10 6 Problem D. k-Maximum Subsequence Sum 12 7 Problem E. Sequence Transformation 15 1 1 Problem 2A. Word Capitalization Brief Description Capitalize a given word. Tags implementation, strings Analysis As the first problem in the problemset, it intended to be simple so that any one could solve it. Just implement what the problem said under your favorite language. Negative Example h6363817, A.nahavandi, Sigizmynd, addou: There are always some competitors started write down the code before they got comprehensive understanding on the statement and the restriction. There is more than one single case and I am not going to list all of them here. LordArian, Cyber.1: Another part of our compatriots are still unfamiliar with some basic builtin-function. They are going to reinvent the wheel and it will definitely cost more of their time on implementation. And at the same time this means more possibility of making mistakes. Suggested Code astep, navi, shloub, Hohol: For situation like this, we believe that the shorter the better! There are the shortest codes on Ruby, Perl, Python and Haskell. And I hope there could be at least one of them to your taste. 2 2 Problem 2B. Nearest Fraction Brief Description x Find the nearest fraction to fraction y whose denominator is no more than n. Tags brute-force, greedy, math, number theory Analysis This problem can be solved by a straight forward method since we are at Div II, simply enumerate all possible denominator, and calculate the nearest fraction for each denominator.
  • A Survey on Online Judge Systems and Their Applications

    A Survey on Online Judge Systems and Their Applications

    1 A Survey on Online Judge Systems and Their Applications SZYMON WASIK∗†, Poznan University of Technology and Polish Academy of Sciences MACIEJ ANTCZAK, Poznan University of Technology JAN BADURA, Poznan University of Technology ARTUR LASKOWSKI, Poznan University of Technology TOMASZ STERNAL, Poznan University of Technology Online judges are systems designed for the reliable evaluation of algorithm source code submitted by users, which is next compiled and tested in a homogeneous environment. Online judges are becoming popular in various applications. Thus, we would like to review the state of the art for these systems. We classify them according to their principal objectives into systems supporting organization of competitive programming contests, enhancing education and recruitment processes, facilitating the solving of data mining challenges, online compilers and development platforms integrated as components of other custom systems. Moreover, we introduce a formal definition of an online judge system and summarize the common evaluation methodology supported by such systems. Finally, we briefly discuss an Optil.io platform as an example of an online judge system, which has been proposed for the solving of complex optimization problems. We also analyze the competition results conducted using this platform. The competition proved that online judge systems, strengthened by crowdsourcing concepts, can be successfully applied to accurately and efficiently solve complex industrial- and science-driven challenges. CCS Concepts: •General and reference ! Evaluation; •Mathematics of computing ! Combinatorics; Discrete optimization; •Theory of computation ! Design and analysis of algorithms; •Networks ! Cloud computing; Additional Key Words and Phrases: online judge, crowdsourcing, evaluation as a service, challenge, contest ACM Reference format: Szymon Wasik, Maciej Antczak, Jan Badura, Artur Laskowski, and Tomasz Sternal.
  • Competitive Coding Website

    Competitive Coding Website

    Published by : International Journal of Engineering Research & Technology (IJERT) http://www.ijert.org ISSN: 2278-0181 Vol. 10 Issue 04, April-2021 Competitive Coding Website Parth Dave, Rushikesh Deshmukh, Dipak Kumar Gautam UG Student, Dept. of Information Technology Vidyavardhini’s College of Engineering and Technology, Vasai, India Abstract— Owing to the quick development of the cutting edge data society, it is important to instruct youngsters who are liable for the fate of the Information Technology (IT). Problem solving is a serious discovering that is implemented to improve abilities and upgrade information on the IT. To improve serious programming understanding among students, we have implemented a competitive coding website. Most of the students lack the skills even to analyze a short piece of code. We have also developed a Competitive coding website, the contest management Web server. The server evaluates the submitted software using input and output data in an execution test. We deliver several planning tests for step-by-step sub-goals as partial requirements to adapt a contest for beginners. Which also provides the solution at the end. It also manages the progress of the student and his performance. We're building a Fig 1.Problem Tree teacher support system that includes features including tracking and tutoring. Many competitive coding platforms exist, including CodeChef [2], Spoj [3], CodeForces [4], and HackerEarth [5], which support over 50 programming languages and have a wide I. INTRODUCTION community of programmers who help students and Competitive programming is an analytical sport in which professionals test and develop their coding skills. Its goal is to programmers compete to solve the most algorithmic problems provide a learning, competition, and improvement in the shortest time possible.