【UVA – 401】Palindromes【紫书】

【UVA – 401】Palindromes【紫书】

问题链接:https://vjudge.net/problem/UVA-401

udebug数据链接:https://www.udebug.com/UVa/401

C++ solution

#include <iostream>
#include <cstring>
#include <cctype>

using namespace std;

char alpha[] = "A   3  HIL JM O   2TUVWXY5";
char digit[] = "O1SE Z  8 ";

const int LIM = 1000;
char s[LIM];

int main(void) {
    while (gets(s)) {
        //reverse
        int len = strlen(s);
        bool pf = true, mf = true;
        for (int i = 0; i < len; i++) {
            if (!pf && !mf) break;
            //mirror check
            if (isdigit(s[i])) {
                if (s[len - i - 1] != digit[s[i] - '0']) mf = false;
            } else if (isalpha(s[i])) {
                if (s[len - i - 1] != alpha[s[i] - 'A']) mf = false;
            }
            //palindrome check
            if (s[i] != s[len - i - 1]) pf = false;
        }
        printf("%s", s);
        if (pf && mf) printf(" -- is a mirrored palindrome.");
        else if (pf) printf(" -- is a regular palindrome.");
        else if (mf) printf(" -- is a mirrored string.");
        else printf(" -- is not a palindrome.");
        printf("\n\n");
    }
    return 0;
}

 

相关阅读:

《算法竞赛入门经典》(紫书)全AC代码

【UVA – 10082】WERTYU【紫书】

【UVA – 10082】WERTYU【紫书】

问题链接:https://vjudge.net/problem/UVA-10082

udebug数据连接:https://www.udebug.com/UVa/10082

A common typing error is to place the hands on the keyboard one row to the right of the correct position. So ‘Q’ is typed as ‘W’ and ‘J’ is typed as ‘K’ and so on. You are to decode a message typed in this manner.

Input

Input consists of several lines of text. Each line may contain digits, spaces, upper case letters (except Q, A, Z), or punctuation shown above [except back-quote (‘)]. Keys labelled with words [Tab, BackSp, Control, etc.] are not represented in the input.

Output

You are to replace each letter or punction symbol by the one immediately to its left on the ‘QWERTY’ keyboard shown above. Spaces in the input should be echoed in the output.

 

Sample Input
O S, GOMR YPFSU/

Sample Output
I AM FINE TODAY.

 

C++ solution

#include <iostream>

using namespace std;

//start with ';'
const char m[] = ";    M0,.9`12345678 L -   \\VXSWDFGUHJKNBIO EARYCQZT P][";

int main(void) {
    char ch;
    while ((ch = getchar()) != EOF) {
        if (ch == '\n') {
            putchar('\n');
            continue;
        }
        putchar(ch == ' ' ? ' ' : m[ch - '\'']);
    }
    return 0;
}

 

相关阅读:

《算法竞赛入门经典》(紫书)全AC代码

【UVA – 272】TEX Quotes【紫书】

【UVA – 272】TEX Quotes

问题链接:https://vjudge.net/problem/UVA-272

udebug测试数据:https://www.udebug.com/UVa/272

TEX is a typesetting language developed by Donald Knuth. It takes source text together with a few typesetting instructions and produces, one hopes, a beautiful document. Beautiful documents use “ and ” to delimit quotations, rather than the mundane ” which is what is provided by most keyboards. Keyboards typically do not have an oriented double-quote, but they do have a left-single-quote ` and a right-single-quote ‘. Check your keyboard now to locate the left-single-quote key ` (sometimes called the “backquote key”) and the right-single-quote key ‘ (sometimes called the “apostrophe” or just “quote”). Be careful not to confuse the left-single-quote ` with the “backslash” key \. TEX lets the user type two left-single-quotes “ to create a left-double-quote “ and two right-single-quotes ” to create a right-double-quote ”. Most typists, however, are accustomed to delimiting their quotations with the un-oriented double-quote “.
If the source contained “To be or not to be,” quoth the bard, “that is the question.” then the typeset document produced by TEX would not contain the desired form: “To be or not to be,” quoth the bard, “that is the question.”
In order to produce the desired form, the source file must contain the sequence: “To be or not to be,” quoth the bard, “that is the question.”
You are to write a program which converts text containing double-quote (“) characters into text that is identical except that double-quotes have been replaced by the two-character sequences required by TEX for delimiting quotations with oriented double-quotes. The double-quote (“) characters should be replaced appropriately by either “ if the ” opens a quotation and by ” if the ” closes a quotation.
Notice that the question of nested quotations does not arise: The first ” must be replaced by “, the next by ”, the next by “, the next by ”, the next by “, the next by ”, and so on.

Input

Input will consist of several lines of text containing an even number of double-quote (“) characters.
Input is ended with an end-of-file character.

Output

The text must be output exactly as it was input except that:
• the first ” in each pair is replaced by two ` characters: “ and
• the second ” in each pair is replaced by two ‘ characters: ”.
Sample Input
“To be or not to be,” quoth the Bard, “that
is the question”.
The programming contestant replied: “I must disagree.
To `C’ or not to `C’, that is The Question!”
Sample Output
“To be or not to be,” quoth the Bard, “that
is the question”.
The programming contestant replied: “I must disagree.
To `C’ or not to `C’, that is The Question!”

 

C++ solution:

#include <cstdio>
int main() {
    char ch;
    int t = 0;
    while (~(ch = getchar())) {
        if (ch == '"') printf("%s", (t ^= 1) ? "``" : "''");
        else putchar(ch);
    }
    return 0;
}

 

Java solution:

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        char arr[];
        String str;
        int t = 0;
        while (in.hasNext()) {
            str = in.nextLine();        // 注意nextLine()会抛弃每行的\n
            arr = str.toCharArray();
            for (char ch : arr) {
                if (ch == '"') {
                    System.out.print((t ^= 1) == 1 ? "``" : "''");
                } else {
                    System.out.print(ch);
                }
            }
            System.out.println();
        }
    }
}

 

相关阅读:

《算法竞赛入门经典》(紫书)全AC代码