Connect the Cable Wires UVA - 10862（找规律、大数）

题目链接：Connect the Cable Wires UVA - 10862

递推公式：f[i]=f[i-1]*3-f[i-2]

#include <iostream>
#include <cstdio>
#include <cstring>using namespace std;const int N=2e3+5;struct bign
{int len;int s[N];bign(){len=1;memset(s,0,sizeof(s));}bign operator = (const char *number){len=strlen(number);for(int i=0;i<len;i++)s[len-i-1]=number[i]-'0';return *this;}bign operator = (const int number){char string[N];sprintf(string,"%d",number);*this=string;return *this;}bign (int number) {*this=number;}bign (const char *number) {*this=number;}bign operator + (const bign &c){bign sum;int t=0;sum.len=max(this->len,c.len);for(int i=0;i<sum.len;i++){if(i<this->len)t+=this->s[i];if(i<c.len)t+=c.s[i];sum.s[i]=t%10;t/=10;}while(t)sum.s[sum.len++]=t%10,t/=10;return sum;}bign operator * (const bign &c){bign sum,zero;if(*this==zero||c==zero)return zero;sum.len=this->len+c.len;for(int i=0;i<this->len;i++)for(int j=0;j<c.len;j++)sum.s[i+j]+=this->s[i]*c.s[j];for(int i=0;i<sum.len;i++)sum.s[i+1]+=sum.s[i]/10,sum.s[i]%=10;sum.len++;while(!sum.s[sum.len-1])sum.len--;return sum;}bign operator * (const int &num){bign c=num;return *this*c;}bign operator / (const int &num){bign ans;int k=0;ans.len=len;for(int i=ans.len-1;i>=0;i--){ans.s[i]=(k*10+s[i])/num;k=(k*10+s[i])%num;}while(!ans.s[ans.len-1])ans.len--;return ans;}bign operator - (const bign &c){bign ans;ans.len=max(this->len,c.len);int i;for(i=0;i<c.len;i++){if(this->s[i]<c.s[i]){this->s[i]+=10;this->s[i+1]--;}ans.s[i]=this->s[i]-c.s[i];}for(;i<this->len;i++){if(this->s[i]<0){this->s[i]+=10;this->s[i+1]--;}ans.s[i]=this->s[i];}while(ans.s[ans.len-1]==0)ans.len--;if(ans.len==0)ans.len=1;return ans;}void put(){if(len==1&&s[0]==0)printf("0");elsefor(int i=len-1;i>=0;i--)printf("%d",s[i]);printf("\n");}bool operator < (const bign &b) const{if(len!=b.len)return len<b.len;for(int i=len-1;i>=0;i--)if(s[i]!=b.s[i])return s[i]<b.s[i];return false;}bool operator > (const bign &b) const {return b<*this;}bool operator <= (const bign &b) const {return !(b<*this);}bool operator >= (const bign &b) const {return !(*this<b);}bool operator != (const bign &b) const {return b<*this||*this<b;}bool operator == (const bign &b) const {return !(b!=*this);}
};bign f[N];int main()
{f[0]=0;f[1]=1;for(int i=2;i<N;i++)f[i]=f[i-1]*3-f[i-2];int n;while(~scanf("%d",&n)&&n)f[n].put();return 0;
}

Connect the Cable Wires UVA - 10862（找规律、大数）相关推荐

UVA10862 - Connect the Cable Wires（递推 + java的大数）
UVA10862 - Connect the Cable Wires(递推 + java的大数) 题目链接题目大意:给你n座房子位于一条直线上,然后仅仅给你一个cable service.要求每座房 ...
uva 10862 Connect the Cable Wires
原题: Asif is a student of East West University and he is currently working for the EWUISP to meet his ...
Resistors in Parallel（找规律+大数）
题意:https://codeforces.com/group/ikIh7rsWAl/contest/254825/problem/E 给你一个n,计算n / Sigma(1~n)的d(是n的只出现一 ...
2018 ICPC 焦作区域赛 Resistors in Parallel（找规律+大数）
传送门题目大意给出电阻的并联公式,规定一个含有平方因子的数的1R=0\frac{1}{R}=0R1=0.定义一个数的阻值为其所有的因子阻值并联求出的结果,问nnn以内并联后的最大的阻值是多少,输 ...
10862 - Connect the Cable Wires
大神的推理很经典,但是感觉用Java的大整数不太过瘾,用C++的大整数模板太麻烦,不如用数组模拟的好 #include <map> #include <set> #includ ...
UVA - 1647 Computer Transformation(计算机变换)(找规律)
题意:初始串为一个1,每一步会将每个0改成10,每个1改成01,因此1会依次变成01,1001,01101001,--输入n(n<=1000),统计n步之后得到的串中,"00" ...
UVA - 12627 - Erratic Expansion（找规律递归）
递归找规律即可,用前b行减去前a-1行的红气球个数求解,细节见代码 #include<cstdio> #include<cstring> #include<cstdlib ...
思维、找规律题目汇总
转自:http://hi.baidu.com/liuzhe/blog/item/d2dc0fd10bf1eadb572c843d.html 感想: 1.还是数学有前途 2.猜想很重要 3.暴力打表可以 ...
2018.09.01 poj3071Football（概率dp+二进制找规律）
传送门概率dp简单题. 设f[i][j]表示前i轮j获胜的概率. 如果j,k能够刚好在第i轮相遇,找规律可以发现j,k满足: (j−1)>>(i−1)(j−1)>>(i−1) ...

Connect the Cable Wires UVA - 10862（找规律、大数）

Connect the Cable Wires UVA - 10862（找规律、大数）相关推荐

最新文章

热门文章