Channel address:
Categories:
Technologies
Language: English
Subscribers:
27.37K
Description from channel
🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company. “
🔥 Free materials of all companies
🔥 Off campus updates
🔥 Interview experiences
Ratings & Reviews
Reviews can be left only by registered users. All reviews are moderated by admins.
5 stars
1
4 stars
0
3 stars
0
2 stars
1
1 stars
0
The latest Messages 254
2021-09-15 09:09:59
n=input()
k=int(input())
s=0
for i in n:
s+=int(i)
k=k*s
s=0
for i in str(k):
s+=int(i)
print(s)
Telegram:@freejobs77
344 views06:09
2021-09-15 09:06:54
n=int(input())
r=int(input())
s=0
while(n!=0):
r=n%10
s+=r
n=n//10
a=s*r
s1=0
while(a!=0):
r1=a%10
s1+=r1
a=a//10
print(s1)
357 views06:06
2021-09-15 09:05:32
def ret_s(n):
result=0
while(n>0):
result+=n%10
n=int(n/10)
return result
n=int(input())
r=int(input())
re=r*ret_s(n)
print(ret_s(re))
For an intelligent agency
Intelligent agendcy
Telegram:@freejobs77
332 views06:05
2021-09-15 09:04:23
n = int(input());
v = int(input());
temp = 0
for i in range(1,n+1):
for j in range(1,n+1):
if i*j == v:
temp = temp + 1
if temp == 0:
print('NO POWER')
else:
print(temp)
No of n houses,
in phython
Telegram:@freejobs77
331 views06:04
2021-09-15 09:03:39
#include
int main()
{
int n,r,sum=0;
scanf("%d",&n);
scanf("%d",&r);
while(n>0)
{
int r=n%10;
sum=sum+r;
n=n/10;
}
int p=sum*r;
int s=0;
while(p>0)
{
int q=p%10;
s=s+q;
p=p/10;
}
printf("%d",s);
return 0;
}
Telegram:@freejobs77
335 views06:03
2021-09-15 09:03:38
327 views06:03
2021-09-15 09:01:39
def ret_s(n):
result=0
while(n>0):
result+=n%10
n=int(n/10)
return result
n=int(input())
r=int(input())
re=r*ret_s(n)
print(ret_s(re))
For an intelligent agency has recived
684 views06:01
2021-09-15 08:56:53
lower = int(input("Enter lower range: "))
upper = int(input("Enter upper range: "))
for num in range(lower,upper + 1):
if num > 1:
for i in range(2,num):
if (num % i) == 0:
break
else:
print(num)
This is for circular prime u can modify this based on input and output format
371 views05:56
2021-09-15 08:40:00
int fun(int n,int m)
{
int sum=n+m;
If(countdigits(sum)==countdigits(n))
return sum;
else
return n;
}
int countDigit(int n)
{
int count = 0;
while (n != 0)
{
n = n / 10;
++count;
}
return count;
}
Same number of digits code
Telegram:@freejobs77
786 views05:40
2021-09-14 16:47:30
Infosys Off Campus Drive
Role: Specialist Programmer & Digital Specialist Engineer
Qualification: B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
Batch: 2020, 2021
CTC: 5 to 8 LPA
Last Date: 26 September 2021
Link:https://www.freejobs77.com/2021/09/infosys-off-campus-2021-drive.html
Telegram:
@freejobs77
@freejobs77
545 views13:47