Sanat

input/code.cpp: In function 'bool contains(std::string, std::string)':
input/code.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<s.size()-pattern.size()+1; i++)
                   ^
input/code.cpp: In function 'int max_k(std::string)':
input/code.cpp:41:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<s.size(); i++){
                   ^
input/code.cpp: In function 'int max_v(std::string)':
input/code.cpp:57:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<s.size(); i++){
                   ^
input/code.cpp: In function 'int main()':
input/code.cpp:103:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<str.size(); i++)
                       ^
input/code.cpp:116:23: warning: comparison between signed and unsigned integer expressions [-Wsig...

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <unordered_set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <fstream>
#include <set>
#include <map>

#define MOD 1000000007
#define ll long long
//#define N (1<<50)
#define float double
#define str string

using namespace std;

bool vokaali(char c){
    return (c=='a')||(c=='e')||(c=='i')||(c=='o')||(c=='u')||(c=='y');
}

bool contains(string s, string pattern){
    if(pattern.size()>s.size())
        return false;
    for(int i=0; i<s.size()-pattern.size()+1; i++)
        if(s.substr(i,pattern.size())==pattern)
            return true;
    return false;
}

int max_k(string s){
    int M=0;
    int cur=0;

    for(int i=0; i<s.size(); i++){
        if(vokaali(s[i]))
            cur=0;
        else{
            cur++;
            M=max(M,cur);
        }
    }
    return M;
}


int max_v(string s){
    int M=0;
    int cur=0;

    for(int i=0; i<s.size(); i++){
        if(!vokaali(s[i]))
            cur=0;
        else{
            cur++;
            M=max(M,cur);
        }
    }
    return M;
}

char ps[256],pe[256];

int main(){
    pe['q']+=5;
    pe['w']+=5;
    pe['d']+=1;
    pe['f']+=1;
    pe['g']+=1;
    pe['z']+=5;
    pe['x']+=5;
    pe['c']+=5;
    pe['b']+=1;

    cin.sync_with_stdio(false);
    int n=0;
    cin>>n;

    for(int i=0; i<n; i++){
        int s=0,e=0;
        string str;
        cin>>str;
        int l=str.size();

        if(vokaali(str[l-1]))
            s+=5;
        else
            e+=5;

        if(!vokaali(str[str.size()-1])&&!vokaali(str[str.size()-2]))
            e+=10;

        if(max_k(str)>=4)
            e+=10;

        int vc=0;
        for(int i=0; i<str.size(); i++)
            if(vokaali(str[i]))
                vc++;

        if(vc*1./str.size()>0.44)
            s++;

        if(max_v(str)>=2)
            s+=5;

        if(contains(str, "y")&&(contains(str,"a")||contains(str,"o")))
            e+=10;

        for(int i=0; i<str.size(); i++)
            e+=pe[str[i]];

        for(int i=0; i<str.size()-1; i++){
            if(!vokaali(str[i])&&str[i+1]=='h')
                e+=5;
        }

        if(contains(str,"sp"))
            e+=10;


        if(e>=s)
            cout<<"QAQ"<<endl;
        else
            cout<<"10-4"<<endl;
    }
    return 0;
}

Test 1

Verdict: ACCEPTED