- 博客(9)
- 收藏
- 关注
原创 1117 Eddington Number(25 分)
British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an "Eddington number", E -- that is, the maximum integer E such that it is for E ...
2018-09-06 02:36:03 273
原创 1116 Come on! Let's C(20 分)
"Let's C" is a popular and fun programming contest hosted by the College of Computer Science and Technology, Zhejiang University. Since the idea of the contest is for fun, the award rules are funny as...
2018-09-06 01:52:23 288
原创 1122 Hamiltonian Cycle(25 分)
The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a "Hamiltonian cycle".In this problem, you are supposed to tell if a given cycle ...
2018-09-05 20:52:32 208
原创 1121 Damn Single(25 分)
"Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can be taken care of.Input Specification:Each inpu...
2018-09-05 19:33:40 194
原创 1120 Friend Numbers(20 分)
Two integers are called "friend numbers" if they share the same sum of their digits, and the sum is their "friend ID". For example, 123 and 51 are friend numbers since 1+2+3 = 5+1 = 6, and 6 is their ...
2018-09-05 18:32:02 146
原创 1127 ZigZagging on a Tree(30 分)
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple stand...
2018-09-05 05:16:39 277
原创 1126 Eulerian Path(25 分)
#include<cstdio>#include<fstream>#include<vector>using namespace std;const int maxn=510;vector<int> v[maxn];bool index[maxn]={false};int cnt=0;void dfs(int x){ inde...
2018-09-05 03:12:19 141
原创 1129 Recommendation System(25 分)
Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that rates the user's preference by the number of time...
2018-09-02 00:51:08 417
原创 1128 N Queens Puzzle(20 分)
The "eight queens puzzle" is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, ...
2018-09-01 21:08:08 162
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人