알고리즘 문제 풀이/1DP_과제(~180615)
180227_1008_A/B
//https://www.acmicpc.net/problem/1008 #include using namespace std; int main(){ double A, B; cin >> A >> B; cout.precision(10); cout
백준
알고리즘 문제 풀이/1DP_과제(~180615)
180217_2660_회장뽑기
//https://www.acmicpc.net/problem/2660 #include #include using namespace std;bool frd[51][51];bool visit[51];int score[51];int list[51];int n;int mn=51*51;int num; void input();int bfs(int people);void find();void init(); int main(){ input(); for(int i=1; i> n; int a=1, b=1; while(a!=-1 && b!=-1) { cin >> a >> b; frd[a][b]=frd[b][a]=1; }} int bfs(int people){ queue q; int tmp_cnt=1; int scr=-1; ..
알고리즘 문제 풀이/1DP_과제(~180615)
180216_2605_줄 세우기
//https://www.acmicpc.net/problem/2605 #include #include using namespace std;int students[101];int ans[101];int n;void order(){ int x; cin >> n >> x; ans[1]=1; for(int i=2; i> x; for(int j=i-1; j>=i-x; j--){ ans[j+1]=ans[j]; } ans[i-x]=i; }} void output(){ for(int i=1; i
알고리즘 문제 풀이/1DP_과제(~180615)
180215_10451_순열 사이클
//https://www.acmicpc.net/problem/10451 #include using namespace std;int graph[1001];bool visited[1001];int n; void init(){ for(int i=0; i> n; for(int i=1; i> graph[i];} void dfs(int now){ visited[now]=1; int next=graph[now]; if(!visited[next]) dfs(next);}int main(){ int t; cin >> t; while(t-->0){ init(); input(); int ans=0; for(int i=1; i
