UVa OJ Board

Thanks jurajz! I changed my function to: string div2(const string& s) { const int SIZE = s.size(); const int TWO = 2; string r; int ten = 0; for(int i = 0; i < SIZE; ++i) { int digit = (s[i] - '0') + ten; if(digit % TWO == 0) { r += (digit / TWO) + '0'; } else { if(digit != 1) { r += (digit / TWO) +...

I have a problem with the input case: 16 115792089237316195423570985008687907853269984665640564039457584007913129639935 16 15 I have checked and rechecked the code, but I can't find the error! Thanks #include <iostream> #include <vector> using namespace std; enum Direction { NORTH = 0, EAST = 1, SOU...

I was trying to solve problem 532 Dungeon Master This code got TLE (in 3 sec. it didn't solve the problem): struct Node { int x; int y; int z; int distance; Node(int x = -1, int y = -1, int z = -1, int d = 0) : x(x), y(y), z(z), distance(d) {}; }; int bfs(const vector< vector<string> >& map, const i...

Minimal Circle http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1450 What I was thinking is: for n <= 3 points I used the obvious formulas. For n > 3: First to use the Akl Touissant heuristic to calculate Convex Hull (look for the 4 extreme points and remove any interior points to that q...

I enjoy algorithms in a nutshell

Spiderman’s workout I'm starting with: function workout(int h, vector<int> d, int idx) { if(idx == d.size()) { // There are no more distances return (h == 0) ? EXIT : FAIL; // Did I return to the ground? } if(h < d[i]) { // I can only go Up return workout(h + d[i], d, i+1); } return optimal(workout...

This is what I did in my AC code: Do a BFS-like algorithm: Have a cache of solutions and a queue. Put in the queue the initial state "123456789" which has solution "" and moves=0 While there are states in the queue: Process the actual state Create all 6 neighbors states If the neighbor is not in the...

Thanks 898989!

That was the mistake! (I can't believe how did I miss it) I finally got AC

I'm getting WA.

A low "Total Submissions / Solving %" with a high "Total Users / Solving %" usually means a tricky input.

The problem says "A blank line always precedes the letter grid" It seems like a clue but I can't figure it out.

Thanks!

My code:

This post is not about asking for help so much as sharing approaches: I travel the given square in a spiral-way adding the integers I find. When I get to a visited cell I tried to turn right and continue. After visiting all cells I stop. Every time I turn and I'm facing right I store the value of th...

I honestly don't know where to begin to attack this problem but it seems that this problem is really easy.

Could anyone give me a little hints about where to start?

By the way: I don't know what the other posters are meaning about x component and y component.

Thanks a lot.

I don`t know.. what`s wrong? Plz Help me :cry: I'm using the same idea but also get WA. At first I thought that your error was really a PE because of: cout << "Minimum Number of Trips = " << result << endl << endl; But it still got WA. My code is: #include <iostream> #include <vector> #include <que...

It seems that the answer is OK but I have problems with the presentation. I have tried every thing that I can think of and I still got WA. Can anyone help me? Thanks. #include <iostream> #include <vector> #include <string> using namespace std; ostream& operator<<(ostream& out, vector<string>& v) { i...

The first time I tried to backtrack but I got discouraged because I supposed that I will never solve in time. What I had in mind was to: 1- Count the number of characters in all the equation if is more than 10 then do nothing. 2- Backtrack trying to guess numbers from 0 to 9 for every non-replaced-y...

DP wrote:Can someone tell me, how the following Input produce 8 move(s) for knight?

Code: Select all

11111
00111 
00111
0 001
00000 

I found it from board. PLease help me!!!

This reply took 1 year but in case anyone cares anymore, yes the correct output is "Solvable in 8 move(s)."