B1009 20’ 90min字符串处理
#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
int main ()
{
char a[90][90];
string s;
getline(cin,s);//cin.getline(str,1000)的用法 一定要加上100
int len = s.size();//只能测char的长度 string的长度用size()测
int m=0, n=0;
for(int i = 0; i < len; ++i)
{
if(s[i]!=' ')
{
a[m][n] = s[i];
n++;
}
else
{
n = 0;
m++;
}
}
for(int i = m; i>=0; --i)
{
cout << a[i];
if(i!=0)
cout << " ";
}
return 0;
}
一些字符串函数的小技巧bug
-
PAT已经不支持gets ,改用cin.getline(char,100)或者getline(cin,string)
-
gets() //只接受 char 不接受string
-
fgets(char,100,stdin)
- 只接受 char 不接受string (stdin是从键盘输入)
- 会吸收回车
- 读取一行直到\n才会停止
-
getline(cin,string) //这种可以接收string 此时用string头文件
-
cin.getline(str,1000); //接收char的str 和 长度 而只需要同时写入
-
strlen() 是计算第一个\0前的字符的个数
-
scanf通过一个空格或者一个换行符结束字符串的输入
-
gets() 通过\n来识别字符串的输入 所以是存入一行
A1012 25’ 排序 166min ‘medium’
- pair
- 头文件在utility中
- map头文件中有utility的头文件
- map的insert方式
- 用{}
maps.insert({ i.id,{ p[0].first,'A' } });
- 或者用
maps.insert(i.id, make_pair(i.id, 'A'));
- 用{}
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
struct Student {
int id;
int C;
int M;
int E;
int A;
int C_rank;
int M_rank;
int E_rank;
int A_rank;
};
vector<Student> student;
map<int, pair<int, char>> maps;
void output(int m);
bool cmp_C(Student a, Student b)
{
return a.C > b.C;
}
bool cmp_M(Student a, Student b)
{
return a.M > b.M;
}
bool cmp_E(Student a, Student b)
{
return a.E > b.E;
}
bool cmp_A(Student a, Student b)
{
return a.A > b.A;
}
bool cmp_stu(pair<int, int> a, pair<int, int> b)
{
if (a.first != b.first) return a.first < b.first;
else return a.second < b.second;
}
void input_1(int n)
{
while (n--)
{
Student s;
cin >> s.id >> s.C >> s.M >> s.E;
s.A = (s.C + s.M + s.E)/3; //猜测这里平均数是这样 可能有bug
student.push_back(s);
}
}
void test_out()
{
for (auto i:student)
{
cout << "A的分数和排名:" << i.C << " " << i.C_rank << endl;
}
}
void test_out2() //单科成绩排序
{
for (auto i : student)
{
cout << "分数和排名:" << i.C << " " << i.C_rank << endl;
cout << "分数和排名:" << i.M << " " << i.M_rank << endl;
cout << "分数和排名:" << i.E << " " << i.E_rank << endl;
cout << "分数和排名:" << i.A << " " << i.A_rank << endl;
cout << endl;
}
}
void alone_student_first_score(map<int, pair<int, char>> &maps)
{
for (auto i : student)
{
vector<pair<int, int>> p;
p.push_back(make_pair(i.A_rank, 1));
p.push_back(make_pair(i.C_rank, 2));
p.push_back(make_pair(i.M_rank, 3));
p.push_back(make_pair(i.E_rank, 4));
sort(p.begin(), p.end(), cmp_stu);
if (p[0].second == 1)
maps.insert({ i.id,{ p[0].first,'A' } });
//要用{} 或者maps.insert(make_pair(i.id, 'A'));
else if (p[0].second == 2)
maps.insert({ i.id,{ p[0].first,'C' } });
else if (p[0].second == 3)
maps.insert({ i.id,{ p[0].first,'M' } });
else if (p[0].second == 4)
maps.insert({ i.id,{ p[0].first,'E' } });
else
;
}
}
void test()
{
int n, m;
cin >> n >> m;
input_1(n);
//对C排序
sort(student.begin(),student.end(),cmp_C);
student[0].C_rank = 1;
for (int i = 1; i < student.size(); ++i)
{
if (student[i-1].C == student[i].C)
{
student[i].C_rank = student[i - 1].C_rank;
}
else
{
student[i].C_rank = i+1;
}
}
sort(student.begin(), student.end(), cmp_M);
student[0].M_rank = 1;
for (int i = 1; i < student.size(); ++i)
{
if (student[i - 1].M == student[i].M)
{
student[i].M_rank = student[i - 1].M_rank;
}
else
{
student[i].M_rank = i + 1;
}
}
sort(student.begin(), student.end(), cmp_E);
student[0].E_rank = 1;
for (int i = 1; i < student.size(); ++i)
{
if (student[i - 1].E == student[i].E)
{
student[i].E_rank = student[i - 1].E_rank;
}
else
{
student[i].E_rank = i + 1;
}
}
sort(student.begin(), student.end(), cmp_A);
student[0].A_rank = 1;
for (int i = 1; i < student.size(); ++i)
{
if (student[i - 1].A == student[i].A)
{
student[i].A_rank = student[i - 1].A_rank;
}
else
{
student[i].A_rank = i + 1;
}
}
//上面排好序了 单科成绩
//test_out2();
alone_student_first_score(maps);//为每个学生的成绩排序
//ACME 1234
//p 里面就是 1 C 2 E这种
output(m);
}
void output(int m)
{
int x;
while (m--)
{
bool flag = false;
cin >> x;
for (auto i : maps)
{
if (i.first == x)
{
cout << i.second.first << " " << i.second.second << endl;
flag = true;
break;
}
}
if (flag == false)
{
cout << "N/A" << endl;
}
}
}
int main()
{
test();
system("pause");
return 0;
}