結果

問題 No.315 世界のなんとか3.5
ユーザー holeguma
提出日時 2015-12-10 00:26:07
言語 Java
(openjdk 23)
結果
AC  
実行時間 733 ms / 2,000 ms
コード長 4,654 bytes
コンパイル時間 2,558 ms
コンパイル使用メモリ 78,860 KB
実行使用メモリ 45,568 KB
最終ジャッジ日時 2024-09-15 06:54:04
合計ジャッジ時間 15,381 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;
public class Main{
static PrintWriter out;
static InputReader ir;
static final long MOD=(long)1e9+7;
static void solve(){
 char[] a=minusOne(ir.next().toCharArray());
 char[] b=ir.next().toCharArray();
 int p=ir.nextInt();
 out.println((calc(b,p)-calc(a,p)+MOD)%MOD);
}
public static long calc(char[] s,int p){
 int dig=Integer.toString(p).length();
 long[][][][][] dp=new long[2][2][2][3][9];
 dp[0][0][0][0][8]=1;
 for(int i=0;i<s.length;i++){
  int now=i%2,next=now^1,num=s[i]-'0';
  for(int j=0;j<2;j++){
   for(int k=0;k<=(j==0?num:9);k++){
    for(int l=0;l<2;l++){
     int next_j=j|((k==num)?0:1),next_l=l|((k==3)?1:0);
     for(int m3=0;m3<3;m3++){
      int nm3=(m3+k)%3;
      if(i>s.length-dig-3){
       for(int m8=0;m8<=8;m8++){
        if(i>s.length-dig){
         if(m8==0&&k==0) dp[next][next_j][next_l][nm3][0]=(dp[next][next_j][next_l][nm3][0]+dp[now][j][l][m3][0])%MOD;
         else dp[next][next_j][next_l][nm3][1]=(dp[next][next_j][next_l][nm3][1]+dp[now][j][l][m3][m8])%MOD;
        }
        else{
         int nm8=(m8+(int)Math.pow(10,s.length-dig-i)*k)%8;
         dp[next][next_j][next_l][nm3][nm8]=(dp[next][next_j][next_l][nm3][nm8]+dp[now][j][l][m3][m8])%MOD;
        }
       }
      }
      else dp[next][next_j][next_l][nm3][8]=(dp[next][next_j][next_l][nm3][8]+dp[now][j][l][m3][8])%MOD;
     }
    }
   }
  }
  for(int j=0;j<2;j++){
   for(int k=0;k<2;k++){
    for(int l=0;l<3;l++){
     Arrays.fill(dp[now][j][k][l],0);
    }
   }
  }
 }
 long ret=0;
 for(int i=0;i<2;i++){
  for(int j=0;j<2;j++){
   for(int k=0;k<3;k++){
    for(int l=0;l<=8;l++){
     if((j==1||k==0)&&l!=0) ret=(ret+dp[s.length%2][i][j][k][l])%MOD;
    }
   }
  }
 }
 return (int)(ret+(MOD-1))%MOD;
}
public static char[] minusOne(char[] s){
 char[] ret=new char[s.length];
 boolean f=false;
 for(int i=s.length-1;i>=0;i--){
  if(!f){
   if(s[i]!='0'){
    ret[i]=(char)(s[i]-1);
    f=true;
   }
   else ret[i]='9';
  }
  else ret[i]=s[i];
 }
 return ret;
}
public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}
static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;
 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }
 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 public double nextDouble(){return Double.parseDouble(next());}
 public BigInteger nextBigInteger(){return new BigInteger(next());}
 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }
 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }
 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0