Infosys All Solution Here
❤️🚀
https://t.me/Coding_solution_0

https://t.me/Coding_solution_0

Scam Alert 🚀🚀
GUYS Don't Pay Money to any
One ❤️❤️.

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>




int main(){
int t,count=0;
scanf("%d",&t);
for(int a0 = 0; a0 < t; a0++){
count=0;
int n;
int k;
scanf("%d %d",&n,&k);
int a[n];
for(int a_i = 0; a_i < n; a_i++){
scanf("%d",&a[a_i]);
}

for(int a_i = 0; a_i < n; a_i++){
if(a[a_i]<=0)
count++;
}
if(count<k)
printf("YES\n");
else
printf("NO\n");
//count=0;
}
return 0;
}


C language
Angry professor
Telegram- https://t.me/Coding_solution_0

Minimum swaps
C lang

Telegram-
https://t.me/Coding_solution_0

// C++ program to find minimum time
// required to produce m items.
#include<bits/stdc++.h>

using namespace std;

// Return the minimum time required to
// produce m items with given machines.

int minTime(int arr[], int n, int m)
{

// Initialize time, items equal to 0.

int t = 0;


while (1)

{

int items = 0;


// Calculating items at each second

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

items += (t / arr[i]);


// If items equal to m return time.

if (items >= m)

return t;


t++; // Increment time

}
}

// Driver Code

int main()
{

int arr[] = { 1, 2, 3 };

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

int m = 11;


cout << minTime(arr, n, m) << endl;


return 0;
}


Minimum time

C language
Telegram-
https://t.me/Coding_solution_0

Rooted tree with N nodes code
An array A of N integer code
Bob received n job invitations code
Telegram- https://t.me/Coding_solution_0

Infosys All Solution Here
❤️🚀
Channel 🚀
https://t.me/Coding_solution_0

Group 🚀
https://t.me/good_coders

Python
Red And White Flower
Telegram
https://t.me/Coding_solution_0

John and jonny
https://t.me/Coding_solution_0

Angry professor


#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>




int main(){
int t,count=0;
scanf("%d",&t);
for(int a0 = 0; a0 < t; a0++){
count=0;
int n;
int k;
scanf("%d %d",&n,&k);
int a[n];
for(int a_i = 0; a_i < n; a_i++){
scanf("%d",&a[a_i]);
}

for(int a_i = 0; a_i < n; a_i++){
if(a[a_i]<=0)
count++;
}
if(count<k)
printf("YES\n");
else
printf("NO\n");
//count=0;
}
return 0;
}


C language

Telegram- https://t.me/Coding_solution_0

Python 10 Jan

1 c
2 d
3 a
4 a
5 b
6 d
7 d
8 d
9 c
10 a

https://t.me/Coding_solution_0

https://t.me/Coding_solution_0

Python

Python 10 Jan

1 c
2 d
3 a
4 a
5 b
6 d
7 d
8 d
9 c
10 a

https://t.me/Coding_solution_0

https://t.me/Coding_solution_0


11 C
12
13
14
15 C
16 B
22 b
23 D

Python

Python 10 Jan

1 c
2 d
3 a
4 a
5 b
6 d
7 d
8 d
9 c
10 a

https://t.me/Coding_solution_0

https://t.me/Coding_solution_0


11 C
12
13
14
15 C
16 B
22 b
23 D
25 d
26 c
27 b

Python 10 Jan

1 c
2 d
3 a
4 a
5 b
6 d
7 d
8 d
9 c
10 a
11a
12b
13b
14 a
15-3
16-c
17-b
18-a
19-b
20-b
21 b
22 a
23d
24 b
25 a
26-c
27 d
28 b
29c
30c
31 a
32 b
33 b
34 c
35 b
36-b
37-c
38-a
39 b
40-d
41 b
42-a
43 c
44 a
45 a
46 a
47-a
48-b
49 a
50 c



https://t.me/Coding_solution_0

https://t.me/Coding_solution_0
https://t.me/Coding_solution_0

IRA 10JAN
JAVA
1.Composite
2.false
3.native
4.false
5.false
6.all of the above
7.u will....
8.paul can be task...
9.priority..
10.true
11.
12.
13.}
14.tee
15.
16.
17.
18.32
19.unique
20.Count(*)
21.dbms_output.put_line()
22.
23.
24.
25.
26.outline color
27.
28.
29.
30.
31..,#
32.
34.continue
35.mask
36.-128
37.a,b,c
38.me Bu
39.
40.
41.27 8
42.C
43.
44.D
45.D
46.A
47.C
48.100
49.
50.0
33.onclick


https://t.me/Coding_solution_0

https://t.me/Coding_solution_0
https://t.me/Coding_solution_0