Skip to content

Instantly share code, notes, and snippets.

View APwhitehat's full-sized avatar

Anant Prakash APwhitehat

View GitHub Profile
<!DOCTYPE html>
<html><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<style>
body {
background: repeat url('data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEASABIAAD/7QCIUGhvdG9zaG9wIDMuMAA4QklNBAQAAAAAAGscAVoAAxslRxwCAAACAAAcAnQAV8KpIENoYWV5b3VuZ1dpbGxOZXZlckNoYWVvbGQgLSBodHRwOi8vd3d3LnJlZGJ1YmJsZS5jb20vcGVvcGxlL0NoYWV5b3VuZ1dpbGxOZXZlckNoYWVvbAD/4gxYSUNDX1BST0ZJTEUAAQEAAAxITGlubwIQAABtbnRyUkdCIFhZWiAHzgACAAkABgAxAABhY3NwTVNGVAAAAABJRUMgc1JHQgAAAAAAAAAAAAAAAAAA9tYAAQAAAADTLUhQICAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABFjcHJ0AAABUAAAADNkZXNjAAABhAAAAGx3dHB0AAAB8AAAABRia3B0AAACBAAAABRyWFlaAAACGAAAABRnWFlaAAACLAAAABRiWFlaAAACQAAAABRkbW5kAAACVAAAAHBkbWRkAAACxAAAAIh2dWVkAAADTAAAAIZ2aWV3AAAD1AAAACRsdW1pAAAD+AAAABRtZWFzAAAEDAAAACR0ZWNoAAAEMAAAAAxyVFJDAAAEPAAACAxnVFJDAAAEPAAACAxiVFJDAAAEPAAACAx0ZXh0AAAAAENvcHlyaWdodCAoYykgMTk5OCBIZXdsZXR0LVBhY2thcmQgQ29tcGFueQAAZGVzYwAAAAAAAAASc1JHQiBJRUM2MTk2Ni0yLjEAAAAAAAAAAAAAABJzUkdCIElFQzYxOTY2LTIuMQAAAAAAAA
@APwhitehat
APwhitehat / temp4.cpp
Created February 28, 2018 06:05
dump check
#include <bits/stdc++.h>
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "debug.h"
#else
#define debug(args...)
#define DBG(x...)
#endif
typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> ii;typedef pair<int,ii> iii;typedef vector<ii> vii;typedef vector<vii> vvii;typedef vector< iii > viii;typedef long long ll;typedef vector<ll> vll;typedef vector<vll> vvll;typedef vector<bool> vb;typedef long double ld;typedef map<int,int> mii;typedef map<string,int> msi;
#define pb push_back
@APwhitehat
APwhitehat / tarjan.cpp
Last active August 5, 2023 11:14
C++ implementation of tarjan's algorithm for finding Strongly connected components
typedef vector<int> vi;
typedef vector<vi> vvi;
#define pb push_back
#define MAX 100005
// C++ implementation of tarjan's algorithm for SCC
// foundat: analogous to time at which the vertex was discovered
// disc: will contain the foundat value of ith vertex(as in input graph)
// low: will contain the lowest vertex(foundat value) reachable from ith vertex(as in input graph)
// onstack: whether the vertex is on the stack st or not
// scc: will contain vectors of strongly connected vertices
@APwhitehat
APwhitehat / ANDGCMalt.txt
Created March 19, 2017 01:14 — forked from CHEF-KOCH/ANDGCMalt.txt
Android Google Cloud Messaging (GCM) alternative
Android Cloud to Device Messaging Framework
https://developers.google.com/android/c2dm/?csw=1
MQTT
http://dalelane.co.uk/blog/?p=1599
https://github.com/JesseFarebro/Android-Mqtt
http://stephendnicholas.com/archives/219
http://stephendnicholas.com/archives/1217
http://ollieparsley.com/2013/05/20/using-mqtt-as-a-gcm-replacement-for-android-push-notifications/
http://www.slideshare.net/henriksjostrand/devmobile-2013-low-latencymessagingusingmqtt