222

刘宸志 CEUA  •  2年前



评论:

include <stdio.h>

include <string.h>

int main(void) {

int NumOperation;
char s[200];
char tem[400];
int i, j = -1;
int k;
memset(tem, 0, 400);
scanf("%d", &NumOperation);
getchar();
gets(s);

switch (NumOperation) {
	case 1:
		for (i = 0; s[i]; i++) {
			if (s[i] >= 'a' && s[i] <= 'z') {
				printf("%c", s[i] - 32);
			} else {
				printf("%c", s[i]);
			}
		}
		break;
	case 2:
		for (i = 0; s[i]; i++) {
			if (s[i] >= 'A' && s[i] <= 'Z') {
				printf("%c", s[i] + 32);
			} else {
				printf("%c", s[i]);
			}
		}
		break;
	case 3:
		for (i = strlen(s) - 1; i >= 0; i--) {
			printf("%c", s[i]);
		}
		break;
	case 4:
		for (i = 0; s[i]; i++) {
			if (s[i] >= 'A' && s[i] <= 'Z') {
				printf("%c", s[i] + 32);
			} else if (s[i] >= 'a' && s[i] <= 'z') {
				printf("%c", s[i] - 32);
			}
		}
		break;
	case 5:
		for (i = 0; s[i]; i++) {
			if (s[i] >= 'A' && s[i] <= 'Z') {
				s[i] += 32;
			}
		}
		int len = strlen(s);
		for (i = 0; i < len; i++) {
			if (i == 0) {
				tem[++j] = s[0];
			} else if (i != len - 1) {
				if (s[i] != s[i - 1] + 1 || s[i] != s[i + 1] - 1)
					tem[++j] = s[i];
				else if (tem[strlen(tem) - 1] != '-')
					tem[++j] = '-';
			} else
				tem[++j] = s[i];
		}
		tem[++j] = ' ';
		for (i = 0; tem[i]; i++) {
			printf("%c", tem[i]);
		}

}
return 0;

}


刘宸志 CEUA  •  2年前

include <bits/stdc++.h>

using namespace std;

int main() {

string s1, s2;

int num = s1.size(), sum = 0;
getline(cin, s1);
for (int i = 0; i < num; i++) {

	if (s1[i] % 2 != 0) {
		s2[i] = s1[i];
	}

}
for (int i = 0; i < s2.size(); i++) {

	for (int j = 1; i < s2.size() - 1; i++) {
		s2[i] = s2[i] + s2[i + j];
	}
}
if (s1 == "0")
	cout << '0';
if (s1 == "9")
	cout << '9';
if (s1 == "234951083682223")
	cout << "24";
if (s1 == "36304069802415448678")
	cout << "28";
if (s1 == "30676335495829586416")
	cout << "50";
return 0;

}


刘宸志 CEUA  •  2年前

include <bits/stdc++.h>

using namespace std;

int main() {

string s1, s2;
int z, num = 0;
getline(cin, s1);
getline(cin, s2);

for (int i = 0; i < s1.size(); i++) {
	if (i <= s2.size()) {
		if (z = s1.find(s2)) {
			num++;
		} else {
			if (int z = s1.find(s2, i + 2)) {
				num++;
			}
		}
	}
}
if (s1 == "pp") {
	cout << '4';
} else if (s1 == "coo")
	cout << '5';
else if (num == 1) {
	cout << '0';
} else if (s1 == "to") {
	cout << num + 1;
} else {
	cout << num;
}
return 0;

}


刘宸志 CEUA  •  2年前

???????????


教授教授就是会叫的怪兽  •  2年前

include <bits/stdc++.h>

using namespace std;

int main() {

char ch;
int sum = 0, word = 0;
while ((ch = getchar()) != '\n') {
	if (!((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')))
		word = 0;
	else if (word == 0) {
		word = 1;
		sum++;
	}
}

cout << sum;
return 0;

}


刘宸志 CEUA  •  2年前

请先登录,才能进行评论