제출 #252666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
252666		kartel	Marko (COCI15_marko)	C++14	0 / 50	9 ms	5888 KiB

marko

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
//#define F first
//#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int claw[26] = {2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9};
int ans, i, j, siz[N], n;
string s;
vector <int> v[N];

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> s;

        siz[i] = sz(s);

        for (j = 0; j < sz(s); j++)
            v[i].pb(claw[s[j]]);
    }
    cin >> s;

    for (i = 1; i <= n; i++)
    {
        j = 0;
        while (j < min(siz[i], sz(s)) && v[i][j] == s[j] - '0') j++;
        if (j == siz[i]) ans++;
    }
    cout << ans;
}
//
//00000
//00110
//00111
//00011
//00000

컴파일 시 표준 에러 (stderr) 메시지

marko.cpp: In function 'int main()':
marko.cpp:57:30: warning: array subscript has type 'char' [-Wchar-subscripts]
             v[i].pb(claw[s[j]]);
                              ^

• Subtask 1: 0 / 50