PTA刷题日记09

1081 Rational Sum (20 分)

测试点4是整数和分数部分都为0的时候要输出0而不是0/1
测试点3的问题在于只有一个数，例如4/6，如果没有进行处理直接输出4/6肯定是错误的

#include<bits/stdc++.h>
using namespace std;
#define ll long long
struct fraction{
	ll up, down;
};

int gcd(ll a, ll b) {
	return a ? gcd(b%a,  a) : b;
}

void change(fraction &a) {
	ll b = abs(a.up), c = abs(a.down), d = gcd(b,c);
	if(a.up == 0) a.down = 1;
	else {
		a.up /= d;
		a.down /= d;
	}
}

int main() {
	int n;
	scanf("%d",&n);
	fraction result, tem;
	result.up = 0, result.down = 1;
	for(int i = 0; i < n; i++) {
		scanf("%lld/%lld", &tem.up, &tem.down);
		result.up  = result.up * tem.down + result.down * tem.up;
		result.down = result.down * tem.down;
		change(result);
	}
	if(!result.up) printf("0");
	else {
		ll i = result.up / result.down;
		result.up = result.up - result.down * i;
		if(!i) printf("%lld/%lld", result.up, result.down);
		else if(!result.up) printf("%lld", i);
		else printf("%d %lld/%lld", i, result.up, result.down);	
	}
	
	return 0;
}

1082 Read Number in Chinese (25 分)

字符串处理，要注意去除前置零和负号（虽然其实我没试不去除前置零会不会出错），但是去除前置零的过程中也可以顺便处理类似0000这样的字符串
注意点：
1.在万和亿单位间如果全是0，单位万就不用写了
2.处理单位的方式0和其他数字要区分开，其判断数字非0再加入单位
3.处理万和亿要单独处理
4.连续的0只要放入第一个0，个位的0单独处理
一些案例

1010010   yi Bai ling yi Wan ling yi Shi

1000010  yi Bai Wan ling yi Shi

100000000  yi Yi

0000  ling     

