关闭

CodeForces 260B Ancient Prophesy 模拟

标签: codeforces
238人阅读 评论(0) 收藏 举报
分类:

给出字符串找出符合"dd-mm-yyyy"格式的2013~2015年的出现次数最多的日期。

一开始写成1~len-10怒跪。。。

只要每位试一下就好了。

#include <cstdio>
#include <cctype>
#include <cstring>
char str[100005];
int month[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int cnt[4][16][32];
int main() {
	int d = -1, m = -1, y = -1, id, ansd = 0;
	scanf("%s", str);
	int len=strlen(str);
	for(int i=0;i<len-9;i++) {
		if(isdigit(str[i])&&isdigit(str[i+1])&&
			isdigit(str[i+3])&&isdigit(str[i+4])&&
			isdigit(str[i+6])&&isdigit(str[i+7])&&
			isdigit(str[i+8])&&isdigit(str[i+9])&&
			str[i+2]=='-'&&str[i+5]=='-') {
			d=(str[i+0]-48)*10+str[i+1]-48;
			m=(str[i+3]-48)*10+str[i+4]-48;
			y=(((str[i+6]-48)*10+str[i+7]-48)*10+str[i+8]-48)*10+str[i+9]-48;
			if(m>12||y<2013||y>2015||m<1)continue;
			if(d>month[m]||d<1)continue;
			if(++cnt[y-2013][m][d]>ansd)ansd=cnt[y-2013][m][d],id=i;
		}
	}
	for(int i=0;i<10;i++)putchar(str[id+i]);
	return 0;
}


B. Ancient Prophesy
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters "-".

We'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy that is the date's record in the format "dd-mm-yyyy". We'll say that the number of the date's occurrences is the number of such substrings in the Prophesy. For example, the Prophesy "0012-10-2012-10-2012" mentions date 12-10-2012 twice (first time as "0012-10-2012-10-2012", second time as "0012-10-2012-10-2012").

The date of the Apocalypse is such correct date that the number of times it is mentioned in the Prophesy is strictly larger than that of any other correct date.

A date is correct if the year lies in the range from 2013 to 2015, the month is from 1 to 12, and the number of the day is strictly more than a zero and doesn't exceed the number of days in the current month. Note that a date is written in the format "dd-mm-yyyy", that means that leading zeroes may be added to the numbers of the months or days if needed. In other words, date "1-1-2013" isn't recorded in the format "dd-mm-yyyy", and date "01-01-2013" is recorded in it.

Notice, that any year between 2013 and 2015 is not a leap year.

Input

The first line contains the Prophesy: a non-empty string that only consists of digits and characters "-". The length of the Prophesy doesn't exceed 105 characters.

Output

In a single line print the date of the Apocalypse. It is guaranteed that such date exists and is unique.

Sample test(s)
input
777-444---21-12-2013-12-2013-12-2013---444-777
output
13-12-2013


0
0

猜你在找
【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐(算法+实战)--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:114656次
    • 积分:4717
    • 等级:
    • 排名:第6101名
    • 原创:371篇
    • 转载:7篇
    • 译文:0篇
    • 评论:4条
    神犇们的后庭院
    wzq_QwQ http://blog.csdn.net/wzq_QwQ
    vmurder http://blog.csdn.net/vmurder/
    PoPoQQQ http://blog.csdn.net/popoqqq/
    YJQ神犇 http://tarawa.github.io/
    ?神?论文
    http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf