OFF CAMPUS UPDATES

2021-09-07 12:50:54 Telegram
@freejobs77
@freejobs77 Open / Comment

2021-09-07 08:47:08 #include

using namespace std;

/* function to calculate jumps required to cross

walls */

int jumpcount(int x, int y, int n, int height[])
{

int jumps = 0;


for (int i = 0; i < n; i++) {

if (height[i] <= x) {

jumps++;

continue;

}


/* If height of wall is greater than

up move */

int h = height[i];

while (h > x)

{

jumps++;

h = h - (x - y);

}

jumps++;

}

return jumps;
}

/*driver function*/

int main()
{

int x = 10, y = 1;

int height[] = { 11, 10, 10, 9 };

int n = sizeof(height)/sizeof(height[0]);

cout << jumpcount(x, y, n, height);

return 0;
}


Telegram
@freejobs77
@freejobs77
@freejobs77

453 views05:47

Open / Comment

2021-09-07 08:44:45 import java.util.Scanner;

public class Abhi {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while(t-- != 0){
int n = sc.nextInt();
int[] arr = new int[n];
for(int i = 0 ; i < n;i++){
arr[i] = sc.nextInt();
}
int count = 0;
for(int i = 0; i < n - 1;i++){
int min_idx = i;
for(int j = i+1 ; j < n ; j++){
if(arr[min_idx] > arr[j]){
min_idx = j;
}
}
if(min_idx != i){
count++;
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;


}
}
System.out.println(count);
}
}
}

NCET
Minimum swaps to sort

Telegram

@freejobs77
@freejobs77
@freejobs77 Open / Comment

2021-09-06 14:25:44 int isTriangle(Point *P1, Point *P2, Point *P3)
{
int a=Point_calculateDistance(P1,P2);
int b=Point_calculateDistance(P2,P3);
int c=Point_calculateDistance(P1,P3);
return a+b > c && a+c > b && b+c > a;
}

Telegram
@freejobs77
@freejobs77
@freejobs77
@freejobs77 Open / Comment

2021-09-06 14:24:11 #import
using namespace std;
int d,i,j,t,x,y,a[20160];
main(){
for(i=2;i<144;i++){
if(!a[i]){
for(j=i*i;j<20160;j+=i)a[j]=1;
}
}
cin>>t;
while(t--){
cin>>d;
for(x=d+1;a[x];)x++;
for(y=x+d;a[y];)y++;
cout< }
}

C++
Telegram

@freejobs77
@freejobs77
@freejobs77

555 views11:24

Open / Comment

2021-09-06 14:22:32 rD=int(input())
sD=list(map(int,input().split()))
r=rD-30
dup=[]
for i in range(len(sD)):
    for j in range(len(sD)):
        if(i!=j and sD[i]+sD[j]==r and len(dup)==0):
            dup.append(i)
            dup.append(j)
            break
if len(dup)==0:
    dup.append(-1)
    dup.append(-1)
print(dup)

Telegram
@freejobs77
@freejobs77
@freejobs77 Open / Comment

2021-09-06 08:21:38 Telegram
@freejobs77
@freejobs77
@freejobs77
@freejobs77 Open / Comment

2021-09-06 08:18:57 n=int(input())
fact=1
for i in range(1,n+1):
fact=fact*i;
print(str(fact))



Factorial of large number
Telegram
@freejobs77
@freejobs77
@freejobs77
@freejobs77 Open / Comment

2021-09-06 08:17:40 def findMaximum(arr, low, high):

max = arr[low]

i = low

for i in range(high+1):

if arr[i] > max:

max = arr[i]

return max

@freejobs77
@freejobs77
@freejobs77
@freejobs77 Open / Comment

2021-09-06 08:16:11 Find the logical errors
@freejobs77
@freejobs77
@freejobs77 Open / Comment