题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4781 题目大意:给你n个点m条边,要求你构造一个符合条件的有向联通图(若无法构造输出-1,否则输出任意一种方法) 条件:1.任意两点间只有1条边,且不存在自环,每条边的权值均不相等大小为1~m中的值 2.从任一点出发可达其他任何一点且可以回到起点 3.任意一个有向环权值和%3==0 构造方法:可以先构造一个大环1->2->3->4……->n->1,其中1~n中的每条边权值可以为当…

Just Random Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 87    Accepted Submission(s): 34 Problem Description Coach Pang and Uncle Yang both love numbers. Every morning they play a game with…

Hard Disk Drive Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 83    Accepted Submission(s): 48 Problem Description Yesterday your dear cousin Coach Pang gave you a new 100MB hard disk drive (H…

Fibonacci Tree Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 75    Accepted Submission(s): 38 Problem Description Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do…

We Love MOE Girls Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 208    Accepted Submission(s): 157 Problem Description Chikami Nanako is a girl living in many different parallel worlds. In this…

F(x) Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 382    Accepted Submission(s): 137 Problem Description For a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x…

关注云计算和PaaS层的童鞋可以了解下: http://www.cloudfoundry-heroes-summit.com/shanghai http://www.cloudfoundry-heroes-summit.com/chengdu(成都站,本周六下午,12.14,还有时间参与交流哦) 我的讲稿地址: http://www.cloudfoundry-heroes-summit.com/action/convention/downloadFile?id=6.+%E4%BA%AC%E4%B…

互联网时代,随着区块链.大数据.人工智能等技术的快速发展,产品迭代速度飞快.在这样的市场环境下,提升研发效率.降低研发成本,同时支撑业务的快速发展,是每个企业都追求的目标之一. 大中型企业如何快速转型升级,实现研发效率的提升?中小企业如何保证研发过程的稳定性与持续性,保持创新力与活力? 12月8-9日,第42届MPD工作坊(成都站),我们将邀请微软.腾讯.蘑菇街.京东.广联达等公司的技术专家,按照软件研发中心的岗位职能划分,从产品运营.团队管理.架构技术.测试管理.运维交付等领域进行深度分享,通…

A Bit Fun Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 423    Accepted Submission(s): 270 Problem Description There are n numbers in a array, as a0, a1 ... , an-1, and another number m. We de…

G(x) Time Limit: 2000/500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 184    Accepted Submission(s): 44 Problem Description For a binary number x with n digits (AnAn-1An-2 ... A2A1), we encode it as Where ""…