#include<bits/stdc++.h>
using namespace std;
struct Node {
string l,ll,lll,llll,lllll,llllll,lllllll,llllllll;
} a[10001];
bool cmp(Node x,Node y) {
int q1,q2;
int s1=0,s2=0;
q1=x.ll.size();
q2=y.ll.size();
for(int i=0; i<q1; i++) {
if(x.ll[i]=='0') {
continue;
} else if(x.ll[i]=='1') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*1;
} else if(x.ll[i]=='2') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*2;
} else if(x.ll[i]=='3') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*3;
} else if(x.ll[i]=='4') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*4;
} else if(x.ll[i]=='5') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*5;
} else if(x.ll[i]=='6') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*6;
} else if(x.ll[i]=='7') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*7;
} else if(x.ll[i]=='8') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*8;
} else if(x.ll[i]=='9') {
int abc=1;
for(int j=1; j<=q1-i; j++) {
abc*=10;
}
s1+=abc*9;
}
}
for(int i=0; i<q2; i++) {
if(y.ll[i]=='0') {
continue;
} else if(y.ll[i]=='1') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*1;
} else if(y.ll[i]=='2') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*2;
} else if(y.ll[i]=='3') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*3;
} else if(y.ll[i]=='4') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*4;
} else if(y.ll[i]=='5') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*5;
} else if(y.ll[i]=='6') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*6;
} else if(y.ll[i]=='7') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*7;
} else if(y.ll[i]=='8') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*8;
} else if(y.ll[i]=='9') {
int abc=1;
for(int j=1; j<=q2-i; j++) {
abc*=10;
}
s2+=abc*9;
}
}
return s1<s2;
}
int main() {
string sb;
int n;
int wtf;
cin>>n;
for(int i=0; i<n; i++) {
cin>>a[i].l>>a[i].ll>>a[i].lll>>a[i].llll>>a[i].lllll>>a[i].llllll>>a[i].lllllll>>a[i].llllllll;
}
sort(a,a+n,cmp);
cin>>sb;
bool flag=false;
for(int i=0; i<n; i++) {
bool flag2=true;
if(sb.size()!=a[i].l.size()) {
continue;
} else {
for(int j=0; j<sb.size(); j++) {
if(sb[j]!=a[i].l[j]) {
flag2=false;
break;
}
}
}
if(flag2==true) {
flag=true;
wtf=i;
break;
}
}
cout<<"姓名 学号 籍贯 身份证号 年龄 家庭住址 性别 联系方式"<<endl;
for(int i=0; i<n; i++) {
for(int j=0; j<a[i].l.size(); j++) {
cout<<a[i].l[j];
}
cout<<" ";
for(int j=0; j<a[i].ll.size(); j++) {
cout<<a[i].ll[j];
}
cout<<" ";
for(int j=0; j<a[i].lll.size(); j++) {
cout<<a[i].lll[j];
}
cout<<" ";
for(int j=0; j<a[i].llll.size(); j++) {
cout<<a[i].llll[j];
}
cout<<" ";
for(int j=0; j<a[i].lllll.size(); j++) {
cout<<a[i].lllll[j];
}
cout<<" ";
for(int j=0; j<a[i].llllll.size(); j++) {
cout<<a[i].llllll[j];
}
cout<<" ";
for(int j=0; j<a[i].lllllll.size(); j++) {
cout<<a[i].lllllll[j];
}
cout<<" ";
for(int j=0; j<a[i].llllllll.size(); j++) {
cout<<a[i].llllllll[j];
}
cout<<endl;
}
if(flag==true) {
for(int j=0; j<a[wtf].l.size(); j++) {
cout<<a[wtf].l[j];
}
cout<<" ";
for(int j=0; j<a[wtf].ll.size(); j++) {
cout<<a[wtf].ll[j];
}
cout<<" ";
for(int j=0; j<a[wtf].lll.size(); j++) {
cout<<a[wtf].lll[j];
}
cout<<" ";
for(int j=0; j<a[wtf].llll.size(); j++) {
cout<<a[wtf].llll[j];
}
cout<<" ";
for(int j=0; j<a[wtf].lllll.size(); j++) {
cout<<a[wtf].lllll[j];
}
cout<<" ";
for(int j=0; j<a[wtf].llllll.size(); j++) {
cout<<a[wtf].llllll[j];
}
cout<<" ";
for(int j=0; j<a[wtf].lllllll.size(); j++) {
cout<<a[wtf].lllllll[j];
}
cout<<" ";
for(int j=0; j<a[wtf].llllllll.size(); j++) {
cout<<a[wtf].llllllll[j];
}
cout<<endl;
} else {
cout<<"NO";
}
return 0;
}
最蠢的代码
最新推荐文章于 2024-09-12 13:19:42 发布