D

Though
✅ Wipro answers
Telegram-
https://t.me/Coding_solution_0

Python
Online Exam
Wipro
Telegram -
https://t.me/Coding_solution_0

Product ID
WIPRO
Telegram https://t.me/Coding_solution_0

#include"stdio.h"
void main() {
int n;
scanf("%d", &n);
if (n >= 30 && n <= 50)
printf("D");
elseif(n >= 51 && n <= 60)
printf("C");
elseif(n >= 61 && n <= 80)
printf("B");
elsif(n >= 81 && n <= 100)
printf("A")
}

C language
E-Commerce Code
Wipro
Telegram -
https://t.me/Coding_solution_0

PRIVATE GROUP FOR WIPRO EXAM SOLUTION 🚀🚀❤️

Group
https://t.me/solution_exam

Channel
https://t.me/Coding_solution_0

Warehouse Ecommerce company

#include <stdio.h>
#include <string.h>
int main() {
char s[100];
int i;
printf("\nEnter a string : ");
gets(s);
for (i = 0; s[i]!='\0'; i++) {
if(s[i] >= 'a' && s[i] <= 'z') {
s[i] = s[i] - 32;
}
}
printf("\nString in Upper Case = %s", s);
return 0;
}

Warehouse Code

Telegram- https://t.me/Coding_solution_0

Discount code
Telegram- https://t.me/Coding_solution_0

#include<stdio.h>
#include<math.h>

int isPerfectSquare(int number)
{
int iVar;
float fVar;

fVar=pow(number,1.0/3.0);
iVar=(int)fVar;

if(iVar==fVar)
return number;
else
return 0;
}

int main()
{
int n;
scanf(“%d”,&n);
int arr[n];
int i;
for(i = 0; i < n; i++)
{
scanf("%d",&arr[i]);
}
int count = 0;
for(i = 0; i < n; i++)
{
if(isPerfectSquare(arr[i]))
count++;
}
printf("%d",count);
return 0;
}

E-Commerce

Telegram-
https://t.me/Coding_solution_0

Sum of squares
Telegram- https://t.me/Coding_solution_0

PRIVATE GROUP FOR WIPRO EXAM SOLUTION 🚀🚀❤️

Group
https://t.me/solution_exam

Channel
https://t.me/Coding_solution_0

S=input()
print(S.swapcase())

MNC
Telegram-
https://t.me/Coding_solution_0

Online processing image
Telegram-
https://t.me/Coding_solution_0

PRIVATE GROUP FOR WIPRO EXAM SOLUTION 🚀🚀❤️

Group
https://t.me/solution_exam

Channel
https://t.me/Coding_solution_0

Mr. BëArdÔ:
def bfs(graph,c,t):
s=1
n=len(graph)-1
dist=[]
pred=[]
color=[]
q=[]
count=0
for _ in range(len(graph)):
dist.append(9999)
pred.append(None)
color.append('w')
q.append(s)
dist[s]=0
color[s]='g'
while len(q)!=0:
u=q.pop(0)
if u==n:
break
count+=1
color[u]='b'
for i in graph[u]:
if color[i]=='w':
q.append(i)
color[i]='g'
dist[i]=dist[u]+c
pred[i]=u
return dist[n]

n,m,t,c=map(int,input().split())
graph=[[] for _ in range(n+1)]
for _ in range(m):
x,y=map(int,input().split())
graph[x].append(y)
graph[y].append(x)
time=bfs(graph,c,t)
signal='g'
signals=[None]
for _ in range(t):
signals.append('g')
for i in range(t,time+1):
if i==0:
continue
if (i//t)%2==0:
signals.append('g')
else:
signals.append('r')
for i in range(0,time,c):
if signals[i]=='r':
time+=(signals[i+1:].index('g'))

print(time)

Python accolie beautiful path

Telegram- https://t.me/Coding_solution_0