Revolving Digits

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24215    Accepted Submission(s): 5268

Problem Description
One day Silence is interested in revolving the digits of a positive integer. In the revolving operation, he can put several last digits to the front of the integer. Of course, he can put all the digits to the front, so he will get the integer itself. For example, he can change 123 into 312, 231 and 123. Now he wanted to know how many different integers he can get that is less than the original integer, how many different integers he can get that is equal to the original integer and how many different integers he can get that is greater than the original integer. We will ensure that the original integer is positive and it has no leading zeros, but if we get an integer with some leading zeros by revolving the digits, we will regard the new integer as it has no leading zeros. For example, if the original integer is 104, we can get 410, 41 and 104.
 
Input
The first line of the input contains an integer T (1<=T<=50) which means the number of test cases. 
For each test cases, there is only one line that is the original integer N. we will ensure that N is an positive integer without leading zeros and N is less than 10^100000.
 
Output
For each test case, please output a line which is "Case X: L E G", X means the number of the test case. And L means the number of integers is less than N that we can get by revolving digits. E means the number of integers is equal to N. G means the number of integers is greater than N.
 
Sample Input
1
341
Sample Output
Case 1: 1 1 1
题意:将一个数的每一个后缀移到前面和剩下的数字组成新的数字,求这些数字中比原来数字大的,相等的,小的,且不能重复的个数.
思路:将原来的串复制到原窜的后面,那么这样就可以得到,将后缀移到前面的相同的字串,其实就相当于将后缀串移到前面。那后一般的思想是,暴力比较。
假设原串的长度为l,那么新串就为2*l;拿原串与新串[1,l]比较。这样可以用EXKMP来优化,如果在这个点处,extend[i]>=l,那么这个点处往后再数l-1个点时,这个数就和
原数相等,否则小于的话就比较tt[i+extend[i]]-'0'>cc[extend[i]+1]-'0'的大小就好了。最后去重的话,用KMP的next数组,求下循环节,再每个数除循环节就可以了。
还有一种去重复的就是,最后相等的答案肯定是1,所以要除的那个数就是相等的个数;
  1 #include<stdio.h>
2 #include<algorithm>
3 #include<iostream>
4 #include<string.h>
5 #include<stdlib.h>
6 #include<math.h>
7 #include<cstdio>
8 #include<queue>
9 #include<stack>
10 #include<map>
11 char tt[2*100005];
12 int extend[2*100005];
13 int nex[100005];
14 char d[100005];
15 char cc[100005];
16 int pp[100005];
17 void next1(int k);
18 void EXkmp(int k,int r);
19 using namespace std;
20 int main(void)
21 {
22 int i,j,k,p,q;
23 scanf("%d",&k);
24 for(int s =1; s<=k; s++)
25 {
26 memset(nex,0,sizeof(nex));
27 memset(extend,0,sizeof(extend));
28 scanf("%s",d);
29 int l=strlen(d);
30 for(i=1; i<=2*l; i++)
31 {
32 if(i<=l)
33 tt[i]=d[i-1];
34 else
35 tt[i]=d[i-l-1];
36 }
37 for(i=0; i<l; i++)
38 cc[i+1]=d[i];
39 j=0;
40 pp[0]=0;
41 pp[1]=0;
42 for(i=2; i<=l; i++)
43 {
44 while(j>0&&cc[j+1]!=cc[i])
45 {
46 j=pp[j];
47 }
48 if(cc[j+1]==cc[i])
49 {
50 j++;
51 }
52 pp[i]=j;
53 }
54 int temp=l/(l-pp[l]);
55 if(l%(l-pp[l])!=0)
56 {
57 temp=1;
58 }
59 next1(l);
60 EXkmp(2*l,l);
61 int a[4];
62 memset(a,0,sizeof(a));
63 for(i=1; i<=l+1; i++)
64 {
65 if(extend[i]==l)//当匹配数等于l时就相等
66 {
67 a[1]++;
68 }
69 else
70 {
71 if(tt[i+extend[i]]-'0'>cc[extend[i]+1]-'0')//不等于l时比较开始不相等的那位
72 {
73 a[0]++;
74 }
75 else a[2]++;
76 }
77 }
78 printf("Case %d: ",s);
79 printf("%d %d %d\n",a[2]/temp,(a[1]-1)/temp,a[0]/temp);
80
81 }
82
83 }
84 void next1(int k)
85 {
86 int i,j,p;
87 j=1;
88 int r=j;
89 nex[1]=0;
90 while(cc[j+1]==cc[j]&&j+1<=k)
91 {
92 j++;
93 }
94 nex[2]=j-r;
95 int id=2;
96 for(i=3; i<=k; i++)
97 {
98 p=id+nex[id]-1;
99 int L=nex[i-id+1];
100 int c=i+L-1;
101 if(c>=p)
102 {
103 int j=p-i+1;
104 if(j<0)j=0;
105 while(cc[j+1]==cc[j+i]&&j+i<=k)
106 {
107 j++;
108 }
109 nex[i]=j;
110 id=i;
111 }
112 else nex[i]=L;
113 }
114 }
115
116 void EXkmp(int k,int r)
117 {
118 int i,j;
119 j=0;
120 while(cc[j+1]==tt[j+1]&&j+1<=r)
121 {
122 j++;
123 }
124 extend[1]=j;
125 int id=1;
126 int p;
127 for(i=2; i<=k; i++)
128 {
129 p=id+extend[id]-1;
130 int L=nex[i-id+1];
131 int c=i+L-1;
132 if(c>=p)
133 {
134 j=p-i+1;
135 j=max(j,0);
136 while(cc[j+1]==tt[j+i]&&j+i<=k&&j<=r)
137 {
138 j++;
139 }
140 extend[i]=j;
141 id=i;
142 }
143 else extend[i]=L;
144 }
145 }
 

