杭电oj2089
2017-11-03 23:12
246 查看
#include<iostream>
#include<cstdio>
using namespace std;
#define ll long long
int main(void)
{
ll a,b,c,t,e;
int f,k,l,m;
while(cin>>a>>b&&(a||b)){
c = b-a+1;
f = 0;
for(int i = a;i<=b;++i){
f = m = 0;
t = e = i;
while(t>0){
f = t%10;
t /= 10;
if(f == 4)
break;
}
if(f == 4){
c -= 1;
break;
}
while(e>10){
k = e%10;
l = e%100/10;
if(l == 6&&k == 2){
m = 1;
break;
}
e = e/10;
}
if(m == 1){
c -= 1;
break;
}
}
cout<<c<<endl;
}
return 0;}
//以上带码时间会超过
//下面代码才ok
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define ll long long
int m[1000001]={0};
void p(){
int t;
for( int i = 1;i<=1000000;++i){
t = i;
while(t>0){
if(t%10 == 4||t%100 == 62)
m[i]++;
t /= 10;
}
}
}
int main(void)
{
int a,b,t,c;
p();
while(scanf("%d%d",&a,&b) != EOF&&(a||b)){
c = b-a+1;
for(int i = a;i<=b;++i){
if(m[i] != 0)
c -= 1;
}
cout<<c<<endl;
}
return 0;}
链接http://acm.hdu.edu.cn/showproblem.php?pid=2089
#include<cstdio>
using namespace std;
#define ll long long
int main(void)
{
ll a,b,c,t,e;
int f,k,l,m;
while(cin>>a>>b&&(a||b)){
c = b-a+1;
f = 0;
for(int i = a;i<=b;++i){
f = m = 0;
t = e = i;
while(t>0){
f = t%10;
t /= 10;
if(f == 4)
break;
}
if(f == 4){
c -= 1;
break;
}
while(e>10){
k = e%10;
l = e%100/10;
if(l == 6&&k == 2){
m = 1;
break;
}
e = e/10;
}
if(m == 1){
c -= 1;
break;
}
}
cout<<c<<endl;
}
return 0;}
//以上带码时间会超过
//下面代码才ok
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define ll long long
int m[1000001]={0};
void p(){
int t;
for( int i = 1;i<=1000000;++i){
t = i;
while(t>0){
if(t%10 == 4||t%100 == 62)
m[i]++;
t /= 10;
}
}
}
int main(void)
{
int a,b,t,c;
p();
while(scanf("%d%d",&a,&b) != EOF&&(a||b)){
c = b-a+1;
for(int i = a;i<=b;++i){
if(m[i] != 0)
c -= 1;
}
cout<<c<<endl;
}
return 0;}
链接http://acm.hdu.edu.cn/showproblem.php?pid=2089
相关文章推荐
- 杭电OJ题 Goldbach's Conjecture解题报告
- 杭电2056 Rectangles
- 杭电1248寒冰王座问题,对比网上代码,虽然AC了,但是代码太过复杂了
- 杭电 1425
- 杭电ACM2001java做法
- 杭电ACM开门人与关门人
- 杭电OJ题1719 Friend 解题报告
- 杭电ACM2009java做法
- 杭电oj2680 Choose the best route(did逆图)
- 杭电ACM 2047 阿牛的EOF牛肉串
- 杭电ACM1203——I NEED A OFFER!~~01背包
- 杭电 2087 剪花布条
- 杭电2673
- 杭电oj1062 Text Reverse
- 杭电题目分类
- 杭电1280
- 杭电里面遇见的几何的分割问题
- 杭电2012 C++
- 杭电ACM HDOJ 2143 box
- 杭电ACM2021java做法