F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
Notice:1:注册本OJ方式请见https://www.lydsy.com/JudgeOnline/wttl/thread.php?tid=5671 2:请不要在讨论区中发空白主题帖。
大视野在线测评-欢迎您
[ New Thread ]
Problem 3284 >> 题解
lavendir @ 2017-04-24 11:56:20
[ Quote ] [ Edit ] [ Delete ] 1#
求PDF版,谢谢。
SW_Wind @ 2017-04-24 15:13:48
[ Quote ] [ Edit ] [ Delete ] 2#
在线markdown预览
https://stackedit.io/editor
jeffswt @ 2017-04-24 15:31:10
[ Quote ] [ Edit ] [ Delete ] 3#
Markdown + LaTeX 大法好

@lavendir 求新 bzoj 兹磁 MathJax
Zcysky @ 2017-04-24 17:03:51
[ Quote ] [ Edit ] [ Delete ] 4#
跪膜dalaoyql
Drench @ 2017-04-24 17:05:04
[ Quote ] [ Edit ] [ Delete ] 5#
跪膜dalaoyql
nzhtl1477 @ 2017-04-24 18:25:04
[ Quote ] [ Edit ] [ Delete ] 6#
这。。。格式挂了?
save_code @ 2018-12-13 09:26:36
[ Quote ] [ Edit ] [ Delete ] 7#
应该有低于O(n^2)做法吧

重点在求 1^i+2^i+...+t^i i==1 to m-n
save_code @ 2018-12-13 09:27:11
[ Quote ] [ Edit ] [ Delete ] 8#
这个 我感觉 肯定有 低于(m-n)^2做法
save_code @ 2018-12-14 00:48:56
[ Quote ] [ Edit ] [ Delete ] 9#
俩 log 180 ms 第一类斯特林数 不会一个 log算法
nzhtl1477 @ 2018-12-14 10:00:24
[ Quote ] [ Edit ] [ Delete ] 10#
orz
poolsoul @ 2018-12-20 10:38:37
[ Quote ] [ Edit ] [ Delete ] 11#
题解在哪啊QAQ
save_code @ 2018-12-20 11:03:10
[ Quote ] [ Edit ] [ Delete ] 12#
http://codeforces.com/blog/entry/63869

我这里写了一个,你将就着看吧
poolsoul @ 2018-12-20 11:10:41
[ Quote ] [ Edit ] [ Delete ] 13#
感谢
[Top] [Previous Page] [Next Page]

HOME Back