Represent A Number As Two Square Sum (verify/number_theory/two_squares.test.cpp)

• View this file on GitHub
• Last update: 2025-12-17 02:23:31+01:00
• Problem: https://judge.yosupo.jp/problem/two_square_sum

Depends on

• cp-algo/math/common.hpp
• cp-algo/number_theory/euler.hpp
• cp-algo/number_theory/factorize.hpp
• cp-algo/number_theory/modint.hpp
• cp-algo/number_theory/primality.hpp
• cp-algo/number_theory/two_squares.hpp
• cp-algo/random/rng.hpp
• cp-algo/util/big_alloc.hpp
• cp-algo/util/complex.hpp
• cp-algo/util/simd.hpp

Code

// @brief Represent A Number As Two Square Sum
#define PROBLEM "https://judge.yosupo.jp/problem/two_square_sum"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/number_theory/two_squares.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::math;

void solve() {
	int64_t n;
	cin >> n;
	auto res = two_squares_all(n);
	cout << size(res) << "\n";
	for(auto p: res) {
		cout << p.real() << ' ' << p.imag() << "\n";
	}
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
	while(t--) {
		solve();
	}
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	big2_00	AC	57 ms	4 MB
g++	big2_01	AC	59 ms	4 MB
g++	big2_02	AC	56 ms	4 MB
g++	big_semiprime_random_00	AC	49 ms	4 MB
g++	big_semiprime_random_01	AC	45 ms	4 MB
g++	example_00	AC	5 ms	4 MB
g++	example_01	AC	5 ms	4 MB
g++	fixed_RNG_buster_00	AC	5 ms	4 MB
g++	max_00	AC	11 ms	4 MB
g++	max_01	AC	11 ms	4 MB
g++	max_02	AC	13 ms	4 MB
g++	max_03	AC	13 ms	4 MB
g++	max_04	AC	13 ms	4 MB
g++	num_of_solution_max_00	AC	52 ms	4 MB
g++	num_of_solution_max_01	AC	62 ms	4 MB
g++	power_of_2_3_5_13_00	AC	6 ms	4 MB
g++	power_of_2_3_5_13_01	AC	8 ms	4 MB
g++	power_of_2_3_5_13_02	AC	8 ms	4 MB
g++	power_of_2_3_5_13_03	AC	7 ms	4 MB
g++	prime_1_mod_4_00	AC	14 ms	4 MB
g++	prime_1_mod_4_01	AC	14 ms	4 MB
g++	prime_1_mod_4_02	AC	15 ms	4 MB
g++	prime_3_mod_4_00	AC	5 ms	4 MB
g++	random_00	AC	7 ms	4 MB
g++	random_01	AC	9 ms	4 MB
g++	random_02	AC	10 ms	4 MB
g++	random_03	AC	9 ms	4 MB
g++	random_04	AC	6 ms	4 MB
g++	small_00	AC	5 ms	4 MB
g++	small_01	AC	5 ms	4 MB
g++	small_02	AC	6 ms	4 MB
g++	small_03	AC	6 ms	4 MB
g++	small_04	AC	6 ms	4 MB
g++	smooth_00	AC	10 ms	4 MB
g++	smooth_01	AC	11 ms	4 MB
g++	smooth_02	AC	14 ms	4 MB
g++	smooth_03	AC	22 ms	4 MB
g++	smooth_04	AC	15 ms	4 MB

Back to top page