Job related update

2022-03-19 08:24:48 12- 9:5

13- 60% Open / Comment

2022-03-19 08:20:40 9- 15

10- ad > bc

11- t+r:t-r Open / Comment

2022-03-19 08:10:29 8- 17 Open / Comment

2022-03-19 08:07:30 Tcs Digital Apptitude

1- 10 seconds

2- Only 1

3- 08% increase

4- Only 3

5- 7

6- 7.84

7- 5400 Open / Comment

2022-03-12 09:01:03 Anyone send the college rank questions Open / Comment

2022-03-12 08:59:47 #include
#include
#include
using namespace std;

int main()
{
// accept n, vector of n elements

int n=5;
// cin >> n;
vector v = {-3, -4, -5, 0, 0};
// for (int i = 0; i < n; i++)
// {
// cin >> v[i];
// }
int sum1=0, sum2=0, sum1Turn = true;
int start = 0, end = n - 1;
while (start <= end)
{
if (v[start] >= v[end] && sum1Turn)
{
cout << v[start] << "a ";
sum1 += v[start];
start++;
sum1Turn = v[start] > 0 ? sum1Turn : !sum1Turn;
}
else if (v[start] >= v[end] && !sum1Turn)
{
cout << v[start] << "b ";
sum2 += v[start];
start++;
sum1Turn = v[start] > 0 ? sum1Turn : !sum1Turn;
}
else if (v[start] < v[end] && sum1Turn)
{
cout << v[end] << "c ";
sum1 += v[end];
end--;
sum1Turn = v[end] > 0 ? sum1Turn : !sum1Turn;
}
else if (v[start] < v[end] && !sum1Turn)
{
cout << v[end] << "d ";
sum2 += v[end];
end--;
sum1Turn = v[end] > 0 ? sum1Turn : !sum1Turn;
}
}
cout << abs(sum1 - sum2);
return 0;
}

Vaccination

1.4K views05:59

Open / Comment

2022-03-12 08:37:56 from collections import deque



class Graph:
def init(self, edges, n):

self.adjList = [[] for _ in range(n)]

for (src, dest) in edges:
self.adjList[src].append(dest)


def isReachable(graph, src, dest, discovered, path):

discovered[src] = True

path.append(src)

if src == dest:
return True

for i in graph.adjList[src]:

if not discovered[i]:
if isReachable(graph, i, dest, discovered, path):
return True

path.pop()

return False


if name == 'main':

n = int(input())
edges = []
for i in range(n):
x = list(map(int,input().split(" ")))
for j in x:
edges.append((i,j-1))


graph = Graph(edges, n)

discovered = [False] * n

(src, dest) = map(int,input().split(" "))
src = src- 1
dest = dest - 1

path = deque()

if isReachable(graph, src, dest, discovered, path):
print(len(list(path))-1,end="")
else:
print(-1,end="") Open / Comment

2022-03-12 08:22:38 Codevita exam today


Join this group @coding231 Open / Comment

2022-03-12 08:12:21 res=[]
n=int(input())
web=[[0 for i in range(n)] for j in range(n)]

def display():
if len(res)==0:
print(-1,end="")
else:
print(min(res),end="")

def webpage(m,q3,cout,b):
for i in range(n):
if web[m][i]==1:
if i==b:
res.append(cout+1)
web[m][i]=0
webpage(i,q3,cout+1,b)
web[m][i]=1

def mainInit():
for i in range(n):
q3=list(map(int,input().split()))
for j in q3:
web[i][j-1]=1

a,b=map(int,input().split())
webpage(a-1,web,0,b-1)
display()

mainInit()

answer for webpage Open / Comment

2022-03-12 08:01:08 College RANK 3:
y, z = [int(i) for i in input().split()]
col = [0] + [int(i) for i in input().split()]
cutoff = [-1] + [-1 for i in range(y)]
praj = set()
l = []
for i in range(z):
id, p, q, r, s = input().split(",")
id = int(id[8:])
p = float(p)
q = int(q[2:])
r = int(r[2:])
s = int(s[2:])
l.append([p, id, 1, q])
l.append([p, id, 2, r])
l.append([p, id, 3, s])
l.sort(key=lambda x: (-x[0], x[1], x[2]))

for i in l:
if i[1] not in praj:
if col[i[3]] > 0:
col[i[3]] -= 1
cutoff[i[3]] = i[0]
praj.add(i[1])
col = [[col[i], i, cutoff[i]] for i in range(1, len(col))]
col.sort(key=lambda x:(-x[0], x[1], x[2]))
s = 0
for i in l:
if i[1] not in praj:
while s < len(col) and col[s][0] <= 0:
s += 1
if s < len(col):
col[s][0] -= 1
if col[s][2] == -1:
col[s][2] = 100
col[s][2] = min(col[s][2], i[0])
praj.add(i[1])
col.sort(key=lambda x:-x[2])

for i in col:
if i[2] != -1:
print("C-" + str(i[1]), i[2])
else:
print("C-" + str(i[1]), "n/a") Open / Comment