ACM_编程与调试重点记录（十七）.doc

14. HDOJ-NO.2010

#include"stdio.h" #include"math.h" int main() {     int m,n,i,count;     while (scanf("%d%d",&m,&n)!=EOF)     {         count=0;         for (i=m;i<=n;i++)         {             if (pow(i/100,3)+pow((i%100)/10,3)+pow(((i%100)%10),3)==i)             {                 printf("%d ",i);                 count++;             }         }         if (count==0) printf("no");         printf("/n");     } }

15. HDOJ-NO.2011

#include"stdio.h" int main() {     int m,n,i,flag;     double sum;     scanf("%d",&m);     while (m--)     {         scanf("%d",&n);         for (i=1,sum=0;i<=n;i++)         {             if (i%2==1) flag=1;             else flag=-1;             sum+=flag*1.0/i;         }         printf("%.2f/n",sum);     } }

16. HDOJ-NO.2012错在哪里？

#include"stdio.h" int sushu(int n) {     int i,result;     for (i=2;i<=sqrt(n);i++)     {         if (n%i==0) result=0;         break;     }     if (i>sqrt(n)) result=1;     return result; }   int main() {     int x,y,n,i,count;     while(scanf("%d%d",&x,&y)!=EOF&&(x||y))     {         for(i=x,count=0;i<=y;i++)         {             n=i*i+i+41;             count+=sushu(n);         }         if (count==y-x+1) puts("OK");         else puts("Sorry");     } }

17. HDOJ-NO.2013

#include"stdio.h" int main() {     int i,a[30],n;     while (scanf("%d", &n) != EOF)     {         for (i=n;i>=1;i--)         {             a[n]=1;             a[i-1]=a[i]*2+2;         }         printf("%d/n",a[1]);     } }

18. HDOJ-NO.2014

#include"stdio.h" int max(double a[],int n)//求最大值对应的下标 {     int i,result=0;     double M=a[0];     for (i=1;i<n;i++)         if (M<a[i])         {             M=a[i];             result=i;         }     return result; } int min(double a[],int n)//求最小值对应的下标 {     int i,result=0;     double m=a[0];     for (i=1;i<n;i++)         if (m>a[i])         {             m=a[i];             result=i;         }     return result; }   int main() {     int n,i;     double sum,a[100],average;     while (scanf("%d",&n)!=EOF)     {         sum=0;         for (i=0;i<n;i++)         {             scanf("%lf",&a[i]);             sum+=[微软用户1] a[i];         }         average=(sum-a[max(a,n)]-a[min(a,n)])/(n-2);         printf("%.2f/n",average);     } }

19. HDOJ-NO.2015

#include"stdio.h" int main() {     int num[100],i,j,m,n,k,sum;     while (scanf("%d%d",&n,&m)!=EOF)     {         for (i=0;i<n;i++)             num[i]=i*2+2;         k=(int)(n/m);         for (j=0;j<k;j++)         {             sum=0;             for (i=j*m;i<j*m+m;i++)                 sum+=num[i];             printf("%d ",sum/m);             for (i=j*m+m,sum=0;i<j*m+m+n%m;i++)             {                 sum+=num[i];                 printf("%d ",sum/(n%m));             }         }         puts("");     } }

20. HDOJ-NO.2016

#include"stdio.h" #include <algorithm> int min(double a[],int n)//求最小值对应的下标 {     int i,result=0;     double m=a[0];     for (i=1;i<n;i++)         if (m>a[i])         {             m=a[i];             result=i;         }     return result; }   int main() {     int n,i;     double a[100];     while (scanf("%d",&n)!=EOF&&n)     {         for (i=0;i<n;i++)             scanf("%lf",&a[i]);         swap(a[0],a[min(a,n)]);         for (i=0;i<n;i++)             printf("%.0f ",a[i]);         puts("");     } }

21. HDOJ-NO.2017

#include <stdio.h> int main(void) {     int count, i,n;     char str[80];     /* 输入字符串 */     scanf("%d%*c[微软用户2] ", &n);     while (n--)     {         i = 0;         while ((str[i] = getchar( )) != '/n')             i++;         str[i] = '/0';                    /* 将结束符 '/0' 存入数组 */           /*统计字符串中数字字符的个数*/         count = 0;         for (i = 0; str[i] != '/0'; i++)  /* 循环条件：数组元素 str[i] 不等于 '/0' */             if (str[i] <= '9' && str[i] >= '0')                 count++;         printf("%d/n", count);     }     return 0; }

#include"stdio.h" int main() {     char ch[1000];int n,i,count;     scanf("%d%*c",&n);     while (n--)     {         i=0;         while ((ch[i]=getchar())!='/n') i++;         ch[i]='/0';         for (i=0,count=0;ch[i]!='/0';i++)             if (ch[i]>'0'&&ch[i]<'9') count++;         printf("%d/n",count);     } }

22. HDOJ-NO.2019

#include "stdio.h" int main(int argc, char *argv[]) {     int m,n,a[101],i,j;     while (scanf("%d%d",&n,&m)!=EOF&&(n||m))     {         for (i=0;i<n ;i++ )             scanf("%d",&a[i]);         for (i=0;i<n ;i++ )             if (m<=a[i])             {                 for (j=i;j<=n ;j++ )                     a[i+1]=a[i];                 a[i]=m;             }         for (i=0;i<=n ;i++ )             printf("%d ",a[i]);         puts("");     }     return 0; }

23. HDOJ-NO.2018

24. HDOJ-NO.2020

#include "stdio.h" #include "algorithm" void sort(int a[],int n)//降序排序 {     int k,index,i;     for (k=0;k<n-1;k++)     {         index=k;         for (i=k+1;i<n;i++)             if (abs(a[i])>abs(a[index])) index=i;         swap(a[index],a[k]);     }     for (i=0;i<n;i++)         printf("%d ",a[i]);     puts(""); }   int main(int argc, char *argv[]) {     int m,n,a[100],i,j;     while (scanf("%d",&n)!=EOF&&n)     {         for (i=0;i<n;i++)             scanf("%d",&a[i]);         sort(a,n);     }     return 0; }

25. HDOJ-NO.2021

26. HDOJ-NO.2022

27. HDOJ-NO.2023

 

 

 

 

 

 

 

 

---

 [微软用户1]编程时不小心将+=敲成了=+，结果调试了近一个小时才发现问题！

 [微软用户2]这是什么呢？什么意思呢？