結果
問題 | No.687 E869120 and Constructing Array 1 |
ユーザー |
![]() |
提出日時 | 2018-05-18 22:21:44 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 1,789 bytes |
コンパイル時間 | 786 ms |
コンパイル使用メモリ | 102,516 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-28 13:49:14 |
合計ジャッジ時間 | 1,358 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 6 |
ソースコード
# include <iostream># include <algorithm># include <vector># include <string># include <set># include <map># include <cmath># include <iomanip># include <functional># include <utility># include <stack># include <queue># include <list># include <tuple># include <unordered_map># include <numeric># include <complex># include <bitset># include <random># include <chrono># include <cstdlib># include <tuple># include <array>using namespace std;using LL = long long;using ULL = unsigned long long;constexpr int INF = 2147483647;constexpr int HINF = INF / 2;constexpr double DINF = 100000000000000000.0;constexpr double HDINF = 50000000000000000.0;constexpr long long LINF = 9223372036854775807;constexpr long long HLINF = 4500000000000000000;const double PI = acos(-1);template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()# define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)# define RFOR(i,tptpt,ypypy) for(LL i=(tptpt);i>=(ypypy);i--)# define REP(i,upupu) FOR(i,0,upupu)# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)int main() {int n;cin >> n;if (n <= 11) {cout << 1 << " " << n - 1 << endl;}else {cout << 10 << " " << n - 10 << endl;}}