OFF CAMPUS UPDATES

2021-09-14 15:47:42 Apply before expire
Tcs:
https://www.freejobs77.com/2021/09/tcs-off-campus-drive-2020-2021.html

Cts:

https://www.freejobs77.com/2021/09/cognizant-off-campus-drive-2021.html

Wipro:

https://www.freejobs77.com/2021/09/wipro-off-campus-drive-2022.html Open / Comment

2021-09-14 15:39:56 Wipro off campus drive
Link:https://www.freejobs77.com/2021/09/wipro-off-campus-drive-2022.html Open / Comment

2021-09-14 14:34:16 Annual carnival code


n=int(input())
a=[]
for i in range(0,n):
a.append(int(input()))
max=0
i=0
j=0
while j if j==0:
if a[j+1]*a[n-1]>max:
max=a[j+1]*a[n-1]
i=j
elif j==n-1:
if a[j-1]*a[0]>max:
max=a[j-1]*a[0]
i=j
else:
if a[j-1]*a[j+1]>max:
max=a[j-1]*a[j+1]
i=j
j=j+1
print('{0}'.format(a[i]))

533 views11:34

Open / Comment

2021-09-14 14:33:52 #include
#include
using namespace std;
#define INF 1e9
int main() {
int n;
cin >> n;
vector v(n);
for(int i = 0; i < n; i++) { cin >> v[i]; }
if(n == 1) return v[0];
vector dist(n, INF);
dist[0] = v[0];
vector seen(n, false);
for(int i = 0; i < n; i++) {
// find the smallest dist that is not also visited
int cand = 0, mindist = INF;
for(int j = 0; j < n; j++) {
if(dist[j] < mindist and !seen[j]) {
mindist = dist[j];
cand = j;
}
}
seen[cand] = true;
// update its neighbors
if(cand - 1 >= 0) dist[cand - 1] = min(dist[cand - 1], mindist + v[cand - 1]);
if(cand + 2 < n) dist[cand + 2] = min(dist[cand + 2], mindist + v[cand + 2]);
}
cout << min(dist[n - 2], dist[n - 1]) << endl;
}


Lake code

485 views11:33

Open / Comment

2021-09-14 14:32:00 n=int(input())
l=[]
for i in range(n):
l.append(int(input()))
s=l[0]
print(sum(l[:n-1]))

Person code Open / Comment

2021-09-14 14:29:43 Lanes of city
Python Open / Comment

2021-09-14 14:28:02 Annual carnival code


n=int(input())
a=[]
for i in range(0,n):
a.append(int(input()))
max=0
i=0
j=0
while j if j==0:
if a[j+1]*a[n-1]>max:
max=a[j+1]*a[n-1]
i=j
elif j==n-1:
if a[j-1]*a[0]>max:
max=a[j-1]*a[0]
i=j
else:
if a[j-1]*a[j+1]>max:
max=a[j-1]*a[j+1]
i=j
j=j+1
print('{0}'.format(a[i]))

418 views11:28

Open / Comment

2021-09-14 14:26:56 c=int(input())
p=int(input())
ans=0
flag=True
while(flag):
if(c%10==0):
ans=c//10
flag=False
elif(((ans-1)*10+p)%c==0 or ((ans-1)*10)%c==0):
ans+=1
flag=False
else:
ans+=1
print(ans)

Recycle upcycle downcycle code Open / Comment

2021-09-14 14:24:11 N=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
l1=[b+(i*a) for i in range(N)]
l2=[d+(i*c) for i in range(1,N)]
for i in l1:
    if(i in l2):
        print(i)
        break
else:
    print("No same amount of fuel found")


Lane of city Open / Comment

2021-09-14 14:22:14 N=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
l1=[b+(i*a) for i in range(N)]
l2=[d+(i*c) for i in range(1,N)]
for i in l1:
    if(i in l2):
        print(i)
        break
else:
    print("No same amount of fuel found")


City code Open / Comment