摘要:
C 题意:爬楼梯,每次爬1~2层,有些层不能爬 题解:斐波那契数列(标数法)递推 #include <iostream> #include <cstdio> using namespace std; const int maxn=100005; const int mod=1e9+7; int n, 阅读全文
摘要:
#include <iostream> #include <cstdio> using namespace std; long long n,k=0,ans; int main() { scanf("%lld",&n); if(n==0) {cout<<0<<endl; return 0;} for 阅读全文
摘要:
索引: 类型取值范围,lower_bound,离散化,整除,快读,对拍,测时间,随机数,随机树 类型取值范围: unsigned int 0~4294967295 int -2147483648~2147483647 unsigned long 0~4294967295 long -21474836 阅读全文