zoukankan      html  css  js  c++  java
  • Poj 2583 Series Determination

    1.Link:

    http://poj.org/problem?id=2583

    2.Content:

    Series Determination
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 6215   Accepted: 4090

    Description

    Boudreaux and Thibodeaux aren't very good at math, so they need you to write a program that can determine the second degree polynomial used to generate a given sequence of three integers. As proof that you've figured out the polynomial, they want your program to print out the next 3 integers in the sequence. 

    You know that each sequence is generated by a polynomial of the form f(x) = Ax2 + Bx + C, where A, B, and C are integers in the range (-103 <= (A, B, C) <= 103). You are given the values f(0), f(1), f(2) and are to determine the values f(3), f(4), f(5). 

    Input

    Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets. 

    Each data set consists of a single line containing the space-separated integer values of the polynomial evaluated at 0, 1, and 2 (in that order). These values will be in the range (-103 <= (f(0), f(1), f(2)) <= 103).

    Output

    For each data set, there will be exactly one line of output containing the space-separated integer values of the polynomial evaluated at 3, 4, and 5 (in that order). These values will be in the range (-104 <= (f(3), f(4), f(5)) <= 104).

    Sample Input

    0 0 0
    1 1 1
    1 2 3
    0 1 4
    0 2 8
    

    Sample Output

    0 0 0
    1 1 1
    4 5 6
    9 16 25
    18 32 50
    

    Source

    3.Method:

    4.Code:

     1 #include <iostream>
     2 #include <cstdio>
     3 
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     double x,y,z;
     9     double a,b,c;
    10     double p,q,r;
    11     while(cin>>x>>y>>z)
    12     {
    13         a=(z-2*y+x)/2;
    14         b=2*y-3*x/2-z/2;
    15         c=x;
    16         //cout<<a<<" "<<b<<" "<<c<<endl;
    17         p=a*3*3+b*3+c;
    18         q=a*4*4+b*4+c;
    19         r=a*5*5+b*5+c;
    20         printf("%.0lf %.0lf %.0lf
    ",p,q,r);
    21     }
    22     //system("pause");
    23     return 0;
    24 }

    5.Reference:

  • 相关阅读:
    4
    3
    2
    JAVA中的Token
    swagger2常用注解说明
    Java SimpleDateFormat 中英文时间格式化转换
    Shiro+Redis实现tomcat集群session共享
    理解并设计rest/restful风格接口
    这一篇比上一遍更形象一点,整合到一起看看还是不错的
    SSM 三大框架---事务处理
  • 原文地址:https://www.cnblogs.com/mobileliker/p/4068276.html
Copyright © 2011-2022 走看看