你那么爱笑，家里人知道吗？

K - K.Bro Sorting  HDU - 5122  Matt’s friend K.Bro is an ACMer.  Yesterday, K.Bro learnt an algorithm: Bubble sort. Bubble sort will compare each pair of adjacent items and swap t

题目链接会了组成原理,这就道水题 详见https://wenku.baidu.com/view/6ad6e27f76c66137ee061990.html#include<bits/stdc++.h> using namespace std; typedef long long ll;ll a[(1<<6)+1];char s[100];int main() {// freopen("data

Given a directed graph with nn nodes, labeled 0,1, \cdots, n-10,1,⋯,n−1. For each <i, j>i,j> satisfies 0 \le i 0≤ijn, there exists an edge from the i-th node to the j-th node, the capacity