Street Numbers
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 3078   Accepted: 1725

Description

A computer programmer lives in a street with houses numbered consecutively (from 1) down one side of the street. Every evening she walks her dog by leaving her house and randomly turning left or right and walking to the end of the street and back. One night she adds up the street numbers of the houses she passes (excluding her own). The next time she walks the other way she repeats this and finds, to her astonishment, that the two sums are the same. Although this is determined in part by her house number and in part by the number of houses in the street, she nevertheless feels that this is a desirable property for her house to have and decides that all her subsequent houses should exhibit it.
Write a program to find pairs of numbers that satisfy this
condition. To start your list the first two pairs are: (house number,
last number):

         6         8

35 49

Input

There is no input for this program.

Output

Output will consist of 10 lines each containing a pair of numbers, in increasing order with the last number, each printed right justified in a field of width 10 (as shown above).

Sample Input

Sample Output

         6         8
35 49
题目意思也就是,从家里向右走走到街道尾部经过的编号之和(不包括自己家)和从家里向左走走到街头经过的编号之和(不包括自己家)相等
设自己家的编号为m,街道共有n家,所以有

aaarticlea/gif;base64,R0lGODlhcAEOALMAAP///wAAAO7u7kRERLq6utzc3HZ2dpiYmDIyMszMzGZmZlRUVIiIiKqqqiIiIhAQECH5BAEAAAAALAAAAABwAQ4AAAT+EAAxiLw4632YqlsoSke3HGOqrmw7UpYrzy5M3zjWfXHu/4CC4RDo+Q4CSSHQ+A0lggAKSK1ehESjdZvBFrlgUjLIDJtFX9VBq3EkLgtHap36XB6LOfscTvNddCt+I4FmhSFucHKEe1aHN4MijxoPUwAGAXotUZYhk39ckaCago0Zn46mEpUXmKSGqiyiHLEZca8qBgNqtTQdDAIlCwTBBwtvVbM4v8XDzciMsr2oF8zCxMLQnr2KuGDUEg0MwNcZyqfcE2XRKg0KC2PsVgIES1MNDlMHu8npKvT2wuUjwU9einM6VAGUIlBfwW2b1kny50thPYYAGiAwNy3dAAb+vFokeKCNFhcL+KotupSnn4h3C2LKlGlAA8qVB1YaaGlwBMJqqm6qbMUTIouPIc+AEyqBwUMAymDGRIBgZs0Q40JIXUDVaooFDzRs7UqzioKrABagHdDpQoIBcOPKBRni54yzcNa2lTC2atm6jfp6FYtW7QW2YmeSjYlWQ9YNgv/6iMwYcmG6F+wCAHdBHAvOx1oFKNCzyoMep6GMtqLZRepVMaKQ9oamo4rXAF7Lpr3B8wrOP4DjXo1BM3ACljAbDbGkiYQFmUoDWXIl+uaNFH2a2jqzsgbqSqwfwM57g/FY4MlUIz9RBfILyk0qRW89pZHzKRIoIMDfXflWYwjJ8EB8GnBWADxKIBiEggeOMV41BSkAEoE4tPbZRgRdICEAFCYkzW+xPJghXxNKh4F+/BHgn4lXMOhiPMt5giEAeIEkgC4BIGBASQXG8kAAQAJZlHwjMGAAAws4x6IEIyHTJJMkQYnMExJQCUACR8J4w40D5LgjFVZaiSUw/0GBo448opNCmJaMqaWaI/wYZABD9phflFfi+eSSl7SZZUVbACeDoKMUCgqhLSB6g6Ig8sFoDm/+EKkPkxpqaaGV4pApFZvS0KmkOUQAADsA" alt="" />

化简整理得

aaarticlea/gif;base64,R0lGODlhawASALMAAP///wAAAJiYmIiIiGZmZkRERLq6uu7u7tzc3KqqqiIiIszMzFRUVBAQEHZ2djIyMiH5BAEAAAAALAAAAABrABIAAAT+EMhJq61pOHK7/1S2gWRpfscgMc7pVunavnRNGY8k5PaJ67ye8ISQjIalIuCI/AgGhIJBqFA2S9WrR3CQIAIJG2OqJY3LHcViwlDUBmsr2gIHyC8Csq0hmDgCNAkJBwgqcxaChIZbekhtOgMDBwICY5OVa3YBmwEzSBmSlGeanJ4deSCgl6MwYAAHBl99AAkKswIFhxKwshIJQS6oHrwBs78XBYZTtRMCbkYMJwQM1NXWphLLzwADuTTCHdoT3XSLEgSeLBMFs7oA6GzmH9PVDw/XF/Ar8hkWDXr/dgW4MyeghIE1wHkwCADhBAPtDH2ZMBEIgEbzrGlUZ6EiLTdKGEsovOCRGZkFBAyoTMABwI5m3t6pkFfm5bkWNEmMtGDzHU4JDThtiraknYN2CxxIcnd0QtKlL3ZWaCrhaRd3WKOGzMq1zFUbEQAAOwA=" alt="" />

