Educational Codeforces Round 104 (Rated for Div. 2) D. Pythagorean Triples 数学

最新推荐文章于 2021-11-12 22:15:36 发布

西伯利亚松鼠

最新推荐文章于 2021-11-12 22:15:36 发布

阅读量676

点赞数

分类专栏：数学 CodeForces

本文链接：https://blog.csdn.net/qq_46173805/article/details/113920986

版权

CodeForces 同时被 2 个专栏收录

25 篇文章 0 订阅

订阅专栏

数学

16 篇文章 1 订阅

订阅专栏

D. Pythagorean Triples

在这里插入图片描述

input

3
3
6
9

output

0
1
1

solution

$c^2=a^2+b^2~(i)$

$c=a^2-b~(ii)$

$c^2-b=b^2+b$

$= > c = b + 1$

$=>b=\frac{a^2-1}{2}，c=\frac{a^2+1}{2}$

$统计 1$ ~ $n中满足(i)，(ii)的值，通过c=\frac{a^2+1}{2}来作为上限值$

code

//Siberian Squirrel
//#include<bits/stdc++.h>
#include<unordered_map>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>

#define ACM_LOCAL

using namespace std;
typedef long long ll;

const double PI = acos(-1);
const double eps = 1e-7;
const int MOD = 3221225473;
const int N = 5e6 + 10;
const int UP = 1e4;

inline ll solve(int n, ll res = 0) {
    for (int i = 3; (1ll * i * i + 1) / 2 <= n; i += 2) {
        res ++;
    }
    return res;
}

int main() {
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    int o = 1, n, m, x, y;
    scanf("%d", &o);
    while(o --) {
        scanf("%d", &n);
        printf("%lld\n", solve(n));
    }
    return 0;
}