Skip to content

Instantly share code, notes, and snippets.

[color]
ui = auto
[push]
default = simple
[alias]
lg = log --color --graph --all --pretty=format:'%Cred%h%Creset -%C(yellow)%d%Creset %s %Cgreen(%cr) %C(bold blue)<%an>%Creset' --abbrev-commit --
lgf = log --color --graph --all --pretty=format:'%Cred%h%Creset -%C(yellow)%d%Creset %s %Cgreen(%cr) %C(bold blue)<%an>%Creset' --name-status
lgp = log --color --graph --all --pretty=format:'%Cred%h%Creset -%C(yellow)%d%Creset %s %Cgreen(%cr) %C(bold blue)<%an>%Creset' --word-diff -p
st = status
a = add
#include <iostream>
using namespace std;
bool vis[10][10] = {};
char table[20][30];
int n, W;
/*
void test()
{
for(int i = 0; i < 10; ++i)
@brycetsao
brycetsao / a.cpp
Last active December 12, 2015 04:46
CP_mid2
#include <iostream>
#include <algorithm>
using namespace std;
unsigned long long int a[100001] = {}, n, s, t;
unsigned long long int f()
{
sort(a + 1, a + n + 1);
for(int i = 1; i <= n; ++i)
@brycetsao
brycetsao / A.cpp
Created December 9, 2015 13:04
PTC
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int n, L, Wa, Wb;
typedef struct
{
int v, w;