Revolving Digits(hdu4333)的更多相关文章

  1. 【HDU4333】Revolving Digits(扩展KMP+KMP)

    Revolving Digits   Description One day Silence is interested in revolving the digits of a positive i ...

  2. HDU - 4333 :Revolving Digits (扩展KMP经典题,问旋转后有多少个不同的数字小于它本身,等于它本身,大于它本身。)

    One day Silence is interested in revolving the digits of a positive integer. In the revolving operat ...

  3. HDU - 4333 Revolving Digits(扩展KMP)

    http://acm.hdu.edu.cn/showproblem.php?pid=4333 题意 一个数字,依次将第一位放到最后一位,问小于本身的数的个数及等于本身的个数和大于本身的个数,但是要注意 ...

  4. HDU - 4333 Revolving Digits(拓展kmp+最小循环节)

    1.给一个数字字符串s,可以把它的最后一个字符放到最前面变为另一个数字,直到又变为原来的s.求这个过程中比原来的数字小的.相等的.大的数字各有多少. 例如:字符串123,变换过程:123 -> ...

  5. Revolving Digits(hdu 4333)

    题意:就是给你一个数字,然后把最后一个数字放到最前面去,经过几次变换后又回到原数字,问在这些数字中,比原数字小的,相等的,大的分别有多少个.比如341-->134-->413-->3 ...

  6. CodeForces 489C Given Length and Sum of Digits... (贪心)

    Given Length and Sum of Digits... 题目链接: http://acm.hust.edu.cn/vjudge/contest/121332#problem/F Descr ...

  7. Codeforces 915 C. Permute Digits (dfs)

    题目链接:Permute Digits 题意: 给出了两个数字a,b(<=1e18),保证a,b都不带前缀0.用a的字符重组一个数字使这个值最大且小于b.(保证这个值存在) 题解: 这题遇到了不 ...

  8. CodeForces 489C Given Length and Sum of Digits... (dfs)

    C. Given Length and Sum of Digits... time limit per test 1 second memory limit per test 256 megabyte ...

  9. UVA-10061 How many zero's and how many digits ? (数论)

    题目大意:让求n!在base进制下的位数以及末尾0的连续个数. 题目分析:一个m位的b进制数N,最小是b^(m-1),最大不超过b^m,即b^(m-1)≤N<b^m.解不等式,得log10(N) ...

随机推荐

  1. .NET Core如何配置TLS Cipher(套件)?

    前言 前不久我发表了一篇关于TLS协议配置被我钻了空子,经过第三方合作伙伴验证,针对此TLS协议存在不安全套件,急催速速解决,那么我们本篇开始继续整活!第三方合作伙伴对平台安全严苛要求,我们已连续发版 ...

  2. 备忘录:关于.net程序连接Oracle数据库

    目录 关于使用MSSM访问Oracle数据库 关于. net 程序中连接Oracle数据库 志铭-2021年12月7日 21:22:15 关于使用MSSM访问Oracle数据库 安装访问接口组件:Or ...

  3. LVM磁盘创建与扩容

    以虚拟机为例 1.在虚拟机上添加新磁盘,点击虚拟机→设置->添加,最后如下图. 2.进入系统fdisk -l,查看当前磁盘信息 [root@master shell]# fdisk -l Dis ...

  4. Kafka入门教程(一)

    转自:https://blog.csdn.net/yuan_xw/article/details/51210954 1 Kafka入门教程 1.1 消息队列(Message Queue) Messag ...

  5. 安全相关,xss

    XSS XSS,即 Cross Site Script,中译是跨站脚本攻击:其原本缩写是 CSS,但为了和层叠样式表(Cascading Style Sheet)有所区分,因而在安全领域叫做 XSS. ...

  6. 【编程思想】【设计模式】【行为模式Behavioral】备忘录模式Memento

    Python版 https://github.com/faif/python-patterns/blob/master/behavioral/memento.py #!/usr/bin/env pyt ...

  7. 连接opcserver时报错 connecting to OPC Server "****" CoCreateInstance 服务器运行失败

    在普通windows系统连接OPCServer可能会报这样的错,排查很长时间,OPCServer跟Client都运行正常,点号录入也正常. 最后发现,其实是OPCServer 与OPCClient 权 ...

  8. 【经验分享】win10 cmake 构建 Tengine 工程

      欢迎关注我的公众号 [极智视界],回复001获取Google编程规范   O_o   >_<   o_O   O_o   ~_~   o_O   本教程详细记录了在 win10 环境中 ...

  9. scrapy爬取招聘网站,items转换成dict遇到的问题

    pipelines代码 1 import json 2 3 class TencentJsonPipeline(object): 4 def __init__(self): 5 self.file = ...

  10. 开发中的PR和MR

    GitLab的是Pull Request缩写.GitHub则是Merge Request也就是MR. 当项目下载后进行更改并提交,每次过程算一次PR,一般会加入管理员审核,通过才能合并到master主 ...