¸Õѧc£¬Õâ¸öµØ·½¿´²»¶®ÎªÊ²Ã´£¬Çë´ó¼Ò½âÊÍÏÂ
float f;
double d=123.456789e100;
f=d;
½«Ò»¸ödoubleÐÍÊý¾Ý¸³¸øfloat±äÁ¿Ê±£¬½ØÈ¡ÆäǰÆßλÓÐЧÊý×Ö£¬´æ·Åµ½float±äÁ¿µÄ´æ´¢µ¥Ôª£¨4¸ö×Ö½Ú£©ÖУ¬µ«Ó¦×¢ÒâÊýÖµ·¶Î§²»³¬³öfloatÐÍÊý¾ÝµÄ·¶Î§£¬Õâʱ¾Í»á³öÏÖ´íÎó¡£
Õâ¸ödoubleÐÍÊý¾ÝǰÆßλÓÐЧÊý×ÖÊÇ12345.67ûÓг¬¹ýfloatÐÍÊý¾ÝµÄ·¶Î§£¨-3.4e-38µ½3.4e38£©°¡£¿£¿£¿£¿
e100 Õ⻹û³¬¹ýÂð¡£²»ÊǰÉ
Ŷ£¬°¡£¡Ã»¿´Ç壬àÅ£¬ÖªµÀÁË£¬ºÙºÙ
123.456789e100ûÓп´³ÉÒ»¸öÕûÌå°É¡£
´ó²¿·ÖÊDz»»á³¬µÄ£¬Ö»ÊÇÊýÖµµÄ¾«¶È»á¸Ä±ä
»¹Òª¿´ÄãµÄ±àÒë»·¾³£¬ÓеÄfloatÊÇ·ÖÅä2×Ö½Ú£¬32λµÄ±àÒëÆ÷ÊÇ·ÖÅä4×Ö½Ú£¬Ã÷ÏԵõ½µÄ¾«¶ÈÊDz»Ò»ÑùµÄ
Õâ¸öÎÊÌâûÓг¬¹ý¾ÍºÃÁË¡£¡£¡£¡£ºÇºÇ
floatÀàÐÍ¿ÉÒÔ¸³¸ødouble,double²»Äܸ³¸øfloat
C/C++ code:
#include<stdio.h>
int main()
{
float f;
double d=123.456789e100;
f=d;
printf("%lf\n",f);
system("pause");
return 0;
}
ÕâÑù¿´À´²»ÐУ¬Õâ¶Î´úÂë¾ÍÊǸö²âÊÔÁË£¬³öÀ´µÄÊÇһЩÂÒÂë
Microsoft Visual C++ recognizes the types shown in the table below
float 4 3.4E +/- 38 (7 digits)
double 8 1.7E +/- 308 (15 digits)
ÖÁÉÙÔÚVCÖÐ123.456789e100¿Ï¶¨³¬³öfloat·¶Î§ÁË¡£
Ê×ÏÈdoubleÕ¼8×Ö½Ú£¬floatÕ¼4×Ö½Ú£¬double±íʾ·¶Î§Ô¼Îª1.7E +/- 308 (15 digits)£¬float±íʾ·¶Î§Ô¼Îª3.4E +/- 38 (7 digits)¡£
¸¡µãÊýÊǷǾ«È·´æ´¢ÐÎʽ£¬Ä㽫d¸³Öµºó£¬ËûµÄ¿ÕÓàСÊýλ¿É²»ÊÇ0£¬¶øÊÇ1.2345678900000001e+102£¬³¬³öÁËfloatµÄ±íʾ·¶Î
Ïà¹ØÎÊ´ð£º
±àÒëÆ÷£ºC-Free4
mysql µ¥¶À°²×°µÄ£¬ÏÖÔÚΪapache+php+mysql¿ÉÒÔʹÓá£
×î½üÔÚÁ·Ï°c£¬c++£»ÏëÓÃc£¬c++Á¬½ÓÏÂÎÒµÄmysql£¬ºÃ¶àµØ·½¶à˵mysql.hÕÒ²»µ½¡£¶øÇÒÎÒmysqlûÓÐËùνµÄincludeÎļþ¼Ð°¡¡£
Íü¸ßÊÖÖ¸µãÒ»¶ ......
ÇëÎÊVFPÖÐÈçºÎµ÷ÓÃC/C++º¯Êý£¿
ÄãÒªµ÷ÓÃʲô¹¦Äܵĺ¯Êý£¿Òª¿´¿´VFPÖÐÓÐûÓжÔÓ¦µÄº¯Êý£¬Èç¹ûÓоÍÊ¡×ÅÔÙµ÷ÓÃÁË¡£Èç¹ûûÓУ¬¿ÉÒÔ½«C/C++º¯Êýд¸öDLL»òFLL£¬È»ºóÔÚVFPµ÷Óü´¿É¡£
Ê®¶¹Èý ÀÏʦ£¬Ôõô²ÅÄÜÐÞ¸Ä×Ô¼ºµÄ ......
±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......
ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩ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 ......