配凑得aaarticlea/gif;base64,R0lGODlhugASALMAAP///wAAAKqqqoiIiHZ2drq6ulRUVO7u7tzc3JiYmCIiIjIyMhAQEMzMzERERGZmZiH5BAEAAAAALAAAAAC6ABIAAAT+EMhJq61ikHe7/6CUbWFpnmiqrtYxSAbBzpQLy3Su73xXLJIEsJf6BYfEpHL5QUhIzJITAI1ar6KBRkBTTIkN3MkLFl8PjgIRrRa1AQPuyvAmKjgnevKORRASAXU0foBvBgcTCAYrAw0AXzwJBngljY8gCYIekpQsmSaBSaEwiyIJKgICBwgvPQUND50fqautm5oXr7E5nyWjPb8IAQoFBWIJWgcJkgXKko6PAdIBZjnKALtZA8560dPVFr0f19kAGdvL3R/iIL887ggKAQuIAAcFwqfmCvoJDletst3LJwIJCnYdAuIZGECfAIMdEHpwt8MdAQQFGDBwpEaAggn+CT4+KVXigYGTKFOCA4BPQraOIuH8UyGxQktseGBOGDBzHa4LFHX8OjTBQMwHYmJMcKBvyTWXnZAWtQXCJMoFC1RWeIqTglQYVCdYPYlVa4egEho4WMu2bVgKoxRVIAOAwRu7Eg4EgJREAIG/BBQsIAANr4S9K2pO8AtYMGEJhgEgxvTTAloacXtKmCksUQCQQCpXGJsS5UoKDih1FvFRdETXqFV/Zs2SMijYKYa+adBKCMieD168XZIatFgZw22bKH7kOBzlIS7PcKdBQ9M/E7CnJbDtCqwADB440Q4gTPcUiit8Dz++qfl6t0AcIOBg3mNr9O1Dw8KfJu4e6fUMJ+CAKMDXn4EEVhABADsA" alt="" />

aaarticlea/gif;base64,R0lGODlhnQAUALMAAP///wAAAO7u7piYmGZmZoiIiMzMzDIyMkRERNzc3BAQECIiInZ2drq6uqqqqlRUVCH5BAEAAAAALAAAAACdABQAAAT+EMhJq704a+0KI1sojt03nmiqqkIhPcwqZ+0bz6Mw4Dw2CJTGQTIY9nhCovGYATGfAuckITE9Z1SA9VopGCiDAgHR4NLIlYbLssjyOh4Hrn0VoCdLwE+SCMjNFAkMAwFlFXkvhm+KBX8qD4o9goSKAzsTC18vCzgDkRqFFo0UXgBuMw9AfA8rpadHoRIIpwqXWgGdnxmxFAasEg4OAglrOA+/AA62J8HDxUy8ChoPnMkFBToDkCGeI7wU0qYB4wE3OH0LDQ3mYdiWkNkPmn3k5tCK4RcCfgACDX2XHCC60E3Etwm4AJlaEOCAKn8AgS24NACBwgqxElS7gGBNGQf4GwtY3FAwxEEJC1SZYZCggQIFXz5uHLCRAbIQBI7p3AkDlCGNGK5VIGDuwbMJOXUeOLDTHkZdAFKKMICgqtWrRwGkmkANaVFzCJZdjCUgH4UOFhQoCvCKINQLJwGYfZLgZtQsaifk7cf2IoVoFhrYWtNnAkgAbyeU3BB3LpMEIyeMLMwnoZ4hiYfy5On0qeRTBgioa+DASRGvALJWWOzTgi+F2yQYWHOaSGQCLlRz4WUJHLlxvwZNMMAAG8nM/RggaMhAk4RRCj14sCW8ii3ixhUKUM78i52LrFMM9EueR3PtOASXX89ECnsRUd7Ln6FjPjeV9vNniAAAOwA=" alt="" />

