Submission #5018310


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
using namespace std;
char a[12][5]={"nil","un","bi","tri","quad","pent","hex","sept","oct","enn"};//´ò±í£¿
char b[30];
int c[12]={3,2,2,3,4,4,3,4,3,3};
string s[11]={"nil","un","bi","tri","quad","pent","hex","sept","oct","en1","ium"};
string sx;
int main(){
    int n,tot=0;
    for(int i=0;i<30;i++) b[i]='\0';
    scanf("%d",&n);
    int aa=n/100,bb=(n/10)%10,cc=n%10;//Êýλ·ÖÀ룬µ«ÊÇÓÃÈý¸ö±äÁ¿´æ´¢¡£
    for(int i=0;i<c[aa];++i) {b[tot]=a[aa][i]; tot++;}
    if(aa==9&&bb==0) tot--;//ÌØÅУºÈç904µÄÌØÊâÇé¿ö¡£
    b[0]-=32;//ÕâÊÇʲô£¿½«Ê×λ±ä³É´óд¡£
    for(int i=0;i<c[bb];++i) {b[i+tot]=a[bb][i];}
    if(bb==9&&cc==0) tot--;
    tot+=c[bb];
    for(int i=0;i<c[cc];++i) {b[tot+i]=a[cc][i];}
    if(cc==2 || cc==3) tot--;
    tot+=c[cc];
    b[tot]='i',b[tot+1]='u',b[tot+2]='m';//ÈçÌ⣬ÕâÊÇ»¯Ñ§ÔªËØ£¬ËùÒÔÒª¼Óium¡£
    printf("%s\n",b);
    sx+=s[aa];
    sx+=s[bb];
    sx+=s[cc];
    sx+=s[10];
    int n1=sx.length();
    sx[0]-=32;
    cout<<sx[0];
    for(int i=1;i<n1;i++){
        char now;
        if(sx[i]=='1')
            cout<<'n',now='n';
        else if(sx[i]=='i'||sx[i]=='n')now=sx[i],cout<<sx[i];
        else{
        	cout<<sx[i];
        	continue;
		}
        for(int j=i+1;j<n;j++){
            if(now==sx[j]) i++;
            else break;
        }
    }
    puts("");
}

Submission Info

Submission Time
Task B - 元素の系統名
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 1566 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
WA × 32
Set Name Test Cases
All basic_case00, basic_case01, basic_case02, basic_case03, basic_case04, basic_case05, basic_case06, basic_case07, basic_case08, basic_case09, basic_case10, basic_case11, basic_case12, basic_case13, basic_case14, basic_case15, basic_case16, basic_case17, basic_case18, basic_case19, basic_case20, basic_case21, basic_case22, basic_case23, basic_case24, basic_case25, basic_case26, basic_case27, basic_case28, basic_case29, sample00, sample01
Case Name Status Exec Time Memory
basic_case00 WA 1 ms 256 KB
basic_case01 WA 1 ms 256 KB
basic_case02 WA 1 ms 256 KB
basic_case03 WA 1 ms 256 KB
basic_case04 WA 1 ms 256 KB
basic_case05 WA 1 ms 256 KB
basic_case06 WA 1 ms 256 KB
basic_case07 WA 1 ms 256 KB
basic_case08 WA 1 ms 256 KB
basic_case09 WA 1 ms 256 KB
basic_case10 WA 1 ms 256 KB
basic_case11 WA 1 ms 256 KB
basic_case12 WA 1 ms 256 KB
basic_case13 WA 1 ms 256 KB
basic_case14 WA 1 ms 256 KB
basic_case15 WA 1 ms 256 KB
basic_case16 WA 1 ms 256 KB
basic_case17 WA 1 ms 256 KB
basic_case18 WA 1 ms 256 KB
basic_case19 WA 1 ms 256 KB
basic_case20 WA 1 ms 256 KB
basic_case21 WA 1 ms 256 KB
basic_case22 WA 1 ms 256 KB
basic_case23 WA 1 ms 256 KB
basic_case24 WA 1 ms 256 KB
basic_case25 WA 1 ms 256 KB
basic_case26 WA 1 ms 256 KB
basic_case27 WA 1 ms 256 KB
basic_case28 WA 1 ms 256 KB
basic_case29 WA 1 ms 256 KB
sample00 WA 1 ms 256 KB
sample01 WA 1 ms 256 KB