⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 1002.txt

📁 acm.pku.edu.cn/JudgeOnline上的题目1001到1010的十道题的代码
💻 TXT
字号:
Memory: 576K  Time: 344MS 
Language: C++  Result: Accepted 

Source Code 
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,i,j,a[100001]={0};
char s[100],c[91];
c['0']=0;
c['1']=1;
c['A']=c['B']=c['C']=c['2']=2;
c['D']=c['E']=c['F']=c['3']=3;
c['G']=c['H']=c['I']=c['4']=4;
c['J']=c['K']=c['L']=c['5']=5;
c['M']=c['N']=c['O']=c['6']=6;
c['P']=c['R']=c['S']=c['7']=7;
c['T']=c['U']=c['V']=c['8']=8;
c['W']=c['X']=c['Y']=c['9']=9;

scanf("%d",&n);
for(i=0;i<n;i++)
{
   scanf("%s",s);
   for(j=0;s[j];j++)
    if(s[j]!='-')
    {
     a[i]*=10;
     a[i]+=c[s[j]];
    }
}
sort(a,a+n);
int t=1,tr=1;
for(i=1;i<n;i++)
{
   if(a[i]==a[i-1])
    t++;
   else if(t!=1)
   {
    tr=0;
    printf("%03d-%04d %d\n",a[i-1]/10000,a[i-1]%10000,t);
    t=1;
   }
}
if(t!=1)
   printf("%03d-%04d %d\n",a[i-1]/10000,a[i-1]%10000,t);
else if(tr)
   printf("No duplicates.\n");

return 0;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -