TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Visual explanation of the last Google Codejam 2017 question

73 pointsby asrpabout 8 years ago

9 comments

kgwgkabout 8 years ago
Their analysis in terms of chess pieces also helps: <a href="https:&#x2F;&#x2F;code.google.com&#x2F;codejam&#x2F;contest&#x2F;3264486&#x2F;dashboard#s=a&amp;a=3" rel="nofollow">https:&#x2F;&#x2F;code.google.com&#x2F;codejam&#x2F;contest&#x2F;3264486&#x2F;dashboard#s=...</a>
评论 #14074892 未加载
评论 #14073943 未加载
wslhabout 8 years ago
Could this be easily solved with the Z3 theorem prover? Is Z3 an acceptable programming language for this code jam.
评论 #14074637 未加载
master_yoda_1about 8 years ago
I was also confused about algorithmic skill and software engineering skills. But I got clarification after working in industry for a while.<p>1) Most of the software engineering work is product development, just wrapping already existing algorithm and optimized computer program into apis and test and maintain it.<p>2) There are very few software engineering work involving writing algorithm and optimized computer program.<p>One example, everyone here might have just used mysql database. But if you look into the code, you might see there are complex data structure, and algorithm are being used.<p><a href="https:&#x2F;&#x2F;github.com&#x2F;mysql&#x2F;mysql-server" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;mysql&#x2F;mysql-server</a><p>Its a good thing to solve these kind of algorithmic problems.
Achsharabout 8 years ago
The more I scroll, the stupider I feel. Ugh.
评论 #14073976 未加载
hartatorabout 8 years ago
I wonder if there is a real cause and effect relationship between being good at this kind of games and being a good coder. I suspect not.
评论 #14073172 未加载
评论 #14073364 未加载
评论 #14073876 未加载
评论 #14075048 未加载
评论 #14073137 未加载
评论 #14073630 未加载
dorianmabout 8 years ago
Now I just need to understand flow networks: <a href="https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Flow_network" rel="nofollow">https:&#x2F;&#x2F;en.m.wikipedia.org&#x2F;wiki&#x2F;Flow_network</a>
评论 #14074930 未加载
stevebmarkabout 8 years ago
Is this trolling? I don&#x27;t understand most of it and it ends in the middle of the unfollowable explanation.
评论 #14074962 未加载
conistonwaterabout 8 years ago
It&#x27;s not really a maximum matching problem if a greedy algorithm works.
评论 #14073974 未加载
评论 #14073988 未加载
fidzabout 8 years ago
How did you make the animation?
评论 #14076671 未加载