• 我用超白痴的方法解出了这道题,大家有没有更好的方法


    题目如下

    Dick and Jane

    Time limit: 1 Seconds   Memory limit: 32768K  
    Total Submit: 208   Accepted Submit: 92  

    Dick is 12 years old. When we say this, we mean that it is at least twelve and not yet thirteen years since Dick was born.

    Dick and Jane have three pets: Spot the dog, Puff the Cat, and Yertle the Turtle. Spot was s years old when Puff was born; Puff was p years old when Yertle was born; Spot was y years old when Yertle was born. The sum of Spot's age, Puff's age, and Yertle's age equals the sum of Dick's age (d) and Jane's age (j). How old are Spot, Puff, and Yertle?

    Each input line contains four non-negative integers: s, p, y, j. For each input line, print a line containing three integers: Spot's age, Puff's age, and Yertle's age. Ages are given in years, as described in the first paragraph.

    Sample Input

    5 5 10 9
    5 5 10 10
    5 5 11 10
    

    Output for Sample Input

    12 7 2
    13 7 2
    13 7 2
    

    Problem Source: University of Waterloo Local Contest 1998.06.06

    我用的是傻得无以复加的方法,而且差0.02s就超时了,好险!

    //http://acm.zju.edu.cn/show_problem.php?pid=1110

    #include
    <iostream>
    using namespace std;
    main()
    {
        
    const int d=12;
        
    int s,p,y,j;
        
    float sa,pa,ya;

        
    while(  scanf("%d%d%d%d",&s,&p,&y,&j)!=EOF)
        
    {
           
    for(ya=0.0;ya<=50;ya+=0.1)
            
    {
                
    for(pa=ya;pa<=ya+p+3;pa+=0.1)
                
    {
                    
    for(sa=pa;sa<=ya+y+3;sa+=0.1)
                    
    {
                        
    if ( (int(sa-pa)==s) && (int(sa-ya)==y) && (int(pa-ya)==p) && (int(sa)+int(pa)+int(ya)==d+j) )
                            
    goto finish;
                    }

                }

            }

    finish:  
            printf(
    "%.0f %.0f %.0f\n",sa,pa,ya);

        }

    }


    大家有更好的算法吗?

  • 相关阅读:
    应用运维职业现状
    两年工作总结
    explicit用法
    最小生成树 之 CODE[VS] 1231 最优布线问题
    最小生成树 之 CODE[VS] 1078 最小生成树
    并查集 之 CODE[VS] 1073 家族
    贪心 + 并查集 之 CODE[VS] 1069 关押罪犯 2010年NOIP全国联赛提高组
    枚举+并查集 之 CODE[VS] 1001 舒适的路线 2006年
    SPFA算法(求解单源最短路)详解 + 最短路 之 CODE[VS] 1079 回家
    最短路 之 CODE[VS] 1041 Car的旅行路线 2001年NOIP全国联赛提高组
  • 原文地址:https://www.cnblogs.com/Jonlee/p/274279.html
Copyright © 2020-2023  润新知