https://blog.youkuaiyun.com/lhfl911zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lhfl911/article/details/78075339https://blog.youkuaiyun.com/lhfl911/article/details/78075339lhfl911Sun, 24 Sep 2017 10:25:58 +0800 #include #include typedef struct node_ *node; struct node_ { int key; node lc, rc; };int insert(node &t, int fk, int k) { if (t) {]]>https://blog.youkuaiyun.com/lhfl911/article/details/78075180https://blog.youkuaiyun.com/lhfl911/article/details/78075180lhfl911Sun, 24 Sep 2017 09:55:54 +0800 #include void mul(int a[][15], int b[][15], int ans[][15], int n) { int tmp[15][15]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {]]>https://blog.youkuaiyun.com/lhfl911/article/details/78075046https://blog.youkuaiyun.com/lhfl911/article/details/78075046lhfl911Sun, 24 Sep 2017 09:28:31 +0800void print(int n) { if (!n) return; print(n>>1); printf("%d", n&1); }int main() { int t; scanf("%d", &t); int n; while(t--) { sca]]>https://blog.youkuaiyun.com/lhfl911/article/details/78075018https://blog.youkuaiyun.com/lhfl911/article/details/78075018lhfl911Sun, 24 Sep 2017 09:20:18 +0800int main() { printf("%d %d\n", 10*30, (1<<30)-1); return 0; }]]>https://blog.youkuaiyun.com/lhfl911/article/details/61206047https://blog.youkuaiyun.com/lhfl911/article/details/61206047lhfl911Fri, 10 Mar 2017 20:15:33 +0800https://blog.youkuaiyun.com/lhfl911/article/details/59582799https://blog.youkuaiyun.com/lhfl911/article/details/59582799lhfl911Thu, 02 Mar 2017 17:59:32 +0800https://blog.youkuaiyun.com/lhfl911/article/details/58170270https://blog.youkuaiyun.com/lhfl911/article/details/58170270lhfl911Mon, 27 Feb 2017 17:57:50 +0800https://blog.youkuaiyun.com/lhfl911/article/details/58025121https://blog.youkuaiyun.com/lhfl911/article/details/58025121lhfl911Mon, 27 Feb 2017 11:10:45 +0800 #include #include using namespace std;const int MAXN = 1e6 * 2 + 5;long long a[MAXN];int main() { int n, m; scanf("%d", &n); for (int i = 0; i < n]]>https://blog.youkuaiyun.com/lhfl911/article/details/58014136https://blog.youkuaiyun.com/lhfl911/article/details/58014136lhfl911Mon, 27 Feb 2017 10:58:52 +0800 #include #include using namespace std;struct stu { int id; char name[10]; int grade; };const int MAXN = 1e5+5;stu s[MAXN];bool cmp1(stu a, stu b) {]]>https://blog.youkuaiyun.com/lhfl911/article/details/58013156https://blog.youkuaiyun.com/lhfl911/article/details/58013156lhfl911Mon, 27 Feb 2017 10:58:15 +0800char t[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C'};void trans(int x) { printf("%c%c", t[x/13], t[x%13]); }int main() { int x, y, z; scanf("%d%d%d", &x, &y]]>https://blog.youkuaiyun.com/lhfl911/article/details/56011305https://blog.youkuaiyun.com/lhfl911/article/details/56011305lhfl911Mon, 20 Feb 2017 11:50:09 +0800https://blog.youkuaiyun.com/lhfl911/article/details/53581389https://blog.youkuaiyun.com/lhfl911/article/details/53581389lhfl911Mon, 12 Dec 2016 12:39:10 +0800 #include #include #include using namespace std;struct node { int num, h; node *left,]]>https://blog.youkuaiyun.com/lhfl911/article/details/53573037https://blog.youkuaiyun.com/lhfl911/article/details/53573037lhfl911Sun, 11 Dec 2016 14:38:18 +0800 #include #include #include using namespace std;struct node { int x, y, t; node() {} node(int xx, int yy, int tt):x(xx), y(yy), t(tt)]]>https://blog.youkuaiyun.com/lhfl911/article/details/53572221https://blog.youkuaiyun.com/lhfl911/article/details/53572221lhfl911Sun, 11 Dec 2016 11:27:38 +0800 #include #include #include using namespace st]]>https://blog.youkuaiyun.com/lhfl911/article/details/53456148https://blog.youkuaiyun.com/lhfl911/article/details/53456148lhfl911Sun, 04 Dec 2016 20:21:45 +0800 using namespace std;struct node { long long id; int score, loc, locrank, rank; friend bool operator<(const node &a, const node &b) { if (a.score == b.s]]>https://blog.youkuaiyun.com/lhfl911/article/details/53455265https://blog.youkuaiyun.com/lhfl911/article/details/53455265lhfl911Sun, 04 Dec 2016 17:23:21 +0800 #include #include using namespace std;bool pal(char a[]) { int len = strlen(a); for (int i = 0; i < len; i++) if (a[i] != a[len-1-i])]]>https://blog.youkuaiyun.com/lhfl911/article/details/53454917https://blog.youkuaiyun.com/lhfl911/article/details/53454917lhfl911Sun, 04 Dec 2016 16:32:04 +0800 #include bool cmp(char x[], char y[], int len) { int vix[10], viy[10]; memset(vix, 0, sizeof(vix)); for (int i = 0; i < len; i++) vix[x[i]-'0']++; mem]]>https://blog.youkuaiyun.com/lhfl911/article/details/53454644https://blog.youkuaiyun.com/lhfl911/article/details/53454644lhfl911Sun, 04 Dec 2016 15:56:22 +0800 #include #include #include https://blog.youkuaiyun.com/lhfl911/article/details/53454370https://blog.youkuaiyun.com/lhfl911/article/details/53454370lhfl911Sun, 04 Dec 2016 15:09:43 +0800 #include #include #include #include using namespace std;const int MAXN = 10010;vector mp[MAXN]; bool vis]]>https://blog.youkuaiyun.com/lhfl911/article/details/53426892https://blog.youkuaiyun.com/lhfl911/article/details/53426892lhfl911Thu, 01 Dec 2016 21:23:34 +0800 #include #include #include using namespace std;struct node { int l, r, il, ir; node(){} node(int ll, int rr, int ill, int ir]]>