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

ÇóÖú£ºC³ÌÐòÉè¼Æ£¨Ì·ºÆÇ¿µÚ3°æ£©ÒëÃÜÂëµÄÎÊÌ⣡£¡£¡

³ÌÐòÈçÏ£º
#include<stdio.h>
void main()
{
char c;
while((c=getchar())!='\n')  
{
if((c>='A'&&c<='Z')||(c>='a'&&c<='z'))
{
c=c+4;
if(c>'Z'&&c<='Z'+4||c>'z')
c=c-26;
}
printf("%c",c);
}
  printf("\n");
}
µ«ÆäÖеÄwhile((c=getchar())!='\n') Õâ¾ä²»ÖªµÀʲôÒâ˼£¡
¼ÈÈ»cÊÇcharÐÍÊý¾Ý£¬ÎªÊ²Ã´»¹¿ÉÒÔͬʱÊäÈë¶à¸ö×ÖďĨ£¿Çëǰ±²Ö¸µã£¡
µ±ÄãÊäÈëµÄ²»Êǻسµ£¬Ñ­»·
'\n'ÊÇÒ»¸ö×Ö·û£¬±íʾ»Ø³µ

ÒýÓÃ
µ±ÄãÊäÈëµÄ²»Êǻسµ£¬Ñ­»·
'\n'ÊÇÒ»¸ö×Ö·û£¬±íʾ»Ø³µ


ллÄãµÄ»Ø¸´£¡ÎÒÏëÎÊÏ£ºµ«ÊÇgetchar£¨£©º¯Êýÿ´ÎÖ»ÄÜÊäÈëÒ»¸ö×Ö·û°¡£¿

ÊäÈëµÄʱºò£¬×Ö·ûÊ×Ïȱ»²Ù×÷ϵͳ·Åµ½¼üÅ̵Ļº³åÇøÖУ¬ÊäÈë»Ø³µºó£¬²Å·¢Ë͵½³ÌÐò¡£

ÒýÓÃ
ÒýÓà 1 Â¥ jbz001 µÄ»Ø¸´:
µ±ÄãÊäÈëµÄ²»Êǻسµ£¬Ñ­»·
'\n'ÊÇÒ»¸ö×Ö·û£¬±íʾ»Ø³µ


ллÄãµÄ»Ø¸´£¡ÎÒÏëÎÊÏ£ºµ«ÊÇgetchar£¨£©º¯Êýÿ´ÎÖ»ÄÜÊäÈëÒ»¸ö×Ö·û°¡£¿

¼òµ¥µÄ˵£¬Äã¿ÉÒÔÊäÈëºÜ¶à×Ö·û£¬È»ºó°´Ï»سµ¡£ÕâʱËäÈ»ÄãÊäÈëºÜ¶à×Ö·û£¬µ«getchar£¨£©Ã¿´ÎÖ»ÄÜ´¦ÀíÒ»¸ö×Ö·û¡£´¦ÀíÍêÁËÔÙ´¦ÀíÏÂÒ»¸ö¡£Ò»Ö±µ½Ñ­»·½áÊø£¬Ò²¾ÍÊÇ\n

ÒýÓÃ
ÊäÈëµÄʱºò£¬×Ö·ûÊ×Ïȱ»²Ù×÷ϵͳ·Åµ½¼üÅ̵Ļº³åÇøÖУ¬ÊäÈë»Ø³µºó£¬²Å·¢Ë͵½³ÌÐò¡£


¶àлָµã£¡ÎÒ´ó¸ÅÀí½âÁË£¬ÄãµÄÒâ˼ÊÇ£ºµ±ÄãÊäÈëÒ»¶Ñ×Ö·ûºó°´Ï»سµ¼ü£¬ÕâЩ×Ö·ûÁ¬Í¬»Ø³µ·ûÒ»Æ


Ïà¹ØÎÊ´ð£º

°ïæ¿´¿´Õ⼸¸ö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Ä£ÄâHTTPͨÐŵÄÎÊÌâ

ÇëÎÊC++ÀïµÄÓÃCInternetSession Ä£ÄâHTTP·¢ËÍÇëÇóºó£¬ ÈçºÎ»ñµÃ·þÎñÆ÷ÔÚä¯ÀÀÆ÷ÀïÏìÓ¦µÄURL´®°¡£¿ 
 
 
  ¾ÍÊÇ ·þÎñÆ÷»á·µ»ØÒ»¸ö Ò³Ãæ¸øÎÒÁË ¶ø´Ëʱä¯ÀÀÆ÷µÄURLµØÖ·Ò²¾ÍÏ൱ÊÇ·þÎñ ......

C½øÕ»³öջʱ³öÎÊÌâÁË£¡£¡£¡£¡ - C/C++ / CÓïÑÔ

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 ......

»ùÓÚTCPµÄ C/SµÄÁÄÌì³ÌÐòÎÊÌâ

ÎÒÏÖÔÚÏë×öÒ»¸ö»ùÓÚTCPµÄ C/SµÄÁÄÌì³ÌÐò£¬Ôõô²ÅÄÜʵÏÖÓû§ÐÅÏ¢µÄÈÏÖ¤µÇ¼£¬
socketͨÐŽ¨Á¢Á¬½Óǰ£¬ÏÈ·¢ËÍÓû§Ãû£¬ÃÜÂëµÈ£¬ÈÏÖ¤

Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄÜ·¢ËÍѽ

ÒýÓÃ
Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄ ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