题目链接:http://codeforces.com/contest/716/problem/C
题解:
根据题意:
a[i] mod i = 0;
a[i+1]^2 = a[i] + ans[i] * i;
所以 : ans[i] = (a[i+1]^2 - a[i] )/i
因为ans[i]为整数, a[i] mod i = 0, 所以a[i+1]^2 mod i = 0, 即a[i]^2 mod (i-1) = 0 (i>=2) 注意这里说明i=1时,不一定符合,需要带入验证(高中知识……)。
即只要数列满足上述两个条件就可以作为答案, 设 a[i] = i*(i-1),可知题目已给a1=2, 带入验证,不符合。所以:a[i] = ( i>=2? i*(i-1) : 2)
由于a[1] = 2, a[2] = 2. 所以ans[1] = (a[2]^2-a[1])/1 = 2。 所以 ans[i] = ( i>=2? (i+1)*(i+1)*i-i+1 : 2 )
代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<string>
#include<set>
#define LL long long
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
#define INF 0x7fffffff
#define LNF ((1LL<<62)-1)
#define maxn 200010
using namespace std;
int main()
{
LL n,i;
scanf("%lld",&n);
puts("2");
for(i = 2; i<=n; i++)
{
printf("%lld\n",(i+1)*(i+1)*i-i+1);
}
}