zoukankan      html  css  js  c++  java
  • 【HackerRank】 Find Digits

    Find Digits

    Problem Statement

    Given a number you have to print how many digits in that number exactly divides that number.

    Input format

    The first line contains T (number of test cases followed by t lines each containing n

    Constraints
    1 <=T <= 15
    0 < N < 1010

    Output Format
    Number of digits in that number exactly divides that number.


    题解:

     1 import java.io.*;
     2 import java.util.*;
     3 
     4 
     5 public class Solution {
     6 
     7     public static void main(String[] args) {
     8         Scanner in = new Scanner(System.in);
     9         int t = in.nextInt();
    10         for(int i = 0; i < t; i++){
    11             Long num = in.nextLong();
    12             System.out.println(FindDigits(num));
    13         }
    14     }
    15     
    16     private static int FindDigits(Long num){
    17         
    18          //Write code to solve each of the test over here
    19          Long copy_num = num;
    20          int count = 0;
    21          while(num>0){
    22              Long digit = num%10;
    23              if(digit!=0 && copy_num%digit==0)
    24                  count++;
    25              num /= 10;
    26          }
    27          return count;
    28     }
    29     
    30     
    31 }
  • 相关阅读:
    准备工作
    个人作业感言
    年度书单-结对编程
    案例分析
    编程作业_词频统计
    2、阅读任务
    1、准备工作
    个人作业获奖感言
    3 20210405-1 案例分析作业
    202103226-1 编程作业
  • 原文地址:https://www.cnblogs.com/sunshineatnoon/p/3877311.html
Copyright © 2011-2022 走看看