lightoj1008 Fibsieve`s Fantabulous Birthday

题目: Fibsieve`s Fantabulous Birthday

Fibsieve had a fantabulous (yes, it’s an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.

Among these gifts there was an N x N glass chessboard that had a light in each of its cells. When the board was turned on a distinct cell would light up every second, and then go dark.

The cells would light up in the sequence shown in the diagram. Each cell is marked with the second in which it would light up.

解题思路:
  • 偶数的平方和都在x = 1处, 奇数的平方和都在y = 1处, 根据等差数列可以算出, 连续平方和中间差值, 1, 3, 5, 7, 9,
#include <stdio.h>  
#include <iostream>  
#include <math.h>  
using namespace std;  

void FibsievesFantabulousBirthday()  
{  
    int T = 0;  
    cin >> T;  
    long long S = 0;  
    for (int i = 0; i < T; i++) {  
        cin >> S;  
        long long rowNum = 1, x = 1, y = 1;   
        y = (long long)sqrt(S);  
        S -= (y * y);//代码应用公式:根据等差数列求和变形计算出来  
        if (S == 0) S += 1 + 2 * (y - 1);//作特殊处理  
        else y++;  

        if (y % 2 == 0 && S <= y) {
            x = S;  
        } else if (y % 2 && S <= y) {  
            x = y;  
            y = S;  
        } else if (y % 2 == 0 && S > y) {  
            x = y;  
            y = y - (S - y);  
        }  else if (y % 2 && S > y) {  
            x = y - (S - y);  
        }  else {

        }
        cout << "Case " << i + 1 << ": " << x << ' ' << y << endl;  
    }  
}  
int main()  
{  
    FibsievesFantabulousBirthday();  
    return 0;  
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值