Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel (规律)
来源:互联网 发布:网络配置 编辑:程序博客网 时间:2024/05/20 05:54
Ari the monster always wakes up very early with the first ray of the sun and the first thing she does is feeding her squirrel.
Ari draws a regular convex polygon on the floor and numbers it's vertices 1, 2, ..., n in clockwise order. Then starting from the vertex 1 she draws a ray in the direction of each other vertex. The ray stops when it reaches a vertex or intersects with another ray drawn before. Ari repeats this process for vertex2, 3, ..., n (in this particular order). And then she puts a walnut in each region inside the polygon.
Ada the squirrel wants to collect all the walnuts, but she is not allowed to step on the lines drawn by Ari. That means Ada have to perform a small jump if she wants to go from one region to another. Ada can jump from one region P to another region Q if and only if P and Q share a side or a corner.
Assuming that Ada starts from outside of the picture, what is the minimum number of jumps she has to perform in order to collect all the walnuts?
The first and only line of the input contains a single integer n (3 ≤ n ≤ 54321) - the number of vertices of the regular polygon drawn by Ari.
Print the minimum number of jumps Ada should make to collect all the walnuts. Note, that shedoesn't need to leave the polygon after.
5
9
3
1
One of the possible solutions for the first sample is shown on the picture above.
ac代码:
#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#define MAXN 100100#define MOD 1000000007#define LL long long#define INF 0xfffffffusing namespace std;int main(){__int64 n;//一开始提交提醒我不支持longlong while(scanf("%I64d",&n)!=EOF){__int64 ans;ans=(n-2)*(n-2);printf("%I64d\n",ans);} return 0;}
- Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel(数学规律)
- Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel (规律)
- 【Codeforces Round 328 (Div 2)B】【找规律】The Monster and the Squirrel 正多边形连边分割块数
- Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel
- Codeforces Round #328 (Div. 2)B. The Monster and the Squirrel
- Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel
- Codeforces Round #328 (Div. 2)B. The Monster and the Squirrel
- Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel(math)
- Codeforces Round #328 (Div. 2) 592 B. The Monster and the Squirrel
- Codeforces 592B The Monster and the Squirrel 【规律题】
- cf 328div 2 B. The Monster and the Squirrel
- codeforces round The Monster and the Squirrel 529B (数学规律)
- Codeforces Round #328 (Div. 2)_B. The Monster and the Squirrel
- codeforces B. The Monster and the Squirrel
- CodeForces 592B The Monster and the Squirrel
- cf#328-B. The Monster and the Squirrel-水题+数学规律
- B. The Monster and the Squirrel
- The Monster and the Squirrel(规律题)
- Chapter01 Scala基础知识
- 第八天(练习)
- Linux查看端口
- 架构设计:系统间通信(11)——RPC实例Apache Thrift 上篇
- LeetCode -- Course Schedule
- Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel (规律)
- Android测试 ---- Espresso + Jacoco
- zlib库 在windows下的编译与使用
- LeetCode -- Intersection of Two Linked Lists
- 即时通讯-1
- Java插入MySQL中文出现乱码
- hdu 2514 Another Eight Puzzle(DFS暴搜)
- 正则表达式
- HDU杭电1088 Write a simple HTML Browser