Home Explore Help
Sign In
titouan
/
hackerrank
1
0
Fork 0
Code Issues 0 Pull Requests 0 Releases 0 Wiki Activity
Hackerrank solutions.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
40 Commits
1 Branch
56 KiB
C 77.8%
Python 21%
Shell 0.7%
Makefile 0.5%
 
 
 
 
Tree: 70697e7afc
main
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '70697e7afc'
${ noResults }
hackerrank/arithmetic_progressions
History
Titouan Rigoudy 70697e7afc Better makefile, use %.o rule 11 years ago
..
.gitignore Started work on C arithmetic progressions 11 years ago
Makefile Better makefile, use %.o rule 11 years ago
ap.test C program looks like it works 11 years ago
arithmetic_progressions.c Use segment tree and flatten each sqrt(n), still too slow -> have to switch to interval tree 11 years ago
arithmetic_progressions.py Correct but slow solution to arithmetic_progressions 11 years ago
fenwick.c Broke off Fenwick tree code 11 years ago
fenwick.h Broke off Fenwick tree code 11 years ago
segtree.c Changed from fenwick trees to segment trees, still not fast enough 11 years ago
segtree.h Changed from fenwick trees to segment trees, still not fast enough 11 years ago
Powered by Gitea Version: 1.13.1 Page: 28ms Template: 2ms
English
English 简体中文 繁體中文(香港) 繁體中文(台灣) Deutsch français Nederlands latviešu русский Українська 日本語 español português do Brasil Português de Portugal polski български italiano suomi Türkçe čeština српски svenska 한국어
Licenses API Website Go1.15.6