给定一个大数字，任务是检查这个数字是否可以被12整除。
null
例如：
Input : 12244824607284961224Output : YesInput : 92387493287593874594898678979792Output : No
这是一个非常简单的方法。如果一个数字可以被4和3整除，那么这个数字可以被12整除。 第一点 .如果数字的最后两位可以被4整除，那么这个数字就可以被4整除。请看 大数可被4整除 详细信息。
第2点 .若一个数的所有数字之和除以3，则该数可被3整除。请看 大数可被3整除 详细信息。
C++
// C++ Program to check if // number is divisible by 12 #include <iostream> using namespace std; bool isDvisibleBy12(string num) { // if number greater then 3 if (num.length() >= 3) { // find last digit int d1 = ( int )num[num.length() - 1]; // no is odd if (d1 % 2 != 0) return (0); // find second last digit int d2 = ( int )num[num.length() - 2]; // find sum of all digits int sum = 0; for ( int i = 0; i < num.length(); i++) sum += num[i]; return (sum % 3 == 0 && (d2 * 10 + d1) % 4 == 0); } else { // if number is less then // or equal to 100 int number = stoi(num); return (number % 12 == 0); } } // Driver function int main() { string num = "12244824607284961224" ; if (isDvisibleBy12(num)) cout << "Yes" << endl; else cout << "No" << endl; return 0; } |
JAVA
// Java Program to check if // number is divisible by 12 import java.io.*; class GFG { static boolean isDvisibleBy12(String num) { // if number greater then 3 if (num.length() >= 3 ) { // find last digit int d1 = ( int )num.charAt(num.length() - 1 ); // no is odd if (d1 % 2 != 0 ) return false ; // find second last digit int d2 = ( int )num.charAt(num.length() - 2 ); // find sum of all digits int sum = 0 ; for ( int i = 0 ; i < num.length(); i++) sum += num.charAt(i); return (sum % 3 == 0 && (d2 * 10 + d1) % 4 == 0 ); } else { // if number is less then // or equal to 100 int number = Integer.parseInt(num); return (number % 12 == 0 ); } // driver function } public static void main (String[] args) { String num = "12244824607284961224" ; if (isDvisibleBy12(num)) System.out.print( "Yes" ); else System.out.print( "No" ); } } // This code is contributed by Gitanjali. |
Python3
# Python Program to check if # number is divisible by 12 import math def isDvisibleBy12( num): # if number greater then 3 if ( len (num) > = 3 ): # find last digit d1 = int (num[ len (num) - 1 ]); # no is odd if (d1 % 2 ! = 0 ): return False # find second last digit d2 = int (num[ len (num) - 2 ]) # find sum of all digits sum = 0 for i in range ( 0 , len (num) ): sum + = int (num[i]) return ( sum % 3 = = 0 and (d2 * 10 + d1) % 4 = = 0 ) else : # f number is less then # r equal to 100 number = int (num) return (number % 12 = = 0 ) num = "12244824607284961224" if (isDvisibleBy12(num)): print ( "Yes" ) else : print ( "No" ) # This code is contributed by Gitanjali. |
C#
// C# Program to check if // number is divisible by 12 using System; class GFG { static bool isDvisibleBy12( string num) { // if number greater then 3 if (num.Length >= 3) { // find last digit int d1 = ( int )num[num.Length - 1]; // no is odd if (d1 % 2 != 0) return false ; // find second last digit int d2 = ( int )num[num.Length - 2]; // find sum of all digits int sum = 0; for ( int i = 0; i < num.Length; i++) sum += num[i]; return (sum % 3 == 0 && (d2 * 10 + d1) % 4 == 0); } else { // if number is less then // or equal to 100 int number = int .Parse(num); return (number % 12 == 0); } } // Driver function public static void Main () { String num = "12244824607284961224" ; if (isDvisibleBy12(num)) Console.Write( "Yes" ); else Console.Write( "No" ); } } // This code is contributed by nitin mittal. |
PHP
<?php // PHP Program to check if // number is divisible by 12 function isDvisibleBy12( $num ) { // if number greater then 3 if ( strlen ( $num ) >= 3) { // find last digit $d1 = (int) $num [ strlen ( $num ) - 1]; // no is odd if ( $d1 % 2 != 0) return (0); // find second last digit $d2 = (int) $num [ strlen ( $num ) - 2]; // find sum of all digits $sum = 0; for ( $i = 0; $i < strlen ( $num ); $i ++) $sum += $num [ $i ]; return ( $sum % 3 == 0 && ( $d2 * 10 + $d1 ) % 4 == 0); } else { // if number is less then // or equal to 100 $number = stoi( $num ); return ( $number % 12 == 0); } } // Driver Code $num = "12244824607284961224" ; if (isDvisibleBy12( $num )) echo ( "Yes" ); else echo ( "No" ); // This code is contributed by Ajit. ?> |
Javascript
<script> // Javascript program to check if // number is divisible by 12 function isDvisibleBy12(num) { // If number greater then 3 if (num.length >= 3) { // Find last digit let d1 = num[num.length - 1].charCodeAt(); // No is odd if (d1 % 2 != 0) return false ; // Find second last digit let d2 = num[num.length - 2].charCodeAt(); // Find sum of all digits let sum = 0; for (let i = 0; i < num.length; i++) sum += num[i].charCodeAt(); return ((sum % 3 == 0) && (d2 * 10 + d1) % 4 == 0); } else { // If number is less then // or equal to 100 let number = parseInt(num, 10); document.write(number); return (number % 12 == 0); } } // Driver code let num = "12244824607284961224" ; if (isDvisibleBy12(num)) document.write( "Yes" ); else document.write( "No" ); // This code is contributed by divyeshrabadiya07 </script> |
输出：
Yes
© 版权声明
文章版权归作者所有，未经允许请勿转载。
THE END
![关于”PostgreSQL错误：关系[表]不存在“问题的原因和解决方案-yiteyi-C++库](https://www.yiteyi.com/wp-content/themes/zibll/img/thumbnail.svg)
