|
|
23150 |
spoj#LCPC12E
Johnnys Empire
|
0 / 0 |
(无) |
|
|
23151 |
spoj#LCPC12F
Johnny The Gambler
|
0 / 0 |
(无) |
|
|
23152 |
spoj#LCPC12G
Johnny Studies Genetics
|
0 / 0 |
(无) |
|
|
23153 |
spoj#LCPC12H
Johnny at school
|
0 / 0 |
(无) |
|
|
23154 |
spoj#LCS
Longest Common Substring
|
2 / 7 |
10 |
|
|
23155 |
spoj#LCS0
Longest Common Subsequence
|
0 / 7 |
10 |
|
|
23156 |
spoj#LCS2
Longest Common Substring II
|
0 / 0 |
(无) |
|
|
23157 |
spoj#LCS3
Long Common Subsequence
|
0 / 0 |
(无) |
|
|
23158 |
spoj#LDP
Try to learn properly
|
0 / 0 |
(无) |
|
|
23159 |
spoj#LEAKCONT
Leaky containers
|
0 / 0 |
(无) |
|
|
23160 |
spoj#LEGO
Lego
|
0 / 0 |
(无) |
|
|
23161 |
spoj#LEGRENDS
Legendre symbol
|
0 / 0 |
(无) |
|
|
23162 |
spoj#LEMON
Lemon Tree in the Moonlight
|
0 / 0 |
(无) |
|
|
23163 |
spoj#LENGFACT
Factorial length
|
0 / 0 |
(无) |
|
|
23164 |
spoj#LEONARDO
Leonardo Notebook
|
0 / 1 |
10 |
|
|
23165 |
spoj#LEXBRAC
Bracket Sequence
|
0 / 0 |
(无) |
|
|
23166 |
spoj#LEXIPOS
Lexicographic position
|
0 / 0 |
(无) |
|
|
23167 |
spoj#LEXSTR
Lexicographically Smallest
|
0 / 0 |
(无) |
|
|
23168 |
spoj#LFM
Library for Madrid
|
0 / 0 |
(无) |
|
|
23169 |
spoj#LGLOVE
LCM GCD Love
|
0 / 0 |
(无) |
|
|
23170 |
spoj#LIAR
Truth or not
|
0 / 0 |
(无) |
|
|
23171 |
spoj#LIFEGAME
Life Game
|
0 / 0 |
(无) |
|
|
23172 |
spoj#LIFERACE
LIFE IS A RACE
|
0 / 0 |
(无) |
|
|
23173 |
spoj#LIFTS
Lifts
|
0 / 0 |
(无) |
|
|
23174 |
spoj#LIGHTIN
Lightning Conductor
|
2 / 5 |
10 |
|
|
23175 |
spoj#LIGHTPZ
Lights and Switches
|
0 / 0 |
(无) |
|
|
23176 |
spoj#LIGHTS2
Lights
|
0 / 0 |
(无) |
|
|
23177 |
spoj#LIGHTS3
Lights (Extreme)
|
0 / 0 |
(无) |
|
|
23178 |
spoj#LIM
Lost in Madrid
|
0 / 0 |
(无) |
|
|
23179 |
spoj#LINE
Connect Line Segments
|
0 / 0 |
(无) |
|
|
23180 |
spoj#LINEGAR
Linear Garden
|
0 / 0 |
(无) |
|
|
23181 |
spoj#LINELAND
Lineland Airport
|
0 / 0 |
(无) |
|
|
23182 |
spoj#LINES
Game of Lines
|
0 / 0 |
(无) |
|
|
23183 |
spoj#LINEUP
Lineup
|
0 / 0 |
(无) |
|
|
23184 |
spoj#LINQSOLV
Linear Equation Solver
|
0 / 0 |
(无) |
|
|
23185 |
spoj#LIS2
Another Longest Increasing Subsequence Problem
|
1 / 5 |
10 |
|
|
23186 |
spoj#LIS2VN
Another Longest Increasing Subsequence Problem
|
0 / 0 |
(无) |
|
|
23187 |
spoj#LISA
Pocket Money
|
0 / 0 |
(无) |
|
|
23188 |
spoj#LISTREE
LIS and tree
|
0 / 0 |
(无) |
|
|
23189 |
spoj#LITE
Light Switching
|
1 / 1 |
10 |
|
|
23190 |
spoj#LITELANG
The lightest language
|
1 / 1 |
10 |
|
|
23191 |
spoj#LITEPIPE
GX Light Pipeline Inc
|
0 / 0 |
(无) |
|
|
23192 |
spoj#LKS
Large Knapsack
|
0 / 0 |
(无) |
|
|
23193 |
spoj#LLCA
Largest Labeled Common Ancestor
|
0 / 0 |
(无) |
|
|
23194 |
spoj#LMCONSTR
Last Minute Construction
|
0 / 0 |
(无) |
|
|
23195 |
spoj#LNGPALN
Longest palindrome with no adjacent duplicates
|
0 / 0 |
(无) |
|
|
23196 |
spoj#LNTILING
Long Tiling
|
0 / 0 |
(无) |
|
|
23197 |
spoj#LOCKER
Magic of the locker
|
0 / 0 |
(无) |
|
|
23198 |
spoj#LOCKKEY
Locks and Keys
|
0 / 0 |
(无) |
|
|
23199 |
spoj#LOGIC
Logic
|
0 / 0 |
(无) |
