Submission #59154746


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> p_ll;
#define all(vec) vec.begin(), vec.end()
#define repr(i,from,to) for (ll i=from; i<to; ++i)
#define rep(i,N) repr(i,0,N)
#define per(i,N) for(ll i=N-1; i>=0; --i)
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }

const ll INF = (1ll<<61)-1;
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }

// --------------------------------------------
// mod
// --------------------------------------------
const ll MOD = 998244353;
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll mpow(ll n, ll p, ll m=MOD) { ll result = 1; for (ll i=1; i<=p; i=i<<1) { if (p&i) result = result*n%m; n = n*n%m; } return result; }
ll madd(ll x, ll y, ll m=MOD) { return (x+y)%m; }
ll msub(ll x, ll y, ll m=MOD) { return (x-y+m)%m; }
ll mmul(ll x, ll y, ll m=MOD) { return x*y%m; }
ll mdiv(ll x, ll y, ll m=MOD) { return mmul(x, inv(y)); }

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll nck(ll n, ll k) { return mdiv(fac[n], mmul(fac[k],fac[n-k])); }


int main() {
  string S; cin >> S;
  sort(all(S));
  string result = S == "ABC" ? "Yes" : "No";
  cout << result << endl;
  return 0;
}

Submission Info

Submission Time
Task A - Rearranging ABC
User sak
Language C++ 20 (gcc 12.2)
Score 100
Code Size 1459 Byte
Status AC
Exec Time 1 ms
Memory 3680 KiB

Compile Error

Main.cpp: In function ‘ll mdiv(ll, ll, ll)’:
Main.cpp:25:24: warning: unused parameter ‘m’ [-Wunused-parameter]
   25 | ll mdiv(ll x, ll y, ll m=MOD) { return mmul(x, inv(y)); }
      |                     ~~~^~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 18
Set Name Test Cases
Sample 00_sample_00_BAC.txt, 00_sample_01_AAC.txt, 00_sample_02_ABC.txt, 00_sample_03_ARC.txt
All 00_sample_00_BAC.txt, 00_sample_01_AAC.txt, 00_sample_02_ABC.txt, 00_sample_03_ARC.txt, 01_random_00_ACB.txt, 01_random_01_BCA.txt, 01_random_02_CAB.txt, 01_random_03_CBA.txt, 01_random_04_ACA.txt, 01_random_05_BAA.txt, 01_random_06_JCA.txt, 01_random_07_KNA.txt, 01_random_08_MZA.txt, 01_random_09_YGA.txt, 02_sum_00_AAD.txt, 02_sum_01_BBB.txt, 03_xor_00_AFG.txt, 03_xor_01_ZOU.txt
Case Name Status Exec Time Memory
00_sample_00_BAC.txt AC 1 ms 3540 KiB
00_sample_01_AAC.txt AC 1 ms 3488 KiB
00_sample_02_ABC.txt AC 1 ms 3488 KiB
00_sample_03_ARC.txt AC 1 ms 3496 KiB
01_random_00_ACB.txt AC 1 ms 3488 KiB
01_random_01_BCA.txt AC 1 ms 3476 KiB
01_random_02_CAB.txt AC 1 ms 3528 KiB
01_random_03_CBA.txt AC 1 ms 3536 KiB
01_random_04_ACA.txt AC 1 ms 3484 KiB
01_random_05_BAA.txt AC 1 ms 3604 KiB
01_random_06_JCA.txt AC 1 ms 3680 KiB
01_random_07_KNA.txt AC 1 ms 3604 KiB
01_random_08_MZA.txt AC 1 ms 3472 KiB
01_random_09_YGA.txt AC 1 ms 3604 KiB
02_sum_00_AAD.txt AC 1 ms 3608 KiB
02_sum_01_BBB.txt AC 1 ms 3480 KiB
03_xor_00_AFG.txt AC 1 ms 3472 KiB
03_xor_01_ZOU.txt AC 1 ms 3524 KiB