2 051
Suscriptores
Sin datos24 horas
Sin datos7 días
Sin datos30 días
Archivo de publicaciones
Hello Everyone , if you want to practice DSA Daily then we have a group of 180+ people who are practicing at the same time on leetcode as well as to get all tech related updates of jobs n internships... please dm me..to join. 😊
Anyone wants assistance in Capgemini, Accenture, TCS, Cognizant, Wipro, PWC Amazon, Virtusa etc.
Hi bhavani , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅
👇👇
@offcampusjobs_0
@offcampusjobs_0
Hi Christopher Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Recruiting for infosys freshers and experienced candidates backdoor process charges applicable
Hi Codec Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Hi Darshil Welcome to this Community, Subscribe Our YouTube Channel📣 for Daily Jobs Updates and Study Material
Hi Sapna Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Hi Anu Join Our Channel for daily Off-Campus Job Updates ❤️
👇👇
@offcampusjobs_0
@offcampusjobs_0
Repost from Off Campus Job Update
n=int(input())
l=[]
for i in range(2,n+1):
if n%i==0:
l.append(i)
s=0
c=0
flag=0
for j in range(0,len(l)):
for k in range(2,int(j/2)):
if(j%k==0):
c+=1
for p in range(0, len(l)):
for q in range(2, int(p / 2)):
if (p % q == 0):
s += 1
if c==s and j*p==n:
flag=1
break
if flag==1:
break
if flag==1:
print("1")
else:
print("0")
Alice and elizabeth code
https://t.me/coding_solution_0
