º¯Êý·µ»ØÖµÎªdoubleÀàÐÍ¡£
debugµÄʱºò£¬ÔÚº¯ÊýÀïÃæreturnµÄresult»¹ÊÇ239750.00000000003
¿ÉÊdzöÁ˺¯ÊýÖ®ºó·µ»ØÖµ¾ÍÊÇ-1.#IND000000000000
Ôõô»ØÊ°¡¡£¡£
ллÁ˰¡
¿´¹þ´úÂ룬¿ÉÒÔ·ÖÎö¡£¡£¡£
û´úÂëÃ»ÕæÏ࣡
.
ÇëÂ¥Ö÷Ö±½ÓÉÏ´úÂë
ÎÞ´úÂëÎÞÕæÏà
double doubleTransfer( char charNumber[]) /*½«¶ÁÈ¡µÄÓÃ×Ö·û´®±íʾµÄ¸¡µãÊýת»¯ÎªÕæÕýµÄ¸¡µãÊý*/
{
char temC;
double result;
double decimal1=0;
int index1=0;
int integer1=0;
int i, j, k2, k3, k5, len, m, n, num, t, k4;
double k6;
int integer[10];
int decimal[10];
int index[10];
len= strlen(charNumber);
j = 1, m=1 ,k2=-1,k3=len, k4=len;
if( charNumber[0] == '-')
j = -1;
for(i=0; i <len; i++)
{
temC=charNumber[i];
if(temC == 'E' )
{
k2=1;
k4=i;
}
}
for(i=0; i <10; i++)
{
decimal[i]=0;
index[i]=0;
integer[i]=0;
}
for(i=0;i <len;i++)
{
temC=charNumber[i];
if(temC == '.' )
k3=i;
}
for(i=k3+1; i <k4; i++)
decimal[i-k3-1]=charNumber[i] - '0';
Ïà¹ØÎÊ´ð£º
ÇëÎÊVFPÖÐÈçºÎµ÷ÓÃC/C++º¯Êý£¿
ÄãÒªµ÷ÓÃʲô¹¦Äܵĺ¯Êý£¿Òª¿´¿´VFPÖÐÓÐûÓжÔÓ¦µÄº¯Êý£¬Èç¹ûÓоÍÊ¡×ÅÔÙµ÷ÓÃÁË¡£Èç¹ûûÓУ¬¿ÉÒÔ½«C/C++º¯Êýд¸öDLL»òFLL£¬È»ºóÔÚVFPµ÷Óü´¿É¡£
Ê®¶¹Èý ÀÏʦ£¬Ôõô²ÅÄÜÐÞ¸Ä×Ô¼ºµÄ ......
±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
ÓÐÒ»10*10¾ØÕ󣬳ýÈ¥µÚÒ»¸öµã£¨0£¬0£©ºÍ×îºóÒ»µã£¨9£¬9£©£¬»¹Óа˸öµãΪ1£¬ÆäËû¶¼Îª0£¬ÒªÇóÓöþάÊý×é±íʾ¡£°Ë¸öµãÊÇËæ»úÉú³ÉµÄ£¬±àдÏà¹Ø³ÌÐò±íʾ¾ØÕóËùÓпÉÄÜÇé¿ö¡£
ÕæÐÄÇó½Ì¸÷λ¸ßÊÖ£¬°¥£¡±¾ÈËÌ«²ËÁË£¡ºÇºÇ£¡
......
°ï°ï棬лл~
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 ......