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Ïë˵ʲô£¿
Â¥Ö÷Ïë¸ÉÂï¡·£¿
ÏëÎÊÎÊÌ⻹ÊÇÏëչʾ´úÂë
ÄãÏë¸ÉÂ~~~
²Å¼¸¾ä»°µÄÊ£¬Õâ¸öÂ
Ïà¹ØÎÊ´ð£º
±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......
´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......
C/C++ code:
#include<stdio.h>
#define MAXN 26
char stack[MAXN];
int top=0;
int push(x);
int pop(p_y);
void main()
{
char mpush=3;
char *mpop;
*mpop=0;
// printf("%d\n ......