hdu 5688 Codeforces 675c map的使用

hdu5688

 1 #include <cstdio>
 2 #include <cmath>
 3 #include <iostream>
 4 #include <algorithm>
 5 #include <cstring>
 6 #include <cstdlib>
 7 #include <typeinfo>
 8 #include <vector>
 9 #include <iomanip>
10 #include <map>
11 using namespace std;
12 map<string,int>m;
13 
14 int main()
15 {
16     int n;
17     char a[45];
18     cin>>n;
19     while(n--)
20     {
21         scanf("%s",&a);
22         sort(a,a+strlen(a));
23         m[a]++;
24         cout<<m[a]-1<<endl;
25     }
26     return 0;
27 }

View Code

Codeforces 675c

 1 #include <cstdio>
 2 #include <cmath>
 3 #include <iostream>
 4 #include <algorithm>
 5 #include <cstring>
 6 #include <cstdlib>
 7 #include <typeinfo>
 8 #include <vector>
 9 #include <iomanip>
10 #include <map>
11 using namespace std;
12 
13 map<long long,int>m;
14 
15 int main()
16 {
17     int t;
18     cin>>t;
19     int n;
20     long long sum=0;
21     int ans = t-1;
22     for(int i=0;i<t;i++)
23     {
24         cin>>n;
25         sum += n;
26         m[sum]++;
27         ans = min(ans,t-m[sum]);
28     }
29     cout<<ans<<endl;
30     return 0;
31 }

View Code

 

转载于:https://www.cnblogs.com/sunhaotian/articles/5521226.html