竞赛
考级
法兰西玫瑰
KFCKUN
#include<iostream> #include<cstring> using namespace std; int main(){ int n; cin >> n; string a,b,c; b = "123"; a = "4567"; c = b+a; while(c.size()<n){ }
Ysjt | 深 ™
沈思邈(努力冲638)
yy
无奈
陈炜涵
嫌疑を避ける ~~
#include<iostream> using namespace std; int main(){ string a="4567",b="123",c; int n; cin>>n; c=b+a; while(c.size()<n) { a=b; b=c; c=b+a; } cout<<c[n-1]<<endl; return 0; }
qwerty1596
#include <bits/stdc++.h> using namespace std; int main(){ int n; scanf("%d",&n); string A="4567",B="123",C="1234567"; while(C.size()<n) { A=B; B=C; C=B+A; } cout<<C[n-1]<<endl; return 0; }
Voldemort
#include <bits/stdc++.h> using namespace std; int main(){ int n; scanf("%d",&n); string A="4567",B="123",C="1234567"; while(C.sizeofze()<n) { A=B; B=C; C=B+A; } cout<<C[n-1]<<endl; return 0; }
acgoacgo
准
majmDZB
#include<iostream> #include<cstring> using namespace std; int main(){ int n; cin >> n; string a,b,c; b = "123"; a = "4567"; c = b+a; while(c.size()<n){ } cout << c[n-1]; return 0; }