結果
問題 | No.2479 Sum of Squares |
ユーザー |
|
提出日時 | 2023-12-28 00:41:43 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,817 bytes |
コンパイル時間 | 1,688 ms |
コンパイル使用メモリ | 170,168 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-27 15:37:05 |
合計ジャッジ時間 | 3,158 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)#define pb push_back#define int long long#define ll long long#define ld long double#define rep(i, n) for (ll i=0; i<n; i++)#define repi(i, n) for (ll i=1; i<=n; i++)#define repi1(i, n) for (ll i = n; i >=0; i--)#define mem(v, ha) memset(v, ha, sizeof(v))#define all(a) a.begin(), a.end()#define allr(a) a.rbegin(), a.rend()#define CLOCK cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";typedef vector<ll> vi;typedef vector<vector<int>> vvi;typedef vector<pair<ll, ll>> vpi;typedef vector<char> vc;#define no cout << "NO\n"#define yes cout << "YES\n"#define mp make_pair#define ff first#define ss secondconst ll mod = 1e9 + 7;//const ll mod = 998244353 ;const long double PI = 3.141592653589793238460;const int inf = (int)(1e9);template<typename T> istream& operator>>(istream& in, vector<T>& a) {for (auto &x : a) in >> x; return in;};template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for (auto &x : a) out << x << ' '; return out;};// auto sum=[&](int use, int y){return use+y;};// function <void(int)>dfs=[&](int u)//void is the return type, int is the argumenconst int N = 2e5 + 5;// int s[N];// vector<int> g[N];int func(int n){int l = 0, r = 1e9;int ans = 0;while (l <= r){int m = (l + r) / 2;if (m * m > n){r = m - 1;}else {ans = m * m;l = m + 1;}}return ans;}void solve(){int n;cin >> n;vi ans;while (n){int sub = func(n);ans.pb(sub);n -= sub;}cout << ans.size() << '\n';for (auto l : ans)cout << l << " ";cout << '\n';}int32_t main(){fast_io;int T = 1;// cin >> T;while (T--){solve();}}