izanbf1803

// Reference: http://codeforces.com/blog/entry/18051
template <typename T>
struct SegmentTree {
    int n;
    T* t;
    T zero_val;

    inline T operation(T a, T b)
    {
        return max(a, b);

izanbf1803

#include <arduino.h>

class Button
{
public:
	Button(int pin);
	void setup() const;
	inline int clicked() const { return _clicked; };
	void update();
private:

izanbf1803

#include <stdio.h>
#include <string.h>

#define N 1000000000000000000ULL

short is_prime(unsigned long long n)
{
    unsigned long long i;
    if (n < 2) return 0;
    if (n == 2) return 1;

izanbf1803

let get_server_time = () => {
    let req = new XMLHttpRequest();
    req.open("GET", document.location, false);
    req.send(null);
    let date = new Date(req.getResponseHeader("Date"));
    return date.getTime();
}

izanbf1803

# Ignore all but files for competitive programming

*
!.gitignore
!*.cc
!*.txt
!*.cpp
!*/
!Makefile

izanbf1803

\documentclass{article}
\usepackage[spanish]{babel}
\selectlanguage{spanish}
\usepackage[utf8]{inputenc}
\setlength{\parindent}{0pt}
\usepackage{amsfonts}
\usepackage{mathtools}
\usepackage{amsmath}
\usepackage{cancel}
\begin{document}

izanbf1803

#include <iostream>
#include <cmath>
using namespace std;

typedef long long ll;
typedef long double ld;

ld factorial_digit_count(ld n)
{
    // log(ab) = log(a) + log(b)

izanbf1803

import itertools, math

def dist(a, b):
    # 2d distance
    dx = a[0] - b[0]
    dy = a[1] - b[1]
    return math.sqrt(dx*dx + dy*dy)

def valid_triangle(t):
    # Check if triangle is valid (area > 0)

izanbf1803

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct DisjointSet {
    vector<int> parent;
    vector<int> size;
};

izanbf1803

// Use N <= 30 (good luck to calculate that)
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

// bits values for bit arrays: 
//    1 = free
//    0 = used