How can you increase the size of a dynamically allocated array?
No Answer is Posted For this Question
Be the First to Post Answer
How can I find out the size of a file, prior to reading it in?
What would the following code segment printint k = 8;docout << "k = " << k << " ";while k++ < 5; a) 13 b) 5 c) 8 d) pointers
no consistent academics. how to answer the question
What is difference between constant pointer and constant variable?
N O S I E R + A S T R A L ---------------- 7 2 5 6 1 3
Why is sprintf unsafe?
which is the best antivirus and how to update it
What is class and object in c?
A set of N billiard balls are set on a one-dimensional table. The table is 1 meter long, set north-south with two pockets at either side. Each ball has zero width and there is no friction so it is moving with a fixed velocity of either northward or southward and bounces back in a perfect elastic collision from other balls it encounter on its way (or drop into one of the pockets). Your job is to keep track of the balls movements. Task Please write a program that gets the initial place, speed and direction of all the balls and gives the position of a specific ball after t seconds. Input The first line contains the number of scenarios. Each one of the other lines in the input contains a scenario: The first number, N, is the number of balls; followed by N pairs of numbers: the distance in centimeters from the south end of the table and the speed (positive speed meaning it moves northward); the last two numbers are the number i of the target ball you should track and the time T in seconds. Output The output is a single number for each line which is the place (distance in centimeters from the south end of the table) of the tracked ball after T seconds. Note: There is no new line character at the end of the result. Sample Input 5 1 50 1 1 1000 1 50 1 1 6 1 60 -2 1 6 2 10 1 95 -1 2 30 2 10 1 95 -1 2 60 Sample Output 100 56 48 65 70
main() { printf("hello"); fork(); }
Write the Program to reverse a string using pointers.
two progs are given. one starts counting frm 0 to MAX and the other stars frm MAX to 0. which one executes fast.