令aaarticlea/gif;base64,R0lGODlhZwAtALMAAP///wAAAMzMzFRUVNzc3HZ2doiIiGZmZhAQELq6uqqqqkRERCIiIu7u7piYmDIyMiH5BAEAAAAALAAAAABnAC0AAAT+EMgJxCA06827/2AoFoEhnmiqrgcirHAsp0mgzHiuSwuzzw7DYZH4dRpEDWJghDkaEoKtSSEUHIFiBnGgqhgvycDn1IKyyq4XhXBMSDGH+YPeqkMKRyGRv1DHEgoGBg0ODgNzG3IidRRcIgkYBAg3Lk0NUw2RAW4ACg8fiyGNE494EgkIHwcDra6vBR8LJgBFCmQABguhiR2kEqYnBUxegxkHsWK0FKyuDw+wvr3BIg+dTYJKZgEYHqJn03chmN29Es2v0RsJ17RSE7e13uYbvwDUHakAWBIC3TkCDiQYqECNA1DnYi1TRE+DPXwcAioQoKCAgoYrEATYuJHYlQn+AgoQmvehQYEFAR4UCCMhgLg1MDV8U4FpYcybEqDEUMANp88cDF7+HIpiwS6iSE8QYGAzqVMOt1g+nboOQVOqWKVcw8o1VwCdXbNyCts1QDKyVCGiRap27dC2GijeUUAMRxBChhAVOiT1JlwKhe6FGXBWhiatgRh0cnDU598JRd4BM4cuXavCqDzhcoBr2FuhHTxXCPAD2QTCExZs9QuaA4MbuRDqQGCGds6ePx9T+MoD84TKln0DkDyctISD8hy3rgdFCsYUyI83PmDiqhfdE/To4a3jowTvFUSCZa1Cl1sdC2R/sA2AwfPzIrD8O6KmwHL4KZ6FMAQe/4wGz/QN5R9OBiAw34AIJthBBAA7AA==" alt="" />,所以转化为佩尔型方程aaarticlea/gif;base64,R0lGODlhYgAUALMAAP///wAAAKqqqpiYmHZ2drq6ulRUVNzc3BAQEMzMzDIyMu7u7mZmZoiIiCIiIkRERCH5BAEAAAAALAAAAABiABQAAAT+EMhJgWiE1c2791f2jSS5NJJBlGx7pmsrk4UiDfasb/Wd70DKQSIKBoeAonEJcCCZF4yg5WRWFo9Cy6C1CrqAxpTEtU4OhEEAPGokAE+jYXE2kNxwM2VdEggWByhMBnYSAgMjfoCCegB8E4cEBYcGBwcBmAExS5cOBQWbCQIahpWZmo0SjwAFQwcIUwhvqRIHDgEKdAALiLIwtBurYwUIwBUEB8S+WpcTCGwfDITT1CofqxMEhS0JD97f4IwTc+MO2YUJAcYV2BIKiOsH2xJVTWMNP+uO0AsBSNBmDjyoMFCVrgebSEirRi1hsC7EAKiRkCBOozIUGQWgcwkgsEc0CRgIEEXgiz4MGODdSENgo74FBB7gIjBLn44GBW3q3PGMnsedQD0sIKUkqNERAwakOTohAgA7AA==" alt="" />,且首项为aaarticlea/gif;base64,R0lGODlhJgASALMAAP///wAAAO7u7piYmGZmZoiIiMzMzDIyMkRERNzc3BAQECIiInZ2dlRUVKqqqrq6uiH5BAEAAAAALAAAAAAmABIAAASwEEgxpL04azBEJlsoTuBVGNcwFE01AgLyYE9xHRfjCoG7JbrADIOTqC4EhEXReAGEmYJDgkhseD4RFGNoAhQhhtK5xYC/Ggeh4SEPMQFAYhEyKFCv8mUhmIsaZyN6FnwCgRINeAAMAVaCbxdnhwkBU4hxeZBLVI4SDG2GNnJsG4MAXUZZAAUMLJanCqoCYgEHDIqrljFOEq9ORZ64Ir4jD6olIwVtLwLIFhQvxCIdFhEAOwA=" alt="" />

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll x,y,fx,fy,a,b;
int main()
{
x=fx=;y=fy=;
for(int i=;i<;i++)
{
a=fx*x+*fy*y;
b=fy*x+fx*y;
printf("%10lld%10lld\n",b,(a-)/);
fx=a;
fy=b;
}
return ;
}
												

