Mahmoud Aslan mhmoodlan

Machine & Deep Learning | MSc, Computer Science

mhmoodlan / NewItemShop.cpp

Created September 16, 2017 09:11

#DP #Expectation #MaxMinExpectation #TopCoder #Solved

	//https://arena.topcoder.com/#/u/practiceCode/14606/17786/11508/1/309624
	#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 / BankLottery.cpp

Created September 15, 2017 09:37

#DP #Expectation #RecursiveExpectation #Solved #TopCoder

	//https://arena.topcoder.com/#/u/practiceCode/14353/12782/10988/1/305321
	#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 / TableSeating-NOT-AC.cpp

Created September 15, 2017 07:51

#DP #Expectation #RecursiveExpectation #NotSolved #TopCoder

	//https://arena.topcoder.com/#/u/practiceCode/1518/4270/4616/1/1518
	#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 / C. Bath Queue.cpp

Created September 13, 2017 14:40

#DP #Expectaion #NotSolved #Combination #Codeforces

	//http://codeforces.com/contest/28/problem/C
	#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 / MarblesInABag.cpp

Created September 13, 2017 07:04

#DP #Probability #Solved #TopCoder

	#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 / 542 - France '98.cpp

Created September 12, 2017 09:57

#DP #Probability #UVa #Solved #OutputFormat

	//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=483
	#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 / B. Dima and Sequence.cpp

Created September 11, 2017 10:07

#DP #Solved #Codeforces

	//http://codeforces.com/contest/272/problem/B
	#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 / 3995 - Pebbles.cpp

Created September 11, 2017 06:28

#DP #Masks #SubMask #LiveArchive #Solved

	//https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1996
	#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 / Test.txt

Last active September 10, 2017 06:15

#DP #UnSolved #MLE

This is a test gist

mhmoodlan / 3276 - The Great Wall Game - TLE.cpp

Last active September 10, 2017 06:14

#DP #LiveArchive #Masks #TLE #UnSolved

	#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;