发表于   |   分类于   |  

题目描述：

Grading hundreds of thousands of Graduate Entrance Exams is a hard work. 
It is even harder to design a process to make the results as fair as possible. 
One way is to assign each exam problem to 3 independent experts. If they do not agree to each other, a judge is invited to make the final decision. Now you are asked to write a program to help this process.
For each problem, there is a full-mark P and a tolerance T(<P) given. The grading rules are:
• A problem will first be assigned to 2 experts, to obtain G1 and G2. If the difference is within the tolerance, that is, if |G1 - G2| ≤ T, this problem's grade will be the average of G1 and G2.
• If the difference exceeds T, the 3rd expert will give G3.
• If G3 is within the tolerance with either G1 or G2, but NOT both, then this problem's grade will be the average of G3 and the closest grade.
• If G3 is within the tolerance with both G1 and G2, then this problem's grade will be the maximum of the three grades.
• If G3 is within the tolerance with neither G1 nor G2, a judge will give the final grade GJ.
阅读全文 »

发表于   |   分类于   |  

题目描述：

This time, you are supposed to find A+B where A and B are two matrices, and then count the number of zero rows and columns.
阅读全文 »

发表于   |   分类于   |  

我们对目标网站进行了足够的信息收集之后，我们就要进行主动扫描，从而获得更多信息，而web上的扫描工具一般支持两种模式。

  • 代理截断模式
  • 直接扫描模式
阅读全文 »

发表于   |   分类于   |  

0x00 起因

这两天一直在努力做这个事情，平时的时间并没有因为放假而显得富裕，上午去教书，下午去学车，晚上回来除了自己个人的一些事情，再不算跟朋友聚会，时间所剩无几，庆幸的是自己能一直把这个事情当回事，努力的去做，参考这资料真的完成了自己这个听起来高大上的“调用了BaiDu地图的API，可以定义聚焦的地理位置和坐标尺，显示照片”的撩妹网站，其实从买下这个域名的那时候我就一直想着能为她提供些什么帮助，能让她手头有顺手的工具可用，可以让她开心一点，能让她感觉到养了一只程序猿的有利之处，可是一直没什么作为，一直都只是在记载我们恋爱时间长短，放了假闲暇时候就会自己思考，是不是该做点什么了，正好赶上生日契机，其实这件事情预谋很久了，原本是想用svg来做的，利用HTML5的api让制作蛋糕的过程展示出来，然后自己在加一些互动什么的，比如可以切个蛋糕出个surprise之类的，但是心里总觉得这样不是佷甘心。

阅读全文 »