HDU 2082 F(N)

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=2802

思路：直接暴力模拟不行，打个表找找循环节

找循环节程序

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
int a[10000];
int b[100];
void cf()
{
    int k = 0;
    a[1] = 1;
    a[2] = 7;
    for(int i=3; i<=10000; i++)
    {
        a[i] = a[i-2] + 3 * i * i - 3 * i + 1;
        a[i] %= 2009;
        if(a[i] == 1)
        {
            b[k++] = i;
        }
    }
    for(int i=0; i<k; i++)
    {
        printf(" %d",b[i]);
    }
    printf("\n");
    for(int i=1; i<=10; i++)
    {
        printf("%d ",a[i]);
    }
    printf("\n");
    for(int i=0; i<k; i++)
    {
        for(int j=b[i]; j<=b[i]+10; j++)
        {
            printf("%d ",a[j]);
        }
        printf("\n");
    }
}
int main()
{
    int n;
    cf();
    while(scanf("%d",&n) && n)
    {
        printf("%d\n",a[n]);
    }
    return 0;
}

为4018

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
int a[10000];
int b[100];
void cf()
{
    int k = 0;
    a[1] = 1;
    a[2] = 7;
    for(int i=3; i<=4018; i++)
    {
        a[i] = a[i-2] + 3 * i * i - 3 * i + 1;
        a[i] %= 2009;
    }
}
int main()
{
    int n;
    cf();
    while(scanf("%d",&n) && n)
    {
        n %= 4018;
        if(n == 0)
            printf("%d\n",a[4018]);
        else
            printf("%d\n",a[n]);

    }
    return 0;
}