C++ exercise, solving Sudoku puzzle

I need to create a program (using backtracking algorithm) that will solve Sudoku puzzle given the size of the grid (4,9,16 and so on). it should solve both an empty grid and partially filled grid. I would like to implement it using vectors, stacks and sets. Preferably without classes or other stuff. I want to keep it simple. Basically as I see it right now you would probably need to create 3 vectors of sets for rows, columns and square constraints and then just keep filling those vectors. The final result should be pushed to a stack or another vector and then printed out. The syntax should be something like [login to view URL] 9 1 3 4 3 2 4, where the first number is the size of the grid and the next numbers are x,y coordinates and the value for that coordinate for partially filled grid. Of course it should throw an error if the size of the grid does not have square root of it. If you have ever worked with backtracking algorithm (like Queens), it should be easy for you. I tried making that program by myself but got stuck and right now it just takes too much time for me. Please place a bid only if you know how to make that program work. It should be done rather quickly. 2-3 days max. I can provide some examples and tips I have if needed or any other info if the project is not clear enough for you. Feel free to ask questions. When contacting me please indicate how soon you will be able to finish it. Serious bidders only! Thank you.