ZOJ3935

来源:互联网 发布:河南雪城软件 编辑:程序博客网 时间:2024/05/17 09:05
H - H
Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu
Submit Status Practice ZOJ 3935

Description

In mathematics, a polygonal number is a number represented as dots or pebbles arranged in the shape of a regular polygon. The dots are thought of as alphas (units). These are one type of 2-dimensional figurate numbers. The following picture shows how triangular numbers, square numbers, pentagonal numbers and hexagonal numbers represented as dots arranged in the shape of corresponding regular polygon.

Polygonal Numbers: Triangular, Square, Pentagonal and Hexagonal numbers

2016 is not only a leap year but also a triangular and hexagonal year. If you are patient enough, you can count the number of the dots in the left triangle or in the right hexagon in the following picture. The number of dots in each shape is 2016.

2016 is a triangular-hexagonal-leap year

Therefore, 2016 is a triangular-hexagonal-leap year. The previous triangular-hexagonal-leap year is 1540 and the next is 2556. So living to see 2016 is very rare experience.

You task is to list the triangular-hexagonal-leap years from 2016 to 990528. 990528 is also a triangular-hexagonal-leap year.

Input

This problem has no input.

Output

Please print each triangular-hexagonal-leap year in increasing order.

For example, if you are asked to list the triangular-hexagonal-leap years from 780 to 2556, the output should be:

 7801128154020162556

Sample Output

20162556...  <-- some lines are skipped

990528

AC 的代码

#include<iostream>#include<stdio.h>using namespace std;int main(){    int i,j;    int flag;    for(i=2016; i<=990528; i++)    {        if(i%400==0||(i%4==0&&i%100!=0))        {            for(j=32; j<=995; j++)            {                if(j*(2*j-1)==i)                {                    for(int k=j; k>=32; k++)                    {                        if(k*(k+1)/2==i)                        {                            printf("%d\n",i);                            break;                        }                    }                }            }        }    }    return 0;}

0 0