zoukankan      html  css  js  c++  java
  • 10276

    People stopped moving discs from peg to peg after they know the number of steps needed to complete the entire task. But on the other hand, they didn't not stopped thinking about similar puzzles with the Hanoi Tower. Mr.S invented a little game on it. The game consists of N pegs and a LOT of balls. The balls are numbered 1,2,3... The balls look ordinary, but they are actually magic. If the sum of the numbers on two balls is NOT a square number, they will push each other with a great force when they're too closed, so they can NEVER be put together touching each other.

    The player should place one ball on the top of a peg at a time. He should first try ball 1, then ball 2, then ball 3... If he fails to do so, the game ends. Help the player to place as many balls as possible. You may take a look at the picture above, since it shows us a best result for 4 pegs.


    Input

    The first line of the input contains a single integer T, indicating the number of test cases. (1<=T<=50) Each test case contains a single integer N(1<=N<=50), indicating the number of pegs available.


    Output

    For each test case in the input print a line containing an integer indicating the maximal number of balls that can be placed. Print -1 if an infinite number of balls can be placed.


    Sample Input

    2
    4
    25


    Sample Output

    11
    337

    思路: 定义一个数组用来储存柱子上的数字,如果数字满足条件则a[i] = num 否则 i++

    AC代码:

     1 #include<iostream>
     2 #include<string.h>
     3 #include<math.h>
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     int a[50], b[50];
     9     int times, peg, temp;
    10     int n = 1;
    11     int num = 1;
    12     int i = 0, j;
    13     cin >> times;
    14     while(times--)
    15     {
    16         cin >> peg;
    17         memset(a, 0, sizeof(a));
    18         while(1)
    19         {
    20             if(i == peg)
    21             {
    22                 cout << num - 1 << endl;
    23                 num = 1, i = 0;
    24                 break;
    25             }
    26             if(a[i] == 0)
    27             {
    28                 a[i] = num++;
    29                 i = 0;
    30                 continue;
    31             }
    32             else
    33             {
    34                 j = (int)sqrt(a[i] + num);
    35                 if(j * j == (a[i] + num))
    36                 {
    37                     a[i] = num++;
    38                     i = 0;
    39                     continue;
    40                 }
    41                 else
    42                 {
    43                     i++;
    44                 }
    45             }
    46         }
    47     }
    48 
    49     return 0;
    50 }
    View Code
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    linux 程序后台运行
    小型网站架构技术点(简要)
    rsync安装与配置使用 数据同步方案(centos6.5)
    nfs的原理 安装配置方法 centos6.5
    centos 6.5 升级到 python2.7
    ntpdate 设置时区(注意本地时区要设置正确)
    关于umask的计算方式(简单任性)
    No space left on device(总结)
    lsof 查看打开了一个文件的有哪些进程 统计那个进程打开的文件最多
    作用域是什么?
  • 原文地址:https://www.cnblogs.com/h-hkai/p/8659680.html
Copyright © 2011-2022 走看看