結果
問題 | No.438 Cwwプログラミング入門 |
ユーザー |
![]() |
提出日時 | 2016-10-29 00:17:14 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,468 bytes |
コンパイル時間 | 1,567 ms |
コンパイル使用メモリ | 125,964 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-24 22:24:53 |
合計ジャッジ時間 | 5,137 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 94 RE * 4 |
ソースコード
#include <cctype>#include <cerrno>#include <cfloat>#include <ciso646>#include <climits>#include <clocale>#include <cmath>#include <csetjmp>#include <csignal>#include <cstdarg>#include <cstddef>#include <cstdio>#include <cstdlib>#include <cstring>#include <ctime>// C++#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <exception>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <locale>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <typeinfo>#include <utility>#include <valarray>#include <vector>#include <unordered_set>#include <unordered_map>using namespace std;#define all(c) ((c).begin()), ((c).end())#define dump(c) cerr << "> " << #c << " = " << (c) << endl;#define iter(c) __typeof((c).begin())#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)#define REP(i, a, b) for (int i = a; i < (int)(b); i++)#define rep(i, n) REP(i, 0, n)#define mp make_pair#define fst first#define snd second#define pb push_back#define debug(fmt, ...) \fprintf( stderr, \fmt "\n", \##__VA_ARGS__ \)typedef unsigned int uint;typedef long long ll;typedef unsigned long long ull;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<vll> vvll;typedef vector<vi> vvi;typedef vector<double> vd;typedef vector<vd> vvd;typedef vector<string> vs;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const int INF = 1 << 30;const double EPS = 1e-10;double zero(double d) {return d < EPS ? 0.0 : d;}template<class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template<class T>bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2> &p) {return os << '(' << p.first << ',' << p.second << ')';}template<typename T>ostream &operator<<(ostream &os, const vector<T> &a) {os << '[';rep(i, a.size()) os << (i ? " " : "") << a[i];return os << ']';}string toString(int i) {stringstream ss;ss << i;return ss.str();}const int MOD = 1000000007;// a^kll fpow(ll a, ll k, int M) {ll res = 1ll;ll x = a;while (k != 0) {if ((k & 1) == 1)res = (res * x) % M;x = (x * x) % M;k >>= 1;}return res;}struct prepare {prepare() {cout.setf(ios::fixed, ios::floatfield);cout.precision(8);ios_base::sync_with_stdio(false);}} _prepare;int gcd(int a, int b) {if (b == 0)return a;return gcd(b, a % b);}int main() {int x, y, z;cin >> x >> y >> z;if(z == 0) {cout << "ccW" << endl;return 0;}int d = gcd(x, y);if (z % d != 0) {cout << "mourennaihasimasenn" << endl;return 0;}const int LIM = 10000;const int MAX_N = LIM + 10;ll ans = MAX_N;pii ans_xy = mp(0, 0);REP(i, -MAX_N, MAX_N) {ll xn = (ll) x * i;ll z_xn = (ll) z - xn;if (z_xn % y == 0) {ll m = z_xn / y;if (chmin(ans, abs(i) + abs(m)))ans_xy = mp(i, m);}}if (ans > LIM) {cout << "mourennaihasimasenn" << endl;return 0;}int n = ans_xy.first;int m = ans_xy.second;stringstream ss;rep(i, abs(n)) ss << "c";rep(i, abs(n) - 1) ss << "C";rep(i, abs(m)) ss << "w";rep(i, abs(m) - 1) ss << "C";if(n == 0 || m == 0) {if(n < 0 || m < 0) {ss << "ccW";ss << "W";}}else {if (m < 0) {ss << "ccW";ss << "W";}if (n < 0) {ss << "W";} else {ss << "C";}}string a = ss.str();if(a.size() > LIM) {cout << "mourennaihasimasenn" << endl;return 0;}cout << a << endl;return 0;}