【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 }
复制代码

 

posted @   SunshineAtNoon  阅读(373)  评论(0编辑  收藏  举报
编辑推荐:
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· 没有源码,如何修改代码逻辑?
阅读排行:
· 全程不用写代码,我用AI程序员写了一个飞机大战
· DeepSeek 开源周回顾「GitHub 热点速览」
· MongoDB 8.0这个新功能碉堡了,比商业数据库还牛
· 记一次.NET内存居高不下排查解决与启示
· 白话解读 Dapr 1.15:你的「微服务管家」又秀新绝活了
点击右上角即可分享
微信分享提示