UVa 12333 Revenge of Fibonacci (字典树+大数)
题意:给定一个长度小于40的序列,问你那是Fib数列的哪一项的前缀。
析:首先用大数把Fib数列的前100000-1项算出来,注意,一定不能是100000,要不然会WA的,然后每个数取前40位,不足40位的全取,然后插入到字典树上,
并用一个数组标记是哪一项,最后查询的时候,如果查不到就是无解,否则输出答案。
在我电脑上跑了10秒多,交上去才1秒多。
代码如下:
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#define debug() puts("++++");
#define gcd(a, b) __gcd(a, b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std; typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-5;
const int maxn = 40000 + 10;
const int mod = 1000000007;
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline bool is_in(int r, int c){
return r >= 0 && r < n && c >= 0 && c < m;
} struct BigInteger{
static const int BASE = 100000000;
static const int WIDTH = 8;
vector<int> s; BigInteger(LL num = 0){ *this = num; }
BigInteger operator = (LL num){
s.clear();
do{
s.push_back(num % BASE);
num /= BASE;
} while(num);
return *this;
}
BigInteger operator = (const string &str){
s.clear();
int x, len = (str.length() - 1) / WIDTH + 1;
for(int i = 0; i < len; ++i){
int end = str.length() - i * WIDTH;
int start = max(0, end - WIDTH);
sscanf(str.substr(start, end-start).c_str(), "%d", &x);
s.push_back(x);
}
return *this;
}
friend istream &operator >> (istream &in, BigInteger &x){
string s;
if(!(in >> s)) return in;
x = s;
return in;
} string getNum(){
string ss;
int t = s.back();
while(t) ss.push_back(t % 10 + '0'), t /= 10;
reverse(ss.begin(), ss.end());
for(int i = s.size()-2; i >= 0; --i){
char buf[20];
sprintf(buf, "%08d", s[i]);
int len = strlen(buf);
for(int j = 0; j < len; ++j) ss.push_back(buf[j]);
if(ss.size() >= 40) return ss;
}
return ss;
} friend ostream &operator << (ostream &out, const BigInteger &x){
out << x.s.back();
for(int i = x.s.size()-2; i >= 0; --i){
char buf[20];
sprintf(buf, "%08d", x.s[i]);
int len = strlen(buf);
for(int j = 0; j < len; ++j) out << buf[j];
}
return out;
} BigInteger operator + (const BigInteger &b) const{
BigInteger c;
c.s.clear();
for(int i = 0, g = 0; ; ++i){
if(!g && i >= s.size() && i >= b.s.size()) break;
int x = g;
if(i < s.size()) x += s[i];
if(i < b.s.size()) x += b.s[i];
c.s.push_back(x % BASE);
g = x / BASE;
}
return c;
}
};
const int maxnode = 40 * 100000 + 10;
const int sigam_size = 10;
struct Tire{
int ch[maxnode][sigam_size];
int val[maxnode];
int sz;
void init(){
sz = 1;
memset(ch, 0, sizeof ch);
memset(val, 0, sizeof val);
}
int idx(char c){ return c - '0'; } void Insert(const string &s, int v){
int u = 0;
for(int i = 0; i < s.size(); ++i){
int c = idx(s[i]);
if(!val[u]) val[u] = v;
if(!ch[u][c]) ch[u][c] = sz++;
u = ch[u][c];
}
if(!val[u]) val[u] = v;
} int query(const string &s){
int u = 0;
for(int i = 0; i < s.size(); ++i){
int c = idx(s[i]);
if(!ch[u][c]) return -1;
u = ch[u][c];
}
return val[u] - 1;
}
}; Tire fib; void init(){
fib.init();
BigInteger a = 1;
BigInteger b = 1;
BigInteger c = 1;
fib.Insert(a.getNum(), 1);
fib.Insert(a.getNum(), 2);
for(int i = 2; i < 100000; ++i){
c = a + b;
string s = c.getNum();
if(s.size() > 40) s = s.substr(0, 40);
fib.Insert(s, i+1);
a = b; b = c;
}
} int main(){
ios::sync_with_stdio(false);
init();
int T; cin >> T;
for(int kase = 1; kase <= T; ++kase){
string s;
cin >> s;
int ans = fib.query(s);
cout << "Case #" << kase << ": " << ans << endl;
}
return 0;
}
UVa 12333 Revenge of Fibonacci (字典树+大数)的更多相关文章
- hdu 4099 Revenge of Fibonacci 字典树+大数
将斐波那契的前100000个,每个的前40位都插入到字典树里(其他位数删掉),然后直接查询字典树就行. 此题坑点在于 1.字典树的深度不能太大,事实上,超过40在hdu就会MLE…… 2.若大数加法时 ...
- UVA - 12333 Revenge of Fibonacci 高精度加法 + 字典树
题目:给定一个长度为40的数字,问其是否在前100000项fibonacci数的前缀 因为是前缀,容易想到字典树,同时因为数字的长度只有40,所以我们只要把fib数的前40位加入字典树即可.这里主要讨 ...
- UVa 12333 - Revenge of Fibonacci manweifc(模拟加法竖式 & 字典树)
题意: 给定n个(n<=40)数字, 求100000个以内有没有前面n个数字符合给定的数字的fibonacci项, 如果有, 给出最小的fibonacci项, 如果没有, 输出-1. 分析: 可 ...
- UVA 12333 Revenge of Fibonacci
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...
- UVA - 12333 Revenge of Fibonacci (大数 字典树)
The well-known Fibonacci sequence is defined as following: F(0) = F(1) = 1 F(n) = F(n − 1) + F(n − 2 ...
- hdu4099 Revenge of Fibonacci 字典树
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4099 思想很容易想到 就是预处理出前10w个的fib数,然后建树查询 建树时只用前40位即可,所以在计 ...
- UVA - 12333 字典树+大数
思路:用字典树将前40个数字记录下来,模拟大数加法即可. AC代码 #include <cstdio> #include <cmath> #include <algori ...
- hdu 4099 Revenge of Fibonacci Trie树与模拟数位加法
Revenge of Fibonacci 题意:给定fibonacci数列的前100000项的前n位(n<=40);问你这是fibonacci数列第几项的前缀?如若不在前100000项范围内,输 ...
- UVA 11488 Hyper Prefix Sets (字典树)
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...
随机推荐
- ok6410[002] ubuntu1604系统下搭配ckermit和dnw基于RAM的裸机程序调试环境
ubuntu1604系统下搭配ckermit和dnw基于RAM的裸机程序调试环境 系统: ubuntu16.04 裸板: 飞凌公司OK6410开发板 目标:搭建基于ubuntu1604系统和基于RA ...
- AndroidManifest具体解释之Application(有图更好懂)
可以包括的标签: <activity> <activity-alias> <service> <receiver> <provider> & ...
- 用callgraph生成的两张函数调用关系图
参考这里,感觉很Cool吧. Linux-0.11函数调用关系图: QEMU函数调用关系图:
- asp识别手机端
<script type="text/javascript"> var mobileAgent = new Array("iphone", &quo ...
- PHP获取IP
<?php $iipp = $_SERVER["REMOTE_ADDR"]; echo $iipp ; ?>
- 使用unidac 连接FB 3.0 (含嵌入版)
unidac 是delphi 最强大的数据库连接控件,没有之一.详细信息可以通过官网了解. Firebird是一个跨平台的关系数据库系统,目前能够运行在Windows.linux和各种Unix操作系 ...
- 安装DotNetCore.1.0.1-VS2015Tools.Preview2.0.3引发的血案
1.下载了一个开源项目,是用netcore开发的 2.VS2015打不开解决方案 3.于是安装DotNetCore.1.0.1-VS2015Tools.Preview2.0.3 4.安装成功,项目顺利 ...
- Eliminates these repeated computation in multi aggregations query
https://github.com/pingcap/tispark/commit/dcca23bfa1aa0c356a4280d82bc8301c0de08318 scala> spark.s ...
- 3.改变 HTML 内容
①x=document.getElementById("demo") //查找元素 ②x.innerHTML="Hello JavaScript"; //改变内 ...
- Protocol_ISIS
集成ISIS协议 作者:Danbo 2015-7-5 ISIS的意思是表示中间系统,并且是为OSI无连接网络协议(OSI Conectionless Network Protocol,CLNP)设计的 ...