Your browser is not supported. Please, update your browser or switch to a different one. Learn more about which browsers are supported.
Tasks Details
hard
Given an array, find all its elements that can become a leader, after increasing by 1 all of the numbers in some segment of a given length.
Task Score
55%
Correctness
100%
Performance
0%
Task description
Integers K, M and a non-empty array A consisting of N integers, not bigger than M, are given.
The leader of the array is a value that occurs in more than half of the elements of the array, and the segment of the array is a sequence of consecutive elements of the array.
You can modify A by choosing exactly one segment of length K and increasing by 1 every element within that segment.
The goal is to find all of the numbers that may become a leader after performing exactly one array modification as described above.
Write a function:
vector<int> solution(int K, int M, vector<int> &A);
that, given integers K and M and an array A consisting of N integers, returns an array of all numbers that can become a leader, after increasing by 1 every element of exactly one segment of A of length K. The returned array should be sorted in ascending order, and if there is no number that can become a leader, you should return an empty array. Moreover, if there are multiple ways of choosing a segment to turn some number into a leader, then this particular number should appear in an output array only once.
For example, given integers K = 3, M = 5 and the following array A:
A[0] = 2 A[1] = 1 A[2] = 3 A[3] = 1 A[4] = 2 A[5] = 2 A[6] = 3the function should return [2, 3]. If we choose segment A[1], A[2], A[3] then we get the following array A:
A[0] = 2 A[1] = 2 A[2] = 4 A[3] = 2 A[4] = 2 A[5] = 2 A[6] = 3and 2 is the leader of this array. If we choose A[3], A[4], A[5] then A will appear as follows:
A[0] = 2 A[1] = 1 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = 3 A[6] = 3and 3 will be the leader.
And, for example, given integers K = 4, M = 2 and the following array:
A[0] = 1 A[1] = 2 A[2] = 2 A[3] = 1 A[4] = 2the function should return [2, 3], because choosing a segment A[0], A[1], A[2], A[3] and A[1], A[2], A[3], A[4] turns 2 and 3 into the leaders, respectively.
Write an efficient algorithm for the following assumptions:
- N and M are integers within the range [1..100,000];
- K is an integer within the range [1..N];
- each element of array A is an integer within the range [1..M].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C++
Time spent on task 58 minutes
Notes
not defined yet
Task timeline
Code: 09:09:14 UTC,
java,
autosave
Code: 09:09:27 UTC,
cpp,
autosave
Code: 09:09:50 UTC,
cpp,
autosave
Code: 09:09:57 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:10:49 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
return ret;
}
Code: 09:11:07 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
for(int i = 0; i < A.size(); i++)
{
}
return ret;
}
Code: 09:11:18 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
for(int i = 0; i < A.size(); i++)
{
}
return ret;
}
Code: 09:11:31 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
for(int i = 0; i < copy.size(); i++)
{
copy[i]++;
}
return ret;
}
Code: 09:11:41 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
for(int i = 0; i < copy.size(); i++)
{
copy[i]++;
}
return ret;
}
Code: 09:12:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
for(int i = 0; i < copy.size(); i++)
{
copy[i]++;
}
return ret;
}
Code: 09:12:43 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
int nNumSegs = copy.size() - K -1;
for(int i = 0; i < copy.size(); i++)
{
copy[i]++;
}
return ret;
}
Code: 09:12:53 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
int nNumSegs = copy.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
}
return ret;
}
Code: 09:13:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
int nNumSegs = copy.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
copy
}
return ret;
}
Code: 09:13:15 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
int nNumSegs = copy.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
copy[i]
}
return ret;
}
Code: 09:13:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
vector<int> copy = A;
int nNumSegs = copy.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
copy[i]++;
}
return ret;
}
Code: 09:13:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
copy[i]++;
}
return ret;
}
Code: 09:13:57 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
copy[i]++;
copy[i+1]++;
copy[i+1]++;
}
return ret;
}
Code: 09:14:15 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < )
}
return ret;
}
Code: 09:14:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < A.size();)
}
return ret;
}
Code: 09:14:41 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < K; j++
{
copy[j]++;
}
}
return ret;
}
Code: 09:15:12 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < K; j++
{
copy[j]++;
}
c
}
return ret;
}
Code: 09:15:39 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < K; j++)
{
copy[j]++;
}
for(int j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
324122324122341223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:15:58 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < K; j++)
{
copy[j]++;
}
for(int j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
c
}
return ret;
}
Code: 09:16:03 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < K; j++)
{
copy[j]++;
}
for(int j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3241223 241223 41223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:16:25 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(int j = i; j < K; j++)
{
copy[j]++;
}
for(int j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3241223 241223 41223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:16:31 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(uint j = i; j < K; j++)
{
copy[j]++;
}
for(int j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
cout << "\n";
}
return ret;
}
Code: 09:16:38 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(uint_32 j = i; j < K; j++)
{
copy[j]++;
}
for(uint_32 j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
cout << "\n";
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:16:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < nNumSegs; i++)
~~^~~~~~~~~~
func.cpp:20:12: error: 'uint_32' was not declared in this scope
for(uint_32 j = i; j < K; j++)
^~~~~~~
func.cpp:20:27: error: 'j' was not declared in this scope
for(uint_32 j = i; j < K; j++)
^
func.cpp:25:13: error: 'uint_32' was not declared in this scope
for(uint_32 j = i; j < copy.size(); j++)
^~~~~~~
func.cpp:25:28: error: 'j' was not declared in this scope
for(uint_32 j = i; j < copy.size(); j++)
^
Code: 09:17:01 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(uint_32 j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
cout << "\n";
}
return ret;
}
Code: 09:17:07 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = i; j < copy.size(); j++)
{
cout << copy[j]++;
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3241223 241223 41223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:17:52 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = i; j < copy.size(); j++)
{
copy[j]++;
}
cout << "\n";
}
return ret;
}
Code: 09:18:01 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = i; j < copy.size(); j++)
{
copy[j]++;
cout << copy[j];
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
4352334 352334 52334
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:18:16 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = i; j < copy.size(); j++)
{
copy[j]++;
}
cout << "\n";
}
return ret;
}
Code: 09:18:29 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = i; j < copy.size(); j++)
{
copy[j]++;
}
cout << "\n";
}
return ret;
}
Code: 09:20:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
copy[j]++;
}
cout << "\n";
}
return ret;
}
Code: 09:20:14 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy[j];
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3241223 2241223 2141223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:20:51 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigneint i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy[j];
}
cout << "\n";
}
return ret;
}
Code: 09:20:52 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy[j];
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3241223 2241223 2141223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:21:25 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy[j];
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3241223 2241223 2141223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:22:01 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy[;
}
cout << "\n";
}
return ret;
}
Code: 09:22:02 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy;
}
cout << "\n";
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:20:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(unsigned int j = i; j < K; j++)
~~^~~
func.cpp:27:16: error: no match for 'operator<<' (operand types are 'std::ostream {aka std::basic_ostream<char>}' and 'std::vector<int>')
cout << copy;
~~~~~^~~~~~~
In file included from /opt/lang/gcc/include/c++/6.2.0/iostream:39:0,
from solution.cpp:4:
/opt/lang/gcc/include/c++/6.2.0/ostream:108:7: note: candidate: std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_ostream<_CharT, _Traits>::__ostream_type& (*)(std::basic_ostream<_CharT, _Traits>::__ostream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_ostream<_CharT, _Traits>::__ostream_type = std::basic_ostream<char>]
operator<<(__ostream_type& (*__pf)(__ostream_type&))
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/ostream:108:7: note: no known conversion for argument 1 from 'std::vector<int>' to 'std::basic_ostream<char>::__ostream_type& (*)(std::basic_ostream<char>::__ostream_type&) {aka std::basic_ostream<char>& (*)(std::basic_ostream<char>&)}'
/opt/lang/gcc/include/c++/6.2.0/ostream:117:7: note: candidate: std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_ostream<_CharT, _Traits>::__ios_type& (*)(std::basic_ostream<_CharT, _Traits>::__ios_type&)) [with _CharT = char; _Traits = std::char_traits<char>; std::basic_ostream<_CharT, _Traits>::__ostream_type = std::basic_ostream<char>; std::basic_ostream<_CharT, _Traits>::__ios_type = std::basic_ios<char>]
operator<<(__ios_type& (*__pf)(__ios_type&))
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/ostream:117:7: note: no known conversion for argument 1 from 'std::vector<int>' to 'std::basic_ostream<char>::__ios_type& (*)(std::basic_ostream<char>::__
Code: 09:22:11 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy[j];
}
cout << "\n";
}
return ret;
}
Code: 09:22:40 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at[j];
}
cout << "\n";
}
return ret;
}
Code: 09:22:40 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at[j];
}
cout << "\n";
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:20:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(unsigned int j = i; j < K; j++)
~~^~~
func.cpp:27:28: error: invalid types '<unresolved overloaded function type>[unsigned int]' for array subscript
cout << copy.at[j];
^
Code: 09:22:48 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3241223 2241223 2141223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:23:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Code: 09:23:20 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
cout << K << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 3241223 2241223 2141223
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
4
Code: 09:23:59 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
cout << K << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Code: 09:24:13 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
cout << K << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < A. K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Code: 09:24:24 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
cout << K << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; K; j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Code: 09:24:39 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
cout << K << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 3241223 2242223 2142323
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
4
Code: 09:24:56 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
cout << nnUm << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Code: 09:25:00 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K -1;
cout << nNumSegs << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 3241223 2242223 2142323
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
0
Code: 09:25:55 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K;
cout << nNumSegs << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Code: 09:25:56 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - K;
cout << nNumSegs << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
4 3241223 2242223 2142323 2132333
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
1 23322
Code: 09:26:09 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - (K+1);
cout << nNumSegs << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 3241223 2242223 2142323
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
0
Code: 09:26:21 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - (K);
cout << nNumSegs << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Code: 09:26:24 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - (K-1);
cout << nNumSegs << "\n";
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
5 3241223 2242223 2142323 2132333 2131334
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 23322 13323
Code: 09:26:48 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
}
return ret;
}
Code: 09:27:05 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
}
return ret;
}
Code: 09:27:15 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
for(unsigned int j = 0; j < copy.size(); j++)
{
cout << copy.at(j);
}
}
return ret;
}
Code: 09:27:36 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:12:5: error: 'map' was not declared in this scope
map<int,int> occ;
^~~
func.cpp:12:9: error: expected primary-expression before 'int'
map<int,int> occ;
^~~
Code: 09:27:45 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
smap<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Code: 09:27:47 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:12:4: error: 'map' is not a member of 'std'
std::map<int,int> occ;
^~~
func.cpp:12:13: error: expected primary-expression before 'int'
std::map<int,int> occ;
^~~
Code: 09:27:58 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:28:16 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Code: 09:28:28 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Code: 09:28:49 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
for(int i = 0; i < K; )
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Code: 09:29:04 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:29:20 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]] ++;
}
}
return ret;
}
Code: 09:29:38 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
}
return ret;
}
Code: 09:29:58 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
vector<int> ret;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
}
}
return ret;
}
Code: 09:30:14 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> ret;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > )
}
}
return ret;
}
Code: 09:30:41 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> ret;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
}
}
}
return ret;
}
Code: 09:30:52 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> ret;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
ret.insert(it->second);
}
}
}
return ret;
}
Code: 09:30:58 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> ret;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
ret.insert(it->second);
}
}
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:10:5: error: 'set' was not declared in this scope
set<int> ret;
^~~
func.cpp:10:9: error: expected primary-expression before 'int'
set<int> ret;
^~~
func.cpp:33:8: error: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map' used without template parameters
map::iterator it = occ.begin();
^~~
func.cpp:34:14: error: 'it' was not declared in this scope
while(it != occ.end())
^~
func.cpp:38:16: error: 'ret' was not declared in this scope
ret.insert(it->second);
^~~
func.cpp:45:12: error: 'ret' was not declared in this scope
return ret;
^~~
Code: 09:31:08 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> ret;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
ret.insert(it->second);
}
}
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:34:8: error: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map' used without template parameters
map::iterator it = occ.begin();
^~~
func.cpp:35:14: error: 'it' was not declared in this scope
while(it != occ.end())
^~
func.cpp:46:12: error: could not convert 'ret' from 'std::set<int>' to 'std::vector<int>'
return ret;
^~~
Code: 09:31:22 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> ret;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
ret.insert(it->second);
}
}
}
ret
return ret;
}
Code: 09:31:32 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> ret;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
ret.insert(it->second);
}
}
}
return ret;
}
Code: 09:32:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
ret.insert(it->second);
}
}
}
return ret;
}
Code: 09:32:26 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),ret.begin(), ret.end());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:34:8: error: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map' used without template parameters
map::iterator it = occ.begin();
^~~
func.cpp:35:14: error: 'it' was not declared in this scope
while(it != occ.end())
^~
func.cpp:45:20: error: 'ret' was not declared in this scope
copy(s.begin(),ret.begin(), ret.end());
^~~
Code: 09:32:34 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.begin(), ret.end());
return ret;
}
Code: 09:32:37 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.begin(), s.end());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:34:8: error: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map' used without template parameters
map::iterator it = occ.begin();
^~~
func.cpp:35:14: error: 'it' was not declared in this scope
while(it != occ.end())
^~
func.cpp:47:12: error: 'ret' was not declared in this scope
return ret;
^~~
In file included from /opt/lang/gcc/include/c++/6.2.0/bits/char_traits.h:39:0,
from /opt/lang/gcc/include/c++/6.2.0/string:40,
from solution.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h: In instantiation of 'static _OI std::__copy_move<<anonymous>, <anonymous>, <template-parameter-1-3> >::__copy_m(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>; bool <anonymous> = false; bool <anonymous> = false; <template-parameter-1-3> = std::bidirectional_iterator_tag]':
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:386:44: required from '_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:422:45: required from '_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:455:8: required from '_OI std::copy(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
func.cpp:45:38: required from here
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:294:16: error: assignment of read-only location '__result.std::_Rb_tree_const_iterator<_Tp>::operator*<int>()'
*__result = *__first;
~~~~~~~~~~^~~~~~~~~~
Code: 09:32:52 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.begin(), s.end());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:34:8: error: 'template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map' used without template parameters
map::iterator it = occ.begin();
^~~
func.cpp:35:14: error: 'it' was not declared in this scope
while(it != occ.end())
^~
In file included from /opt/lang/gcc/include/c++/6.2.0/bits/char_traits.h:39:0,
from /opt/lang/gcc/include/c++/6.2.0/string:40,
from solution.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h: In instantiation of 'static _OI std::__copy_move<<anonymous>, <anonymous>, <template-parameter-1-3> >::__copy_m(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>; bool <anonymous> = false; bool <anonymous> = false; <template-parameter-1-3> = std::bidirectional_iterator_tag]':
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:386:44: required from '_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:422:45: required from '_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:455:8: required from '_OI std::copy(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
func.cpp:45:38: required from here
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:294:16: error: assignment of read-only location '__result.std::_Rb_tree_const_iterator<_Tp>::operator*<int>()'
*__result = *__first;
~~~~~~~~~~^~~~~~~~~~
Code: 09:33:06 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.begin(), s.end());
return ret;
}
Code: 09:33:08 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.begin(), s.end());
return ret;
}
Analysis
Compile error
In file included from /opt/lang/gcc/include/c++/6.2.0/bits/char_traits.h:39:0,
from /opt/lang/gcc/include/c++/6.2.0/string:40,
from solution.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h: In instantiation of 'static _OI std::__copy_move<<anonymous>, <anonymous>, <template-parameter-1-3> >::__copy_m(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>; bool <anonymous> = false; bool <anonymous> = false; <template-parameter-1-3> = std::bidirectional_iterator_tag]':
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:386:44: required from '_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:422:45: required from '_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:455:8: required from '_OI std::copy(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
func.cpp:45:38: required from here
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:294:16: error: assignment of read-only location '__result.std::_Rb_tree_const_iterator<_Tp>::operator*<int>()'
*__result = *__first;
~~~~~~~~~~^~~~~~~~~~
Code: 09:33:35 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
// copy(s.begin(),s.begin(), s.end());
return ret;
}
Analysis
expand all
Example tests
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
Code: 09:33:50 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.begin(), s.end());
return ret;
}
Code: 09:33:53 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.begin(), s.end());
return ret;
}
Analysis
Compile error
In file included from /opt/lang/gcc/include/c++/6.2.0/bits/char_traits.h:39:0,
from /opt/lang/gcc/include/c++/6.2.0/string:40,
from solution.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h: In instantiation of 'static _OI std::__copy_move<<anonymous>, <anonymous>, <template-parameter-1-3> >::__copy_m(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>; bool <anonymous> = false; bool <anonymous> = false; <template-parameter-1-3> = std::bidirectional_iterator_tag]':
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:386:44: required from '_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:422:45: required from '_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:455:8: required from '_OI std::copy(_II, _II, _OI) [with _II = std::_Rb_tree_const_iterator<int>; _OI = std::_Rb_tree_const_iterator<int>]'
func.cpp:45:38: required from here
/opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:294:16: error: assignment of read-only location '__result.std::_Rb_tree_const_iterator<_Tp>::operator*<int>()'
*__result = *__first;
~~~~~~~~~~^~~~~~~~~~
Code: 09:34:29 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.end, s.end());
return ret;
}
Code: 09:34:35 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.end, ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:45:38: error: invalid use of non-static member function 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::end() const [with _Key = int; _Compare = std::less<int>; _Alloc = std::allocator<int>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree_const_iterator<int>]'
copy(s.begin(),s.end, ret.begin());
^
In file included from /opt/lang/gcc/include/c++/6.2.0/set:61:0,
from func.cpp:4:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_set.h:326:7: note: declared here
end() const _GLIBCXX_NOEXCEPT
^~~
Code: 09:34:48 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
Code: 09:35:02 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:35:03 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:35:20 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
Code: 09:35:32 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[copy[j]] = ;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:35:54 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
inserting inserting inserting inserting inserting inserting
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
inserting inserting inserting inserting inserting
Code: 09:36:44 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
/occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:36:58 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
cout << "\n"
//occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:36:59 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
cout << "\n";
//occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
0 1 2 1 2 3 2 3 4 3 4 5 4 5 6
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
0 1 2 3 1 2 3 4
Code: 09:37:28 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
cout << "\n";
//occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:37:41 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
cout << "\n";
//occ[j] = copy[j];
}
cout << "\n";
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
0 1 2 1 2 3 2 3 4 3 4 5 4 5 6
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
0 1 2 3 1 2 3 4
Code: 09:38:14 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
cout << "\n";
//occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:38:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
//occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:38:36 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K -1); j++)
{
copy[j]++;
cout << j;
//occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
0112233445
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
012123
Code: 09:38:49 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K -1); j++)
{
copy[j]++;
cout << j;
occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
0112inserting 23inserting 34inserting 45inserting
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
012inserting inserting 123inserting inserting
Code: 09:43:18 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K -1); j++)
{
copy[j]++;
cout << j;
occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
0112inserting 23inserting 34inserting 45inserting
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
012inserting inserting 123inserting inserting
Code: 09:43:29 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K ); j++)
{
copy[j]++;
cout << j;
occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:43:30 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
012inserting 123inserting 234inserting 345inserting 456inserting inserting
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
0123inserting inserting 1234inserting inserting inserting
Code: 09:43:47 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
copy[j]++;
cout << j;
occ[j] = copy[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:44:01 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
std::map<int,int> occ;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++
cout << j;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:44:15 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < M; i++)
{
occ[i] = 0;
}
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
std::map<int,int> occ;
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++
cout << j;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:44:29 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++
cout << j;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:28:11: error: 'occ' was not declared in this scope
occ[j]++
^~~
func.cpp:34:36: error: 'occ' was not declared in this scope
map<int,int>::iterator it = occ.begin();
^~~
Code: 09:44:40 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++
cout << j;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:29:11: error: expected ';' before 'cout'
cout << j;
^~~~
Code: 09:44:47 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++;
cout << j;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:44:52 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++;
cout << occ[j];
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
111221321321321
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
11112221
Code: 09:45:18 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:45:28 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[j]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:45:48 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
inserting inserting inserting inserting inserting inserting
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
inserting inserting
Code: 09:46:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + K); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:46:17 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
inserting inserting inserting
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Segmentation Faultstdout:
inserting
Code: 09:46:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
/ copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:46:37 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
inserting inserting inserting
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
inserting
Code: 09:46:58 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:47:09 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:47:39 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it = occ.begin();
while(it != occ.end())
{
ret.inser
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:47:45 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it = occ.begin();
while(it != occ.end())
{
ret.insert(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:43:38: error: conversion from 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' to non-scalar type 'std::set<int>::iterator {aka std::_Rb_tree_const_iterator<int>}' requested
set<int>::iterator it = occ.begin();
~~~~~~~~~^~
func.cpp:44:14: error: no match for 'operator!=' (operand types are 'std::set<int>::iterator {aka std::_Rb_tree_const_iterator<int>}' and 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}')
while(it != occ.end())
~~~^~~~~~~~~~~~
In file included from /opt/lang/gcc/include/c++/6.2.0/map:60:0,
from func.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:320:7: note: candidate: bool std::_Rb_tree_const_iterator<_Tp>::operator!=(const _Self&) const [with _Tp = int; std::_Rb_tree_const_iterator<_Tp>::_Self = std::_Rb_tree_const_iterator<int>]
operator!=(const _Self& __x) const _GLIBCXX_NOEXCEPT
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:320:7: note: no known conversion for argument 1 from 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' to 'const _Self& {aka const std::_Rb_tree_const_iterator<int>&}'
In file included from /opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:64:0,
from /opt/lang/gcc/include/c++/6.2.0/bits/char_traits.h:39,
from /opt/lang/gcc/include/c++/6.2.0/string:40,
from solution.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_pair.h:376:5: note: candidate: template<class _T1, class _T2> constexpr bool std::operator!=(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)
operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_pair.h:376:5: note: template argument deduction/substitution failed:
func.cpp:44:25: note: 'std::set<int>::iterator {aka std::_Rb_tree
Code: 09:48:15 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it2 = occ.begin();
while(it != occ.end())
{
ret.insert(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:48:20 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it2 = occ.begin();
while(it2 != occ.end())
{
ret.insert(*it2);
it2++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:43:39: error: conversion from 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' to non-scalar type 'std::set<int>::iterator {aka std::_Rb_tree_const_iterator<int>}' requested
set<int>::iterator it2 = occ.begin();
~~~~~~~~~^~
func.cpp:44:15: error: no match for 'operator!=' (operand types are 'std::set<int>::iterator {aka std::_Rb_tree_const_iterator<int>}' and 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}')
while(it2 != occ.end())
~~~~^~~~~~~~~~~~
In file included from /opt/lang/gcc/include/c++/6.2.0/map:60:0,
from func.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:320:7: note: candidate: bool std::_Rb_tree_const_iterator<_Tp>::operator!=(const _Self&) const [with _Tp = int; std::_Rb_tree_const_iterator<_Tp>::_Self = std::_Rb_tree_const_iterator<int>]
operator!=(const _Self& __x) const _GLIBCXX_NOEXCEPT
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:320:7: note: no known conversion for argument 1 from 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' to 'const _Self& {aka const std::_Rb_tree_const_iterator<int>&}'
In file included from /opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:64:0,
from /opt/lang/gcc/include/c++/6.2.0/bits/char_traits.h:39,
from /opt/lang/gcc/include/c++/6.2.0/string:40,
from solution.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_pair.h:376:5: note: candidate: template<class _T1, class _T2> constexpr bool std::operator!=(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)
operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_pair.h:376:5: note: template argument deduction/substitution failed:
func.cpp:44:26: note: 'std::set<int>::iterator {aka std::_Rb_
Code: 09:48:46 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it = s.begin();
while(it != s.end())
ret.insert(*it2);
it2++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:48:51 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.insert(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:47:23: error: no matching function for call to 'std::vector<int>::insert(const int&)'
ret.insert(*it);
^
In file included from /opt/lang/gcc/include/c++/6.2.0/vector:69:0,
from solution.cpp:8:
/opt/lang/gcc/include/c++/6.2.0/bits/vector.tcc:107:5: note: candidate: std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, const value_type&) [with _Tp = int; _Alloc = std::allocator<int>; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; typename std::_Vector_base<_Tp, _Alloc>::pointer = int*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const int*, std::vector<int> >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const int*; std::vector<_Tp, _Alloc>::value_type = int]
vector<_Tp, _Alloc>::
^~~~~~~~~~~~~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/vector.tcc:107:5: note: candidate expects 2 arguments, 1 provided
In file included from /opt/lang/gcc/include/c++/6.2.0/vector:64:0,
from solution.cpp:8:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_vector.h:1015:7: note: candidate: std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = int; _Alloc = std::allocator<int>; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; typename std::_Vector_base<_Tp, _Alloc>::pointer = int*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const int*, std::vector<int> >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const int*; std::vector<_Tp, _Alloc>::value_type = int]
insert(const_iterator __position, value_type&& __x)
^~~~~~
/opt/lang/gcc/include/c++/
Code: 09:48:59 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.insert(it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:47:22: error: no matching function for call to 'std::vector<int>::insert(std::set<int>::iterator&)'
ret.insert(it);
^
In file included from /opt/lang/gcc/include/c++/6.2.0/vector:69:0,
from solution.cpp:8:
/opt/lang/gcc/include/c++/6.2.0/bits/vector.tcc:107:5: note: candidate: std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, const value_type&) [with _Tp = int; _Alloc = std::allocator<int>; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; typename std::_Vector_base<_Tp, _Alloc>::pointer = int*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const int*, std::vector<int> >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const int*; std::vector<_Tp, _Alloc>::value_type = int]
vector<_Tp, _Alloc>::
^~~~~~~~~~~~~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/vector.tcc:107:5: note: candidate expects 2 arguments, 1 provided
In file included from /opt/lang/gcc/include/c++/6.2.0/vector:64:0,
from solution.cpp:8:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_vector.h:1015:7: note: candidate: std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = int; _Alloc = std::allocator<int>; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; typename std::_Vector_base<_Tp, _Alloc>::pointer = int*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const int*, std::vector<int> >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const int*; std::vector<_Tp, _Alloc>::value_type = int]
insert(const_iterator __position, value_type&& __x)
^~~~~~
/opt/lang/gcc/
Code: 09:49:10 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->second);
}
it++;
}
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [4] expected [2, 3]
stdout:
inserting inserting inserting
1.
0.001 s
WRONG ANSWER,
got [4] expected [2, 3]
stdout:
inserting
Code: 09:49:22 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->firs);
}
it++;
}
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:49:25 UTC,
cpp,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->first);
}
it++;
}
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [1, 2] expected [2, 3]
stdout:
inserting inserting inserting
1.
0.001 s
WRONG ANSWER,
got [2] expected [2, 3]
stdout:
inserting
Code: 09:49:41 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->first);
}
it++;
}
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:50:11 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
cout << "inserting\n";
s.insert(it->first);
}
it++;
}
}
co
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:50:35 UTC,
cpp,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->first);
}
it++;
}
}
while(it != occ.end())
{
cout occ[]
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:50:45 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->first);
}
it++;
}
}
while(it != occ.end())
{
cout << it->first;
it++;
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:45:11: error: 'it' was not declared in this scope
while(it != occ.end())
^~
Code: 09:50:56 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->first);
}
it++;
}
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
cout << it->first;
it++;
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:53:24: error: conflicting declaration 'std::set<int>::iterator it'
set<int>::iterator it = s.begin();
^~
func.cpp:44:28: note: previous declaration as 'std::map<int, int>::iterator it'
map<int,int>::iterator it = occ.begin();
^~
func.cpp:54:14: error: no match for 'operator!=' (operand types are 'std::map<int, int>::iterator {aka std::_Rb_tree_iterator<std::pair<const int, int> >}' and 'std::set<int>::iterator {aka std::_Rb_tree_const_iterator<int>}')
while(it != s.end())
~~~^~~~~~~~~~
In file included from /opt/lang/gcc/include/c++/6.2.0/map:60:0,
from func.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:241:7: note: candidate: bool std::_Rb_tree_iterator<_Tp>::operator!=(const _Self&) const [with _Tp = std::pair<const int, int>; std::_Rb_tree_iterator<_Tp>::_Self = std::_Rb_tree_iterator<std::pair<const int, int> >]
operator!=(const _Self& __x) const _GLIBCXX_NOEXCEPT
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_tree.h:241:7: note: no known conversion for argument 1 from 'std::set<int>::iterator {aka std::_Rb_tree_const_iterator<int>}' to 'const _Self& {aka const std::_Rb_tree_iterator<std::pair<const int, int> >&}'
In file included from /opt/lang/gcc/include/c++/6.2.0/bits/stl_algobase.h:64:0,
from /opt/lang/gcc/include/c++/6.2.0/bits/char_traits.h:39,
from /opt/lang/gcc/include/c++/6.2.0/string:40,
from solution.cpp:3:
/opt/lang/gcc/include/c++/6.2.0/bits/stl_pair.h:376:5: note: candidate: template<class _T1, class _T2> constexpr bool std::operator!=(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)
operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
^~~~~~~~
/opt/lang/gcc/include/c++/6.2.0/bits/stl_pair.h:376:5: note: template argument deduction/substitution failed:
func.cpp:54:23: note: 'std::map<int, int>::iterator
Code: 09:51:05 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->first);
}
it++;
}
}
map<int,int>::iterator it2 = occ.begin();
while(it != occ.end())
{
cout << it->first;
it++;
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:51:08 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->first);
}
it++;
}
}
map<int,int>::iterator it2 = occ.begin();
while(it2 != occ.end())
{
cout << it2->first;
it2++;
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [1, 2] expected [2, 3]
stdout:
123
1.
0.001 s
WRONG ANSWER,
got [2] expected [2, 3]
stdout:
12
Code: 09:55:32 UTC,
java,
autosave
Code: 09:55:36 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
vector<int> ret;
map<int,int> occ;
unsigned int nNumSegs = A.size() - (K-1);
for(unsigned int i = 0; i < nNumSegs; i++)
{
vector<int> copy = A;
for(unsigned int j = i; j < (i + (K-1)); j++)
{
occ[copy[j]]++;
}
map<int,int>::iterator it = occ.begin();
while(it != occ.end())
{
if(it->second > fHalf)
{
s.insert(it->first);
}
it++;
}
}
map<int,int>::iterator it2 = occ.begin();
while(it2 != occ.end())
{
cout << it2->first;
it2++;
}
set<int>::iterator it = s.begin();
while(it != s.end())
{
ret.push_back(*it);
it++;
}
// copy(s.begin(),s.end(), ret.begin());
return ret;
}
Code: 09:55:52 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
set<int> s;
float fHalf = A.size() / 2;
return ret;
}
Code: 09:56:22 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size())
{
occurrences
}
return ret;
}
Code: 09:56:39 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size())
{
if(find()
occurrences
}
return ret;
}
Code: 09:57:10 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size())
{
if(occurrences.find(A[i]) == occurrences.end()_)
}
return ret;
}
Code: 09:57:31 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size())
{
if(occurrences.find(A[i]) == occurrences.end())
occurrences[A[i]] = 1;
else
occurrences[A[i]]];;
}
return ret;
}
Code: 09:57:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size())
{
if(occurrences.find(A[i]) == occurrences.end())
occurrences[A[i]] = 1;
else
occurrences[A[i]]]++;
}
return ret;
}
Code: 10:27:54 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size())
{
}
return ret;
}
Code: 10:28:11 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> copy = A;
for(int i = 0; i < copy.size())
{
}
return ret;
}
Code: 10:28:28 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> copy = A;
for(int i = 0; i < copy.size() - K)
{
}
return ret;
}
Code: 10:28:43 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> copy = A;
for(int i = 0; i < copy.size() - (K -1))
{
}
return ret;
}
Code: 10:28:57 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1))
{
vector<int> copy = A;
}
return ret;
}
Code: 10:29:21 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1))
{
vector<int> copy = A;
for(int j = i; j (i+))
}
return ret;
}
Code: 10:29:32 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1))
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
}
}
return ret;
}
Code: 10:29:55 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1))
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < A.size() - (K -1);j++)
{
}
}
return ret;
}
Code: 10:30:07 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1))
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < A.size() ;j++)
{
cout << copy
}
}
return ret;
}
Code: 10:30:20 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1))
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]
}
}
return ret;
}
Code: 10:30:34 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1))
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:16:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < A.size() - (K -1))
~~^~~~~~~~~~~~~~~~~~~
func.cpp:16:41: error: expected ';' before ')' token
for(int i = 0; i < A.size() - (K -1))
^
func.cpp:25:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < copy.size() ;j++)
~~^~~~~~~~~~~~~
func.cpp:37:12: error: 'ret' was not declared in this scope
return ret;
^~~
func.cpp:12:11: warning: unused variable 'fHalf' [-Wunused-variable]
float fHalf = A.size() / 2;
^~~~~
Code: 10:30:46 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:16:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < A.size() - (K -1); i++)
~~^~~~~~~~~~~~~~~~~~~
func.cpp:25:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < copy.size() ;j++)
~~^~~~~~~~~~~~~
func.cpp:37:12: error: 'ret' was not declared in this scope
return ret;
^~~
func.cpp:12:11: warning: unused variable 'fHalf' [-Wunused-variable]
float fHalf = A.size() / 2;
^~~~~
Code: 10:30:54 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vec
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:30:57 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 2 4 1 2 2 3 2 2 4 2 2 2 3 2 1 4 2 3 2 3 2 1 3 2 3 3 3 2 1 3 1 3 3 4
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 3 3 2 2 1 3 3 2 3
Code: 10:31:15 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:31:25 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:31:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:31:52 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:32:09 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[i]] = copy[j];
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:32:35 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]] = copy[j];
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:32:56 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]] = copy[j];
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 2 4 1 2 2 3 2 2 4 2 2 2 3 2 1 4 2 3 2 3 2 1 3 2 3 3 3 2 1 3 1 3 3 4
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 3 3 2 2 1 3 3 2 3
Code: 10:33:15 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]+
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:33:17 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 2 4 1 2 2 3 2 2 4 2 2 2 3 2 1 4 2 3 2 3 2 1 3 2 3 3 3 2 1 3 1 3 3 4
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 3 3 2 2 1 3 3 2 3
Code: 10:33:32 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:33:59 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 2 4 1 2 2 3 2 2 4 2 2 2 3 2 1 4 2 3 2 3 2 1 3 2 3 3 3 2 1 3 1 3 3 4
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 3 3 2 2 1 3 3 2 3
Code: 10:34:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
it++;
}
}
return ret;
}
Code: 10:34:19 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second;
it++;
}
}
return ret;
}
Code: 10:34:26 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
3 2 4 1 2 2 3 2 1 3 1 4 1 2 2 4 2 2 2 3 2 3 3 1 4 2 2 1 4 2 3 2 3 2 4 3 2 4 3 2 1 3 2 3 3 3 2 5 3 4 4 3 2 1 3 1 3 3 4 2 5 3 6 4 4
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 3 3 2 2 2 2 3 2 1 3 3 2 3 2 3 3 5
Code: 10:34:41 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
// cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 1 3 1 4 1 2 3 3 1 4 2 2 4 3 2 4 3 2 5 3 4 4 3 2 5 3 6 4 4
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 2 3 2 2 3 3 5
Code: 10:35:27 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K-1); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
// cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Code: 10:35:28 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
map<int,int> occurrences;
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
vector<int> copy = A;
for(int j = i; j < (i+K-1); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
// cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 1 3 1 2 2 3 1 4 1 2 3 3 1 4 2 2 4 3 2 4 2 2 4 3 4 4 2
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 1 3 2 2 2 3 4
Code: 10:35:56 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K-1); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
// cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 1 3 1 2 1 4 1 2 1 4 1 2 1 3 1 3 2
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 1 3 2 2 1 3 2
Code: 10:37:06 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
// cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 1 3 1 4 1 2 2 4 1 2 1 3 1 4 1 2 1 3 2 3 2 4 1
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 2 3 2 2 1 3 3
Code: 10:37:14 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Code: 10:37:14 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 1 3 1 4 1 2 2 4 1 2 1 3 1 4 1 2 1 3 2 3 2 4 1
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 2 3 2 2 1 3 3
Code: 10:38:07 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Code: 10:38:13 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
cout << copy[j];
occurrences[copy[j]]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
324 2 1 3 1 4 1 242 2 2 4 1 423 2 1 3 1 4 1 233 2 1 3 2 334 3 2 4 1
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2332 2 2 3 2 3323 2 1 3 3
Code: 10:38:37 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
}
return ret;
}
Code: 10:38:47 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:38:53 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
Code: 10:39:07 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:39:37 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < occurrences.size(); j++)
{
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:39:53 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:39:54 UTC,
cpp,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
1 1 2 3 3 2 4 1 2 5 3 1 4 1 1 1 2 3 3 2 4 1 1 1 2 2 3 4 1 2 2 1 3 3 4 1
1.
0.001 s
WRONG ANSWER,
got [] expected [2, 3]
stdout:
2 3 3 2 1 1 2 1 3 3
Code: 10:40:27 UTC,
cpp,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
cout << it->first << " " << it->second << "\n";
;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:40:52 UTC,
cpp,
verify,
result: Failed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->second;)
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:16:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < A.size() - (K -1); i++)
~~^~~~~~~~~~~~~~~~~~~
func.cpp:28:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < copy.size(); j++)
~~^~~~~~~~~~~~~
func.cpp:38:41: error: expected ')' before ';' token
ret.push_back(it->second;)
^
func.cpp:38:42: error: expected primary-expression before ')' token
ret.push_back(it->second;)
^
func.cpp:43:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < copy.size() ;j++)
~~^~~~~~~~~~~~~
Code: 10:40:57 UTC,
cpp,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->second)
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Code: 10:40:58 UTC,
cpp,
verify,
result: Failed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->second);
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got [5, 4] expected [2, 3]
stdout:
1.
0.001 s
WRONG ANSWER,
got [3, 3] expected [2, 3]
stdout:
Code: 10:41:08 UTC,
cpp,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
{
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->first);
it++;
}
for(int j = 0; j < copy.size() ;j++)
{
// cout << copy[j]<< " ";
}
cout << "\n";
}
return ret;
}
Analysis
Code: 10:41:27 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
}
for(int j = 0; j < copy.size(); j++)
{
occurrences[copy[j]]++;
}
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->first);
it++;
}
}
return ret;
}
Code: 10:41:38 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->first);
it++;
}
}
return ret;
}
Code: 10:41:50 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->first);
it++;
}
}
return ret;
}
Code: 10:42:00 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
ret.push_back(it->first);
it++;
}
}
return ret;
}
Code: 10:42:31 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.i(it->first);
it++;
}
}
return ret;
}
Code: 10:42:42 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
return ret;
}
Code: 10:42:52 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
vector<int> ret;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
std::
return ret;
}
Code: 10:43:19 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret()
return ret;
}
Code: 10:43:40 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end())
return ret;
}
Analysis
Compile error
func.cpp: In function 'std::vector<int> solution(int, int, std::vector<int>&)':
func.cpp:15:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < A.size() - (K -1); i++)
~~^~~~~~~~~~~~~~~~~~~
func.cpp:24:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < copy.size(); j++)
~~^~~~~~~~~~~~~
func.cpp:40:5: error: expected ',' or ';' before 'return'
return ret;
^~~~~~
func.cpp:41:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
Code: 10:43:47 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Analysis
Code: 10:44:03 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(unsigneint j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Code: 10:44:05 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(unsigned int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Analysis
Code: 10:44:14 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(unsigned int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(int j = i; j < (i+K); j++)
copy[j]++;
for(unsigned int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Analysis
Code: 10:44:24 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(unsigned int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(unsigned int j = i; j < (i+K); j++)
copy[j]++;
for(unsigned int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Analysis
Code: 10:44:40 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(unsigned int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(unsigned int j = i; j < (i+K); j++)
copy[j]++;
for(unsigned int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Code: 10:44:53 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(unsigned int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(unsigned int j = i; j < (i+K); j++)
copy[j]++;
for(unsigned int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Code: 10:45:14 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(unsigned int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(unsigned int j = i; j < (i+K); j++)
copy[j]++;
for(unsigned int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Analysis
Code: 10:45:17 UTC,
cpp,
final,
score:
55
// you can use includes, for example:
// #include <algorithm>
#include <map>
#include <set>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(int K, int M, vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
float fHalf = A.size() / 2;
set<int> s;
for(unsigned int i = 0; i < A.size() - (K -1); i++)
{
map<int,int> occurrences;
vector<int> copy = A;
for(unsigned int j = i; j < (i+K); j++)
copy[j]++;
for(unsigned int j = 0; j < copy.size(); j++)
occurrences[copy[j]]++;
map<int,int>::iterator it = occurrences.begin();
while(it!= occurrences.end())
{
if(it->second > fHalf)
s.insert(it->first);
it++;
}
}
vector<int> ret(s.begin(),s.end());
return ret;
}
Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N*(N+M)) or O(N**2)
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
6.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
expand all
Performance tests
medium_tests1
medium tests (N = 10000, M = 100)
medium tests (N = 10000, M = 100)
✘
TIMEOUT ERROR
running time: 0.316 sec., time limit: 0.100 sec.
running time: 0.316 sec., time limit: 0.100 sec.
1.
0.316 s
TIMEOUT ERROR,
running time: 0.316 sec., time limit: 0.100 sec.
2.
0.388 s
TIMEOUT ERROR,
running time: 0.388 sec., time limit: 0.100 sec.
3.
0.356 s
TIMEOUT ERROR,
running time: 0.356 sec., time limit: 0.100 sec.
medium_tests2
medium tests(N >= 20000, M=30000)
medium tests(N >= 20000, M=30000)
✘
TIMEOUT ERROR
running time: 1.808 sec., time limit: 0.100 sec.
running time: 1.808 sec., time limit: 0.100 sec.
1.
1.808 s
TIMEOUT ERROR,
running time: 1.808 sec., time limit: 0.100 sec.
2.
0.852 s
TIMEOUT ERROR,
running time: 0.852 sec., time limit: 0.100 sec.
3.
0.776 s
TIMEOUT ERROR,
running time: 0.776 sec., time limit: 0.100 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
1.
0.008 s
OK
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.