POJ 1320 Street Numbers(佩尔方程)的更多相关文章

  1. POJ 1320 Street Numbers Pell方程

    http://poj.org/problem?id=1320 题意很简单,有序列 1,2,3...(a-1),a,(a+1)...b  要使以a为分界的 前缀和 和 后缀和 相等 求a,b 因为序列很 ...

  2. POJ 1320 Street Numbers 【佩尔方程】

    任意门:http://poj.org/problem?id=1320 Street Numbers Time Limit: 1000MS   Memory Limit: 10000K Total Su ...

  3. POJ 1320 Street Numbers 解佩尔方程

    传送门 Street Numbers Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2529   Accepted: 140 ...

  4. POJ 1320:Street Numbers

    Street Numbers Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2753   Accepted: 1530 De ...

  5. POJ1320 Street Numbers【佩尔方程】

    主题链接: http://poj.org/problem?id=1320 题目大意: 求解两个不相等的正整数N.M(N<M),使得 1 + 2 + - + N = (N+1) + - + M.输 ...

  6. HDU 3292 【佩尔方程求解 && 矩阵快速幂】

    任意门:http://acm.hdu.edu.cn/showproblem.php?pid=3292 No more tricks, Mr Nanguo Time Limit: 3000/1000 M ...

  7. Poj 2247 Humble Numbers(求只能被2,3,5, 7 整除的数)

    一.题目大意 本题要求写出前5482个仅能被2,3,5, 7 整除的数. 二.题解 这道题从本质上和Poj 1338 Ugly Numbers(数学推导)是一样的原理,只需要在原来的基础上加上7的运算 ...

  8. 2010辽宁省赛G(佩尔方程)

    #include <iostream> #include <stdio.h> #include <string.h> #include <algorithm& ...

  9. POJ 1320

    作弊了--!该题可以通过因式分解得到一个佩尔方程....要不是学着这章,估计想不到.. 得到x1,y1后,就直接代入递推式递推了 x[n]=x[n-1]*x[1]+d*y[n-1]*y[1] y[n] ...

随机推荐

  1. 为什么不能用memcached存储Session?

    Memcached创建者Dormando非常早就写过两篇文章[1][2].告诫开发者不要用memcached存储Session. 他在第一篇文章中给出的理由大致是说,假设用memcached存储Ses ...

  2. 集群版本升级——rolling upgrade在ES 单节点从 restart 到加入集群,大概要 100s 左右的时间。也就是说,这 100s 内,该节点上的所有分片都是 unassigned 状态

    集群版本升级 Elasticsearch 作为一个新兴项目,版本更新非常快.而且每次版本更新都或多或少带有一些重要的性能优化.稳定性提升等特性.可以说,ES 集群的版本升级,是目前 ES 运维必然要做 ...

  3. cximage功能简介

    CxImage是一个可以用于MFC 的C++图像处理类库类,它可以打开,保存,显示,转换各种常见格式的图像文件,比如BMP, JPEG, GIF, PNG, TIFF, MNG, ICO, PCX, ...

  4. VSCode向上的代码提示消除

    VSCode虽然好用, 但是有些用户体验实在非常差, 比如这种往上面弹的类型提示... 在用户设置中增加: "editor.parameterHints": false

  5. String转换成int型

    private boolean judge(String str){ int year = 0; try{ year = Integer.valueOf(str).intValue(); }catch ...

  6. xBIM 实战01 在浏览器中加载IFC模型文件

    系列目录    [已更新最新开发文章,点击查看详细]  一.创建Web项目 打开VS,新建Web项目,选择 .NET Framework 4.5  选择一个空的项目 新建完成后,项目结构如下: 二.添 ...

  7. 报表工具Report Builder 3.0的安装

    工作后第一次尝试独立安装一个软件啊 话不多说,总结一下过程 前言:已经Baidu了Report Builder 3.0的安装教程了,就到微软的官网上下载去了,下载完成双击程序安装告诉我,要想安装Rep ...

  8. ACM-ICPC 2018 焦作赛区网络预赛 L:Poor God Water(矩阵快速幂)

    God Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him t ...

  9. RocketMQ学习笔记(7)----RocketMQ的整体架构

    1. RocketMQ主要的9个模块,如图: 2. 模块介绍 1. rocketmq-common:通用的常量枚举,基类方法或者数据结构,按描述的目标来分包,通俗易懂.报名有admin,consume ...

  10. BZOJ 1190 [HNOI2007]梦幻岛宝珠(背包)

    1190: [HNOI2007]梦幻岛宝珠 Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 1385  Solved: 798[Submit][Stat ...