Description
There are many users on SDNU OJ, but only the one who registered can use it. We think different username represent different user.
One day ZhouXiaohui got a record of "Status Pages", the captain Albert_s wants to know how many users are using SDNU OJ at that time.
He will give you an "Accepted" as a gift if you help him figure out this problem.
Input
Output
For each testcase, print a single line starting with "Case #i:"(i indicates the case number) and then a single integer, denoting the answer Albert_s wants to know, separated with a single space.
Sample Input
1 3 ZhouXiaohui ZhouLaohui ZhouXiaohui
Sample Output
Case #1: 2
Source
Unknown
#include <cstdio> #include <iostream> #include <string> #include <cstring> #include <cmath> #include <algorithm> #include <queue> #include <vector> #include <map> using namespace std; #define ll long long int t, n, sum; string name[100000+8]; int main() { scanf("%d", &t); int miao = t; while(t--) { bool flag = 0; int num = 0; cin>>n; for(int i = 0; i<n; i++) { flag = 0; cin>>name[i]; for(int j = 0; j<i; j++) { if(name[i] == name[j]) { flag = 1; break; } } if(flag)continue; else num++; } printf("Case #%d: %d ", miao-t, num); } return 0; }