nhaliday + aggregator   99

Choose the best - Slant
I've noticed I fairly often agree w/ the rankings from this (at least when they show up in my search results). more accurate than I would've expected
organization  community  aggregator  data  database  search  review  software  tools  devtools  app  recommendations  ranking  list  top-n  workflow  track-record  saas  tech-infrastructure  consumerism  hardware  sleuthin  judgement 
5 weeks ago by nhaliday
[Tutorial] A way to Practice Competitive Programming : From Rating 1000 to 2400+ - Codeforces
this guy really didn't take that long to reach red..., as of today he's done 20 contests in 2y to my 44 contests in 7y (w/ a long break)...>_>

tho he has 3 times as many submissions as me. maybe he does a lot of virtual rounds?

some snippets from the PDF guide linked:
To be rating 1900, skills as follows are needed:
- You know and can use major algorithms like these:
Brute force DP DFS BFS Dijkstra
Binary Indexed Tree nCr, nPr Mod inverse Bitmasks Binary Search
- You can code faster (For example, 5 minutes for R1100 problems, 10 minutes for
R1400 problems)

If you are not good at fast-coding and fast-debugging, you should solve AtCoder problems. Actually, and statistically, many Japanese are good at fast-coding relatively while not so good at solving difficult problems. I think that’s because of AtCoder.

I recommend to solve problem C and D in AtCoder Beginner Contest. On average, if you can solve problem C of AtCoder Beginner Contest within 10 minutes and problem D within 20 minutes, you are Div1 in FastCodingForces :)


Interestingly, typical problems are concentrated in Div2-only round problems. If you are not good at Div2-only round, it is likely that you are not good at using typical algorithms, especially 10 algorithms that are written above.

If you can use some typical problem but not good at solving more than R1500 in Codeforces, you should begin TopCoder. This type of practice is effective for people who are good at Div.2 only round but not good at Div.1+Div.2 combined or Div.1+Div.2 separated round.

Sometimes, especially in Div1+Div2 round, some problems need mathematical concepts or thinking. Since there are a lot of problems which uses them (and also light-implementation!) in TopCoder, you should solve TopCoder problems.

I recommend to solve Div1Easy of recent 100 SRMs. But some problems are really difficult, (e.g. even red-ranked coder could not solve) so before you solve, you should check how many percent of people did solve this problem. You can use https://competitiveprogramming.info/ to know some informations.

To be rating 2200, skills as follows are needed:
- You know and can use 10 algorithms which I stated in pp.11 and segment trees
(including lazy propagations)
- You can solve problems very fast: For example, 5 mins for R1100, 10 mins for
R1500, 15 mins for R1800, 40 mins for R2000.
- You have decent skills for mathematical-thinking or considering problems
- Strong mental which can think about the solution more than 1 hours, and don’t give up even if you are below average in Div1 in the middle of the contest

This is only my way to practice, but I did many virtual contests when I was rating 2000. In this page, virtual contest does not mean “Virtual Participation” in Codeforces. It means choosing 4 or 5 problems which the difficulty is near your rating (For example, if you are rating 2000, choose R2000 problems in Codeforces) and solve them within 2 hours. You can use https://vjudge.net/. In this website, you can make virtual contests from problems on many online judges. (e.g. AtCoder, Codeforces, Hackerrank, Codechef, POJ, ...)

