摘要： super它只是一个限定词，当用super引用时，它也是引用当前对象本身，只是super只是限定了访问当前对象从父类那里继承得到成员变量或方法。import java.util.Date;public class Test extends Date{ public static void main(String[] args) { new Test().test(); } public void test(){ System.out.println(super.getClass().getName()); }}输出结果是：Test如果需要访问父类的类名，应该使用如下语法：super.get.. 阅读全文

摘要： 开始研究cocos2dx，mark一下这个的配置步骤 1 下载eclipse 2 下载android sdk，配置sdk路径，添加环境变量 3 安装adt 4 下载android ndk，配置ndk路径 5 下载cocos2dx 开发包 注意 ndk8+ 不需要cygwin，可以省去N多下载的时间 下载cygwin的时候蛋快碎了感觉好慢，不过用过linux的可以试试用cygwin，有些人说用cygwin好点。 这里我下载的是ndk9 并且放在E:\ndkr9下，配置环境变量。这里的cygwin可以不下载不用配置。 前面的安装大哥们自己百度安装下吧~~ 然后我们打开ecl... 阅读全文

摘要： # -*- coding: cp936 -*-import poplibimport randomimport osdef getmail(): # 蒋辉文拥有该程序权利 你可以随意使用 emailServer = poplib.POP3('pop.163.com') emailServer.user('xxxxxxxxxxxxxx') emailServer.pass_('xxxxxxxxxxxxxx') # 设置为1，可查看向pop3服务器提交了什么命令 #emailServer.set_debuglevel(1) ... 阅读全文

摘要： #includeusing namespace std;int n,Max,C[4][4];char board[5][5];bool vis[16];bool isok(int x,int y){ for (int i = x + 1; i = 0 && board[i][y] != 'X'; i--) if(board[i][y] == '0') return false; for (int i = y; i = 0 && board[x][i] != 'X'; i--) if (board[x][i] == 阅读全文

摘要： TOYSTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 9310Accepted: 4436Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rect. 阅读全文

摘要： DescriptionA Strict Weak Ordering is aBinary Predicatethat compares two objects, returningtrueif the first precedes the second. This predicate must satisfy the standard mathematical definition of astrict weak ordering. The precise requirements are stated below, but what they roughly mean is that a S 阅读全文

摘要： TravelTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2621Accepted Submission(s): 720 Problem Description PP loves travel. Her dream is to travel around country A which consists of N cities and M roads connecting them. PP has measured the... 阅读全文

摘要： 树链剖分 点权型可做模板，链路剖分的思想把点hash到线段树的上，然后可通过n*(log(n)*log(n))的复杂度在树上操作，在线段树上能操作的在链路上都能操作。#include#include#include#define M 40000#define lson (rt>1; build(l,mid,lson); build(mid+1,r,rson); push_up(rt); } void update(int ul,int new_flag,int rt){ if(e[rt].l==ul&&e[rt].r==ul)... 阅读全文

摘要： 后缀自动机+dp。 后缀自动机主要是在functioner大牛那里学习的：http://blog.sina.com.cn/s/blog_70811e1a01014dkz.html 这道题是在No_stop大牛那里学习的：http://blog.csdn.net/no__stop/article/details/11784715特别感谢这两位大牛！贴上代码作为以后的模板吧。#include#include#include#include#include#define LL long long#define CLR(a, b) memset(a, b, sizeof(a))us... 阅读全文

摘要： Problem EOptimal Binary Search TreeInput:standard inputOutput:standard outputTime Limit:30 secondsMemory Limit:32 MBGiven a setS = (e1, e2, ..., en)ofndistinct elements such thate1#include #include using namespace std;int n, f[255], dp[255][255], sum[255];int main() { while (~scanf("%d", & 阅读全文