HDU 2019-2020

终于刷完了hdu上29道简单题,接下来去zoj上继续刷30道简单题。继续加油

HDU 2019

 /* THE PROGRAM IS MADE BY SH */
/*---------------------------------------------------------------------------
 *       http://acm.hdu.edu.cn/showproblem.php?pid=2019
 *       数列有序!  
 *       Date  : 2015/5/2 
----------------------------------------------------------------------------*/
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <ctime>

using namespace std;
int a[100] = {0};
int main()
{
  int n,m,temp;
  while(scanf("%d%d",&n,&m) !=EOF && n <=100 && n >=0){
       if(n == 0 && m == 0) continue;
      for(int i = 0; i<n; ++i){
           scanf("%d",&a[i]);
      }
      a[n] = m;
      for(int j = 0; j < n; ++j){
          for(int i =0; i < n - j; ++i){
              if(a[i] > a[i+1]){
                  temp = a[i];
                  a[i] = a[i+1];
                  a[i+1] = temp;
              }
          } 
      }
      for(int i = 0; i < n+1; ++i ){
          printf("%d",a[i]);
          if(i != n) printf(" ");
          else printf("\n");
      }
 }   
  system("Pause");
  return 0;
}

HDU 2020

 /* THE PROGRAM IS MADE BY SH */
/*---------------------------------------------------------------------------
 *       http://acm.hdu.edu.cn/showproblem.php?pid=2020
 *       绝对值排序
 *       Date  : 2015/5/6
----------------------------------------------------------------------------*/
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <ctime>

using namespace std;
int a[101] = {0};
int main()
{
  int n,temp;
  while(scanf("%d",&n) != EOF && n <= 100){
      if(n == 0) continue;
      for(int i = 0;i < n;++i){
          scanf("%d",&a[i]);
      }
      for(int j = 0; j < n-1; ++j){
          for(int i = 0; i < n-1-j; ++i){
               if(abs(a[i])<abs(a[i+1])){
                   temp = a[i];
                   a[i] = a[i+1];
                   a[i+1] = temp;
               }
          }
      }
      for(int i = 0; i < n;++i){
          printf("%d",a[i]);
          if(i != n-1) printf(" ");
          else printf("\n");
      }
  }
  system("Pause");
  return 0;
}


  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值