检查由N个数字的最后一位组成的数字是否可被10整除

给定大小为N的数组arr [] ，该数组由非零正整数组成。任务是确定通过选择所有数字的最后一位形成的数字是否可被10整除。如果数字可被10整除，则打印“是”，否则打印“否”。

例子：

Input: arr[] = {12, 65, 46, 37, 99}
Output: No
25679 is not divisible by 10.

Input: arr[] = {24, 37, 46, 50}
Output: Yes
4760 is divisible by 10.

方法：为了使整数可以被10整除，它必须以0结尾。因此，数组的最后一个元素将决定所形成的数字是否可以被10整除。如果最后一个元素的最后一位为0，则打印“是”，否则打印“否”。

下面是上述方法的实现：

C++

// C++ implementation of the approach
#include 
using namespace std;
  
// Function that returns true if the
// number formed by the last digits of
// all the elements is divisible by 10
bool isDivisible(int arr[], int n)
{
    // Last digit of the last element
    int lastDigit = arr[n - 1] % 10;
  
    // Number formed will be divisible by 10
    if (lastDigit == 0)
        return true;
  
    return false;
}
  
// Driver code
int main()
{
    int arr[] = { 12, 65, 46, 37, 99 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    if (isDivisible(arr, n))
        cout << "Yes";
    else
        cout << "No";
  
    return 0;
}

Java

// Java implementation of the approach
import java.util.*;
      
class GFG
{
  
// Function that returns true if the
// number formed by the last digits of
// all the elements is divisible by 10
static boolean isDivisible(int arr[], int n)
{
    // Last digit of the last element
    int lastDigit = arr[n - 1] % 10;
  
    // Number formed will be divisible by 10
    if (lastDigit == 0)
        return true;
  
    return false;
}
  
// Driver code
static public void main ( String []arg)
{
    int arr[] = { 12, 65, 46, 37, 99 };
    int n = arr.length;
  
    if (isDivisible(arr, n))
        System.out.println("Yes");
    else
        System.out.println("No");
}
}
  
// This code is contributed by Rajput-Ji

Python3

# Python3 implementation of the approach 
  
# Function that returns true if the 
# number formed by the last digits of 
# all the elements is divisible by 10 
def isDivisible(arr, n) : 
  
    # Last digit of the last element 
    lastDigit = arr[n - 1] % 10; 
  
    # Number formed will be divisible by 10 
    if (lastDigit == 0) : 
        return True; 
  
    return False; 
  
# Driver code 
if __name__ == "__main__" : 
  
    arr = [ 12, 65, 46, 37, 99 ]; 
    n = len(arr); 
  
    if (isDivisible(arr, n)) :
        print("Yes"); 
    else :
        print("No"); 
  
# This code is contributed by AnkitRai01

C#

// C# implementation of the approach
using System;
      
class GFG
{
  
// Function that returns true if the
// number formed by the last digits of
// all the elements is divisible by 10
static bool isDivisible(int []arr, int n)
{
    // Last digit of the last element
    int lastDigit = arr[n - 1] % 10;
  
    // Number formed will be divisible by 10
    if (lastDigit == 0)
        return true;
  
    return false;
}
  
// Driver code
static public void Main(String []arg)
{
    int []arr = { 12, 65, 46, 37, 99 };
    int n = arr.Length;
  
    if (isDivisible(arr, n))
        Console.WriteLine("Yes");
    else
        Console.WriteLine("No");
}
}
      
// This code is contributed by Rajput-Ji

输出：

No