## 金子上的友情[XDU1011]

Problem 1011 - 金子上的友情 Time Limit: 1000MS   Memory Limit: 65536KB   Difficulty: Total Submit: 336  Accepted: 124  Special Judge: No Description 　　Wm 和Qi...        (2015-11-13)

## 跳舞毯[XDU1005]

Problem 1005 - 跳舞毯 Time Limit: 2000MS   Memory Limit: 65536KB   Difficulty: Total Submit: 308  Accepted: 108  Special Judge: No Description 　　zyf不小心得了...        (2015-11-13)

## Cat VS Dog

Cat VS Dog Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 2046    Accepted Submission(s): 719          (2015-11-13)

## Girls and Boys

Girls and Boys Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5565    Accepted Submission(s): 2481        (2015-11-13)

## SZU-A22

Problem(A22):Party Judge InfoMemory Limit: 32768KBCase Time Limit: 10000MSTime Limit: 10000MSJudger: Number Only JudgerDescriptionFrog Frank is going to have a party, he needs a large empty rectangul        (2015-11-13)

## Ignatius's puzzle

Ignatius's puzzle Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4935    Accepted Submission(s): 3359        (2015-11-13)

## WIN7下RS2008匿名新方法【非暴力】

之前写过RS2008匿名访问的文章（实现Reporting Service2008 的匿名访问（亲测可行） ），虽然可行，但是不优雅，而且极容易出错，已经付出过多次重装RS的代价了，最近偶然的一次机会，在错乱之中发现一种较为...        (2015-11-13)

## 通过讲课来建立自己的知识系统

by zhengyun_ustc 20060801  泰稳编辑最近写了一篇《建立知识系统与某一时期的专注（“How to Read”上篇）》，讲述如何读书把别人的知识变成自己的。 我的经验只有一条： 如果你不能把你看到、听到的东...        (2015-11-13)