Your Customers Do Not Mean What They SayNate JacksonI’VE NEVER MET A CUSTOMER YET that wasn’t all too happy to tell me what they wanted—usually in great detail. The problem is that customers don’t alwa...
分类：
其他好文 时间：
2015-07-16 09:44:24
阅读次数：
105
http://poj.org/problem?id=1679
Description
Given a connected undirected graph, tell if its minimum spanning tree is unique.
Definition 1 (Spanning Tree): Consider a connected, undirected gra...
分类：
其他好文 时间：
2015-07-13 12:07:55
阅读次数：
97
mysql 死锁检查今天看了一篇关于死锁检查的blog.Advanced InnoDB Deadlock Troubleshooting – What SHOW INNODB STATUS Doesn’t Tell You, and What Diagnostics You Should be Lo...
分类：
数据库 时间：
2015-07-08 16:08:13
阅读次数：
158
描述：Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a substring of B? For...
分类：
其他好文 时间：
2015-07-04 10:57:26
阅读次数：
99
Linux kernel release 3.x These are the release notes for Linux version 3. Read them carefully,as they tell you what this is all about, explain how to....
分类：
系统相关 时间：
2015-06-15 20:22:27
阅读次数：
201
#include#include#define LL __int64LL mult_mod(LL a,LL b,LL c){ a%=c; b%=c; LL ret=0; while(b) { if(b&1){ret+=a;ret%=c;} a=c)a%=c; b>>=1; } return ret;...
分类：
其他好文 时间：
2015-06-08 18:51:16
阅读次数：
150
The Unique MST
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 22715
Accepted: 8055
Description
Given a connected undirected graph, tell if its minimum s...
分类：
其他好文 时间：
2015-06-05 10:12:05
阅读次数：
133
DescriptionToday is Saturday, 17th Nov,2007. Now, if i tell you a date, can you tell me what day it is ? InputThere are multiply cases. One line is on...
分类：
其他好文 时间：
2015-06-04 18:54:59
阅读次数：
143
The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:22668Accepted:8038DescriptionGiven a connected undirected graph, tell if its minim...
分类：
其他好文 时间：
2015-06-03 17:12:01
阅读次数：
98
