Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

C ±à³Ì

±àдһ¸ö³ÌÐò£¬Äܹ»ÕÒ³ö¼¸¸öÕûÊýÖÐ×îСµÄÕûÊý¡£¼Ù¶¨³ÌÐò¶ÁÈ¡µÄµÚÒ»¸öÖµÊÇÓàÏÂÊýÖµµÄÊýÄ¿¡£
³ÌÐòÇåµ¥£º
C/C++ code:

#include<stdio.h>
#include<math.h>
/*
±àдһ¸ö³ÌÐò£¬Äܹ»ÕÒ³ö¼¸¸öÕûÊýÖÐ×îСµÄÕûÊý¡£¼Ù¶¨³ÌÐò¶ÁÈ¡µÄµÚÒ»¸öÖµÊÇÓàÏÂÊýÖµµÄÊýÄ¿¡£
*/
int main()
{
int n, elem;
int min=pow(2, sizeof(int)*8-1)-1;
scanf("%d", &n); /*ÊäÈëµÄµÚÒ»¸öÊýΪÓàÏÂÊýÖµµÄÊýÄ¿*/
while(n > 0) {
scanf("%d", &elem);
if(min > elem) {
min = elem;
}
n--;
}
printf("min=%d\n", min);
return 0;
}



C/C++ code:
#include <stdio.h>


int findMin(void)
{
int count;
scanf("%d",&count);
int temp=0;
int min=0;
bool fisrt=true;
while(count>0)
{

scanf("%d",&temp);
if(temp<=min||fisrt)
min=temp;
fisrt=false;
count--;
}
return min;
}

int main()
{
int min=findMin();
printf("%d",min);
return 0;
}

















lzÏë˵ʲô£¿

Â¥Ö÷Ïë¸ÉÂï¡·£¿
ÏëÎÊÎÊÌ⻹ÊÇÏëչʾ´úÂë

ÄãÏë¸ÉÂ~~~

²Å¼¸¾ä»°µÄÊ£¬Õâ¸öÂ


Ïà¹ØÎÊ´ð£º

ѧϰÌÖÂÛ C/C++ QQȺ - C/C++ / ·Ç¼¼ÊõÇø

QQȺ 29152388
ÓÑÇéUP

°ï¶¥

up

°ïup

up Ö§³Ö£¡

up jf

...ÄѵÀÓзÖ..?

up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£

Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ

¼ÓÁË¡£

¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......

¸ß·ÖÇó!×îºÃÊÇC/C++ - C/C++ / CÓïÑÔ

·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ


ѧϰ£¬¿´¿´

¼ÌÐø¶¥Å¶

ѧϰÁË¡£

go o ......

C/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý - C/C++ / C++ ÓïÑÔ

´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
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 ......

c¾²Ì¬±àÒëÁíÒ»¸öÎļþ¼ÐµÄ¿âº¯Êý - C/C++ / CÓïÑÔ

ÔÚ¸ùĿ¼/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Öж¨ÒåµÄ·½·¨ ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