제목을 기준으로 오름차순으로 정렬함
Master Peace – 최 원재
2009,00:12:00
고양이와 나 – 안동희
2004,00:07:20
그들의 바다 – 김운기
2006,00:12:00
내 친구 고라니 – 장형윤
2009,00:04:11
도시에서 그녀가 피할 수 없는 것들 – 박지연
2008,00:12:45
드렁큰스타 – 이동명, 배성균, 김석, 김정욱, 안지윤
2008,00:02:48
띠띠리부 만딩씨 – 홍학순
2009,00:06:50
로망은 없다 – 박재욱,홍은지,수경
2009,01:10:00
비 오는 날의 산책 – 최현명
2006,00:04:40
수박병아리 – 원종식
20007,00:08:10
스탑 – 박재옥
2008,00:05:35
아낌없이 치고받는 나무 – 홍대영
2006,00:06:08
아빠가 필요해 – 장형윤
2005,00:10:00
엘리뇨 – 임아론
2007,00:09:03
Comment:
This program is writen by Leo Davidson
and little modified by Kjwon15
How to Work:
1. Check parameter (first run, parameter is empty)
2. Extract DLL file at temp directory
3. Find explorer.exe and inject DLL
4. Injected DLL is run this program again (with parameter /s)
5. This mother process is end
6. Child process (Running as admin) excute RealMain() function
//#include "stdafx.h"
#include<stdio.h>
FILE *fin=fopen("input.txt", "r");
FILE *fout=fopen("output.txt", "w");
void back(int point);
int data[9][9];
int row_chk[9][9], col_chk[10][10];
int square_num[9][9], square_chk[9][9], square_cnt;
int zero_point[81][2], zero_cnt;
int main(){
int i, j, k, l;
for(i=0; i<9; i+=3){
for(j=0; j<9; j+=3){
for(k=i; k<i+3; k++){
for(l=j; l<j+3; l++){
square_num[k][l] = square_cnt; // 3*3 square array
}
}
square_cnt++;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
printf("%d",square_num[i][j]);
printf("\n");
}
for(i=0; i<9; i++){
for(j=0; j<9; j++){
fscanf(fin, "%d", &data[i][j]); // input data[i][j]
if(data[i][j]){
row_chk[i][data[i][j]]=1; // checking row data[i][j]
col_chk[j][data[i][j]]=1; // checking col data[i][j]
square_chk[square_num[i][j]][data[i][j]]=1; // checking square data[i][j]
}
else{
zero_point[zero_cnt][0] = i; // count 0 and save 0's row
zero_point[zero_cnt++][1] = j; // and save 0's col too
}
}
}
back(0); // start backtracking
fclose(fin);
fclose(fout);
return 0;
}
void back(int point)
{
printf("back tracking %d is started\n",point);
int i, j;
int x, y;
if(point == zero_cnt){ // 0 is all filled
for(i=0; i<9; i++){
for(j=0; j<9; j++){
fprintf(fout, "%d ", data[i][j]); // printing!!
}
fprintf(fout, "\n");
}
exit(0); // and teminate program
}
x = zero_point[point][0]; // (point+1)th 0's row (array is start from 0, so +1th is just "point")
y = zero_point[point][1]; // (point+1)th 0's col
for(i=1; i<=9; i++){
if(!row_chk[x][i-1] && !col_chk[y][i-1] && !square_chk[square_num[x][y]][i-1]){ // check data[x][y] is already used
row_chk[x][i-1] = col_chk[y][i-1] = square_chk[square_num[x][y]][i-1] = 1; // checking data[x][y] is used
data[x][y] = i; // and input i at data[x][y]
back(point + 1); // we have more work...
data[x][y] = row_chk[x][i-1] = col_chk[y][i-1] = square_chk[square_num[x][y]][i-1] = 0; // if "back() is failed, init cell
}
}
printf("back tracking %d is ends\n",point);
}