ZOJ 2601 Warehouse KeeperThe company where Jerry works owns a number of warehouses that can be used to store various goods. For each warehouse the types of goods that can be stored in this warehouse ar...
分类：
其他好文 时间：
2015-08-18 11:54:54
阅读次数：
136
求n以内能够被所给的集合中的数整除的数的个数。...
分类：
其他好文 时间：
2015-08-18 01:21:19
阅读次数：
118
今天还是学到了不少东西的，那破问题还没解决，请求一样，为什么会是两种结果。 今天用了下属性反射。 getFields和getDeclaredFields区别是，前者只能获取公共属性，后者会获取各种权限的属性。 还有Filed.set()给私有属性赋值，要设置asscessable为tr...
分类：
其他好文 时间：
2015-08-18 00:57:28
阅读次数：
134
Problem DescriptionTo prove two sets A and B are equivalent, we can first prove A is a subset of B, and then prove B is a subset of A, so finally we g...
分类：
其他好文 时间：
2015-08-17 21:43:43
阅读次数：
156
1086. Tree Traversals Again (25)An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that whe...
分类：
其他好文 时间：
2015-08-17 21:31:19
阅读次数：
97
题目链接：
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3146题意：
给定一堆的操作，问这个数据结构是什么代码：#include
#include
#include
#include...
分类：
其他好文 时间：
2015-08-17 19:36:54
阅读次数：
113
Problem Description
There are n people
and m pairs
of friends. For every pair of friends, they can choose to become online friends (communicating using online applications) or offline friends (...
分类：
其他好文 时间：
2015-08-17 19:34:53
阅读次数：
114
CO-PRIME
时间限制：1000 ms | 内存限制：65535 KB
难度：3
描述
This problem is so easy! Can you solve it?
You are given a sequence which contains n integers a1,a2……an, your task is to find how many pa...
分类：
其他好文 时间：
2015-08-17 17:26:17
阅读次数：
164
/* Number of IO operations per second the server can do */extern ulong srv_io_capacity;/* Returns the number of IO operations that is X percent of ...
分类：
数据库 时间：
2015-08-17 16:52:13
阅读次数：
151
DescriptionImagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move nort...
分类：
其他好文 时间：
2015-08-17 15:18:19
阅读次数：
102
