Skip to content

Instantly share code, notes, and snippets.

View cbdavide's full-sized avatar

David Castelblanco cbdavide

29 followers · 61 following
  • Bogotá
View GitHub Profile
@cbdavide
cbdavide / 193.cpp
Last active October 19, 2018 12:46
UVa 193 - Graph Coloring
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define endl '\n'
typedef long long ll;
typedef vector<ll> vll;
@cbdavide
cbdavide / 10491.cpp
Created October 4, 2018 22:52
UVA 10491 - Cows and Cars
#include <bits/stdc++.h>
using namespace std;
int main() {
int v, c, o, n;
while(scanf("%d %d %d\n", &v, &c, &o) == 3) {
n = c + v;
double answ = (c * (c - 1)) / (n * (n - o - 1) * 1.0);
answ += (c * v * 1.0) / (n * (n - o - 1));
@cbdavide
cbdavide / 11053.cpp
Created September 26, 2018 00:39
UVa - 11053 - Flavius Josephus Reloaded
/**
Solution using Floyd's Tortoise and Hare Algorithm
**/
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define endl '\n'
@cbdavide
cbdavide / 13257.cpp
Created September 12, 2018 00:15
UVa - 13257 - License Plates
#include <bits/stdc++.h>
using namespace std;
template <class T> int size(const T &x) {return x.size();}
template <class T> T mod(T a, T b) { return (b + (a % b)) % b;}
#define F first
#define S second
#define PB push_back
#define endl '\n'
@cbdavide
cbdavide / 13249.cpp
Created September 11, 2018 22:01
UVa - 13249 - A Contest to Meet
#include <bits/stdc++.h>
using namespace std;
template <class T> int size(const T &x) {return x.size();}
template <class T> T mod(T a, T b) { return (b + (a % b)) % b;}
#define F first
#define S second
#define PB push_back
#define endl '\n'
@cbdavide
cbdavide / BITMAP.cpp
Created September 10, 2018 23:21
SPOJ - BITMAP
#include <bits/stdc++.h>
using namespace std;
template <class T> int size(const T &x) {return x.size();}
template <class T> T mod(T a, T b) { return (b + (a % b)) % b;}
#define F first
#define S second
#define PB push_back
#define endl '\n'
@cbdavide
cbdavide / 10717.cpp
Created September 6, 2018 00:01
UVa 10717 - Mint
#include <bits/stdc++.h>
using namespace std;
template <class T> int size(const T &x) {return x.size();}
template <class T> T mod(T a, T b) { return (b + (a % b)) % b;}
#define F first
#define S second
#define PB push_back
#define endl '\n'
@cbdavide
cbdavide / 10325.cpp
Created September 5, 2018 00:45
UVA - 10325 The Lottery
#include <bits/stdc++.h>
using namespace std;
template <class T> int size(const T &x) {return x.size();}
template <class T> T mod(T a, T b) { return (b + (a % b)) % b;}
#define F first
#define S second
#define PB push_back
#define endl '\n'
@cbdavide
cbdavide / solution.cpp
Created September 4, 2018 23:20
UVA 10168
#include <bits/stdc++.h>
using namespace std;
template <class T> int size(const T &x) {return x.size();}
template <class T> T mod(T a, T b) { return (b + (a % b)) % b;}
#define F first
#define S second
#define PB push_back
#define endl '\n'
@cbdavide
cbdavide / code.py
Created October 31, 2017 11:52
Maximum subarray product.py
''''Maximum Subarray Problem - Extended Kadane
Source: https://www.quora.com/How-do-I-solve-maximum-product-subarray-problems
'''
def max_product(A):
maxG, maxC, minC = A[0], A[0], A[0]
for num in A:
temp = maxC
maxC = max([num, temp * num, minC * num])