Codeforces Round #372 (Div. 2) C 构造
来源:互联网 发布:python员工管理系统 编辑:程序博客网 时间:2024/06/04 19:31
题目传送门: http://codeforces.com/contest/716/problem/C
题意:x = 2,k = 1,m满足sqrt(x+mk) mod (k+1) == 0,然后x = sqrt(x+mk),k=k+1 ,求使得k从1到n的n个m,m无需最优,只要满足题意即可
思路:一道推公式题,不难,结果就是m = k*(k+1)*(k+1)-(k-1),当k=1时特判 m = 2
代码如下:
#include <iostream>#include <algorithm>#include <cstring>#include <stdio.h>#include <string>#include <cmath>#include <queue>#include <set>#include <map>#include <stack>#include <bitset>using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define ll long long#define ull unsigned long long#define mem(n,v) memset(n,v,sizeof(n))#define MAX 100005#define MAXN 200005#define PI 3.1415926#define E 2.718281828459#define opnin freopen("text.in.txt","r",stdin)#define opnout freopen("text.out.txt","w",stdout)#define clsin fclose(stdin)#define clsout fclose(stdout)#define haha1 cout << "haha1"<< endl#define haha2 cout << "haha2"<< endl#define haha3 cout << "haha3"<< endlconst int INF = 0x3f3f3f3f;const ll INFF = 0x3f3f3f3f3f3f3f3f;const double pi = 3.141592653589793;const double inf = 1e18;const double eps = 1e-8;const ll mod = 1e18;const ull mx = 133333331;/**************************************************************************/int main(){ ll n; cin >> n; cout << "2" <<endl; for(ll k=2;k<=n;k++) printf("%I64d\n",(k*(k+1)*(k+1) - k+1));}
0 0
- Codeforces Round #372 (Div. 2) C 构造
- Codeforces Round #287 (Div. 2) C. (构造)
- Codeforces Round #105 (Div. 2) C 构造
- Codeforces Round #287 (Div. 2) C 构造
- Codeforces Round #235 (Div. 2) C Team 构造法
- Codeforces Round #217 (Div. 2) / 370C Mittens (构造&贪心)
- 构造数列Codeforces Round #261 (Div. 2)C
- Codeforces Round #268 (Div. 2) C 24 Game [构造]
- Codeforces Round #275 (Div. 2) C - Diverse Permutation (构造)
- Codeforces Round #275 (Div. 2) C. Diverse Permutation 构造
- Codeforces Round #283 (Div. 2) C. Removing Columns 模拟+构造
- Codeforces Round #285 (Div. 2) C. Misha and Forest 构造
- *Codeforces Round #337 (Div. 2) C Harmony Analysis 构造题
- Codeforces Round #342 (Div. 2)(C)构造
- Codeforces Round #337 (Div. 2) C. Harmony Analysis (构造)
- Codeforces Round #337 (Div. 2) C 找规律+构造
- Codeforces Round #381 (Div. 2)C(构造,思维)
- Codeforces Round #224 (Div. 2) C. Arithmetic Progression【构造等差数列】
- JS常用事件兼容性处理方法
- HDU1754 - 线段树 Water~
- Python:反射
- 一步一步实现自定义控件(三)
- C++继承的三种方式,私有、公有、保护。
- Codeforces Round #372 (Div. 2) C 构造
- 新世纪的球王:里奥·梅西
- 第5章 路由事件(4)——附加路由事件
- RecyclerView仿ListView下拉刷新
- 计算表达式的值--顺序栈
- 阶乘
- HDU 5929 Basic Data Structure(deque双向队列+找规律)
- linux中使用脚本定义环境变量
- 微信web协议PHP版