Submission #597728

#TimeUsernameProblemLanguageResultExecution timeMemory
597728DeepessonNoM (RMI21_nom)C++17
0 / 100
1 ms256 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...