The things you own end up owning you. 你占有的东西终将会占有你. When we are longing for something, we would be willing to struggle very hard to get it. Once we attain it, we may fear that it would be gone sometimes, such fear would make us constantly bother abou…

Real love is not just instinct, but intent. 真正的爱不是身体上的一见钟情,而是要用心去经营. What is real love? Honestly, I have no idea, and I think most of the love relationship may be conditional, there is seldom unconditional love or real love. Even the strongest love m…

Losing all hope was freedom. 彻底绝望就是真正的自由. Losing all the hopes, and we are free to challenge everything. It would be better to stop dreaming unrealistic dreams and focus on things we are doing now. Sometimes, we must know some of our dreams or goals…

I wish you all I ever wanted for you, I wish you the best. 我希望你不负我的期望,愿你一切安好. I hope I can live up to all my own expectations about my life. I hope I can deserve all the confidence and expectations from others. I hope I can no longer disappoint those…

Remembrance is a form of meeting, forgetfulness is a form of freedom. 记忆是一种相遇,遗忘是一种自由. Cherish those memory, whether they are sweet or bitter, we always learn something from the past. And sometimes if you don't intend to get lost in the past failures…

Accept who you are, and revel in it. 接受真实的自己并乐在其中. Try to accept youself and try to love yourself more than yesterday. If you are not confident in yourself and love yourself, you may fail to let others trust you and love you. Hope you never grow old.…

Use the smile to change the world. Don't let the world change your smile. 用你的笑容去改变这个世界,别让这个世界改变了你的笑容. Always keep a smiling face toward the world, maybe it can return you a warm smile sometimes, especially in such cold days. But it is really cold the…

I dream my painting, and then I paint my dream. 我梦见我的画,然后我画我的梦. It was a long time after I had a good dream the last time. I dreamed I was the lucky one who won the lottery, a lot of money. I dreamed I was capable of dealing with everything well. Tha…

题意:给你一个大整数X的素因子分解形式,每个因子不超过m.问你能否找到两个数n,k,k<=n<=m,使得C(n,k)=X. 不妨取对数,把乘法转换成加法.枚举n,然后去找最大的k(<=n/2),使得ln(C(n,k))<=ln(X),然后用哈希去验证是否恰好等于ln(X). 由于n和k有单调性,所以枚举其实是O(m). 妈的这个哈希思想贼巧妙啊,因为对数使得精度爆炸,所以不妨同步弄个哈希值,来判相等. opencup的标程: #include <stdio.h> #in…

题意:给你n个点,点带权,任意两点之间的边权是它们的点权的异或值中“1”的个数,问你该图的最小生成树. 看似是个完全图,实际上有很多边是废的.类似……卡诺图的思想?从读入的点出发BFS,每次只到改变它的任意一位所能到达的点(不论是否读入). 记录每个点是从哪个读入点BFS过来的,当第二次访问某个点的时候,就将它的两个源头(一次是第一次的时候标记的,一次是第二次过来的)连一条边. 这样最多连m(位数)*n条边,实际上比这个值更小. 这种做法可以将很多显然不会出现在最小生成树里的边排除掉. open…