Submission #234378

#	Time	Username	Problem	Language	Result	Execution time	Memory
234378		kartel	Lozinke (COCI17_lozinke)	C++14	40 / 100	1099 ms	3712 KiB

lozinke

#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 optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-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(1e18)
#define el '\n'
#define pii pair <int, int>
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;

string s[N];
int i, n, ans, j;

int main()
{
    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[i];

    ans = 0;

    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
        if (i != j && s[j].find(s[i]) != -1) ans++;

    cout << ans;
}

Compilation message (stderr)

lozinke.cpp: In function 'int main()':
lozinke.cpp:47:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i != j && s[j].find(s[i]) != -1) ans++;
                       ~~~~~~~~~~~~~~~~^~~~~

• Subtask 1: 40 / 100