zoukankan      html  css  js  c++  java
  • HDU 5842 Lweb and String (水题)

    题意:给定一个字符串,问你有多少种字母。

    析:用set即可。

    代码如下:

    #pragma comment(linker, "/STACK:1024000000,1024000000")
    #include <cstdio>
    #include <string>
    #include <cstdlib>
    #include <cmath>
    #include <iostream>
    #include <cstring>
    #include <set>
    #include <queue>
    #include <algorithm>
    #include <vector>
    #include <map>
    #include <cctype>
    #include <stack>
    using namespace std;
    
    typedef long long LL;
    typedef pair<int, int> P;
    const int INF = 0x3f3f3f3f;
    const double inf = 0x3f3f3f3f3f3f;
    const LL LNF = 100000000000000000;
    const double PI = acos(-1.0);
    const double eps = 1e-8;
    const int maxn = 1e5 + 5;
    const int mod = 1e9 + 7;
    const char *mark = "+-*";
    const int dr[] = {-1, 0, 1, 0};
    const int dc[] = {0, 1, 0, -1};
    int n, m;
    inline bool is_in(int r, int c){
        return r >= 0 && r < n && c >= 0 && c < m;
    }
    inline LL Max(LL a, LL b){  return a < b ? b : a; }
    inline LL Min(LL a, LL b){  return a > b ? b : a; }
    inline int Max(int a, int b){  return a < b ? b : a; }
    inline int Min(int a, int b){  return a > b ? b : a; }
    set<char> sets;
    char s[maxn];
    
    int main(){
        int T;  cin >> T;
        for(int kase = 1; kase <= T; ++kase){
            sets.clear();
            scanf("%s", s);
            n = strlen(s);
            for(int i = 0; i < n; ++i)
                sets.insert(s[i]);
            printf("Case #%d: %d
    ", kase, sets.size());
        }
        return 0;
    }
    

      

  • 相关阅读:
    Java 线程:(一)
    RK:Webview、Chrome
    CocosCreator 加载Bundle里的Prefab
    Canvas 绘画
    CocosCreator 要用3D节点实现skewX
    Unity 动态创建网格
    凹多边形三角剖分
    UnityHub 登录失败
    浮点数
    八皇后问题(回溯算法)
  • 原文地址:https://www.cnblogs.com/dwtfukgv/p/5770872.html
Copyright © 2011-2022 走看看