a/usaco-guide
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Update 0_Silver_Complexity.md

Browse source
This commit is contained in:
Darren Yao 2020-06-08 16:39:45 -07:00 committed by GitHub
parent 0cac54ec5c
commit d7026d2d16
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
content/4_Silver/0_Silver_Complexity.md
View file

@ -1,6 +1,8 @@
# Time/Space Complexity and Algorithm Analysis
### Author: Darren Yao
In programming contests, there is a strict limit on program runtime. This means that in order to pass, your program needs to finish running within a certain timeframe. For USACO, this limit is 4 seconds for Java submissions. A conservative estimate for the number of operations the grading server can handle per second is {10}^8 (but is really closer to 5 \cdot 10^8 given good constant factors).