Description:
\quad
由
0
0
0和
1
1
1组成的串中,不能表示为由几个相同的较小的串连接成的串,称为本原串,有多少个长为
n
(
n
<
=
100000000
)
n(n<=100000000)
n(n<=100000000)的本原串?
答案
m
o
d
2008
mod2008
mod2008
例如,
100100
100100
100100不是本原串,因为他是由两个
100
100
100组成,而1101是本原串。
Input
\quad
输入包括多个数据,每个数据一行,包括一个整数
n
n
n,代表串的长度。
Output
\quad 对于每个测试数据,输出一行,代表有多少个符合要求本原串,答案 m o d 2008. mod2008. mod2008.
Sample Input
1
2
3
4
Sample Output
2
2
6
12
长度为 n n n的 01 01 01串的总数为 2 n 2^n 2n。要求本原串,只要将 01 01 01串的总数减掉非本原串就可以啦。而非本原串可以由本原串得到。
易得, f [ n ] = 2 n − ∑ ( f [ i ] ) − 2 f[n]=2^n−∑(f[i])−2 f[n]=2n−∑(f[i])−2, 其中 i i i是 n n n的大于等于 2 2 2的因子。
AC代码:
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m)
#define sddd(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n, m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n, m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld", &n)
#define sldd(n, m) scanf("%lld%lld", &n, &m)
#define slddd(n, m, k) scanf("%lld%lld%lld", &n, &m, &k)
#define sf(n) scanf("%lf", &n)
#define sc(n) scanf("%c", &n)
#define sff(n, m) scanf("%lf%lf", &n, &m)
#define sfff(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define ss(str) scanf("%s", str)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define mem(a, n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mod(x) ((x) % MOD)
#define gcd(a, b) __gcd(a, b)
#define lowbit(x) (x & -x)
typedef pair<int, int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
int ret = 0, sgn = 1;
char ch = getchar();
while (ch < '0' || ch > '9')
{
if (ch == '-')
sgn = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
ret = ret * 10 + ch - '0';
ch = getchar();
}
return ret * sgn;
}
inline void Out(int a)
{
if (a > 9)
Out(a / 10);
putchar(a % 10 + '0');
}
ll gcd(ll a, ll b)
{
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
///快速幂m^k%mod
ll qpow(int m, int k, int mod)
{
ll res = 1, t = m;
while (k)
{
if (k & 1)
res = res * t % mod;
t = t * t % mod;
k >>= 1;
}
return res;
}
// 快速幂求逆元
int Fermat(int a, int p) //费马求a关于b的逆元
{
return qpow(a, p - 2, p);
}
///扩展欧几里得
int exgcd(int a, int b, int &x, int &y)
{
if (b == 0)
{
x = 1;
y = 0;
return a;
}
int g = exgcd(b, a % b, x, y);
int t = x;
x = y;
y = t - a / b * y;
return g;
}
///使用ecgcd求a的逆元x
int mod_reverse(int a, int p)
{
int d, x, y;
d = exgcd(a, p, x, y);
if (d == 1)
return (x % p + p) % p;
else
return -1;
}
///中国剩余定理模板
ll china(int a[], int b[], int n) //a[]为除数,b[]为余数
{
int M = 1, y, x = 0;
for (int i = 0; i < n; ++i) //算出它们累乘的结果
M *= a[i];
for (int i = 0; i < n; ++i)
{
int w = M / a[i];
int tx = 0;
int t = exgcd(w, a[i], tx, y); //计算逆元
x = (x + w * (b[i] / t) * x) % M;
}
return (x + M) % M;
}
map<ll, ll> mp;
ll solve(ll n)
{
if (n == 1)
return 2;
if (mp[n])
return mp[n];
ll ans = 0;
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
ans = (ans + solve(i)) % 2008;
if (i * i != n)
ans = (ans + solve(n / i)) % 2008;
}
}
ans = (qpow(2, n, 2008) - ans - 2 + 2008) % 2008;
return mp[n] = ans;
}
int n;
int main()
{
while (~sd(n))
{
mp.clear();
mp[1] = mp[2] = 2;
printf("%lld\n", solve(n));
}
return 0;
}