ÓÃC±àдָ¶¨¾ùÖµ·½²îµÄ¸ß˹ÔëÉù - C/C++ / CÓïÑÔ
¸øÒÑ֪ͼÏñÌí¼Ó¸ß˹ÔëÉù£¬ÇëÎʸß˹ÔëÉùÊÇÔõôʵÏֵģ¿¾ùÖµ·½²î·Ö±ðΪu£¬v¡£
½²Ò»ÏÂ˼·ҲÐа¡¡£¡£¡£¡£¡£¡£ csdn ¸ßÊÖÔÆ¼¯µÄµØ·½¡£¡£¡£¡£¡£¡£ http://zhidao.baidu.com/question/71224083.html 2Â¥¸øµÄÊÇÒ»¸öµäÐ͵ĴíÎó´ð°¸¡£ y = sqrt(-2 * ln((float)rand()/RAND_MAX)) cos(2 * pi * (float)rand()/RAND_MAX)ÒýÓà 2Â¥¸øµÄÊÇÒ»¸öµäÐ͵ĴíÎó´ð°¸¡£ y = sqrt(-2 * ln((float)rand()/RAND_MAX)) cos(2 * pi * (float)rand()/RAND_MAX) Ö¸¶¨¾ùÖµºÍ·½²î¡£¡£¡£ ûÈ˻ᰡ¡£¡£¡£¡£¡£¡£ÒýÓà ÒýÓà 3 Â¥ twistmost µÄ»Ø¸´: 2Â¥¸øµÄÊÇÒ»¸öµäÐ͵ĴíÎó´ð°¸¡£ y = sqrt(-2 * ln((float)rand()/RAND_MAX)) cos(2 * pi * (float)rand()/RAND_MAX) Ö¸¶¨¾ùÖµºÍ·½²î¡£¡£¡£ (y + u) * sqrt(v)
Ïà¹ØÎÊ´ð£º
QQȺ 29152388 ÓÑÇéUP °ï¶¥ up °ïup up Ö§³Ö£¡ up jf ...ÄѵÀÓзÖ..? up up up Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£ Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ ¼ÓÁË¡£ ¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......
дÁ˸ö²âÊÔ³ÌÐòÈçÏ struct hostent *hp; char AlarmDevIP[20]; int x2; hp = gethostbyname("www.google.com"); if (hp) {
......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿ ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡ ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð» mktime ......
°ï°ï棬лл~ 1. Write a program to perform a topological sort on a graph. 2. Write a program to solve the single‐source shortest‐path problem (Dijkstra algorithm). 3. Write a program ......