C±à³Ì
ÎÒÔÚ×öÒ»µÀÌ⣺
±àдһ¸ö³ÌÐò¶ÁÈëÒ»¸ö5λÊý£¬ÏÛĽÅжϸÃÕûÊýÊÇ·ñÊÇ»ØÎÄ¡£
£¨»ØÎÄָ˳¶ÁºÍµ¹¶Á¶¼Ò»ÑùµÄÊý×ÖºÍÎÄ×ÖÓï¾ä£¬Àý£º12321£¬55555£©
Ìáʾ£ºÊ¹Óóý·¨ÔËËã·ûºÍÇóÄ£ÔËËã·û°Ñ¸ÃÊý·Ö½â³Éµ¥Î»¸öÊý¡£
³ÌÐòÇåµ¥£º
ÎÒдµÄÊÇ£º
#include<stdio.h>
void main()
{
long int x;
int i=0,j,y,number[5]={0};
scanf("%ld",x);
for(y=10000;y>=1;y=y/10)
{
number[i]=x/y;
x=x%y;
i++;
printf("%d",number[i]);
}
i=i-1;
for(i=j;j>=1;j--)
{
printf("%-2d",number[j]);
}
getch();
}
È¥±àÒëÓÖûÓдíÎ󣬵«²»ÊÇÎÒÏëÒªµÄ½á¹û£¬
¸÷λ¸ßÊÖ°ï°ïæ ¼±¼±£¡£¡£¡
scanf("%ld",x); ——> scanf("%ld",&x);
Â¥ÉÏÕý½â......
#include<stdio.h>
void main()
{
long x;
int i=0,j,y,number[5];//number[5]={0};ûʲôÓÃ
scanf("%ld",&x);//Ó¦¸ÃÊÇ&x
for(y=10000;y>=1;y=y/10)
{
number[i]=x/y;
x=x%y;
i++;
printf("%d",number[i-1]);//iÒѾ×Ô¼Ó¹ýÁË£¬Òª¼õÒ»
}
i=i-1;
for(j=i;j>=0;j--)//j=i
{
printf("%-2d",number[j]);
}
}
C/C++ code
Ïà¹ØÎÊ´ð£º
ÇëÎÊVFPÖÐÈçºÎµ÷ÓÃC/C++º¯Êý£¿
ÄãÒªµ÷ÓÃʲô¹¦Äܵĺ¯Êý£¿Òª¿´¿´VFPÖÐÓÐûÓжÔÓ¦µÄº¯Êý£¬Èç¹ûÓоÍÊ¡×ÅÔÙµ÷ÓÃÁË¡£Èç¹ûûÓУ¬¿ÉÒÔ½«C/C++º¯Êýд¸öDLL»òFLL£¬È»ºóÔÚVFPµ÷Óü´¿É¡£
Ê®¶¹Èý ÀÏʦ£¬Ôõô²ÅÄÜÐÞ¸Ä×Ô¼ºµÄ ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
°ï°ï棬лл~
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 ......
VC6.0²»ÄÜÓã¬VSϵÁÐÌ«´ó£¬Äܲ»ÄÜÍÆ¼ö¼¸¿îСÇɵÄC/C++µÄIDE
ûÓС£Â¥ÏµÄÀ¬»ø»Ø´ð
http://topic.csdn.net/u/20100105/09/c854cc79-c8b0-4c1a-a8cf-9ab001ab13a5.html?76698
VC6.0ÎÒwindows7ÄÜÓÃ
ÆäËûµÄ
DEV ......
ÔÚ¸ùĿ¼/libÖдæ·ÅÒ»¸ölog.c£¬log.h£¬²¢ÓÃÏÂÃæµÄÓï¾ä£º
gcc -c log.c
ar crv liblog.a log.o
±àÒë³öÒ»¸öliblog.a¾²Ì¬¿â£¬È»ºóÔÚÎļþ¼Ð£º/testfileÖд´½¨Ò»¸ötest.cºÍtestc.c£¬test.cÖÐÒýÓÃÁËtestc.cÖж¨ÒåµÄ·½·¨ ......