hdu2089 不要62

不要62

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13988    Accepted Submission(s): 4491


Problem Description
杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。
杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。
不吉利的数字为所有含有4或62的号码。例如:
62315 73418 88914
都属于不吉利号码。但是,61152虽然含有6和2,但不是62连号,所以不属于不吉利数字之列。
你的任务是,对于每次给出的一个牌照区间号,推断出交管局今次又要实际上给多少辆新的士车上牌照了。
 

Input
输入的都是整数对n、m(0<n≤m<1000000),如果遇到都是0的整数对,则输入结束。
 

Output
对于每个整数对,输出一个不含有不吉利数字的统计个数,该数值占一行位置。
 

Sample Input
  
1 100 0 0
 

Sample Output
  
80
 

Author
qianneng
 

Source
 

Recommend
lcy
 


Statistic |  Submit |  Discuss |  Note



第一次做数位dp。
所以就挑一道最简单的来做。
dp[i][j]代表前i位且第i位为j的符合个数(后面的全排列):

#include<stdio.h>
#include<string.h>
int dp[10][12];
int n,m;
int a[10];

int tran(int nn,int aa[])
{
	int po = 0;
		while(nn)
		{
			aa[po++] = nn%10;
			nn = nn/10;
		}
		return po-1;
}

int DFS(int len,int ss,int flag,int doing,int ab)  //ab代表上一位是否等于6
{
	if(len<0)return flag;
	if(!doing && dp[len+1][ss]!=-1)
		return dp[len+1][ss];
	int end = doing?a[len]:9;
	int ans = 0;
	for(int i=0;i<=end;i++)  //注意这里可以等于最后一个end因为我要用这个来判断下一个doing是1,0就是判断下一个是不是这个数的开始第一个数
	{
		if(i!=4 && (i!=2 || !ab))
			ans+=DFS(len-1,i,flag,doing&&end==i,i==6);
	}
	if(!doing)dp[len+1][ss] = ans;
	return ans;
}
int main()
{
	memset(dp,-1,sizeof(dp));
	while(scanf("%d%d",&n,&m) && n+m!=0)
	{
		int alen,mm=0;
		alen = tran(n-1,a);
		mm+=DFS(alen,0,1,1,0);
		alen = tran(m,a);
		mm=DFS(alen,0,1,1,0)-mm;
	    printf("%d\n",mm);
	}
	return 0;

}




### HDU OJ 2089 Problem Solution and Description The problem titled "不高兴的津津" (Unhappy Jinjin) involves simulating a scenario where one needs to calculate the number of days an individual named Jinjin feels unhappy based on certain conditions related to her daily activities. #### Problem Statement Given a series of integers representing different aspects of Jinjin's day, such as homework completion status, weather condition, etc., determine how many days she was not happy during a given period. Each integer corresponds to whether specific events occurred which could affect her mood positively or negatively[^1]. #### Input Format Input consists of multiple sets; each set starts with two positive integers n and m separated by spaces, indicating the total number of days considered and types of influencing factors respectively. Following lines contain details about these influences over those days until all cases are processed when both numbers become zero simultaneously. #### Output Requirement For every dataset provided, output should be formatted according to sample outputs shown below: ```plaintext Case k: The maximum times of appearance is x, the color is c. ``` Where `k` represents case index starting from 1, while `x` stands for frequency count and `c` denotes associated attribute like colors mentioned earlier but adapted accordingly here depending upon context i.e., reasons causing unhappiness instead[^2]. #### Sample Code Implementation Below demonstrates a simple approach using Python language to solve this particular challenge efficiently without unnecessary complexity: ```python def main(): import sys input = sys.stdin.read().strip() datasets = input.split('\n\n') results = [] for idx, ds in enumerate(datasets[:-1], start=1): data = list(map(int, ds.strip().split())) n, m = data[:2] if n == 0 and m == 0: break counts = {} for _ in range(m): factor_counts = dict(zip(data[2::2], data[3::2])) for key, value in factor_counts.items(): try: counts[key] += value except KeyError: counts[key] = value max_key = max(counts, key=lambda k:counts[k]) result_line = f'Case {idx}: The maximum times of appearance is {counts[max_key]}, the reason is {max_key}.' results.append(result_line) print("\n".join(results)) if __name__ == '__main__': main() ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值