Search found 430 matches

by misof
Sat Jul 01, 2006 8:55 pm
Forum: C
Topic: Passwords Strategy in C
Replies: 2
Views: 4345

Basic hiding techniques lead to successful usage of basic methods of finding the hidden password. If you want something secure, read some crypto-related stuff, and e.g. take a look at OpenSSL or some other crypto library. Of course, all of this depends on what the password does and how it is used. I...
by misof
Mon Jun 26, 2006 2:13 am
Forum: Bugs and suggestions
Topic: NEW JUDGE'S STATUS
Replies: 20
Views: 18353

Well, good luck! I know you're gonna need some :) May all the changes run smoothly, and may the new judge be even better...

Just out of curiosity, what are the perspectives? How long will the people that programmed this new judge be around to maintain it? Any plans on what happens afterwards?
by misof
Mon Jun 19, 2006 8:37 am
Forum: Algorithms
Topic: bridge / critical links
Replies: 3
Views: 1668

You are right. An equivalent definition: edge is a bridge if and only if it is not a part of any cycle. In your graph, the edges 3-9, 3-10, and 5-6 are bridges. A vertex is an articulation point (somewhere you can see also the name "cutvertex") if and only if its removal increases the number of comp...
by misof
Sun Jun 18, 2006 12:17 am
Forum: Off topic (General chit-chat)
Topic: Error Massage!!!
Replies: 1
Views: 1833

Umm... because it's not an official page? As far as I know, Abednego doesn't have access into UVa's database, his scripts just occassionally collect the info from UVa webpages. If it is the case that his page wasn't updated for a longer time than seems reasonable, why don't you try contacting him pe...
by misof
Mon Jun 12, 2006 11:49 am
Forum: C++
Topic: Is There a problem?
Replies: 3
Views: 1838

IIRC, cin.eof() is only true after an end-of-input error occured. The best practice is usually "read until no further read is possible", in your case one possibility would be string S; while (getline(cin,S)) { ... } ... or the gets() you used in your AC submission One other thing, consider testing y...
by misof
Mon Jun 12, 2006 11:44 am
Forum: Bugs and suggestions
Topic: 10303 - irritation in the problem statement
Replies: 5
Views: 3010

The current text is A binary search tree is a binary tree with root k such that any node v reachable from its left has label (v) <label (k) and any node w reachable from its right has label (w) > label (k). It is a search structure which can find a node with label x in O(log n) average time, where n...
by misof
Thu Jun 08, 2006 8:15 am
Forum: C++
Topic: constans array of string?
Replies: 1
Views: 1454

Code: Select all

#include <iostream>
#include <string>
using namespace std;

string myStrings[] = {"hello", "world", "funny", "isn't", "it"};

int main() {
  cout << myStrings[1] << endl; // prints "world"
}
I can't imagine a reason why one should use #define here.
by misof
Sun Jun 04, 2006 11:14 pm
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 37184

Old g++ (version 2.95) doesn't have the .at() method for vectors. Use [] instead.

(As a side note: Yeah, we all know this years old gcc sucks.)
by misof
Thu Jun 01, 2006 5:14 pm
Forum: Other words
Topic: World Finals 2006 Ready to submit
Replies: 9
Views: 4014

Moheeb wrote:do u want to say that Floyd Warshall
algorithm is trivial . :roll:
Not under all circumstances. But for teams that made it into the ACM World Finals, it should be trivial.
by misof
Tue May 30, 2006 8:22 am
Forum: Algorithms
Topic: programming pearls duplicate value
Replies: 3
Views: 1232

There are only 2^32 = 4294967296 values a (32-bit) integer variable can have.

Isn't the description you quote clear enough? In one pass through the file one can count the numbers in some given interval [A,B), this is the tool used to do binary search for the repeated value.
by misof
Wed May 24, 2006 8:47 am
Forum: Algorithms
Topic: Hemming
Replies: 2
Views: 969

You've got the wording wrong ;) The correct term is "Hamming distance". The Hamming distance of two vectors / strings is the number of places in which they differ. Guessing from your example I/O, one possible problem statement for your task is: given two strings S, T, find a string U such that max( ...
by misof
Mon May 22, 2006 1:51 pm
Forum: Off topic (General chit-chat)
Topic: Solution Repository
Replies: 4
Views: 2628

For the algorithms part (and probably also for UVa solutions), don't reinvent the wheel and rather contribute to the existing http://algorithmist.com/

Plus, I like its way (posting primarily the solution idea, NOT the source code) much better.
by misof
Tue May 16, 2006 2:30 am
Forum: Other words
Topic: IPSC 2006 -- invitation to a programming contest
Replies: 3
Views: 2251

Bump :)

Don't forget, IPSC is here in two days' time...
by misof
Fri May 12, 2006 8:43 am
Forum: Volume 110 (11000-11099)
Topic: 11002 - Towards Zero
Replies: 39
Views: 17551

I didn't have the time to solve it yet, but the general idea should be: process all squares from bottom to top. For each square compute the set of sums that are possible at the moment when you stand there. E.g., for the image in the problem statement: for the only square with the number 8 the possib...
by misof
Tue May 09, 2006 8:15 pm
Forum: Off topic (General chit-chat)
Topic: about "Pan Totek"
Replies: 5
Views: 2603

... and doing that requires less submissions, by far.

Go to advanced search