1. 流程1) Coordinator (协调者) 广播 VOTE-REQ 给所有 Participant (参与者)2) Coordinator 等待 Participant 的结果3) Participant 回复 YES or NO 给 Coordinator4) Coordinator 收集...
分类：
其他好文 时间：
2014-08-26 21:11:06
阅读次数：
270
Sorting It All Out
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 27929
Accepted: 9655
Description
An ascending sorted sequence of distinct values is on...
分类：
其他好文 时间：
2014-08-26 19:40:46
阅读次数：
194
Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the...
分类：
其他好文 时间：
2014-08-26 17:19:16
阅读次数：
191
Problem Description
Dragon is watching competitions on TV. Every competition is held between two competitors, and surely Dragon's favorite. After each competition he will give a score of either 0 o...
分类：
其他好文 时间：
2014-08-26 15:39:06
阅读次数：
181
In a typical assembly line, machines are connected one by one. The first machine's output product will be the second machine's raw material. To simplify the problem, we put all machines
into a two-d...
分类：
其他好文 时间：
2014-08-26 15:37:36
阅读次数：
288
题解：排序取中位数，然后与平均数比较即可。#include #include using namespace std;double a[1005],ave,med,sum; int n;int main(){ while(~scanf("%d",&n)){ sum=0; ...
分类：
其他好文 时间：
2014-08-26 15:14:16
阅读次数：
166
SPF
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 6131
Accepted: 2814
Description
Consider the two networks shown below. Assuming that data moves around ...
分类：
其他好文 时间：
2014-08-26 11:39:25
阅读次数：
256
C - SPF
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Consider the two networks shown below. Assuming that data moves arou...
分类：
其他好文 时间：
2014-08-26 11:37:35
阅读次数：
213
A + B + 1 1 import java.util.Scanner; 2 3 public class P1409 4 { 5 public static void main(String args[]) 6 { 7 try (Scanner cin = ne...
分类：
其他好文 时间：
2014-08-26 09:48:46
阅读次数：
197
