結果
問題 | No.1006 Share an Integer |
ユーザー | ningenMe |
提出日時 | 2020-03-08 04:01:00 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 480 ms / 2,000 ms |
コード長 | 3,342 bytes |
コンパイル時間 | 2,020 ms |
コンパイル使用メモリ | 178,240 KB |
実行使用メモリ | 93,768 KB |
最終ジャッジ日時 | 2024-04-23 19:27:05 |
合計ジャッジ時間 | 7,996 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 64 ms
11,100 KB |
testcase_01 | AC | 84 ms
10,984 KB |
testcase_02 | AC | 88 ms
11,148 KB |
testcase_03 | AC | 81 ms
11,188 KB |
testcase_04 | AC | 65 ms
11,300 KB |
testcase_05 | AC | 66 ms
11,056 KB |
testcase_06 | AC | 66 ms
11,224 KB |
testcase_07 | AC | 65 ms
11,076 KB |
testcase_08 | AC | 67 ms
11,124 KB |
testcase_09 | AC | 65 ms
11,288 KB |
testcase_10 | AC | 66 ms
11,120 KB |
testcase_11 | AC | 289 ms
57,200 KB |
testcase_12 | AC | 444 ms
89,028 KB |
testcase_13 | AC | 471 ms
93,560 KB |
testcase_14 | AC | 466 ms
93,768 KB |
testcase_15 | AC | 412 ms
81,740 KB |
testcase_16 | AC | 232 ms
45,888 KB |
testcase_17 | AC | 286 ms
58,540 KB |
testcase_18 | AC | 410 ms
82,344 KB |
testcase_19 | AC | 400 ms
79,416 KB |
testcase_20 | AC | 452 ms
84,680 KB |
testcase_21 | AC | 480 ms
93,188 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; #define REP(i,n) for(long long i = 0; i < (n); i++) #define FOR(i, m, n) for(long long i = (m);i < (n); ++i) #define ALL(obj) (obj).begin(),(obj).end() #define SPEED cin.tie(0);ios::sync_with_stdio(false); template<class T> using V = vector<T>; template<class T, class U> using P = pair<T, U>; template<class T> using PQ = priority_queue<T>; template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>; constexpr long long MOD = (long long)1e9 + 7; constexpr long long MOD2 = 998244353; constexpr long long HIGHINF = (long long)1e18; constexpr long long LOWINF = (long long)1e15; constexpr long double PI = 3.1415926535897932384626433; template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} void print(void) {cout << endl;} template <class Head> void print(Head&& head) {cout << head;print();} template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} template <class T> inline void chmax(T& a, const T b){a=max(a,b);} template <class T> inline void chmin(T& a, const T b){a=min(a,b);} void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} int main() { int X,M=2000000; cin >> X; vector<int> d(M+1,1); d[1] = 1; for(int i = 2; i <= M; ++i){ for(int j = i; j <= M; j += i){ d[j]++; } } map<int,vector<pair<int,int>>> mp; for(int i = 1; i <= X; ++i){ int A = i, B = X - i; mp[abs(A-B-d[A]+d[B])].push_back({A,B}); } auto v = (*mp.begin()).second; sort(ALL(v)); for(auto& p:v){ cout << p.first << " " << p.second << endl; } return 0; }