zoukankan      html  css  js  c++  java
  • 1012 数字分类 (20分)

    #include <stdio.h>
    #include <string.h>
    
    int main()
    {
        int n;
        int num[1001];
        int a1=0,c1=0,a2=0,c2=1,a3=0,a5=0,c5=0;
        double a4=0,c4=0;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&num[i]);
            if(num[i]%10==0)
            {
                a1+=num[i];
                c1++;
            }
            else if(num[i]%5==1)
            {
                if(c2%2==0)
                    a2-=num[i];
                else
                    a2+=num[i];
                c2++;
            }
            else if(num[i]%5==2)
                a3++;
            else if(num[i]%5==3)
            {
                c4++;
                a4+=num[i];
            }
            else if(num[i]%5==4)
            {
                if(c5==0)
                {
                    a5=num[i];
                    c5=1;
                }
                else
                {
                    if(num[i]>a5)
                        a5=num[i];
                }
            }
        }
        if(c1==0)
            printf("N ");
        else
            printf("%d ",a1);
        if(c2==1)
            printf("N ");
        else
            printf("%d ",a2);
        if(a3==0)
            printf("N ");
        else
            printf("%d ",a3);
        if(c4==0)
            printf("N ");
        else
            printf("%.1f ",a4/c4);
        if(c5==0)
            printf("N
    ");
        else
            printf("%d
    ",a5);
        return 0;
    }
  • 相关阅读:
    Shell Sort
    Insertion Sort
    Notations
    Nakamori Akina
    QuickSort
    Onedrive File Open Problem
    JSON Introduction
    System Call
    进程软中断通信
    Bubble Sort
  • 原文地址:https://www.cnblogs.com/QRain/p/12221206.html
Copyright © 2011-2022 走看看