计算机学院大学生程序设计竞赛(2015’12) 1001 The Country List

#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;

char s[100+10][20+10];
int n;
map<string ,int>m;

int main()
{
    while(~scanf("%d",&n)){
    for(int i=0;i<n;i++) scanf("%s",s[i]);
    m.clear();
    for(int i=0;i<n;i++)
    {
        int len=strlen(s[i]);
        for(int j=0;j<len;j++)
        {
            if(s[i][j]>=‘A‘&&s[i][j]<=‘Z‘) s[i][j]=s[i][j]-‘A‘+‘a‘;
        }
    }

  //  for(int i=0;i<n;i++)  printf("%s\n",s[i]);
    int ans=0;
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(strlen(s[i])==strlen(s[j]))
            {
                int len=strlen(s[i]);
                int num=0;
                for(int k=0;k<len;k++)
                {
                    if(s[i][k]==s[j][k]) num++;
                }
                if(num>2)
                {
                    if(m[s[i]]==0) ans++;
                    if(m[s[j]]==0) ans++;
                    m[s[i]]=1;
                    m[s[j]]=1;

                }
            }
        }
    }
    printf("%d\n",ans);
    }
    return 0;
}
时间: 2024-10-01 11:40:39

计算机学院大学生程序设计竞赛(2015’12) 1001 The Country List的相关文章

hdu 计算机学院大学生程序设计竞赛(2015’11)

搬砖 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5134    Accepted Submission(s): 1288 Problem Description 小明现在是人见人爱,花见花开的高富帅,整天沉浸在美女环绕的笙歌妙舞当中.但是人们有所不知,春风得意的小明也曾有着一段艰苦的奋斗史. 那时的小明还没剪去长发,没有信用卡没有她

计算机学院大学生程序设计竞赛(2015’12) 1002 Polygon

#include<iostream> #include<cstring> #include<cstdio> #include<cmath> #include<algorithm> using namespace std; struct Point { double x; double y; } p[1001], px[10001]; int n; double eps=1e-8; int cmp(Point a, Point b) { if(ab

HDU计算机学院大学生程序设计竞赛(2015’12)Happy Value

Happy Value Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1453    Accepted Submission(s): 428 Problem Description In an apartment, there are N residents. The Internet Service Provider (ISP) wa

HDU计算机学院大学生程序设计竞赛(2015’12)The Country List

The Country List Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2598    Accepted Submission(s): 615 Problem Description As the 2010 World Expo hosted by Shanghai is coming, CC is very honorable

计算机学院大学生程序设计竞赛(2015’12)The collector’s puzzle

Problem Description There is a collector who own many valuable jewels. He has a problem about how to store them. There are M special boxes. Each box has a value. And each of the N jewels has a value too. The collector wants to store every jewel in on

计算机学院大学生程序设计竞赛(2015’12) 1003 The collector’s puzzle

#include<cstdio> #include<algorithm> using namespace std; using namespace std; const int maxn=100000+10; int a[maxn],b[maxn]; int main() { int n,m; while(scanf("%d %d",&n,&m)!=EOF) { for(int i=1; i<=n; i++) scanf("%d&

计算机学院大学生程序设计竞赛(2015’12) 1005 Bitwise Equations

#include<cmath> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn=120; long long X,K; long long basex[maxn]; long long basek[maxn]; int totx,totk; int main() { int T; scanf("%d",&a

计算机学院大学生程序设计竞赛(2015’12) 1008 Study Words

#include<cstdio> #include<cstring> #include<map> #include<string> #include<algorithm> using namespace std; int T; char s[100+10]; char r[100+10]; map<string,int>m; struct dan { char s[100+10]; int num; }d[1000000+10]; i

计算机学院大学生程序设计竞赛(2015’12) 1009 The Magic Tower

#include<cmath> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int whp,wat,wdef,bhp,bat,bdef; char s; int main() { while(~scanf("%c",&s)) { scanf("%d%d%d",&whp,&wat,&