随笔分类 - Algorithm
classic algorithm, problem
摘要:我觉得做人最重要的是把事情讲清楚,尤其是规则,如果法律条例不清楚,就可以寻租了#include #include #include #include using namespace std;int ensure(int n) { if (n = b) return true; retu...
阅读全文
摘要:反正知道了就是知道,不知道也想不到,很快#include #include #include using namespace std;inline void print_prime_k(long long p, long long k) { printf("%lld", p); ...
阅读全文
摘要:#include #include #include using namespace std;class Item {public: char uid[12]; char pwd[12];};char tbl[256];void init_tbl() { for (int i=0;...
阅读全文
摘要:题目意思能搞成这样我也是服了这个女人了#include #include #include #include using namespace std;int main() { int N = 0; double D = 0; scanf("%d%lf", &N, &D); v...
阅读全文
摘要:#include #include #include #include const double LO_BOUND = -1.0 + INT_MIN;const double HI_BOUND = +1.0 + INT_MAX;using namespace std;class Node {publ...
阅读全文
摘要:#include #include #include #include #include #include using namespace std;class Man {public: char id[14]; int location; int score; int loc...
阅读全文
摘要:使用DP,递推关系见代码,先使用大空间的dp数组#include #include #include using namespace std;int max(int a, int b) {return a>b?a:b;}int main() { int N, M, L, tmp; sca...
阅读全文
摘要:#include #include #include #include #include using namespace std;class Man {public: char id[10]; int talent; int virtue;};bool mycmp(const Ma...
阅读全文
摘要:#include #include using namespace std;#define COL 10#define ROW 10int tbl[ROW][COL];void print(int* tbl) { for (int i=0; i<ROW; i++) { for (...
阅读全文
摘要:#include #include using namespace std;int str2num(const char* str) { int v = 0; int i = 0; while (str[i] != '\0') { v = v * 10 + str[i...
阅读全文
摘要:#include #include using namespace std;int main() { bool tbl[256] = {0}; char line[10009]; int len = 0; char ch; while (true) { s...
阅读全文
摘要:#include #include #include #include using namespace std;void print(vector &v) { int len = v.size(); for (int i=0; i C(NC); for (int i=0; i P(...
阅读全文
摘要:#include #include class Node {public: Node* L; Node* R; int height; int data; Node(int val, Node* l = NULL, Node* r = NULL, int h = 0):...
阅读全文
摘要:#include #include #include #include using namespace std;vector* > paths;class Node {public: vector child; int weight; Node(int w = 0) : weigh...
阅读全文
摘要:#include #include using namespace std;char line[1001];char line2[2003];int syslen(char str[], int start) { int len = 1; int p = start - 1; in...
阅读全文
摘要:#include #include #include #include #include using namespace std;list::iterator group_pick(list &player, list::iterator &cur, int group_size, vector &...
阅读全文
摘要:#include #include #include using namespace std;char linea[82];char lineb[82];bool tbl[256];char cap(char ch) { if (ch >= 'a' && ch broken; cha...
阅读全文
摘要:#include #include #include #include #include #include #include #define CMB(ID1, ID2) (((ID1) adj; int dist; City(int d = INT_MAX): dist(d){}};ty...
阅读全文
摘要:#include #include using namespace std;class Stu { public: char name[12]; char id[12];};int main() { int N = 0; // because all t...
阅读全文
摘要:#include #include #include using namespace std;bool push_validate(int &pre_push, int max_push, int cur, vector& stack, int mcap) { if (pre_push >= ...
阅读全文

浙公网安备 33010602011771号