入门经典习题
PrConstantin
BLOG: http://constantin.cc
GITHUB: https://github.com/uselessaddress
展开
-
(解题报告)入门经典2版———第三章习题1
此题原题是uva上的,没按照原题的格式,水题,直接上代码了!#include <stdio.h> #include <string.h> #define N 81 int main () { int i,j,a[N],sum=0,l; char s[N]; memset(a,0,sizeof(a)); scanf("%s",s); if(s[0]=='o')原创 2015-11-23 00:53:54 · 319 阅读 · 0 评论 -
(解题报告)HDU2020---绝对值排序
绝对值排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 59400 Accepted Submission(s): 28528Problem Description 输入n(n<=100)个整数,按照绝对值从大到小排序后输出。题原创 2015-12-10 01:01:37 · 2713 阅读 · 0 评论 -
(解题报告)Uva-1225 --- Digit Counting
Digit Counting Trung is bored with his mathematics homeworks. He takes a piece of chalk and starts writing a sequence of consecutive integers starting with 1 to N (1 < N < 10000) . After that, he coun原创 2015-11-29 19:49:27 · 619 阅读 · 0 评论