Skip to content

Instantly share code, notes, and snippets.

View msg555's full-sized avatar

Mark Gordon msg555

99 followers · 11 following
  • Los Angeles
View GitHub Profile
@msg555
msg555 / contest3.G.cpp
Created October 21, 2013 20:40
#include <iostream>
#include <vector>
using namespace std;
#define MAXN (1ll << 54)
#define MOD 1000000007
#define INF 0x3FFFFFFFFFFFFFFF
inline long long sum_under(long long X) {
@msg555
msg555 / contest3.F.cpp
Last active December 26, 2015 04:08
#include <iostream>
#include <algorithm>
#include <vector>
#include <complex>
#include <cmath>
using namespace std;
static bool geoerror;
@msg555
msg555 / contest3.D.cpp
Created October 21, 2013 20:34
#include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <set>
#include <map>
using namespace std;
map<string, string> phena, phenb;
@msg555
msg555 / contest3.A.cpp
Created October 21, 2013 20:33
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string S;
for(cin >> S; S != "END"; cin >> S) {
int pos = S.find('+');
@msg555
msg555 / sat.cpp
Created October 18, 2013 15:07
My judge solution to Satisfaction Guaranteed from UChicago's 2013 Invitational Contest.
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef vector<unsigned> bs;
@msg555
msg555 / maps.cpp
Created October 18, 2013 15:05
My judge solution to Overlapping Maps from UChicago's 2013 Invitational Contest.
#include <iostream>
#include <cstdio>
#include <cassert>
#include <cmath>
using namespace std;
/*
X' = ASX + O
(AS-I)X+O = 0
@msg555
msg555 / goat.cpp
Created October 18, 2013 15:00
My judge solution to Goat Ropes from UChicago's 2013 Invitational Contest.
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
#define MAXVAR 50
#define MAXCONSTRAINT 25*49
#define lptype double
@msg555
msg555 / B.contest1.cpp
Created October 6, 2013 01:53
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
#define MAXN (1 << 17)
long long tsum[2 * MAXN];
long long tupdate[2 * MAXN];
@msg555
msg555 / A.contest1.cpp
Created October 6, 2013 01:44
#include <iostream>
#include <vector>
using namespace std;
string S;
int result;
void solve(int x, int L, int N, int ones) {
if (result > 1) return;
@msg555
msg555 / suffix_linear.cpp
Created September 14, 2013 20:58
Linear time DC3 Suffix Array Construction (And driver program to solve http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2507)
#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
#define MAXN 1010
int AN;