acgo题库
  • 首页
  • 题库
  • 学习
  • 天梯
  • 备赛

    竞赛

    • CSP-J/S
    • 蓝桥杯

    考级

    • GESP
    • CPA
    • 电子学会考级
  • 竞赛
  • 讨论
  • 团队
登录
注册
题目详情提交记录(0)
  • 第一条题解

    #include <iostream> #include <cstdio> #define int long long using namespace std; string s1 = ".4567", s2 = ".123"; int fib[100005]; void dfs(int idx, int cur){ if(cur == 1){cout << s1[idx] << '\n'; return;} if(cur == 2){cout << s2[idx] << '\n'; return;} if(idx <= fib[cur - 1]) dfs(idx, cur - 1); else dfs(idx - fib[cur - 1], cur - 2); } void solve(){ int n; cin >> n; dfs(n, 43); } signed main(){ ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); fib[1] = 4, fib[2] = 3; for(int i = 3; i <= 43; i++){ fib[i] = fib[i - 1] + fib[i - 2]; } int t; cin >> t; while(t--) solve(); }

    userId_undefined

    AC之神

    时间刺客分支·分支解题者格式·格式排版员
    4阅读
    1回复
    0点赞
  • 第二条题解

    #include <iostream> #include <cstdio> #define int long long using namespace std; string s1 = ".4567", s2 = ".123"; int fib[100005]; void dfs(int idx, int cur){ if(cur == 1){cout << s1[idx] << '\n'; return;} if(cur == 2){cout << s2[idx] << '\n'; return;} if(idx <= fib[cur - 1]) dfs(idx, cur - 1); else dfs(idx - fib[cur - 1], cur - 2); } void solve(){ int n; cin >> n; dfs(n, 43); } signed main(){ ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); fib[1] = 4, fib[2] = 3; for(int i = 3; i <= 43; i++){ fib[i] = fib[i - 1] + fib[i - 2]; } int t; cin >> t; while(t--) solve(); return 0; }

    userId_undefined

    him

    0阅读
    0回复
    0点赞
暂无数据

提交答案之后,这里将显示提交结果~

首页