hdu5611 Baby Ming and phone number
来源:互联网 发布:算法导论实现 编辑:程序博客网 时间:2024/06/05 03:52
#include <stdio.h>
#include <string.h>
const int h1[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int h2[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int tra(char c) { return c - '0'; }
int main()
{
// freopen("in.txt","r",stdin);
int i, T, n, a0, yea, mon, day;
__int64 a, b, ans;
char ph[15];
scanf("%d", &T);
while(T--)
{
scanf("%d", &n);
a0 = 0;
scanf("%I64d%I64d", &a, &b);
for(i = 0; i < n; i ++)
{
scanf("%s", &ph);
yea = tra(ph[3]) * 1000 + tra(ph[4]) * 100 + tra(ph[5]) * 10 + tra(ph[6]);
mon = tra(ph[7]) * 10 + tra(ph[8]);
day = tra(ph[9]) * 10 + tra(ph[10]);
if(ph[6] == ph[7] && ph[7] == ph[8] && ph[8] == ph[9] && ph[9] == ph[10]) a0 ++;
else if((ph[7] - ph[6] == 1) && (ph[8] - ph[7] == 1) && (ph[9] - ph[8] == 1) && (ph[10] - ph[9] == 1) ) a0 ++;
else if((ph[6] - ph[7] == 1) && (ph[7] - ph[8] == 1) && (ph[8] - ph[9] == 1) && (ph[9] - ph[10] == 1) ) a0 ++;
else
{
if(yea >= 1980 && yea <= 2016)
{
if(mon >= 1 && mon <= 12)
{
if((yea % 400 == 0) || (yea % 4 == 0 && yea % 100 != 0))
{
if(day >= 1 && day <= h2[mon]) a0 ++;
}
else
{
if(day >= 1 && day <= h1[mon]) a0 ++;
}
}
}
}
}
ans = a0 * a + (n - a0) * b;
printf("%I64d\n", ans);
}
return 0;
#include <string.h>
const int h1[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int h2[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int tra(char c) { return c - '0'; }
int main()
{
// freopen("in.txt","r",stdin);
int i, T, n, a0, yea, mon, day;
__int64 a, b, ans;
char ph[15];
scanf("%d", &T);
while(T--)
{
scanf("%d", &n);
a0 = 0;
scanf("%I64d%I64d", &a, &b);
for(i = 0; i < n; i ++)
{
scanf("%s", &ph);
yea = tra(ph[3]) * 1000 + tra(ph[4]) * 100 + tra(ph[5]) * 10 + tra(ph[6]);
mon = tra(ph[7]) * 10 + tra(ph[8]);
day = tra(ph[9]) * 10 + tra(ph[10]);
if(ph[6] == ph[7] && ph[7] == ph[8] && ph[8] == ph[9] && ph[9] == ph[10]) a0 ++;
else if((ph[7] - ph[6] == 1) && (ph[8] - ph[7] == 1) && (ph[9] - ph[8] == 1) && (ph[10] - ph[9] == 1) ) a0 ++;
else if((ph[6] - ph[7] == 1) && (ph[7] - ph[8] == 1) && (ph[8] - ph[9] == 1) && (ph[9] - ph[10] == 1) ) a0 ++;
else
{
if(yea >= 1980 && yea <= 2016)
{
if(mon >= 1 && mon <= 12)
{
if((yea % 400 == 0) || (yea % 4 == 0 && yea % 100 != 0))
{
if(day >= 1 && day <= h2[mon]) a0 ++;
}
else
{
if(day >= 1 && day <= h1[mon]) a0 ++;
}
}
}
}
}
ans = a0 * a + (n - a0) * b;
printf("%I64d\n", ans);
}
return 0;
}
心得:握日,a,b,ans都是__int64型,本来都想放弃了。。。
0 0
- hdu5611 Baby Ming and phone number
- HDU5611 Baby Ming and phone number 水题
- Baby Ming and phone number(BC)
- HDU 5611: Baby Ming and phone number
- 5611 Baby Ming and phone number
- HDOJ 5611 Baby Ming and phone number
- 【Best Coder】Baby Ming and phone number(水)
- hdoj 5611 Baby Ming and phone number 【模拟】
- HDOJ 5611 Baby Ming and phone number(模拟)
- HDOJ 5611 Baby Ming and phone number (模拟)
- hdoj Baby Ming and phone number 5611 (简单判断)
- HDU 5611 Baby Ming and phone number(模拟)
- hdu 5611 /BC 69B Baby Ming and phone number
- HDOJ 5611-Baby Ming and phone number【模拟】
- HDU-5611 Baby Ming and phone number(模拟)
- BestCoder #69 Baby Ming and phone number(HDOJ5611)
- HDU 5611 Baby Ming and phone number(字符串模拟)
- Hdu 5611 Baby Ming and phone number【日期计算等等】
- poj 3320 Jessica's Reading Problem
- Qualcomm Atheros Device [168c:0041] (rev 20) ubuntu wifi driver
- App架构设计:接口设计
- Listview焦点问题
- 2015年第六届蓝桥杯C/C++程序设计本科B组省赛 九数组分数(代码填空)
- hdu5611 Baby Ming and phone number
- 策略访问模式
- 进程控制块(PCB)的结构
- matlab中如何添加图片,如何对图片进行读取
- C++:泛型编程priority_queue(合并果子)
- 计算机视觉领域的vision guys(按师承关系)
- poj1502 MPI Maelstrom(最短路)
- 浅谈HTTP中Get与Post的区别
- CPU