Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel
2015-11-01 12:04
453 查看
这题就是找规律,把3-7的答案画出来,然后去找规律,就行了。answer=(n-2)*(n-2);
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; #define LL long long int main() { LL n; while(scanf("%lld",&n)!=EOF) { printf("%lld\n",(n-2)*(n-2)); } return 0; }
相关文章推荐
- priority_queue的用法
- IDDFS--UESTC - 577 分数拆分
- 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
- 清除UITableView底部多余的分割线
- 03-32位UUID和封装Map对象到指定类型的Bean中
- Packet for query is too large (1986748 > 1048576). You can change this value on the server by
- UESTC Pick The Sticks (背包变形)
- codeforces 592B The Monster and the Squirrel
- Android Api Demos登顶之路(112)Views-->SystemUiVisibility
- UESTC1218 2015CCPC DP 0,1背包
- codeforces B. The Monster and the Squirrel
- OC中的NSNumber、NSValue
- 黑马程序员_GUI编程的一些总结
- 一句话木马破解很黄很暴力哦
- UITextView输入框,动态算高度
- 3D物体在UGUI下的坐标映射
- iOS项目开发实战——实现UICollectionView的动态增加Cell与Section
- cf590B Chip 'n Dale Rescue Rangers