1.题目:不要62
杭州人称那些傻乎乎粘嗒嗒的人为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
代码:
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int maxn =1e2+100;
int dp[maxn][2];
int a[maxn];
int dfs(int pos,int pre,int sta,int limit)
{
if(pos==0) return 1;
if(!limit&&dp[pos][sta]!=-1) return dp[pos][sta];
int up=limit?a[pos]:9;
int sum=0;
for(int i=0;i<=up;i++)
{
if(pre==6&&i==2) continue;
if(i==4) continue;
sum+=dfs(pos-1,i,i==6,limit&&i==a[pos]);
}
if(!limit) dp[pos][sta]=sum;
return sum;
}
int solve(int x)
{
int tot=0;
while(x)
{
a[++tot]=x%10;
x/=10;
}
return dfs(tot,-1,0,1);
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
memset(dp,-1,sizeof(dp));
if(n==0&&m==0)
{
break;
}
printf("%d\n",solve(m)-solve(n-1));
}
return 0;
}
2 题目:f(x)
For a decimal number x with n digits (A nA n-1A n-2 ... A 2A 1), we define its weight as F(x) = A n * 2 n-1 + A n-1 * 2 n-2 + ... + A 2 * 2 + A 1 * 1. Now you are given two numbers A and B, please calculate how many numbers are there between 0 and B, inclusive, whose weight is no more than F(A).
Input
The first line has a number T (T <= 10000) , indicating the number of test cases.
For each test case, there are two numbers A and B (0 <= A,B < 10 9)
Output
For every case,you should output "Case #t: " at first, without quotes. The t is the case number starting from 1. Then output the answer.
Sample Input
3 0 100 1 10 5 100
Sample Output
Case #1: 1 Case #2: 2 Case #3: 13
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<string>
using namespace std;
const int N=1e4+5;
int dp[12][N];
int f(int x)
{
if(x==0) return 0;
int ans=f(x/10);
return ans*2+(x%10);
}
int all;
int a[12];
int dfs(int pos,int sum,bool limit)
{
if(pos==-1) {return sum<=all;}
if(sum>all) return 0;
if(!limit && dp[pos][all-sum]!=-1) return dp[pos][all-sum];
int up=limit ? a[pos] : 9;
int ans=0;
for(int i=0;i<=up;i++)
{
ans+=dfs(pos-1,sum+i*(1<<pos),limit && i==a[pos]);
}
if(!limit) dp[pos][all-sum]=ans;
return ans;
}
int solve(int x)
{
int pos=0;
while(x)
{
a[pos++]=x%10;
x/=10;
}
return dfs(pos-1,0,true);
}
int main()
{
int a,ri;
int T;
int Case=1;
scanf("%d",&T);
memset(dp,-1,sizeof dp);
while(T)
{
scanf("%d%d",&a,&ri);
all=f(a);
printf("Case #%d: %d\n",Case++,solve(ri));
}
return 0;
}