ZOJ 3328 Wu Xing
来源:互联网 发布:网络与新媒体硕士点 编辑:程序博客网 时间:2024/04/29 12:16
Description
Introduction
The Wu Xing, or the Five Movements, Five Phases or Five Steps/Stages, are chiefly an ancient mnemonic device, in many traditional Chinese fields.
The doctrine of five phases describes two cycles, a generating or creation cycle, also known as "mother-son", and an overcoming or destruction cycle, also known as "grandfather-nephew", of interactions between the phases.
Generating:
- Wood feeds Fire;
- Fire creates Earth (ash);
- Earth bears Metal;
- Metal carries Water (as in a bucket or tap, or water condenses on metal);
- Water nourishes Wood.
Overcoming:
- Wood parts Earth (such as roots) (or Trees can prevent soil erosion );
- Earth absorbs (or muddies) Water (or Earth dam control the water);
- Water quenches Fire;
- Fire melts Metal;
- Metal chops Wood.
With the two types of interactions in the above graph, any two nodes are connected by an edge.
Problem
In a graph with N nodes, to ensure that any two nodes are connected by at least one edge, how many types of interactions are required at least? Here a type of interaction should have the following properties:
- It can be represented as a set of directed edges in the graph.
- For each type of interaction, there should be one and only one edge starting at each node.
- For each type of interaction, there should be one and only one edge ending at each node.
- The interactions are made up of cycles, i.e. starting from an arbitrary node and following the edges with the same type of interaction, you can always reach the starting node after several steps.
Input
For each test case, there's a line with an integer N (3 <= N < 1,000,000), the number of nodes in the graph.
N = 0 indicates the end of input.Output
For each test case, output a line with the number of interactions that are required at least.
Sample Input
50
Sample Output
2
Reference
http://en.wikipedia.org/wiki/Wu_Xing
#include <iostream>using namespace std;int main(){ int t; while(cin>>t){ if(t==0)break; else cout<<t/2<<endl; } return 0;}
- ZOJ 3328 Wu Xing
- ZOJ 3328 Wu Xing
- ZOJ 3328 Wu Xing
- ZOJ 3328 Wu Xing【】
- ZOJ 3328 Wu Xing(五行)
- ZOJ 3328Wu Xing(游戏)
- ZOJ 3328 Wu Xing (五行相生相克找关系)
- ZOJ-3328-Wu Xing【7th浙江省赛】
- Wu XING
- Wu Xing
- ZOJ3328-Wu Xing
- 2014ACM集训13级PK赛2-Wu Xing
- The 7th Zhejiang Provincial Collegiate Programming Contest - G(Wu Xing)
- The 7th Zhejiang Provincial Collegiate Programming Contest->Problem G:G - Wu Xing
- The 7th Zhejiang Provincial Collegiate Programming Contest->Problem G:G - Wu Xing
- wu
- wu
- wu
- 第一篇python
- 编辑框CEdit
- WebService对象可空的困惑,关于nillable和minOccurs soap java .net wsdl的区别
- linux内核之chdir分析
- 二叉树的后续遍历
- ZOJ 3328 Wu Xing
- (初级)并发服务器之子进程
- leetcode 313. Super Ugly Number-超级丑数
- 方法重写与方法隐藏
- Linux 字符设备驱动结构(四)—— file_operations 结构体知识解析
- 代码块{}的使用
- #面试java基础总结大全#多线程
- "SQLServer复制需要有实际的服务器名称才能连接到服务器,请指定实际的服务器名"
- 算法导论学习笔记(一)排序算法之堆排序