Submission #10382014


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF 2147483647//int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;


int main(){
    string s;
    cin >> s;
    int n = s.length();
    int c_count = 0;
    int large = 0;
    rep(i,n){
        if(i != 0 && s[i] <= 90 && s[i] != 'C')large ++;
    }
    for(int i=2;i<n-1;i++){
        if(s[i] == 'C')c_count++;
    }

    if(s[0] != 'A'){
        cout << "WA" << endl;
    }else if (large == 0 && c_count == 1)
    {
        cout << "AC" << endl;
    }else {
        cout << "WA" << endl;
    }
    
    
    return 0;
}

/*
やっほい!
       やほほい!
    +    *
    ∧∧  . ∧∞∧ *
* ヽ(=´ω`)人(´ω`*)ノ
 .~( O x.) (   O)~ +
。*   ∪    ∪
*/ 

Submission Info

Submission Time
Task B - AcCepted
User spady
Language C++14 (GCC 5.4.1)
Score 200
Code Size 922 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 5
AC × 16
Set Name Test Cases
Sample a01, a02, a03, a04, a05
All a01, a02, a03, a04, a05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16
Case Name Status Exec Time Memory
a01 AC 1 ms 256 KB
a02 AC 1 ms 256 KB
a03 AC 1 ms 256 KB
a04 AC 1 ms 256 KB
a05 AC 1 ms 256 KB
b06 AC 1 ms 256 KB
b07 AC 1 ms 256 KB
b08 AC 1 ms 256 KB
b09 AC 1 ms 256 KB
b10 AC 1 ms 256 KB
b11 AC 1 ms 256 KB
b12 AC 1 ms 256 KB
b13 AC 1 ms 256 KB
b14 AC 1 ms 256 KB
b15 AC 1 ms 256 KB
b16 AC 1 ms 256 KB