結果
問題 | No.2479 Sum of Squares |
ユーザー |
|
提出日時 | 2024-03-26 22:38:47 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,789 bytes |
コンパイル時間 | 3,295 ms |
コンパイル使用メモリ | 229,660 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-09-30 14:27:01 |
合計ジャッジ時間 | 4,185 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
コンパイルメッセージ
main.cpp: In function 'void in(T& ...)': main.cpp:18:53: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 18 | template<class... T>void in(T&... a){(cin >> ... >> a);} | ^ main.cpp: In function 'void out(const T&, const Ts& ...)': main.cpp:19:100: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 19 | template<class T, class... Ts>void out(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << '\n';} | ^~~
ソースコード
#include<bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;using vst = vector<string>;using ll = long long;using ld = long double;using pll = pair<ll,ll>;using vll = vector<ll>;using vvll = vector<vll>;#define rep(i, n) for (ll i = 0; i < n; i++)#define repp(i,k,n) for (ll i = k; i < n; i++)#define per(i,s,e) for(ll i = s; i >= e; i--)#define all(v) v.begin(),v.end()#define no() {cout << "No" << endl; return 0;}#define yes(){cout << "Yes" << endl;return 0;}#define CHECK(a) a ? cout << "Yes" << endl : cout << "No" << endl#define MODD 998244353LL#define MOD 1000000007LL#define UNOmap unordered_map#define UNOset unordered_set#define ASC(T) T,vector<T>,greater<T>#define join(G,a,b) G[a].push_back(b);G[b].push_back(a);template<class... T>void in(T&... a){(cin >> ... >> a);}template<class T, class... Ts>void out(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << '\n';}void vin(vll &v){for(ll i = 0; i < (ll)v.size(); i++)in(v[i]);}void vout(vll &v){for(ll i = 0; i < (ll)v.size(); i++) cout << v[i] << ' ';}ll INF = 1LL << 62;// #include<boost/multiprecision/cpp_int.hpp>// using namespace boost::multiprecision;// using mint = modint998244353;// using mint = modint1000000007;//using mint = modint;// cout << fixed << setprecision(15);//----------------------------------------------int main(){ll N;in(N);vll ans;while(N){ll left = 1;ll right = 1e9;while(left + 1 != right){ll mid = (left + right)/2;// out(left,mid,right);if(mid*mid <N) left = mid;else right = mid;}ans.push_back(left*left);N -= left*left;}out(ans.size());for(auto a : ans){cout << a << ' ';}}