Skip to content

Instantly share code, notes, and snippets.

@ealmansi
ealmansi / cuenta.py
Last active August 29, 2015 14:05
ejercicio plp
def cuenta(nums):
return reduce(lambda r, x : (x + 4 + r) if (x + 4 > 5) else (r), nums, 0)
if __name__ == '__main__':
print [1,2,3], "->", cuenta([1,2,3])
@ealmansi
ealmansi / gist:e18796c3dfd0481b47a9
Created August 1, 2014 00:54
Codeforces: 45D - Event Dates
/*
7303089 2014-08-01 04:51:42 apaapa 45D - Event Dates GNU C++ Accepted 30 ms 0 KB
*/
#include <iostream>
#include <algorithm>
using namespace std;
#define forr(i,d,h) for (int i = (d); i < (h); ++i)
#define repeat(n) forr(___, 0, n)
@ealmansi
ealmansi / gist:35e3763d9bde2f056baa
Created August 1, 2014 00:24
Problem: Petya and Inequiations
/*
7303013 2014-08-01 04:22:45 apaapa 111A - Petya and Inequiations GNU C++ Accepted 374 ms 0 KB
*/
#include <iostream>
using namespace std;
#define forr(i, d, h) for (int i = (d); i < (h); ++i)
unsigned long long int N, X, Y;
@ealmansi
ealmansi / gist:e9da8a9c4d8018c20920
Created June 26, 2014 03:35
2014 ACM-ICPC World Finals Problem D Game Strategy
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define MAX_N 30
#define MAX_OPTS 1000005
@ealmansi
ealmansi / RRSCHED.cpp
Created June 18, 2014 23:12
SPOJ Problem Set (classical) 2826. Round-Robin Scheduling Problem code: RRSCHED
#include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
#define mp make_pair
typedef long long int lli;
@ealmansi
ealmansi / interval products
Created June 14, 2014 18:33
icpc regional 2012 latin american: interval products
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long int lli;
#define MAXN 100005
lli N, K;
lli x[MAXN + 1];
#define MIN(a,b) (((a) < (b)) ? (a) : (b))
#ifndef SEED
#define SEED 1
#endif
// Compile-time if then else
template<bool B, class T, class F>
struct ifthenelse { typedef T type; };