Submission #163922


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

char a_[22],b_[22];
char a[22],b[22];
int al,bl,ma;
long long dp[22][2][2][2];

long long solve(int s,int t,int u,int v)
{
  long long res = 0;
  if( s == ma ) return v;
  if( dp[s][t][u][v]  >= 0) return dp[s][t][u][v];
  for( int i = 0; i <= 9; i++ ) {
    if( t ) if(i+'0' < a[s]) continue;
    if( u ) if(i+'0' > b[s]) continue;
    //printf("%d %d %d %d\n",s,t&&a[s]==i+'0',u&&b[s]==i+'0',i);
    res = res+solve(s+1,t&&a[s]==i+'0',u&&b[s]==i+'0',v||(i==4||i==9));
  }
  return dp[s][t][u][v] = res;
}

int main(void)
{
  scanf("%s%s",a_,b_);
  al = strlen(a_);
  bl = strlen(b_);
  ma = max(al,bl);
  for( int i = 0; i < ma; i++ ) {
    if( al-(ma-i) >= 0 ) a[i] = a_[al-(ma-i)];
    else a[i] = '0';
    if( bl-(ma-i) >= 0 ) b[i] = b_[bl-(ma-i)];
    else b[i] = '0';
  }
  memset(dp,-1,sizeof(dp));
  printf("%lld\n",solve(0,1,1,0));
  return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User roxion1377
Language C++ (G++ 4.6.4)
Score 100
Code Size 978 Byte
Status AC
Exec Time 26 ms
Memory 796 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 16
AC × 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 AC 20 ms 792 KB
subtask0_sample02.txt AC 24 ms 668 KB
subtask0_sample03.txt AC 23 ms 796 KB
subtask0_sample04.txt AC 24 ms 780 KB
subtask1_01.txt AC 23 ms 792 KB
subtask1_02.txt AC 24 ms 700 KB
subtask1_03.txt AC 23 ms 792 KB
subtask1_04.txt AC 22 ms 796 KB
subtask1_05.txt AC 22 ms 788 KB
subtask1_06.txt AC 23 ms 796 KB
subtask1_07.txt AC 23 ms 784 KB
subtask1_08.txt AC 21 ms 788 KB
subtask1_09.txt AC 23 ms 792 KB
subtask1_10.txt AC 25 ms 672 KB
subtask1_11.txt AC 24 ms 788 KB
subtask1_12.txt AC 22 ms 792 KB
subtask1_13.txt AC 23 ms 788 KB
subtask2_01.txt AC 25 ms 692 KB
subtask2_02.txt AC 25 ms 792 KB
subtask2_03.txt AC 23 ms 792 KB
subtask2_04.txt AC 24 ms 792 KB
subtask2_05.txt AC 21 ms 788 KB
subtask2_06.txt AC 25 ms 664 KB
subtask2_07.txt AC 23 ms 780 KB
subtask2_08.txt AC 23 ms 792 KB
subtask2_09.txt AC 20 ms 788 KB
subtask2_10.txt AC 25 ms 696 KB
subtask2_11.txt AC 24 ms 796 KB
subtask2_12.txt AC 24 ms 792 KB
subtask2_13.txt AC 23 ms 708 KB
subtask2_14.txt AC 22 ms 792 KB
subtask2_15.txt AC 23 ms 796 KB
subtask2_16.txt AC 23 ms 796 KB
subtask2_17.txt AC 26 ms 732 KB
subtask2_18.txt AC 22 ms 796 KB
subtask2_19.txt AC 22 ms 784 KB
subtask2_20.txt AC 23 ms 796 KB
subtask2_21.txt AC 22 ms 796 KB
subtask2_22.txt AC 22 ms 796 KB