2006---2009Ä꺼µç¼ÆËã»úÀúÄêÑо¿Éú¸´ÊÔ---±ÊÊÔ±à³Ì
·ÖÀࣺ C/C++ Êý¾Ý½á¹¹2011-08-07 15:52 5483ÈËÔĶÁ ÆÀÂÛ(0) ÊÕ²Ø ¾Ù±¨ º¼µç¼ÆËã»ú¸´ÊÔ 1¡¢ÊäÈëÒ»¸öÊ®½øÖƵÄÊý£¬°ÑËüת³É°Ë½øÖÆ¡£ÀàËÆµÄ°ÑÊ®½øÖÆ×ª³É16½øÖÆ£¬°ÑÊ®Áù½øÖÆ×ª±äΪʮ½øÖƵȡ£
[cpp] view plaincopy
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23.
×ªÔØÇë±êÃ÷³ö´¦£¬ÔÎĵØÖ·£º
http://blog.csdn.net/hackbuteer1/article/details/6667026
#include
int main(void) {
int num, a[100], i, j; i = 0;
scanf(\ , &num); while(num != 0) {
a[i++] = num % 8; num /= 8; }
if(i == 0) printf(\); else {
for(j = i - 1; j >= 0; --j) printf(\, a[j]); printf(\); } return 0; }
2¡¢ÊäÈëÁ½¸ö·Ç³£´óµÄÕûÊý£¨ÍêÈ«³¬³öÁËint¡¢longµÄ±íʾ·¶Î§£©£¬Õâ
¸öÕûÊýµÄ³¤¶È¿ÉÄܳ¬¹ý100룬¼ÆËã²¢Êä³öÕâÁ½¸öÊýÏà¼ÓµÄ½á¹û¡££¨HDU acm 1002 ÓÃstring´¦Àí±È½ÏºÃ£©
[cpp] view plaincopy
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36.
×ªÔØÇë±êÃ÷³ö´¦£¬ÔÎĵØÖ·£º
http://blog.csdn.net/hackbuteer1/article/details/6667026
#include
int main(void) {
int temp, i, j, k, len1, len2, m, sum[1010]; char a[1010], b[1010], c[1010];
scanf(\, a, b); len1 = strlen(a); len2 = strlen(b);
if(len1 < len2) //½»»»Á½¸ö×Ö·û´®£¬È·±£µÚÒ»¸ö×Ö·û´®µÄ³¤¶È²»Ð¡ÓÚµÚ¶þ¸ö×Ö·û´® {
strcpy(c, b); strcpy(b, a); strcpy(a, c);
m = len2, len2 = len1, len1 = m; }
k = m = 0;
//´ÓÁ½¸öÊýµÄµÍλ¿ªÊ¼£¬ÊÖ¹¤Ä£Äâ¼Ó·¨£¬ÖðλÏà¼Ó
for(i = len1 - 1, j = len2 - 1; i >= 0; --i, --j) {
if(j >= 0)
temp = a[i] - '0' + b[j] - '0' + m; else
temp = a[i] - '0' + m; sum[k++] = temp % 10; m = temp / 10; //½øÎ» } if(m > 0)
printf(\, m); for(i = k - 1; i >= 0; --i) printf(\, sum[i]); printf(\); return 0;
37.
}
3¡¢¡°»ØÎÄ´®¡±ÊÇÒ»¸öÕý¶ÁºÍ·´¶Á¶¼Ò»ÑùµÄ×Ö·û´®£¬±ÈÈç¡°level¡±»òÕß¡°noon¡±µÈµÈ¾ÍÊÇ»ØÎÄ´®¡£Çëдһ¸ö³ÌÐòÅж϶ÁÈëµÄ×Ö·û´®ÊÇ·ñÊÇ¡°»ØÎÄ¡±¡£
[cpp] view plaincopy
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22.
×ªÔØÇë±êÃ÷³ö´¦£¬ÔÎĵØÖ·£º
http://blog.csdn.net/hackbuteer1/article/details/6667026
#include
int main(void) {
char str[100]; int len, i, j;
scanf(\, &str); len = strlen(str);
for(i = 0, j = len - 1; i < len && j >= i; ++i, --j) {
if(str[i] != str[j]) break; } if(j < i)
printf(\Õâ¸ö×Ö·û´®ÊÇ»ØÎÄ´®£¡\\n\); else
printf(\Õâ¸ö×Ö·û´®²»ÊÇ»ØÎÄ´®£¡\\n\); return 0; }
4¡¢ÊäÈën¸öÊý£¬°´´ÓСµ½´ó½øÐÐÅÅÐò²¢Êä³ö¡£
[cpp] view plaincopy
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19.
×ªÔØÇë±êÃ÷³ö´¦£¬ÔÎĵØÖ·£º
http://blog.csdn.net/hackbuteer1/article/details/6667026
#include
int main(void) {
int n, i;
scanf(\, &n); int *p = new int[n]; for(i = 0; i < n; ++i) scanf(\, &p[i]); sort(p, p + n); for(i = 0; i < n; ++i) printf(\, p[i]); printf(\); return 0; }
5¡¢ÊäÈëÒ»¸ö³¤ÕûÐ͵ÄÊý£¬´ÓµÍλÆðÈ¡³öÆæÊýλ×é³ÉÒ»¸öеÄÊýÊä³ö¡£
[cpp] view plaincopy
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16.
×ªÔØÇë±êÃ÷³ö´¦£¬ÔÎĵØÖ·£º
http://blog.csdn.net/hackbuteer1/article/details/6667026
#include
int main(void) {
long n, k, i, j, newnum; i = j = newnum = 0;
scanf(\, &n); while(n) {
k = n % 10;
for(j = 0; j < i; ++j) k *= 10; newnum += k; n /= 100;

