zoukankan      html  css  js  c++  java
  • 和与绝对值差

    Problem F: F

    Time Limit: 1 Sec  Memory Limit: 128 MB
    Submit: 221  Solved: 56
    [Submit][Status][Web Board]

    Description

    Superbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions, the local hackers have organized a betting pool on the game. Members place their bets on the sum of the two final scores, or on the absolute difference between the two scores.
    Given the winning numbers for each type of bet, can you deduce the final scores?

    Input

    The first line of input contains n, the number of test cases. n lines follow, each representing a test case. Each test case gives s and d, non-negative integers representing the sum and (absolute) difference between the two final scores.

    Output

    For each test case, output a line giving the two final scores, largest first. If there are no such scores, output a line containing "impossible". Recall that football scores are always non-negative integers.

    Sample Input

    2
    40 20
    20 40

    Sample Output

    30 10
    impossible
    

    对应的程序如下:

    #include <stdio.h>
    #include <stdlib.h>
    #include<math.h>
    int max(int x,int y)
    {
        return x>y?x:y;    
    }
    int main()
    {
          int n,s,d,p,q,m;
          while(scanf("%d",&n)!=EOF)
          {
              while(n-->0)
              {
                 scanf("%d%d",&s,&d);      
                 if(s>=d&&(s-d)%2==0) 
                 {
                    m=max(p,q);   
                    m=(d+s)/2;
                    printf("%d %d\n",m,s-m);       
                 }
                 else
                  printf("impossible\n");
              }                       
          }
          //system("pause");
         return 0;
    }
    或者简单的:

    #include"stdio.h"
    #include"stdlib.h"
    #include"math.h"
    int main()
    {
       int n,s,d,p,q,m;
       while(scanf("%d",&n)!=EOF)
       {
          while(n-->0)
          {
             scanf("%d%d",&s,&d);
             if(s>=d&&(s-d)%2==0)
             {
                 m=(s+d)/2;                        
                 printf("%d %d\n",m,s-m);
             }
             else
                  printf("impossible\n");
          }                        
       }   
        //system("pause");
        return  0;
    }

  • 相关阅读:
    使用 Hudson 进行持续集成
    hudson中的ftp插件
    Tomcat i18n 对 URL 进行 UTF8 解码
    Product deploy using NAnt and NSIS [技术点滴]
    切身体会到对微软的无语——关于VS2008的配置项
    How to create your own home SVN repository with Xampp/Apache
    CVS+VS2003+SetupFactory建设每日构建(Daily build)
    期待 JDK、Tomcat和MySQL的绿色安装方法
    FolderBrowserDialog 使用时路径问题
    无敌删除命令
  • 原文地址:https://www.cnblogs.com/QQbai/p/2122223.html
Copyright © 2011-2022 走看看