Gym - 101190A Abbreviation(아날로그)

4675 단어 CodeForces
원제:
ACM ICPC 2016–2017, Northeastern European Regional Contest.St. Petersburg – Barnaul – Tbilisi – Almaty, December 4, 2016Problem A. AbbreviationInput file: abbreviation.inOutput file: abbreviation.outAn abbreviation (from Latin brevis, meaning short) is a shortened form of a word or phrase. In thisproblem you must write an automated tool that replaces a sequence of capitalized words with the corresponding abbreviation that consists of the first upper case letters only, followed by a full definition inparenthesis. See sample input and output.Let us make some formal definitions. A word in a text is a maximally long sequence of lower and uppercase English letters. A capitalized word is a word that consists of an upper case letter followed by oneor more lower case letters. For example, “Ab”, “Abc”, “Abcd”, and “Abcde“are all capitalized words,while “ab”, “A”, “AB“, “ABc“and “AbC“are not.An abbreviatable sequence of words is a sequence of two or more capitalized words that are separated byexactly one space, no line breaks or punctuation are allowed inside it.An abbreviation of an abbreviatable sequence of words is a sequence of the first (upper case) letters ofeach word, followed by a single space, an opening parenthesis, the original abbreviatable sequence, anda closing parenthesis.InputThe input file consists of up to 1 000 lines of text with up to 120 characters on each line. Each lineconsists of spaces, upper and lower case letters, commas or dots. There are no leading or trailing spaceson lines and there are no empty lines. There is at least one line in the input file.OutputWrite to the output file the original text with every abbreviatable sequence of words replaced with thecorresponding abbreviation.Examplesabbreviation.inThis is ACM North Eastern European Regional Contest,sponsored by International Business Machines.The. Best. Contest. Ever.A Great Opportunity for all contestants.abbreviation.outThis is ACM NEERC (North Eastern European Regional Contest) ,sponsored by IBM (International Business Machines).The. Best. Contest. Ever.A GO (Great Opportunity) for all contestants.abbreviation.inab Ab A Abc AB Abcd ABc Abcde AbCabbreviation.outab Ab A Abc AB Abcd ABc Abcde AbCabbreviation.inOh No Extra Spaces.And,Punctuation Ruin Everythingabbreviation.outOh No ES (Extra Spaces).And, PRE(Punctuation Ruin Everything):
요구에 따라 일부분을 줄임말로 바꾸는 일련의 문자를 주다
제목에 따라 시뮬레이션을 하면 돼요.
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define pi acos(-1.0)
#define INF 2147483647
using namespace std;
typedef long long ll;
typedef pair  P;
char s[130];
int main ()
{
    freopen("abbreviation.in", "r", stdin);
    freopen("abbreviation.out", "w", stdout);
    while(gets(s))
    {
        int len=strlen(s);
        string suo,yuan,ss;
        for(int i=0; i='a'&&s[i]<='z')||(s[i]>='A'&&s[i]<='Z')&&i='A'&&s[i]<='Z')
                    big++;
                else
                    little++;
                ab+=s[i];
                i++;
            }
            int num1=0,num2=0;
            bool ins=false;
            while(!(s[i]>='a'&&s[i]<='z')&&!(s[i]>='A'&&s[i]<='Z')&&i='A'&&ab[0]<='Z')&&big==1&&little>=1)
            {
                suo+=ab[0];
                yuan+=ab;
            }
            else
            {
                if(suo.size()>1)
                {
                    int len1=yuan.size();
                    cout<1||ins||i==len)
            {
                if(suo.size()>1)
                {
                    cout<0; k--)
                        cout<

좋은 웹페이지 즐겨찾기