yinyanghu

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

const int MAXN = 100;
const int INF = 100000000;

yinyanghu

import heapq

# min-heap
class PriorityQueue:
    def __init__(self):
        self._queue = []
        self._index = 0

    def push(self, item, priority):
        heapq.heappush(self._queue, (priority, self._index, item)) # -priority if max-heap

yinyanghu

#!/bin/bash
while :
do
    bypy -v download todownload .
    sleep 10
done

yinyanghu

#define MAXBIT  1000000
#define lowbit(x)   (x & -x)

struct BIT {
    int bit[MAXBIT];
    int M;

    void clear(int M) {
        memset(bit, 0, sizeof(bit));
        this->M = M;

yinyanghu

#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <stack>
#include <vector>
#include <cmath>
#include <unordered_map>
#include <utility>