Submission #1712017
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <math.h>
#include <limits.h>
#define swap(type,a,b) do{type t=a;a=b;b=t;}while(0);
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define ll long long
#define INF 100000000
#define MOD 1000000007
#define SIZE 100005
#define FOR(i,a,n) for(i=(a);i<(n);i++)
int comp(const void* a,const void* b){
return *(int*)a-*(int*)b;
}
ll memo[20][2][2];
int L;
ll dfs(char str[],int a,int b,int c){
int i;
ll res=0;
if(a==L) return b;
if(memo[a][b][c]>=0) return memo[a][b][c];
FOR(i,0,10){
if(c&&i>str[a]-'0') break;
res+=dfs(str,a+1,b||(i==4||i==9),c&&i==(str[a]-'0'));
}
return (memo[a][b][c]=res);
}
char str[20];
int main(void)
{
int i;
ll n1,n2;
scanf("%s",str);
L=strlen(str);
for(i=L-1;i>=0;i--){
if(str[i]=='0') str[i]='9';
else{
str[i]=str[i]-1;
break;
}
}
memset(memo,-1,sizeof(memo));
n1=dfs(str,0,0,1);
scanf("%s",str);
L=strlen(str);
memset(memo,-1,sizeof(memo));
n2=dfs(str,0,0,1);
printf("%lld\n",n2-n1);
return 0;
}
Submission Info
Submission Time
2017-10-26 09:15:52+0900
Task
D - 禁止された数字
User
trainstation
Language
C (GCC 5.4.1)
Score
100
Code Size
1126 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:36:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",str);
^
./Main.c:47:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",str);
^
Judge Result
Set Name
Sample
Subtask1
Subtask2
Score / Max Score
0 / 0
30 / 30
70 / 70
Status
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
128 KB
subtask0_sample02.txt
AC
1 ms
128 KB
subtask0_sample03.txt
AC
1 ms
128 KB
subtask0_sample04.txt
AC
1 ms
128 KB
subtask1_01.txt
AC
1 ms
128 KB
subtask1_02.txt
AC
1 ms
128 KB
subtask1_03.txt
AC
1 ms
128 KB
subtask1_04.txt
AC
1 ms
128 KB
subtask1_05.txt
AC
1 ms
128 KB
subtask1_06.txt
AC
1 ms
128 KB
subtask1_07.txt
AC
1 ms
128 KB
subtask1_08.txt
AC
1 ms
128 KB
subtask1_09.txt
AC
1 ms
128 KB
subtask1_10.txt
AC
1 ms
128 KB
subtask1_11.txt
AC
1 ms
128 KB
subtask1_12.txt
AC
1 ms
128 KB
subtask1_13.txt
AC
1 ms
128 KB
subtask2_01.txt
AC
1 ms
128 KB
subtask2_02.txt
AC
1 ms
128 KB
subtask2_03.txt
AC
1 ms
128 KB
subtask2_04.txt
AC
1 ms
128 KB
subtask2_05.txt
AC
1 ms
128 KB
subtask2_06.txt
AC
1 ms
128 KB
subtask2_07.txt
AC
1 ms
128 KB
subtask2_08.txt
AC
1 ms
128 KB
subtask2_09.txt
AC
1 ms
128 KB
subtask2_10.txt
AC
1 ms
128 KB
subtask2_11.txt
AC
1 ms
128 KB
subtask2_12.txt
AC
1 ms
128 KB
subtask2_13.txt
AC
1 ms
128 KB
subtask2_14.txt
AC
1 ms
128 KB
subtask2_15.txt
AC
1 ms
128 KB
subtask2_16.txt
AC
1 ms
128 KB
subtask2_17.txt
AC
1 ms
128 KB
subtask2_18.txt
AC
1 ms
128 KB
subtask2_19.txt
AC
1 ms
128 KB
subtask2_20.txt
AC
1 ms
128 KB
subtask2_21.txt
AC
1 ms
128 KB
subtask2_22.txt
AC
1 ms
128 KB