nocriz的博客

题是我出的，std是我写的。1006是原创套路。1008是原创贪心。1007是从CF上的题加强了一下子出的。

继续阅读“杭电多校第六场1006 1007 1008题解，std”

经常活在对自己的失望之中，或许真正“挑战程序设计竞赛”一回是唯一的解决办法。

短期目标是打打Codeforces，Google Codejam，Topcoder Open，Atcoder等比赛来源的比赛，总的目的是把自己和理想中的自己距离拉近一些，发挥一下“未发挥的潜力”，并让自己不活在对自己的失望之中。

等到不对自己失望的时候，就“差不多得了”，去投入学习TCS了。但现在，只能说我做不到。。

2021/4/5 23:36

失败。

这个网站应当用中文来写，另外建一个英文网站。这样我可以在这里写各种随机的奇怪言论。

需要有计划地高效学习。

The plan:

Finish 15-455 before 2/14[cancelled]

Finish 15-855 before 3/1 3/14

15-855 plan: learn 1 lecture every day till 2/28.

Learn “Computational Discrete Mathematics” parallel to the course

Also, learn “Approximation Algorithms” whenever possible.

Then learn bootcamp, beyond bootcamp and another course.

继续阅读“Learning reports, updated daily”

Today I was able to finish L4,L5,L6 of the 15-455 course. L5 and L6 slides can be understood effortlessly, perhaps the course isn’t that hard after all.

No homework is done today due to participation in algorithmic competition. I will not participate in algorithmic competition seriously anytime soon. Study comes first.

Best case scenario: 15-455 finished before next Wednesday, 15-855 finished before 3/1. Additional material and papers(?) are learned.

Worst case scenario: 15-455 finished before next Sunday, 15-855 finished 80% before 3/1. No additional materials learned.

Self learning reports will be posted every day before 24:00 to keep me on track.

Today I was only able to finish L03 and 2/3 of L04 of 15-455. No homework is done.

This is due to an algorithmic competition which I had to participate. Tomorrow I hope to:

1. Finish L04
2. Finish the homework.
3. Finish L05
4. Finish L06 (Not likely as I have to participate in algorithmic competition tomorrow too.)

“Make 1% progress every day for 100 days.” – Ryan O’Donnell

I decided to learn http://www.cs.cmu.edu/~15455/ first, before progressing to the graduate course by Ryan O’Donnell.

As I have learned most of the material before, I have plenty reason to believe that I will finish with 15455 soon.

Yet today I found the course to be more difficult than I imagined while doing the first assignment. The course by K. Sutner offers more material than the textbook offers and the course can probably provide me a deeper understanding of the material, so I decided to put effort in it to finish it soon.

I promise myself to never see the solution while attempting the homework. Only when I give up will I see the solution.

Today I learned the first two lectures and finished the first Assignment. I expect to learn more efficiently in the following days.

I am a 2nd-year undergraduate student from China who is interested in theoretical computer science, especially in circuit lower bounds and pseudo-randomness.

I am currently self-learning computational complexity and other theoretical computer science topics actively.

I also participate in competitive programming, which is a great fun. I have won the 1st place in ICPC Shanghai 2020 and CCSP 2020.

成就系统里面好像没有更多可以获得的区域赛成就了，还可以获得的其他成就有：上分网站的成就，WorldFinals的成就。。。

难度自适应系统总算工作一回。。。

摘要：在上海区域赛拿到了冠军