CodeForces 260B Ancient Prophesy 模拟

原创 2015年11月17日 21:24:07

给出字符串找出符合"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


版权声明:转载请注明 http://blog.csdn.net/huanghongxun/

相关文章推荐

【CodeForces 611D】Ancient Prophesy

智障模拟。。 我也是智障。。 下面傻逼代码没有过。。 #include using namespace std; #define maxn 100100 char s[maxn]; int le...

Codeforces Round #260 (Div. 2) A,B,C

题目链接:Codeforces Round #260 (Div. 2) A。 按价格从小到大排序 若质量存在 前者比后者小,Poor Alex。反之你Happy Alex。注意n==1的时候输出P...

Codeforces Round #260 (Div. 1)B题(字典树+DFS+博弈)

B. A Lot of Games time limit per test 1 second memory limit per test 256 megabytes ...

Codeforces Round #260 (Div. 2)-A,B,C

A. Laptops time limit per test 1 second memory limit per test 256 megabytes input standa...

Codeforces Round #260 (Div. 2) B (数论)

 题目: B. Fedya and Maths time limit per test 1 second memory limit per test 256 m...

Codeforces Round #260 (Div. 2) B. Fedya and Maths

B. Fedya and Maths time limit per test 1 second memory limit per test 256 megabytes ...

Codeforces Round #344 (Div. 2) B. Print Check (模拟)

B. Print Check time limit per test 1 second memory limit per test 256 megabytes input standard...

CodeForces 1B. Spreadsheets(模拟)

CodeForces 1B. Spreadsheets(模拟)

CodeForces - 665B Shopping(模拟)

题目: B. Shopping time limit per test 1 second memory limit per test 256 megabytes ...

Codeforces Round #202 (Div. 2)B. Color the Fence(贪心,模拟)

B. Color the Fencetime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inp...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)