Hướng dẫn c++ program to check if a number is divisible by 3 - chương trình c ++ để kiểm tra xem một số có chia hết cho 3 không

Nhận một số Num và kiểm tra xem Num có chia hết cho 3 không.

Mẫu đầu vào 1:

Đầu ra mẫu 1:

Chia hết cho 3

Mẫu đầu vào 2:

Đầu ra mẫu 2:

Không chia hết cho 3

Chương trình hoặc giải pháp

#include<stdio.h> int main() { int num; printf("Enter a number: "); scanf("%d"&num); if(num%3==0) { printf("%d is divisible by 3",num); } else { printf("%d is not divisible by 3",num); } return 0; }

Giải thích chương trình

Nhận đầu vào Num từ người dùng bằng cách sử dụng câu lệnh SCANF

Kiểm tra xem phần còn lại của num chia cho 3 bằng 0 bằng cách sử dụng câu lệnh IF.

Nếu là 0, thì in num là chia hết cho 3 bằng cách sử dụng câu lệnh printf.

Khác in Num không chia hết cho 3 bằng cách sử dụng câu lệnh PRINTF.

Đưa ra một số, nhiệm vụ là chúng tôi chia số cho 3. Số đầu vào có thể lớn và có thể không thể lưu trữ ngay cả khi chúng tôi sử dụng int.examples dài dài: & nbsp; & nbsp;
Examples:

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes

Vì số đầu vào có thể rất lớn, chúng tôi không thể sử dụng N % 3 để kiểm tra xem một số có chia hết cho 3 hoặc không, đặc biệt là bằng các ngôn ngữ như C/C ++. Ý tưởng này dựa trên thực tế sau. & NBSP;

Một số được chia cho 3 nếu tổng các chữ số của nó chia hết cho 3.

Minh họa: & nbsp; & nbsp;

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.

Điều này hoạt động như thế nào? & NBSP;

Dưới đây là việc thực hiện thực tế trên: & nbsp;

C++

#include<bits/stdc++.h>

using namespace std;

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes1

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes5

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes8

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.0 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.3

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.5For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.6For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.9 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.0

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.3

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.6Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.7Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3 0 1 2 3Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

Java

9 0

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3 3 4 5

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes5

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 #include<bits/stdc++.h>3#include<bits/stdc++.h>4Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.0 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 using0#include<bits/stdc++.h>444

using3using4For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.6For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.9 using9namespace0 namespace1#include<bits/stdc++.h>44For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3namespace7 3 namespace9 std;0

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4std;4Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.7Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4std;8std;9

using3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes01 1For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

using3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes01Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes08For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

Python3

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes13 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes14

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes16Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17 #include<bits/stdc++.h>4

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes20 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes21#include<bits/stdc++.h>4 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes23

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes25Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes27Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes28 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes29

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes16Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes16Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes34 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes35

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes27Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes27Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes40 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes29

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.9 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes44Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes28 namespace0 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes27Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes53

std;8Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes55

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes57 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1 1Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes50

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes05 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes23

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes57 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes08Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes50

C#

using Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes69

9 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes71

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3 3 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes75 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes76Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes77 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes78

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes83

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes0 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes8

using3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes93For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.6For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.9 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.0

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3namespace7 3 namespace9 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.05

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes77 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.10Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.7Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4std;8std;9

using3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.17 1For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

using3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.17Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes08For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

PHP

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.29

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.30 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes76For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.32Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes50

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.36 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.37For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.38For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.32For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.0 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.48 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.49For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.48

Các

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.9 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.43 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.69

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.32 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.37Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.7Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.75 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.76For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.32For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.78 1 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.80 3Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.83For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.75For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.7

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.87

JavaScript

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.88

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.30 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.90

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.9 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.0

Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.07Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.7Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.10 1 For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.80 3Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

Độ phức tạp về thời gian: O (logn), trong đó n là số đã cho.: O(logn), where n is the given number.

Không gian phụ trợ: O (1), vì chúng ta không sử dụng bất kỳ không gian bổ sung nào. & NBSP;O(1), as we are not using any extra space.

Phương pháp 2: Kiểm tra số đã cho là chia hết cho 3 hoặc không bằng cách sử dụng toán tử phân chia modulo. Checking given number is divisible by 3 or not by using the modulo division operator “%”.

C++

using namespace std;

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.25 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.25 ____10 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.28

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.35 1Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.35Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes08Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

Java

9 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.57

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.25 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.67Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.68Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.8

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3std;8 Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.72namespace0 namespace1#include<bits/stdc++.h>44Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.76

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes05 Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes2

Python3

Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.95Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes17Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.68

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes05Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes23

Let us consider 1332, we can write it as 1332 = 1*1000 + 3*100 + 3*10 + 2 The proof is based on below observation: Remainder of 10i divided by 3 is 1 So powers of 10 only result in value 1. Remainder of "1*1000 + 3*100 + 3*10 + 2" divided by 3 can be written as : 1*1 + 3*1 + 3*1 + 2 = 9 The above expression is basically sum of all digits. Since 9 is divisible by 3, answer is yes.58Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes57For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.1Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes08Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes50

C#

using Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes69

namespace7 9 23

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3std;8 34

Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes3 52

JavaScript

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.88

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4 58 59

For example n = 1332 Sum of digits = 1 + 3 + 3 + 2 = 9 Since sum is divisible by 3, answer is Yes.4std;8 34

using3 64 1Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes50

using3 64Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes08Input : n = 769452 Output : Yes Input : n = 123456758933312 Output : No Input : n = 3635883959606670431112222 Output : Yes50

Độ phức tạp về thời gian: O (1) vì nó đang thực hiện các hoạt động liên tục O(1) as it is doing constant operations

Không gian phụ trợ: O (1): O(1)

Bài viết này được đóng góp bởi Đan Mạch_raza. Nếu bạn thích GeekSforGeeks và muốn đóng góp, bạn cũng có thể viết một bài viết bằng Write.GeekSforGeek.org hoặc gửi bài viết của bạn. Xem bài viết của bạn xuất hiện trên trang chính của GeekSforGeek và giúp các chuyên viên máy tính khác. Xin vui lòng viết nhận xét nếu bạn tìm thấy bất cứ điều gì không chính xác hoặc bạn muốn chia sẻ thêm thông tin về chủ đề được thảo luận ở trên. & NBSP;DANISH_RAZA . If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to . See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Chương trình hoặc giải pháp

Giải thích chương trình

C++

Java

Python3

C#

PHP

JavaScript

C++

Java

Python3

C#

JavaScript

Bài Viết Liên Quan

Toplist

Bài mới nhất

Chủ đề