Submission #597728

# Submission time Handle Problem Language Result Execution time Memory
597728 2022-07-16T17:45:48 Z Deepesson NoM (RMI21_nom) C++17
0 / 100
1 ms 256 KB
#include <bits/stdc++.h>

void forca_bruta(int N,int M){
    std::vector<int> array;
    for(int i=0;i!=N;++i){
        array.push_back(i);array.push_back(i);
    }
    std::sort(array.begin(),array.end());
    int count=0;
    do{
        for(int i=0;i!=2*N;++i){
            int p = i+M;
            if(p<2*N&&array[p]==array[i]){
                goto fail;
            }
        }
        ++count;
        fail:{}
    }while (std::next_permutation(array.begin(),array.end()));
    std::cout<<count<<"\n";
}
int main()
{
    int N,M;
    std::cin>>N>>M;
    forca_bruta(N,M);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -