Anonymous
Элвин
Tnx
Khaleed
Hy
Anonymous
when making command line options with getopt does it matter what order you place your options when running the program
14•08
Getchar
Anonymous
14•08
😂😂 American to Nairobi plz shake it off
I_Interface
Have u asked admins to post this ad ?
Dima
I_Interface
aren’t ya admin?
I am, but i don't know asked he others or not. 🤷♂️😂
code_inated
Anonymous
Ajay
Which language I should preferred to learn
Anonymous
fiuyang
Hai
fiuyang
Hai friend
Yaser
Hi iam using program client server in c but i have problems in header file like sys/socket.h
And i download the header file from and have the same problem! If there any site to download the messing header file
Yaser
My project is to porting the ipv4 applications to ipv6
Anonymous
ばか
Hello
Ilya
Anonymous
Anonymous
Ms
After 2 day i will have given exam can you help
Ms
About c++
Ms
In NIIt centre
Artöm
Ilya
Ilya
14•08
Ilya
Yo mad
No, not me... The world is mad.
14•08
Anonymous
Has anyone worked with libcurl?
Anonymous
I had a small issue
Anonymous
I'm doing a POST request with libcurl, the issue is that the data contents in the POST are also getting printed on the terminal
Anonymous
https://www.hackerrank.com/start-with-the-neck-or-feet
STARING @ 15:00 ENDING @ 17:00.
Anonymous
Samsung mock placement questions pretty easy lets se who come first
Ilya
Vishal
😁
Vishal
Talula
Ms
klimi
ばか
I’m curious too
Anonymous
What is this?
It's a competitive programming contest link. In the contest you're given 4 questions which you have to solve in 2 hours.
Th
Pi's father, Danny, runs the Hackerville Zoo. He is moving to Rookieville and wants to take all of the zoo animals with him via ship. He is confused about how to arrange them because a few of the species cannot be kept together in the same cabin.
There are n animals placed in a straight line. Each animal is identified by a unique number from 1 to n in order. There are m pairs (a[i], b[i]) which imply that animals a[i] and b[i] are enemies and should not be kept in the same cabin. Pi is good at solving problems and he came up with following challenge: count the number of different groups that do not contain any pair such that they are enemies. A group is defined as an interval (x, y) such that all animals in the range from x to y form a group. Determine the number of groups that can be formed according to the Pi's challenge.
For example, given n = 3 animals and m = 3 pairs of enemies, a = [1, 2, 3] and b = [3, 3, 1], animal 1 is the enemy of animal 3, and animal 3 is the enemy of animals 1 and 2. Because 3 is an enemy of both 1 and 2, it must be in its own cabin. Animals 1 and 2 can be roomed together or separately. There are four possible groupings meeting the constraints: {1, 2} , {1}, {2}, {3}. Note that the intervals are along the original line of animals numbered consecutively from 1 to n, i.e. [1, 2, 3] in this case. The animals cannot be reordered and animals cannot be skipped, e.g. {2, 1} and {1, 3} are invalid intervals.
Function Description
Complete the function angryAnimals in the editor below. The function must return the number of groups that can be formed according to Pi's challenge.
angryAnimals has the following parameters:
n: an integer that denotes the number of unique animals
a[a[0],...a[m-1]]: an array of integers
b[b[0],...b[m-1]]: an array of integers
Th
What logic to be used?
Anonymous
Which of the below one is faster in stl c++ maps or vector??
Ilya
Anonymous
Actually i want to store a pair values in container
Anonymous
So which one is better to use either vector with make_pair or map
klimi
fiuyang
Please help make a c++ program if not multiple of 7 will use phi 3,14
Dima
Yeah, you better start writing it, we will help
Dima
we will not write that code for you
Anonymous
Ilya
Anonymous
So map is better to perfrom operations
Anonymous
??
Ilya
Ilya
Find, erase etc..
I see you just don't know what you want.
In that case it doesn't matter which container to take.
Anonymous
🙏
Anonymous
Ilya
Anonymous
Anonymous
In pair or map
Anonymous
String
Ilya
Anonymous
Ok thanks
Anonymous
I want notes on boolean algebra