프로그래머스 소수 찾기

https://school.programmers.co.kr/learn/courses/30/lessons/42839#

프로그래머스

#include <string>
#include <vector>
#include <iostream>
#include <cmath>
#include<map>
using namespace std;
int count=0;
map<long, long> gm;
// 소수 확인
bool FindNumber(long num){
    if(num<=1){
        return true;
    }
    for(long i=2;i<num;i++){
         
        if(num%i==0){ return true;} //true 시 소수 아님
    }
    return false; //false면 소수임
}

//char to string
string convertString(char c){
    char char_arr=c;
    string str(1,char_arr);
    return str; 
}
//조합
void combine(string start, string numbers,vector<bool>bCheck,int n,int index){
    if(index>=n-1){
        if(FindNumber(stoll(start))==false){
            gm[stoll(start)]=stoll(start);
          }
        return ;
    }
    
    for(int i=0;i<n;i++){
        if(bCheck[i]==false){
          bCheck[i]=true;
          
          if(FindNumber(stoll(start))==false){
              gm[stoll(start)]=stoll(start);
          }
          combine(start+convertString(numbers[i]),  numbers,bCheck,numbers.size(),index+1);  
          bCheck[i]=false;
        }
        
    }
    return;
}
int solution(string numbers) {
    int answer = 0;
    vector<bool>bCheck(numbers.size(),false);
  
    for(int i=0;i<numbers[i];i++){
        //1, 2,  3 ,4,5,6,7,8,9
        bCheck[i]=true; 
        combine(convertString(numbers[i]),  numbers,bCheck,numbers.size(),0);
        bCheck[i]=false;
    }
    /*
   for(auto it =gm.begin();it!=gm.end();++it){
       cout<<it->first<<",";
   }*/
    answer=gm.size();
    return answer;
}