UVA 11549-Calculator Conundrum-floyd判重
来源:互联网 发布:阿里云免费证书配置 编辑:程序博客网 时间:2024/05/29 23:47
给n,k
计算机只能显示前n位数字,,请一直给k作平方运算。。。得到结果不断取前n位。。。。
问能得到的最大的数字是多少(最多n位)
1、暴力 判重,遇到重复的就停止 563ms
2、flody判重 226ms
暴力方法 563ms
#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <algorithm>#include <iostream>#include <queue>#include <map>#include <set>#include <vector>using namespace std;long long min(long long a,long long b){return a<b?a:b;}set<long long> sb;long long n,k;char tm[105]; long long get_pre_n_num(long long k) //得到前n个数字{ long long i;long long j=0;long long tmp=k;while(tmp)//数字转字符串 {tm[j++]=tmp%10+'0';tmp=tmp/10; }tm[j]=0;for(i=0;i<j/2;i++) //逆转swap(tm[i],tm[j-i-1]);tm[n]=0;long long ret=0;int len=min(n,j);////取前n个数字 returnfor (i=0;i<len;i++)tmp=tmp*10+tm[i]-'0';return tmp;}int main(){long long i,j;int t;cin>>t;while(t--){sb.clear();scanf("%lld%lld",&n,&k);if (k==0) {printf("0\n");continue;} sb.insert(k); while(1){ k=k*k; long long ss=num_to_char(k,tm); //取前n个数字k=ss;//直接用前n个数字平方即可if (sb.find(ss)!=sb.end()) //如果重复了则退出break;sb.insert(ss);}set<long long>::iterator it=sb.end();if (it!=sb.begin())//取最大的it--;long long sss=*it;printf("%lld",sss);printf("\n");}return 0;}
0 0
- UVA 11549-Calculator Conundrum-floyd判重
- UVA 11549 Calculator Conundrum Floyd判圈
- UVA 11549 Calculator Conundrum (Floyd判圈算法)
- UVa 11549 Calculator Conundrum / floyd判圈算法
- UVA 11549 Calculator Conundrum (Floyd判圈算法)
- uva 11549 Calculator Conundrum(floyd判圈)
- floyd判圈算法 (UVA 11549 - Calculator Conundrum)
- UVA Calculator Conundrum 11549 (Floyd判环&数学&高效)
- UVA 11549 Calculator Conundrum Floyd判圈算法 .
- UVa 11549 Calculator Conundrum (模拟+Floyd判环)
- UVA 11549 Calculator Conundrum Floyd判圈算法 Brent判圈算法 相关性质及证明
- UVA - 11549 Calculator Conundrum (循环节)(Floyd判圈算法,快慢指针)
- uva 11549 - Calculator Conundrum (Floyd判圈法)
- UVA 11549 - Calculator Conundrum Floyd判圈法
- Uva 11549 CALCULATOR CONUNDRUM (floyd 判圈法)
- UVa 11549 - Calculator Conundrum(Floyd判圈法)
- UVa11549 - Calculator Conundrum(Floyd判圈算法)
- UVa 11549 Calculator Conundrum 解题报告(判环)
- Java方法excel文件转换成xml文件
- Tomorrow never knows?(C程序设计进阶第2周)
- Java设计模式(1)-单例模式
- Android:onNewIntent()触发机制及注意事项
- [LeetCode153]Find Minimum in Rotated Sorted Array
- UVA 11549-Calculator Conundrum-floyd判重
- Linux下获取时间差(毫秒级)
- ios 隐藏顶部栏
- SSIS数据转换-查找
- EL表达式(Expresion language)
- source insight 设置行数、加高亮
- Programming Elixir, Functional |> Concurrent |> Pragmatic |> Fun, Pragmatic 读书笔记
- Mac .bash_profile
- AMESim R14 运行时出现许可证错误