Skip to content

Instantly share code, notes, and snippets.

View mhmoodlan's full-sized avatar

Mahmoud Aslan mhmoodlan

42 followers · 36 following
View GitHub Profile
@mhmoodlan
mhmoodlan / 151 - Power Crisis.cpp
Created September 28, 2017 06:22
#DP #Adhoc #JousephProblem #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=87
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 10918 - Tri Tiling.cpp
Created September 27, 2017 06:19
#DP #Adhoc #DominoTiling #ClosedFormula #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1859
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 10827 - Maximum sum on a torus.cpp
Created September 26, 2017 19:51
#DP #MIS #MIS2D #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1768
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 10684 - The jackpot.cpp
Created September 26, 2017 18:38
#MIS #MIS1D #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1625
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 10667 - Largest Block.cpp
Created September 26, 2017 11:10
#DP #MIS #MIS2D #SubRectangle #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1608
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 10074 - Take the Land.cpp
Created September 26, 2017 10:44
#DP #MIS #MIS2D #SubRectangle #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1015
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 836 - Largest Submatrix.cpp
Created September 26, 2017 09:55
#DP #MIS #MIS2D #SubRectangle #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=777
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 507 - Jill Rides Again.cpp
Created September 26, 2017 06:40
#DP #MIS #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=448
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / 108 - Maximum Sum.cpp
Last active September 26, 2017 07:19
#DP #TableMethod #SubRectangle #UVa #Solved
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=44
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;
@mhmoodlan
mhmoodlan / COINS - Bytelandian gold coins.cpp
Created September 20, 2017 05:12
#DP #MemorizingInMap #Solved #SPOJ
//http://www.spoj.com/problems/COINS/
#include <bits/stdc++.h>
#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)
using namespace std;