Krish Posted April 30, 2014 Report Posted April 30, 2014 #include <stdio.h> #include <string.h> main() { unsigned int n,i; for (i=49;i<=100000;i=i+7) { if(i%2==1) if(i%3==1) if(i%4==1) if(i%5==1) if(i%6==1) { printf("%d",i); break; }} return 0; } 301 Bayya edo code raasinattunnav.... @3$%
Krish Posted April 30, 2014 Report Posted April 30, 2014 301 #include <stdio.h> #include <string.h> 301 explanations please!!
pachimirchi Posted April 30, 2014 Report Posted April 30, 2014 Bayya edo code raasinattunnav.... @3$% hehe.... kind of cheating.. brute force approach
bio Posted April 30, 2014 Report Posted April 30, 2014 A snail creeps 3 ft up a wall during the daytime. After all the labor it does throughout the day, it stops to rest a while... but falls asleep!! The next morning it wakes up and discovers that it has slipped down 1 ft while sleeping.If this happens every day, how many days will the snail take to reach the top of a wall 15 ft in height? idi 6 days ah man??
Krish Posted April 30, 2014 Report Posted April 30, 2014 idi 6 days ah man?? Nope!!...bayya nuv idi cheste cheat cheyakunda..u r thopu!!
bio Posted April 30, 2014 Report Posted April 30, 2014 Again right!!...full form loki vachhesaav... :) lol..avunaa Q straight gane undi ga... poddunna padina punch ki reconfirmations cheskotaniki antha time pattindi man...lolz
gabbarsingh1 Posted April 30, 2014 Report Posted April 30, 2014 A couple went for picnic they have 35 sons each son had seven wives each wife had 5 sons. How many people went for picnic in total ?
pachimirchi Posted April 30, 2014 Report Posted April 30, 2014 explanations please!! we are looking for a minimum number that's perfectly divisible by 7, leaves 1 when divided by 2 thru 6 and it is an odd number too. so danike c program rasa 301 was the answer
bio Posted April 30, 2014 Report Posted April 30, 2014 Nope!!...bayya nuv idi cheste cheat cheyakunda..u r thopu!! no cheating man, honest gane try sesta gimme time to recheck it
pandugadu999 Posted April 30, 2014 Report Posted April 30, 2014 There are seven thieves, They steal diamonds from a diamond merchant and run away in jungle. While running, night sets in and they decide to rest in the jungle When everybody’s sleeping, two of the best friends get up and decide to distribute the diamonds among themselves and run away. So they start distributing but find that one diamond was extra. So they decide to wake up 3rd one and divide the diamonds again …..only to their surprise they still find one diamond extra. So they decide to wake up fourth one. Again one diamond is spare. 5th woken up……still one extra. 6th still one extra. Now they wake up 7th and diamonds are distributed equally. How many minimum diamonds they steal? ee q'n lo assume 11 thieves....and tell me the answer ?
gabbarsingh1 Posted April 30, 2014 Report Posted April 30, 2014 There is one big palace where 5 soldiers stay. Each soldier has 5 rooms. In each room there are 5 big tigers. Each big tiger has 5 little tigers. Each tiger has 4 legs. How many legs are there in the palace? 2510
bio Posted April 30, 2014 Report Posted April 30, 2014 Nope!!...bayya nuv idi cheste cheat cheyakunda..u r thopu!! naa mokam typo man, 7 kottaboyyi 6 kotta, but 7 is the right #
Krish Posted April 30, 2014 Report Posted April 30, 2014 we are looking for a minimum number that's perfectly divisible by 7, leaves 1 when divided by 2 thru 6 and it is an odd number too. so danike c program rasa 301 was the answer lol..ok ok....nuvvu developer aa?? yes this one is bit tricky.....u can get the the number common multiple of 2 to 6 which is LCM...which is 60 then plus 1...so u have to check this (+1) with 7 by constantly adding 60 until u get a number that is divisible by 7 which will be 301..
Krish Posted April 30, 2014 Report Posted April 30, 2014 ee q'n lo assume 11 thieves....and tell me the answer ? 25201 aa answer??
Recommended Posts