Learn Programming in C

24/08/2020

Do you want to earn extra money?
Inertia Soft Pvt Ltd. brings a perfect opportunity for you.
Work as a freelancer with us, you bring business for us and we will give you a handsome percentage of commission depending on the size of business. We are in the expanding stage and we want everyone to take advantage of this offer. You just bring the potential client to us and keeping you in the loop we will contact them and if a deal matures we will give you commission on mutually decided percentage.

The following are our main services.
>Web and mobile development (Apps, Websites)
>Software development (CRM, Enterprise solutions)
>Digital Marketing (Social media marketing, graphic designing)
You can check www.inertiasoft.net for detailed services and insights.
We are looking forward to long term relation with you

Contact Us:
Email: [email protected]
Number: +923071449987
Our Linkedin or page

18/08/2020

DO YOU WANT TO EARN EXTRA MONEY?

Inertia Soft (Pvt) Ltd. brings perfect opportunity for you.

Work as a freelancer with us, you bring business for us and we will give you a handsome percentage of commission depending on the size of business.

We are in the expanding stage and we want everyone to take advantage of this offer. You just bring the potential client to us and keeping you in loop, we will contact them and if a deal matures we will give you commission on mutually decided percentage.

Following are our main services..
Web and mobile development (apps, websites)
Software development (CRM, Enterprise solutions)
Digital Marketing (Social media marketing, graphic designing)

You can check www.inertiasoft.net for detailed services and insights.

We are looking forward for long term relation with you.

Regards
Luqman Ahmed
Chief Executive Officer
Inertia Soft Pvt Ltd

18/08/2020

Hello Everyone,

Posting after a very long time.
The reason was obvious, busy with studies.

I was finally able to complete my graduation by late 2018. Once finished, starting working as a freelancer for international client for a while and ended up starting my company.

In the very start of February 2019, I established InertiaSoft (Pvt) Ltd as a software company.

Like & share guys!!!

https://www.facebook.com/inertiasoftpvtltd/

Inertiasoft (Private) Limited was established with the vision to provide tech solutions that are per

03/08/2017

Uma Divella's Solution for Bleatrix Problem...


int main()
{
int N,count=0,k,a[10]={0},i,j,rem;
scanf("%d",&N);
for(i=1;i

29/07/2017

Practice Problem

Annie is a bus driver with a high-stress job. She tried to unwind by going on a Caribbean cruise, but that also turned out to be stressful, so she has recently taken up horseback riding.

Today, Annie is riding her horse to the east along a long and narrow one-way road that runs west to east. She is currently at kilometer 0 of the road, and her destination is at kilometer D; kilometers along the road are numbered from west to east.

There are N other horses traveling east on the same road; all of them will go on traveling forever, and all of them are currently between Annie's horse and her destination. The i-th of these horses is initially at kilometer Ki and is traveling at its maximum speed of Si kilometers per hour.

Horses are very polite, and a horse H1 will not pass (move ahead of) another horse H2 that started off ahead of H1. (Two or more horses can share the same position for any amount of time; you may consider the horses to be single points.) Horses (other than Annie's) travel at their maximum speeds, except that whenever a horse H1 catches up to another slower horse H2, H1 reduces its speed to match the speed of H2.

Annie's horse, on the other hand, does not have a maximum speed and can travel at any speed that Annie chooses, as long as it does not pass another horse. To ensure a smooth ride for her and her horse, Annie wants to choose a single constant "cruise control" speed for her horse for the entire trip, from her current position to the destination, such that her horse will not pass any other horses. What is the maximum such speed that she can choose?

Input

The first line of the input gives the number of test cases, T; T test cases follow. Each test case begins with two integers D and N: the destination position of all of the horses (in kilometers) and the number of other horses on the road. Then, N lines follow. The i-th of those lines has two integers Ki and Si: the initial position (in kilometers) and maximum speed (in kilometers per hour) of the i-th of the other horses on the road.

Output

For each test case, output one line containing Case : y, where x is the test case number (starting from 1) and y is the maximum constant speed (in kilometers per hour) that Annie can use without colliding with other horses. y will be considered correct if it is within an absolute or relative error of 10-6 of the correct answer. See the FAQ for an explanation of what that means, and what formats of real numbers we accept.

Limits

1 ≤ T ≤ 100.
0 < Ki < D ≤ 109, for all i.
Ki ≠ Kj, for all i ≠ j. (No two horses start in the same position.)
1 ≤ Si ≤ 10000.
Small dataset

1 ≤ N ≤ 2.
Large dataset

1 ≤ N ≤ 1000.
Sample

Input

Output

3
2525 1
2400 5
300 2
120 60
60 90
100 2
80 100
70 10

Case #1: 101.000000
Case #2: 100.000000
Case #3: 33.333333

In sample case #1, there is one other (very slow!) horse on the road; it will reach Annie's destination after 25 hours. Anything faster than 101 kilometers per hour would cause Annie to pass the horse before reaching the destination.

In sample case #2, there are two other horses on the road. The faster horse will catch up to the slower horse at kilometer 240 after 2 hours. Both horses will then go at the slower horse's speed for 1 more hour, until the horses reach Annie's destination at kilometer 300. The maximum speed that Annie can choose without passing another horse is 100 kilometers per hour.

29/07/2017

Uma Divvela has done a great job....!!!
The solution was very good....!!!!

29/07/2017

Uma Divvela has done a great job...!!
The solution is very good....!!!

28/07/2017

Problem

Bleatrix Trotter the sheep has devised a strategy that helps her fall asleep faster. First, she picks a number N. Then she starts naming N, 2 × N, 3 × N, and so on. Whenever she names a number, she thinks about all of the digits in that number. She keeps track of which digits (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9) she has seen at least once so far as part of any number she has named. Once she has seen each of the ten digits at least once, she will fall asleep.

Bleatrix must start with N and must always name (i + 1) × N directly after i × N. For example, suppose that Bleatrix picks N = 1692. She would count as follows:

N = 1692. Now she has seen the digits 1, 2, 6, and 9.
2N = 3384. Now she has seen the digits 1, 2, 3, 4, 6, 8, and 9.
3N = 5076. Now she has seen all ten digits, and falls asleep.
What is the last number that she will name before falling asleep? If she will count forever, print INSOMNIA instead.

28/07/2017

TODAY AT 4:00 p.m PST, i will post a question, solve it before 11:00 p.m PST and send the solution through private message.
I will announce who did the best...!!!!! 🙂🙂🙂🙂🙂

24/07/2017

HOW ABOUT A SMALL QUIZ OF CODING???

08/07/2017

Please suggest me more topics....
And do rate my page with as many stars as i deserve, cause i know that i am always late with posts....!!!!
Thanks
🙂🙂🙂🙂