°Ña,b,c°´ÕÕ´óС˳ÐòÊä³ö
#include<stdio.h>
int max(int x,int y)
{
int z;
z=(x>y)?x:y;
return (z);
}
void main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf("%d %d %d",a,b,c);
}
ÈçºÎµ÷ÓÃMAXº¯ÊýʵÏÖÄ¿µÄ °Ña,b,c°´ÕÕ´óС˳ÐòÊä³ö
ÄÜʹÓÃбäÁ¿Âð£¿
ºÃÄѰ¡
C/C++ code:
#include <stdio.h>
int max(int x,int y)
{
int z;
z=(x>y)?x:y;
return (z);
}
void main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
/*----------------Start-----------------*/
/* a×î´ó */
if (max(max(a, b), c) == a)
{
/* ±È½ÏbºÍc */
if (max(b, c) == c)
{
c^=b;
b^=c;
c^=b;
}
}
/* b×î´ó */
else if (max(max(a, b), c) == b)
{
/* ½»»»aºÍb */
a^=b;
b^=a;
a^=b;
/* ±È½ÏbºÍc */
if (max(b, c) == c)
{
c^=b;
b^=c;
c^=b;
}
}
/* c×î´ó */
else
{
/* ½»»»aºÍc */
a^=c;
c^=a;
a^=c;
/* ±È½ÏbºÍc */
if (max(b, c) == c)
{
c^=b;
b^=c;
c^=b;
}
}
/*-------------
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏÂ
struct hostent *hp;
char AlarmDevIP[20];
int x2;
hp = gethostbyname("www.google.com");
if (hp)
{
......
ÎÒֻѧ¹ýÇ廪À¶·âÃæµÄCÓïÑÔ»ù´¡£¬Ïë¸üÉîÈëµÄѧϰ£¬¸Ã¿´Ê²Ã´ÊéºÃ£¿
C Primer Plus
C³ÌÐòÉè¼ÆÓïÑÔ(µÚ2°æÐ°æ)
CÓïÑÔ³ÌÐòÉè¼Æ_ÏÖ´ú·½·¨
CÓïÑԲο¼ÊÖ²áµÚÎå°æ
CÓïÑÔ´óÈ«
CºÍÖ¸Õë
CÏÝÚåÓëȱÏÝ
Cר¼Ò±à³Ì
......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏò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 ......