Submission #999910


Source Code Expand

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
bool mirror(const char &a,const char &b);
int main()
{
    char s[100000];
    scanf("%s",&s);
        int i ;
        int l = strlen(s);
        int mk = 0 ;
    for(i = 0 ;i < l/2 ;i++)
    {
        bool k  = mirror(s[i],s[l-i-1]);
        if(!k||l%2!=0)
        {
            cout << "No\n";
            mk = 1;
            break;
        }
    }


    if(i == l/2)
    {
        cout << "Yes\n";
    }
    else
    {
        if(mk == 0)
        {
            cout << "No\n";
        }

    }
    return 0;
}

bool mirror(const char &a,const char &b)
{
    if((a == 'b' && b == 'd') ||(a == 'd' && b == 'b')
       || (a == 'p' && b == 'q') ||(a == 'q' && b == 'p'))
    {
        return true;
    }
    else
    {
        return false;
    }
}

Submission Info

Submission Time
Task B - Mirror String
User ghostxiu
Language C++14 (GCC 5.4.1)
Score 100
Code Size 875 Byte
Status AC
Exec Time 3 ms
Memory 384 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:18: warning: format ‘%s’ expects argument of type ‘char*’, but argument 2 has type ‘char (*)[100000]’ [-Wformat=]
     scanf("%s",&s);
                  ^
./Main.cpp:9:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",&s);
                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 21
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 3 ms 256 KiB
sample_02.txt AC 2 ms 256 KiB
subtask1_01.txt AC 3 ms 256 KiB
subtask1_02.txt AC 3 ms 384 KiB
subtask1_03.txt AC 3 ms 256 KiB
subtask1_04.txt AC 3 ms 256 KiB
subtask1_05.txt AC 3 ms 384 KiB
subtask1_06.txt AC 3 ms 256 KiB
subtask1_07.txt AC 3 ms 256 KiB
subtask1_08.txt AC 3 ms 256 KiB
subtask1_09.txt AC 3 ms 256 KiB
subtask1_10.txt AC 3 ms 384 KiB
subtask1_11.txt AC 3 ms 384 KiB
subtask1_12.txt AC 3 ms 384 KiB
subtask1_13.txt AC 3 ms 384 KiB
subtask1_14.txt AC 3 ms 384 KiB
subtask1_15.txt AC 3 ms 384 KiB
subtask1_16.txt AC 3 ms 384 KiB
subtask1_17.txt AC 3 ms 384 KiB
subtask1_18.txt AC 3 ms 384 KiB
subtask1_19.txt AC 3 ms 384 KiB