If you cannot solve problem within the virtual contests and could not be able to find the solution during the contest, you should read editorial. Google it. (e.g. If you want to know editorial of Codeforces Round #556 (Div. 1), search “Codeforces Round #556 editorial” in google) There is one more important thing to gain rating in Codeforces. To solve problem fast, you should equip some coding library (or template code). For example, I think that equipping segment tree libraries, lazy segment tree libraries, modint library, FFT library, geometry library, etc. is very effective.

2200 to 2400:
Rating 2200 and 2400 is actually very different ...

To be rating 2400, skills as follows are needed:
- You should have skills that stated in previous section (rating 2200)
- You should solve difficult problems which are only solved by less than 100 people in Div1 contests


At first, there are a lot of educational problems in AtCoder. I recommend you should solve problem E and F (especially 700-900 points problem in AtCoder) of AtCoder Regular Contest, especially ARC058-ARC090. Though old AtCoder Regular Contests are balanced for “considering” and “typical”, but sadly, AtCoder Grand Contest and recent AtCoder Regular Contest problems are actually too biased for considering I think, so I don’t recommend if your goal is gain rating in Codeforces. (Though if you want to gain rating more than 2600, you should solve problems from AtCoder Grand Contest)

For me, actually, after solving AtCoder Regular Contests, my average performance in CF virtual contest increased from 2100 to 2300 (I could not reach 2400 because start was early)

If you cannot solve problems, I recommend to give up and read editorial as follows:
Point value 600 700 800 900 1000-
CF rating R2000 R2200 R2400 R2600 R2800
Time to editorial 40 min 50 min 60 min 70 min 80 min

If you solve AtCoder educational problems, your skills of competitive programming will be increased. But there is one more problem. Without practical skills, you rating won’t increase. So, you should do 50+ virtual participations (especially Div.1) in Codeforces. In virtual participation, you can learn how to compete as a purple/orange-ranked coder (e.g. strategy) and how to use skills in Codeforces contests that you learned in AtCoder. I strongly recommend to read editorial of all problems except too difficult one (e.g. Less than 30 people solved in contest) after the virtual contest. I also recommend to write reflections about strategy, learns and improvements after reading editorial on notebooks after the contests/virtual.

In addition, about once a week, I recommend you to make time to think about much difficult problem (e.g. R2800 in Codeforces) for couple of hours. If you could not reach the solution after thinking couple of hours, I recommend you to read editorial because you can learn a lot. Solving high-level problems may give you chance to gain over 100 rating in a single contest, but also can give you chance to solve easier problems faster.
oly  oly-programming  problem-solving  learning  practice  accretion  strategy  hmm  pdf  guide  reflection  advice  wire-guided  marginal  stylized-facts  speed  time  cost-benefit  tools  multi  sleuthin  review  comparison  puzzles  contest  aggregator  recommendations  objektbuch  time-use  growth  studying  🖥  👳  yoga 
august 2019 by nhaliday
Amazon Products Visualization - YASIV
based off a single test run, this works really well, at least for popular books (all I was interested in at the time)
tools  search  recommendations  consumerism  books  aggregator  exploratory  let-me-see  network-structure  amazon  similarity  graphs  visualization 
july 2019 by nhaliday
Perseus Digital Library
This is actually really useful.

- Load English translation side-by-side if available.
- Click on any word and see the best guess for definition+inflection given context.
tools  reference  history  iron-age  mediterranean  the-classics  canon  foreign-lang  linguistics  database  quixotic  stoic  syntax  lexical  exocortex  aggregator  search 
february 2019 by nhaliday
Genome Editing
This collection of articles from the Nature Research journals provides an overview of current progress in developing targeted genome editing technologies. A selection of protocols for using and adapting these tools in your own lab is also included.
news  org:sci  org:nat  list  links  aggregator  chart  info-foraging  frontier  technology  CRISPR  biotech  🌞  survey  state-of-art  article  study  genetics  genomics  speedometer 
october 2017 by nhaliday
- includes physics, cs, etc.
- CS is _a lot_ smaller, or at least has much lower citation counts
- size = number citations, placement = citation network structure
papers  publishing  science  meta:science  data  visualization  network-structure  big-picture  dynamic  exploratory  🎓  physics  cs  math  hi-order-bits  survey  visual-understanding  preprint  aggregator  database  search  maps  zooming  metameta  scholar-pack  🔬  info-dynamics  scale  let-me-see  chart 
february 2017 by nhaliday
ShortScience.org - Making Science Accessible!
crowdsourced liner notes
heavy machine learning bias (altho I don't know if TCS papers warrant liner notes all that frequently)
init  aggregator  papers  research  summary  explanation  machine-learning  thinking  skunkworks  liner-notes  academia  hmm  org:mat  organization 
june 2016 by nhaliday
« earlier      
per page:    204080120160

bundles : meta

related tags

2016-election  academia  accelerationism  accretion  accuracy  acm  additive-combo  advertising  advice  aesthetics  age-of-discovery  aggregator  ai  ai-control  algorithms  alignment  amazon  analysis  anomie  antiquity  aphorism  api  app  applicability-prereqs  applications  aristos  arrows  art  article  asia  audio  backup  barons  bayesian  beauty  benchmarks  best-practices  biases  big-peeps  big-picture  bio  biodet  biotech  blog  books  bots  britain  browser  build-packaging  business  business-models  c(pp)  calculation  calculator  canon  career  censorship  chan  chart  checking  chemistry  china  civic  civil-liberty  civilization  classic  client-server  coalitions  cocktail  code-dive  collaboration  commentary  community  comparison  compensation  competition  compilers  computer-memory  computer-vision  confidence  config  confluence  conquest-empire  consulting-freelance  consumerism  contest  convexity-curvature  cool  core-rats  cost-benefit  cracker-econ  creative  CRISPR  crooked  crosstab  cs  culture  culture-war  current-events  curvature  data  data-science  database  dataset  decentralized  deep-learning  density  design  desktop  devtools  diaspora  dirty-hands  discipline  discovery  discrete  discussion  distribution  documentation  drama  duplication  dynamic  dysgenics  early-modern  economics  econotariat  ecosystem  editors  education  elections  elegance  elite  email  embodied  engineering  enlightenment-renaissance-restoration-reformation  entrepreneurialism  epistemic  ergo  estimate  ethics  europe  examples  exit-voice  exocortex  expansionism  explanation  exploratory  extra-introversion  facebook  faq  fermi  feynman  fiction  finance  fluid  flux-stasis  foreign-lang  foreign-policy  form-design  formal-methods  formal-values  forum  frameworks  free  freelance  frisson  frontend  frontier  functional  futurism  games  GCTA  genetics  genomics  germanic  giants  gig-econ  git  github  gnon  gnu  google  gotchas  government  gowers  grad-school  graphs  growth  guide  gwern  h2o  hardware  haskell  heavyweights  heuristic  hi-order-bits  history  hmm  hn  huge-data-the-biggest  ideas  ideology  impact  india  industrial-org  info-dynamics  info-foraging  infographic  init  innovation  institutions  internet  interview  iq  iron-age  jobs  judgement  keyboard  labor  latex  law  leadership  leaks  learning  left-wing  lesswrong  let-me-see  letters  lexical  libraries  liner-notes  linguistics  links  linux  list  literature  lived-experience  llvm  local-global  long-short-run  long-term  longform  low-hanging  machine-learning  macro  madisonian  magnitude  maps  marginal  market-power  math  math.CO  mathtariat  media  medicine  medieval  mediterranean  meta:prediction  meta:reading  meta:science  metameta  methodology  micro  microbiz  military  mindful  minimalism  minimum-viable  miri-cfar  monetary-fiscal  money  mooc  morality  mostly-modern  move-fast-(and-break-things)  multi  murray  music  mystic  network-structure  neuro  neurons  news  nibble  nitty-gritty  nlp  nostalgia  notation  notetaking  objektbuch  ocaml-sml  occident  oceans  oly  oly-programming  open-closed  open-problems  opsec  optimization  ORFE  org:anglo  org:data  org:davos  org:econlib  org:edu  org:gov  org:junk  org:lite  org:mag  org:mat  org:med  org:nat  org:ngo  org:popup  org:rec  org:sci  organization  orient  oss  overflow  oxbridge  papers  pdf  people  performance  personality  philosophy  physics  pic  pinboard  planning  pls  plt  policy  polisci  politics  poll  practice  prediction  prediction-markets  prepping  preprint  priors-posteriors  privacy  probability  problem-solving  profile  programming  progression  project  propaganda  properties  psych-architecture  psychometrics  publishing  puzzles  python  q-n-a  qra  quantum  quantum-info  questions  quixotic  quiz  quotes  r-lang  ranking  rationality  ratty  reading  realpolitik  recommendations  recruiting  reddit  reference  reflection  reinforcement  religion  repo  research  retention  review  rhetoric  right-wing  risk  s-factor  saas  sanctity-degradation  scala  scale  scaling-tech  scholar  scholar-pack  science  science-anxiety  scifi-fantasy  search  security  sequential  similarity  simulation  sinosphere  skunkworks  sky  sleep  sleuthin  social  social-science  software  spatial  speed  speedometer  spock  sports  spreading  ssc  stackex  stanford  startups  stat-power  state-of-art  static-dynamic  stats  stoic  store  stories  strategy  stream  street-fighting  stress  study  studying  stylized-facts  subculture  success  summary  survey  sv  syntax  tcs  tech  tech-infrastructure  technology  techtariat  terminal  tetlock  the-classics  the-great-west-whale  the-south  theos  things  thinking  time  time-series  time-use  tip-of-tongue  tools  top-n  track-record  tracker  transitions  transportation  travel  trends  trump  truth  tutorial  tv  twitter  ubiquity  ui  unit  usa  usaco-ioi  values  vcs  venture  video  virginia-DC  virtu  visual-understanding  visualization  vitality  vulgar  web  webapp  westminster  wiki  wire-guided  wonkish  workflow  working-stiff  world  worrydream  writing  wtf  yak-shaving  yoga  yvain  zeitgeist  zooming  🌞  🎓  🎩  🐸  👳  🔬  🖥 

Copy this bookmark: