結果

問題 No.2109 Special Week
ユーザー karinohitokarinohito
提出日時 2022-12-15 01:33:55
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,006 bytes
コンパイル時間 2,279 ms
コンパイル使用メモリ 201,392 KB
最終ジャッジ日時 2025-02-09 12:03:11
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 33 WA * 4
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
using vvvvvvll = vector<vvvvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vvvvd = vector<vvvd>;
using vvvvvd = vector<vvvvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;
template<class T>
bool chmax(T& p, T q, bool C = 1) {
if (C == 0 && p == q) {
return 1;
}
if (p < q) {
p = q;
return 1;
}
else {
return 0;
}
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
if (C == 0 && p == q) {
return 1;
}
if (p > q) {
p = q;
return 1;
}
else {
return 0;
}
}
ll gcd(ll(a), ll(b)) {
if (a == 0)return b;
if (b == 0)return a;
ll c = a;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
ll sqrtz(ll N) {
ll L = 0;
ll R = sqrt(N) + 10000;
while (abs(R - L) > 1) {
ll mid = (R + L) / 2;
if (mid * mid <= N)L = mid;
else R = mid;
}
return L;
}
/*
using mint = modint998244353;
//using Mint = modint;
vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
fact.resize(n + 5);
factinv.resize(n + 5);
inv.resize(n + 5);
fact[0] = fact[1] = 1;
factinv[0] = factinv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < n + 5; i++) {
fact[i] = (fact[i - 1] * i);
inv[i] = mod - (inv[mod % i] * (mod / i));
factinv[i] = (factinv[i - 1] * inv[i]);
}
}
mint nCk(ll n, ll k) {
if (n < k || k < 0) return 0;
return fact[n] * (factinv[k] * factinv[n - k]);
}
*/
template<class T>
vector<vector<T>> mul(vector<vector<T>> A, vector<vector<T>> B) {
ll N = A.size();
vector<vector<T>> res(N, vector<T>(N, 0));
rep(i, N)rep(j, N)rep(k, N) {
res[i][j] += A[i][k] * B[k][j];
}
return res;
}
ll A,B,C,D;
bool SM(){
return A==C&&B==D;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll M,D,K;
cin>>M>>D>>K;
set<char> C;
rep(i,7){
string m=to_string(M);
if(m.size()<2)m='0'+m;
for(char c:m)C.insert(c);
m=to_string(D);
if(m.size()<2)m='0'+m;
for(char c:m)C.insert(c);
D++;
if(M==2&&D==29){
D=1;
M++;
}
else if(M==4||M==6||M==9||M==11){
D=1;
M++;
}
if(M==13){
M=1;
}
}
cout<<(C.size()>=K?"Yes":"No")<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0