zen_meditation_zen - 2020-03-15

« first day next day → last day (88 days later) »

Papa

6:53 AM

thanks

I ll update from the old chat room

So far, we have:

cpp.sh/4mqxz

that's failing TC3

cpp.sh/357wu

this one failing TC7

map<string, size_t> getAllSubstrings(string const& s)
{
	map<string, size_t> map;

	for (size_t i = 1; i <= s.length(); ++i)
	{
		for (size_t j = 0; j <= s.length() - i; j++)
		{
			auto sub = s.substr(j, i);
			++map[sub];
		}
	}
	return map;
}

And this:

s1.length() * s1.length() / 2 + s2.length() * s2.length() / 2

another variant:

n * (n + 1) / 2 <= n*n, n >= 1

sqrt((n*n + m*m) / 2) < max(n, m)

sqrt(count)/(n + m - sqrt(count))

and this:

 sqrt(2)*n/(2*n-sqrt(2)*n) = sqrt(2)/(2-sqrt(2))
= sqrt(2)*(2+sqrt(2))/((2-sqrt(2)*(2+sqrt(2)))
= (2*sqrt(2) + 2)/(4-2)
= sqrt(2) + 1
~ 2,414

Papa

7:30 AM

and we'd have for count: (n * (n+1) / 2) * 2,

Aconcagua

7:55 AM

We have that for count in maximum case. It's for proving that we can count all common occurences of substrings, calculate square root of and use that result for calculating Jaccard index: sqrt(count)/(s1.length() + s2.length() - sqrt(count)).

That's for being closer to task, where they use the simple sum of both tasks...

Aconcagua

8:12 AM

Not tasks, lengths of course...

9 hours later…

Papa

4:57 PM

I see

Now, how the program would be structured