Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Microsoft - # of fragments (semi-optimised)
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//g++ 7.4.0 #include <bits/stdc++.h> using namespace std; typedef long long int ll; int MapToInt (char ch) { if (ch >= 'a' && ch <= 'z') return (ch - 'a'); if (ch >= 'A' && ch <= 'Z') return (ch - 'A' + 26); return -1; } ll CountOfEqualFragments (const string& s1, const string& s2) { int n = min (s1.length(), s2.length()); ll ans = 0; for (int j = 0; j < n; j ++) { vector<int> f_s1(52), f_s2(52); int same_count_frq = 52; for (int k = j; k < n; k ++) { int c1 = MapToInt(s1[k]); int c2 = MapToInt(s2[k]); if (f_s1[c1] == f_s2[c1]) same_count_frq --; f_s1 [c1] ++; if (f_s1[c1] == f_s2[c1]) same_count_frq ++; if (f_s1[c2] == f_s2[c2]) same_count_frq --; f_s2 [c2] ++; if (f_s1[c2] == f_s2[c2]) same_count_frq ++; if (same_count_frq == 52) ans ++; } } return ans; } int main() { string s1 = "dBacaAA"; string s2 = "caBdaaA"; cout << CountOfEqualFragments (s1, s2) << endl; return 0; }
g++
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
Compilation time: 1.62 sec, absolute running time: 0.15 sec, cpu time: 0.01 sec, memory peak: 5 Mb, absolute service time: 1,87 sec
edit mode
|
history
|
discussion
5