Submission #1989271


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i = 0;i < n;i++)

int dp[20][2];
int solve(char a[20]){
	fill((int*)dp, (int*)(dp+20), 0);
	int n = strlen(a);
	
	dp[0][0] = 1;
	rep(i,n)rep(j,2){
		int D = a[i]-'0';
		for(int d = 0;d <= (j ? 9 : D);d++){
			if(d == 4 || d == 9)continue;
			dp[i+1][j || (d < D)] += dp[i][j];
		}
	}
	int ans = dp[n][0]+dp[n][1];
	printf("%d\n", ans);
	return ans;
}

signed main(){
	int a, b;
	char stra[20], strb[20];
	scanf("%lld%lld", &a, &b);
	sprintf(stra, "%lld", a-1);
	sprintf(strb, "%lld", b);
	int ans = solve(strb) - solve(stra);
	printf("%lld\n", (b-a)-ans+1);
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘long long int solve(char*)’:
./Main.cpp:20:20: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
  printf("%d\n", ans);
                    ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:27:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &a, &b);
                           ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 4
WA × 16
WA × 39
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 WA 1 ms 256 KB
subtask0_sample02.txt WA 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 WA 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 2 ms 384 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 WA 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