C++博客-哀伤の回忆 http://www.cppblog.com/SaynRain/那些回忆、来之不易╮挥之不去。zh-cnSun, 12 Apr 2026 09:35:34 GMTSun, 12 Apr 2026 09:35:34 GMT60C语言新手成长记（1）http://www.cppblog.com/SaynRain/archive/2009/08/14/93361.html 〃记念落寞 〃记念落寞 Fri, 14 Aug 2009 11:44:00 GMThttp://www.cppblog.com/SaynRain/archive/2009/08/14/93361.htmlhttp://www.cppblog.com/SaynRain/comments/93361.htmlhttp://www.cppblog.com/SaynRain/archive/2009/08/14/93361.html#Feedback0http://www.cppblog.com/SaynRain/comments/commentRss/93361.htmlhttp://www.cppblog.com/SaynRain/services/trackbacks/93361.html<1>
#include<stdio.h>
#include<stdlib.h>
#define max 100
main()
{
 int i,j;
 int n;
 i=0;
 char *p[max];
 printf("please input the number of max line：\n");
NEXT: scanf("%d",&n);
  if(n<0)
  {
  printf("error input,please input the number n again ：\n");
 goto NEXT;
  }
 while(i<n)
 {
 scanf("%s",&p[i]);
 printf("%d.%s\n",i+1,&p[i]);
 i++;
}
}


<2>
#include<stdio.h>
#define max 1000
main()
{
  char a[max][max];
  int i,n;
  printf("please input the number n:\n");
  scanf("%d",&n);
  for(i=0;i<n;i++)
  {
   scanf("%s",&a[i]);
  }
  for(i=0;i<n;i++)
  {
  printf("%d.%s\n",i+1,a[i]);
  }
}

〃记念落寞 2009-08-14 19:44 发表评论
]]>动态内存分配malloc实例http://www.cppblog.com/SaynRain/archive/2009/08/13/93219.html 〃记念落寞 〃记念落寞 Thu, 13 Aug 2009 09:06:00 GMThttp://www.cppblog.com/SaynRain/archive/2009/08/13/93219.htmlhttp://www.cppblog.com/SaynRain/comments/93219.htmlhttp://www.cppblog.com/SaynRain/archive/2009/08/13/93219.html#Feedback0http://www.cppblog.com/SaynRain/comments/commentRss/93219.htmlhttp://www.cppblog.com/SaynRain/services/trackbacks/93219.html读取一列整数，并按升序排列他们，最后打印这个列表。运行环境:Turbo2.0

#include<stdio.h>
#include<stdlib.h>
int
compare_integers(void const*a,void const*b)
{
 register int const *pa=a;
 register int const *pb=b;
 return *pa>*pb?1:*pa<*pb?-1:0;
}
int
main()
{
 int *array;
 int n_values;
 int i;
 printf("How many values are there?");
 if(scanf("%d",&n_values)!=1||n_values<=0)
 {
  printf("Illegal number of values.\n");
  exit(EXIT_FAILURE);
 }

 array=malloc(n_values*sizeof(int));
 if(array==NULL)
 {
  printf("Can't get memory for that many values.\n");
  exit(EXIT_FAILURE);
 }

    for(i=0;i<n_values;i+=1)
 {
  
  if(scanf("%d",&array[i])!=1)
  {
   printf("Error reading value #%d\n",i);
   free(array);
   exit(EXIT_FAILURE);
  }
 }

 qsort(array,n_values,sizeof(int),compare_integers);

 for(i=0;i<n_values;i+=1)
  printf("%d\n",array[i]);

 free(array);
 return EXIT_SUCCESS;
}



〃记念落寞 2009-08-13 17:06 发表评论
]]>