c2c-translator/data/geeks_for_geeks_dataset/java/GIVEN_LARGE_NUMBER_CHECK_SUBSEQUENCE_DIGITS_DIVISIBLE_8.java
// Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//

import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class GIVEN_LARGE_NUMBER_CHECK_SUBSEQUENCE_DIGITS_DIVISIBLE_8{
static boolean f_gold ( String str ) {
  int i , j , k , l = str . length ( ) ;
  int arr [ ] = new int [ l ] ;
  for ( i = 0 ;
  i < l ;
  i ++ ) {
    for ( j = i ;
    j < l ;
    j ++ ) {
      for ( k = j ;
      k < l ;
      k ++ ) {
        if ( arr [ i ] % 8 == 0 ) return true ;
        else if ( ( arr [ i ] * 10 + arr [ j ] ) % 8 == 0 && i != j ) return true ;
        else if ( ( arr [ i ] * 100 + arr [ j ] * 10 + arr [ k ] ) % 8 == 0 && i != j && j != k && i != k ) return true ;
      }
    }
  }
  return false ;
}


//TOFILL

public static void main(String args[]) {
    int n_success = 0;
    List<String> param0 = new ArrayList<>();
    param0.add("1787075866");
    param0.add("8");
    param0.add("1110101110111");
    param0.add("6673177113");
    param0.add("7");
    param0.add("000001");
    param0.add("dbxMF");
    param0.add("71733");
    param0.add("01101101100");
    param0.add("");
    for(int i = 0; i < param0.size(); ++i)
    {
        if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
        {
            n_success+=1;
        }
    }
    System.out.println("#Results:" + n_success + ", " + param0.size());
}
}