Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
الذهاب إلى القناة على Telegram
Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion
إظهار المزيد3 352
المشتركون
-324 ساعات
-97 أيام
-3930 أيام
أرشيف المشاركات
Delotte 2nd code..47 question...
Who are having...8pm delotte contact -@ILOVEU_143
Show some love..❤️ share our channel to ur frds...😎😍
def no_consecutive_ones(n: int) -> bool:
bin_n = bin(n)[2:]
for i in range(len(bin_n)-1):
if bin_n[i] == '1' and bin_n[i+1] == '1':
return False
return True
m, n = map(int, input().split())
for i in range(m+1, n):
if no_consecutive_ones(i):
print(bin(i)[2:])
Python✅
Telegram - @Coding_000✅
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int start = sc.nextInt();
int end = sc.nextInt();
for (int i = start; i <= end; i++) {
System.out.println(Integer.toBinaryString(i));
}
}
}
Java ✅
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int start = sc.nextInt();
int end = sc.nextInt();
for (int i = start; i <= end; i++) {
System.out.println(Integer.toBinaryString(i));
}
}
}
Share our channel...show some love...to @ILOVEU_143❤️
IF U WANT CODING SOLUTIONS...
SHARE OUR CHANNEL ✅✅
Take screenshot of my channel and share to large groups if u need more answers
Deloitte Solutions 👇👇
Share ur questions here...👇👇
1)https://t.me/exams_discussion
متاح الآن! بحث تيليغرام 2025 — أهم رؤى العام 
