丧心病狂工科女

摘要： http://lx.lanqiao.cn/problem.page?gpid=T6 问题描述 对于长度为5位的一个01串，每一位都可能是0或1，一共有32种可能。它们的前几个是： 00000 00001 00010 00011 00100 请按从小到大的顺序输出这32种01串。 对于长度为5位的一个 阅读全文

摘要： https://vjudge.net/contest/285902#overview A.Marjar Cola #include <bits/stdc++.h> using namespace std; int T; int main() { scanf("%d", &T); while(T -- 阅读全文

该文被密码保护。 阅读全文

摘要： https://ac.nowcoder.com/acm/contest/372#question A.救救猫咪 #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int N; struct Node { 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2087 Problem Description 一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？ Input 输入中含有 阅读全文

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805491530579968 Suppose a bank has K windows open for service. There is a yellow line in 阅读全文

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805439202443264 Shopping in Mars is quite a different experience. The Mars people pay by 阅读全文

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805347921805312 Given a syntax tree (binary), you are supposed to output the correspondi 阅读全文

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805346063728640 There is a kind of balanced binary search tree named red-black tree in t 阅读全文

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805346428633088 A vertex cover of a graph is a set of vertices such that each edge of th 阅读全文