HOJ 2076 Series Determination
2012-11-21 15:08
148 查看
http://acm.hit.edu.cn/hoj/problem/view?id=2076
二元一次方程组
给出f(0), f(1), f(2) 求 f(3), f(4), f(5)
二元一次方程组
给出f(0), f(1), f(2) 求 f(3), f(4), f(5)
#include <stdio.h> int main() { double f[8], a, b, c; while (scanf("%lf %lf %lf",&f[0],&f[1],&f[2])!=EOF) { c = f[0]; a = ( (f[2] + f[0]) / 2) - f[1]; b = f[1] - f[0] - a; f[3] = a * 9 + b * 3 + c; f[4] = a * 16 + b * 4 + c; f[5] = a * 25 + b * 5 + c; printf("%.0lf %.0lf %.0lf\n",f[3], f[4], f[5]); } return 0; }
相关文章推荐
- hoj 1018 - Multiple
- 【搜索剪枝】HOJ 1239 Calling Extraterrestrial Intelligence Again
- Cycles of Lanes --HOJ 11877
- hoj2824
- hoj 1040 As Easy As A+B
- hoj 2503 Bribing FIPA
- hoj 2012 winter training Graph Day1 106 miles to Chicago图论最短路dijkstra算法
- hoj Simple Computing
- hoj 1520 The Bottom of a Graph // poj 2553 The Bottom of a Graph
- HOJ---10641 Equidivisions [BFS]
- HOJ---10814 Wooden Sticks[线性DP-求最少不递增子序列+结构体排序]
- HOJ 2608 Assemble(二分)
- Factstone Benchmark hoj 数学题
- hoj 2105The Center of Gravity
- hdu 2076 夹角有多大(题目已修改,注意读题)
- HOJ 2934 Simple Math Question
- HOJ 2314 Stamps
- HOJ 2012 Sort and Merge
- HOJ 1637 HangOver
- HOJ 1439 The Circumference of the Circle