Accept: 394 Submit: 511
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
Given a string S, your task is to simulate the following Z http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcGVyYXRpb25zLiBBdCBmaXJzdCwgeW91IHNob3VsZCBzb3J0IGl0IGJ5IGxleGljb2dyYXBoaWMgb3JkZXIgYW5kIGdlbmVyYXRlIGFuIG9yZGVyIHN0cmluZyBToa8uIFRoZW4sIHlvdSBzaG91bGQgY29tcGFyZSBToa8gd2l0aCBTIGNoYXJhY3RlciBieSBjaGFyYWN0ZXIuIEZpbmFsbHksIHlvdSBzaG91bGQgb3V0cHV0CiB0aGUgbnVtYmVyIG9mIGRpZmZlcmVudCBjaGFyYWN0ZXJzIGJldHdlZW4gU6GvIGFuZCBTLgo8cD5Gb3IgZXhhbXBsZSwgaWYgdGhlIG9yaWdpbmFsIHN0cmluZyBTIGlzIKGwQUNNSUNQQ6GxLCB3aGVuIHdlIHNvcnQgdGhpcyBzdHJpbmcgd2UgY291bGQgZ2V0IGEgbmV3IHN0cmluZyBToa8gobBBQ0NDSU1QobEuIFRoZW4gd2UgY29tcGFyZSB0aGVzZSB0d28gc3RyaW5ncywgd2UgY291bGQgZmluZCBvdXQgdGhhdCBvbmx5IHR3byBjaGFyYWN0ZXJzIKGuQaGvIHdob3NlIGluZGV4IGlzIDAgYW5kIKGuQ6GvIHdob3NlIGluZGV4IGlzIDEgYXJlIHRoZSBzYW1lCiAoaW5kZXggZnJvbSAwKSwgc28gdGhlcmUgYXJlIDUgZGlmZmVyZW50IGNoYXJhY3RlcnMuIDwvcD4KCjxoMj48aW1nIHNyYz0="https://www.cppentry.com/upload_files/article/49/1_nwaae__.gif" alt="\"> Input The first line of the input contains an integer T (T <= 10), indicating the number of cases. Each case begins with a line containing one integer n (1 <= n <= 100), the length of the string S. The next line contains the string, consisting of characters ‘A’ to ‘Z’.
Output
For each test case, print a line containing the test case number (beginning with 1) and the number of different characters between the two strings as said above.
Sample Input
42AC6ACCEPT7ACMICPC10FZUACMICPC
Sample Output
Case 1: 0Case 2: 0Case 3: 5Case 4: 10
Source
2010年全国大学生程序设计邀请赛（福州）
水题。。。
AC代码：
#include#include #include using namespace std; char s1[105]; char s2[105]; int main() { int T; int cas = 0; scanf("%d", &T); while(T--) { int n; scanf("%d", &n); getchar(); gets(s1); strcpy(s2, s1); sort(s2, s2+n); int count = 0; for(int i = 0; i < n; i++) { if(s1[i] != s2[i]) count++; } printf("Case %d: %d\n", ++cas, count); } return 0; }