Skip to main content

Count Digits (DSA)

DSA 

Find the number of digits of ‘n’ that evenly divide ‘n’.

The objective is to calculate the modulus of each digit in the number n, then determine if that digit divides n. Consequently, increase the counter. Keep in mind that the digit may be 0, therefore handle such scenario.

int countDigits(int n){
    int count=0;
    for(int i=n; i>0; i=i/10)
    {
        int temp = i%10;
        if(temp>0 && n%temp==0)
         count++;
    }
     
    return count;
}


Comments

Post a Comment

Popular posts from this blog

Sum of All Divisors from 1 to N

Introduction In this blog, we will discuss the problem of finding the sum of all divisors from 1 to N. This problem is an observation-based problem with a tint of simple mathematics. We will explore different approaches and algorithms to solve this problem efficiently. Understanding the Problem The problem statement is self-explanatory. Given a number N, we need to find the sum of all its divisors from 1 to N. Brute Force Approach Initially, we can think of solving this problem using a brute force approach. We can iterate from 1 to N and check if each number is a divisor of N. If it is a divisor, we add it to the sum. However, this approach is not optimal for large values of N. Optimized Approach To optimize the solution, we can use a contribution technique. Instead of finding all the divisors individually, we can find the contribution of each number in the sum. Let's understand this technique with an example: For N = 8: 1 can contribute to all numbers from 1 to 8 2 can contribut...
Post a Comment
Read more

“Emerging AI: The Future of Technology Unveiled!”

  Today, we’re diving deep into the cutting-edge world of Artificial Intelligence — specifically, exploring the latest and most exciting developments in the field. Get ready to witness the wonders of Emerging AI as we unravel how it’s reshaping our world and what we can expect in the near future. If you’re as fascinated as I am about the potential of AI, don’t forget to hit that like button and subscribe, so you won’t miss any of our tech explorations. Let’s jump right in! AI-Powered Healthcare One of the most revolutionary applications of Emerging AI is in healthcare. From diagnosing diseases with unprecedented accuracy to assisting in surgeries, AI is transforming patient care. Imagine a world where AI-driven medical imaging can detect diseases at earlier stages, potentially saving countless lives. Today, we’ll witness some incredible AI-powered healthcare solutions that are making waves in the medical community. AI and Creative Industries AI’s capabilities are not limited to tec...
Post a Comment
Read more

Tic Tac Toe Offline (2 player) - Privacy Policy

  Privacy Policy This privacy policy applies to the Tic Tac Toe Offline (2 player) app (hereby referred to as "Application") for mobile devices that was created by Ayush Agrawal (hereby referred to as "Service Provider") as a Free service. This service is intended for use "AS IS". Information Collection and Use The Application collects information when you download and use it. This information may include information such as Your device's Internet Protocol address (e.g. IP address) The pages of the Application that you visit, the time and date of your visit, the time spent on those pages The time spent on the Application The operating system you use on your mobile device The Application does not gather precise information about the location of your mobile device. The Service Provider may use the information you provided to contact you from time to time to provide you with important information, required notices and marketing promotions. For a better ex...
Post a Comment
Read more