結果

問題 No.2109 Special Week
ユーザー tabae326
提出日時 2022-10-28 21:36:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 3,457 bytes
コンパイル時間 4,370 ms
コンパイル使用メモリ 261,200 KB
最終ジャッジ日時 2025-02-08 14:11:44
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using pl = std::pair<long long, long long>;
using mint = atcoder::modint1000000007;
//using mint = atcoder::modint998244353;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define all(v) (v).begin(), (v).end()
#define dump(var) do{ if(debug::enable) { std::cerr << #var << " : "; debug::print(var); } } while(0);
constexpr int di[4] = {1, -1, 0, 0};
constexpr int dj[4] = {0, 0, 1, -1};
constexpr long long inf = 1LL<<60;
template<typename T> inline void chmax(T &a, T b) { a = std::max(a, b); };
template<typename T> inline void chmin(T &a, T b) { a = std::min(a, b); };
template<typename T> void vprint(const std::vector<T>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i] << (i == v.size()-1 ? "\n" : " "); }
    }
template<typename T> void vprintln(const std::vector<T>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i] << "\n"; } }
template<int M> void vprint(const std::vector<atcoder::static_modint<M>>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i].val() << (i == v
    .size()-1 ? "\n" : " "); } }
template<int M> void vprintln(const std::vector<atcoder::static_modint<M>>& v) { for(int i = 0; i < v.size(); i++) { std::cout << v[i].val() << "\n";
    } }
namespace debug {
#if defined(ONLINE_JUDGE)
const bool enable = false;
#else
const bool enable = true;
#endif
template<typename T> void push(const T& e) { std::cerr << e; }
template<int M> void push(const atcoder::static_modint<M>& e) { std::cerr << e.val(); }
template<typename T1, typename T2> void push(const std::pair<T1, T2>& e) { std::cerr << "("; push(e.first); std::cerr << ","; push(e.second); std
        ::cerr << ")"; }
template<typename T1, typename T2, typename T3> void push(const std::tuple<T1, T2, T3>& e) { std::cerr << "("; push(get<0>(e)); std::cerr << ",";
        push(get<1>(e)); std::cerr << ","; push(get<2>(e)); std::cerr << ")"; }
template<typename T> void print(const T& e) { push(e); std::cerr << "\n"; }
template<typename T> void print(const std::vector<T>& v) { for(int i = 0; i < v.size(); i++) { push(v[i]); std::cerr << " "; } std::cerr << "\n";
        }
template<typename T> void print(const std::vector<std::vector<T>>& v) { std::cerr << "\n"; for(int i = 0; i < v.size(); i++) { std::cerr << i << "
        : "; print(v[i]); } }
};
std::string zfill(const std::string s, size_t size) {
assert(s.size() <= size);
std::string res = std::string(size - s.size(), '0') + s;
return res;
}
std::string zfill(const long long n, size_t size) {
return zfill(std::to_string(n), size);
}
using date = tuple<ll,ll,string>;
date add(date x, ll diff) {
const ll days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
auto [month, day, _] = x;
day += diff;
if(day > days[month]) {
month++;
day = 1;
if(month > 12) month = 1;
}
string s = zfill(month, 2) + "/" + zfill(day, 2);
return date({month, day, s});
}
void solve() {
ll m, d, k;
cin >> m >> d >> k;
date now = date({m, d, ""});
set<char> st;
rep(i, 0, 7) {
now = add(now, i != 0);
auto s = get<2>(now);
for(auto e : s) st.insert(e);
}
cout << (st.size() > k ? "Yes" : "No") << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0