#include<bits/stdc++.h>
using namespace std;
string number[10] = {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"};
string unit[5] = {"", "Shi", "Bai", "Qian"};
vector<string> ans;

bool leading(string &s) {
	bool f = 0;
	int i = 0, l = s.length();
	if(s[0] == '-') f = 1, i = 1;
	for(; i < l; i++) {
		if(s[i] == '0') continue;
		break;
	}
	s = s.substr(i, l-i);
	return f;
}

int main() {
	string s;
	cin >> s;
	bool f = leading(s);
	if(s.empty()) ans.push_back(number[0]);
	else {
		reverse(s.begin(), s.end());
		char pre = '0';
		for(int i = 0; i < s.length(); i++){
			if(i == 4) ans.push_back("Wan");
			if(i == 8) {
				int j = i-1;
				for(; j > 3; j--) {
					if(s[j] != '0') break;
				}
				if(j == 3) ans.pop_back();
				ans.push_back("Yi");
			}
			if(s[i] == '0'){//处理数字 
				if(s[i] != pre) ans.push_back(number[0]);
			}
			else {
				//处理单位 
				if(i % 4) ans.push_back(unit[i%4]);
				
				int ind = s[i] - '0';
				ans.push_back(number[ind]);
			}
			pre = s[i];
		}	
	}
	if(f) ans.push_back("Fu");
	for(int i = ans.size()-1; i >= 0; i--) {
		if(i) cout<<ans[i] <<" ";
		else cout<<ans[i];
	}
	return 0;
}

1083 List Grades (25 分)

简单排序，别忘了"NONE"即可

#include<bits/stdc++.h>
using namespace std;

struct node{
	string name, id;
	int g;
	friend bool operator < (node a, node b) {
		return a.g > b.g;
	}
};
vector<node> stu;

int main() {
	int n, low, high;
	cin >> n;
	node temp;
	for(int i = 0; i < n; i++) {
		cin>>temp.name>>temp.id>>temp.g;
		stu.push_back(temp);
	}
	sort(stu.begin(), stu.end());
	cin >> low >> high;
	int cnt = 0;
	for(int i = 0; i < stu.size(); i++) {
		if(stu[i].g > high) continue;
		if(stu[i].g < low ) break;
		cout<<stu[i].name<<" "<<stu[i].id<<endl;
		cnt++;
	}
	if(!cnt) cout<<"NONE\n";
	return 0;
}

1084 Broken Keyboard (20 分)

先处理第二个输出的字符串，记录输出的字符，再处理第一个输出的字符串，每当有未标记的字符，就输出，注意大小写不敏感。

#include<bits/stdc++.h>
using namespace std;
bool f[300], out[300];

int main() {
	string a,b;
	cin >> a >> b;
	for(int i = 0; i < b.length(); i++) {
		char ch;
		if(islower(b[i])) ch = b[i] - 32;
		else ch = b[i];
		f[ch] = 1;
	}
	for(int i = 0; i < a.length(); i++) {
		char ch;
		if(islower(a[i])) ch = a[i] - 32;
		else ch = a[i];
		if(!f[ch] && !out[ch]) {
			printf("%c", ch);
			out[ch] = 1;
		}
	}
	return 0;
}

1085 Perfect Sequence (25 分)

读入数组以后排序，二分查找第一个比mi*p大的位置j，就可以依次求出最大长度，还可以剪剪枝，比如当前求得最大长度为8，数组长度为10，那么从到位置4时就可以跳出了，但是没剪也过了，估计数据量比较小

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
#define ll long long
ll arr[N], n, p, ma, ans;

int binary(int l) {
	int r = n-1;
	while(l <= r) {
		int mid = (l+r) / 2;
		if(arr[mid] > ma) r = mid - 1;
		else l = mid + 1;
	}
	return l;
}

int main() {
	scanf("%d %d",&n, &p);
	for(int i = 0; i < n; i++) {
		scanf("%d",arr+i);
	}
	sort(arr, arr+n);
	for(int i = 0; i < n; i++) {
		ma = p * arr[i];
		int j = binary(i), len = j-i;
		if(ans < len) ans = len;
	}
	cout<<ans<<endl;
	return 0;
}

1086 Tree Traversals Again (25 分)

标准的根据前中序重建树，然后后序输出
出栈顺序即是中序，给数字的顺序就是前序

#include<bits/stdc++.h>
using namespace std;
stack<int> st;
vector<int> ans;
int pre[50], in[50];
struct node{
	int val;
	node *l, *r;
};

void postorder(node* root){
	if(root == NULL) return;
	postorder(root->l);
	postorder(root->r);
	ans.push_back(root->val);
} 

node* create(int inL, int inR, int preL, int preR) {
	if(preL > preR) return NULL;
	node* root = new node;
	root->val = pre[preL];
	int k = inL;
	for(; k <= inR; k++) {
		if(in[k] == pre[preL]) break;
	}
	int numl = k - inL;
	root->l = create(inL, k-1, preL+1, preL+numl);
	root->r = create(k+1, inR, preL+1+numl, preR);
	return root;
}

int main() {
	int n, now, c1 = 0, c2 = 0;
	string s;
	cin >> n;
	for(int i = 0; i < 2*n; i++) {
		cin >> s;
		if(s == "Push") {
			cin >> now;
			pre[c1++] = now;
			st.push(now);
		}
		else if(s == "Pop") {
			in[c2++] = st.top();
			st.pop();
		}
	}
	node* root = create(0, n-1, 0, n-1);
	postorder(root);
	for(int i = 0; i < ans.size(); i++) {
		if(i) printf(" ");
		printf("%d",ans[i]);
	}
	return 0;
}

1088 Rational Arithmetic (20 分)

测试点0,1就是题目给的两个样例的情形，测试点2我错的原因是因为在处理的时候把一个应该是long long的值赋给了Int，就大家一定要注意类型的一致

#include<bits/stdc++.h>
using namespace std;
#define ll long long
struct fraction{
	ll up, down;
	ll in;
};

ll gcd(ll a, ll b) {
	return a ? gcd(b%a, a) : b;
}

void change(fraction &a) {
	ll b = abs(a.up), c = (abs(a.down)), d = gcd(b, c);
	if(a.up == 0) a.down = 1;
	else {
		a.up /= d;
		a.down /= d;
	}
	if(a.down < 0) a.up = -a.up, a.down = -a.down;
}

void out(fraction &a) {
	a.in = a.up / a.down;
	a.up = a.up - a.down * a.in;
	if(a.in < 0) a.up = abs(a.up);
}

void print(fraction a) {
	if(a.in != 0) {
		if(a.up) {
			if(a.in < 0) printf("(%lld %lld/%lld)", a.in, a.up, a.down);
			else printf("%lld %lld/%lld", a.in, a.up, a.down);
		}
		else {
			if(a.in < 0) printf("(%lld)",a.in);
			else printf("%lld", a.in);
		}
	}
	else {
		if(a.up < 0) printf("(%lld/%lld)", a.up, a.down);
		else if(a.up == 0) printf("0");
		else printf("%lld/%lld", a.up, a.down);
	}
}

int main() {
	fraction a, b;
	scanf("%lld/%lld", &a.up, &a.down);
	scanf("%lld/%lld", &b.up, &b.down);
	change(a), change(b);
	fraction r1, r2, r3, r4;
	r1.up = a.up * b.down + a.down * b.up, r1.down = a.down * b.down;
	r2.up = a.up * b.down - a.down * b.up, r2.down = r1.down;
	r3.up = a.up * b.up, r3.down = a.down * b.down;
	r4.up = a.up * b.down, r4.down = a.down * b.up;
	change(r1), change(r2), change(r3);
	out(a), out(b), out(r1), out(r2), out(r3);
	print(a), cout<<" + ", print(b), cout<<" = ", print(r1), cout<<endl;
	print(a), cout<<" - ", print(b), cout<<" = ", print(r2), cout<<endl;
	print(a), cout<<" * ", print(b), cout<<" = ", print(r3), cout<<endl;
	print(a), cout<<" / ", print(b), cout<<" = ";
	if(!b.in && !b.up) printf("Inf");
	else {
		change(r4), out(r4);
		print(r4);
	}
	return 0;
} 

1089 Insert or Merge (25 分)

这题的归并排序和我以前写的不一样啊呜呜，思路不难但是一直有一些小细节考虑不全，比如边界问题，还有要排序的长度
但其实也就是这个边界需要考虑，真正的排序根本不用自己写，用一个sort函数部分排序就达到了merge排序的效果，插入排序只要能确定插入位置也可以这样

#include<bits/stdc++.h>
using namespace std;
int ori[105], tmp[105], des[105], n;

bool check() {
	for(int i = 0; i < n; i++) {
		if(ori[i] != des[i]) return false;
	}
	return true;
}

void merge(int l, int m, int r) {
	if(m >= n) return;
    if(r >= n) r = n-1;
	for(int i = l; i <= r; i++) tmp[i] = ori[i];
	int p = l,  q = m+1, t = l;
	while(p <= m && q <= r) {
		if(tmp[p] <= tmp[q]) ori[t] = tmp[p++];
		else ori[t] = tmp[q++];
		t++;
	}
	while(p <= m) ori[t++] = tmp[p++];
	while(q <= r) ori[t++] = tmp[q++];
}

int main() {
	scanf("%d",&n);
	for(int i = 0; i < n; i++) scanf("%d", ori+i);
	for(int i = 0; i < n; i++) scanf("%d", des+i);
	int in = 2, st, ed, mid;
	bool f = 0;
	while(in/2 < n) {
		int turn = n / in;
		st = 0;
		while(st < n) {
			ed = st + in - 1;
			mid = (st + ed) / 2;
			merge(st, mid, ed);
			st = ed + 1;	
		}
		if(f) {
			for(int i = 0; i < n; i++) {
				if(i) printf(" ");
				printf("%d",ori[i]);
			}
			return 0;
		}
		if(check()) {
			f = 1;
			printf("Merge Sort\n");
		}
		in *= 2;
	}

	printf("Insertion Sort\n");
	int pre = -1, i = 0;
	for(; i < n; i++) {
		if(des[i] < des[i-1]) {
			int tem = des[i], j = i-1;
			for(; des[j] > tem; j--) {
				des[j+1] = des[j];
			} 
			des[j+1] = tem;
			break;
		}
		pre = des[i];
	}
	for(int i = 0; i < n; i++) {
		if(i) printf(" ");
		printf("%d",des[i]);
	}
	return 0;
}