tag:blogger.com,1999:blog-61572998497199748812011-11-27T17:47:53.929-06:00Rashadnoreply@blogger.comBlogger391100tag:blogger.com,1999:blog-6157299849719974881.post-78074628052894656252010-02-14T13:26:00.002-06:002010-02-14T13:31:24.376-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 100 </td><td> The 3n+1 problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/100.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 101 </td><td> The Blocks Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/101.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 102 </td><td> Ecological bin packaging </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/102.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 103 </td><td> Stacking Boxes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/103.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 105 </td><td> The Skyline Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/105.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 106 </td><td> Fermat vs Pythagoras </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/106.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 108 </td><td> Maximum Sum </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/108.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 111 </td><td> History Grading </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/111.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 112 </td><td> Tree Summing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/112.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 113 </td><td> Power of Cryptography </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/113.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 115 </td><td> Climbing Trees </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/115.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 116 </td><td> Unidirectional TSP </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/116.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 117 </td><td> The Postal Worker Rings Once </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/117.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 118 </td><td> Mutant Flatworld Explorers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/118.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 119 </td><td> Greedy Gift Givers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/119.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 120 </td><td> Stack of Flapjacks </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/120.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 122 </td><td> Trees on the level </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/122.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 123 </td><td> Searching quickly </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/123.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 124 </td><td> Following orders </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/124.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 125 </td><td> Numbering Paths </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/125.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 128 </td><td> Software CRC </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/128.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 130 </td><td> Roman Roulette </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/130.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 133 </td><td> The Dole Queue </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/133.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 136 </td><td> Ugly Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/136.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 137 </td><td> Polygons </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/137.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 138 </td><td> Street Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/138.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 139 </td><td> Telephone Tangles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/139.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 140 </td><td> Bandwidth </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/140.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 141 </td><td> The Spot Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/141.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 144 </td><td> Student Grants </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/144.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 145 </td><td> Gondwanaland Telecom </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/145.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 146 </td><td> ID Codes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/146.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 147 </td><td> Dollars </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/147.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 148 </td><td> Anagram Checker </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/148.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 151 </td><td> Power Crisis </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/151.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 153 </td><td> Permalex </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/153.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 154 </td><td> Recycling </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/154.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 155 </td><td> All Squares </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/155.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 156 </td><td> Ananagrams </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/156.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 159 </td><td> Word Crosses </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/159.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 160 </td><td> Factors and Factorials </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/160.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 164 </td><td> String Computer </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/164.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 166 </td><td> Making Change </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/166.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 167 </td><td> The Sultan's Successors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/167.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 170 </td><td> Clock Patience </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/170.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 177 </td><td> Paper Folding </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/177.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 187 </td><td> Transaction Processing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/187.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 188 </td><td> Perfect Hash </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/188.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 190 </td><td> Circle Through Three Points </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/190.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 193 </td><td> Graph Coloring </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/193.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 195 </td><td> Anagram </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/195.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 196 </td><td> Spreadsheet </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/196.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 198 </td><td> Peter's Calculator </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/198.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 200 </td><td> Rare Order </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/200.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 201 </td><td> Squares </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/201.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 202 </td><td> Repeating Decimals </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/202.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 208 </td><td> Firetruck </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/208.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 209 </td><td> Triangular Vertices </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/209.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 216 </td><td> Getting in Line </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/216.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 227 </td><td> Puzzle </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/227.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 232 </td><td> Crossword Answers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/232.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 242 </td><td> Stamps and Envelope Size </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/242.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 245 </td><td> Uncompress </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/245.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 247 </td><td> Calling Circles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/247.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 253 </td><td> Cube Painting </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/253.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 255 </td><td> Correct Move </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/255.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 256 </td><td> Quirksome Squares </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/256.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 259 </td><td> Software Allocation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/259.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 260 </td><td> Il Gioco dell X </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/260.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 263 </td><td> Number Chains </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/263.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 264 </td><td> Count on Cantor </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/264.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 268 </td><td> Double Trouble </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/268.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 271 </td><td> Simply Syntax </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/271.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 272 </td><td> TeX Quotes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/272.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 275 </td><td> Expanding Fractions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/275.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 277 </td><td> Cabinets </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/277.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 278 </td><td> Chess </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/278.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 280 </td><td> Vertex </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/280.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 290 </td><td> Palindroms <---> smordnilaP </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/290.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 291 </td><td> The House of Santa Claus </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/291.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 294 </td><td> Divisors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/294.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 297 </td><td> Quadtree </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/297.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 298 </td><td> Race Tracks </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/298.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 299 </td><td> Train Swapping </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/299.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 300 </td><td> Maya Calendar </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/300.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 305 </td><td> Joseph </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/305.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 306 </td><td> Cipher </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/306.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 314 </td><td> Robot </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/314.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 315 </td><td> Network </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/315.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 320 </td><td> Border </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/320.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 324 </td><td> Factorial Frequencies </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/324.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 326 </td><td> Extrapolation using a Difference Table </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/326.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 327 </td><td> Evaluating Simple C Expressions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/327.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 331 </td><td> Mapping the Swaps </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/331.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 332 </td><td> Rational Numbers from Repeating Fractions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/332.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 333 </td><td> Recognizing Good ISBNs </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/333.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 336 </td><td> A Node Too Far </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/336.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 340 </td><td> Mastermind Hints </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/340.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 343 </td><td> What Base Is This? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/343.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 344 </td><td> Roman Digititis </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/344.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-7807462805289465625?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-13526032932272377672010-02-14T13:25:00.000-06:002010-02-14T13:26:42.117-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 347 </td><td> Run, Run, Runaround Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/347.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 348 </td><td> Optimal Array Multiplication Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/348.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 350 </td><td> Pseudo-Random Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/350.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 352 </td><td> The Seasonal War </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/352.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 353 </td><td> Pesky Palindromes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/353.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 355 </td><td> The Bases are Loaded </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/355.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 356 </td><td> Square Pegs and Round Holes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/356.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 357 </td><td> Let Me Count The Ways </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/357.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 369 </td><td> Combinations </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/369.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 371 </td><td> Ackermann Functions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/371.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 374 </td><td> Big Mod </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/374.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 377 </td><td> Cowculations </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/377.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 378 </td><td> Intersecting Lines </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/378.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 379 </td><td> Hi-Q </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/379.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 380 </td><td> Call Forwarding </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/380.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 381 </td><td> Making the Grade </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/381.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 382 </td><td> Perfection </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/382.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 384 </td><td> Slurpys </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/384.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 386 </td><td> Perfect Cubes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/386.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 387 </td><td> A Puzzling Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/387.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 389 </td><td> Basically Speaking </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/389.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 392 </td><td> Polynomial Showdown </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/392.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 394 </td><td> Mapmaker </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/394.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 395 </td><td> Board Silly </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/395.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 397 </td><td> Equation Elation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/397.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 401 </td><td> Palindromes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/401.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 402 </td><td> M*A*S*H </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/402.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 409 </td><td> Excuses, Excuses! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/409.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 410 </td><td> Station Balance </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/410.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 412 </td><td> Pi </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/412.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 414 </td><td> Machined Surfaces </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/414.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 417 </td><td> Word Index </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/417.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 422 </td><td> Word-Search Wonder </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/422.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 423 </td><td> MPI Maelstrom </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/423.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 424 </td><td> Integer Inquiry </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/424.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 436 </td><td> Arbitrage (II) </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/436.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 438 </td><td> Circumference of the Circle </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/438.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 439 </td><td> Knight Moves </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/439.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 440 </td><td> Eeny Meeny Moo </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/440.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 441 </td><td> Lotto </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/441.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 442 </td><td> Matrix Chain Multiplication </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/442.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 443 </td><td> Humble Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/443.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 444 </td><td> Encoder and Decoder </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/444.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 445 </td><td> Marvelous Mazes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/445.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 446 </td><td> Kibbles `n' Bits `n' Bits `n' Bits </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/446.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 447 </td><td> Population Explosion </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/447.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 451 </td><td> Poker Solitaire Evaluator </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/451.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 452 </td><td> Project Scheduling </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/452.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 454 </td><td> Anagrams </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/454.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 457 </td><td> Linear Cellular Automata </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/457.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 458 </td><td> The Decoder </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/458.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 459 </td><td> Graph Connectivity </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/459.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 465 </td><td> Overflow </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/465.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 466 </td><td> Mirror, Mirror </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/466.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 468 </td><td> Key to Success </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/468.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 469 </td><td> Wetlands of Florida </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/469.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 474 </td><td> Heads Tails Probability </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/474.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 476 </td><td> Points in Figures: Rectangles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/476.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 477 </td><td> Points in Figures: Rectangles and Circles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/477.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 478 </td><td> Points in Figures: Rectangles, Circles, and Triangles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/478.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 481 </td><td> What Goes Up </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/481.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 482 </td><td> Permutation Arrays </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/482.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 483 </td><td> Word Scramble </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/483.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 484 </td><td> The Department of Redundancy Department </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/484.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 485 </td><td> Pascal s Triangle of Death </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/485.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 486 </td><td> English Number Translator </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/486.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 487 </td><td> Boggle Blitz </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/487.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 488 </td><td> Triangle Wave </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/488.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 489 </td><td> Hangman Judge </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/489.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 490 </td><td> Rotating Sentences </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/490.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 492 </td><td> Pig-Latin </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/492.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 493 </td><td> Rational Spiral </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/493.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 494 </td><td> Kindergarten Counting Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/494.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 496 </td><td> Simply Subsets </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/496.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 498 </td><td> Polly The Polynomial </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/498.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 499 </td><td> What's The Frequency, Kenneth? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/499.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 501 </td><td> Black Box </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/501.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 507 </td><td> Jill Rides Again </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/507.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 514 </td><td> Rails </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/514.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 516 </td><td> Prime Land </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/516.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 517 </td><td> Word </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/517.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 519 </td><td> Puzzle (II) </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/519.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 521 </td><td> Gossiping </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/521.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 523 </td><td> Minimum Transport Cost </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/523.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 526 </td><td> String Distance and Transform Process </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/526.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 529 </td><td> Addition Chains </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/529.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 530 </td><td> Binomial Showdown </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/530.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 532 </td><td> Dungeon Master </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/532.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 534 </td><td> Frogger </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/534.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 536 </td><td> Tree Recovery </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/536.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 537 </td><td> Artificial Intelligence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/537.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 538 </td><td> Balancing Bank Accounts </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/538.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 539 </td><td> The Settlers of Catan </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/539.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 540 </td><td> The Settlers of Catan </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/540.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 541 </td><td> Error Correction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/541.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 542 </td><td> France 98 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/542.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 543 </td><td> Goldbach's Conjecture </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/543.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 544 </td><td> Heavy Cargo </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/544.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 545 </td><td> Heads </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/545.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 547 </td><td> DDF </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/547.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-1352603293227237767?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com1tag:blogger.com,1999:blog-6157299849719974881.post-22070836797403369052010-02-14T13:24:00.000-06:002010-02-14T13:25:11.019-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 548 </td><td> Tree </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/548.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 551 </td><td> Nesting a Bunch of Brackets </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/551.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 555 </td><td> Bridge Hands </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/555.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 558 </td><td> Wormholes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/558.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 561 </td><td> Jackpot </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/561.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 562 </td><td> Dividing Coins </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/562.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 568 </td><td> Just the Facts </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/568.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 571 </td><td> Jugs </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/571.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 572 </td><td> Oil Deposits </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/572.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 573 </td><td> The Snail </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/573.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 574 </td><td> Sum It Up </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/574.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 575 </td><td> Skew Binary </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/575.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 576 </td><td> Haiku Review </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/576.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 579 </td><td> ClockHands </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/579.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 580 </td><td> Critical Mass </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/580.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 583 </td><td> Prime Factors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/583.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 584 </td><td> Bowling </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/584.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 586 </td><td> Instant Complexity </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/586.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 587 </td><td> There s Treasure Everywhere </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/587.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 590 </td><td> Always on the Run </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/590.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 591 </td><td> Box of Bricks </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/591.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 593 </td><td> MBone </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/593.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 594 </td><td> One Little, Two Little, Three Little Endians </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/594.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 598 </td><td> Bundling Newspapers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/598.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 599 </td><td> The Forrest for the Trees </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/599.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 601 </td><td> The Path </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/601.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 604 </td><td> The Boggle Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/604.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 607 </td><td> Scheduling Lectures </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/607.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 608 </td><td> Counterfeit Dollar </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/608.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 615 </td><td> Is It A Tree </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/615.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 620 </td><td> Cellular Structure </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/620.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 621 </td><td> Secret Research </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/621.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 623 </td><td> 500! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/623.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 624 </td><td> CD </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/624.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 626 </td><td> Ecosystem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/626.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 627 </td><td> The Net </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/627.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 632 </td><td> Compression (II) </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/632.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 636 </td><td> Squares (III) </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/636.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 639 </td><td> Don t Get Rooked </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/639.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 640 </td><td> Self Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/640.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 641 </td><td> Do the Untwist </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/641.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 642 </td><td> Word Amalgamation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/642.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 644 </td><td> Immediate Decodability </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/644.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 647 </td><td> Chutes and Ladders </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/647.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 652 </td><td> Eight </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/652.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 653 </td><td> Gizilch </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/653.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 654 </td><td> Ratio </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/654.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 665 </td><td> Scrabble </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/665.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 668 </td><td> Parliament </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/668.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 671 </td><td> Spell checker </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/671.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 674 </td><td> Coin Change </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/674.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 677 </td><td> All Walks of length "n" from the first node </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/677.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 679 </td><td> Dropping Balls </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/679.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 682 </td><td> Whoever-pick-the-last-one-lose </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/682.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 686 </td><td> Goldbach's Conjecture (II) </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/686.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 694 </td><td> The Collatz Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/694.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 696 </td><td> How Many Knights </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/696.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 698 </td><td> Index </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/698.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 703 </td><td> Triple Ties: The Organizer's Nightmare </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/703.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 710 </td><td> The Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/710.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 712 </td><td> S-Trees </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/712.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 713 </td><td> Adding Reversed Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/713.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 721 </td><td> Invitation Cards </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/721.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 725 </td><td> Division </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/725.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 727 </td><td> Equation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/727.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 729 </td><td> Hamming Distance Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/729.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 732 </td><td> Anagrams by Stack </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/732.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 740 </td><td> Baudot Data Communication Code </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/740.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 748 </td><td> Exponentiation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/748.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 753 </td><td> A Plug for Unix </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/753.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 755 </td><td> 487-3279 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/755.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 762 </td><td> We Ship Cheap </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/762.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 785 </td><td> Grid Colouring </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/785.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 793 </td><td> Network Connections </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/793.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 806 </td><td> Spatial Structures </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/806.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 820 </td><td> Internet Bandwidth </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/820.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 821 </td><td> Page Hopping </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/821.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 825 </td><td> Walking on the Safe Side </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/825.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 834 </td><td> Continued Fractions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/834.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 836 </td><td> Largest Submatrix </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/836.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 839 </td><td> Not so Mobile </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/839.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 846 </td><td> Steps </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/846.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 847 </td><td> A multiplication game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/847.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 850 </td><td> Crypt Kicker II </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/850.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 855 </td><td> Lunch in Grid City </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/855.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 865 </td><td> Substitution Cypher </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/865.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 869 </td><td> Airline Comparison </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/869.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 871 </td><td> Counting Cells in a Blob </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/871.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 872 </td><td> Ordering </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/872.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 879 </td><td> Circuit Nets </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/879.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 880 </td><td> Cantor Fractions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/880.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 884 </td><td> Factorial Factors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/884.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 892 </td><td> Finding words </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/892.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 895 </td><td> Word Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/895.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 897 </td><td> Anagrammatic Primes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/897.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 899 </td><td> Colour Circles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/899.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 900 </td><td> Brick Wall Patterns </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/900.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 913 </td><td> Joanna and the Odd Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/913.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 926 </td><td> Walking Around Wisely </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/926.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 974 </td><td> Kaprekar Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/974.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-2207083679740336905?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-52810180900327385962010-02-14T13:22:00.000-06:002010-02-14T13:23:21.381-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 993 </td><td> product of digits </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/993.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10000 </td><td> Longest Paths </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10000.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10003 </td><td> Cutting Sticks </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10003.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10004 </td><td> Bicoloring </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10004.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10006 </td><td> Carmichael Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10006.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10008 </td><td> What's Cryptanalysis? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10008.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10009 </td><td> All Roads Lead Where? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10009.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10010 </td><td> Where's Waldorf? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10010.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10013 </td><td> Super long sums </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10013.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10014 </td><td> Simple Calculations </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10014.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10015 </td><td> Joseph's Cousin </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10015.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10016 </td><td> Flip-Flop the Squarelotron </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10016.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10018 </td><td> Reverse and add </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10018.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10019 </td><td> Funny Encryption Method </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10019.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10022 </td><td> Delta-wave </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10022.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10025 </td><td> The ?1?2?3?...?n = k problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10025.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10026 </td><td> Shoemaker s problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10026.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10029 </td><td> Edit Step Ladders </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10029.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10032 </td><td> Tug of War </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10032.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10033 </td><td> Interpreter </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10033.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10034 </td><td> Freckles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10034.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10035 </td><td> Primary Arithmetic </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10035.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10036 </td><td> Divisibility </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10036.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10037 </td><td> Bridge </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10037.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10038 </td><td> Jolly Jumpers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10038.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10041 </td><td> Vito s family </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10041.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10042 </td><td> Smith Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10042.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10047 </td><td> The Monocycle </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10047.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10048 </td><td> Audiophobia </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10048.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10049 </td><td> Self </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10049.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10050 </td><td> Hartals </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10050.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10051 </td><td> Tower of Cubes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10051.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10054 </td><td> The Necklace </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10054.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10055 </td><td> Hashmat the Brave Warrior </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10055.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10056 </td><td> What is the Probability? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10056.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10057 </td><td> A mid </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10057.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10061 </td><td> How Many Zeros and How Many Digits? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10061.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10062 </td><td> Tell Me The Frequencies </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10062.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10063 </td><td> Knuth s Permutation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10063.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10066 </td><td> The Twin Towers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10066.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10067 </td><td> Playing with Wheels </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10067.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10068 </td><td> The Treasure Hunt </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10068.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10069 </td><td> Distinct Subsequences </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10069.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10070 </td><td> Leap Year or Not Leap Year and ... </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10070.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10071 </td><td> Back to High School Physics </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10071.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10074 </td><td> Take the Land </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10074.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10077 </td><td> Stern </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10077.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10079 </td><td> Pizza Cutting </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10079.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10080 </td><td> Gopher II </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10080.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10082 </td><td> WERTYU </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10082.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10085 </td><td> The most distant state </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10085.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10092 </td><td> The Problem with the Problemsetter </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10092.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10093 </td><td> An Easy Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10093.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10097 </td><td> The Color Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10097.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10098 </td><td> Generating Fast, Sorted Permutation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10098.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10099 </td><td> Tourist Guide </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10099.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10100 </td><td> Longest Match </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10100.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10102 </td><td> The Path in the Colored Field </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10102.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10104 </td><td> Euclid Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10104.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10106 </td><td> Product </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10106.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10107 </td><td> What is the Median? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10107.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10111 </td><td> Find the Winning Move </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10111.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10113 </td><td> Exchange Rates </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10113.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10115 </td><td> Automatic Editing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10115.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10120 </td><td> Gift?! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10120.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10125 </td><td> Sumsets </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10125.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10126 </td><td> Zipf s Law </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10126.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10127 </td><td> Ones </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10127.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10128 </td><td> Queue </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10128.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10129 </td><td> Play on Words </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10129.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10130 </td><td> SuperSale </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10130.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10131 </td><td> Is Bigger Smarter? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10131.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10132 </td><td> File Fragmentation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10132.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10133 </td><td> Audubon s Stormy Artic Trip </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10133.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10137 </td><td> The Trip </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10137.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10138 </td><td> CDVII </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10138.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10140 </td><td> Prime Distances </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10140.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10141 </td><td> Request for Proposal </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10141.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10147 </td><td> Highways </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10147.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10150 </td><td> Doublets </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10150.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10152 </td><td> Shellsort </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10152.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10161 </td><td> Ant on a Chessboard </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10161.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10162 </td><td> Last Digit </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10162.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10164 </td><td> Number Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10164.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10168 </td><td> Summation of Four Primes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10168.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10170 </td><td> The Hotel with Infinte Rooms </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10170.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10171 </td><td> Meeting Prof. Miguel </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10171.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10174 </td><td> Couple </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10174.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10176 </td><td> Ocean Deep! Make it shallow!! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10176.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10177 </td><td> (2/3/4)-D Sqr/Rects/Cubes/Boxes? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10177.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10178 </td><td> Count the Faces </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10178.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10179 </td><td> Irreducable Basic Fractions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10179.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10181 </td><td> 15 Puzzle </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10181.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10183 </td><td> How Many Fibs? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10183.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10188 </td><td> Automated Judge Script </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10188.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10189 </td><td> Mine Sweeper </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10189.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10190 </td><td> Divide but not quite Conquer </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10190.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10191 </td><td> Longest Nap </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10191.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10192 </td><td> Vacation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10192.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10193 </td><td> All You Need Is Love </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10193.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5281018090032738596?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-61987173150737174982010-02-14T13:20:00.000-06:002010-02-14T13:21:53.370-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 10194 </td><td> Football </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10194.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10195 </td><td> Knights of the round table </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10195.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10198 </td><td> Counting </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10198.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10199 </td><td> Tourist Guide </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10199.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10202 </td><td> Pairsumonious Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10202.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10205 </td><td> Stack em Up </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10205.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10212 </td><td> The Last Non </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10212.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10213 </td><td> How many pieces of land </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10213.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10219 </td><td> Find the Ways! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10219.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10220 </td><td> I Love Big Numbers ! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10220.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10222 </td><td> Decode the Mad man </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10222.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10223 </td><td> How Many Nodes? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10223.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10226 </td><td> Hardwood Species </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10226.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10229 </td><td> Modular Fibonacci </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10229.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10232 </td><td> Bit-wise Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10232.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10235 </td><td> Simply Emirp </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10235.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10243 </td><td> Fire! Fire!! Fire!!! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10243.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10246 </td><td> Asterix and Obelix </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10246.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10249 </td><td> The Grand Dinner </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10249.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10252 </td><td> Common Permutation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10252.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10258 </td><td> Contestant scoreboard </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10258.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10259 </td><td> Hippity Hopscotch </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10259.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10260 </td><td> Soundex </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10260.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10269 </td><td> Adventure of Super Mario </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10269.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10276 </td><td> Hanoi Tower Troubles Again </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10276.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10279 </td><td> Minesweeper </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10279.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10281 </td><td> Average Speed </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10281.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10282 </td><td> Babelfish </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10282.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10284 </td><td> Chessboard in FEN </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10284.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10285 </td><td> Longest Run on a Snowboard </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10285.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10290 </td><td> {Sum+=i++} to Reach N </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10290.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10293 </td><td> Word Length and Frequency </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10293.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10295 </td><td> Hay Points </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10295.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10296 </td><td> Jogging Trails </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10296.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10298 </td><td> Power Strings </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10298.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10299 </td><td> Number Theory </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10299.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10300 </td><td> Ecological Premium </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10300.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10301 </td><td> Rings and Glue </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10301.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10302 </td><td> Summation of Polynomials </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10302.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10303 </td><td> How Many Trees </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10303.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10305 </td><td> Ordering Tasks </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10305.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10307 </td><td> Killing Aliens in Borg Maze </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10307.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10308 </td><td> Roads in the North </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10308.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10310 </td><td> Dog and gopher </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10310.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10311 </td><td> Goldbach and Euler </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10311.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10312 </td><td> Expression Bracketing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10312.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10315 </td><td> Poker Hands </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10315.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10323 </td><td> Factorial! You Must Be Kidding </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10323.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10324 </td><td> Zeros and Ones </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10324.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10325 </td><td> The Lottery </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10325.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10326 </td><td> The Polynomial Equation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10326.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10327 </td><td> Flip Sort </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10327.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10329 </td><td> Combinatorial Expression </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10329.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10331 </td><td> The Flyover Construction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10331.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10334 </td><td> Ray Through Glasses </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10334.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10336 </td><td> Rank the Languages </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10336.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10340 </td><td> All in All </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10340.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10342 </td><td> Always Late </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10342.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10344 </td><td> 23 Out of 5 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10344.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10346 </td><td> Peter s Smokes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10346.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10347 </td><td> Medians </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10347.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10354 </td><td> Avoiding Your Boss </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10354.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10356 </td><td> Rough Roads </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10356.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10359 </td><td> Tiling </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10359.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10360 </td><td> Rat Attack </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10360.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10361 </td><td> Automatic Poetry </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10361.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10363 </td><td> Tic Tac Toe </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10363.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10364 </td><td> Square </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10364.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10365 </td><td> Blocks </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10365.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10368 </td><td> Euclid s Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10368.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10369 </td><td> Artic Networks </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10369.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10370 </td><td> Above Average </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10370.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10374 </td><td> Election </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10374.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10375 </td><td> Choose and Divide </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10375.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10384 </td><td> The Wall Pushers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10384.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10385 </td><td> Duathlon </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10385.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10391 </td><td> Compound Words </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10391.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10392 </td><td> Factoring Large Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10392.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10393 </td><td> The One-Handed Typist </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10393.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10394 </td><td> Twin Primes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10394.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10397 </td><td> Connect the Campus </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10397.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10400 </td><td> Game Show Math </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10400.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10401 </td><td> Injured Queen Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10401.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10404 </td><td> Bachet s Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10404.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10405 </td><td> Longest Common Subsequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10405.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10407 </td><td> Simple Division </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10407.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10408 </td><td> Farey Sequences </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10408.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10409 </td><td> Die Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10409.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10420 </td><td> List of Conquests </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10420.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10421 </td><td> Critical Wave </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10421.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10422 </td><td> Knights in Fen </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10422.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10424 </td><td> Love Calculator </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10424.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10426 </td><td> Knights' Nightmare </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10426.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10427 </td><td> Naughty Sleepy Boys </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10427.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10432 </td><td> Polygon Inside A Circle </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10432.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10436 </td><td> Cheapest way </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10436.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10437 </td><td> Playing With Fraction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10437.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10440 </td><td> Ferry Loading II </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10440.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10443 </td><td> Rock, Scissors, Paper </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10443.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10446 </td><td> The Marriage Interview :-) </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10446.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-6198717315073717498?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-44555826651873533322010-02-14T13:17:00.000-06:002010-02-14T13:19:51.993-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 10451 </td><td> Ancient Village Sports </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10451.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10453 </td><td> Make Palindrome </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10453.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10459 </td><td> The Tree Root </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10459.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10460 </td><td> Find the Permuted String </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10460.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10461 </td><td> Difference </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10461.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10462 </td><td> Is There A Second Way Left? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10462.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10463 </td><td> Is There A Second Way Left? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10463.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10464 </td><td> Big Big Real Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10464.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10465 </td><td> Homer Simpson </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10465.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10469 </td><td> To Carry or not to Carry </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10469.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10473 </td><td> Simple Base Conversion </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10473.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10476 </td><td> Spam or Not Spam </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10476.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10477 </td><td> The Hybrid Knight </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10477.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10480 </td><td> Sabotage </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10480.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10482 </td><td> The Candyman Can </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10482.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10484 </td><td> Divisibility of Factors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10484.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10487 </td><td> Closests Sums </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10487.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10489 </td><td> Boxes of Chocolates </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10489.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10490 </td><td> Mr. Azad and his Son!!!!! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10490.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10493 </td><td> Cats, with or without Hats </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10493.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10494 </td><td> If We Were a Child Again </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10494.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10496 </td><td> Collecting Beepers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10496.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10497 </td><td> Sweet Child Makes Trouble </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10497.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10499 </td><td> The Land of Justice </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10499.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10500 </td><td> Robot maps </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10500.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10502 </td><td> Counting Rectangles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10502.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10503 </td><td> The dominoes solitaire </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10503.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10504 </td><td> Hidden squares </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10504.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10506 </td><td> The Ouroboros problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10506.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10507 </td><td> Waking up brain </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10507.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10508 </td><td> Word Morphing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10508.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10509 </td><td> R U Kidding Mr. Feynman </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10509.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10510 </td><td> Cactus </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10510.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10515 </td><td> Power et al </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10515.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10518 </td><td> How Many Calls? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10518.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10523 </td><td> Very Easy!!! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10523.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10530 </td><td> Guessing Game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10530.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10532 </td><td> Combination! Once Again </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10532.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10533 </td><td> Digit Primes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10533.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10534 </td><td> Wavio Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10534.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10536 </td><td> AAAGame of Euler </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10536.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10539 </td><td> Almost Prime Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10539.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10543 </td><td> Traveling Politician </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10543.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10544 </td><td> Numbering the Paths </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10544.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10549 </td><td> Russian Dolls </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10549.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10550 </td><td> Combination Lock </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10550.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10551 </td><td> Basic Remains </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10551.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10557 </td><td> XYZZY </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10557.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10564 </td><td> Paths Through The Hourglass </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10564.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10567 </td><td> Helping Fill Bates </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10567.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10568 </td><td> n Group k </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10568.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10571 </td><td> Products </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10571.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10573 </td><td> Geometry Paradox </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10573.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10574 </td><td> Counting Rectangles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10574.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10578 </td><td> The Game of 31 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10578.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10579 </td><td> Fibonacci Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10579.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10583 </td><td> Ubiquitous Religions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10583.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10591 </td><td> Happy Number </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10591.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10595 </td><td> Knight on the Bee Board </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10595.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10596 </td><td> Morning Walk </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10596.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10599 </td><td> Robots (II) </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10599.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10600 </td><td> ACM Contest and Blackout </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10600.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10602 </td><td> Editor Nottobad </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10602.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10603 </td><td> Fill </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10603.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10604 </td><td> Chemical Reaction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10604.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10608 </td><td> Friends </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10608.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10610 </td><td> Gopher and Hakws </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10610.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10611 </td><td> The Playboy Chimp </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10611.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10616 </td><td> Divisible Group Sums </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10616.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10617 </td><td> Again Palindromes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10617.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10620 </td><td> A Flea on a Chessboard </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10620.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10622 </td><td> Perfect Pth Powers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10622.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10625 </td><td> GNU = GNU'sNotUnix </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10625.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10633 </td><td> Rare Easy Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10633.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10635 </td><td> Prince and Princess </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10635.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10637 </td><td> Coprimes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10637.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10642 </td><td> Can You Solve It </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10642.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10650 </td><td> Determinate Prime </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10650.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10651 </td><td> Pebble Solitaire </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10651.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10653 </td><td> Bombs! NO they are Mines!! </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10653.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10656 </td><td> Maximum Sum II </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10656.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10662 </td><td> The Wedding </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10662.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10663 </td><td> Non-Powerful Subsets </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10663.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10664 </td><td> Luggage </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10664.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10667 </td><td> Largest Block </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10667.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10669 </td><td> 10669 - Three powers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10669.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10670 </td><td> Work Reduction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10670.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10672 </td><td> Marbles on a tree </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10672.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10673 </td><td> Play with Floor and Ceil </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10673.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10677 </td><td> Base Equality </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10677.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10678 </td><td> The Grazing Cow </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10678.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10680 </td><td> LCM </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10680.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10681 </td><td> Teobaldo's Trip </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10681.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10683 </td><td> The decadary watch </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10683.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10684 </td><td> The Jackpot </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10684.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10685 </td><td> Nature </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10685.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10687 </td><td> Monitoring the Amazon </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10687.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10689 </td><td> Yet another Number Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10689.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10690 </td><td> Expression Again </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10690.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10696 </td><td> f91 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10696.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-4455582665187353332?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-61010821512465354872010-02-14T12:41:00.001-06:002010-02-14T13:17:07.617-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 10698 </td><td> Football Sort </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10698.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10699 </td><td> Count the Factors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10699.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10700 </td><td> Camel Trading </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10700.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10701 </td><td> Pre in and Post </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10701.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10702 </td><td> Travelling Salesman </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10702.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10703 </td><td> Free Spots </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10703.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10705 </td><td> The Fun Number System </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10705.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10706 </td><td> Number Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10706.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10714 </td><td> Colliding Ants </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10714.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10716 </td><td> Evil Straw Warts Live </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10716.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10717 </td><td> Mint </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10717.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10718 </td><td> Bit Mask </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10718.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10719 </td><td> Quotient Polynomial </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10719.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10720 </td><td> Graph Construction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10720.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10722 </td><td> Super Lucky Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10722.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10724 </td><td> Road Construction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10724.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10730 </td><td> Antiarithmetic </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10730.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10739 </td><td> String to Palindrome </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10739.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10740 </td><td> Not the Best </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10740.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10742 </td><td> The New Rule in Euphomia </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10742.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10745 </td><td> Dominant Strings </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10745.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10759 </td><td> Dice Throwing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10759.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10763 </td><td> Foreign Exchange </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10763.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10771 </td><td> Barbarian tribes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10771.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10776 </td><td> Determine The Combination </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10776.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10780 </td><td> Again Prime No time </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10780.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10783 </td><td> Odd Sum </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10783.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10784 </td><td> Diagonal </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10784.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10785 </td><td> The Mad Numerologist </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10785.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10787 </td><td> Modular Equations </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10787.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10788 </td><td> Parenthesizing Palindromes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10788.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10789 </td><td> Prime Frequency </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10789.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10790 </td><td> How Many Points of Intersection </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10790.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10791 </td><td> Minimum Sum LCM </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10791.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10793 </td><td> The Orc Attack </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10793.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10800 </td><td> Not That Kind of Graph </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10800.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10801 </td><td> Lift Hopping </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10801.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10803 </td><td> Thunder Mountain </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10803.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10806 </td><td> Dijkstra Dijkstra </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10806.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10810 </td><td> Ultra Quicksort </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10810.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10812 </td><td> Beat the Spread </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10812.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10813 </td><td> Traditional BINGO </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10813.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10814 </td><td> Simplifying Fractions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10814.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10815 </td><td> Andy s First Dictionary </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10815.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10816 </td><td> Travel in the Desert </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10816.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10818 </td><td> Dora Trip </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10818.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10819 </td><td> Trouble of 13 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10819.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10820 </td><td> Send A Table </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10820.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10822 </td><td> Planet of the Rock, Paper and Scissors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10822.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10823 </td><td> Of Circles and Squares </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10823.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10827 </td><td> Maximum Sum on a Torus </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10827.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10830 </td><td> A New Function </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10830.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10832 </td><td> Yoyodyne </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10832.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10842 </td><td> Traffic Flow </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10842.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10843 </td><td> Anne's game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10843.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10848 </td><td> Make Palindrome Checker </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10848.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10849 </td><td> Move the bishop </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10849.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10852 </td><td> Less Prime </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10852.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10855 </td><td> Rotated square </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10855.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10856 </td><td> Recover Factorial </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10856.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10860 </td><td> Many a Little makes a Mickle </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10860.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10862 </td><td> Connect the Cable Wires </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10862.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10871 </td><td> Primed Subsequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10871.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10874 </td><td> Segments </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10874.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10878 </td><td> Decode the Tape </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10878.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10879 </td><td> Code Refactoring </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10879.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10880 </td><td> Colin and Ryan </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10880.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10890 </td><td> Maze </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10890.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10891 </td><td> Game of Sum </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10891.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10892 </td><td> LCM Cardinality </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10892.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10895 </td><td> Matrix Transpose </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10895.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10896 </td><td> Known Plaintext Attack </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10896.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10898 </td><td> Combo Deal </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10898.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10901 </td><td> Ferry Loading III </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10901.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10903 </td><td> Rock </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10903.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10908 </td><td> Largest Square </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10908.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10910 </td><td> Mark s Distribution </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10910.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10911 </td><td> Forming Quiz Teams </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10911.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10912 </td><td> Simple Minded Hashing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10912.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10913 </td><td> Walking on a Grid </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10913.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10914 </td><td> Abundance and Perfect Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10914.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10916 </td><td> Factstone Benchmark </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10916.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10917 </td><td> Walk Through the Forest </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10917.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10919 </td><td> Preqrequisites </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10919.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10920 </td><td> Spiral Tap </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10920.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10921 </td><td> Find the Telephone </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10921.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10922 </td><td> 2 the 9s </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10922.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10923 </td><td> Seven Seas </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10923.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10924 </td><td> Prime Words </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10924.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10925 </td><td> Krakovia </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10925.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10926 </td><td> How Many Dependencies </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10926.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10929 </td><td> You can say 11 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10929.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10930 </td><td> A-Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10930.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10931 </td><td> Parity </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10931.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10935 </td><td> Throwing cards away I </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10935.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10937 </td><td> Blackbeard the Pirate </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10937.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10938 </td><td> Flea Circus </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10938.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10940 </td><td> Throwing Cards Away II </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10940.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10943 </td><td> How do you add </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10943.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10944 </td><td> Nuts for nuts.. </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10944.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-6101082151246535487?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-59996391164066061432010-02-14T12:41:00.000-06:002010-02-14T13:16:58.953-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 10698 </td><td> Football Sort </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10698.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10699 </td><td> Count the Factors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10699.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10700 </td><td> Camel Trading </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10700.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10701 </td><td> Pre in and Post </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10701.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10702 </td><td> Travelling Salesman </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10702.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10703 </td><td> Free Spots </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10703.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10705 </td><td> The Fun Number System </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10705.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10706 </td><td> Number Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10706.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10714 </td><td> Colliding Ants </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10714.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10716 </td><td> Evil Straw Warts Live </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10716.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10717 </td><td> Mint </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10717.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10718 </td><td> Bit Mask </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10718.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10719 </td><td> Quotient Polynomial </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10719.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10720 </td><td> Graph Construction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10720.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10722 </td><td> Super Lucky Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10722.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10724 </td><td> Road Construction </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10724.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10730 </td><td> Antiarithmetic </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10730.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10739 </td><td> String to Palindrome </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10739.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10740 </td><td> Not the Best </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10740.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10742 </td><td> The New Rule in Euphomia </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10742.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10745 </td><td> Dominant Strings </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10745.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10759 </td><td> Dice Throwing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10759.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10763 </td><td> Foreign Exchange </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10763.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10771 </td><td> Barbarian tribes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10771.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10776 </td><td> Determine The Combination </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10776.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10780 </td><td> Again Prime No time </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10780.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10783 </td><td> Odd Sum </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10783.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10784 </td><td> Diagonal </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10784.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10785 </td><td> The Mad Numerologist </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10785.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10787 </td><td> Modular Equations </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10787.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10788 </td><td> Parenthesizing Palindromes </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10788.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10789 </td><td> Prime Frequency </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10789.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10790 </td><td> How Many Points of Intersection </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10790.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10791 </td><td> Minimum Sum LCM </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10791.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10793 </td><td> The Orc Attack </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10793.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10800 </td><td> Not That Kind of Graph </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10800.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10801 </td><td> Lift Hopping </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10801.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10803 </td><td> Thunder Mountain </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10803.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10806 </td><td> Dijkstra Dijkstra </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10806.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10810 </td><td> Ultra Quicksort </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10810.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10812 </td><td> Beat the Spread </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10812.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10813 </td><td> Traditional BINGO </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10813.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10814 </td><td> Simplifying Fractions </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10814.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10815 </td><td> Andy s First Dictionary </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10815.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10816 </td><td> Travel in the Desert </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10816.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10818 </td><td> Dora Trip </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10818.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10819 </td><td> Trouble of 13 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10819.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10820 </td><td> Send A Table </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10820.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10822 </td><td> Planet of the Rock, Paper and Scissors </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10822.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10823 </td><td> Of Circles and Squares </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10823.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10827 </td><td> Maximum Sum on a Torus </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10827.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10830 </td><td> A New Function </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10830.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10832 </td><td> Yoyodyne </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10832.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10842 </td><td> Traffic Flow </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10842.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10843 </td><td> Anne's game </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10843.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10848 </td><td> Make Palindrome Checker </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10848.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10849 </td><td> Move the bishop </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10849.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10852 </td><td> Less Prime </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10852.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10855 </td><td> Rotated square </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10855.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10856 </td><td> Recover Factorial </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10856.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10860 </td><td> Many a Little makes a Mickle </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10860.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10862 </td><td> Connect the Cable Wires </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10862.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10871 </td><td> Primed Subsequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10871.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10874 </td><td> Segments </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10874.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10878 </td><td> Decode the Tape </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10878.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10879 </td><td> Code Refactoring </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10879.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10880 </td><td> Colin and Ryan </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10880.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10890 </td><td> Maze </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10890.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10891 </td><td> Game of Sum </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10891.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10892 </td><td> LCM Cardinality </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10892.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10895 </td><td> Matrix Transpose </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10895.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10896 </td><td> Known Plaintext Attack </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10896.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10898 </td><td> Combo Deal </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10898.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10901 </td><td> Ferry Loading III </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10901.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10903 </td><td> Rock </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10903.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10908 </td><td> Largest Square </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10908.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10910 </td><td> Mark s Distribution </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10910.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10911 </td><td> Forming Quiz Teams </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10911.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10912 </td><td> Simple Minded Hashing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10912.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10913 </td><td> Walking on a Grid </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10913.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10914 </td><td> Abundance and Perfect Numbers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10914.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10916 </td><td> Factstone Benchmark </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10916.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10917 </td><td> Walk Through the Forest </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10917.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10919 </td><td> Preqrequisites </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10919.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10920 </td><td> Spiral Tap </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10920.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10921 </td><td> Find the Telephone </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10921.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10922 </td><td> 2 the 9s </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10922.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10923 </td><td> Seven Seas </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10923.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10924 </td><td> Prime Words </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10924.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10925 </td><td> Krakovia </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10925.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10926 </td><td> How Many Dependencies </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10926.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10929 </td><td> You can say 11 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10929.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10930 </td><td> A-Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10930.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10931 </td><td> Parity </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10931.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10935 </td><td> Throwing cards away I </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10935.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10937 </td><td> Blackbeard the Pirate </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10937.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10938 </td><td> Flea Circus </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10938.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10940 </td><td> Throwing Cards Away II </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10940.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10943 </td><td> How do you add </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10943.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10944 </td><td> Nuts for nuts.. </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10944.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5999639116406606143?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-1024478016244248442010-02-14T12:26:00.002-06:002010-02-14T13:11:46.914-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Problem Id.</th> <th align="center">Title</th> <th align="center">Download</th> </tr> <tr background="img/side_bg1.gif"><td> 10945 </td><td> Mother Bear </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10945.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10946 </td><td> You want what filled </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10946.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10947 </td><td> Bear with me, again.. </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10947.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10948 </td><td> The Primary Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10948.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10950 </td><td> Bad Code </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10950.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10954 </td><td> Add All </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10954.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10956 </td><td> Prime Suspect </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10956.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10957 </td><td> So Doku Checker </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10957.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10958 </td><td> How Many Solutions? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10958.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10963 </td><td> The Swallowing Ground </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10963.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10964 </td><td> Strange Planet </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10964.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10965 </td><td> Khepel's Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10965.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10968 </td><td> KuPellaKeS </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10968.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10970 </td><td> Big Chocolate </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10970.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10973 </td><td> RevolC FaeLoN </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10973.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10976 </td><td> Fractions Again </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10976.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10977 </td><td> Enchanted Forest </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10977.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10980 </td><td> Lowest Price in Town </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10980.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10982 </td><td> Troublemakers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10982.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10984 </td><td> Double NP-hard </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10984.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10986 </td><td> Sending email </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10986.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10987 </td><td> Antifloyd </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10987.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10990 </td><td> Another New Function </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10990.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10992 </td><td> The Ghost of Programmers </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10992.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10994 </td><td> Simple Addition </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10994.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 10999 </td><td> Crabbles </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/10999.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11000 </td><td> Bee </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11000.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11005 </td><td> Cheapest Base </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11005.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11015 </td><td> 05 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11015.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11026 </td><td> A Grouping Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11026.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11027 </td><td> Palindromic Permutation </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11027.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11029 </td><td> Leading and Trailing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11029.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11032 </td><td> Function Overloading </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11032.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11038 </td><td> How Many O's? </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11038.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11039 </td><td> Building designing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11039.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11040 </td><td> Add Bricks in the Wall </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11040.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11042 </td><td> Complex, difficult and complicated </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11042.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11044 </td><td> Searching For Nessy </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11044.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11045 </td><td> My T </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11045.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11047 </td><td> The Scrooge Co Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11047.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11049 </td><td> Basic Wall Maze </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11049.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11053 </td><td> Flavius Josephus Reloaded </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11053.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11054 </td><td> Wine Trading in Gergovia </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11054.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11055 </td><td> Homogeneous Squares </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11055.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11056 </td><td> Formula 1 </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11056.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11057 </td><td> Exact Sum </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11057.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11058 </td><td> Encoding </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11058.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11059 </td><td> Maximum Product </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11059.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11060 </td><td> Beverages </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11060.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11062 </td><td> Andy's Second Dictionary </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11062.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11063 </td><td> B2 Sequence </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11063.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11064 </td><td> Number Theory </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11064.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11067 </td><td> Little Red Riding Hood </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11067.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11069 </td><td> A Graph Problem </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11069.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11073 </td><td> Euler's Totient Function </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11073.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11074 </td><td> Draw Grid </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11074.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11076 </td><td> Add Again </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11076.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11078 </td><td> Open Credit System </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11078.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11080 </td><td> Place the Guards </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11080.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11083 </td><td> Zeroes Revisited </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11083.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11086 </td><td> Composite Prime </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11086.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11087 </td><td> Divisibility Testing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11087.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11088 </td><td> End up with More Teams </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11088.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11089 </td><td> Fi-binary Number </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11089.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11093 </td><td> Just Finish it up </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11093.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11500 </td><td> Vampires </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11500.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11503 </td><td> Virtual Friends </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11503.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11520 </td><td> Fill the Square </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11520.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11526 </td><td> H n </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11526.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11530 </td><td> SMS Typing </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11530.cpp">Download/View</a></td></tr> <tr background="img/side_bg1.gif"><td> 11541 </td><td> Decoding </td><td align="right"><a href="http://www.youngprogrammer.com/cpp/11541.cpp">Download/View</a></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-102447801624424844?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-51232011554180237532010-02-14T12:11:00.001-06:002010-02-14T12:26:03.166-06:00<div style="text-align: justify;">Computer languages are not as easy as human languages, they need you to become a computer yourself, think like a computer and write an algorithm. Computer programs are fun if you take them up as a challenge, as unsolved puzzles. There is lot of fun in taking up the challenge, understanding the problem, writing an algorithm, writing a program and most importantly running the program and obtaining required output.<span id="more-321"></span><br />Here are few challenging C program questions for you. Let’s see how many of them you would be able to write without seeing the program solution given below. These questions are to print patterns using asterisk(star) character. Comment below if you have tougher pattern questions.<br /></div> <!-- List of Questions in this post --><br /><ol><li>Write a C program to print the following pattern: <pre>*<br /> * *<br /> * * *<br />* * * *<br /></pre></li><li>Write a C program to print the following pattern: <pre>* *<br />* * * * * *<br />* * * * * * * * * *<br />* * * * * * * * * * *<br /></pre></li><li>Write a C program to print the following pattern: <pre>* *<br /> * *<br />* * * *<br /> * * * *<br />* * * * *<br /> * * * *<br />* * * *<br /> * *<br />* *<br /></pre></li><li>Write a C program to print the following pattern: <pre>* * * * *<br /> * * * *<br /> * * *<br /> * *<br /> *<br /> * *<br /> * * *<br /> * * * *<br />* * * * *<br /></pre></li><li>Write a C program to print the following pattern: <pre>*<br /> * * *<br /> * * * * *<br /> * * * * * * *<br /> * * * * * * * * *<br /> * * * * * * *<br /> * * * * *<br /> * * *<br /> *<br /> * * *<br /> * * * * *<br /></pre></li><li>Write a C program to print the following pattern: <pre>*<br /> * *<br /> * * *<br /> * * * *<br /> * * *<br /> * *<br /> *<br /></pre></li><li>Write a C program to print the following pattern: <pre>* * * * * * * * *<br />* * * * * * * *<br />* * * * * *<br />* * * *<br />* *<br />* * * *<br />* * * * * *<br />* * * * * * * *<br />* * * * * * * * *<br /></pre></li><li>Write a C program to print the following pattern: <pre>* * * * * * * * * * * * * * * * *<br /> * * * * * * * * * * * * * *<br /> * * * * * * * * * *<br /> * * * * * *<br /> * * * * * * * * *<br /> * * * * * * *<br /> * * * * *<br /> * * *<br /> *<br /></pre></li><li>Write a C program to print the following pattern: <pre>*<br /> * * *<br /> * * * * *<br />* * * * * * *<br />* *<br />* * * *<br />* * * * * *<br />* * * * * * *<br />* * * * * *<br />* * * *<br />* *<br />* * * * * * *<br /> * * * * *<br /> * * *<br /> *<br /></pre></li><li>Write a C program to print the following pattern: <pre>* * * * * * * * * * * * * * * * * * * * * * * * *<br /> * * * * * *<br /> * * * * * *<br /> * * * * * *<br /> * * *<br /> * * * * * *<br /> * * * * * *<br /> * * * * * *<br />* * * * * * * * * * * * * * * * * * * * * * * * *<br /></pre></li></ol><!-- Start of Question1 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques1"> </a><span class="ques"> </span><ol><li>Write a C program to print the following pattern:</li><pre>*<br /> * *<br /> * * *<br />* * * *</pre><strong>Program:</strong><pre class="brush: cpp;">/* This is a simple mirror-image of a right angle triangle */<br /><br />#include <stdio.h><br />int main() {<br />char prnt = '*';<br />int i, j, nos = 4, s;<br />for (i = 1; i <= 5; i++) {<br />for (s = nos; s >= 1; s--) { // Spacing factor<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br /> printf("%2c", prnt);<br /> }<br /> printf("\n");<br /> --nos; // Controls the spacing factor<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f440afe84" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><strong></strong><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question1 --><!-- Start of Question2 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques2"> </a><span class="ques"> </span><li> Write C program to print the following pattern: <pre>* *<br />* * * * * *<br />* * * * * * * * * *<br />* * * * * * * * * * *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include<stdio.h><br />int main() {<br />char prnt = '*';<br />int i, j, k, s, c = 1, nos = 9;<br />for (i = 1; c <= 4; i++) {<br /> // As we want to print the columns in odd sequence viz. 1,3,5,.etc<br /> if ((i % 2) != 0) {<br /> for (j = 1; j <= i; j++) {<br />printf("%2c", prnt);<br />}<br />for (s = nos; s >= 1; s--) { //The spacing factor<br /> if (c == 4 &amp;&amp; s == 1) {<br /> break;<br /> }<br /> printf(" ");<br /> }<br /> for (k = 1; k <= i; k++) {<br /> if (c == 4 &amp;&amp; k == 5) {<br /> break;<br /> }<br /> printf("%2c", prnt);<br /> }<br /> printf("\n");<br /> nos = nos - 4; // controls the spacing factor<br /> ++c;<br /> }<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f3d273466" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><strong></strong><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question2 --><!-- Start of Question3 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques3"> </a><span class="ques"> </span><li>Write C program to print the following pattern: <pre>* *<br /> * *<br />* * * *<br /> * * * *<br />* * * * *<br /> * * * *<br />* * * *<br /> * *<br />* *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include<stdio.h><br />int main() {<br />char prnt = '*';<br />int i, j, k, s, p, r, nos = 7;<br /><br />for (i = 1; i <= 5; i++) {<br /> for (j = 1; j <= i; j++) {<br />if ((i % 2) != 0 &amp;&amp; (j % 2) != 0) {<br />printf("%3c", prnt);<br />}<br />else if ((i % 2) == 0 &amp;&amp; (j % 2) == 0) {<br />printf("%3c", prnt);<br />}<br />else {<br />printf(" ");<br />}<br />}<br />for (s = nos; s >= 1; s--) { // for the spacing factor<br /> printf(" ");<br /> }<br /> for (k = 1; k <= i; k++) { //Joining seperate figures<br />if (i == 5 &amp;&amp; k == 1) {<br />continue;<br />}<br />if ((k % 2) != 0) {<br />printf("%3c", prnt);<br />}<br />else {<br />printf(" ");<br />}<br />}<br />printf("\n");<br />nos = nos - 2; // space control<br />} nos = 1; // remaining half..<br />for (p = 4; p >= 1; p--) {<br /> for (r = 1; r <= p; r++) {<br />if ((p % 2) != 0 &amp;&amp; (r % 2) != 0) {<br />printf("%3c", prnt);<br />}<br />else if ((p % 2) == 0 &amp;&amp; (r % 2) == 0) {<br />printf("%3c", prnt);<br />}<br />else {<br />printf(" ");<br />}<br />}<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (k = 1; k <= p; k++) {<br /> if ((k % 2) != 0) {<br /> printf("%3c", prnt);<br /> }<br />else {<br /> printf(" ");<br /> }<br /> }<br /> nos = nos + 2; // space control<br /> printf("\n");<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=fdf2385b" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><strong><br /></strong></ol><div style="text-align: justify;"><strong>Explanation:</strong><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question3 --><!-- Start of Question4 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques4"></a>This can be seen as an inverted diamond composed of stars. It can be noted that the composition of this figure follows sequential pattern of consecutive stars and spaces. In case of odd row number, the odd column positions will be filled up with ‘*’, else a space will be spaced and vice-versa in case of even numbered row. In order to achieve this we will construct four different right angle triagles aligned as per the requirement. </div><ol><li><div style="text-align: justify;"> Write a C program to print the following pattern: </div><pre>* * * * *<br /> * * * *<br /> * * *<br /> * *<br /> *<br /> * *<br /> * * *<br /> * * * *<br />* * * * *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include<stdio.h><br />int main() {<br />char prnt = '*';<br />int i, j, s, nos = 0;<br />for (i = 9; i >= 1; (i = i - 2)) {<br /> for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br /> if ((i % 2) != 0 &amp;&amp; (j % 2) != 0) {<br /> printf("%2c", prnt);<br /> } else {<br /> printf(" ");<br /> }<br /> }<br /> printf("\n");<br /> nos++;<br />}<br />nos = 3;<br />for (i = 3; i <= 9; (i = i + 2)) {<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br /><br /> if ((i % 2) != 0 &amp;&amp; (j % 2) != 0) {<br /> printf("%2c", prnt);<br /> } else {<br /> printf(" ");<br /> }<br /> }<br /> nos--;<br /> printf("\n");<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f512c0854" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question4 --><!-- Start of Question5 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques5"> </a><span class="ques"> </span><li> Write a C program to print the following pattern: <pre>*<br /> * * *<br /> * * * * *<br /> * * * * * * *<br /> * * * * * * * * *<br /> * * * * * * *<br /> * * * * *<br /> * * *<br /> *<br /> * * *<br /> * * * * *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include<stdio.h><br />int main() {<br />char prnt = '*';<br />int i, j, k, s, nos = 4;<br />for (i = 1; i <= 5; i++) {<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br /> printf("%2c", prnt);<br /> }<br /> for (k = 1; k <= (i - 1); k++) {<br />if (i == 1) { continue;<br />}<br />printf("%2c", prnt);<br />}<br />printf("\n"); nos--;<br />}<br />nos = 1;<br />for (i = 4; i >= 1; i--) {<br /> for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br /> printf("%2c", prnt);<br /> }<br /> for (k = 1; k <= (i - 1); k++) {<br /> printf("%2c", prnt);<br /> }<br /> nos++;<br /> printf("\n");<br />}<br />nos = 3;<br />for (i = 2; i <= 5; i++) {<br />if ((i % 2) != 0) {<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br /> printf("%2c", prnt);<br /> }<br /> }<br /> if ((i % 2) != 0) {<br /> printf("\n");<br /> nos--;<br /> }<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f3b8aa1f5" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question5 --><!-- Start of Question6 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques6"> </a><span class="ques"> </span><li> Write a C program to print the following pattern: <pre>*<br /> * *<br /> * * *<br /> * * * *<br /> * * *<br /> * *<br /> *</pre></li><strong>Program:</strong><pre class="brush: cpp;">/*<br /> This can be seen as two right angle triangles sharing the same base<br /> which is modified by adding few extra shifting spaces<br />*/<br />#include <stdio.h><br />// This function controls the inner loop and the spacing<br />// factor guided by the outer loop index and the spacing index.<br />int triangle(int nos, int i) {<br />char prnt = '*';<br />int s, j;<br />for (s = nos; s >= 1; s--) { // Spacing factor<br /> printf(" ");<br />}<br />for (j = 1; j <= i; j++) { //The inner loop<br /> printf("%2c", prnt);<br />}<br />return 0;<br />}<br /><br />int main() {<br />int i, nos = 5;<br />//draws the upper triangle<br />for (i = 1; i <= 4; i++) {<br />triangle(nos, i); //Inner loop construction<br />nos++; // Increments the spacing factor<br />printf("\n"); }<br />nos = 7; //Draws the lower triangle skipping its base.<br />for (i = 3; i >= 1; i--) {<br /> int j = 1;<br /> triangle(nos, i); // Inner loop construction<br /> nos = nos - j; // Spacing factor<br /> printf("\n");<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f5fd7fd1e" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question6 --><!-- Start of Question7 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques7"> </a><span class="ques"> </span><li> Write a C program to print the following pattern: <pre>* * * * * * * * *<br />* * * * * * * *<br />* * * * * *<br />* * * *<br />* *<br />* * * *<br />* * * * * *<br />* * * * * * * *<br />* * * * * * * * *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include <stdio.h><br /><br />int main() {<br />char prnt = '*';<br />int i, j, k, s, nos = -1;<br />for (i = 5; i >= 1; i--) {<br /> for (j = 1; j <= i; j++) {<br />printf("%2c", prnt);<br />}<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (k = 1; k <= i; k++) {<br /> if (i == 5 &amp;&amp; k == 5) {<br /> continue;<br /> }<br /> printf("%2c", prnt);<br /> }<br /> nos = nos + 2;<br /> printf("\n");<br />}<br />nos = 5;<br />for (i = 2; i <= 5; i++) {<br /> for (j = 1; j <= i; j++) {<br />printf("%2c", prnt);<br />}<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (k = 1; k <= i; k++) {<br /> if (i == 5 &amp;&amp; k == 5) {<br /> break;<br /> }<br /> printf("%2c", prnt);<br /> }<br /> nos = nos - 2;<br /> printf("\n");<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f4ed30c03" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question7 --><!-- Start of Question8 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques8"> </a><span class="ques"> </span><li> Write a C program to print the following pattern: <pre>* * * * * * * * * * * * * * * * *<br /> * * * * * * * * * * * * * *<br /> * * * * * * * * * *<br /> * * * * * *<br /> * * * * * * * * *<br /> * * * * * * *<br /> * * * * *<br /> * * *<br /> *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include <stdio.h><br />int main() {<br />char prnt = '*';<br />int i, j, k, s, sp, nos = 0, nosp = -1;<br />for (i = 9; i >= 3; (i = i - 2)) {<br /> for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br />printf("%2c", prnt);<br />}<br />for (sp = nosp; sp >= 1; sp--) {<br /> printf(" ");<br /> }<br /> for (k = 1; k <= i; k++) {<br />if (i == 9 &amp;&amp; k == 1) {<br />continue;<br />}<br />printf("%2c", prnt);<br />}<br />nos++;<br />nosp = nosp + 2;<br />printf("\n");<br />}<br />nos = 4;<br />for (i = 9; i >= 1; (i = i - 2)) {<br /> for (s = nos; s >= 1; s--) {<br /> printf(" ");<br /> }<br /> for (j = 1; j <= i; j++) {<br /> printf("%2c", prnt);<br /> }<br /> nos++;<br /> printf("\n");<br />}<br /><br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f51daa1d" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question8 --><!-- Start of Question9 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques9"> </a><span class="ques"> </span><li> Write a C program to print the following pattern: <pre>*<br /> * * *<br /> * * * * *<br />* * * * * * *<br />* *<br />* * * *<br />* * * * * *<br />* * * * * * *<br />* * * * * *<br />* * * *<br />* *<br />* * * * * * *<br /> * * * * *<br /> * * *<br /> *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include <stdio.h><br />/*<br />* nos = Num. of spaces required in the triangle.<br />* i = Counter for the num. of charcters to print in each row<br />* skip= A flag for checking whether to<br />* skip a character in a row.<br />*<br />*/<br />int triangle(int nos, int i, int skip) {<br />char prnt = '*';<br />int s, j;<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br />}<br />for (j = 1; j <= i; j++) {<br /> if (skip != 0) {<br /> if (i == 4 &amp;&amp; j == 1) {<br /> continue;<br /> }<br /> }<br /> printf("%2c", prnt);<br />}<br />return 0;<br />}<br /><br />int main() {<br />int i, nos = 4;<br />for (i = 1; i <= 7; (i = i + 2)) {<br /> triangle(nos, i, 0);<br /> nos--;<br /> printf("\n");<br />}<br />nos = 5;<br />for (i = 1; i <= 4; i++) {<br />triangle(1, i, 0); //one space needed in each case of the formation<br />triangle(nos, i, 1); //skip printing one star in the last row.<br />nos = nos - 2;<br />printf("\n");<br />}<br />nos = 1;<br />for (i = 3; i >= 1; i--) {<br /> triangle(1, i, 0);<br /> triangle(nos, i, 0);<br /> nos = nos + 2;<br /> printf("\n");<br />}<br />nos = 1;<br />for (i = 7; i >= 1; (i = i - 2)) {<br /> triangle(nos, i, 0);<br /> nos++;<br /> printf("\n");<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f4a523771" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a><a href="http://www.interviewmantra.net/2009/10/10-star-pattern-programs.html#top" style="font-size: 0.8em;"> </a><!-- End of Question9 --><!-- Start of Question10 --><a href="http://cmagical.blogspot.com/search/label/Programs" name="ques10"> </a><span class="ques"> </span><li> Write a C program to print the following pattern: <pre>* * * * * * * * * * * * * * * * * * * * * * * * *<br /> * * * * * *<br /> * * * * * *<br /> * * * * * *<br /> * * *<br /> * * * * * *<br /> * * * * * *<br /> * * * * * *<br />* * * * * * * * * * * * * * * * * * * * * * * * *</pre></li><strong>Program:</strong><pre class="brush: cpp;">#include <stdio.h><br /><br />/*<br />* nos = Num. of spaces required in the triangle.<br />* i = Counter for the num. of characters to print in each row<br />* skip= A flag for check whether to<br />* skip a character in a row.<br />*<br />*/<br /><br />int triangle(int nos, int i, int skip) {<br />char prnt = '*';<br />int s, j;<br />for (s = nos; s >= 1; s--) {<br /> printf(" ");<br />}<br />for (j = 1; j <= i; j++) {<br />if (skip != 0) {<br />if (i == 9 &amp;&amp; j == 1) {<br /> continue;<br />}<br />}<br />if (i == 1 || i == 9) {<br />printf("%2c", prnt);<br />}<br />else if (j == 1 || j == i) {<br />printf("%2c", prnt);<br />} else {<br />printf(" ");<br />} }<br />return 0; }<br />int main() {<br />int i, nos = 0, nosp = -1, nbsp = -1;<br />for (i = 9; i >= 1; (i = i - 2)) {<br /> triangle(nos, i, 0);<br /> triangle(nosp, i, 1);<br /> triangle(nbsp, i, 1);<br /> printf("\n");<br /> nos++;<br /> nosp = nosp + 2;<br /> nbsp = nbsp + 2;<br />}<br />nos = 3, nosp = 5, nbsp = 5;<br />for (i = 3; i <= 9; (i = i + 2)) {<br /> triangle(nos, i, 0);<br /> triangle(nosp, i, 1);<br /> triangle(nbsp, i, 1);<br /> printf("\n");<br /> nos--;<br /> nosp = nosp - 2;<br /> nbsp = nbsp - 2;<br />}<br />return 0;<br />}</stdio.h></pre><a href="http://nodalo.pastebin.com/pastebin.php?dl=f19dd1bb8" onclick="javascript:pageTracker._trackPageview('/outbound/article/nodalo.pastebin.com');" style="font-size: 0.8em;">Download Code</a></ol><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5123201155418023753?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-47410473541098162392010-02-14T12:08:00.001-06:002010-02-14T12:19:55.211-06:00<table align="center"><tbody><tr background="img/side_bg1.gif"><th align="center">Category<br /></th> <th align="center">Title<br /></th> <th>Source Code<br /></th> </tr> <tr background="img/side_bg1.gif"><td align="center">Dynamic<br /></td><td align="center">0/1 - Knapsack<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/knap.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Dynamic<br /></td><td align="center">Coin Change<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/coin_dynamic.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Dynamic<br /></td><td align="center">Coin Change(Recursive/Memor)<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/coin_recusive.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Dynamic<br /></td><td align="center">L I S<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/lis.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Dynamic<br /></td><td align="center">Matrix Chain multiplication<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/matrix.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Dynamic<br /></td><td align="center">Maximum Product<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/max_product.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Graph<br /></td><td align="center">Bellman-Ford<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/bellman.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Graph<br /></td><td align="center">BFS<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/bfs.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Graph<br /></td><td align="center">Dijkstra<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/dij.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Graph<br /></td><td align="center">Finding Articulation Point<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/articu.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Graph<br /></td><td align="center">MST ( Kruskal )<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/kruscal.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Graph<br /></td><td align="center">MST ( Prim )<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/prims.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Graph<br /></td><td align="center">Topological Sort<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/topological.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Medians and Order Statistics<br /></td><td align="center">Finding Maximum and Minimum<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/maxmin.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Caculating GCD of two integers<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/gcd.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Calculating LCM of two integers<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/lcm.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Counting Divisor of an integer<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/divisor.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Counting number of digits of n!<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/numberofdigitofn%21.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Counting Tailing zero/s of n!<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/tailing_zero_n%21.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Factorization of an integer<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/factor.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Factorrization of n!<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/factor_n%21.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Generating Prime Numbers<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/prime.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Number theory<br /></td><td align="center">Relatively Prime<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/relatively_prime.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Searching<br /></td><td align="center">Linear Search<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/linearSearch.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Sorting<br /></td><td align="center">Bubble Sort<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/bubble_sort.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Sorting<br /></td><td align="center">Bubble Sort (1st Improvement)<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/bubble_sort.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Sorting<br /></td><td align="center">Bubble Sort (2nd Improvement)<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/bubble_sort.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Sorting<br /></td><td align="center">Bucket Sort<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/bucket.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center">Sorting<br /></td><td align="center">Heap Sort<br /></td><td align="right"><a href="http://www.youngprogrammer.com/algorithm/heapSort.cpp">Download/View</a><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center"><br /></td><td align="center"><br /></td><td align="right"><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center"><br /></td><td align="center"><br /></td><td align="right"><br /></td></tr> <tr background="img/side_bg1.gif"><td align="center"><br /></td><td align="center"><br /></td><td align="right"><br /></td></tr></tbody></table><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-4741047354109816239?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-50534596921432561462010-02-14T12:06:00.000-06:002010-02-14T12:08:07.597-06:00<div style="text-align: justify;">Listed here are few common complex operations of single linked list that is to be needed by certain applications. These operations should be done in single traversal for improved performance.<br /><br />Here are few of them and their solutions..<br /><br />1. Reverse the list.<br />2. Find n-th node from tail end.<br />3. Find middle node of the list.<br />4. Delete a node whose address is known, without having the head node's address.<br /><br />1. Reverse the list<br />Logic :<br /><br /> a. Get each node from front end till last.<br /> b. Add them into another list at front.<br /><br />2. Find n-th node from tail end.<br /><br /> a. Have two pointers pointer1 and pointer2.<br /> b. Point all of them to head initilally.<br /> c. Move only pointer1 for n nodes.<br /> d. Move both pointers for the rest nodes of list.<br /> e. At the end of traversal, pointer2 will be pointing to n-th node from tail.<br /><br />3. Find middle node of the list.<br /><br /> a. Have two pointers pointer1 and pointer2.<br /> b. Point all of them to head initilally.<br /> c. Move only pointer1 by one node.<br /> d. Move pointer2 by two nodes till the end of list.<br /> e. At the end of traversal, pointer1 will be pointing to middle node from tail.<br /><br />4. Delete a node without having the head node's address<br /><br /> a. copy the contents of next node's data to current node's data.<br /> b.Store the next node's next node at current node's link.<br /><br />In all cases, we have to take care of boundary conditions as well as memory leaks.<br />Here is the code..<br /><br />Code: C<br /><br />#include<br /><br />struct node<br />{<br /> int data;<br /> struct node* next;<br />};<br /><br />// Functions for allocating/deallocating memory<br />struct node* create_node(int data);<br /><br />// Utility functions that can be used in reverse_list<br />struct node* insert_at_front(struct node* head, struct node* new_node);<br />struct node* insert_at_end(struct node* head, struct node* new_node);<br /><br />struct node* remove_from_front(struct node* head);<br />struct node* reverse_list(struct node* head);<br /><br />// Delete a node without having the head pointer..<br />void delete_this_node(struct node* cur_node);<br /><br />// Find nth node from tail in single traversal..<br />struct node* find_nth_from_end(struct node* head, int n);<br /><br />// Find middle node of the list in single traversal..<br />struct node* find_middle_node(struct node* head);<br /><br />// Dump the list/node..<br />void dump_list(struct node* head);<br />void dump_node(struct node* pNode);<br />void copy_node(struct node* src, struct node* dest);<br /><br />// Main function<br />int main(void)<br />{<br /> struct node *list = NULL, *temp_node = NULL;<br /> int i = 0;<br /><br />// Create list with 10 members...<br /> for(i = 0; i <= 10; i++) {<br /> temp_node = create_node(i);<br /> list = insert_at_end(list, temp_node);<br /> }<br /><br />// Add 5 more in front...<br /> for(i = 14; i >= 11; i--) {<br /> temp_node = create_node(i);<br /> list = insert_at_front(list, temp_node);<br /> }<br /><br /> dump_list(list);<br /><br />// To reverse a single linked list in single traversal.......<br />/*<br /> list = reverse_list(list);<br />*/<br /><br />// Delete a particular node without having the head pointer<br />/*<br /> temp_node = list;<br /><br /> for(i = 0; i <= 15; i++) {<br /><br /> if(i == 4) {<br /> delete_this_node(temp_node);<br /> break;<br /> }<br /><br /> temp_node = temp_node->next;<br /> }<br /> dump_list(list);<br />*/<br /><br />// To find nth node from the end of list in single traversal....<br />/*<br /> temp_node = find_nth_from_end(list, 10);<br /><br /> dump_node(temp_node);<br />*/<br /><br />// To find the middle node of list in single traversal......<br /><br />/*<br /> temp_node = find_middle_node(list);<br /><br /> dump_node(temp_node);<br /><br /> list = reverse_list(list);<br /><br /> dump_list(list);<br /><br /> temp_node = find_middle_node(list);<br /><br /> dump_node(temp_node);<br />*/<br /> return 0;<br />}<br /><br />// Allocate memory and store the data<br />struct node* create_node(int data)<br />{<br /> struct node *new_node = NULL;<br /><br /> new_node = (struct node*)malloc(sizeof(struct node));<br /><br /> new_node->data = data;<br /> new_node->next = NULL;<br /><br /> return new_node;<br />}<br /><br />// Deallocate the memory<br />void free_this_node(struct node* pNode)<br />{<br /> free(pNode);<br /> pNode = NULL;<br /><br /> return;<br />}<br /><br />// Insert a node at front end<br />struct node* insert_at_front(struct node* head, struct node* new_node)<br />{<br /> if(new_node) {<br /> new_node->next = head;<br /> return new_node;<br /> }<br /> else<br /> return NULL;<br />}<br /><br />// Insert a node at tail end<br />struct node* insert_at_end(struct node* head, struct node* new_node)<br />{<br /> struct node *temp = NULL;<br /><br /> if(head) {<br /><br /> temp = head;<br /><br /> while(temp->next)<br /> temp = temp->next;<br /><br /> temp->next = new_node;<br /> }<br /> else {<br /> head = new_node;<br /> }<br /><br /> return head;<br />}<br /><br />// Remove a node from front end..<br />struct node* remove_from_front(struct node* head)<br />{<br /> if(head) {<br /> head = head->next;<br /> return head;<br /> }<br /> else<br /> return NULL;<br />}<br /><br />// Reverse the list in single traversal..<br />struct node* reverse_list(struct node* head)<br />{<br /> struct node *result = NULL, *temp_head = NULL, *temp = NULL;<br /><br /> temp_head = head;<br /><br /> while(temp_head) {<br /><br /> temp = temp_head;<br /><br /> temp_head = remove_from_front(temp_head);<br /><br /> temp->next = NULL;<br /> <br /> result = insert_at_front(result, temp);<br /> }<br /><br /> return result;<br />}<br /><br />// Delete a node without the help of head node..<br />void delete_this_node(struct node* cur_node)<br />{<br /> struct node *temp = NULL;<br /> if(cur_node &amp;&amp; cur_node->next) {<br /><br /> copy_node(cur_node, cur_node->next);<br /> temp = cur_node->next;<br /> cur_node->next = cur_node->next->next;<br /><br /> free_this_node(temp);<br /> }<br /> else if(cur_node) {<br /> free_this_node(cur_node);<br /> }<br /> else<br /> return;<br />}<br /><br />// Find n-th node from tail end in single traversal...<br />struct node* find_nth_from_end(struct node *head, int n)<br />{<br /> struct node *temp = NULL, *result = NULL, *temp_head = NULL;<br /> int i = 0;<br /><br /> result = temp_head = temp = head;<br /><br /> for(i = 0; i < n; i++) {<br /> if(!temp_head) {<br /> printf("Out of Range\n");<br /> return NULL;<br /> }<br /> temp_head = temp_head->next;<br /> temp = temp->next;<br /> }<br /><br /> while(temp_head) {<br /> temp_head = temp_head->next;<br /> temp = temp->next;<br /> result = result->next;<br /> }<br /><br /> return result;<br />}<br /><br />// Find middle node of list in single traversal...<br />struct node* find_middle_node(struct node* head)<br />{<br /> struct node *temp_head = NULL, *temp = NULL, *result = NULL;<br /><br /> temp_head = temp = result = head;<br /><br /> while(temp &amp;&amp; temp->next) {<br /><br /> if(temp->next->next) {<br /> temp = temp->next->next;<br /> result = result->next;<br /> }<br /> else<br /> temp = temp->next;<br /> }<br /><br /> return result;<br />}<br /><br />// Dump the list...<br />void dump_list(struct node* head)<br />{<br /> struct node *temp = NULL;<br /><br /> printf("\n");<br /><br /> if(head) {<br /><br /> temp = head;<br /><br /> while(temp) {<br /> printf("%d ", temp->data);<br /> temp = temp->next;<br /> }<br /> }<br /> else {<br /> printf("Empty List");<br /> }<br /><br /> printf("\n");<br />}<br /><br />// Copy data in b/w two nodes...<br />void copy_node(struct node* src, struct node* dest)<br />{<br /> src->data = dest->data;<br /><br /> return;<br />}<br /><br />// Dump a node<br />void dump_node(struct node* pNode)<br />{<br /> if(pNode)<br /> printf("\nNode details : Addr : %x, data : %d\n", pNode, pNode->data);<br /> else<br /> printf("\n Node is NULL \n");<br /><br /> return;<br />}<br /><br />Uncomment the relevant snippet from main for testing it. </div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5053459692143256146?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-42294413004963325582010-02-14T12:04:00.000-06:002010-02-14T12:05:45.956-06:00<div style="text-align: justify;">As the topic says, self printing programs are nothing but they reproduce themselves as output. Such programs are referred as Quines from the name of the logician Willard van Orman Quine who introduced the concept.<br /><br /><br />I said an 'Ah!!!' when I heard about Quines for first time, spent more hours to find the magic behind Quines. After an analysis over a long period of time, I realized that there is no magic but logic behind it.<br /><br /><br />Its quite easier in few languages, which handle code segments as data. But in C, both are being handled as separate segments. Thus, writing quines is interesting and challenging. But if we understand the idea behind it clearly, we can easily write them in C also.<br /><br /><br />This article explains several ways of writing quines in C.<br /><br /><br />The simple and straight forward solution we usually think of is 'open the source file and print its contents'. It does not work all the times, say if we have only the executable, not the source code, this solution will not work.<br /><br /><br />Treat Code as Data<br /><br /><br />Easiest way is to treat the code statements as data to be printed. Look at the following program.<br /><br /><br />Code: C<br /><br />char x[]="main() { int j; putchar(99); putchar(104); putchar(97);putchar(114); putchar(32);putchar(120); putchar(91); putchar(93);putchar(61); putchar(34); for(j=0; j; main() { int j; putchar(99); putchar(104); putchar(97); putchar(114); putchar(32); putchar(120);putchar(91); putchar(93); putchar(61); putchar(34); for(j=0; j(x); ++j) putchar(x[j]);putchar(34); putchar(59); putchar(10); for(j=0 ; j(x); ++j) putchar(x[j]); putchar(10); }<br /><br />Quote:<br /><br />Author: Dave<br /><br />Type the above program in just two lines, one for declaration of x and another for the main. The string x has the whole program instructions. Design your main to print the string which has the code statemets. The trickest part of writing quines is 'the statement which is used to print the code must also be printed'.<br /><br />Lets see how it works.<br /><br /><br />The putchar statements before the first for loop print till<br /><br />Code:<br /><br />char x[] =”<br /><br />The first for loop print the string contents.<br /><br />Code:<br /><br />main() { int j; putchar(99); putchar(104); putchar(97); putchar(114); putchar(32); putchar(120);putchar(91); putchar(93); putchar(61); putchar(34); for(j=0; j<br /><br />The putchars in between the for loops print<br /><br />Code:<br /><br />“;<br /><br />We have printed the declaration of x so far. The only task is left for us, to print the main program. This is taken care by the second for loop. The last putchar adds a newline into the output.<br /><br />Quote:<br /><br />The putchar statements recieves ASCII values of the characters. Replace the ASCII values and try with actual characters, ie replace putchar(99) by putchar('c'). You will come to know the difficulty of using characters directly.<br /><br />Format specifiers<br /><br /><br />Another way of writing them is with the aid of format specifiers intelligently.<br /><br />Code: C<br /><br />main(){char q=34,n=10,*a="main(){char q=34,n=10,*a=%c%s%c;printfa,q,a,q,n);}%c";printf(a,q,a,q,n);}<br /><br />Quote:<br /><br />Author: John Burger, David Brill, Filip Machi0<br /><br />The above program is one liner, the statement has to be focussed is printf only. It's not difficult to understand that the following contents are printed.<br /><br />Code:<br /><br />main(){char q=34,n=10, *a=<br /><br />Now, replace the %c with double quotes(“) and %s with the string a and so on.... Hence the resultant printf statement will be as follows,<br /><br />Code: C<br /><br />printf(“main(){char q=34,n=10,*a=%c%s%c;printf(a,q,a,q,n);}%c”,q,”main(){char q=34,n=10,char *a=%c%s%c;printf(a,q,a,q,n)}”,q,n);<br /><br />Macros<br /><br /><br />Here is another way of writing is using macros. The fact behind it upon substitution of macro, we will get a printf statement which dumps the actual code.<br /><br />Code: C<br /><br />#define T(a) main(){printf(a,#a);} T("#define T(a) main(){printf(a,#a);}\nT(%s)")<br /><br />Quote:<br /><br />Author: Joe Miller<br /><br />Expand the macro for to understand the execution..<br /><br /><br />Palindromic Quines<br /><br /><br />It is awesome when I come to know about the following program. The program itself is palindrome as well as quine.<br /><br />Code: C<br /><br />/**/char q='"',*a="*//**/char q='%c',*a=%c%s%c*/};)b(stup;]d[b=]d-852[b)--d(elihw;)q,a,q,q,2+a,b(ftnirps{)(niam;031=d tni;]952[b,",b[259];int d=130;main(){sprintf(b,a+2,q,q,a,q);while(d--)b[258-d]=b[d];puts(b);}/*c%s%c%=a*,'c%'=q rahc/**//*"=a*,'"'=q rahc/**/<br /><br />Quote:<br /><br />Author: Dan Hoey<br /><br />Winner of Worst Abuse of the Rules<br /><br /><br />Given below has won the 'Worst Abuse of the Rules Award' in 1994 Obfuscated C Contest.<br /><br />Code: C<br /><br />main(){char*a="main(){char*a=c%s%c%;printf(a+42,34,a,34);};)43,a,43,24+a(ftnirp;%c%s%c=a*rahc{)(niam";printf(a+42,34,a,34);}<br /><br />Quote:<br /><br />Author: smr<br /><br />For more quines in your favorite languages, refer http://www.nyx.net/~gthompso/quine.htm<br /><br /><br />Here are my attempts<br /><br />Type these programs as it is given... Don't even add/delete a single NEWLINE or SPACE or TAP characters<br /><br />Code: C<br /><br />// First Program #include h> main() { char *a = "#include %cmain()%c{%c%cchar *a = %c%s%c;%c%cprintf(a,10,10,10,9,34,a,34,10,9,10,10);%c}%c"; printf(a,10,10,10,9,34,a,34,10,9,10,10); } // Second Program #define print(s) (#s) main() { char *a = "printf(print(#define print(s) (#s)%cmain()%c{%c%cchar *a=%c%s%c;%c%c%s%c}%c),10,10,10,9,34,a,34,10,9,a,10,10);"; printf(print(#define print(s) (#s)%cmain()%c{%c%cchar *a=%c%s%c;%c%c%s%c}%c),10,10,10,9,34,a,34,10,9,a,10,10); } // Third Program #define T(a,b) strcat(a,b) main() { char s1[256] = "#define T(a,b) strcat(a,b)%cmain()%c{%c", s2[256] = "%cchar s1[256] = %c%s%c, s2[256] = %c%s%c, s3[256] = %c%s%c;%c%c%cprintf(T(s1,s2),10,10,10,9,34,s3,34,34,s2,34,34,s3,34,10,10,9,10,10);%c}%c", s3[256] = "#define T(a,b) strcat(a,b)%cmain()%c{%c"; printf(T(s1,s2),10,10,10,9,34,s3,34,34,s2,34,34,s3,34,10,10,9,10,10); }<br /><br />I hope this article gives much better hopes in writing quines. To conclude, with little intelligency all of us can write quines.</div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-4229441300496332558?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-79357554046954711932010-02-14T12:02:00.000-06:002010-02-14T12:03:48.929-06:00<div style="text-align: justify;"><span style="font-size:100%;">Mostly people are using this algorithm to compute matrix multiplication:<br /><br /><br />Code: C<br /><br />#define n 1000 int main() { int a[n][n],b[n][n],c[n][n]; c[0][0]=0; for( i=0;i) { for(j=0;j) { for(k=0;k) { c[i][j] = c[i][j] + a[i][k] * b[k][j] } } } return 0; }<br /><br />In this program( a short algo) , every time we are taking one element of an array to catche and processing for it. Means At one time cpu reading one element value of a array and b Array and compute and store to c Array.<br /><br /><br />To reading every time elements from array , why we are taking some group of element i.e. Block size, then no need to read every element. A groups of element will be on catche and we can do fast as given above algo. This algorithm called " Block Algorithm". This Block algorithm can be applied many place where this type of situation will come.<br /><br /><br />Block Algorithm for Matrix Multiplication:<br /><br />Code: C<br /><br />#define n 1000 #define BlockSize 100 int main() { int a[n][n],b[n][n],c[n][n]; c[0][0]=0; for( i1=0;i1<(n/BlockSize);++i1) { for(j1=0;j1<(n/BlockSize);++j1) { for(k1=0;k1<(n/BlockSize);++k1) { for(i=i1=0;i(i1+BlockSize-1);++i) { for(j=j1=0;j(j1+BlockSize-1);++j) { for(k=k1;k(k1+BlockSize-1);++k) { c[i][j] = c[i][j] + a[i][k] * b[k][j] } } } } } } return 0; } </span> </div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-7935755404695471193?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-39190204338968939312010-02-14T12:00:00.000-06:002010-02-14T12:01:54.949-06:00<div style="text-align: justify;">Introduction<br /><br />The article discusses about all the number formats viz Binary, Decimal, Octal, Hex and BCD (Binary coded decimal) and conversion from Decimal to Binary, Octal and Hex and also the reverse conversion.<br /><br />Binary<br /><br />A numbering system based on 2 in which 0 and 1 are the only available digits.<br /><br />Decimal<br /><br />decimal fraction: a proper fraction whose denominator is a power of 10<br /><br />Octal<br /><br />A numbering system that uses eight digits, 0 through 7. It is used as a shorthand system for representing binary characters that use six bits.<br /><br />Hexa Decimal<br /><br />A numbering system which uses a base of 16. The first ten digits are 0-9 and the next six are A-F.<br /><br />Binary to Decimal<br /><br /><br />void Bin2Dec()<br />{<br />int bin,n,r,s=0,i;<br />printf("Enter a binary number\n");<br />scanf("%d",&amp;bin);<br />n=bin;<br />for(i=0;n!=0;i++)<br />{<br />r=n%10;<br />s=s+r*(int)pow(2,i);<br />n=n/10;<br />}<br />printf("The equivalent number of %d is %d\n",bin,s);<br />}<br /><br />Octal to Decimal<br /><br /><br />void Oct2Dec()<br />{<br />int oct,n,r,s=0,i;<br />printf("Enter an octal number\n");<br />scanf("%d",&amp;oct);<br />n=oct;<br />for(i=0;n!=0;i++)<br />{<br />r=n%10;<br />s=s+r*(int)pow(8,i);<br />n=n/10;<br />}<br />printf("The equivalent number of %d is %d\n",oct,s);<br />}<br /><br />Hex to Decimal<br /><br /><br />void Hex2Dec()<br />{<br />char hex[N];<br />int i,j,n[N],l;<br />long double dec=0;<br />printf("Enter the hexa decimal number and find it's decimal equivalent\n");<br />fflush(stdin);<br />gets(hex);<br />l=strlen(hex);<br />for(i=0;i=0;j--)<br />{<br />printf("%d",bin[j]);<br />}<br />printf("\n");<br />}<br /><br />Decimal to Octal<br /><br /><br />void Dec2Oct()<br />{<br />int n,r[10],i;<br />printf("Enter a number to find it's octal equivalent\n");<br />scanf("%d",&amp;n);<br />printf("The octal equivalent of %d is ",n);<br />for(i=0;n!=0;i++)<br />{<br />r[i]=n%8;<br />n=n/8;<br />}<br />i--;<br />for(;i>=0;i--)<br />printf("%d",r[i]);<br />printf("\n");<br />}<br /><br />Decimal to Hex<br /><br /><br />void Dec2Hex()<br />{<br />int n,r[10],i;<br />printf("Enter a number to get its hexadecimal equivalent\n");<br />scanf("%d",&amp;n);<br />for(i=0;n!=0;i++)<br />{<br />r[i]=n%16;<br />n=n/16;<br />}<br />i--;<br />for(;i>=0;i--)<br />{<br />if(r[i]==10)<br />printf("A");<br />else if(r[i]==11)<br />printf("B");<br />else if(r[i]==12)<br />printf("C");<br />else if(r[i]==13)<br />printf("D");<br />else if(r[i]==14)<br />printf("E");<br />else if(r[i]==15)<br />printf("F");<br />else<br />printf("%d",r[i]);<br />}<br />printf("\n");<br />}<br /></div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-3919020433896893931?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-7529941378238549922010-02-14T11:59:00.000-06:002010-02-14T12:00:30.995-06:00<div style="text-align: justify;">fnReplaceString()<br />{<br /> char acInpString[MAX_LENGTH],acOrig[MAX_LENGTH],acReplace[MAX_LENGTH];<br /> char *pcInpStringPtr = acInpString;<br /> char *pcOrigPtr = acOrig;<br /> char *pcReplacePtr = acReplace;<br /> char *pPos;<br /> int iRes = 0;<br /> int iCount = 0;<br /> fflush(stdin);<br /> system("clear");<br /><br /> /* gets the input string from user */<br /> GET_STRING(acInpString);<br /><br /> printf("\n Enter substring to be replaced\n");<br /> gets(acOrig);<br /><br /> printf("\n Enter Substring to be placed \n");<br /> gets(acReplace);<br /><br /> /* check if substring to be replaced is present in entered string by user */<br /> if(!(pPos=strstr(acInpString,acOrig)))<br /> {<br /> printf("\n SUBSTRING TO BE REPLACED NOT PRESENT IN GIVEN STRING \n");<br /> }<br /> else<br /> {<br /> char acTemp[MAX_LENGTH];<br /> strncpy(acTemp,pcInpStringPtr,pPos-pcInpStringPtr);<br /> sprintf(acTemp+(pPos-pcInpStringPtr), "%s%s", pcReplacePtr, pPos+strlen(pcOrigPtr));<br /> puts(acTemp);<br /><br /> }<br />} </div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-752994137823854992?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-33373301669985055752010-02-14T11:56:00.001-06:002010-02-14T11:58:59.718-06:00<div style="text-align: justify;" class="post-body entry-content"><h3 class="post-title entry-title" style="margin: 0px; color: rgb(27, 112, 58); font-family: Verdana,sans-serif; font-size-adjust: none; font-size: 160%; font-stretch: normal; font-style: normal; font-variant: normal; font-weight: bold; letter-spacing: -1px; line-height: normal;"><span class="Apple-style-span" style="color: black; font-family: 'Times New Roman'; font-size: 16px; font-weight: normal; letter-spacing: normal;"><div class="MsoNormal" style="margin: 0px;"><span style="color: red; font-family: 'Courier New'; font-size: 14pt;">Answer:<o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">#include</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> <span class="Apple-style-span" style="color: rgb(42, 0, 255);"><time.h></time.h></span></span></div><div class="MsoNormal" style="margin: 0px;"><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">#include</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> <span class="Apple-style-span" style="color: rgb(42, 0, 255);"><sys\stat.h></sys\stat.h></span></span></div><div class="MsoNormal" style="margin: 0px;"><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">#include</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> <span class="Apple-style-span" style="color: rgb(42, 0, 255);"><stdio.h></stdio.h></span></span></div><div class="MsoNormal" style="margin: 0px;"><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">void</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> main()</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">{</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">struct</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> stat status;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> FILE *fp;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> fp=fopen(</span><span style="color: rgb(42, 0, 255); font-family: 'Courier New'; font-size: 14pt;">"test.txt"</span><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">,</span><span style="color: rgb(42, 0, 255); font-family: 'Courier New'; font-size: 14pt;">"r"</span><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">);</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> fstat(fileno(fp),&amp;status);</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> clrscr();</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> printf(</span><span style="color: rgb(42, 0, 255); font-family: 'Courier New'; font-size: 14pt;">"Last date of modification : %s"</span><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">,ctime(&amp;status.st_ctime));</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> getch();</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">}</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: red; font-family: 'Courier New'; font-size: 14pt;">Explanation:<o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">Function </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">int</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> fstat(</span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">char</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> *, </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">struct</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> stat *) store the information of open file in form of structure </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">struct</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> stat</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">Structure </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">struct</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> stat has been defined in sys\stat.h as</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">struct</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> stat {</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">short</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> st_dev, st_ino;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">short</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> st_mode, st_nlink;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">int</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> st_uid, st_gid;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">short</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> st_rdev;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">long</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> st_size, st_atime;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: 'Courier New'; font-size: 14pt;">long</span></b><span style="color: black; font-family: 'Courier New'; font-size: 14pt;"> st_mtime, st_ctime;</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">};</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">Here</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">(e)<b>st_dev</b>: It describe file has stored in which drive of your computer.</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">(f)<b>st_mode</b>: It describes various modes of file like file is read only, write only, folder, character file etc.</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">(g)<b>st_size</b>: It tells the size of file in byte.</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">(h)<b>st_ctime</b>:It tells last data of modification of the file in date format.</span><span style="font-family: 'Courier New'; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="margin: 0px;"><span style="color: black; font-family: 'Courier New'; font-size: 14pt;">Function ctime convert date type in string format</span></div></span></h3></div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-3337330166998505575?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-15716380902032540552010-02-14T11:51:00.002-06:002010-02-14T11:56:35.168-06:00<h3 class="post-title entry-title"> Describe #pragma directive in detail.<br /></h3><div class="post-body entry-content"><span style="color: rgb(51, 51, 255);"><span style="color: rgb(153, 0, 0);">Ans:<br /></span></span><div style="text-align: justify;"><span style="color: rgb(51, 51, 255);">Pragma is implementation specific directive i.e each pragma directive has different implementation rule and use . There are many type of pragma directive and varies from one compiler to another compiler .If compiler does not recognize particular pragma the it ignore the pragma statement without showing any error or warning message and execute the whole program assuming this pragma statement is not present,</span><br /><span style="color: rgb(51, 51, 255);"> e.g</span><br /><span style="color: rgb(51, 51, 255);"> suppose any arbitrary pragma directive is #pragma world :</span><br /><span style="color: rgb(51, 51, 255);"></span></div><span style="color: rgb(51, 51, 255);"><br /><br /><strong><span style="color: black;">#pragma world<br />void main()<br />{<br />printf(“C is powerful language “);<br />}<br /></span></strong><span style="color: red;">Output :</span> C is powerful language<br /></span><span style="color: red;">Explanation: </span><br /><br /><div style="text-align: justify;"><span style="color: rgb(51, 51, 255);">Since #pragma world is unknown for Turbo c compiler so it ignore this directive without showing error or warning message and execute the whole program assuming #pragma world statement is not present.</span><br /><span style="color: rgb(51, 51, 255);"></span></div><span style="color: rgb(51, 51, 255);"> <strong><span style="color: black;">List of pragma directive :<br /></span></strong></span><span style="color: rgb(0, 102, 0);">1. #pragma startup<br />2. #pragma exit<br />3. #pragma warn<br />4. #pragma option<br />5. #pragma inline<br />6. #pragma argsused<br />7. #pragma hdrfile<br />8. #pragma hdrstop<br />9. #pragma saveregs</span></div><div class="post-body entry-content"><span style="color: rgb(0, 102, 0);"> </span></div><div class="post-body entry-content"><span style="color: rgb(153, 0, 0);">Explain the #pragma inline ?<br />Ans:<br /></span><span style="color: rgb(0, 0, 153);">#pragma inline only tells the compiler that source code of program contain inline assembly language code .In in C we can write assembly language program with help of asm keyword. </span></div><div class="post-body entry-content"><span style="color: rgb(0, 0, 153);"> </span></div><div class="post-body entry-content"><span style="color: rgb(0, 0, 153);"> </span></div><div class="post-body entry-content"><span style="color: rgb(102, 0, 204);"><span style="color: rgb(153, 0, 0);">Describe #pragma warn directive ?</span></span><br /><span style="color: rgb(102, 0, 204);"><span style="color: rgb(153, 0, 0);"> Ans:</span></span><br /><span style="color: rgb(102, 0, 204);"><span style="color: rgb(153, 0, 0);"> </span></span><br /><div style="text-align: justify;"><span style="color: rgb(102, 0, 204);">In c there are many warning messages which can be on or off with help of #pragma warn.</span><br /><span style="color: rgb(102, 0, 204);"> Syntax :</span><br /><span style="color: rgb(102, 0, 204);"></span><br /></div><div style="text-align: justify;"><div style="text-align: justify;"><span style="color: rgb(102, 0, 204);"> <strong><span style="color: black;">#pragma warn +xxx</span></strong></span><br /><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"> #pragma warn –xxx</span></strong></span><br /><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"> #pragma warn .xxx</span></strong></span><br /><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"> </span></strong>Where</span><br /><span style="color: rgb(102, 0, 204);"> <strong>+</strong> means on</span><br /><span style="color: rgb(102, 0, 204);"> <strong>-</strong> means off</span><br /><span style="color: rgb(102, 0, 204);"> <strong>.</strong> means on/off (toggle)</span><br /><span style="color: rgb(102, 0, 204);"> <strong>xxx</strong> is indicate particular warning code in thee alphabet</span><br /><span style="color: rgb(102, 0, 204);"> e.g</span><br /><span style="color: rgb(102, 0, 204);"> <strong>rvl </strong>is warning code which means function should return a value.</span><br /><span style="color: rgb(102, 0, 204);"> </span><br /><span style="color: rgb(102, 0, 204);"> <strong><span style="color: black;">#pragma warn –rvl</span></strong></span><br /><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"> Int main()</span></strong></span><br /><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"> {</span></strong></span><br /><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"> Printf(“It will not show any warning message”);</span></strong></span><br /></div><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"></span></strong></span></div><span style="color: rgb(102, 0, 204);"><strong><span style="color: black;"> }<br /></span></strong></span><div style="text-align: justify;"><span style="color: rgb(102, 0, 204);"><span style="color: red;">Output:</span> It will not show any warning message</span><br /><span style="color: rgb(102, 0, 204);"> When you will execute the above program then compiler will not show the warning message function should return a value because rvl warning has offed.</span></div></div><div class="post-body entry-content"><span style="color: rgb(102, 0, 204);"> </span></div><div class="post-body entry-content"><span style="color: rgb(0, 0, 153);"><span style="color: rgb(153, 0, 0);">What is #pragma startup and #pragma exit ?<br />Ans:<br /></span>Syntax:<br /><span style="color: black;"><strong>#pragma startup <function_name>[priority]<br />#pragma exit <function_name>[priority]<br /></function_name></function_name></strong></span></span><div style="text-align: justify;"><div style="text-align: justify;"><span style="color: rgb(0, 0, 153);">Where priority is optional integeral number.</span><br /><span style="color: rgb(0, 0, 153);"> For user priority varies from 64 to 255</span><br /><span style="color: rgb(0, 0, 153);"> For c libraries priority varies from 0 to 63</span><br /><span style="color: rgb(0, 0, 153);"> Default priority is 100.</span><br /><span style="color: rgb(0, 0, 153);"> <strong>pragma startup always execute the function before the main function</strong></span><br /><span style="color: rgb(0, 0, 153);"><strong> pragma exit always execute the function after the main function.</strong></span><br /><span style="color: rgb(0, 0, 153);"><strong> </strong>Function declaration of <function_name>must be before startup and exit pragma directives and function must not take any argument and return void i.e</function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name> void <fuction_name>(void)</fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name> If more than one startup directive then priority decides which <function_name>will execute first.</function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name> For startup :</function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name> Lower value : higher priority i.e function will execute first.</function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name> If more than one exit directive then priority decides which <function_name>will execute first</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> For exit:</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> Higher value: higher priority i.e function will execute first.</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> For example</function_name></function_name></fuction_name></function_name></span><br /></div><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name></function_name></function_name></fuction_name></function_name></span></div><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name><br /><strong><span style="color: black;">void india();<br />void usa() ;<br />#pragma startup india 105<br />#pragma startup usa<br />#pragma exit usa<br />#pragma exit india 105<br />void main()<br />{<br />printf("\nI am in main");<br />getch();<br />}<br />void india()<br />{<br /><br />printf("\nI am in india");<br />getch();<br />}<br />void usa()<br />{<br /><br />printf("\nI am in usa");<br />getch();<br />}<br /></span></strong></function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name><span style="color: red;">Output:</span></function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name><span style="color: red;"> </span>I am in usa</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> I am in India</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> I am in main</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> I am in India</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> I am in usa</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> <span style="color: red;">Explanation:</span></function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name><span style="color: red;"> </span></function_name></function_name></fuction_name></function_name></span><br /><div style="text-align: justify;"><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name>Above program there are two startup directive which will execute before the main function.</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> Function name India has priority 105</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> Function name usa has priority 100 (default)</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> So usa function will execute first than India function and above program there are two exit directive which will execute after the main function.</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> Function name India has priority 105</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> Function name usa has priority 100 (default)</function_name></function_name></fuction_name></function_name></span><br /><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> So india function will execute first than usa function. </function_name></function_name></fuction_name></function_name></span></div></div><div class="post-body entry-content"><span style="color: rgb(0, 0, 153);"><function_name><fuction_name><function_name><function_name> </function_name></function_name></fuction_name></function_name></span></div><span style="color: rgb(51, 51, 255);"><span style="color: rgb(204, 0, 0);">What is #error directives ?<br />Ans:<br /></span>Syntax : <strong><span style="color: black;">#error <message><br /></message></span></strong></span><div style="text-align: justify;"><span style="color: rgb(51, 51, 255);">If compiler compiles this line then it shows a compiler fatal error i.e it only issue an error message and this error message includes <message>. i.e it only issue an error message and this error message includes <message>.</message></message></span><br /><span style="color: rgb(51, 51, 255);"><message><message></message></message></span></div><span style="color: rgb(51, 51, 255);"><message><message> e.g :<br /><br /><strong><span style="color: black;">#ifndef __MATH_H<br />#error First include <math.h>then compile<br />#else<br />void main()<br />{<br />float a,b=25;<br />a=sqrt(b);<br />printf(“%f”,a);<br />}<br />#endif<br /></math.h></span></strong></message></message></span><div style="text-align: justify;"><span style="color: rgb(51, 51, 255);"><message><message><span style="color: red;">Output:</span> compiler error --> Error directive :First include <math.h>then compile</math.h></message></message></span><br /></div><br /><br /><br /><div><span style="color: rgb(204, 0, 0);">What is use of #line directive?<br />Ans: </span></div><br /><br /><br /><br /><div><div style="text-align: justify;"><span style="color: rgb(51, 51, 255);">It tells the compiler that next line of source code is at the line number which has been specified by constant in #line directive i.e it transfer the program control to the line number which has been specified by #line directive.</span><br /><span style="color: rgb(51, 51, 255);"></span></div><span style="color: rgb(51, 51, 255);"> e.g<br /><strong><span style="color: black;">#line 15<br />void main()<br />{<br />int a=10;<br />a++;<br />clrscr();<br />a++;<br />#line 5<br />printf(“%d”,a);<br />getch();<br />}<br /></span></strong><br /></span><div style="text-align: justify;"><span style="color: rgb(51, 51, 255);"> If we will see its intermediate file then before the actual compilation the source code is expanded as :</span><br /><span style="color: rgb(51, 51, 255);"></span></div><span style="color: rgb(51, 51, 255);"> <img alt="" id="BLOGGER_PHOTO_ID_5149059451050365586" src="http://bp2.blogger.com/_uIwyaTjqYYw/R3UiSjM5kpI/AAAAAAAAAJM/3_BDT5IL4Og/s400/line.bmp" style="margin: 0px auto 10px; display: block; height: 240px; text-align: center; width: 400px;" border="0" /><br /></span><div style="text-align: justify;"><span style="color: rgb(51, 51, 255);"> In the very long c program for debugging purpose if we want to check the program after the line 300 by <strong>F7 </strong>key then we will write #line 20</span></div></div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-1571638090203254055?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-82023366479390971912010-02-14T11:47:00.002-06:002010-02-14T11:51:19.210-06:00<h3 class="post-title entry-title"> Write the c program to switch the 256 color graphics mode ?. </h3> <span style="color: black; font-size: 130%;"><span style="color: rgb(102, 0, 0);">Ans:<br /></span><strong>#include<dos.h><br />#include<stdio.h><br />void main()<br />{<br />int x,y,b;<br />union REGS i,o;<br />i.h.ah=0;<br />i.h.al=0x13;<br />int86(0x10,&amp;i,&amp;o);<br /><span class="blsp-spelling-error" id="SPELLING_ERROR_0">getch</span>();<br />}</stdio.h></dos.h></strong></span><br /><strong><span style="font-size: 130%;"></span></strong><br /><span style="font-size: 130%;"><span style="color: rgb(204, 0, 0);">Write a c program to <span class="blsp-spelling-corrected" id="SPELLING_ERROR_1">create</span> a directory in current working <span class="blsp-spelling-corrected" id="SPELLING_ERROR_2">directory</span>?<br /><br />Ans:<br /></span><strong><span style="color: black;">#include<dos.h><br />void main()<br />{<br />union REGS i,o;<br />i.h.ah=0x39;<br />i.x.dx="<span class="blsp-spelling-error" id="SPELLING_ERROR_3">lakshmi</span>";<br />int86(0x21,&amp;i,&amp;o);<br /><span class="blsp-spelling-error" id="SPELLING_ERROR_4">getch</span>();<br />}</dos.h></span></strong></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-8202336647939097191?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-72455792851103847732010-02-14T11:34:00.001-06:002010-02-14T11:47:01.132-06:00<div style="text-align: justify;"><b><span style="color: green; font-family: &quot;Courier New&quot;; font-size: 14pt;">Important structure and union:<o:p></o:p></span></b></div><div style="text-align: justify;" class="MsoNormal"><span class="apple-style-span"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">The header file</span></span><span class="apple-converted-space"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> <b>dos.h</b> </span></span><span class="apple-style-span"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">defines two important structures and one union. They are: <o:p></o:p></span></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br />1. </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">struct</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> BYTEREGS {</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">unsigned</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">char</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> al, ah, bl, bh;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">unsigned</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">char</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> cl, ch, dl, dh;<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><span> </span><span style="color: black;">};</span><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">2. </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">struct</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> WORDREGS {</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">unsigned</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">int</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> ax, bx, cx, dx;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">unsigned</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">int</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> si, di, cflag, flags;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><span> </span>};</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">3. </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">union</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> REGS {</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">struct</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> WORDREGS x;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">struct</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> BYTEREGS h;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><span> </span>};<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: green; font-family: &quot;Courier New&quot;; font-size: 14pt;">Note:</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> Try to remember above structures and union.<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span class="apple-style-span"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">There is also one very important function int86 () which has been defined in dos.h header file. It is general 8086 software interrupt interface. It will better to explain it by an example.</span></span><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br /></span><span style="color: rgb(0, 0, 102); font-family: &quot;Courier New&quot;; font-size: 14pt;"><br /></span><span class="apple-style-span"><b><span style="color: blue; font-family: &quot;Courier New&quot;; font-size: 14pt;">Write a c program to display mouse pointer?</span></b></span><span style="color: blue; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br /></span><span class="apple-style-span"><span style="color: green; font-family: &quot;Courier New&quot;; font-size: 14pt;">Answer: </span></span><span style="color: red; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br /><br /></span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">#include</span></b><span style="color: rgb(42, 0, 255); font-family: &quot;Courier New&quot;; font-size: 14pt;"> <dos.h></dos.h></span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">#include</span></b><span style="color: rgb(42, 0, 255); font-family: &quot;Courier New&quot;; font-size: 14pt;"> <stdio.h></stdio.h></span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">void</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> <b>main</b>()</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">{</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">union</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> REGS i,o;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">i.</span><span style="color: rgb(0, 0, 192); font-family: &quot;Courier New&quot;; font-size: 14pt;">x</span><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">.ax=1;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">int86(0x33,&amp;i,&amp;o);</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">getch();</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">}<o:p></o:p></span></div><div class="MsoNormal" style="margin-bottom: 13.5pt; text-align: justify;"><span class="apple-style-span"><span style="color: green; font-family: &quot;Courier New&quot;; font-size: 14pt;">Explanation:</span></span><span class="apple-converted-space"><span style="color: rgb(0, 0, 102); font-family: &quot;Courier New&quot;; font-size: 14pt;"> </span></span><span class="apple-style-span"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">To write such program you must have one interrupt table.</span></span><span class="apple-converted-space"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> Following table is only small part of interrupt table.<o:p></o:p></span></span></div><div class="separator" style="clear: both; text-align: justify;"><span style="margin-left: 1em; margin-right: 1em;"><img src="http://2.bp.blogspot.com/_uIwyaTjqYYw/Sp7M715-iEI/AAAAAAAABAs/7tdIaHDWDpQ/s320/Concept1.jpeg" border="0" /></span></div><div class="MsoNormal" style="margin-bottom: 13.5pt; text-align: justify;"><span style="font-size: 14pt;"><br /><br /></span><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">This table consists for column. They are:<o:p></o:p></span></div><div class="MsoNormal" style="margin-left: 0.75in; text-indent: -0.5in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><span>(1)<span style="font-family: &quot;Times New Roman&quot;; font-size-adjust: none; font-size: 7pt; font-stretch: normal; font-style: normal; font-variant: normal; font-weight: normal; line-height: normal;"> </span></span></span><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">Input<o:p></o:p></span></div><div class="MsoNormal" style="margin-left: 0.75in; text-indent: -0.5in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><span>(2)<span style="font-family: &quot;Times New Roman&quot;; font-size-adjust: none; font-size: 7pt; font-stretch: normal; font-style: normal; font-variant: normal; font-weight: normal; line-height: normal;"> </span></span></span><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">Output <o:p></o:p></span></div><div class="MsoNormal" style="margin-left: 0.75in; text-indent: -0.5in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><span>(3)<span style="font-family: &quot;Times New Roman&quot;; font-size-adjust: none; font-size: 7pt; font-stretch: normal; font-style: normal; font-variant: normal; font-weight: normal; line-height: normal;"> </span></span></span><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">Service number<o:p></o:p></span></div><div class="MsoNormal" style="margin-left: 0.75in; text-indent: -0.5in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><span>(4)<span style="font-family: &quot;Times New Roman&quot;; font-size-adjust: none; font-size: 7pt; font-stretch: normal; font-style: normal; font-variant: normal; font-weight: normal; line-height: normal;"> </span></span></span><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">Purpose<o:p></o:p></span></div><div class="MsoNormal" style="margin-left: 0.25in; text-align: justify;"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br />Now look at the first row of interrupt table. To show the mouse pointer assign ax equal to 1 i.e. service number while ax is define in the WORDREGS<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: rgb(0, 0, 102); font-family: &quot;Courier New&quot;; font-size: 14pt;"><br /></span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">struct</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> WORDREGS {</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">unsigned</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">int</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> <b>ax</b>, bx, cx, dx;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">unsigned</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">int</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> si, di, cflag, flags;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">};</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">And WORDRGS is define in the </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">union</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> REGS</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">union</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> REGS {</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">struct</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> <b>WORDREGS x</b>;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">struct</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> BYTEREGS h;</span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;"><o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">};<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">So to access the structure member ax first declare a variable of REGS i.e.<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br />REGS i, o;<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: green; font-family: &quot;Courier New&quot;; font-size: 14pt;">Note:</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> We generally use i for input and o for output<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br />To access the ax write<span class="apple-converted-space"> </span><strong><span style="font-family: &quot;Courier New&quot;;">i.x.ax</span></strong><span class="apple-converted-space"> </span>(We are using structure variable i because ax is input<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">(See in the interrupt table)<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br />So to show mouse pointer assign the value of service number to it:<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><span> </span><br /><strong><span style="font-family: &quot;Courier New&quot;;">i.x.ax=1; <o:p></o:p></span></strong></span></div><div style="text-align: justify;" class="MsoNormal"><b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br /></span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">To provide this information to microprocessor<br />we use<span class="apple-converted-space"> </span><strong><span style="font-family: &quot;Courier New&quot;;">int86</span></strong><span class="apple-converted-space"><b> </b></span>function. It has three parameters<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"><br />1. Interrupt number i.e. </span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;">0x33<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">2. </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">union</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> REGS *inputregiste i.e. </span><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;">&amp;i<o:p></o:p></span></div><div style="text-align: justify;" class="MsoNormal"><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;">3. </span><b><span style="color: rgb(127, 0, 85); font-family: &quot;Courier New&quot;; font-size: 14pt;">union</span></b><span style="color: black; font-family: &quot;Courier New&quot;; font-size: 14pt;"> REGS *outputregiste i.e. &o;<o:p></o:p></span></div><div style="text-align: justify;"><span style="font-family: &quot;Courier New&quot;; font-size: 14pt;">So write:<span class="apple-converted-space"><b><span style="color: black;"> </span></b></span><strong><span style="color: black; font-family: &quot;Courier New&quot;; font-weight: normal;">int86 (0x33, &amp;i, &amp;o);</span></strong></span></div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-7245579285110384773?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-54229978692880999592010-02-14T11:12:00.004-06:002010-02-14T11:40:54.277-06:00<div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="" color="maroon" face="'Courier New'">Video Memory<o:p></o:p></font></b><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="" color="maroon" face="'Courier New'"><o:p> </o:p></font></b><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" color="black" face="'Courier New'">Segment number 0XA and 0XB is known as video memory. There are two types of video memory.<o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" face="'Courier New'"><o:p> </o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" color="black" face="'Courier New'">(a) Text video memory</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" color="black" face="'Courier New'">(b) Graphics video memory<o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" face="'Courier New'"><o:p> </o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="" color="maroon" face="'Courier New'">(a) Text video memory:<o:p></o:p></font></b><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" color="black" face="'Courier New'">Segment number 0XB is known as text video memory.</font><font style="" size="3" face="'Courier New'"> <font color="black">This segment is divided into 25 rows and 80 columns which creates 80*25=2000 cells.</font><o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" color="black" face="'Courier New'">Size of each cell is two byte. Each cell is divided into two parts each of size one byte.<o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" face="'Courier New'"><o:p> </o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="" color="maroon" face="'Courier New'">(a) Text byte:</font></b></font><font style="" size="3" color="black" face="'Courier New'"> First byte stores character information. It stores character as ASCII code.<o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" face="'Courier New'"><o:p> </o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="" color="maroon" face="'Courier New'">(b) Color byte:</font></b></font><font style="" size="3" color="black" face="'Courier New'"> Second byte stores color information of text byte character.<o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" face="'Courier New'"><o:p> </o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" color="black" face="'Courier New'">In other word we can say each even byte stores character and each odd byte stores color.</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="color: rgb(51, 153, 102);" size="3" face="'Courier New'">Simple example:<o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="color: rgb(51, 153, 102);" size="3" face="'Courier New'"><o:p> </o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="" color="maroon" face="'Courier New'">(q)What will be output of following c program?<o:p></o:p></font></b><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'"><o:p> </o:p></font></b><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">void</font></b></font><font style="" size="3" color="black" face="'Courier New'"> <b>main</b>(){</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><font size="3"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">int</font></b></font><font style="" size="3" color="black" face="'Courier New'"> i;</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><font size="3"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b></font><font style="" size="3" color="black" face="'Courier New'"> far *ptr=(</font><font size="3"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b></font><font style="" size="3" color="black" face="'Courier New'"> *)0XB8000000;</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><font style="" size="3" color="black" face="'Courier New'">*ptr=</font><font style="color: rgb(42, 0, 255);" size="3" face="'Courier New'">'A'</font><font style="" size="3" color="black" face="'Courier New'">;</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><font style="" size="3" color="black" face="'Courier New'">*(ptr+1)=4;</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div class="MsoNormal" style="text-indent: 0.5in; text-align: justify;"><font style="" size="3" face="'Courier New'"><o:p> </o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="" size="3" color="black" face="'Courier New'">}</font><font style="" size="3" face="'Courier New'"><o:p></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font style="color: rgb(51, 153, 102);" size="3" face="'Courier New'"><o:p><font style="" color="black" face="Georgia"><font style="color: rgb(51, 153, 102);" face="'Courier New'">Output:</font><font style="" color="black" face="'Courier New'"> It will display character A in the red color as shown following screen dump:</font></font></o:p></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3" face="'Courier New'"><br /></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3" face="'Courier New'"><font style="color: rgb(0, 0, 238);" face="Georgia"><img alt="" id="BLOGGER_PHOTO_ID_5357994131538693778" src="http://1.bp.blogspot.com/_uIwyaTjqYYw/SltrRlb9zpI/AAAAAAAAA4g/U_beThpSCMg/s400/pointer1.bmp" style="margin: 0px auto 10px; cursor: pointer; display: block; height: 266px; text-align: center; width: 336px;" border="0" /></font></font><font size="3"><br /></font></div><div style="text-align: justify;" class="MsoNormal"><font size="3"><br /></font></div><div style="text-align: justify;"><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="maroon" face="'Courier New'">Color scheme:<o:p></o:p></font></b></div></font><br /><br /><font size="3" face="'Courier New'"><font style="" face="Georgia"><img alt="" id="BLOGGER_PHOTO_ID_5357994127372451874" src="http://1.bp.blogspot.com/_uIwyaTjqYYw/SltrRV6qACI/AAAAAAAAA4Y/WOWwt6WqyLY/s640/Concept7.jpeg" style="margin: 0px auto 10px; display: block; text-align: center; width: 400px; height: 111px;" border="0" /></font></font><br /><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="maroon" face="'Courier New'"><o:p><font style="font-weight: normal;" color="black">Color byte of size 8 bit stores the color information in the following manner.</font></o:p></font></b></div></font><br /><br /><br /><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'">First four bits stores color information of character.<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">0000 0001:</font></b><font style="" color="black" face="'Courier New'"> Blue color (1)</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">0000 0010:</font></b><font style="" color="black" face="'Courier New'"> Green color (2)</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">0000 0100:</font></b><font style="" color="black" face="'Courier New'"> Red color (4)</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">0000 1000:</font></b><font style="" color="black" face="'Courier New'"> To increase the intensity of color. (8)<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="green" face="'Courier New'">Note:</font></b><font style="" color="black" face="'Courier New'"> Any other number will generate mixture of above four basic colors.<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'">Next four bits stores color information of background of character.<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">0001 0000</font></b><font style="" color="black" face="'Courier New'">: Blue color (16)</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">0010 0000</font></b><font style="" color="black" face="'Courier New'">: Green color (32)</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">0100 0000</font></b><font style="" color="black" face="'Courier New'">: Red color (64)</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="black" face="'Courier New'">1000 0000</font></b><font style="" color="black" face="'Courier New'">: To increase the intensity of color. (128)<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="green" face="'Courier New'">Note:</font></b><font style="" color="black" face="'Courier New'"> Any other number will generate after mixing of above four basic colors.<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">Examples:<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="maroon" face="'Courier New'">(1)What will be output of following c program?<o:p></o:p></font></b></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">void</font></b><font style="" color="black" face="'Courier New'"> <b>main</b>(){</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">int</font></b><font style="" color="black" face="'Courier New'"> i;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> far *ptr=(</font><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> *)0XB8000000;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*ptr=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'A'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+1)=1;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+2)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'B'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+3)=2;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+4)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'C'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+5)=4;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'">}<o:p></o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'"><o:p> </o:p></font></div></font><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">Output:<o:p></o:p></font></div></font><br /><br /><br /><font size="3" face="'Courier New'"><div class="MsoNormal" style="text-align: justify;"><font color="green"><font style="color: rgb(0, 0, 238);" face="Georgia"><img alt="" id="BLOGGER_PHOTO_ID_5357994137234043842" src="http://2.bp.blogspot.com/_uIwyaTjqYYw/SltrR6p188I/AAAAAAAAA4o/3K7rV3oBjvE/s400/pointer2.bmp" style="margin: 0px auto 10px; cursor: pointer; display: block; height: 270px; text-align: center; width: 379px;" border="0" /></font></font></div></font><br /><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="maroon" face="'Courier New'">(2)What will be output of following c program?<o:p></o:p></font></b></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">void</font></b><font style="" color="black" face="'Courier New'"> <b>main</b>(){</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">int</font></b><font style="" color="black" face="'Courier New'"> i;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> far *ptr=(</font><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> *)0XB8000000;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*ptr=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'W'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+1)=1;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+2)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'O'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+3)=2;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+4)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'R'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+5)=4;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+6)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'L'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+7)=1;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+8)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'D'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+9)=2;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'">}<o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">Output:<o:p></o:p></font></div></font></font><br /><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="color: rgb(0, 0, 238);" face="Georgia"><img alt="" id="BLOGGER_PHOTO_ID_5357994512141517106" src="http://4.bp.blogspot.com/_uIwyaTjqYYw/SltrnvSwATI/AAAAAAAAA5I/IuYHhFSMYRc/s400/PONTER3.bmp" style="margin: 0px auto 10px; cursor: pointer; display: block; height: 269px; text-align: center; width: 381px;" border="0" /></font></div></font></font><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="maroon" face="'Courier New'">(3)What will be output of following c program?<o:p></o:p></font></b></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">//Mixture of basic color<o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">void</font></b><font style="" color="black" face="'Courier New'"> <b>main</b>(){</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">int</font></b><font style="" color="black" face="'Courier New'"> i;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> far *ptr=(</font><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> *)0XB8000000;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">clrscr();</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*ptr=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'W'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+1)=3;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+2)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'O'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+3)=5;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+4)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'R'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+5)=6;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+6)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'L'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+7)=7;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+8)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'D'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+9)=3;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'">}<o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">Output:<o:p></o:p></font></div></font></font><br /><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="color: rgb(0, 0, 238);" face="Georgia"><img alt="" id="BLOGGER_PHOTO_ID_5357994141483877554" src="http://3.bp.blogspot.com/_uIwyaTjqYYw/SltrSKfFRLI/AAAAAAAAA4w/xwWtfbS4KlY/s400/POINTER4.bmp" style="margin: 0px auto 10px; cursor: pointer; display: block; height: 226px; text-align: center; width: 400px;" border="0" /></font></div></font></font><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="maroon" face="'Courier New'">(4)What will be output of following c program?<o:p></o:p></font></b></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">//To increase the intensity of color.<o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">void</font></b><font style="" color="black" face="'Courier New'"> <b>main</b>(){</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">int</font></b><font style="" color="black" face="'Courier New'"> i;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> far *ptr=(</font><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> *)0XB8000000;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*ptr=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'P'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+1)=1+8;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+2)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'O'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+3)=2+8;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+4)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'I'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+5)=3+8;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+6)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'N'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+7)=4+8;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+8)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'T'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+9)=5+8;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+10)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'E'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+11)=6+8;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+12)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'R'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+13)=7+8;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'">}<o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">Output:<o:p></o:p></font></div></font></font><br /><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="color: rgb(0, 0, 238);" face="Georgia"><img alt="" id="BLOGGER_PHOTO_ID_5357994146097738642" src="http://2.bp.blogspot.com/_uIwyaTjqYYw/SltrSbrHM5I/AAAAAAAAA44/k-HcOWchydw/s400/POINTER8.bmp" style="margin: 0px auto 10px; cursor: pointer; display: block; height: 209px; text-align: center; width: 400px;" border="0" /></font></div></font></font><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="" color="maroon" face="'Courier New'">(5)What will be output of following c program?<o:p></o:p></font></b></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">// for background color<o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">void</font></b><font style="" color="black" face="'Courier New'"> <b>main</b>(){</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">int</font></b><font style="" color="black" face="'Courier New'"> i;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> far *ptr=(</font><b><font style="color: rgb(127, 0, 85);" face="'Courier New'">char</font></b><font style="" color="black" face="'Courier New'"> *)0XB8000000;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*ptr=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'M'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="margin-left: 0.5in; text-align: justify;"><font style="" color="black" face="'Courier New'">*(ptr+1)=4+32;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+2)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'A'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+3)=4+32;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+4)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'N'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+5)=4+32;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+6)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'I'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+7)=4+16;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+8)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'S'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+9)=4+16;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+10)=</font><font style="color: rgb(42, 0, 255);" face="'Courier New'">'H'</font><font style="" color="black" face="'Courier New'">;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" color="black" face="'Courier New'">*(ptr+11)=4+16;</font><font style="" face="'Courier New'"><o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify; text-indent: 0.5in;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="black" face="'Courier New'">}<o:p></o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" face="'Courier New'"><o:p> </o:p></font></div></font></font><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="" color="green" face="'Courier New'">Output:<o:p></o:p></font></div></font></font><br /><br /><br /><font size="3" face="'Courier New'"><font color="green"><div class="MsoNormal" style="text-align: justify;"><font style="color: rgb(0, 0, 238);" face="Georgia"><img alt="" id="BLOGGER_PHOTO_ID_5357994504501256066" src="http://1.bp.blogspot.com/_uIwyaTjqYYw/SltrnS1K34I/AAAAAAAAA5A/Isa27ik_DF4/s400/POINTER9.bmp" style="margin: 0px auto 10px; cursor: pointer; display: block; height: 267px; text-align: center; width: 400px;" border="0" /></font></div></font></font></div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5422997869288099959?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-83964292220226268202010-02-14T11:05:00.001-06:002010-02-14T11:06:45.025-06:00#include<br />#include<br />#include<br />#include<br />void main()<br />{<br /> float x1,y1,x2,y2,x3,y3;<br /> float a,b,c,m1,m2,m3;<br /> clrscr();<br /> printf("Enter coordinates of vertex A(x &amp; y respectively):- ");<br /> scanf("%f%f",&amp;x1,&amp;y1);<br /> printf("<br />Enter coordinates of vertex B(x &amp; y respectively):- ");<br /> scanf("%f%f",&amp;x2,&amp;y2);<br /> printf("<br />Enter coordinates of vertex C(x &amp; y respectively):- ");<br /> scanf("%f%f",&amp;x3,&amp;y3);<br /> if ((x1==x2 &amp;&amp; x2==x3)||(y1==y2 &amp;&amp; y2==y3))<br /> {<br /> printf("<br /><br />These coordinates can't represent a triangle.");<br /> printf("<br />A,B &amp; C are colinear &amp; thus consitute a line.");<br /> getch();<br /> exit(0);<br /> }<br /> else<br /> {<br /> m1=(y2-y1)/(x2-x1);<br /> m2=(y3-y2)/(x3-x2);<br /> m3=(y3-y1)/(x3-x1);<br /> }<br /> if (m1==m2||m2==m3||m3==m1)<br /> {<br /> printf("<br /><br />These coordinates can't represent a triangle.");<br /> printf("<br />A,B &amp; C are colinear &amp; thus consitute a line.");<br /> printf("<br /><br /><br /><br /><br /> HAVE A NICE DAY! BYE.");<br /> getch();<br /> exit(0);<br /><br /> }<br /> a = sqrt(pow((x2-x3),2) + pow((y2-y3),2));<br /> b = sqrt(pow((x3-x1),2) + pow((y3-y1),2));<br /> c = sqrt(pow((x2-x1),2) + pow((y2-y1),2));<br /> printf("<br /><br />Length of side AB is = %f",c);<br /> printf("<br />Length of side BC is = %f",a);<br /> printf("<br />Length of side CA is = %f",b);<br /> if (a==b==c)<br /> printf("<br /><br />Triangle made by these vertices is an equilateral triangle.");<br /> else if (a==b||b==c||c==a)<br /> {<br /> if (a==b==c);<br /> else<br /> printf("<br /><br />Triangle made by these vertices is an isosceles triangle.");<br /> }<br /> else if (a!=b &amp;&amp; b!=c &amp;&amp; c!=a)<br /> printf("<br /><br />Triangle made by these vertices is a scalene triangle.");<br /> getch();<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-8396429222022626820?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-55362106053098881412010-02-14T11:04:00.000-06:002010-02-14T11:05:25.373-06:00#include<br />#include<br />#include<br />int ascii_value(char c);<br />void main()<br />{<br /><br /> int i,a;<br /> char c;<br /> clrscr();<br /> printf("Please enter a string.");<br /> printf("<br />String will be terminated if you press Ctrl-Z.");<br /> printf("<br />STRING:- ");<br /> for (i=0;(c=getchar())!=EOF;i++)<br /> {<br /> a=ascii_value(c);<br /> printf("%d%c",a,' ');<br /> }<br /> printf("<br /> are the ascii values of the characters of the entered string");<br /> printf("<br /> respectively.");<br /> printf("<br /><br /><br /><br /><br /> HAVE A NICE DAY! BYE.");<br /> getch();<br />}<br /><br /> int ascii_value(char c)<br /> {<br /> int a;<br /> a=(int)c;<br /> return(a);<br /> }<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5536210605309888141?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-30334571935886729292010-02-14T11:03:00.000-06:002010-02-14T11:04:04.448-06:00#include<br />#include<br />#define EOL '<br />'<br />#define TRUE 1<br />#define FALSE 0<br />void main()<br />{<br /> char letter[80];<br /> int tag,count,countback,flag,loop=TRUE;<br /> clrscr();<br /> while (loop)<br /> {<br /> flag=TRUE;<br /> printf("<br /><br />Please enter a word,phrase or sentence below(type END to exit the program):<br />");<br /> for (count=0;(letter[count]=getchar())!=EOL;++count)<br /> ;<br /> if ((toupper(letter[0])=='E') &amp;&amp; (toupper(letter[1])=='N') &amp;&amp; (toupper(letter[2])=='D'))<br /> break;<br /> tag=count-1;<br /> for ((count=0,countback=tag);count<=(tag/2);(++count,--countback))<br /> {<br /> if (letter[count]!=letter[countback])<br /> {<br /> flag=FALSE;<br /> break;<br /> }<br /> }<br /> for (count=0;count<=tag;++count)<br /> putchar(letter[count]);<br /> if (flag)<br /> printf(" is a palindrome.");<br /> else<br /> printf(" is not a palindrome.");<br /> }<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-3033457193588672929?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-26687830144930023032010-02-14T11:01:00.001-06:002010-02-14T11:03:10.737-06:00#include<br /># include<br />char c1,c2,a[80];<br />void main()<br />{<br /> clrscr();<br /> find_rep();<br /> getch();<br /><br />}<br /><br />void find_rep(void)<br /> /* Function to find &amp; replace any text */<br />{<br /> char c1,c2;<br /> char a[80];<br /> int i,j,k;<br /> printf("<br />Enter a line of text below:-");<br /> printf("<br />Line will be terminated by pressing ENTER.");<br /> printf("<br />TEXT:- ");<br /> gets(a);<br /> printf("<br />Enter the replaceable &amp; replacing letter respectively:- ");<br /> scanf("%c%c%c",&amp;c1,' ',&amp;c2);<br /> for (j=0;j<80;j++)<br /> {<br /> if (a[j]==c1)<br /> a[j]=c2;<br /> }<br /> puts(a);<br /> printf("<br /> Here all %c are replaced by %c.",c1,c2);<br /> return;<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-2668783014493002303?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-53226159596638062412010-02-14T11:00:00.000-06:002010-02-14T11:01:00.259-06:00#include<br />#include<br />#include<br />#include<br />#include<br />#include<br />//#include"h:incmenu1.c"<br />//void netview()<br />void main()<br />{<br /> FILE *fs;<br /> int count=0;<br /> char ch;<br /> int gd=DETECT,gm;<br /> initgraph(&amp;gd,&amp;gm,"");<br /> //make();<br /> cleardevice();<br /> closegraph();<br /> make();<br /> fs=fopen("temp.txt","r");<br /> // make();<br /> if(fs==NULL)<br /> {<br /> clearviewport();<br /> printf("file not found");<br /> getch();<br /> // if(getch()==27)<br /> // menu1();<br /> }<br /> else<br /> while(1)<br /> {<br /><br /> ch=fgetc(fs);<br /><br /> if(ch==EOF)<br /> break;<br /> if(ch=='<br />')<br /> count++;<br /> if(count==24)<br /> {<br /> count=0;<br /> //getch();<br /> printf(" Press Enter");<br /> getch();<br /> clearviewport();<br /> setbkcolor(1);<br /> }<br /> setbkcolor(1);<br /> ch= fputc(fs,fs);<br /> printf("%c",ch);<br /><br /> }<br /> // if(getch()==27)<br /> // menu1();<br /><br /> fs=fopen("temp1.txt","r");<br /> if(fs==NULL)<br /> {<br /> printf("file not found");<br /> getch();<br /> // if(getch()==27)<br /> // menu1();<br /> }<br /> else<br /> while(1)<br /> {<br /><br /> ch=fgetc(fs);<br /> if(ch==EOF)<br /> break;<br /> printf("%c",ch);<br /> }<br /><br /> putc(ch,fs);<br /> fclose(fs);<br /> getch();<br /> // menu1();<br /><br /><br />}<br /><br />make()<br />{<br /><br /> system("net view > temp.txt");<br /> system("net user > temp1.txt");<br /> return 1;<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5322615959663806241?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-4144428992295992952010-02-14T10:59:00.000-06:002010-02-14T11:00:07.927-06:00main()<br />{<br /> int n;<br /> char ch;<br /> while(1)<br /> {<br /> clrscr();<br /> printf("<br /> Enter an integer to see its Binary Equivalent");<br /> printf("<br /><br /> Enter ");<br /> scanf("%d",&amp;n);<br /> showbits(n);<br /><br /> printf("<br /> continue ? ");<br /> ch=getch();<br /> if(ch==27)<br /> break;<br /> }<br />}<br /><br />showbits(int n)<br />{<br /> int i,bit,mask,count=0;<br /> printf("<br /> ");<br /> for(i=15;i>=0;i--)<br /> {<br /> mask=1<<br /><br /> bit=n &amp; mask;<br /><br /> if(bit==mask)<br /> printf("1");<br /> else<br /> printf("0");<br /> count++;<br /> if(count%4==0)<br /> printf(" ");<br /> }<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-414442899229599295?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-29539531828444792932010-02-14T10:57:00.000-06:002010-02-14T10:59:08.757-06:00#include<br />#include<br />#include<br />#include<br />#include<br /><br />union REGS i,o;<br />char *menu[]={"1.Add Records","2.Show Records","3.Modify Records",<br /> "4.Del Records","5.Search Record","6.Exit"};<br /><br /><br />main()<br />{<br /> int gd=DETECT,gm,choice=1,width=0,i,count,sr=0;<br /> char **buffer;<br /> FILE *m,*t;<br /> char sname[20];<br /> long int size;<br /> char mrec;<br /> struct cust<br /> {<br /> char name[20];<br /> int accno;<br /> float balance;<br /> };<br /> struct cust s;<br /><br /> m=fopen("C:\record.txt","rb+");<br /><br /> if(m==NULL)<br /> {<br /> t=fopen("C:\record.txt","wb+");<br /><br /> if(t==NULL)<br /> { printf("Error in opening file ");<br /> exit();<br /> }<br /> }<br /> size=sizeof(s);<br /> initgraph(&amp;gd,&amp;gm,"C:\Tc\Bgi");<br /><br /> setbkcolor(1);<br /> setcolor(11);<br /> if(initmouse()==0)<br /> {<br /> printf("<br />Mouse driver not loaded...");<br /> exit();<br /> }<br /><br /> count=sizeof(menu)/sizeof(char *);<br /> settextstyle(TRIPLEX_FONT,0,3);<br /> displaymenu(menu,count,10,10);<br /><br /> for(i=0;i<br /> {<br /> if(textwidth(menu[i])>width)<br /> width=textwidth(menu[i]);<br /> }<br /><br />// movemouseptr(&amp;x1,&amp;y1);<br /><br /> buffer=malloc(sizeof(menu));<br /> savemenu(menu,buffer,width,count,10,10);<br /> showmouseptr();<br /> while (1)<br /> { displaymenu(menu,count,10,10);<br /> choice=getresponse(menu,buffer,width,count,10,10);<br /> gotoxy(50,15);<br /><br /> hidemouseptr();<br /> switch (choice)<br /> {<br /> case 1 : cleardevice();<br /> fseek(m,0,SEEK_END);<br /> mrec='y';<br /> gotoxy(1,1);<br /> while(mrec=='y')<br /> {<br /> printf("<br /><br />Enter the Name of the Custumer ");<br /> scanf("%s",s.name);<br /> printf("<br />Enter the Acc.no of the Custumer ");<br /> scanf("%d",&amp;s.accno);<br /> printf("<br />Enter the Balance of the Custumer ");<br /> scanf("%f",&amp;s.balance);<br /><br /> fwrite(&amp;s,size,1,m);<br /> printf("<br />Are there more Records (Y/N)");<br /> fflush(stdin);<br /> mrec=getche();<br /> } printf("Press any key to go back to menu");<br /> cleardevice();<br /> break;<br /><br /> case 2: cleardevice();<br /> rewind(m);<br /> gotoxy(1,1);<br /> printf("<br /><br /> Name Acc.No Ammount Due<br />");<br /> sr=0;<br /> if(fread(&amp;s,size,1,m)==1)<br /> { rewind(m);<br /> while(fread(&amp;s,size,1,m)==1)<br /> {<br /> printf("<br />%30s%12d%23.2f",s.name,s.accno,s.balance);<br /> sr++;<br /> }<br /> } else<br /> printf(" There is no record to Display");<br /> printf("<br /><br /> There are %d Records",sr);<br /> printf("<br /><br />Press any key to go back to menu");<br /> getch();<br /> cleardevice();<br /> break;<br /><br /> case 3: clearviewport();<br /> mrec='y';<br /> gotoxy(1,1);<br /> while(mrec=='y')<br /> {<br /> printf("<br /><br />Enter the name of Customer whose rec. is to be modified<br />");<br /> scanf("%s",sname);<br /> // gets(sname);<br /> rewind(m);<br /> while (fread(&amp;s,size,1,m)==1)<br /> { sr=0;<br /> if( strcmp (s.name,sname)==0)<br /> { sr=1;<br /> // printf("<br />Enter new name,Acc.no,Balance ");<br /> // scanf("%s%d%f",s.name,&amp;s.rollno,&amp;s.percent);<br /> printf("<br /><br />Enter the new Name of the Custumer ");<br /> scanf("%s",s.name);<br /> // gets(s.name);<br /><br /> printf("<br />Enter the new Acc.no of the Custumer ");<br /> scanf("%d",&amp;s.accno);<br /> printf("<br />Enter the new Balance of the Custumer ");<br /> scanf("%f",&amp;s.balance);<br /><br /><br /><br /><br /> fseek(m,-size,SEEK_CUR);<br /> fwrite(&amp;s,size,1,m);<br /> break;<br /> }<br /> }<br /> if(sr==0)<br /> printf("<br /> Record "%s" is not found",sname);<br /> printf("<br />Modify more records (Y/N)");<br /> fflush(stdin);<br /> mrec=getche();<br /><br /> }<br /> clearviewport();<br /> break;<br /> case 4: clearviewport();<br /> mrec='y';<br /> gotoxy(1,1);<br /> while(mrec=='y')<br /> {<br /> printf("<br />Enter the name of the Customer to delete the rec ");<br /> scanf("%s",sname);<br /> // gets(sname);<br /> t=fopen("C:\stemp.txt","wb");<br /><br /> rewind (m);<br /> while(fread(&amp;s,size,1,m)==1)<br /> {<br /> if(strcmp(s.name,sname)!=0)<br /> fwrite(&amp;s,size,1,t);<br /> }<br /> fclose(m);<br /> fclose(t);<br /> remove("C:\record.txt");<br /> rename("C:\stemp.txt","C:\record.txt");<br /><br /> m=fopen("C:\record.txt","rb+");<br /><br /> printf("Delete more records (Y/N)");<br /> fflush(stdin);<br /> mrec=getche();<br /> } clearviewport();<br /> // displaymenu(menu,count,10,10);<br /> // getch();<br /> // choice=getresponse(menu,buffer,width,count,10,10);<br /> break;<br /> case 5: clearviewport();<br /> mrec='y';<br /> gotoxy(1,1);<br /> while(mrec=='y')<br /> {<br /> printf("<br /><br />Enter the name of Customer whose rec. is to be Searched<br />");<br /> scanf("%s",sname);<br /> // gets(sname);<br /> rewind(m);<br /> while (fread(&amp;s,size,1,m)==1)<br /> { sr=0;<br /> if( strcmp (s.name,sname)==0)<br /> {<br /> // printf("<br />Enter new name,Acc.no,Balance");<br /> // scanf("%s%d%f",s.name,&amp;s.rollno,&amp;s.percent);<br /> // fseek(m,-size,SEEK_CUR);<br /> // fwrite(&amp;s,size,1,m);<br /> printf("<br />Record found");<br /> printf("<br /><br /> Name Acc.No Ammount Due<br />");<br /> printf("<br />%30s%12d%23.2f",s.name,s.accno,s.balance);<br /> sr=1;<br /> getch();<br /> break;<br /> }<br /> }<br /> if(sr==0)<br /> printf("<br /> Record "%s" is not found",sname);<br /> printf("<br />Search more records (Y/N)");<br /> fflush(stdin);<br /> mrec=getche();<br /><br /> }<br /> clearviewport();<br /> break;<br /><br /> case 6:<br /> fclose(m);<br /> exit();<br /><br /> }<br /> showmouseptr();<br /> }<br />}<br /><br />displaymenu(char **menu,int count,int x1,int y1)<br />{<br /> int i,h;<br /><br /> h=textheight(menu[0]);<br /><br /> for(i=0;i<br /> outtextxy(x1,y1+i*(h+5),menu[i]);<br />}<br /><br />savemenu (char **menu,char **buffer,int width,int count,int x1,int y1)<br />{<br /> int i,x2,yy1,yy2,area,h;<br /><br /> h=textheight(menu[0]);<br /><br /> for(i=0;i<br /> {<br /> x2=x1+width;<br /> yy1=y1+i*(h+5);<br /> yy2=y1+(i+1)*(h+5);<br /><br /> area=imagesize(x1,yy1,x2,yy2);<br /> buffer[i]=malloc(area);<br /> getimage(x1,yy1,x2,yy2,buffer[i]);<br /><br /> }<br />}<br /><br />getresponse(char **menu,char **buffer,int width,int count,int x1,int<br />y1)<br />{<br /> int choice=1,prevchoice=0,x,y,x2,y2,button;<br /> int in,i,h;<br /><br /> h=textheight(menu[0]);<br /> y2=y1+count*(h+5);<br /> x2=x1+width;<br /> rectangle(x1-5,y1-5,x2+5,y2+5);<br /><br /> while(1)<br /> {<br /> getmousepos(&amp;button,&amp;x,&amp;y);<br /><br /> if (x>=x1&amp;&amp;x<=x2&amp;&amp;y>=y1&amp;&amp;y<=y2)<br /> { in=1;<br /><br /> for(i=1;i<=count;i++)<br /> {<br /> if(y<=y1+i*(h+5))<br /> { choice=i;<br /> break;<br /> }<br /> }<br /><br /> if(prevchoice!=choice)<br /> {<br /> hidemouseptr();<br /> highlight(buffer,choice,h,x1,y1);<br /><br /> if(prevchoice)<br /> dehighlight(buffer,prevchoice,h,x1,y1);<br /><br /> prevchoice=choice;<br /> showmouseptr();<br /> }<br /> if((button &amp; 1)==1)<br /> {<br /> while ((button &amp; 1)==1)<br /> getmousepos(&amp;button,&amp;x,&amp;y);<br /><br /> if(x>=x1&amp;&amp;x<=x2&amp;&amp;y>=y1&amp;&amp;y<=y2)<br /> return(choice);<br /> }<br /> }<br /> else<br /> {<br /> if( in ==1)<br /> {<br /> in=0;<br /> prevchoice=0;<br /> hidemouseptr();<br /> dehighlight(buffer,choice,h,x1,y1);<br /> showmouseptr();<br /> }<br /> }<br /> }<br />}<br /><br />highlight(char **buffer,int ch,int h,int x1,int y1)<br />{<br /> putimage(x1,y1+(ch-1)*(h+5),buffer[ch-1],NOT_PUT);<br />}<br /><br /><br />dehighlight(char **buffer,int ch,int h,int x1,int y1)<br />{<br /> putimage(x1,y1+(ch-1)*(h+5),buffer[ch-1],COPY_PUT);<br />}<br /><br /><br />/* initmouse */<br />initmouse()<br />{<br /> i.x.ax=0;<br /> int86 (0x33,&amp;i,&amp;o);<br /> return(o.x.ax);<br />}<br /><br />/* displays mouse pointer */<br />showmouseptr()<br />{<br /> i.x.ax=1;<br /> int86(0x33,&amp;i,&amp;o);<br />}<br /><br />hidemouseptr()<br />{<br /> i.x.ax=2;<br /> int86(0x33,&amp;i,&amp;o);<br />}<br /><br />/*gets mouse coordinates and button status*/<br /><br />getmousepos(int *button,int *x,int *y)<br />{<br /> i.x.ax=3;<br /> int86(0x33,&amp;i,&amp;o);<br /> *button=o.x.bx;<br /> *x=o.x.cx;<br /> *y=o.x.dx;<br />}<br /><br />movemouseptr(int *x,int *y)<br />{<br /> i.x.ax=4;<br /> int86(0x33,&amp;i,&amp;o);<br /> o.x.cx=*x;<br /> o.x.dx=*y;<br /> return 0;<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-2953953182844479293?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-77792626013958360772010-02-14T10:56:00.000-06:002010-02-14T10:57:45.059-06:00#include<br />#include<br />void main()<br />{<br /> int i[100],j[100],temp[100];<br /> int a,b=1,c,i1=2,k,b2=0;<br /> printf("ENTER NUMBER OF DATA (MAXIMUM 100):");<br /> scanf("%d",&amp;k);<br /> printf("ENTER DATA (IN INTEGER):<br />");<br /> for(a=0;a<br /> {<br /> printf("k=[%d] ",a+1);<br /> scanf("%d",&amp;i[a]);<br /> }<br /> for(a=0,b=1;a<br /> {<br /> if((i[b]-i[a])>0)<br /> {<br /> temp[a]=i[b];<br /> temp[b]=i[a];<br /> i[a]=temp[a];<br /> i[b]=temp[b];<br /> }<br /> for(c=i1;c<br /> {<br /> if((i[c]-i[a])>0)<br /> {<br /> temp[a]=i[c];<br /> temp[c]=i[a];<br /> i[a]=temp[a];<br /> i[c]=temp[c];<br /> }<br /> }<br /> i1++;<br /> }<br /> printf("<br /><br />YOUR ARRAY IN DECENDING ORDER IS AS FOLLOWS:<br /> YOUR<br />ARRAY[%d]= ",k);<br /> for(b2=0;b2<br /> {<br /> printf("%d ",i[b2]);<br /> }<br /> printf("<br /><br /> ***THANK YOU FOR USING THIS PROGRAM***<br />");<br /> }<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-7779262601395836077?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-64211235499820931572010-02-14T10:55:00.000-06:002010-02-14T10:56:38.186-06:00#include<br />#include<br /><br />void main()<br />{<br /> double n,g1,g2;<br /> int flag=0;<br /> clrscr();<br /> printf("Enter the no.: ");<br /> scanf("%lf",&amp;n);<br /> if(n<0)<br /> {<br /> n=-n;<br /> flag=1;<br /> }<br /> else if(n==0)<br /> {<br /> printf("<br />The root of %6.4lf is",n);<br /> textcolor(GREEN);<br /> cprintf(" %6.4lf",g2);<br /> getch();<br /> exit(0);<br /> }<br /> g2=n/2;<br /> do<br /> {<br /> g1=g2;<br /> g2=(g1+n/g1)/2;<br /> }<br /> while((g1-g2)!=0);<br /> if(flag==1)<br /> {<br /> printf("<br />The root of %6.4lf is",-n);<br /> textcolor(GREEN);<br /> cprintf(" +/- %6.4lf i",g2);<br /> }<br /> else<br /> {<br /> printf("<br />The root of %6.4lf is",n);<br /> textcolor(GREEN);<br /> cprintf(" +/- %6.4lf",g2);<br /> }<br /> getch();<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-6421123549982093157?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-66290405821846320182010-02-14T10:54:00.000-06:002010-02-14T10:55:25.017-06:00#include<br />#include<br />#include<br />#include<br />#include<br />#include<br />union REGS i,o;<br />int button,p,q;<br />main()<br />{<br />int gd = DETECT,gm;<br />int maxx,maxy,x,y,button,i,j,x2,x1,y2,y1;<br />int cor[60][2],f=1,hour,min,sec,l,dat,mont,yea;<br />struct arccoordstype arcinfo;<br />struct time t;<br />struct date d;<br />char mm[80],mf[80],m[50],n[5];<br />char<br />mon[12][4]={"Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","N<br />ov","Dec"};<br />initmouse();<br />showmouseptr();<br />initgraph(&amp;gd,&amp;gm,"");<br />maxx=getmaxx();<br />maxy=getmaxy();<br />//textcolor(0);<br />setviewport(1,1,getmaxx()-2,getmaxy()-2,1);<br />showmouseptr();<br />restrictmouseptr(350,20,600,70);<br />circle(maxx/2,maxy/2,100);<br />putpixel(maxx/2,maxy/2,3);<br />setfillstyle(0,0);<br />j=90;<br />setcolor(0);<br />cleardevice();<br />setfillstyle(1,14);<br />bar(390,55,440,70);<br />setfillstyle(1,14);<br />bar(460,55,500,70);<br />setfillstyle(1,14);<br />bar(390,30,460,45);<br />setfillstyle(1,14);<br />bar(466,30,540,45);<br />j=30;<br />setfillstyle(1,12);<br />bar(180,100,465,387);<br />setfillstyle(1,0);<br />bar(185,104,460,383);<br />while(f<13)<br />{<br />if (i<=90) {i=90-j;} else { i=360-(j-90);}<br />setcolor(0);<br />arc(maxx/2,maxy/2,90,i,125);<br />getarccoords(&amp;arcinfo);<br />setcolor(14);<br />settextstyle(DEFAULT_FONT, HORIZ_DIR,2);<br />if (f<=5) {sprintf(n,"%d",f);outtextxy(arcinfo.xend+2,arcinfo.yend,n);}<br />else if ((f>=7)&amp;&amp;(f<12))<br />{sprintf(n,"%d",f);outtextxy(arcinfo.xend-7,arcinfo.yend,n);}<br />else if<br />(f==12){sprintf(n,"%d",f);outtextxy(arcinfo.xstart-10,arcinfo.ystart,n);}<br />else if (f==6) {sprintf(n,"<br />%d",f);outtextxy(arcinfo.x-17,arcinfo.y+120,n);}<br />j+=30;<br />f++;<br />}<br />setcolor(13);<br />sprintf(mm,"Exit");<br />outtextxy(550,35,mm);<br />settextstyle(DEFAULT_FONT,0,1);<br />sprintf(mm,"Done by:");<br />outtextxy(400,435,mm);<br />settextstyle(DEFAULT_FONT, HORIZ_DIR,2);<br />sprintf(mm,"Ajith.V.V");<br />outtextxy(470,445,mm);<br /><br />settextstyle(DEFAULT_FONT, HORIZ_DIR,0);<br />outtextxy(400,60,"Time Date");<br /><br />sprintf(mm,"SET-TIME");<br />outtextxy(395,35,mm);<br />sprintf(mm,"SET-DATE");<br />outtextxy(470,35,mm);<br />f=0;<br />while(1)<br />{<br />getmousepos(&amp;button,&amp;p,&amp;q);<br />getdate(&amp;d);<br />gettime(&amp;t);<br />//outer<br />setfillstyle(1,15);<br />pieslice(maxx/2,maxy/2,0,360,5);<br />setfillstyle(1,12);<br />bar(180,100,184,387);<br />bar(461,100,465,387);<br />bar(180,100,465,105);<br />bar(180,385,465,387);<br />bar(200,390,445,400);<br />bar(180,400,465,405);<br />//hour<br />if (t.ti_hour>13) {t.ti_hour = t.ti_hour - 12;}<br />if (t.ti_min==0) {i=(t.ti_hour*30);} else<br />{i=((t.ti_hour*30)+((t.ti_min/12)*6));}<br />if (i>=90) {j=360-(i-90);}<br />else {j=90-i;}<br />textcolor(0);<br />setcolor(0);<br />arc(maxx/2,maxy/2,j,90,50);<br />getarccoords(&amp;arcinfo);<br />if (((t.ti_hour==0)||(t.ti_hour==12))&amp;&amp;(t.ti_min<=11))<br />{<br />setcolor(0);<br />line(maxx/2,maxy/2,x1,y1);<br />setcolor(3);<br />line(maxx/2,maxy/2,maxx/2,maxy/2-50);<br />x1=0;y1=0;<br />x1=maxx/2;<br />y1=maxy/2-50;<br />}<br />else<br />{<br />setcolor(0);<br />line(maxx/2,maxy/2,x1,y1);<br />setcolor(3);<br />line(maxx/2,maxy/2,arcinfo.xstart,arcinfo.ystart);<br />x1=arcinfo.xstart;<br />y1=arcinfo.ystart;<br />}<br />//hour<br />//minutr<br />i=(t.ti_min*6);<br />if (i>=90) {j=360-(i-90);}<br />else {j=90-i;}<br />textcolor(0);<br />setcolor(0);<br />arc(maxx/2,maxy/2,j,90,90);<br />getarccoords(&amp;arcinfo);<br />if (t.ti_min==0)<br />{<br />setcolor(0);<br />line(maxx/2,maxy/2,x2,y2);<br />setcolor(2);<br />line(maxx/2,maxy/2,maxx/2,maxy/2-80);<br />x2=0;y2=0;<br />x2=maxx/2;<br />y2=maxy/2-80;<br />}<br />else<br />{<br />setcolor(0);<br />line(maxx/2,maxy/2,x2,y2);<br />setcolor(2);<br />line(maxx/2,maxy/2,arcinfo.xstart,arcinfo.ystart);<br />x2=arcinfo.xstart;<br />y2=arcinfo.ystart;<br />}<br />//minute<br />//seconds<br />i=(t.ti_sec*6);<br />if (i>=90) {j=360-(i-90);}<br />else {j=90-i;}<br />textcolor(0);<br />setcolor(0);<br />arc(maxx/2,maxy/2,j,90,100);<br />getarccoords(&amp;arcinfo);<br />setcolor(5);<br />rectangle(185,104,460,383);<br />setcolor(15);<br />//setcolor(4);<br />if (t.ti_sec==0)<br />{<br />setcolor(0);<br />line(maxx/2,maxy/2,x,y);<br />setcolor(15);<br />//setcolor(4);<br />line(maxx/2,maxy/2,maxx/2,maxy/2-100);<br />x=0;y=0;<br />x=maxx/2;<br />y=maxy/2-100;<br />}<br />else<br />{<br />setcolor(0);<br />line(maxx/2,maxy/2,x,y);<br />setcolor(15);<br />//setcolor(4);<br />line(maxx/2,maxy/2,arcinfo.xstart,arcinfo.ystart);<br />x=arcinfo.xstart;<br />y=arcinfo.ystart;<br />}<br />press();<br />getmousepos(&amp;button,&amp;p,&amp;q);<br />if ((p>=390)&amp;&amp;(p<=440)&amp;&amp;(q>=55)&amp;&amp;(q<=70)&amp;&amp;((button &amp; 1)==1))<br />{<br />f=f^1;<br />if (f==1)<br />{<br />l=3;<br />}<br />else<br />{<br />l=0;<br />gotoxy(38,20);<br />printf(" ");<br />}<br />}<br /><br />if (l==3)<br />{<br />gotoxy(38,20);<br />printf("%d:%d:%d",t.ti_hour,t.ti_min,t.ti_sec);<br />}<br /><br /><br />press();<br />getmousepos(&amp;button,&amp;p,&amp;q);<br />if ((p>=460)&amp;&amp;(p<=500)&amp;&amp;(q>=55)&amp;&amp;(q<=70)&amp;&amp;((button &amp; 1)==1))<br />{<br />f=f^1;<br />if (f==1)<br />{<br />l=5;<br />}<br />else<br />{<br />l=0;<br />gotoxy(36,12);<br />printf(" ");<br />}<br />}<br /><br />if (l==5)<br />{<br />gotoxy(36,12);<br />printf("%d,%s %d ",d.da_day,mon[d.da_mon-1],d.da_year);<br />}<br /><br /><br />if (t.ti_min==0)<br />{<br />sound(2000);<br />}<br />if (t.ti_sec>=2)<br />{nosound();}<br />press();<br />getmousepos(&amp;button,&amp;p,&amp;q);<br />if ((p>=550)&amp;&amp;(p<=650)&amp;&amp;(q>=33)&amp;&amp;(q<=50)&amp;&amp;((button &amp; 1)==1)) {goto<br />end;}<br />//set time<br />if ((p>=390)&amp;&amp;(p<=460)&amp;&amp;(q>=30)&amp;&amp;(q<=45)&amp;&amp;((button &amp; 1)==1))<br />{<br />gotoxy(1,22);<br />printf("Enter :");<br />gotoxy(1,23);<br />printf("Hour[24]:");scanf("%d",&amp;hour);<br />gotoxy(1,24);<br />printf("Minute :");scanf("%d",&amp;min);<br />gotoxy(1,25);<br />printf("Second :");scanf("%d",&amp;sec);<br />if (hour!=24)<br />{t.ti_hour = hour;} else {t.ti_hour = 0;}<br />t.ti_min = min;<br />t.ti_sec = sec;<br />settime(&amp;t);<br />gotoxy(1,22);<br />printf(" ");<br />gotoxy(1,23);<br />printf(" ");<br />gotoxy(1,24);<br />printf(" ");<br />gotoxy(1,25);<br />printf(" ");<br />}<br />//set date<br />if ((p>=350)&amp;&amp;(p<=510)&amp;&amp;(q>=35)&amp;&amp;(q<=45)&amp;&amp;((button &amp; 1)==1))<br />{<br />gotoxy(1,22);<br />printf("Enter :");<br />gotoxy(1,23);<br />printf("date :");scanf("%d",&amp;dat);<br />gotoxy(1,24);<br />printf("Month :");scanf("%d",&amp;mont);<br />gotoxy(1,25);<br />printf("Year :");scanf("%d",&amp;yea);<br />d.da_day=dat;<br />d.da_mon=mont;<br />d.da_year=yea;<br />setdate(&amp;d);<br />gotoxy(1,22);<br />printf(" ");<br />gotoxy(1,23);<br />printf(" ");<br />gotoxy(1,24);<br />printf(" ");<br />gotoxy(1,25);<br />printf(" ");<br />}<br />//while end<br />}<br />end:<br />closegraph();<br />restorecrtmode();<br />//program end<br />return 0;<br />}<br /><br /><br /><br />initmouse()<br />{<br />i.x.ax = 0;<br />int86(0x33,&amp;i,&amp;o);<br />return (o.x.ax);<br />}<br /><br />showmouseptr()<br />{<br />i.x.ax = 1;<br />int86(0x33,&amp;i,&amp;o);<br />return 0;<br />}<br />hidemouseptr()<br />{<br />i.x.ax = 2;<br />int86(0x33,&amp;i,&amp;o);<br />return 0;<br />}<br /><br />restrictmouseptr(int x1,int y1,int x2,int y2)<br />{<br />i.x.ax = 7;<br />i.x.cx = x1;<br />i.x.dx = x2;<br />int86 (0x33,&amp;i,&amp;o);<br />i.x.ax = 8;<br />i.x.cx = y1;<br />i.x.dx = y2;<br />int86 (0x33,&amp;i,&amp;o);<br />return 0;<br />}<br /><br />getmousepos(int *button,int *x,int *y)<br />{<br />i.x.ax = 3;<br />int86 (0x33,&amp;i,&amp;o);<br />*button = o.x.bx;<br />*x=o.x.cx;<br />*y=o.x.dx;<br />return 0;<br />}<br /><br />press()<br />{<br />while ((button &amp; 1)==1)<br />{<br />getmousepos(&amp;button,&amp;p,&amp;q);}<br />return 0;<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-6629040582184632018?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-52974133445407649132010-02-14T10:53:00.000-06:002010-02-14T10:54:12.726-06:00#include<br />#include<br />#include<br />void main(void)<br />{<br /> char a[50],b[50];<br /> clrscr();<br /> printf("Enter the string:");<br /> gets(a);<br /> strcpy(b,a);<br /> strrev(a);<br /> if(strcmp(b,a) == 0)<br /> {<br /> printf("The given string is a palindrome!!!");<br /> }<br /> else<br /> {<br /> printf("The given string is not a palindrome!!!");<br /> }<br /> getch();<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-5297413344540764913?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-23163888494042686992010-02-14T10:47:00.000-06:002010-02-14T10:53:09.490-06:00#include<br />#include<br />main()<br />{<br /> unsigned long far *address = (unsigned long far *)0x00000000;<br /> unsigned long intadd[256];<br /> unsigned int segment, offset;<br /> int i;<br /> FILE *fp;<br /> fp = fopen("IVT.txt", "wb");<br /> for(i = 0; i < 256; i++)<br /> {<br /> intadd[i] = *(address++);<br /> segment = FP_SEG(intadd[i]);<br /> offset = FP_OFF(intadd[i]);<br /> fprintf(fp, "interrupt %3X : vector %Fp(hex) : %lu(dec)<br />",<br /> i, intadd[i], (unsigned long)segment * 16 + offset);<br /> }<br /> fclose(fp);<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-2316388849404268699?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-49795308086409912202010-02-14T10:46:00.000-06:002010-02-14T10:47:11.256-06:00<div style="text-align: justify;">#include<br />#include<br />#include<br /><br />int main(int argc,char* argv[]){<br /> FILE* fp;<br /> int i=0;<br /> char c;<br /> if(argc==1){<br /> fprintf(stderr,"Error using cat...<br />");<br /> exit(2);<br /> }<br /> if(!strcmp(argv[1],"-w")){ /* This returns 1 if match is found */<br /><br /> if(argc!=3){<br /> fprintf(stderr,"Invalid no. of arguments<br />");<br /> exit(2);<br /> }<br /> fp=fopen(argv[2],"w");<br /> if(fp==NULL)<br /> {<br /> fprintf(stderr,"Error in opening file...<br />");<br /> exit(2);<br /> }<br /> c=getchar();<br /> while(c!=EOF)<br /> {<br /> fputc(c,fp);<br /> c=getchar();<br /> }<br /> fclose(fp);<br /> }<br /> else{<br /> for(--argc;argc>0;argc--){<br /> fp=fopen(argv[++i],"r");<br /> if(fp==NULL){<br /> fprintf(stderr,"File not found...Aborting<br />");<br /> exit(2);<br /> }<br /> while((c=fgetc(fp))!=EOF)<br /> fputc(c,stdout);<br /> fclose(fp);<br /> }<br /> }<br /><br />}</div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-4979530808640991220?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-33943854398226871192010-02-14T10:44:00.001-06:002010-02-14T10:51:50.181-06:00#include<br />#define MAXWL 20 /* Maximum length of a word */<br />#define MAXNO 25 /* Maximum No of words in a sentence */<br /><br />int main(void)<br />{<br /> int word[MAXNO];<br /> int i,c,j,nc,nw;<br /><br /> for(i=0;i<br /> word[i]=0;<br /><br /> nc = nw = 0;<br /><br /> while( (c=getchar()) != EOF)<br /> {<br /> ++nc;<br /> if( c ==' ' || c =='<br />' || c ==' ')<br /> {<br /> word[nw] = nc -1; /* -1 for excluding the space in the word length */<br /> ++nw;<br /> nc = 0; /* resetting the word-length for the next word */<br /> }<br /> <br /> }<br /><br /> for( i = MAXWL; i >= 1; --i)<br /> {<br /> for(j=0;j <= nw;++j)<br /> {<br /> if( i <= word[j])<br /> putchar('*');<br /> else <br /> putchar(' ');<br /> }<br /> putchar('<br />');<br /> }<br /><br />return 0;<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-3394385439822687119?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-21351077655301350312010-02-14T10:43:00.001-06:002010-02-14T10:50:38.557-06:00#include<br />#include<br />void main()<br />{<br /> char b,c;<br /> FILE *f,*g,*h;<br /> clrscr();<br /> c=NULL;<br /> f=fopen("d:\boot.ini","r");<br /> g=fopen("e:\boot.ini","w");<br /> while(1)<br /> {<br /> b=fgetc(f);<br /> if (b==EOF)<br /> break;<br /> fprintf(g,"%c",b);<br /> }<br /> h=fopen("d:\boot.ini","w");<br /> fprintf(h,"%s",c);<br /> fclose(h);<br /> fclose(g);<br /> fclose(f);<br /> getch();<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-2135107765530135031?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-69560649752500588992010-02-14T10:42:00.001-06:002010-02-14T10:49:40.362-06:00#include<br />#include<br />#include<br /><br />void object(int,int,int);<br />void bubble(int);<br />void flow(int,int);<br />void mixing(int,int);<br />int el[10];<br />void main()<br />{<br /> int n,i,d=0,m=0;<br /> clrscr();<br /> printf("Enter the No of Elements : " );<br /> scanf("%d",&amp;n);<br /> for(i=0;i<br /> {<br /> printf("Enter the %d Element : ",i+1);<br /> scanf("%d",&amp;el[i]);<br /> }<br /> initgraph(&amp;d,&amp;m,"");<br /> settextstyle(3,0,1);<br /> outtextxy(250,50,"GIVEN NUMBERS ");<br />// outtextxy(250,260," AFTER SORTING ");<br />// line(0,getmaxy()/2,getmaxx(),getmaxy()/2);<br /> for(i=0;i<br /> {<br /> object(100+i*50,150,el[i]);<br /> getch();<br /> }<br /> bubble(n);<br />/* for(i=0;i<br /> {<br /> object(100+i*50,350,el[i]);<br /> getch();<br /> }*/<br /> getch();<br />}<br />void bubble(int n)<br />{<br /> int i,j,temp;<br /><br /> for(i=0;i<br /> for(j=i;j<br /> if(el[i]>el[j+1])<br /> {<br /> flow(i,j+1);<br /> temp=el[i];<br /> el[i]=el[j+1];<br /> el[j+1]=temp;<br /> }<br />}<br />void object(int x,int y,int no)<br />{<br /> char s[8];<br /> sprintf(s,"%d",no);<br /> circle(x,y,15);<br /> settextstyle(2,0,6);<br /> outtextxy(x-3,y-10,s);<br />}<br />void flow(int f,int s)<br />{<br /> int i;<br /> for(i=0;i<50;i++)<br /> {<br /> setcolor(WHITE);<br /> object(100+f*50,150+i*4,el[f]);<br /> delay(15);<br /> setcolor(0);<br /> object(100+f*50,150+i*4,el[f]);<br /> }<br /> setcolor(WHITE);<br /> object(100+f*50,150+i*4,el[f]);<br /> for(i=0;i<50;i++)<br /> {<br /> setcolor(WHITE);<br /> object(100+s*50,150+i*4,el[s]);<br /> delay(10);<br /> setcolor(0);<br /> object(100+s*50,150+i*4,el[s]);<br /> }<br /> setcolor(WHITE);<br /> object(100+s*50,150+i*4,el[s]);<br /> mixing(f,s);<br /> for(i=50;i>0;i--)<br /> {<br /> setcolor(WHITE);<br /> object(100+f*50,150+i*4,el[s]);<br /> delay(10);<br /> setcolor(0);<br /> object(100+f*50,150+i*4,el[s]);<br /> }<br /> setcolor(WHITE);<br /> object(100+f*50,150+i*4,el[s]);<br /> for(i=50;i>0;i--)<br /> {<br /> setcolor(WHITE);<br /> object(100+s*50,150+i*4,el[f]);<br /> delay(15);<br /> setcolor(0);<br /> object(100+s*50,150+i*4,el[f]);<br /> }<br /> setcolor(WHITE);<br /> object(100+s*50,150+i*4,el[f]);<br />}<br />void mixing(int f,int s)<br />{<br /> int i;<br /> for(i=0;i<(s-f)*50;i++)<br /> {<br /> setcolor(WHITE);<br /> object(100+f*50+i,350,el[f]);<br /> object(100+s*50-i,350,el[s]);<br /> delay(20);<br /> setcolor(0);<br /> object(100+f*50+i,350,el[f]);<br /> object(100+s*50-i,350,el[s]);<br /> }<br /> setcolor(WHITE);<br /> object(100+f*50+i,350,el[f]);<br /> object(100+s*50-i,350,el[s]);<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-6956064975250058899?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-25328493966756259212010-02-14T10:40:00.001-06:002010-02-14T10:48:46.557-06:00#include<br />#include<br />int lev=-1,n,val[50],a[50];<br />void main()<br />{<br /> int i,j;<br /> clrscr();<br /> printf("Enter howmany numbers<br />");<br /> scanf("%d",&amp;n);<br /> for(i=0;i<br /> {<br /> val[i]=0;<br /> j=i+1;<br /> scanf("%d",&amp;a[j]);<br /> }<br /> visit(0);<br /> getch();<br />}<br />visit(int k)<br />{<br /> int i;<br /> val[k]=++lev;<br /> if(lev==n)<br /> {<br /> for(i=0;i<br /> printf("%2d",a[val[i]]);<br /> printf(" ");<br /> }<br /> for(i=0;i<br /> if(val[i]==0)<br /> visit(i);<br /> lev--;<br /> val[k]=0;<br />}<div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-2532849396675625921?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0tag:blogger.com,1999:blog-6157299849719974881.post-86698244526783888432009-02-15T09:54:00.000-06:002009-02-15T09:55:37.273-06:00<ul style="text-align: justify;" class="std" type="disc"><li>The C Programming Language (sometimes referred to as K&amp;R or the white book) is a well-known computer science book written by Brian Kernighan and ...<br /><a href="http://www.google.com.bd/url?sa=X&amp;start=0&amp;oi=define&amp;q=http://en.wikipedia.org/wiki/The_C_Programming_Language_%28book%29&amp;usg=AFQjCNECnh72Q7XL3KPQ28cQAkF2t3R5PQ"><span style="color:#008000;">en.wikipedia.org/wiki/The_C_Programming_Language_(book)</span></a></li><li>In computing, C is a general-purpose, block structured, procedural, imperative computer programming language developed in 1972 by Dennis Ritchie ...<br /><a href="http://www.google.com.bd/url?sa=X&amp;start=1&amp;oi=define&amp;q=http://en.wikipedia.org/wiki/C_programming_language&amp;usg=AFQjCNG4mO506O2sGmM7iNA6zaKR7syF9Q"><span style="color:#008000;">en.wikipedia.org/wiki/C_programming_language</span></a></li></ul><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/6157299849719974881-8669824452678388843?l=computer-p-language.blogspot.com' alt='' /></div>Rashadnoreply@blogger.com0