📌  相关文章
📜  检查给定数字是否可被71整除

📅  最后修改于: 2021-05-06 20:11:03             🧑  作者: Mango

给定数字N ,任务是检查数字是否可被71整除。

例子:

方法: 71的除法检验是:

  1. 提取最后一位数字。
  2. 从除去最后一位后获得的剩余号码中减去7 *最后一位。
  3. 重复上述步骤,直到获得两位数字或零。
  4. 如果两位数可以被71整除或为0,那么原始数字也可以被71整除。

例如:

If N = 5041

Step 1:
  N = 5041
  Last digit = 1
  Remaining number = 504
  Subtracting 7 times last digit
  Resultant number = 504 - 7*1 = 497

Step 2:
  N = 497
  Last digit = 7
  Remaining number = 49
  Subtracting 7 times last digit
  Resultant number = 49 - 7*7 = 0

Step 3:
  N = 0
  Since N is a two-digit number,
  and 0 is divisible by 71

Therefore N = 5041 is also divisible by 71

下面是上述方法的实现:

C++
// C++ program to check whether a number
// is divisible by 71 or not
#include
#include
  
using namespace std;
  
// Function to check if the number is divisible by 71 or not 
bool isDivisible(int n) 
{
    int d;
    // While there are at least two digits 
    while (n / 100) 
    {
  
        // Extracting the last 
        d = n % 10;
  
        // Truncating the number 
        n /= 10;
  
        // Subtracting seven times the last 
        // digit to the remaining number 
        n = abs(n - (d * 7));
    }
    // Finally return if the two-digit
    // number is divisible by 71 or not
    return (n % 71 == 0) ;
}
  
// Driver Code 
int main() {
    int N = 5041;
  
    if (isDivisible(N)) 
        cout << "Yes" << endl ;
    else
        cout << "No" << endl ;
      
    return 0;     
} 
  
// This code is contributed by ANKITKUMAR34


Java
// Java program to check whether a number
// is divisible by 71 or not
import java.util.*;
  
class GFG{
  
// Function to check if the number is divisible by 71 or not 
    static boolean isDivisible(int n) 
    {
        int d;
        // While there are at least two digits 
        while ((n / 100) <=0)
        {
      
            // Extracting the last 
            d = n % 10;
      
            // Truncating the number 
            n /= 10;
      
            // Subtracting seven times the last 
            // digit to the remaining number 
            n = Math.abs(n - (d * 7));
        }
  
        // Finally return if the two-digit
        // number is divisible by 71 or not
        return (n % 71 == 0) ;
    }
      
    // Driver Code 
    public static void main(String args[]){
        int N = 5041;
      
        if (isDivisible(N)) 
            System.out.println("Yes") ;
        else
            System.out.println("No");
    } 
}
  
// This code is contributed by AbhiThakur


Python 3
# Python program to check whether a number
# is divisible by 71 or not
  
# Function to check if the number is 
# divisible by 71 or not 
def isDivisible(n) : 
  
    # While there are at least two digits 
    while n // 100 : 
  
        # Extracting the last 
        d = n % 10
  
        # Truncating the number 
        n //= 10
  
        # Subtracting seven times the last 
        # digit to the remaining number 
        n = abs(n-(d * 7))
  
    # Finally return if the two-digit
    # number is divisible by 71 or not
    return (n % 71 == 0) 
  
# Driver Code 
if __name__ == "__main__" : 
      
    N = 5041
  
    if (isDivisible(N)) : 
        print("Yes") 
    else : 
        print("No")


C#
// C# program to check whether a number
// is divisible by 71 or not
using System; 
          
class GFG 
{ 
      
// Function to check if the number is divisible by 71 or not 
static bool isDivisible(int n) 
{
    int d;
    // While there are at least two digits 
    while (n / 100 > 0) 
    {
      
        // Extracting the last 
        d = n % 10;
      
        // Truncating the number 
        n /= 10;
      
        // Subtracting fourteen times the last 
        // digit to the remaining number 
        n = Math.Abs(n - (d * 7));
    }
      
    // Finally return if the two-digit
    // number is divisible by 71 or not
    return (n % 71 == 0);
}
      
// Driver Code 
public static void Main() 
{ 
    int N = 5041;
      
    if (isDivisible(N)) 
        Console.WriteLine("Yes");
    else
        Console.WriteLine("No");
} 
} 
  
// This code is contributed by mohit kumar 29.


输出:
Yes