Sponsored Content
Top Forums Programming Programming Challenges - A List Post 302120207 by blowtorch on Tuesday 5th of June 2007 02:46:39 AM
Old 06-05-2007
Challenge: DRAM

Difficulty: Easy to Medium in C, Easy in perl/python

As the problem says, the value of the palindrome may exceed your system's defined integer size in C/C++.
 

3 More Discussions You Might Find Interesting

1. AIX

AIX 6.1 IDSLDAP Installation Challenges

Please bare with me, since I am new to AIX and LDAP. I am attempting to install idsldap server on our AIX 6.1 NIM server. I installed the following packages: root@nim(/)# lslpp -l|grep ldap db2_08_01.ldap 8.1.1.80 COMMITTED DB2 LDAP Support idsldap.clt64bit61.rte 6.1.0.17 COMMITTED... (6 Replies)
Discussion started by: ecollins
6 Replies

2. UNIX for Advanced & Expert Users

Challenges in finding and copying the block

Hi, I have a below challenging task where iam unable to find the block and copy the same into a file. I tried my luck,howver iam unable to reach the first and second step..Can anyone help me with a clue or with the commands so that i can give a try. 1. search the <number>9966993366</number>... (2 Replies)
Discussion started by: cskumar
2 Replies

3. Shell Programming and Scripting

Korn shell script - SQL statement challenges

Hi scripting experts. I have some coding challenges that I'm hoping you can help me out. I have one file#1 that contains the following sql statement that spans over multiple lines: sql Select /*+ use_has(a,b) */ * from customer a, customer_address b where a.id = b.id... (1 Reply)
Discussion started by: pchang
1 Replies
Graph::Easy::Layout::Chain(3pm) 			User Contributed Perl Documentation			   Graph::Easy::Layout::Chain(3pm)

NAME
Graph::Easy::Layout::Chain - Chain of nodes for layouter SYNOPSIS
# used internally, do not use directly use Graph::Easy; use Graph::Easy::Layout::Chain; my $graph = Graph::Easy->new( ); my ($node, $node2) = $graph->add_edge( 'A', 'B' ); my $chain = Graph::Easy::Layout::Chain->new( start => $node, graph => $graph, ); $chain->add_node( $node2 ); DESCRIPTION
A "Graph::Easy::Layout::Chain" object represents a chain of nodes for the layouter. METHODS
new() my $chain = Graph::Easy::Layout::Chain->new( start => $node ); Create a new chain and set its starting node to $node. length() my $len = $chain->length(); Return the length of the chain, in nodes. my $len = $chain->length( $node ); Given an optional $node as argument, returns the length from that node onwards. For the chain with the three nodes A, B and C would return 3, 2, and 1 for A, B and C, respectively. Returns 0 if the passed node is not part of this chain. nodes() my @nodes = $chain->nodes(); Return all the node objects in the chain as list, in order. add_node() $chain->add_node( $node ); Add $node to the end of the chain. start() my $node = $chain->start(); Return first node in the chain. end() my $node = $chain->end(); Return last node in the chain. layout() my $todo = $chain->layout(); Return an action stack as array ref, containing the nec. actions to layout the chain (nodes, plus interlinks in the chain). Will recursively traverse all chains linked to this chain. merge() my $chain->merge ( $other_chain ); my $chain->merge ( $other_chain, $where ); Merge the other chain into ourselves, adding its nodes at our end. The other chain is emptied and must be deleted by the caller. If $where is defined and a member of $other_chain, absorb only the nodes from $where onwards, instead of all of them. error() $last_error = $node->error(); $node->error($error); # set new messags $node->error(''); # clear error Returns the last error message, or '' for no error. dump() $chain->dump(); Dump the chain to STDERR, to aid debugging. EXPORT
None by default. SEE ALSO
Graph::Easy, Graph::Easy::Layout. AUTHOR
Copyright (C) 2004 - 2006 by Tels <http://bloodgate.com>. See the LICENSE file for more details. perl v5.14.2 2011-12-23 Graph::Easy::Layout::Chain(3pm)
All times are GMT -4. The time now is 06:31 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy