Football (aka Soccer) （正则输入、排序）

题目链接：Football (aka Soccer) UVA - 10194

---

题目大意：对于所给的输入进行处理后，按照得分高、胜场高、净进球数搞、进球数高、参与场次少以及队名字典序的优先顺序将各球队按照给定格式输出。

---

代码是转大佬的，但是其中有些东西不错，特此记录！！！
一、输入格式
scanf()的一些特殊用法：

• “%ns”,n为整数,读入的字符串最长不超过n,然后在末尾补‘\0’。
• %nf 读入的浮点数最多有n位整数,位数多于n,会截断。
• “%n[a-z]” 读入最多n个字符,如果遇到非a-z的字符,停止。
• %[^=]” 读入任意多的字符,直到遇到”=”停止。
• “%n[^=]” 读入”=”号前的至多n 个字符。
• “*”表示该输入项读入后不赋予任何变量，即跳过该输入值。
  比如%[0-9]表示只读入’0’到’9’之间的字符，%[a-zA-Z]表示只读入字母，
  ‘-‘是范围连接符，也可以直接列出你需要读入的字符。

#include<iostream>

using namespace std;

char str1[1000],str2[1000],str3[1000],str4[1000];

int main()
{
    scanf("%[^\n]", str1);
    scanf("%[^#]", str2);
    scanf("%*[^\n]", str3);
    scanf("%*[^#]", str4);

    cout << str1 << str2 << str3 << str4 << endl;

    return 0;
}

输入：

You are my friend
Are you sure?\n# 
Are you ok?
Can you speak English?
No, I can't. #

输出

You are my friend
Are you sure?\n

二、函数strcasecmp()可以忽略大小写对字符串进行比较。

---

完整代码如下：

#include <bits/stdc++.h>

using namespace std;

const int N=100;
const int M=30;

struct Node{
    char name[M+5];
    int point,wins,losses,ties,scored,against;
};

bool cmp(const Node& a,const Node& b)
{
    if(a.point!=b.point)
        return a.point>b.point;

    if(a.wins!=b.wins)
        return a.wins>b.wins;

    if((a.scored-a.against)!=(b.scored-b.against))
        return (a.scored-a.against)>(b.scored-b.against);

    if(a.scored!=b.scored)
        return a.scored>b.scored;

    if((a.wins+a.ties+a.losses)!=(b.wins+b.ties+b.losses))
        return (a.wins+a.ties+a.losses)<(b.wins+b.ties+b.losses);


    return strcasecmp(a.name,b.name)<0;
}

int main()
{
    int n,t,g;
    char name[N+5];

    scanf("%d",&n);
    getchar();

    while(n--)
    {
        Node team[M+5];

        scanf("%[^\n]",name);
        scanf("%d",&t);
        getchar();

        memset(team,0,sizeof(team[0])*t);

        for(int i=0;i<t;i++)
            scanf("%[^\n]\n",team[i].name);

        scanf("%d",&g);
        getchar();

        char name1[M+5],name2[M+5];
        int s1,s2,t1=0,t2=0;

        while(g--)
        {
            scanf("%[^#]#%d@%d#%[^\n]",name1,&s1,&s2,name2);
            getchar();

            for(int i=0;i<t;i++)
            {
                if(strcmp(name1,team[i].name)==0)
                    t1=i;

                if(strcmp(name2,team[i].name)==0)
                    t2=i;
            }

            team[t1].scored+=s1;
            team[t1].against+=s2;
            team[t2].scored+=s2;
            team[t2].against+=s1;

            if(s1>s2)
            {
                team[t1].point+=3;
                team[t1].wins++;
                team[t2].losses++;
            }

            else if(s1<s2)
            {
                team[t2].point+=3;
                team[t1].losses++;
                team[t2].wins++;
            }

            else
            {
                team[t1].point++;
                team[t2].point++;
                team[t1].ties++;
                team[t2].ties++;
            }
        }

        sort(team,team+t,cmp);

        printf("%s\n",name);
        for(int i=0;i<t;i++)
        {
            printf("%d)",i+1);
            printf(" %s ",team[i].name);
            printf("%dp, ",team[i].point);
            printf("%dg ",team[i].wins+team[i].ties+team[i].losses);
            printf("(%d-%d-%d),",team[i].wins,team[i].ties,team[i].losses);
            printf(" %dgd ",team[i].scored-team[i].against);
            printf("(%d-%d)\n",team[i].scored,team[i].against);
        }

        if(n)
            printf("\n");
    }

    return 0;
}