Knock stupid l1-059

 PTA | Program design experiment auxiliary teaching platform

  At first I didn't understand , How to split a sentence into , And judge

The following is the first input in the judgment , If before the comma ong also . So is the front ong That's the rhyme

And judge the first few words according to the blank space

#include <iostream>
using namespace std;

typedef long long ll;
const int maxn = 1e5 + 10;
string s;

int main() {
	int n;
	cin >> n;
	getchar();
	while (n--) {
		getline(cin, s);
		int f1 = 0, f2 = 0, num = 0;
		for (int i = 0; i < s.size(); ++i) {
			if (s[i] == ',')
				if (s[i - 3] == 'o' && s[i - 2] == 'n' && s[i - 1] == 'g')
					f1 = 1;
			if (s[i] == '.')
				if (s[i - 3] == 'o' && s[i - 2] == 'n' && s[i - 1] == 'g')
					f2 = 1;
			if (s[i] == ' ')
				num++;
		}
		if (f1 && f2) {
			for (int i = 0; i < s.size(); ++i) {
				if (num == 2)
					break;
				cout << s[i];
				if (s[i] == ' ')
					num--;
			}
			cout << "qiao ben zhong.";
		} else {
			cout << "Skipped";
		}
		cout << "\n";
	}
	return 0;
}

The following judgment is a little different , He is divided into two inputs , hold getline Play understand belong to

Then judge in reverse order where to output

#include <iostream>
using namespace std;

int main() {
	int n;
	cin >> n;
	while (n--) {
		cin.get(); //  and getchar The effect is the same 
		string s1, s2;
		getline(cin, s1, ',');
		getline(cin, s2, '.');
		
		int l1 = s1.size(), l2 = s2.size();
		
		if (s1[l1 - 1] != 'g' || s1[l1 - 2] != 'n' || s1[l1 - 3] != 'o' || s2[l2 - 1] != 'g' || s2[l2 - 2] != 'n'
		        || s2[l2 - 3] != 'o')
			puts("Skipped");
		else {
			cout << s1 << ',';
			int i, cnt = 0;
			for (i = s2.size(); i >= 0; i--) {
				if (s2[i] == ' ')
					cnt++;
				if (cnt == 3)
					break;
			}
			for (int j = 0; j <= i; j++)
				cout << s2[j];
			cout << "qiao ben zhong.\n";
		}
	}

	return 0;
}