C¼òµ¥Ð¡ÎÊÌ⣬¸ßÊÖÃÇ£¡°ï°ïÎÒ
ÎÒд¸ö³ÌÐò£¬ÇóµÄÊÇ3λÊý£¬Ã¿Ò»Î»Á¢·½¼ÓÆðÀ´ÊÇÄǸöÊý£¬±ÈÈ磬153£¬1^3+3^3+5^3=153,ÒªÇóÇó³öËùÓÐ3λÊýÖÐÓÐÄÇЩ£¿
ÎҵĴúÂëÊÇ
#include<stdio.h>
void main()
{
int a,b,c;
for(a=1;a<10;a++)
for(b=0;b<10;b++)
for(c=0;b<10;c++)
if((a*100+b*10+c)==(a*a+b*b+c*c))
printf("%d\n",a*100+b*10+c);
}
Èç¹û±¨´í¾ÍºÃÁË£¬µ«ÊÇ£¬±àÒëµÄʱºòûÓдíÎóÏÔʾ£¬µ«ÊÇÎÒÔËÐкó£¬Êä³öÖУ¬¾ÓȻʲôҲûÓУ¬Á¬ÌáʾÎÒ°´ÈÎÒâ¼ü·µ»ØµÄÌáʾ¶¼Ã»ÓУ¬Õâ ÊÇÔõô¸ãµÄ£¬ÎªÊ²Ã´°¡£¿»¹Óи÷λ´óÏÀ£¬ËÄܸæËßÎÒÔõôµ÷ÊÔ°¡£¬ÎÒʲô¶¼²»»á°¡£¡
ËÀÑ»·ÁË£¬µÚÈý¸öforÑ»·for(c=0;b<10;c++)¸ÄΪfor(c=0;c<10;c++).
ÕâÖÖÎÊÌ⣬°Ñ³ÌÐò½á¹¹Ð´ÇåÎú¾ÍºÃ·¢ÏÖÁË
if((a*100+b*10+c)==(a*a+b*b+c*c)) //ÄãËãµÃÊÇÁ¢·½£¬ÕâÀïÊÇÆ½·½
Ó¦¸Ã¸ÄΪ£º
if((a*100+b*10+c)==(a*a*a+b*b*b+c*c*c))
if((a*100+b*10+c)==(a*a+b*b+c*c))¸ÄΪ
if((a*100+b*10+c)==(a*a*a+b*b*b+c*c*c))
»¹ÓеÚÈý¸öÑ»·Ó¦¸Ã°Ñ°Éb<10¸ÄΪc<10
ÍêÕû°æ£º
C/C++ code:
#include<stdio.h>
void main()
{
int a,b,c;
for(a=1;a<10;a++)
for(b=0;b<10;b++)
for(c=0;c<10;c++)
if((a*100+b*10+c)==(a*a*a+b*b*b+c*c*c))
printf("%d\n",a*100+b*10+c);
}
ºÇºÇ£¬Ã»¹ýϸ¿´£¬¶àл°¡£¡ÒÔºóÒ»¶¨×¢Ò⣬С´íÎóº¦ËÀÈË£¡
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏÂ
struct hostent *hp;
char AlarmDevIP[20];
int x2;
hp = gethostbyname("www.google.com");
if (hp)
{
......
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö
µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡
ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î
http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
¸÷λ´óÏÀ£º
ÓÐûÓÐÖªµÀÈçºÎÔÚCÓïÑÔÖÐʹÓóÖÐø¼¯³É¡£´Ó³õ²½µÄµ÷²éÀ´¿´£¬Ã²ËÆÊ¹ÓÃCruiseControlµÄÈ˺ܶ࣬µ«ÊǸÿªÔ´¹¤¾ß¶ÔCÓïÑÔµÄÖ§³ÖÃ²ËÆºÜÓÐÏÞ£¬±àÒëºÍ²âÊÔ½á¹û¿ÉÄÜÐèÒª×Ô¼º´¦Àí£¬Éú³ÉCruiseControlÄܹ»´¦ÀíµÄXMLÎ ......
°ï°ï棬лл~
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 ......
ÔÚ¸ùĿ¼/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Öж¨ÒåµÄ·½·¨ ......