About Cacher
Web App
Download
Sign In
Sign Up
menu
Cacher is the code snippet organizer for pro developers
We empower you and your team to get more done, faster
Learn More
Akagi201
10/4/2014 - 11:32 AM
share
Share
add_circle_outline
Save
OJ.md
OJ.md
content_copy
file_download
Rendered
Source
1秒能执行的计算量大致按照3*10^8左右估算, 例如:
若程序算法复杂度为O(n^2), 则1秒内可解决的问题规模大致为n <= 10,000.
若复杂度为O(n^3), 则可解决的问题规模大致为n <= 600.
go
http://gocode.io/
blog
http://www.acmerblog.com/
work
http://codewars.com/
math
https://brilliant.org/
funny
http://www.codewars.com/
google code jam
https://www.go-hero.net/jam/16/
Golang
https://www.codeeval.com/
leetcode
不同的oj
http://www.qlcoder.com/task/751e
https://codefights.com/home
acm blog
http://xuanwo.org/
http://xuanwo.org/2014/06/12/acm-teammates-blog/
acm related
http://acmicpc.info/
http://shaidaima.com/
http://blog.acmicpc.info/
oj
http://www.codechef.com/help
http://codevs.cn/
uva
poj
hdoj
usaco
leetcode
9度
topcoder
codeforces
http://www.lintcode.com/
project eular
http://www.codewars.com/join
VJ:
http://acm.hust.edu.cn/vjudge/toIndex.action
others not oj
http://w-ai.org/
project eular
clear