Alok Pepakayala a10k
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <html xml:lang="en" lang="en"> | |
| <meta charset="utf-8"> | |
| <style> | |
| .node { | |
| cursor: pointer; | |
| } | |
| .node circle { | |
| fill: #fff; | |
| stroke: steelblue; | |
| stroke-width: 1.5px; |
a10k
/ closestKey.c
Last active
August 29, 2015 14:02
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Closest 64 bit integers to a given binary 64 bit integer,less than a distance of 4 will be sorted and printed | |
| //input line will have 0,1,2,232983293 .. keys | |
| //input line2 is a 64 char binary 100100111010....11 | |
| //we print all keys that are within a max bit error of 4 | |
| #include<stdio.h> | |
| #define STR_LEN 40000000 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * The first commented line is your dabblet’s title | |
| */ | |
| background: #f06; | |
| background: linear-gradient(45deg, #f06, yellow); | |
| min-height: 100%; |
NewerOlder