IvanIsCoding

IvanIsCoding

IvanIsCoding

// Ivan Carvalho
// Problem A - Educational Dynamic Programming Contest - AtCoder
// Link : https://atcoder.jp/contests/dp
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 10;
const int INF = 2*1e9;

int dp[MAXN],N,K,h[MAXN];

IvanIsCoding

/*
Tidal Flow Algorithm by M. Fontaine : https://ioinformatics.org/journal/v12_2018_25_41.pdf
Implementation by I. Carvalho
Solution to FASTFLOW : https://www.spoj.com/problems/FASTFLOW/
Note : In this problem, node 1 is the source and node N is the Sink
*/
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

IvanIsCoding

// Ivan Carvalho
// Amusement Park - JOI Open 2017
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 10011;
const int MAXL = 60;
 
static vector<int> grafo[MAXN],tree[MAXN],lista;

IvanIsCoding

// Ivan Carvalho
// City - JOI SC 2017
#include "Device.h"
#include <bits/stdc++.h>
using namespace std;
 
static vector<int> sequencia;
 
static void build_sequence(){
 

IvanIsCoding

// Ivan Carvalho
// Airline Route Map - JOI SC 2018
#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 1020;
 
static vector<int> grafo[MAXN];
 

IvanIsCoding

// Ivan Carvalho
// Broken Device - JOI SC 2017
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 150;
 
static int possivel[MAXN],resposta[MAXN];
 

IvanIsCoding

// Ivan Carvalho
// Navigation - JOI SC 2015
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 10;

static vector<int> grafo[MAXN];
static int cor[MAXN];

IvanIsCoding

// Ivan Carvalho
// Coins - IOI 2017 Practice
// 1 coin flip
#include "coins.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> coin_flips(vector<int> b, int c) {
    int meu_inteiro = 0;
    for(int i = 0;i<64;i++) if(b[i]) meu_inteiro ^= i;