zoukankan      html  css  js  c++  java
  • Array

    Vitaly has an array of n distinct integers. Vitaly wants to divide this array into three non-empty sets so as the following conditions hold:

    1. The product of all numbers in the first set is less than zero ( < 0).
    2. The product of all numbers in the second set is greater than zero ( > 0).
    3. The product of all numbers in the third set is equal to zero.
    4. Each number from the initial array must occur in exactly one set.

    Help Vitaly. Divide the given array.

    Input

    The first line of the input contains integer n (3 ≤ n ≤ 100). The second line contains n space-separated distinct integers a1, a2, ..., an (|ai| ≤ 103) — the array elements.

    Output

    In the first line print integer n1 (n1 > 0) — the number of elements in the first set. Then print n1 numbers — the elements that got to the first set.

    In the next line print integer n2 (n2 > 0) — the number of elements in the second set. Then print n2 numbers — the elements that got to the second set.

    In the next line print integer n3 (n3 > 0) — the number of elements in the third set. Then print n3 numbers — the elements that got to the third set.

    The printed sets must meet the described conditions. It is guaranteed that the solution exists. If there are several solutions, you are allowed to print any of them.

    Example

    Input
    3
    -1 2 0
    Output
    1 -1
    1 2
    1 0
    Input
    4
    -1 -2 -3 0
    Output
    1 -1
    2 -3 -2
    1 0
    题意:
    一组数分成三类,分别为乘积小于0,大于0和等于0.
    题解:
    小于0的一类放一个数,如果有大于0的数也放一个,没有的话放两个负数,剩下的都放入乘积为0的一类。
    C代码:
    AC代码:
     1 #include<stdio.h>
     2 #include<algorithm>
     3 using namespace std;
     4 bool cmp(int x,int y)
     5 {
     6     return x<y;
     7 }
     8 
     9 int main()
    10 {
    11     int n,m[100],a[100],b[100],c[100];
    12     int i;
    13     while(scanf("%d",&n)!=EOF)
    14     {for(i=0;i<n;i++)
    15      scanf("%d",&m[i]);
    16      sort(m,m+n,cmp);
    17      a[0]=m[0];       //第一个负数 
    18      
    19       if(m[n-1]>0)
    20         {c[0]=m[n-1];
    21           printf("1 %d
    ",a[0]);
    22            printf("1 %d
    ",c[0]);
    23            printf("%d ",n-2);
    24            for(i=1;i<n-1;i++)
    25            printf("%d%c",m[i],i==n-2?'
    ':' ');
    26                
    27         }
    28        
    29           
    30       
    31      else  
    32        {c[0]=m[1]; //负数至少3个 
    33         c[1]=m[2];
    34            printf("1 %d
    ",a[0]);
    35            printf("2 %d %d
    ",c[0],c[1]);
    36            printf("%d ",n-3);
    37            for(i=3;i<n;i++)
    38            printf("%d%c",m[i],i==n-1?'
    ':' ');
    39        }  
    40      
    41        
    42        
    43       
    44         
    45     }
    46     return 0;
    47 }


  • 相关阅读:
    Git 分支管理
    Kubernetes 中文文档
    Docker 命令大全
    Redis 常用命令 大全
    Docker 资源汇总
    Docker 安装 Redis
    JavaScript闭包
    CSS选择器
    JavaScript类型转换
    javascript字符串处理方法
  • 原文地址:https://www.cnblogs.com/hss-521/p/7236918.html
Copyright © 2011-2022 走看看