提出 #68785856

---

ソースコード 拡げる

// B87678

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <map>
#include <unordered_map>
#include <tuple>
#include <set>
#include <bitset>
#include <queue>
#include <cstring>
#include <fstream>
#include <cmath>
#include <climits>
#include <numeric>
#include <sstream>
#include <iomanip>
#include <limits>
#define MAX 1000000000
using namespace std;
#define ll long long
#define pii pair<int, int>
#define all(v) ((v).begin()), ((v).end())
#define sz(v) (int)((v).size())
#define inc(i, n) for (int i = 0; i < n; ++i)
#define dec(i, n) for (int i = n; i >= 0; --i)
#define pb emplace_back
const int mod = 998244353;
const int modi = 1000000007;
const int inv2 = 499122177;
const int N = 200000;

vector<vector<ll> > out;

// vector<vector<int> > factors;
// vector<int> dx, dy;

// bool toggle;

// bool check(int i, int j, int &h, int &w, vector<string> &maze){
//     if(i<h&&j<w&&i>=0&&j>=0){
//         if(toggle){
//             if(maze[i][j] == 'x' || maze[i][j] == '.' || maze[i][j] == 'S' || maze[i][j] == 'G' || maze[i][j] == '?') return true; 
//         }else{
//             if(maze[i][j] == 'o' || maze[i][j] == '.' || maze[i][j] == 'S' || maze[i][j] == 'G' || maze[i][j] == '?') return true; 
//         }
//     }
//     return false;
// }

// void build(void){


// }


// int rec()

void solve()    // ifstream &infile
{   
    ll x; cin >> x;
    // 4X-1
    bool neg = false;
    x *= 4;
    if(x < 0){
        x = -x;
        x++;
        neg = true;
    }else{
        x--;
    }

    // cout << "x is " << x << "\n";

    vector<ll> ans;
    if(!neg){
        for(int i = 1; i <=2*1e7+1; i+=2){
            if(x%i == 0){
                if(x/i >= i){
                    ll m1 = (x/i - i)/2;
                    ll m2 = -m1;
                    m1--; m2--;
                    m1 /= 2; m2 /= 2;
                    ans.pb(m1); ans.pb(m2);
                } 
            }
        }
    }else{
        for(int i = 1; i <=2*1e7+1; i+=2){
            if(x%i == 0){
                if(x/i >= i){
                    ll m1 = (x/i + i)/2;
                    ll m2 = -m1;
                    m1--; m2--;
                    m1 /= 2; m2 /= 2;
                    ans.pb(m1); ans.pb(m2);
                } 
            }
        }
    }
    sort(all(ans));
    cout << sz(ans) << "\n";
    out.pb(ans);
    return;
}

signed main()
{
    // ifstream infile("aoc_in.txt"); // Open the input file
    // if (!infile) {
    //     cerr << "Error: Unable to open input file!" << "\n";
    //     return 1; // Exit with an error code if the file can't be opened
    // }
    // dx = {1, 0, -1, 0};
    // dy = {0, 1, 0, -1};

    // factors.resize(10000001);
    int t;
    t = 1;
    // cin >> t;
    while (t--){
        solve();
    }

    for (auto &x : out) {
        // cout << fixed << setprecision(10) << x << "\n";
        for(auto &y : x) cout << y << " ";
        // cout << "\n";
        // cout << x << " ";
    }
    // infile.close();
    return 0;
}





/*

Precision:

#include <iostream>
#include <iomanip>
using namespace std;
int main() {
double p = 5, q = 7;
double prob = p / q;
cout << fixed << setprecision(6) << prob << endl;
return 0;
}

Inverse:

const long long MOD = 1e9 + 7 ;
long long modpow( long long a , long long b) {
long long r e s = 1 ;
a %= MOD;
while (b > 0) {
i f (b & 1) r e s = ( r e s ∗ a ) % MOD;
a = ( a ∗ a ) % MOD;
b >>= 1 ;
}
return r e s ;
}
long long modinv ( long long q ) {
return modpow(q , MOD− 2 ) ;
}
// long long ans = (p ∗ modinv ( q ) ) % MOD;

*/

提出情報

ジャッジ結果