Good Problems for LGMs to do !!!!!

Revision en8, by killforcode, 2020-03-24 23:05:30
  1. Cut Length Geomtry Problem F
  2. Edge Coloring in Bipartite Graph Problem F
  3. Minimum spanning tree for each edge
  4. Frogs and mosquitoes
  5. Expensive Strings
  6. Sorted and Sorted
  7. Complete Compress
  8. Xor Shift -- (String Algorithm , Check CPC for the other explaination)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en19 English killforcode 2020-04-28 10:20:27 174
en18 English killforcode 2020-04-17 08:55:19 443
en17 English killforcode 2020-04-13 15:13:38 101
en16 English killforcode 2020-04-09 19:55:05 215
en15 English killforcode 2020-04-09 15:10:47 89
en14 English killforcode 2020-04-07 20:39:00 70
en13 English killforcode 2020-04-06 21:20:34 67
en12 English killforcode 2020-04-02 10:45:54 70
en11 English killforcode 2020-03-30 20:44:30 148
en10 English killforcode 2020-03-28 10:43:48 80
en9 English killforcode 2020-03-28 09:08:37 69
en8 English killforcode 2020-03-24 23:05:30 163
en7 English killforcode 2020-03-24 22:58:40 148
en6 English killforcode 2020-03-21 20:44:57 69
en5 English killforcode 2020-03-19 16:30:17 159
en4 English killforcode 2020-03-14 16:02:04 4 Tiny change: 'oblem/F)\n[Edge Co' -> 'oblem/F)\n\n\n[Edge Co'
en3 English killforcode 2020-03-14 16:01:49 92 (published)
en2 English killforcode 2020-03-11 15:56:03 79
en1 English killforcode 2020-03-11 15:54:24 83 Initial revision (published)