belife的专栏

Humble NumbersTime limit: 1 Seconds   Memory limit: 32768K   Total Submit: 4275   Accepted Submit: 1588   A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1,

LottoTime limit: 1 Seconds   Memory limit: 32768K   Total Submit: 4029   Accepted Submit: 1785   In a Lotto I have ever played, one has to select 6 numbers from the set {1,2,...,49}. A popular stra

终于AC了，竟然是因为输出格式不对。刚开始时纯深度优先搜索超时，后来看了网上的解法，勉强不超时了。。。明天看看别人的为什么效率这么高#include using namespace std;int** board = NULL;int** isPlaced = NULL;int cnt = 0;int n = 1;bool isMatched(int x

#include #include #include using namespace std;int CA, CB, N;class Node{public: Node(int ca, int cb) { this->ca = ca; this->cb = cb; } bool isEqual(Node node) {