HDU2800(找规律)
来源:互联网 发布:万网域名备案注销 编辑:程序博客网 时间:2024/05/29 13:49
Adding Edges
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 557 Accepted Submission(s): 370
Problem Description
There are N+1 points on the plane, number A,1,2…N. N is an odd integer. Initially, there exist (N+1)/2 edges, as shown in the picture below.
Now your mission is add some edges to the graph, makes that
① degree(i) != degree(j), (i != j, 1 <= i, j <= N).
② degree(1) as small as possible.
For example, when N = 3, there are two possible answers:
Now your mission is add some edges to the graph, makes that
① degree(i) != degree(j), (i != j, 1 <= i, j <= N).
② degree(1) as small as possible.
For example, when N = 3, there are two possible answers:
Input
Each test case contains a single odd integer N(N<=10^6), indicating the number of points. The input is terminated by a set starting with N = 0.
Output
For each test case, output on a line the smallest possible value of the degree(1).
Sample Input
30
Sample Output
2此题代码非常简单,但思路本人认为并不那么容易的。#include<cstdio>int main(){int n;while(~scanf("%d",&n)&&n){printf("%d\n",(n+1)/2);}return 0;}
- HDU2800(找规律)
- 找规律
- 找规律!
- 找规律
- 找规律,
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 找规律
- 递归(找规律、找出口)
- 数字找规律
- POJ1450 Gridland [找规律]
- 1694. Spiral (找规律)
- VMware vSphere服务器虚拟化实验五 vCenter Server 网络管理
- c++ new操作符的重载
- HTTP Status 404 - 解决办法
- hdu2159 TATE
- android的简单消息机制
- HDU2800(找规律)
- hdu1789 Doing Homework again
- C++学习_特殊容器: bitset,stack,queue 和Priority Queues
- 密码发生器
- String、字符串缓冲区、基本数据类型包装类
- hdu 2955 Robberies
- java反射机制
- Linux 高可用性(HA)集群探讨
- Word2010中的格式标记