2013春季SD高校ACM周赛8(SDUT)

来源：互联网发布：颈椎牵引器淘宝编辑：程序博客网时间：2024/04/30 02:02

A题：（德翔坑的题意，这样吧不改了）

code:

#include<iostream>#include<vector>#include<queue>#include<stack>#include<stdio.h>#include<algorithm>#include<cstdio>#include<string>#include<cstring>using namespace std;//头文件int main(){int cas;cin>>cas;int weizhi[1000];int sum=0;int N=0;int T=0;string s;for(int i=0;i<cas;i++)cin>>weizhi[i];T++;for(int i=0;i<weizhi[0];i++)cout<<T<<" ";    int num=2;    for(int i=1;i<cas;i++){sum+=weizhi[i-1];N=weizhi[i]-sum;            if(i!=cas-1)    {    for(int j=0;j<N;j++)         cout<<num<<" ";         num++;    }    else    {    for(int j=0;j<N;j++)    {    s+=num+'0';    s+=' ';    }    int len=s.size();    for(int j=0;j<s.size()-1;j++)    cout<<s[j];    }}cout<<endl;return 0;}

B题：（字符串处理题）

code:

#include<iostream>#include<vector>#include<queue>#include<stack>#include<stdio.h>#include<algorithm>#include<cstdio>#include<string>#include<cstring>using namespace std;//头文件string s;string s1;int main(){int flag;while(cin>>s){s1="";if(s=="#") break;//cout<<s<<endl;flag=0;for(int i=0;i<s.size();i++){if(s[i]=='i')s1+="i";else if(s[i]=='o')s1+="o";else if(s[i]=='v')s1+="v";else if(s[i]=='w')s1+="w";else if(s[i]=='x')s1+="x";else if(s[i]=='d')s1+="b";else if(s[i]=='b')s1+="d";else if(s[i]=='p')s1+="q";else if(s[i]=='q')s1+="p";else {flag=1;}}reverse(s1.begin(),s1.end());if(flag==0)cout<<s1<<endl;else cout<<"INVALID"<<endl;s="";}return 0;}

D题：

code:

#include<iostream>#include<vector>#include<queue>#include<stack>#include<stdio.h>#include<algorithm>#include<cstdio>#include<string>#include<cstring>using namespace std;//头文件int main(){string s1;int count_A,count_Y,count_N;while(cin>>s1){count_A=0;count_Y=0;count_N=0;if(s1=="#") break;   for(int i=0;i<s1.size();i++)   {   if(s1[i]=='A')   count_A++;   if(s1[i]=='Y')   count_Y++;   if(s1[i]=='N')   count_N++;       }       //cout<<count_A<<endl;       if((s1.size()+1)/2<=count_A)       {       cout<<"need quorum"<<endl;              }       else if(count_N>count_Y)       cout<<"no"<<endl;       else if(count_Y>count_N)       cout<<"yes"<<endl;       else        cout<<"tie"<<endl;                     s1="";}return 0;}

F题：

code:

#include<iostream>#include<vector>#include<queue>#include<stack>#include<stdio.h>#include<algorithm>#include<cstdio>#include<string>#include<cstring>using namespace std;//头文件struct Num{char shuzi[1000];int len;}num1[1000];int cmp(Num a,Num b){if(a.len<=b.len)a.len=b.len;for(int i=0;i<a.len;i++){if(a.shuzi[i]!=b.shuzi[i])return a.shuzi[i]>b.shuzi[i];}}int main(){int cas;int i;while(cin>>cas){if(cas==0) break;for( i=0;i<cas;i++){cin>>num1[i].shuzi;num1[i].len=strlen(num1[i].shuzi);}sort(num1,num1+cas,cmp);for( i=0;i<cas;i++)cout<<num1[i].shuzi;cout<<endl;}system("pause");return 0;}