CodeForces 592B The Monster and the Squirrel
2016-05-07 20:56
405 查看
规律题,多画几个就能找到规律了。
#include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; long long a[60000]; long long C; int main() { a[3]=1; C=3; for(int i=4;i<=54321;i++) { a[i]=a[i-1]+C; C=C+2; } int n; while(~scanf("%d",&n)) printf("%lld\n",a ); return 0; }
相关文章推荐
- CodeForces 598B Queries on a String
- 347. Top K Frequent Elements
- 关于Arduino Mega2560的最基本介绍
- 06 GUI(图形用户界面)
- codeforces 447C DZY Loves Sequences(最长上升子序列变体)
- Androidstuido快捷键
- Codeforces Round #350 (Div. 2) E. Correct Bracket Sequence Editor (链表)
- HDU-3750-Guess Game
- 最长公共子序列LCS(The longest common subsequence)
- 【UNET自学日志】Part20 UI
- 关键字提取工具(面向英文)
- 最长上升子序列LIS(Longest Increasing Subsequence)
- mysql5中大数据错误:Packet for query is too large (***>***). You can change this value on the ser
- mysql 5.5 开启慢日志slow log的方法(log_slow_queries)
- MySQL开启慢查询日志log-slow-queries的方法
- 蓝牙(Bluetooth)
- Servlet中使用RequestDispatcher调派请求--forware
- Android Volley完全解析(三),定制自己的Request
- 2016 UESTC ACM Summer Training Team Selection (2)解题报告
- System and Device Programming------questions solved about device