zoukankan      html  css  js  c++  java
  • HDU5143 NPY and arithmetic progression【暴力】

    NPY and arithmetic progression

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1505    Accepted Submission(s): 465

    Problem Description
    NPY is learning arithmetic progression in his math class. In mathematics, an arithmetic progression (AP) is a sequence of numbers such that the difference between the consecutive terms is constant.(from wikipedia)
    He thinks it's easy to understand,and he found a challenging problem from his talented math teacher:
    You're given four integers, a1,a2,a3,a4, which are the numbers of 1,2,3,4 you have.Can you divide these numbers into some Arithmetic Progressions,whose lengths are equal to or greater than 3?(i.e.The number of AP can be one)
    Attention: You must use every number exactly once.
    Can you solve this problem?
    Input
    The first line contains a integer T — the number of test cases (1T100000).
    The next T lines,each contains 4 integers a1,a2,a3,a4(0a1,a2,a3,a4109).
    Output
    For each test case,print "Yes"(without quotes) if the numbers can be divided properly,otherwise print "No"(without quotes).
    Sample Input
    3 1 2 2 1 1 0 0 0 3 0 0 0
    Sample Output
    Yes No Yes
    Hint
    In the first case,the numbers can be divided into {1,2,3} and {2,3,4}. In the second case,the numbers can't be divided properly. In the third case,the numbers can be divided into {1,1,1}.
    Source

    问题链接HDU5143 NPY and arithmetic progression

    问题简述:(略)

    问题分析:(略)

    程序说明占个位置。

    题记:(略)


    参考链接:(略)


    AC的C++语言程序如下:

    /* HDU5143 NPY and arithmetic progression */
    
    #include <iostream>
    #include <stdio.h>
    
    using namespace std;
    
    const int N = 4;
    int a[N];
    
    bool check(int i, int j, int k, int n)
    {
        int v[4] = {a[0] - i - k, a[1] - i - j - k, a[2] - i - j - k, a[3] - j - k};
        for(int i=0; i<n; i++)
            if(v[i] != 0 && v[i] < 3)
                return false;
        return true;
    }
    
    bool judge(int n)
    {
        for(int i=0; i<n-1; i++)
            for(int j=0; j<n-1; j++)
                for(int k=0; k<n-1; k++)
                    if(check(i, j, k, n))
                        return true;
        return false;
    }
    
    int main()
    {
        int t;
    
        scanf("%d", &t);
        while(t--) {
            for(int i=0; i<N; i++)
                scanf("%d", &a[i]);
    
            printf("%s
    ", judge(N) ? "Yes" : "No");
        }
    
        return 0;
    }





  • 相关阅读:
    Tomcat:基础安装和使用教程
    java部署
    tomcat 配置访问路径 server.xml配置去掉项目名称 .
    linuxACL控制
    Your PHP installation appears to be missing the MySQL
    ssh报错
    502 Bad Gateway
    单点登录SSO
    tomcat详细介绍
    详解redis5.x版本
  • 原文地址:https://www.cnblogs.com/tigerisland/p/7563561.html
Copyright © 2011-2022 走看看