Submission #1725544


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define EPS (1e-7)
#define INF 1e9

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
int vx[]={0,1,0,-1};
int vy[]={1,0,-1,0};

int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,1,-1,1,-1};

const ll mod=1000000000+7;
const int MAX_N=300;

int solve(long long x){
	string sx=to_string(x);
	int res=7;
	for(int i=0;i<sx.size()-1;i++){
		for(int j=0;j<i;j++){
			res*=8;
		}
	}

	int sum=1;
	bool judge=false;
	for(int i=0;i<sx.size();i++){
		int num=sx[i]-'0';
		if(!judge){
			if(i==0){
				if(num<4)sum*=num;
				else if(num==4){
					judge=true;
					sum*=num-1;
				}else if(num<9){
					sum*=num-1;
				}else if(num==9){
					judge=true;
					sum*=num-2;
				}
			}else{
				if(num<4)sum*=num+1;
				else if(num==4){
					judge=true;
					sum*=num;
				}else if(num<9){
					sum*=num;
				}else if(num==9){
					judge=true;
					sum*=num-1;
				}
			}
		}else{
			sum*=8;
		}
	}
	return res+sum;
}

int main(){
	ll a,b;
	cin>>a>>b;
	
	cout<<(b-solve(b))-(a-1-solve(a-1))<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User kwkm0429
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1293 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 2
WA × 2
AC × 3
WA × 13
AC × 4
WA × 35
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 1 ms 256 KB
subtask0_sample02.txt AC 1 ms 256 KB
subtask0_sample03.txt WA 1 ms 256 KB
subtask0_sample04.txt WA 1 ms 256 KB
subtask1_01.txt WA 1 ms 256 KB
subtask1_02.txt WA 1 ms 256 KB
subtask1_03.txt WA 1 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt WA 1 ms 256 KB
subtask1_06.txt WA 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt WA 1 ms 256 KB
subtask1_10.txt WA 1 ms 256 KB
subtask1_11.txt WA 1 ms 256 KB
subtask1_12.txt WA 1 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask2_01.txt WA 1 ms 256 KB
subtask2_02.txt WA 1 ms 256 KB
subtask2_03.txt WA 1 ms 256 KB
subtask2_04.txt WA 1 ms 256 KB
subtask2_05.txt WA 1 ms 256 KB
subtask2_06.txt WA 1 ms 256 KB
subtask2_07.txt WA 1 ms 256 KB
subtask2_08.txt WA 1 ms 256 KB
subtask2_09.txt WA 1 ms 256 KB
subtask2_10.txt WA 1 ms 256 KB
subtask2_11.txt WA 1 ms 256 KB
subtask2_12.txt WA 1 ms 256 KB
subtask2_13.txt AC 1 ms 256 KB
subtask2_14.txt WA 1 ms 256 KB
subtask2_15.txt WA 1 ms 256 KB
subtask2_16.txt WA 1 ms 256 KB
subtask2_17.txt WA 1 ms 256 KB
subtask2_18.txt WA 1 ms 256 KB
subtask2_19.txt WA 1 ms 256 KB
subtask2_20.txt WA 1 ms 256 KB
subtask2_21.txt WA 1 ms 256 KB
subtask2_22.txt WA 1 ms 256 KB