Baby Ming and phone number

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1501    Accepted Submission(s): 399

Problem Description
Baby Ming collected lots of cell phone numbers, and he wants to sell them for money.

He thinks normal number can be sold for b yuan, while number with following features can be sold for a yuan.

1.The last five numbers are the same. (such as 123-4567-7777)

2.The last five numbers are successive increasing or decreasing, and the diffidence between two adjacent digits is 1. (such as 188-0002-3456)

3.The last eight numbers are a date number, the date of which is between Jar 1st, 1980 and Dec 31th, 2016. (such as 188-1888-0809,means August ninth,1888)

Baby Ming wants to know how much he can earn if he sells all the numbers.

 
Input
In the first line contains a single positive integer T, indicating number of test case.

In the second line there is a positive integer n, which means how many numbers Baby Ming has.(no two same phone number)

In the third line there are 2 positive integers a,b, which means two kinds of phone number can sell a yuan and b yuan.

In the next n lines there are n cell phone numbers.(|phone number|==11, the first number can’t be 0)

1≤T≤30,b<1000,0<a,n≤100,000

 
Output
How much Baby Nero can earn.
 
Sample Input
1
5
100000 1000
12319990212
11111111111
22222223456
10022221111
32165491212
 
Sample Output
302000
 
分步判断是否符合题意即可   休要细心,代码未ac  还有细节未处理好  先记录下来
#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#define LL long long
#define PI atan(1.0)*4
#define DD doublea
#define MAX 100100
#define mod 10007
using namespace std;
int s[MAX][15];
char s1[MAX][15];
int op1[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int op2[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int five(int x)//判断后五位
{
int i,j;
char y=s[x][6];
int flag=1;
for(i=7;i<11;i++)
{
if(s[x][i]!=y)
{
flag=0;
break;
}
}
if(flag==1) return 1;
flag=1;
for(i=7;i<11;i++)
{
if(s[x][i]!=s[x][i-1]+1)
{
flag=0;
break;
}
}
if(flag==1) return 1;
else return 0;
}
int judge(int x)//判断闰年
{
if((x%4==0&&x%100!=0)||x%400==0)
return 1;
else return 0;
}
int eight(int x) //判断后八位
{
int i,j;
int flag=1;
int sum=s[x][3];
int mouth=s[x][7]*10+s[x][8];
int day=s[x][9]*10+s[x][10];
for(i=4;i<=6;i++)
sum=sum*10+s[x][i];
if(sum<1980||sum>2016||mouth<1||mouth>12)
return 0;
if(sum==1980)
{
if(mouth<7||mouth>12)
return 0;
if(day==0||day>op1[mouth])
return 0;
}
if(judge(sum))
{
if(day==0||day>op2[mouth])
return 0;
}
if(!judge(sum))
{
if(day==0||day>op1[mouth])
return 0;
}
return 1;
}
int main()
{
int t,i,j,n,m;
LL ans,a,b;
scanf("%d",&t);
while(t--)
{
ans=0;
scanf("%d",&n);
scanf("%lld%lld",&a,&b);
for(i=1;i<=n;i++)
{
scanf("%s",s1[i]);
for(j=0;j<11;j++)
{
s[i][j]=s1[i][j]-'0';
}
}
for(i=1;i<=n;i++)
{
if(five(i))
ans+=a;
else if(eight(i))
ans+=a;
else ans+=b;
}
printf("%lld\n",ans);
}
return 0;
}

  今天又仔细看了这道题,发现昨天少考虑一种情况,题目有三个要求1、后五位数字一样   2、后五位数字连续(可以递增也可以递减  忘记考虑递减的情况了)3、后八位可以组成一个日期,日期范围是1980年01月01号到2016年12月31号

接下来就主要处理每个月份对应时间以及闰年即可

#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#define LL long long
#define PI atan(1.0)*4
#define DD doublea
#define MAX 100100
#define mod 10007
using namespace std;
int s[MAX][15];
char s1[MAX][15];
int op[13]={0,31,0,31,30,31,30,31,31,30,31,30,31};
//int op2[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int five(int x)//判断后五位
{
int i,j;
int y=s[x][6];
int flag=1;
for(i=7;i<11;i++)
{
if(s[x][i]!=y)
{
flag=0;
break;
}
}
if(flag==1) return 1;
flag=1;
for(i=7;i<11;i++)
{
if(s[x][i]!=s[x][i-1]+1)
{
flag=0;
break;
}
}
if(flag==1) return 1;
flag=1;
for(i=7;i<11;i++)
{
if(s[x][i]!=s[x][i-1]-1)
{
flag=0;
break;
}
}
if(flag==1) return 1;
else return 0;
}
int judge(int x)//判断闰年
{
if((x%4==0&&x%100!=0)||x%400==0)
return 1;
else return 0;
}
int eight(int x) //判断后八位
{
int i,j;
int flag=1;
int sum=s[x][3];
int mouth=s[x][7]*10+s[x][8];
int day=s[x][9]*10+s[x][10]; for(i=4;i<=6;i++)
sum=sum*10+s[x][i];
// printf("%d*\n",sum);
if(mouth==2)
{
if(judge(sum))
op[2]=29;
else
op[2]=28;
}
if(sum>=1980&&sum<=2016&&mouth>=1&&mouth<=12&&day>=1&&day<=op[mouth])
return 1;
else return 0;
}
int main()
{
int t,i,j,n,m;
__int64 ans,a,b;
scanf("%d",&t);
while(t--)
{
ans=0;
scanf("%d",&n);
scanf("%I64d%I64d",&a,&b);
for(i=1;i<=n;i++)
{
scanf("%s",s1[i]);
for(j=0;j<11;j++)
s[i][j]=s1[i][j]-'0';
}
for(i=1;i<=n;i++)
{
if(five(i))
ans+=a;
else if(eight(i))
ans+=a;
else ans+=b;
}
printf("%I64d\n",ans);
}
return 0;
}

  

BestCoder Round #69 (div.2)(hdu5611)的更多相关文章

  1. BestCoder Round #69 (div.2) Baby Ming and Weight lifting(hdu 5610)

    Baby Ming and Weight lifting Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K ( ...

  2. Codeforces Round #624 (Div. 3)(题解)

    Codeforces Round #624 (Div.3) 题目地址:https://codeforces.ml/contest/1311 B题:WeirdSort 题意:给出含有n个元素的数组a,和 ...

  3. Codeforces Round #219 (Div. 1)(完全)

    戳我看题目 A:给你n个数,要求尽可能多的找出匹配,如果两个数匹配,则ai*2 <= aj 排序,从中间切断,分成相等的两半后,对于较大的那一半,从大到小遍历,对于每个数在左边那组找到最大的满足 ...

  4. BestCoder Round #73 (div.2)(hdu 5630)

    Rikka with Chess Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) ...

  5. BestCoder Round #71 (div.2) (hdu 5621)

    KK's Point Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total ...

  6. BestCoder Round #71 (div.2) (hdu 5620 菲波那切数列变形)

    KK's Steel Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total ...

  7. Codeforces Round #544 (Div. 3) (补)

    D:没有注意到a==0&&b==0的情况,把自己卡崩了.对于数学公式推导一定要注意关于0的特殊情况,不可以少 #include <iostream> #include &l ...

  8. Codeforces Round #249 (Div. 2) (模拟)

    C. Cardiogram time limit per test 1 second memory limit per test 256 megabytes input standard input ...

  9. Codeforces Round #613 (Div. 2) (A-E)

    A略 直接求和最大的子序列即可(注意不能全部选中整个子序列) or #include<bits/stdc++.h> using namespace std; void solve(){ i ...

随机推荐

  1. bzoj3798: 特殊的质数

    分块打表.块内的暴力块外的打表.开始没有j>0所以WA了. #include<cstdio> #include<cmath> #include<cstring> ...

  2. bzoj3555: [Ctsc2014]企鹅QQ

    将字符串hash.不难写.然而1.注意用longlong2.数组大小注意...3.似乎别人都用的unsigned long long ?. #include<cstdio> #includ ...

  3. PHP运行模式的深入理解

    PHP运行模式有4钟:1)cgi 通用网关接口(Common Gateway Interface))2) fast-cgi 常驻 (long-live) 型的 CGI3) cli  命令行运行   ( ...

  4. Linux Watchdog Test Program

    /*********************************************************************** * Linux Watchdog Test Progr ...

  5. POJ 3259 Wormholes 虫洞(负权最短路,负环)

    题意: 给一个混合图,求判断是否有负环的存在,若有,输出YES,否则NO.有重边. 思路: 这是spfa的功能范围.一个点入队列超过n次就是有负环了.因为是混合图,所以当你跑一次spfa时发现没有负环 ...

  6. Math.trunc

  7. validator的验证

    通常喜欢这么写验证 <form method="post" data-ajax="false" action="/Shppping/PlaceO ...

  8. 【转】使用NetBeans和Eclipse开发PHP应用程序

    [51CTO独家特稿]各位用户如果单独看NetBeans和Eclipse的市场占有率,你可能会认为使用其中任何一种IDE开发PHP应用程序都没有 问题,例如: 1.NetBeans:一款开源的集成开发 ...

  9. 【原创】用python实现shell的tail操作

    在工作过程中发现监控实时刷新文件时,不是那么的任性. 故结合shell中的tail,做了一个类似tail的python脚本. 详情如下: #!/usr/bin/env python #coding=u ...

  10. Delphi 操作word 表格

    var wordApp, WordDoc, WrdSelection, wrdtable: variant; strAdd: string; wdPar,wdRange:OleVariant; iCo ...