题意:将一个10进制的数转化为题目要求的进制
思路:按照题目给出的两个方程,分别将两式都乘以φ^(n-2)
得到: φ^(n-1)+φ^(n-2)=φ^n;2*φ^n=φ^(n+1)+φ^(n-2),剩下的就是跟着模拟了,
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1000005;
#define inf 0x3f3f3f3f
#define maxn 2000100
int n;
int ans[110];
int main()
{
int T;
//scanf("%d",&T);
while(scanf("%d",&n) != EOF)
{
memset(ans,0,sizeof(ans));
int flag = 1;
ans[51] = n;
while(flag)
{
flag = 0;
for(int i = 2; i < 100; i++)
if(ans[i] > 1)
{
ans[i+1] += ans[i] / 2;
ans[i-2] += ans[i] / 2;
ans[i] &= 1;
flag = 1;
}
for(int i = 2; i < 100; i++)
{
int t = min(ans[i-1],ans[i-2]);
if(t > 0)
{
ans[i] += t;
ans[i-1] -= t;
ans[i-2] -= t;
flag = 1;
}
}
}
int st = 100,ed = 0;
while(!ans[st])
st--;
while(!ans[ed])
ed++;
for(int i = st; i >= ed; i--)
{
if(i == 50)
printf(".");
printf("%d",ans[i]);
}
printf("\n");
}
return 0;
}