Codeforces Round #806 (Div. 4) - B

문제 출처:

https://codeforces.com/contest/1703/problem/B

 

문제 분석:

내용은 길지만 요약하면 각 알파벳이 처음쓰이면 2 그다음부터는 1씩 추가하는 문제

 

문제 해결:

방문처리만 해주면 된다

 

내 소스코드:

// freopen("input.txt", "r", stdin);
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <cstring>
#include <list>
#include <set>
#include <string.h>
#include <map>
#include <limits.h>
#include <stdlib.h>
#include <typeinfo>
#include <bitset>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define range(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int INF = 987654321;

int testcase;


int main() 
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> testcase;

    while (testcase--)
    {
        int arr[27] = { 0, };
        int k;
        cin >> k;
        string tmp;
        cin >> tmp;

        int ans = k;
        for (int i = 0; i < k; i++)
        {
            if (arr[tmp[i] - 'A'] == 1)
                continue;
            ans++;
            arr[tmp[i] - 'A'] = 1;
        }
        cout << ans << "\n";

    }


    return 0;
}

 

고찰 :