langref.org - python, cpp, and clojure

All Problems

Strings

Printing

Output a string to the console

Write the string "Hello World!" to STDOUT

python

print "Hello World!"

cpp

std::cout << "Hello World" << std::endl;

std::printf("Hello World\n");

Console::WriteLine(L"Hello World");

clojure

(println "Hello World!")

Retrieve a string containing ampersands from the variables in a url

My PHP script first does a query to obtain customer info for a form. The form has first name and last name fields among others. The customer has put entries such as "Ron & Jean" in the first name field in the database. Then the edit form script is called with variables such as

"http://myserver.com/custinfo/edit.php?mode=view&fname=Ron & Jean&lname=Smith".

The script variable for first name $_REQUEST['firstname'] never gets beyond the "Ron" value because of the ampersand in the data.

I have tried various functions like urldecode but all to no avail. I even tried encoding the url before the view screen is painted so that the url looks like "http://myserver/custinfo/edit.php?mode=view&fname="Ronxxnbsp;xxamp;xxnbsp;Jean"&lname=SMITH". (sorry I had to add the xx to replace the ampersand or it didn't display meaningful url contents the browser sees.)

Of course this fails for the same reasons. What is a better approach?

python

# I'm not really sure this is what the site is for,
# but the one unsolved problem for python was grating me.
# Anyway, I think this is what you're looking for.

from urllib import urlencode

query_dict = {'mode': 'view',
'fname': 'Ron & Jean',
'lname': 'Smith'}

print urlencode(query_dict.items())

# Which will be 'lname=Smith&mode=view&fname=Ron+%26+Jean'.

cpp

QUrl url("http://myserver.com/custinfo/edit.php");
url.addQueryItem("mode", "view");
url.addQueryItem("fname", "Ron & Jean");
url.addQueryItem("lname", "Smith");
QByteArray encodedUrl = url.toEncoded();

clojure

(->> {"mode" "view"
"fname" "Ron & Jean"
"lname" "Smith"}
(map #(str (URLEncoder/encode (first %) "UTF-8")
"="
(URLEncoder/encode (second %) "UTF-8")))
(reduce (fn [url e] (str url "&" e))
"http://myserver.com/custinfo/edit.php"))

string-wrap

Wrap the string "The quick brown fox jumps over the lazy dog. " repeated ten times to a max width of 78 chars, starting each line with "> "

Expected output:
> The quick brown fox jumps over the lazy dog. The quick brown fox jumps over t
> he lazy dog. The quick brown fox jumps over the lazy dog. The quick brown fox
> jumps over the lazy dog. The quick brown fox jumps over the lazy dog. The qui
> ck brown fox jumps over the lazy dog. The quick brown fox jumps over the lazy
> dog. The quick brown fox jumps over the lazy dog. The quick brown fox jumps o
> ver the lazy dog. The quick brown fox jumps over the lazy dog.

python

def wrap(string, length):

while len(string):
print("> " + string[0:length - 1])
string = string[length - 1:].strip()

wrap("The quick brown fox jumps over the lazy dog. " * 10, 78)

cpp

#include <iostream>
#include <sstream>
#include <string>

using namespace std;

void rep(ostream &os, const string& str, int times)
{
while (times--)
os << str;
}

void wrap(ostream &os, const string& str, const string &prefix, int width)
{
for (int offset = 0; offset < str.size(); offset += width)
os << prefix << str.substr(offset, width) << endl;
}

int main()
{
stringstream input;

rep(input, "The quick brown fox jumps over the lazy dog. ", 10);
wrap(cout, input.str(), "> ", 78);
}

clojure

(defn string-wrap [s]
(if (= 0 (count s))
nil
(lazy-seq (cons (apply str (take 78 s))
(string-wrap (drop 78 s))))))

(let [s (apply str (repeat 10 "The quick brown fox jumps over the lazy dog. "))]
(doseq [line (string-wrap s)]
(println "> " line)))

Declaration

Define a string containing special characters

Define the literal string "\#{'}${"}/"

python

# yes, Python has way too many forms of string literals :)
print "\\#{'}${\"}/"
print "\\#{'}${"'"'"}/"
print r"""\#{'}${"}/"""
print '\\#{\'}${"}/'
print '\\#{'"'"'}${"}/'
print r'''\#{'}${"}/'''

cpp

std::string special = "\\#{'}${\"}/";

String^ special = L"\\#{'}${\"}/";

clojure

(def special "\\#{'}${\"}/")

Define a multiline string

Define the string:

"This

Is

A

Multiline

String"

python

text = """This
Is
A
Multiline
String"""

# with proper indentation
text = (
"This\n"
"Is\n"
"A\n"
"Multiline\n"
"String"
)

cpp

std::string text =
"This\n"
"Is\n"
"A\n"
"Multiline\n"
"String";

String^ text = L"This\nIs\nA\nMultiline\nString";

std::string text = "This\nIs\nA\nMultiline\nString";

clojure

(def multiline "This\nIs\nA\nMultiline\nString")

Define a string containing variables and expressions

Given variables a=3 and b=4 output "3+4=7"

python

class EvalDict(dict):
def __getitem__(s, k):
return eval(k, s)

a=3; b=4
"%(a)d+%(b)d=%(a+b)d" % EvalDict(locals())

a=3; b=4
"%d+%d=%d" % (a, b, a+b)

cpp

Console::WriteLine(L"{0}+{1}={2}", a, b, a+b);

std::printf("%d+%d=%d\n", a, b, a+b);

std::cout << boost::format("%|1|+%|1|=%|1|") % a % b % (a+b) << std::endl;

clojure

(format "%d + %d = %d" a b (+ a b))

Manipulation

Reverse the characters in a string

Given the string "reverse me", produce the string "em esrever"

python

"reverse me"[::-1]

cpp

String^ s = "reverse me";
array<Char>^ sa = s->ToCharArray();
Array::Reverse(sa);
String^ sr = gcnew String(sa);

std::string s = "reverse me";
std::reverse(s.begin(), s.end());

std::string s = "reverse me";
std::string sr(s.rbegin(), s.rend());

std::string s = "reverse me";
std::swap_ranges(s.begin(), (s.begin() + s.size() / 2), s.rbegin());

clojure

(require '[clojure.contrib.str-utils2 :as str])
(str/reverse "reverse me")

(apply str (reverse "reverse me"))

Reverse the words in a string

Given the string "This is a end, my only friend!", produce the string "friend! only my end, the is This"

python

' '.join(reversed("This is a end, my only friend!".split()))

cpp

array<Char>^ sep = {L' '};
array<String^>^ words =
String(L"This is the end, my only friend!").Split(sep, StringSplitOptions::RemoveEmptyEntries);

Array::Reverse(words); String^ newwords = String::Join(L" ", words);

std::string words = "This is the end, my only friend!"; std::vector<std::string> swv;

boost::split(swv, words, boost::is_any_of(" ")); std::reverse(swv.begin(), swv.end());
std::string newwords = (std::for_each(swv.begin(), swv.end(), StringTAndJ())).value();

clojure

(require '[clojure.contrib.str-utils2 :as str])
(str/join " " (reverse (str/split "this is the end, my only friend!" #" ")))

(apply str (interpose " " (reverse (re-seq #"[^\s]+" "This is the end, my only friend!"))))

Text wrapping

Wrap the string "The quick brown fox jumps over the lazy dog. " repeated ten times to a max width of 78 chars, starting each line with "> ", yielding this result:

> The quick brown fox jumps over the lazy dog. The quick brown fox jumps
> over the lazy dog. The quick brown fox jumps over the lazy dog. The
> quick brown fox jumps over the lazy dog. The quick brown fox jumps
> over the lazy dog. The quick brown fox jumps over the lazy dog. The
> quick brown fox jumps over the lazy dog. The quick brown fox jumps
> over the lazy dog. The quick brown fox jumps over the lazy dog. The
> quick brown fox jumps over the lazy dog.

python

import textwrap
print textwrap.fill("The quick brown fox jumps over the lazy dog. " * 10,
72, initial_indent="> ", subsequent_indent="> ")

cpp

String^ input = ::copies("The quick brown fox jumps over the lazy dog. ", 10);
String^ sep = " "; String^ prefix = "> ";

String^ wrapped = textwrap(input, 74 - prefix->Length, sep, prefix);
Console::WriteLine("{0}", wrapped);

void rep(ostream &os, const string& str, int times)
{
while (times--)
os << str;
}

void wrap(ostream &os, const string& str, const string &prefix, int width)
{
int line_len = width;
bool first_word = true;

width -= prefix.size();
BOOST_FOREACH(string word, tokenizer<char_separator<char>>(str, char_separator<char>(" ")))
{
line_len += word.size();
if (line_len++ < width)
os << ' ';
else {
if (first_word)
first_word = false;
else
os << endl;
os << prefix;
line_len = word.size();
}
os << word;
}
os << endl;
}

int main()
{
stringstream input;

rep(input, "The quick brown fox jumps over the lazy dog. ", 10);
wrap(cout, input.str(), "> ", 72);
}

clojure

(doseq [line (re-seq #".{0,70} "
(apply str
(repeat 10 "The quick brown fox jumps over the lazy dog. ")))]
(println ">" line))

Remove leading and trailing whitespace from a string

Given the string " hello " return the string "hello".

python

assert 'hello' == ' hello '.strip()

cpp

String^ s = " hello "; String^ trimmed = s->Trim();

clojure

(use 'clojure.contrib.str-utils2)
(trim " hello ")

(clojure.string/trim " hello ")

(.trim " hello ")

Simple substitution cipher

Take a string and return the ROT13 and ROT47 (Check Wikipedia) version of the string.
For example:
String is: Hello World #123
ROT13 returns: Uryyb Jbeyq #123
ROT47 returns: w6==@ (@C=5 R`ab

python

# rot13, readable
rot13_tbl = string.maketrans("ABCDEFGHIJKLMabcdefghijklmNOPQRSTUVWXYZnopqrstuvwxyz", "NOPQRSTUVWXYZnopqrstuvwxyzABCDEFGHIJKLMabcdefghijklm")
string.translate("Hello World #123", rot13_tbl)

#
# "a bad programmer can write bad code in any language"
#

# rot13, "clever"
string.translate("Hello World #123", string.maketrans(string.lowercase+string.uppercase, string.lowercase[13:]+string.lowercase[:13]+string.uppercase[13:]+string.uppercase[:13]))

# rot47, very "clever"
''.join([ord(c) in range(33,127) and chr(((ord(c)-33+47)%(127-33))+33) or c for c in "Hello World #123"])

"Hello World #123".encode('rot13')

cpp

#include <algorithm>
#include <iostream>
#include <cctype>
using namespace std;

int rot13(int c) {
if (!isalpha(c)) {
return c;
} else {
char start = islower(c) ? 'a' : 'A';
return ((c - start) + 13) % 26 + start;
}
}

int rot47(int c) {
if (c < 33 || c > 126) {
return c;
} else {
return ((c - 33) + 47) % 94 + 33;
}
}

int main(int argc, char **argv) {
for (int i = 0; i < argc; ++i) {
string original = argv[i];

string rot13enc = original;
transform(original.begin(), original.end(), rot13enc.begin(), rot13);

string rot47enc = original;
transform(original.begin(), original.end(), rot47enc.begin(), rot47);

cout << "original: " << original << endl
<< "rot 13: " << rot13enc << endl
<< "rot 47: " << rot47enc << endl;
}
return 0;
}

clojure

(use 'clojure.contrib.cond)

(defn rot13 [s]
(reduce str
(map #(char (let [c (bit-and (int (char %)) 0xDF)]
(+ % (cond-let [i]
(and (>= c (int \A)) (<= c (int \M))) 13
(and (>= c (int \N)) (<= c (int \Z))) -13
true 0))))
(map #(int (char %)) s))))

(defn rot47 [s]
(reduce str
(map #(char (+ % (cond-let [i]
(and (>= % (int \!)) (<= % (int \O))) 47
(and (>= % (int \P)) (<= % (int \~))) -47
true 0)))
(map #(int (char %)) s))))

Case

Make a string uppercase

Transform "Space Monkey" into "SPACE MONKEY"

python

"Space Monkey".upper()

cpp

String(L"Space Monkey").ToUpper();

std::string s = "Space Monkey";
std::transform(s.begin(), s.end(), s.begin(), std::toupper);

std::string s = "Space Monkey";
boost::to_upper(s);

clojure

(.toUpperCase "Space Monkey")

Make a string lowercase

Transform "Caps ARE overRated" into "caps are overrated"

python

"Caps ARE overRated".lower()

cpp

std::string s = "Caps ARE overRated";
std::string sl(boost::to_lower_copy(s));

String(L"Caps ARE overRated").ToLower();

clojure

(.toLowerCase "Caps ARE overRated")

Capitalise the first letter of each word

Transform "man OF stEEL" into "Man Of Steel"

python

from string import capwords
capwords("man OF stEEL")

' '.join(s.capitalize() for s in "man OF stEEL".split())

"man OF stEEL".title()

cpp

std::string words = "mAn OF stEEL";
std::transform(words.begin(), words.end(), words.begin(), ToCaps<>());

StringBuilder^ sb = gcnew StringBuilder(L"man OF stEEL");

for (int i = 0, isFirst = 1; i < sb->Length; ++i)
{
sb[i] = Char::IsWhiteSpace(sb[i]) ? (isFirst = 1, sb[i]) : isFirst ? (isFirst = 0, Char::ToUpper(sb[i])) : Char::ToLower(sb[i]);
}

std::string words = "mAn OF stEEL";
std::vector<std::string> swv;

boost::split(swv, words, boost::is_any_of(" "));
std::string newwords = (std::for_each(swv.begin(), swv.end(), StringTAndJ(WordToCaps))).value();

clojure

(use 'clojure.contrib.str-utils2)
(join " " (map capitalize (split "man OF stEEL" #" ")))

Numbers

Mathematical

Find the distance between two points

python

# problem description doesn't say 2D points ;)
from math import sqrt
print sqrt(sum((x-y)**2 for x,y in zip(a, b)))

from math import hypot
print hypot(x2-x1, y2-y1)

cpp

Point p1 = {34, 78}, p2 = {67, -45};
double distance = ::distance(p1, p2);
Console::WriteLine("{0,3:F2}", distance);

clojure

(defstruct point :x :y)

(defn distance
"Euclidean distance between 2 points"
[p1 p2]
(Math/pow (+ (Math/pow (- (:x p1) (:x p2)) 2)
(Math/pow (- (:y p1) (:y p2)) 2))
0.5))

(distance (struct point 0 0) (struct point 1 1)) ; => 1.4142135623730951

(defn distance
"Euclidean distance between 2 points"
[[x1 y1] [x2 y2]]
(Math/sqrt
(+ (Math/pow (- x1 x2) 2)
(Math/pow (- y1 y2) 2))))

(distance [2 2] [3 3])

Output

Zero pad a number

Given the number 42, pad it to 8 characters like 00000042

python

"%08d" % 42

cpp

String^ formatted = Convert::ToString(42)->PadLeft(8, '0');

String^ formatted = String::Format("{0,8:D8}", 42);

std::printf("%08d", 42);

std::ostringstream os;
os << std::setw(8) << std::setfill('0') << 42 << std::ends;
std::cout << os.str() << std::endl;

std::cout << boost::format("%|08|") % 42 << std::endl;

clojure

(defn pad
([x] (if (> 8 (.length (str x))) (pad (str 0 x)) (str x)))
)

(defn pad [x]
(format "%08d" x))

(format "%08d" 42)

Right Space pad a number

Given the number 1024 right pad it to 6 characters "1024 "

python

"%-6s" % 1024

str(1024).rjust(6)

'{0: <6}'.format(1024)

cpp

String^ formatted = Convert::ToString(1024)->PadRight(6);

String^ formatted = String::Format("{0,-6:D}", 1024);

std::printf("%-6d\n", 1024);

std::ostringstream os;
os << std::setw(6) << std::setfill(' ') << std::left << 1024 << std::ends;
std::cout << os.str() << std::endl;

std::cout << boost::format("%|-6|") % 1024 << std::endl;

clojure

(let [s (str 1024)
l (count s)]
(str s (reduce str (repeat (- 6 l) " "))))

Format a decimal number

Format the number 7/8 as a decimal with 2 places: 0.88

python

"%.2f" % (7 / 8.0)

round(7./8., 2)

cpp

String^ formatted = String::Format("{0,3:F2}", result);

Console::WriteLine("{0,3:F2}", (7. / 8.));

std::printf("%3.2f\n", result);

std::ostringstream os;
os.width(3); os.fill('0'); os.setf(std::ios::fixed|std::ios::showpoint); os.precision(2);
os << result << std::ends;
std::cout << os.str() << std::endl;

std::cout << boost::format("%|3.2f|") % result << std::endl;

clojure

(format "%3.2f" (/ 7.0 8))

(* 0.01 (Math/round (* 100 (float (/ 7 8)))))

Left Space pad a number

Given the number 73 left pad it to 10 characters " 73"

python

"%10s" % 73

cpp

String^ formatted = Convert::ToString(73)->PadLeft(10);

String^ formatted = String::Format("{0,10:D}", 73);

std::printf("%10d\n", 73);

std::ostringstream os;
os << std::setw(10) << std::setfill(' ') << 73 << std::ends;
std::cout << os.str() << std::endl;

std::cout << boost::format("%|10|") % 73 << std::endl;

clojure

(let [s (str 73)
l (count s)]
(str (reduce str (repeat (- 10 l) " ")) s ))

Random

Generate a random integer in a given range

Produce a random integer between 100 and 200 inclusive

python

import random
random.randint(100, 200)

# uses best entropy source available (e.g. /dev/urandom, CryptGenRandom, ...)

import random
print random.SystemRandom().randint(100,200)

cpp

Random^ rnd = gcnew Random;
int rndInt = rnd->Next(100, 201);

std::srand(std::time(NULL));

unsigned lb = 100, ub = 200;
unsigned rnd = lb + (rand() % ((ub - lb) + 1));

typedef boost::uniform_int<> Distribution;
typedef boost::mt19937 RNG;

Distribution distribution(100, 200);
RNG rng; rng.seed(std::time(NULL));
boost::variate_generator<RNG&, Distribution> generator(rng, distribution);

unsigned rnd = generator();

clojure

(+ (rand-int (- 201 100)) 100)

Generate a repeatable random number sequence

Initialise a random number generator with a seed and generate five decimal values. Reset the seed and produce the same values.

python

import random

random.seed(12345)
list1 = [random.randint(1,10) for x in range(5)]

random.seed(12345)
list2 = [random.randint(1,10) for x in range(5)]

assert(list1==list2)

cpp

void printAction(int i) { Console::Write("{0} ", i); }

array<int>^ genFillRand(array<int>^ arr, Random^ rnd, int lb, int ub)
{
for (int i = 0; i < arr->Length; ++i) arr[i] = rnd->Next(lb, ub + 1); return arr;
}

int main()
{
array<int>^ arr1 = genFillRand(gcnew array<int>(5), gcnew Random(12345), 100, 200);
array<int>^ arr2 = genFillRand(gcnew array<int>(5), gcnew Random(12345), 100, 200);

Action<int>^ print = gcnew Action<int>(printAction);
Array::ForEach<int>(arr1, print); Console::WriteLine();
Array::ForEach<int>(arr2, print); Console::WriteLine();
}

typedef boost::uniform_int<> Distribution;
typedef boost::mt19937 RNG;

Distribution distribution(100, 200);
RNG rng;
boost::variate_generator<RNG&, Distribution> generator(rng, distribution);

rng.seed(42L);
std::generate_n(std::ostream_iterator<unsigned>(std::cout, " "), 5, generator);

rng.seed(42L);
std::cout << std::endl;
std::generate_n(std::ostream_iterator<unsigned>(std::cout, " "), 5, generator);

clojure

(dotimes [_ 2]
(let [r (java.util.Random. 12345)]
(dotimes [_ 5]
(println (.nextInt r 100))))
(println))

Regex

Matching

Check if a string matches a regular expression

Display "ok" if "Hello" matches /[A-Z][a-z]+/

python

found = re.match(r'[A-Z][a-z]+', 'Hello')
if found:
print 'ok'

cpp

if ((gcnew Regex("[A-Z][a-z]+"))->IsMatch("Hello")) Console::WriteLine("ok");

if (Regex::IsMatch("Hello", "[A-Z][a-z]+")) Console::WriteLine("ok");

Regex^ rx = gcnew Regex("[A-Z][a-z]+");
if (rx->IsMatch("Hello")) Console::WriteLine("ok");

cmatch what;
if (regex_match("Hello", what, regex("[A-Z][a-z]+")))
cout << "ok" << endl;

clojure

(if (re-matches #"[A-Z][a-z]+" "Hello")
(println "ok"))

Check if a string matches with groups

Display "two" if "one two three" matches /one (.*) three/

python

match = re.match(r'one (.*) three', 'one two three')
if match:
print match.group(1)

cpp

Match^ match = Regex::Match("one two three", "one (.*) three");
if (match->Success) Console::WriteLine("{0}", match->Groups[1]->Captures[0]);

cmatch what;
if (regex_match("one two three", what, regex("one (.*) three")))
cout << what[1] << endl;

clojure

(if-let [groups (re-matches #"one (.*) three" "one two three")]
(println (second groups)))

Searching

Check if a string contains a match to a regular expression

Display "ok" if "abc 123 @#$" matches /\d+/

python

found = re.search(r'\d+', 'abc 123 @#$')
if found:
print 'ok'

cpp

if (Regex::IsMatch("abc 123 @#$", "\\d+")) Console::WriteLine("ok");

clojure

(if (re-find #"\d+" "abc 123 @#$")
(println "ok"))

Loop through a string matching a regex and performing an action for each match

Create a list [fish1,cow3,boat4] when matching "(fish):1 sausage (cow):3 tree (boat):4" with regex /$(\w+)$:(\d+)/

python

map(''.join, re.findall(r"$(\w+)$:(\d+)", "(fish):1 sausage (cow):3 tree (boat):4"))
--------------------------------------------------------------------------
(''.join(m.groups()) for m in re.finditer(r"$(\w+)$:(\d+)", "(fish):1 sausage (cow):3 tree (boat):4"))

cpp

Match^ match = Regex::Match("(fish):1 sausage (cow):3 tree (boat):4", "\$(\\w+)\$:(\\d+)");

while (match->Success)
{
list->Add(match->Groups[1]->Captures[0]->ToString() + match->Groups[2]->Captures[0]->ToString());
match = match->NextMatch();
}

clojure

(let [matcher (re-matcher #"$(\w+)$:(\d+)" "(fish):1 sausage (cow):3 tree (boat):4")]
(loop [match (re-find matcher)
lst []]
(if match
(recur (re-find matcher) (conj lst (str (second match) (nth match 2))))
lst)))

Replacing

Replace the first regex match in a string with a static string

Transform "Red Green Blue" into "R*d Green Blue" by replacing /e/ with "*"

python

print re.sub(r'e', '*', 'Red Green Blue', 1)

cpp

String^ Replaced = (gcnew Regex("e"))->Replace("Red Green Blue", "*", 1);

clojure

(.replaceFirst (re-matcher #"e" "Red Green Blue") "*")

Replace all regex matches in a string with a static string

Transform "She sells sea shells" into "She X X shells" by replacing /se\w+/ with "X"

python

transformed = re.sub(r'se\w+', 'X', 'She sells sea shells')

cpp

String^ Replaced = (gcnew Regex("se\\w+"))->Replace("She sells sea shells", "X");

String^ Replaced = Regex::Replace("She sells sea shells", "se\\w+", "X");

clojure

(.replaceAll (re-matcher #"se\w+" "She sells sea shells") "X")

Replace all regex matches in a string with a dynamic string

Transform "The {Quick} Brown {Fox}" into "The kciuQ Brown xoF" by reversing words in braces using the regex /\{(\w+)\}/.

python

transformed = re.sub(r'\{(\w+)\}',
lambda match: match.group(1)[::-1],
'The {Quick} Brown {Fox}')

cpp

String^ Replaced = (gcnew Regex("{(\\w+)}"))->Replace("The {Quick} Brown {Fox}", gcnew MatchEvaluator(&RegRep::RepGroup));

String^ Replaced = Regex::Replace("The {Quick} Brown {Fox}", "{(\\w+)}", gcnew MatchEvaluator(&RegRep::RepGroup));

clojure

(def *string* "The {Quick} Brown {Fox}")
(def *regex* (re-pattern #"\{(\w+)\}"))

(println
(loop [result ""
src *string*
replace-strs (re-seq *regex* *string*)]
(if (empty? src)
result
(let [[match replacement] (first replace-strs)]
(if (= (first src) (first match))
; At the beginning of a sequence that should be replaced.
; Do replacement of a single match
(recur (str result (apply str (reverse replacement)))
(drop (count match) src)
(rest replace-strs))
; else, just copy one char from the source to the result
(recur (str result (first src))
(rest src)
replace-strs))))))

(clojure.string/replace "The {Quick} Brown {Fox}"
#"\{(\w+)\}"
(fn [[_ word]] (apply str (reverse word))))

Lists

Declaration

Define an empty list

Assign the variable "list" to a list with no elements

python

list = []

cpp

Generic::List<String^>^ list = gcnew Generic::List<String^>();

std::list<std::string> list;

clojure

(list)

'()

Define a static list

Define the list [One, Two, Three, Four, Five]

python

list = ['One', 'Two', 'Three', 'Four', 'Five']
print list

cpp

array<String^>^ input = {"One", "Two", "Three", "Four", "Five"};
Generic::List<String^>^ list = gcnew Generic::List<String^>((Generic::IEnumerable<String^>^) input);

Generic::List<String^>^ list = gcnew Generic::List<String^>();

list->Add("One");
list->Add("Two");
list->Add("Three");
list->Add("Four");
list->Add("Five");

std::string input[] = {"One", "Two", "Three", "Four", "Five"};
std::list<std::string> list(input, input + 5);

std::list<std::string> list;

list.push_back("One");
list.push_back("Two");
list.push_back("Three");
list.push_back("Four");
list.push_back("Five");

list<string> lst = { "One", "Two", "Three", "Four", "Five" };

list<string> lst;
lst += "One", "Two", "Three", "Four", "Five";

clojure

(def a '[One Two Three Four Five])

Output

Join the elements of a list, separated by commas

Given the list [Apple, Banana, Carrot] produce "Apple, Banana, Carrot"

python

print ", ".join(['Apple', 'Banana', 'Carrot'])

cpp

String^ result = String::Join(L", ", fruit->ToArray());

string fruits[] = {"Apple", "Banana", "Carrot"};
string result = boost::algorithm::join(fruits, ", ");

clojure

(apply str (interpose ", " '("Apple" "Banana" "Carrot")))

Join the elements of a list, in correct english

Create a function join that takes a List and produces a string containing an english language concatenation of the list. It should work with the following examples:
join([Apple, Banana, Carrot]) = "Apple, Banana, and Carrot"
join([One, Two]) = "One and Two"
join([Lonely]) = "Lonely"
join([]) = ""

python

def join(*x):
if len(x) <= 2:
return ' and '.join(x)
else:
return ', '.join(x[:-1] + ('and ' + x[-1],))

if __name__ == "__main__":
assert join("Apple", "Banana", "Carrot") == "Apple, Banana, and Carrot"
assert join("One", "Two") == "One and Two"
assert join("Lonely") == "Lonely"
assert join(*[]) == ""

cpp

Console::WriteLine(join(fruit));

string join(const vector<string> &s, int b=0)
{
switch (s.size() - b)
{
case 0: return "";
case 1: return s[b];
case 2: return s[b] + (s.size() > 2 ? "," : "") + " and " + s[b+1];
default: return s[b] + ", " + join(s, b+1);
}
}

clojure

(defn join [lst]
(cond
(= (count lst) 0) ""
(= (count lst) 1) (first lst)
(= (count lst) 2) (str (first lst) " and " (second lst))
(> (count lst) 2) (loop [lst lst sb (StringBuilder.)]
(if (empty? lst)
(.toString sb)
(recur (rest lst) (.append sb (cond
(> (count lst) 2) (str (first lst) ", ")
(> (count lst) 1) (str (first lst) ", and ")
(= (count lst) 1) (str (first lst)))))))))

(defn join
([lst]
(join lst false))
([lst is-long]
(condp = (count lst)
0 ""
1 (first lst)
2 (str (first lst) (if is-long ",") " and " (second lst))
(str (first lst) ", " (join (rest lst) true)))))

Produce the combinations from two lists

Given two lists, produce the list of tuples formed by taking the combinations from the individual lists. E.g. given the letters ["a", "b", "c"] and the numbers [4, 5], produce the list: [["a", 4], ["b", 4], ["c", 4], ["a", 5], ["b", 5], ["c", 5]]

python

[(x, y) for y in [1,2] for x in ['a','b','c']]

import itertools
[x for x in itertools.product(["a", "b", "c"], [4, 5])]

cpp

Specialized::StringCollection^ combinations = gcnew Specialized::StringCollection;

for each(int number in numbers)
for each(String^ letter in letters)
combinations->Add(makeCombo(letter, number));

string letters[] = { "a", "b", "c" };
int numbers[] = { 4, 5 };
list<pair<string,int> > combo;

for (int n = 0; n < sizeof numbers / sizeof *numbers; n++)
for (int l = 0; l < sizeof letters / sizeof *letters; l++)
combo.push_back(make_pair(letters[l], numbers[n]));

cout << combo << endl;

clojure

(defn combine [lst1 lst2]
(mapcat (fn [x] (map #(list % x) lst1)) lst2))

(mapcat (fn [x] (map #(list % x) ["a", "b", "c"])) [4, 5])

From a List Produce a List of Duplicate Entries

Taking a list:
["andrew", "bob", "chris", "bob"]

Write the code to produce a list of duplicates in the list:
["bob"]

python

import itertools
input = ["andrew", "bob", "chris", "bob"]
input.sort()
output = [k for k, g in itertools.groupby(input, lambda x: x) if len(list(g)) > 1]

cpp

vector<string> lst = { "andrew", "bob", "chris", "bob" };
vector<string> lst_no_dups;
vector<string> tmp;
vector<string> dups;

sort(lst.begin(), lst.end());
unique_copy(lst.begin(), lst.end(), back_inserter(lst_no_dups));
set_difference(lst.begin(), lst.end(),
lst_no_dups.begin(), lst_no_dups.end(),
back_inserter(tmp));
unique_copy(tmp.begin(), tmp.end(), back_inserter(dups));

cout << dups << endl;

list<string> lst = { "andrew", "bob", "chris", "bob" };
map<string,int> num_identical;
list<string> dups;

for (auto &s: lst)
num_identical[s]++;
for (auto &n: num_identical)
if (n.second > 1)
dups.push_back(n.first);
cout << dups << endl;

clojure

(->> '("andrew" "bob" "chris" "bob")
(group-by identity)
(filter #(> (count (second %)) 1))
(map first))

Access

Fetch an element of a list by index

Given the list [One, Two, Three, Four, Five], fetch the third element ('Three')

python

list = ['One', 'Two', 'Three', 'Four', 'Five']
list[2]

cpp

String^ result = list[2];

clojure

(nth '[One Two Three Four Five] 2)

Fetch the last element of a list

Given the list [Red, Green, Blue], access the last element ('Blue')

python

list = ['Red', 'Green', 'Blue']
list[-1]

cpp

String^ result = list[list->Count - 1];

string last_elem = lst.back();

clojure

(last '[One Two Three Four Five])

Find the common items in two lists

Given two lists, find the common items. E.g. given beans = ['broad', 'mung', 'black', 'red', 'white'] and colors = ['black', 'red', 'blue', 'green'], what are the bean varieties that are also color names?

python

beans = ['broad', 'mung', 'black', 'red', 'white']
colors = ['black', 'red', 'blue', 'green']

common = [b for b in beans if b in colors]

beans = ['broad', 'mung', 'black', 'red', 'white']
colors = ['black', 'red', 'blue', 'green']

common = set(beans) & set(colors)

cpp

array<String^>^ inbeans = {"broad", "mung", "black", "red", "white"};
Generic::ICollection<String^>^ beans = makeSET<String^>(gcnew Generic::List<String^>((Generic::IEnumerable<String^>^) inbeans));

array<String^>^ incolors = {"black", "red", "blue", "green"};
Generic::ICollection<String^>^ colors = makeSET<String^>(gcnew Generic::List<String^>((Generic::IEnumerable<String^>^) incolors));

Generic::ICollection<String^>^ result = intersectSET<String^>(beans, colors);

clojure

(use 'clojure.set)

(let [beans '[broad mung black red white]
colors '[black red blue green]]
(intersection (set beans) (set colors)))

Display the unique items in a list

Display the unique items in a list, e.g. given ages = [18, 16, 17, 18, 16, 19, 14, 17, 19, 18], display the unique elements, i.e. with duplicates removed.

python

ages = [18, 16, 17, 18, 16, 19, 14, 17, 19, 18]

unique_ages = list(set(ages))

cpp

array<int>^ input = {18, 16, 17, 18, 16, 19, 14, 17, 19, 18};
Generic::List<int>^ ages = gcnew Generic::List<int>((Generic::IEnumerable<int>^) input);

Generic::ICollection<int>^ result = makeSET<int>(ages);

list<int> input;
input += 18, 16, 17, 18, 16, 19, 14, 17, 19, 18;
input.sort();
unique_copy(input.begin(), input.end(), ostream_iterator<int>(cout, "\n"));

clojure

;; returns a set
(set [18, 16, 17, 18, 16, 19, 14, 17, 19, 18])
;;#{14 16 17 18 19}

;; returns a lazy sequence of the unique elements
(distinct [18, 16, 17, 18, 16, 19, 14, 17, 19, 18])
;;(18 16 17 19 14)

Modification

Remove an element from a list by index

Given the list [Apple, Banana, Carrot], remove the first element to produce the list [Banana, Carrot]

python

myList = ['Apple', 'Banana', 'Carrot']
print myList
del myList[0]
# or
myList.pop(0) # returns 'Apple'
print myList

cpp

fruit->RemoveAt(0);

clojure

(let [fruit ["Apple" "Banana" "Carrot"]
index 0]
(concat
(take index fruit)
(drop (+ index 1) fruit)))

Remove the last element of a list

python

myList = ['Apple', 'Banana', 'Carrot']
myList.pop()

cpp

fruit->RemoveAt(fruit->Count - 1);

clojure

(pop ["Apple" "Banana" "Carrot"])

Rotate a list

Given a list ["apple", "orange", "grapes", "bananas"], rotate it by removing the first item and placing it on the end to yield ["orange", "grapes", "bananas", "apple"]

python

l = ["apple", "orange", "grapes", "bananas"]
first, l = l[0], l[1:] + l[:1]

fruit = ['apple', 'orange', 'grapes', 'bananas']
fruit.append(fruit.pop(0))

cpp

fruit->Add(fruit[0]); fruit->RemoveAt(0);

rotate(fruit.begin(), fruit.begin()+1, fruit.end());

clojure

(let [fruit ["apple" "orange" "grapes" "bananas"]]
(concat (rest fruit) [(first fruit)])

Manipulation

Gather together corresponding elements from multiple lists

Given several lists, gather together the first element from every list, the second element from every list, and so on for all corresponding index values in the lists. E.g. for these three lists, first = ['Bruce', 'Tommy Lee', 'Bruce'], last = ['Willis', 'Jones', 'Lee'], years = [1955, 1946, 1940] the result should produce 3 actors. The middle actor should be Tommy Lee Jones.

python

first = ['Bruce', 'Tommy Lee', 'Bruce']
last = ['Willis', 'Jones', 'Lee']
years = [1955, 1946, 1940]

actors = zip(first, last, years)

assert len(actors) == 3
assert actors[1] == ('Tommy Lee', 'Jones', 1946)

cpp

array<String^>^ first = {"Bruce", "Tommy Lee", "Bruce"}; array<String^>^ last = {"Willis", "Jones", "Lee"}; array<String^>^ years = {"1955", "1946", "1940"};

array<String^>^ result = zip<String^>(",", first, last, years);

list<string> first = { "Bruce", "Tommy Lee", "Bruce" };
list<string> last = {"Willis", "Jones", "Lee"};
list<int> years = {1955, 1946, 1940};
list<tuple<string,string,int> > actors;

for (firstIt = first.begin(), lastIt = last.begin(), yearIt = years.begin();
firstIt != first.end() && lastIt != last.end() && yearIt != years.end();
++firstIt, ++lastIt, ++yearIt)
actors.push_back(make_tuple(*firstIt, *lastIt, *yearIt));

clojure

(defn gatherer [listOfLists]
(if (empty? (first listOfLists))
() ; the base case for recursion
(cons
(map first listOfLists) ; get the first element of each of the lists
(gatherer (map rest listOfLists)) ; gather all the subsequent ones
)
)
)

(def firstnames '("Bruce" "Tommy Lee" "Bruce"))
(def lastnames '("Willis" "Jones" "Lee"))
(def years '(1955 1946 1940))

(println (gatherer [firstnames lastnames years]))

; -> ((Bruce Willis 1955) (Tommy Lee Jones 1946) (Bruce Lee 1940))

(def firstnames ["Bruce" "Tommy Lee" "Bruce"])
(def lastnames ["Willis" "Jones" "Lee"])
(def years [1955 1946 1940])
(println (map (fn [f l y] [f l y]) firstnames lastnames years))

List Combinations

Given two source lists (or sets), generate a list (or set) of all the pairs derived by combining elements from the individual lists (sets). E.g. given suites = ['H', 'D', 'C', 'S'] and faces = ['2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A'], generate the deck of 52 cards, confirm the deck size and check it contains an expected card, say 'Ace of Hearts'.

python

suites = ('H', 'D', 'C', 'S')
faces = ('2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A')
deck = [(face,suite) for suite in suites for face in faces]
assert len(deck) == 52
assert ('A', 'H') in deck

cpp

Specialized::StringCollection^ cards = gcnew Specialized::StringCollection;

for each(String^ suite in suites)
for each(String^ face in faces)
cards->Add(makeCard(suite, face));

Console::WriteLine("Deck has {0} cards", cards.Count);
if (cards->Contains(makeCard("h", "A"))) Console::WriteLine("Deck contains 'Ace of hearts'"); else Console::WriteLine("'Ace of hearts' not in deck");

auto suites = {"h", "d", "c", "s"};
auto faces = {"2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A"};
list<card> cards;

for (auto s: suites)
for (auto f: faces)
cards.push_back(make_pair(s,f));

cout << "Deck has " << cards.size() << " cards." << endl;

card ace_of_harts = make_pair("h", "A");
if (end(cards) != find_if(begin(cards), end(cards),
[&](const card& c) { return c == ace_of_harts; }))
cout << "Deck contain 'Ace of Harts'" << endl;
else
cout << "Deck lacks 'Ace of Harts'" << endl;

clojure

(def suites ["H" "D" "C" "S"])
(def faces [2 3 4 5 6 7 8 9 10 "J" "Q" "K" "A"])
(defn listCards [] (for [s suites f faces] [f s]))
(some (partial = ["A" "H"]) (listCards))
; -> true
(count (listCards))
; -> 52

Perform an operation on every item of a list

Perform an operation on every item of a list, e.g.
for the list ["ox", "cat", "deer", "whale"] calculate
the list of sizes of the strings, e.g. [2, 3, 4, 5]

python

print map(lambda x: len(x), ["ox", "cat", "deer", "whale"])

print [len(x) for x in ['ox', 'cat', 'deer', 'whale']]

cpp

list<string> words;

words.push_back("ox");
words.push_back("cat");
words.push_back("deer");
words.push_back("whale");

for (list<string>::iterator it = words.begin(); it != words.end(); ++it)
cout << it->size() << ' ';
cout << endl;

auto words = { "ox", "cat", "deer", "whale" };
list<size_t> word_sizes;

transform(begin(words),
end(words),
back_inserter(word_sizes),
[](const string& s) { return s.size(); });

clojure

(map count ["ox" "cat" "deer" "whale"])

Split a list of things into numbers and non-numbers

Given a list that might contain e.g. a string, an integer, a float and a date,
split the list into numbers and non-numbers.

python

import re
data = '34234aff340980adf0e0fa0fefl' ## or ''.join(array)

nonDigits = re.findall(re.compile('\D'), data)
digits = re.findall(re.compile('\d'), data)

cpp

typedef variant<int,float,string,date> dynamic;

class is_number : public static_visitor<bool>
{
public:
bool operator()(int &) const {
return true;
}
bool operator()(float &) const {
return true;
}
bool operator()(string &) const {
return false;
}
bool operator()(date &) const {
return false;
}
};

int main()
{
list<dynamic> lst;
list<dynamic> numbers;
list<dynamic> non_numbers;

lst += "hello", 3.14f, 42, date(2011,Aug,23);

BOOST_FOREACH(dynamic v, lst)
if (apply_visitor(is_number(), v))
numbers += v;
else
non_numbers += v;

#include <iostream>
#include <list>

#include <boost/any.hpp>
#include <boost/date_time/gregorian/gregorian.hpp>
#include <boost/foreach.hpp>

using namespace boost;
using namespace boost::gregorian;
using namespace std;

int main()
{
list<any> lst;
list<any> numbers;
list<any> non_numbers;

lst.push_back(string("hello"));
lst.push_back(42);
lst.push_back(3.14f);
lst.push_back(date(day_clock::local_day()));

BOOST_FOREACH(const any &a, lst)
try
{
numbers.push_back(any_cast<int>(a));
}
catch (bad_any_cast &e)
{
try
{
numbers.push_back(any_cast<float>(a));
}
catch (bad_any_cast &e)
{
non_numbers.push_back(a);
}
}

// float and int are now in 'numbers' and the rest in 'non_numbers'
}

clojure

(def jumble [3 "Bill" 5.7 '("A" "B" "C")]) ; int, string, float, list

(defn numberNonNumberSorter [jumbledList]
(if (empty? jumbledList)
(hash-map :numbers [], :nonnumbers []) ; recursion base case - return two empty lists
(let [head (first jumbledList)] ; let <head> be the first element in the list
(let [tailresult (numberNonNumberSorter (rest jumbledList))] ; tailresult applies recursively to the remainder
(if (number? head) ; is head a number?
(hash-map
:numbers (cons head (tailresult :numbers)) ; add <head> to the numbers
:nonnumbers (tailresult :nonnumbers)) ; leave nonnumbers the same
(hash-map
:numbers (tailresult :numbers) ; leave numbers the same
:nonnumbers (cons head (tailresult :nonnumbers))) ; add <head> to nonnumbers
)
)
)
)
)

(println (numberNonNumberSorter jumble))

; -> {:nonnumbers (Bill (A B C)), :numbers (3 5.7)}

(group-by number? ["hello" 42 3.14 (Date.)])

Testing

Test if a condition holds for all items of a list

Given a list, test if a certain logical condition (i.e. predicate) holds for all items of the list.

python

all(x > 1 for x in [2,3,4])

cpp

template <typename InputIterator, typename Predicate>
bool match_all(InputIterator first, InputIterator last, Predicate pred)
{
return find_if(first, last, !pred(_1)) == last;
}

clojure

(every? #(> % 1) [2 3 4])

Test if a condition holds for any items of a list

Given a list, test if a certain logical condition (i.e. predicate) holds for any items of the list.

python

any(x > 3 for x in [2, 3, 4])

cpp

template <typename InputIterator, typename Predicate>
bool match_any(InputIterator first, InputIterator last, Predicate pred)
{
return find_if(first, last, pred) != last;
}

clojure

; The standard library in Clojure has "not-any?" but (oddly enough) no "any?"
(defn any? [pred coll]
((complement not-any?) pred coll))

(any? #(> % 3) [2 3 4])

(some #(> % 3) [2 3 4])

Maps

Declaration

Define an empty map

python

map = {}

cpp

Hashtable^ hash = gcnew Hashtable;

Generic::Dictionary<String^, String^>^ dict = gcnew Generic::Dictionary<String^, String^>();

std::map<int, std::string> m;

clojure

(def m {})

Define an unmodifiable empty map

python

import collections
EmptyDict = collections.namedtuple("EmptyDict", "")
e = EmptyDict()

cpp

const std::map<T1,T2> immutable_map_instance_of_type_t1_to_t2;

clojure

; Clojure maps are immutable
(def m {})

Define an initial map

Define the map {circle:1, triangle:3, square:4}

python

shapes = {'circle': 1, 'square': 4, 'triangle': 2}

cpp

Hashtable^ shapes = gcnew Hashtable;

shapes->Add("circle", 1);
shapes->Add("triangle", 3);
shapes->Add("square", 4);

Generic::Dictionary<String^, int>^ shapes = gcnew Generic::Dictionary<String^, int>();

shapes->Add("circle", 1);
shapes->Add("triangle", 3);
shapes->Add("square", 4);

map<string, int> shapes;

shapes["circle"] = 1;
shapes["triangle"] = 3;
shapes["square"] = 4;

clojure

(def m '{circle 1 triangle 1 square 4})

Access

Check if a key exists in a map

Given a map pets {joe:cat,mary:turtle,bill:canary} print "ok" if an pet exists for "mary"

python

pets = dict(joe='cat', mary='turtle', bill='canary')
if ("mary" in pets) print "ok"

cpp

if (pets->ContainsKey("mary")) Console::WriteLine("ok");

if (pets.find("mary") != pets.end()){
std::cout << "ok" << std::endl;
}

if (pets.count("mary") > 0)
cout << "ok" << endl;

clojure

(if (contains? '{joe cat mary turtle bill canary} 'mary)
(println "ok"))

Retrieve a value from a map

Given a map pets {joe:cat,mary:turtle,bill:canary} print the pet for "joe" ("cat")

python

print pets['joe']

cpp

if (pets->ContainsKey("joe")) Console::WriteLine(pets["joe"]);

cout << pets["joe"] << endl;

clojure

(def pets '{joe cat mary turtle bill canary})

(println (get pets 'joe))

Add an entry to a map

Given an empty pets map, add the mapping from "rob" to "dog"

python

pets['rob'] = 'dog'

cpp

pets->Add("rob", "dog");

pets["rob"] = "dog";

clojure

(assoc {} 'rob 'dog)

Remove an entry from a map

Given a map pets {joe:cat,mary:turtle,bill:canary} remove the mapping for "bill" and print "canary"

python

print pets.pop('bill')

cpp

if (pets->ContainsKey("bill"))
{
String^ value = safe_cast<String^>(pets["bill"]); pets->Remove("bill");
Console::WriteLine("{0}", value);
}

clojure

; Maps are immutable
; The following expression will return a new map without the 'bill key
(let [pets '{joe cat mary turtle bill canary}]
(println (get pets 'bill))
(dissoc pets 'bill))

Algorithms

Create a histogram map from a list

Given the list [a,b,a,c,b,b], produce a map {a:2, b:3, c:1} which contains the count of each unique item in the list

python

from collections import defaultdict
h = defaultdict(int)
for k in "abacbb":
h[k] += 1

h = {}
for k in "abacbb":
h[k] = h.setdefault(k, 0) + 1

from collections import Counter
h = Counter("abacbb")
print(h)

cpp

for each(String^ entry in input) hash[entry] = hash->ContainsKey(entry)
? Convert::ToInt32(hash[entry]->ToString()) + 1 : 1;

for each(String^ entry in input) dict[entry] = dict->ContainsKey(entry) ? dict[entry] + 1 : 1;

map<string,int> hist;
for (auto e: { "a","b","a","c","b","b" })
++hist[e];
for (auto e: hist)
cout << e.first << " : " << e.second << endl;

clojure

(let [l '[a b a c b b]]
(loop [m {}
d (distinct l)]
(let [item (first d)]
(if (zero? (count d))
m
(recur
(assoc m
item
(count
(filter #(= item %) l)))
(rest d))))))

(->> [:a :b :a :c :b :b]
(group-by identity)
(reduce (fn [m e] (assoc m (first e) (count (second e)))) {}))

(reduce conj {} (for [[x xs] (group-by identity "abacbb")] [x (count xs)]))

(frequencies ["a","b","a","c","b","b"])

(frequencies '[a b a c b b])

Categorise a list

Given the list [one, two, three, four, five] produce a map {3:[one, two], 4:[four, five], 5:[three]} which sorts elements into map entries based on their length

python

c = defaultdict(list)
for k in ["one", "two", "four", "three", "five"]:
c[len(k)].append(k)

from itertools import groupby
lst = ["one", "two", "four", "three", "five"]
c = dict((k, list(g)) for k,g in
groupby(sorted(lst, key=lambda x: len(x)), key=lambda x: len(x)))
print(c)

cpp

for each(String^ entry in input)
{
key = entry->Length;
if (!hash->ContainsKey(key)) hash[key] = gcnew ArrayList;
safe_cast<ArrayList^>(hash[key])->Add(entry);
}

clojure

(loop [m {}
l ["one" "two" "three" "four" "five"]]
(if (zero? (count l))
m
(let [item (first l)
key (count item)]
(recur
(assoc m key (cons item (get m key [])))
(rest l)))))

(group-by count ["one" "two" "three" "four" "five"])

Structure

Conditionals

Perform an action if a condition is true (IF .. THEN)

Given a variable name, if the value is "Bob", display the string "Hello, Bob!". Perform no action if the name is not equal.

python

if name == 'Bob':
print 'Hello, Bob!'

cpp

if (name == "Bob") Console::WriteLine("Hello, {0}!", name);

if (name == "Bob") std::cout << "Hello, " << name << "!" << std::endl;

clojure

(def person "Bob")
(if (= person "Bob")
(println "Hello, Bob!"))

Perform different actions depending on a boolean condition (IF .. THEN .. ELSE)

Given a variable age, if the value is greater than 42 display "You are old", otherwise display "You are young"

python

if age > 42:
print 'You are old'
else:
print 'You are young'

print age > 42 and 'You are old' or 'You are young'

cpp

if (age > 42) Console::WriteLine("You are old");
else Console::WriteLine("You are young");

Console::WriteLine("You are {0}", (age > 42 ? "old" : "young"));

std::printf("You are %s\n", (age > 42 ? "old" : "young"));

clojure

(def age 41)
(if (> age 42) "You are old" "You are young")

Perform different actions depending on several boolean conditions (IF .. THEN .. ELSIF .. ELSE)

python

if age > 84:
print 'You are really ancient'
elif age > 30:
print 'You are middle-aged'
else:
print 'You are young'

cpp

if (age > 84) Console::WriteLine("You are really ancient");
else if (age > 30) Console::WriteLine("You are middle-aged");
else Console::WriteLine("You are young");

Console::WriteLine("You are {0}", (age > 84 ? "really ancient" : age > 30 ? "middle-aged" : "young"));

std::cout << "You are " << (age > 84 ? "really ancient" : age > 30 ? "middle-aged" : "young") << std::endl;

clojure

(println
(condp <= age
84 "You are really ancient"
30 "You are middle aged"
"You are young"))

Replacing a conditional with many branches with a switch/case statement

Many languages support more compact forms of branching than just if ... then ... else such as switch or case or match. Use such a form to add an appropriate placing suffix to the numbers 1..40, e.g. 1st, 2nd, 3rd, 4th, ..., 11th, 12th, ... 39th, 40th

python

def affix(num):
num = num == 1 and str(num) + 'st' or num == 2 and str(num) + 'nd' or \
num == 3 and str(num) +'rd' or str(num) + 'th'
return num

print [affix(x) for x in xrange(1,41)]

cpp

#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int num,i,x;
cout<<"Enter the range:";
cin>>num;
for(i=1;i<=num;i++)
{
x=i%10;
switch(i)
{
case 11:
case 12:
case 13:cout<<i<<"th ";
continue;
}
switch(x)
{
case 1: cout<<i<<"st ";break;
case 2: cout<<i<<"nd ";break;
case 3: cout<<i<<"rd ";break;
default: cout<<i<<"th ";
}
}
getch();
}

clojure

(def n 112)

(println (str n
(let [rem (mod n 100)]
(if (and (>= rem 11) (<= rem 13))
"th"
(condp = (mod n 10)
1 "st"
2 "nd"
3 "rd"
"th")))))

Loops

Perform an action multiple times based on a boolean condition, checked before the first action (WHILE .. DO)

Starting with a variable x=1, Print the sequence "1,2,4,8,16,32,64,128," by doubling x and checking that x is less than 150.

python

x = 1
while x < 150:
print '%s, ' % x,
x *= 2

cpp

int x = 1;

while (x < 150) { x *= 2; Console::Write("{0},", x); }
Console::WriteLine();

for (int x = 1; x < 150; x *= 2) { std::cout << x << ","; }
std::cout << std::endl;

clojure

(take-while #(< % 150) (iterate #(* 2 %) 1))

Perform an action multiple times based on a boolean condition, checked after the first action (DO .. WHILE)

Simulate rolling a die until you get a six. Produce random numbers, printing them until a six is rolled. An example output might be "4,2,1,2,6"

python

import random, itertools

def dice():
while True:
yield random.randint(1,6)

print ", ".join(str(d) for d in itertools.takewhile(lambda x: x < 6, dice()))

cpp

Random^ rnd = gcnew Random;

int dice = rnd->Next(1, 7); Console::Write("{0}", dice);
do { Console::Write(",{0}", (dice = rnd->Next(1, 7))); } while (dice != 6);
Console::WriteLine();

clojure

(loop [r (rand-int 6)]
(if (= r 5)
nil
(do
(println r)
(recur (rand-int 6)))))

Perform an action a fixed number of times (FOR)

Display the string "Hello" five times like "HelloHelloHelloHelloHello"

python

print "Hello" * 5

for i in range(5):
print "Hello"

cpp

for(int i = 0; i < 5; ++i) Console::Write("Hello");

for(int i = 5; i > 0; --i) Console::Write("Hello");

dotimes(5, hello);

fill_n(ostream_iterator<string>(cout), 5, "Hello");

clojure

(dotimes [_ 5]
(print "Hello"))

Perform an action a fixed number of times with a counter

Display the string "10 .. 9 .. 8 .. 7 .. 6 .. 5 .. 4 .. 3 .. 2 .. 1 .. Liftoff!"

python

print " .. ".join(str(i) for i in range(10, 0, -1)), ".. liftoff!"

cpp

for(int i = 10; i != 0; --i) Console::Write("{0} .. ", i);
Console::WriteLine("Liftoff!");

clojure

(dotimes [i 10]
(print (str (- 10 i) " .. ")))

(println "Liftoff!")

Files

Reading

Read the contents of a file into a string

python

contents = open('myFile.txt', 'rt').read()

cpp

IO::FileStream^ file; String^ buffer;

try
{
file = gcnew IO::FileStream("test.txt", IO::FileMode::Open);
buffer = gcnew String((gcnew IO::BinaryReader(file))->ReadChars(file->Length));
}

IO::StreamReader^ stream; String^ buffer;

try
{
stream = gcnew IO::StreamReader("test.txt");
buffer = stream->ReadToEnd();
}

String^ buffer = IO::File::ReadAllText("test.txt");

clojure

(slurp "/tmp/foobar")

Process a file one line at a time

Open the source file to your solution and print each line in the file, prefixed by the line number, like:
1> First line of file
2> Second line of file
3> Third line of file

python

for no, line in enumerate(open(__file__)):
print "{0}> {1}".format(no+1, line.rstrip())

cpp

IO::StreamReader^ stream; String^ ln; int i = 0;

try
{
stream = gcnew IO::StreamReader("test.txt");
while ((ln = stream->ReadLine())) Console::WriteLine("{0}> {1}", ++i, ln);
}

int i = 0;
for each(String^ line in IO::File::ReadAllLines("test.txt")) Console::WriteLine("{0}> {1}", ++i, line);

clojure

(defn read-line-by-line [fn]
(reduce str (map (partial format "%d> %s\n")
(iterate inc 1)
(read-lines fn))))

Writing

Write a string to a file

python

open('test.txt', 'wt').write('Hello World!')

cpp

IO::StreamWriter^ stream;

try
{
stream = gcnew IO::StreamWriter("test.txt", false);
stream->WriteLine("This line overwites file contents!");
}

clojure

(with-out-writer "output.txt" (println "Hello file!"))

Append to a file

python

open('test.txt', 'at').write('Hello World!\n')

cpp

IO::StreamWriter^ stream;

try
{
stream = gcnew IO::StreamWriter("test.txt", true);
stream->WriteLine("This line appended to file!");
}

clojure

(with-out-append-writer "output.txt" (println "This is appended to the file"))

Directories

Process each file in a directory

python

import os
results = (process(f) for f in os.listdir(".") if os.path.isfile(f))

cpp

for each(String^ filename in IO::Directory::GetFiles(dirname)) process(filename);

clojure

; (defn process-file [f] "process one file" body...)
(map process-file (.listFiles (File. ".")))

Process each file in a directory recursively

python

import os
results = (process(os.path.join(p, n)) for p,d,l in os.walk(".") for n in l)

cpp

void processFile(String^ filename) { Console::WriteLine("{0}", filename); }

void processDirectory(String^ dirname)
{
for each(String^ filename in IO::Directory::GetFiles(dirname)) processFile(filename);
for each(String^ subdirname in IO::Directory::GetDirectories(dirname)) processDirectory(subdirname);
}

int main()
{
processDirectory("c:\\");
}

clojure

; (defn process-file [f] "process one file" body...)
(map process-file (file-seq (File. ".")))

Dates

Parsing

Parse a date and time from a string

Given the string "2008-05-06 13:29", parse it as a date representing 6th March, 2008 1:29:00pm in the local time zone.

python

import time
time.strptime("2008-05-06 13:29", "%Y-%m-%d %H:%M")

cpp

DateTimeOffset^ dateTime = DateTimeOffset::Parse("2008-05-06 13:29");

// Use format specifiers to appropriately format string
// 1. Default culture
Console::WriteLine("{0}", dateTime->ToString("d MMMM, yyyy h:mm:sstt"));

// 2. Nominated culture
Console::WriteLine("{0}", dateTime->ToString("d MMMM, yyyy h:mm:sstt"), Globalization::CultureInfo::CreateSpecificCulture("en-us"));

DateTimeOffset^ dateTime = DateTimeOffset::Parse("2008-05-06 13:29");

// Customize date/time string
Text::StringBuilder^ dsb = gcnew Text::StringBuilder(40);
dsb->Append(dateTime->ToString("%d"))->Append("th ")->Append(dateTime->ToString("MMMM, yyyy h:mm:ss"))->Append(dateTime->ToString("tt")->ToLower());

Console::WriteLine("{0}", dsb);

clojure

(.. (SimpleDateFormat. "yyyy-MM-dd HH:mm")
(parse "2008-05-06 13:29"))

Printing

Display information about a date

Display the day of month, day of year, month name and day name of the day 8 days from now.

python

from datetime import datetime, timedelta

eightDaysFromNow = datetime.now() + timedelta(days=8)

print eightDaysFromNow.strftime('%d') # day of month
print eightDaysFromNow.strftime('%j') # day of year
print eightDaysFromNow.strftime('%B') # month name FULL
print eightDaysFromNow.strftime('%A') # day of week name FULL

cpp

QDate dateEightDaysFromNow = QDate::currentDate().addDays(8);

clojure

(let [cal (Calendar/getInstance)]
(.add cal Calendar/DAY_OF_YEAR 8)
(println (.format (SimpleDateFormat. "d, D, MMMM, EEEE")
(.getTime cal))))

Display a date in different locales

Display a language/locale friendly version of New Year's Day for 2009 for several languages/locales. E.g. for languages English, French, German, Italian, Dutch the output might be something like:

Thursday, January 1, 2009
jeudi 1 janvier 2009
giovedì 1 gennaio 2009
Donnerstag, 1. Januar 2009
donderdag 1 januari 2009

(Indicate in comments where possible if any language specific or operating system configuration needs to be in place.)

python

from datetime import datetime
from locale import setlocale, LC_TIME

now = datetime(2009, 1, 1)

locales = ('en_us', 'fr_fr', 'it_it', 'de_de', 'nl_nl')
for locale in locales:
setlocale(LC_TIME, locale)
print now.strftime('%A, %B %d %Y')

cpp

QList<QLocale::Language> locales;
locales << QLocale::English
<< QLocale::French
<< QLocale::German
<< QLocale::Italian
<< QLocale::Dutch;

QDate date(2009, 1, 1);
foreach (QLocale::Language ll, locales)
{
QLocale::setDefault(ll);
qDebug() << date.toString(Qt::DefaultLocaleLongDate);
}

clojure

(let [time (.getTime (GregorianCalendar. 2009 Calendar/JANUARY 1))]
(doseq [locale ["en" "fr" "it" "de" "nl"]]
(println (.format (DateFormat/getDateInstance DateFormat/FULL
(Locale. locale))
time))))

Creation

Display the current date and time

Create a Date object representing the current date and time. Print it out.
If you can also do this without creating a Date object you can show that too.

python

from datetime import datetime
print datetime.utcnow()

cpp

QDate now = QDate::currentData();
qDebug() << now.toString();

time_t date = time(0);
cout << ctime(&date);

clojure

(import 'java.util.Date)

(println (str (Date.)))

OOP

Basics

Define a class

Declare a class named Greeter that takes a string on creation and greets using this string if you call the "greet" method.

python

class Greeter(object):
""" Greet someone.
"""
def __init__(self, whom):
self._whom = whom
def greet(self):
print "Hello, %s!" % self._whom

Greeter("world").greet()

cpp

class Greeter
{
public:
Greeter(const std::string& whom);
void greet() const;

private:
std::string whom;
};

int main()
{
Greeter* gp = new Greeter("world");
gp->greet();
delete gp;
}

Greeter::Greeter(const std::string& whom) : whom(whom) {}

void Greeter::greet() const
{
std::cout << "Hello, " << whom << std::endl;
}

public ref class Greeter
{
public:
Greeter(String^ whom);
void greet();

private:
initonly String^ whom;
};

int main()
{
(gcnew Greeter(L"world"))->greet();
}

Greeter::Greeter(String^ whom) : whom(whom) {}

void Greeter::greet()
{
Console::WriteLine(L"Hello, {0}", whom);
}

clojure

(defprotocol IGreeter
(greet [this]))

(deftype Greeter [whom]
IGreeter
(greet [this]
(println (str "Hello, " whom))))

(greet (Greeter. "world"))

(defn greeter [whom]
{:whom whom})

(defn greet [g]
(println (str "Hello, " (:whom g))))

(greet (greeter "world"))

Instantiate object with mutable state

Reimplement the Greeter class so that the 'whom' property or data member remains private but is mutable, and is provided with getter and setter methods. Invoke the setter to change the greetee, invoke 'greet', then use the getter in displaying the line, "I have just greeted {whom}.".

For example, if the greetee is changed to 'Tommy' using the setter, the 'greet' method would display:

Hello, Tommy!

The getter would then be used to display the line:

I have just greeted Tommy.

python

class Greeter(object):
_whom = None

def __init__(self, whom):
self._whom = whom

@property
def whom(self):
return self._whom

@propset(whom)
def whom(self, value=None):
self._whom = value

def greet(self):
print 'Helo, %s!' % self._whom

greeter = Greeter('Winston')
greeter.greet()
greeter.whom = 'Tommy'
greeter.greet()

# required for Python 2.5 or less
def propset(prop):
assert isinstance(prop, property)
def helper(func):
return property(prop.fget, func, prop.fdel, prop.__doc__)
return helper

class Greeter(object):
_whom = None

def __init__(self, whom):
self._whom = whom

@property
def whom(self):
return self._whom

@propset(whom)
def whom(self, value=None):
self._whom = value

def greet(self):
print 'Helo, %s!' % self._whom

greeter = Greeter('Winston')
greeter.greet()
greeter.whom = 'Tommy'
greeter.greet()

cpp

#include <iostream>

using namespace std;

class Greeter {
string whom_;

public:
Greeter(const string &whom) : whom_(whom) {}

string get_whom() const {
return whom_;
}

void set_whom(const string &whom) {
whom_ = whom;
}

void greet() const {
cout << "Hello " << whom_ << "!" << endl;
}
};

int main()
{
Greeter greeter("world");
greeter.greet();
greeter.set_whom("Tommy");
greeter.greet();
cout << "I have just greeted " + greeter.get_whom() << "." << endl;
}

clojure

(defn greeter [whom]
(atom {:whom whom}))

(defn get-whom [g]
(:whom @g))

(defn set-whom [g whom]
(swap! g #(conj % {:whom whom})))

(defn greet [g]
(println (str "Hello, " (:whom @g) "!")))

; using the "class"
(let [g (greeter "world")]
(greet g)
(set-whom g "Tommy")
(greet g)
(println (str "I have just greeted " (get-whom g) ".")))

; or same effect without using any variables
(println (str "I have just greeted "
(get-whom (doto (greeter "world")
(greet)
(set-whom "Tommy")
(greet)))
"."))

Inheritance

Implement Inheritance Heirarchy

Implement a Shape abstract class which will form the base of an inheritance hierarchy that models 2D geometric shapes. It will have:

* A non-mutable 'name' property or data member set by derived or descendant classes at construction time
* A 'area' method intended to be overridden by derived or descendant classes ( double precision floating point return value)
* A 'print' method (also for overriding) will display the shape

's name, area, and all shape-specific values



Two derived or descendant classes will be created:

* Circle    -> Constructor requires a '

radius' argument, and a 'circumference

' method to be implemented  

* Rectangle -> Constructor requires '

length' and 'breadth' arguments, and a 'perimeter

' method to be implemented 



Instantiate an object of each class, and invoke each objects '

print' method to show relevant details.

python

#Start with the import statements.
import math # necessary to get the value of pi

class Shape(object):
"""Shape Class"""
def __init__(self):
"""Constructor method"""
pass #Do nothing here
def area(self):
"""The area method"""
pass #Do nothing here
def print_(self):
"""
The print method. Note the trailing underscore - this is because
there is a reserved statement called 'print' in python 2.x. The
trailing underscore is the accepted method of re-using names without
rebinding them
"""
print 'The name is: %s' % self.name #Print the only property we currently have

def _getName(self):
"""The getter method for the 'name' property.
Note that getter methods are generally discouraged in python"""
return self._name

_name = None # The leading underscore gives a weak non-public value
# to a variable. Two leading underscores will mangle its
# name at runtime, to make it more difficult to access.
# Note there is no real 'private' variable type in python.
name = property(_getName, doc='The name of this object')
# property statements work like: property(fget=None, fset=None, fdel=None, doc=None)

class Circle(Shape):
"""Circle Class - a sub class of shape"""
def __init__(self, radius, name='Circle'):
"""Constructor method again"""
Shape.__init__(self) # init the super class
self.radius = radius # Store the radius
self._setCircumference()# Function call
self._name = name

def _setCircumference(self):
self.circumference = 2*math.pi*self.radius

def area(self):
'''Return the area of this circle'''
tmpAera = math.pi * self.radius**2
return tmpAera
def print_(self):
'''The print method'''
super(Circle, self).print_() # This calls the print_ method in
# the super classes of Circle, in
# this case Shape
print 'The radius is: %f' % self.radius
print 'The circumference is %f' % self.circumference
print 'The area is: %f' % self.area()

class Rectangle(Shape):
"""The Rectangle Class"""
def __init__(self, length, breadth, name='Rectangle'):
Shape.__init__(self)
self._name = name
self.length = length
self.breadth = breadth
self.perimeter()
def area(self):
return self.breadth*self.length
def perimeter(self):
self._perimeter = self.breadth*2+self.length*2
return self._perimeter # You have a method return a value and still
# safely call it without handling the return
# value. This would be collected by garbage
# collection.
def print_(self):
super(Rectangle, self).print_()
print 'The length is %f and the breadth is %f' %(self.length, self.breadth)
print 'The perimeter is: %f' %self._perimeter
print 'The area is: %f' % self.area()

if __name__ == '__main__':
rectangle = Rectangle(5,3)
circle = Circle(5, name='Round and Round')
rectangle.print_()
circle.print_()

cpp

#include <string>
#include <iostream>

using namespace std;

static const double PI = 3.141592;

class Shape {
protected:
string name_;
public:
Shape(const string& name) : name_(name) { }
virtual double area() const = 0;
virtual void print() const = 0;
};

class Circle : public Shape {
double radius_;
public:
Circle(double radius) : Shape("circle"), radius_(radius) { }
double area() const {
return PI * radius_ * radius_;
}
void print() const {
cout << "A " << name_ << " with radius " << radius_ << ", area "
<< area() << " and circumference " << circumference() << "."
<< endl;
}
double circumference() const {
return 2 * PI * radius_;
}
};

class Rectangle : public Shape {
double length_;
double breadth_;
public:
Rectangle(double length, double breadth) :
Shape("rectangle"), length_(length), breadth_(breadth) { }
double area() const {
return length_ * breadth_;
}
void print() const {
cout << "A " << name_ << " with length " << length_ << ", breadth "
<< breadth_ << ", area " << area() << " and perimeter "
<< perimeter() << "." << endl;
}
double perimeter() const {
return 2 * length_ + 2 * breadth_;
}
};

int main(int argc, char *argv[])
{
Circle circle(4);
circle.print();
Rectangle rectangle(2, 5.5);
rectangle.print();
}

clojure

(defmulti area :Shape)
(defmulti print :Shape)

; Circle methods
(defn circle [r]
{:Shape :Circle
:name "Circle"
:radius r})

(defn circumference [c]
(* 2 Math/PI (:radius c)))

(defmethod area :Circle [c]
(* Math/PI (:radius c) (:radius c)))

(defmethod print :Circle [c]
(println (format "I am a %s with ->" (:name c)))
(println (format "Radius: %.2f" (:radius c)))
(println (format "Area: %.2f" (area c)))
(println (format "Circumference: %.2f" (circumference c))))

; Rectangle methods
(defn rectangle [l b]
{:Shape :Rectangle
:name "Rectangle"
:length l
:breadth b})

(defn perimeter [r]
(+ (* 2 (:length r)) (* 2 (:breadth r))))

(defmethod area :Rectangle [r]
(* (:length r) (:breadth r)))

(defmethod print :Rectangle [r]
(println (format "I am a %s with ->" (:name r)))
(println (format "Length, Width: %.2f, %.2f" (:length r) (:breadth r)))
(println (format "Area: %.2f" (area r)))
(println (format "Perimeter: %.2f" (perimeter r))))

; usage of the "classes"
(let [shapes (list (circle 4.2) (rectangle 2.7 3.1) (rectangle 6.2 2.6) (circle 17.3))]
(doseq [shape shapes]
(print shape)))

Implement and use an Interface

Create a Serializable interface consisting of 'save' and 'restore' methods, each of which:

* Accept a stream or handle or descriptor argument for the source or destination
* Save to destination or restore from source the properties or data members of the implementing class (restrict yourself to the primitive types 'int' and 'string')

Next, create a Person class which has 'name' and 'age' properties or data members and implements this interface. Instantiate a Person object, save it to a serial stream, and instantiate a new Person object by restoring it from the serial stream.

python

import pickle

class Person:
def __init__(self, name, age):
self.name = name
self.age = age
def __str__(self):
return "Name: {name}, age: {age}".format(name=self.name, age=self.age)

person = Person("Gaylord Focker", 21)
with open("person.pickle", "wb") as outstream:
pickle.dump(person, outstream)
with open("person.pickle", "rb") as instream:
deserialized_person = pickle.load(instream)
print(deserialized_person)

cpp

struct person
{
person(){}
person(const string &name, int age) : name_(name), age_(age) {}

string name_;
int age_;

template<typename Archive>
void serialize(Archive &ar, const unsigned int version) {
ar & name_ & age_;
}
};

int main()
{
const char *fn = "filename.txt";

person k("Ken", 38);
{
ofstream ofs(fn);
archive::text_oarchive oa(ofs);
oa << k;
}

person restored_person;
{
ifstream ifs(fn);
archive::text_iarchive ia(ifs);
ia >> restored_person;
}

cout << "Name : " << restored_person.name_ << endl
<< "Age : " << restored_person.age_ << endl;
}

clojure

(defn person [name age]
{:name name :age age})

(defn show [p]
(println (format "Name=%s Age=%d" (:name p) (:age p))))

(defn save [p filename]
(with-out-writer filename (pr p)))

(defn restore [filename]
(read (PushbackReader. (reader filename))))

(let [p (person "Ken" 38)]
(show p)
(save p *person-fn*))

(let [ser-p (restore *person-fn*)]
(show ser-p))

Networking

HTTP

Check your language appears on the langref.org site

Your language name should appear within the HTML found at the http://langreg.org main page.

python

from urllib import urlopen
print urlopen('http://langref.org').read().find('python') >= 0 and 'found' or 'not found'

cpp

HttpWebRequest^ httpReq = safe_cast<HttpWebRequest^>(WebRequest::Create(url)); httpReq->KeepAlive = false;
StreamReader^ httpStream = gcnew StreamReader(httpReq->GetResponse()->GetResponseStream());
String^ htmlPage = httpStream->ReadToEnd(); httpStream->Close();

Console::WriteLine("{0} {1} {2}", url, (htmlPage->IndexOf(url + language) > 0 ? "offers" : "does not offer"), language);

clojure

(def *url* "http://langref.org/")
(def *lang* "clojure")

(with-open [ stream (.openStream (URL. *url*)) ]
(let [ body (str (line-seq (BufferedReader. (InputStreamReader. stream)))) ]
(str "Language " *lang* " does "
(if-not (re-matches (re-pattern (str ".*" *url* *lang* ".*")) body) "not ")
"exist")))

SMTP

Send an email

Use library functions, classes or objects to create a short email addressed to your own email address. The subject should be, "Greetings from langref.org", and the user should be prompted for the message body, and whether to cancel or proceed with sending the email.

python

import smtplib
import locale

from email.mime.text import MIMEText

encoding = locale.getpreferredencoding()

def main():
smtp_servername = "smtp.example.com"

from_addr = "ernie@example.com"
to_addr = "cookie.monster@mailinator.com"

body = raw_input("Enter the email message ")
if not raw_input("Send email? y/N ") in ["y", "Y"]:
print "aborting"
return

message = MIMEText(body, _charset=encoding)

message["From"] = from_addr
message["To"] = to_addr
message["Subject"] = "Greetings from langref.org"

server = smtplib.SMTP(smtp_servername)
server.sendmail(from_addr, to_addr, message.as_string())

if __name__ == "__main__":
main()

XML

Parsing

Process an XML document

Given the XML Document:

<shopping>
<item name="bread" quantity="3" price="2.50"/>
<item name="milk" quantity="2" price="3.50"/>
</shopping>

Print out the total cost of the items, e.g. $14.50

python

from xml.dom.minidom import parseString
document = parseString(
"""<shopping>
<item name="bread" quantity="3" price="2.50"/>
<item name="milk" quantity="2" price="3.50"/>
</shopping>""").documentElement
total = sum([float(item.getAttribute('price')) *
int(item.getAttribute('quantity'))
for item in document.getElementsByTagName('item')])
print '$%.2f' % total

cpp

char input[] =
"<shopping>"
" <item name=\"bread\" quantity=\"3\" price=\"2.50\"/>"
" <item name=\"milk\" quantity=\"2\" price=\"3.50\"/>"
"</shopping>";

xml_document<> doc;
doc.parse<0>(input);
xml_node<> *shopping = doc.first_node();

float total_price = 0;
for (xml_node<> *item = shopping->first_node(); item != NULL; item = item->next_sibling())
{
float item_sum = 0;
float val;

if (string(item->name()) != "item")
continue;

for (xml_attribute<> *attr = item->first_attribute(); attr != NULL; attr = attr->next_attribute())
{
string name(attr->name());
if (name == "quantity" || name == "price")
{
stringstream v(attr->value());
v >> val;
if (item_sum)
item_sum *= val;
else
item_sum = val;
}
}
total_price += item_sum;
}

cout.setf(ios::fixed, ios::floatfield);
cout << "Total price is $" << setprecision(2) << total_price << endl;

clojure

(println (format "Total cost of items are $%#.2f"
(->> (xml-seq (parse *xml-input-stream*))
(filter #(= :item (:tag %))) ; Remove all but the item tags
(map :attrs) ; Keep the attributes
(map (fn [e] (str "(* " (:quantity e) " " (:price e) ")"))) ; Get the total price as a sexp
(map read-string) ; "(* quantity price)" -> (* quantity price)
(map eval) ; (* quantity price) -> quantity*price
(apply +)))) ; Sum all elements

Creation

create some XML programmatically

Given the following CSV:

bread,3,2.50
milk,2,3.50

Produce the equivalent information in XML, e.g.:

<shopping>
<item name="bread" quantity="3" price="2.50" />
<item name="milk" quantity="2" price="3.50" />
</shopping>

python

from xml.dom import minidom

csv = """bread,3,2.50
milk,2,3.50"""

doc = minidom.Document()
shopping = doc.createElement("shopping")

for line in csv.split("\n"):
name, quantity, price = line.split(",")
el = doc.createElement("item")
el.setAttribute("name", name)
el.setAttribute("quantity", quantity)
el.setAttribute("price", price)
shopping.appendChild(el)

print shopping.toprettyxml()

from xml.etree.ElementTree import Element, SubElement, tostring

csv = """bread,3,2.50
milk,2,3.50"""

root = Element('shopping')

for line in csv.split("\n"):
name, quantity, price = line.split(",")
SubElement(root,'item', {'name' : name,
'quantity' : quantity,
'price' : price })

print tostring(root)

cpp

string input("bread,3,2.50\nmilk,2,3.50\n");

tokenizer<char_separator<char> > tokens(input, char_separator<char>(", \n"));
tokenizer<char_separator<char> >::iterator it = tokens.begin();

xml_document<> doc;
xml_node<> *shopping = doc.allocate_node(node_element, "shopping");
doc.append_node(shopping);

while (it != tokens.end()) {
xml_node<> *item = doc.allocate_node(node_element, "item");
shopping->append_node(item);

item->append_attribute(doc.allocate_attribute("name", doc.allocate_string((*it++).c_str())));
item->append_attribute(doc.allocate_attribute("quantity", doc.allocate_string((*it++).c_str())));
item->append_attribute(doc.allocate_attribute("price", doc.allocate_string((*it++).c_str())));
}

cout << doc << endl;

clojure

(defn list->xml-item [lst]
(let [[name quantity price] (map str lst)]
{:tag :item
:attrs {:name name
:quantity quantity
:price price}}))

(defn cvs->xml [r]
(->> (map #(read-string (str "(" % ")")) (line-seq r))
(map list->xml-item)
(assoc {:tag :shopping} :content)
(emit)
(with-out-str)))

(println (cvs->xml *cvs-reader*))

Algorithms

Geometry

Find all Pythagorean triangles with length or height less than or equal to 20

Pythagorean triangles are right angle triangles whose sides comply with the following equation:

a * a + b * b = c * c

where c represents the length of the hypotenuse, and a and b represent the lengths of the other two sides. Find all such triangles where a, b and c are non-zero integers with a and b less than or equal to 20. Sort your results by the size of the hypotenuse. The expected answer is:

[3, 4, 5]
[6, 8, 10]
[5, 12, 13]
[9, 12, 15]
[8, 15, 17]
[12, 16, 20]
[15, 20, 25]

python

from math import sqrt

a = 1
ret = []
while a <= 20:
b = 1
while b <= 20:
c = sqrt((a**2)+(b**2))
if int(c) == c and sorted([a,b,int(c)]) not in ret:
ret.append(sorted([a,b,int(c)]))
b +=1
a +=1
print ret

or if you wanna get snarky..

print sorted(set([tuple(sorted((a,b,int(sqrt((a**2)+(b**2)))))) for a in xrange(1,21) for \
b in xrange(1,21) if int(sqrt((a**2)+(b**2))) == sqrt((a**2)+(b**2))]))

cpp

vector<solution> solutions;

for (int a = 1; a <= 20; ++a)
for (int b = a + 1; b <= 20; ++b)
{
int c_squared = a*a + b*b;
int c = b + 1;
while (c * c < c_squared)
++c;
if (c * c == c_squared)
solutions.push_back(make_tuple(a, b, c));
}

sort(begin(solutions), end(solutions),
[](const solution& s1, const solution& s2) { return get<2>(s1) < get<2>(s2); });

for (const auto &s: solutions)
cout << '[' << get<0>(s) << ", " << get<1>(s) << ", " << get<2>(s) << ']' << endl;

clojure

(defn pythagorean [a b c] (= (+ (* a a) (* b b)) (* c c)))

(defn intsqrt [cc]
(. (. Math sqrt cc) intValue)
)

(defn triples [maxSize]
(filter not-empty
(for [a (range 1 20) b (range a 20)]
(let [c (intsqrt (+ (* a a) (* b b)))]
(if (pythagorean a b c)
[a b c]
()
)))))

(triples 20)
; -> ([3 4 5] [5 12 13] [6 8 10] [8 15 17] [9 12 15] [12 16 20] [15 20 25])

(defn sortByHypotenuse [triples]
(sort-by #(first (rest (rest %))) triples)
)

(sortByHypotenuse (triples 20))
; -> ([3 4 5] [6 8 10] [5 12 13] [9 12 15] [8 15 17] [12 16 20] [15 20 25])

(doseq [pt (sort-by #(% 2)
(for [a (range 1 21)
b (range a 21)
:let [aa+bb (+ (* a a) (* b b))
c (Math/round (Math/sqrt aa+bb))]
:when (= aa+bb (* c c))]
[a b c]))]
(println pt))

Arithmetic

Greatest Common Divisor

Find the largest positive integer that divides two given numbers without a remainder. For example, the GCD of 8 and 12 is 4.

python

def gcd_recursive(i, j):
if min(i, j) == 0:
return max(i, j)
else:
return gcd_recursive(min(i, j), abs(i - j))

def gcd_iterative(i, j):
while min(i, j) != 0:
i, j = min(i, j), abs(i - j)
return max(i, j)

if __name__ == "__main__":
print gcd_recursive(8, 12)
print gcd_iterative(8, 12)

from fractions import gcd
print gcd(8, 12)

cpp

#include <iostream>
#include <cstdlib>
#include <algorithm>

using namespace std;

int gcd_recursive(int i, int j) {
if (min(i, j) == 0)
return max(i, j);
else
return gcd_recursive(min(i, j), abs(i - j));
}

int gcd_recursive2(int x, int y) {
if (y == 0)
return x;
else
return gcd_recursive2(y, (x % y));
}

int gcd_iterative(int i, int j) {
while (min(i, j) != 0) {
i = min(i, j);
j = abs(i - j);
}
return max(i, j);
}

int main() {
std::cout << gcd_recursive(8, 12) << std::endl;
std::cout << gcd_recursive2(8, 12) << std::endl;
std::cout << gcd_iterative(8, 12) << std::endl;
return 0;
}

clojure

(defn gcd [a b]
(if (zero? b)
a
(recur b (mod b a))))

Misc

Fun

produces a copy of its own source code

In computing, a quine is a computer program which produces a copy of its own source code as its only output.

python

# adapted from a Quine by Sean B. Palmer

print (lambda s='print (lambda s=%r: (s %% s))()': (s % s))()

x='x=%r;print(x%%x)';print(x%x)

cpp

#include <cstdio>
#define B(x) x; printf("{ B(" #x ") }\n");
int main()
{ B(printf("#include <cstdio>\n#define B(x) x; printf(\"{ B(\" #x \") }\\n\");\nint main()\n")) }

clojure

(def s"(def s%s)(printf s(pr-str s))")(printf s(pr-str s))

Parallel

Pool of Workers

Subdivide A Problem To A Pool Of Workers (No Shared Data)

python

import multiprocessing
import itertools

task_input = ["ab", "we", "tfe", "aoj"]

def all_subperms(s):
return set(reduce(
list.__add__,
([''.join(p) for p in itertools.product(s, repeat=r) if p]
for r in xrange(len(s) + 1))))

p = multiprocessing.Pool(len(task_input))
task_output = p.map(all_subperms, task_input)
print map(list, task_output)

cpp

vector<string> input;
input.push_back("ab");
input.push_back("we");
input.push_back("tfe");
input.push_back("aoj");

// Make the capacity for 'output' the same as 'input'
vector<set<string> > output(input.size());
#pragma omp parallel for
for (int i = 0; i < input.size(); ++i) {
set<string> perms;
generate_perms(input[i], perms);
#pragma omp critical
// Must use operator[]() and not push_back() since this line
// might be called in any order with respect to 'i'
output[i] = perms;
}

cout << output << endl;

clojure

(defn perm-chars [l]
"Returns a list of all possible permutations of strings with the
same size as the input string. This function will return duplicates
if the same character occurs multiple time in the string.
Ex: ab -> (aa ab ba ab)"
(if (string? l)
(recur (repeat (count l) l))
(let [s (first l)
r (rest l)]
(if (empty? r)
(map identity s)
(->> s
(map (fn [c] (map #(str c %) (perm-chars r))))
(flatten))))))

(defn perm-sz [s]
"Returns a list of all possible permutations of the input
string. May return duplicats.
Ex: ab -> (aa ab ba bb a b a b)"
(if-not (empty? s)
(let [r (perm-chars s)]
(if (= (count s) 1)
r
(->> r
(map #(perm-sz (apply str (rest %))))
(flatten)
(lazy-cat r))))))

(defn perm [s]
"Returns a list of all possible permutations of the input
string. The list of string is sorted and does not contain
duplicates.
Ex: ab -> (a aa ab b ba bb)"
(->> (reduce (fn [s e] (conj s e)) #{} (perm-sz s))
(map str)
(sort)))

(println (pmap perm ["ab" "we" "tfe" "aoj"]))

(require 'cojure.contrib.combinatorics)

(pmap (fn [str]
(apply concat (map #(selections str (inc %))
(range (count str)))))
["ab", "we", "tfe", "aoj"])

Subdivide A Problem To A Pool Of Workers (Shared Data)

Take a hard to compute problem and split it up between multiple worker threads. In your solution, try to fully utilize available cores or processors. (I'm looking at you, Python!)

Note: In this question, there should be a need for shared state between worker threads while the problem is being solved.

Example:

-Conway Game of Life-

From Wikipedia:

The universe of the Game of Life is an infinite two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead. Every cell interacts with its eight neighbors, which are the cells that are directly horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:

1. Any live cell with fewer than two live neighbours dies, as if caused by underpopulation.
2. Any live cell with more than three live neighbours dies, as if by overcrowding.
3. Any live cell with two or three live neighbours lives on to the next generation.
4. Any dead cell with exactly three live neighbours becomes a live cell.

The initial pattern constitutes the seed of the system. The first generation is created by applying the above rules simultaneously to every cell in the seed—births and deaths happen simultaneously, and the discrete moment at which this happens is sometimes called a tick (in other words, each generation is a pure function of the one before). The rules continue to be applied repeatedly to create further generations.

--However, for our purposes, we will assign a size to the game "board": 2^k * 2^k . That is, the board should be easy to subdivide.

Notice that in this problem, at each step or "tick", each thread/process will need to share data with its neighborhood.

clojure

; This is a "glider"
(def *start*
[".O......"
"..O....."
"OOO....."
"........"
"........"
"........"
"........"])
(def *width* (count (first *start*)))
(def *height* (count *start*))
(def *live* \O)
(def *dead* \.)
(def *n-generations-to-show* 3)

(defn cell-at
([b coord]
(cell-at b coord {:col 0 :row 0}))
([b coord offset]
(let [x (mod (+ (:col coord) (:col offset)) *width*)
y (mod (+ (:row coord) (:row offset)) *height*)]
(nth (nth b y) x))))

(defn neighbor-count [b coord]
(->> (for [x (range -1 2) y (range -1 2)] {:col x :row y})
(filter #(not (= {:col 0 :row 0} %)))
(map (partial cell-at b coord))
(reduce (fn [sum n] (+ sum (if (= *live* n) 1 0))) 0)))

(defn next-generation-cell [b coord]
(let [nc (neighbor-count b coord)]
(cond (< nc 2) *dead*
(> nc 3) *dead*
(= nc 3) *live*
true (cell-at b coord))))

(defn next-generation-row [b row]
(->> (range *width*)
(map #(next-generation-cell b {:col % :row row}))
(apply str)))

(defn next-generation [b]
(->> (range *height*)
(pmap #(next-generation-row b %))))

(defn generation-seq [b]
(let [ng (next-generation b)]
(lazy-seq (cons ng (generation-seq ng)))))

(doseq [g (take *n-generations-to-show* (generation-seq *start*))]
(doseq [l g]
(println l))
(println))

(shutdown-agents)

; This version calculates each separate line on a separate thread (pmap in next-generation)

Threads

Create a multithreaded "Hello World"

Create a program which outputs the string "Hello World" to the console, multiple times, using separate threads or processes.

Example:

-Output-

Thread one says Hello World!
Thread two says Hello World!
Thread four says Hello World!
Thread three says Hello World!

-Notice that the threads can print in any order.

python

#!/usr/bin/python
from threading import Thread
Nthread = ['one','two','three','four']
def ThreadSpeaks(number):
print "Thread", number, "says Hello World!"
if __name__ == "__main__":
for n in range(0,len(Nthread)):
th =Thread(target=ThreadSpeaks, args=(Nthread[n],))
th.start()

cpp

#include <iostream>
#include <string>

using namespace std;

int main(){
int pid;
string text[4]={"one","two","three","four"};
for (int i=0;i<4;i++){
pid=fork();
if (pid>0){
//cout << "Process("<<pid<<") - " << "Thread " << text[i] << " says Hello World!" << endl;
cout << "Thread " << text[i] << " says Hello World!" << endl;
exit(0);
}
}
return 0;
}

#include <iostream>
#include <string>

#include <omp.h>

int main() {
unsigned int const num_threads = 4;

std::string const names[] = { "one", "two", "three", "four" };

# pragma omp parallel num_threads(num_threads)
{
unsigned const id = omp_get_thread_num();
// Stream concatenation isn't thread-safe so we use a critical section.
# pragma omp critical
std::cout << "Thread " << names[id] << " says Hello World!" << std::endl;
}
}

clojure

(doseq [msg ["one" "two" "three" "four"]]
(future (println "Thread" msg "says Hello World!")))

(dorun (pmap #(println (str "Thread " % " says Hello World!")) '("one" "two" "three" "four")))

(dorun (map (fn [n] (.start (Thread. #(println (str "Thread " n " says Hello World!")))))
'("one" "two" "three" "four")))

Create read/write lock on a shared resource.

Create multiple threads or processes who are either readers or writers. There should be more readers then writers.

(From Wikipedia):

Multiple readers can read the data in parallel but an exclusive lock is needed while writing the data. When a writer is writing the data, readers will be blocked until the writer is finished writing.

Example:

-Output-

Thread one says that the value is 8.
Thread three says that the value is 8.
Thread two is taking the lock.
Thread four tried to read the value, but could not.
Thread five tried to write to the value, but could not.
Thread two is changing the value to 9.
Thread two is releasing the lock.
Thread four says that the value is 9.
...

--Notice that when a needed resource is locked, a thread can set a timer and try again in the future, or wait to be notified that the resource is no longer locked.

python

#!/usr/bin/python
from threading import Thread, Lock
import time
thread_readers = ['one','two','three']
thread_writer = ['four','five']
lock = Lock()
value = 0

def Threadread(number):
global value
while True:
if lock.acquire(False):
print "Thread", number, "is taking the lock"
value += 1
print "Thread", number, "is changing the value to", value
print "Thread", number, "is releasing the lock."
lock.release()
else:
print "Thread", number, "tried to write to the value, but could not."
def Threadwrite(number):
global value
while True:
if lock.acquire(False):
print "Thread", number ,"four says that the value is", value
else:
print "Thread", number ,"tried to read the value, but could not."
if __name__ == "__main__":
for n in range(0,len(thread_readers)):
th =Thread(target=Threadread, args=(thread_readers[n],))
th.start()
for n in range(0,len(thread_writer)):
th =Thread(target=Threadwrite, args=(thread_writer[n],))
th.start()

cpp

class reader
{
string name_;
public:
reader(const string& name) : name_(name) {}

void operator()() {
for (;;this_thread::sleep(posix_time::milliseconds(1)))
{
shared_lock<shared_mutex> lock(m, try_to_lock);
lock_guard<mutex> cout_lock(io_m);
cout << "Thread " << name_;
if (lock)
cout << " says that the value is " << shared_value << "." << endl;
else
cout << " tried to read the value, but could not." << endl;
}
}
};

class writer
{
string name_;
public:
writer(const string& name) : name_(name) {}
void operator()() {
for (;;this_thread::sleep(posix_time::milliseconds(1)))
{
unique_lock<shared_mutex> lock(m, try_to_lock);
lock_guard<mutex> cout_lock(io_m);
cout << "Thread " << name_;
if (lock)
{
cout << " is taking the lock." << endl;
shared_value = rand() % 10;
cout << "Thread " << name_ << " is changing the value to " << shared_value << endl;
cout << "Thread " << name_ << " is releasing the lock. " << endl;
}
else
cout << " tried to write to the value, but could not." << endl;
}
}
};

int main()
{
thread t1 = thread(reader("one"));
thread t2 = thread(reader("two"));
thread t3 = thread(reader("three"));
thread t4 = thread(writer("four"));
writer("five")();
}

clojure

; NOTE! Using explicit locking is NOT the Clojure way. It was done
; this way in order to comply exactly with the problem
; specification. Sharing data in Clojure would normally be done by
; using "atom", "agent" or "ref" depending on situation. None of those
; methods would ever result in the reader not being able to read (as
; required by the problem) since reading is wait-free in clojure.

(def *readers* (map #(agent %) '("one" "two" "three")))
(def *writers* (map #(agent %) '("four" "five")))
(def *mutex* (agent :unlocked))
(def *value* 0)

; mutex implementation
(defn lock [state who success-fn fail-fn]
(send who (if (= state :locked) fail-fn success-fn))
:locked)

(defn unlock [mutex]
:unlocked)

; Must be invoked with send-off since this handler blocks
(defn rand-sleep [state next-fn]
(Thread/sleep (rand-int 5))
(send *agent* next-fn)
state)

; Reader functions
(declare try-read)

(defn reader-got-lock [name]
(println (format "Thread %s says that the value is %d." name *value*))
(send *mutex* unlock)
(send-off *agent* rand-sleep try-read)
name)

(defn reader-did-not-get-lock [name]
(println (format "Thread %s tried to read the value, but could not." name))
(send-off *agent* rand-sleep try-read)
name)

(defn try-read [name]
(send *mutex* lock *agent* reader-got-lock reader-did-not-get-lock)
name)

; Writer functions
(declare try-write)

(defn writer-got-lock [name]
(println (format "Thread %s is taking the lock." name))
(def *value* (rand-int 10))
(println (format "Thread %s is changing the value to %d." name *value*))
(send *mutex* unlock)
(println (format "Thread %s is relasing the lock." name))
(send-off *agent* rand-sleep try-write)
name)

(defn writer-did-not-get-lock [name]
(println (format "Thread %s tried to write the value, but could not." name))
(send-off *agent* rand-sleep try-write)
name)

(defn try-write [name]
(send *mutex* lock *agent* writer-got-lock writer-did-not-get-lock)
name)

(dorun (map #(send % try-write) *writers*))
(dorun (map #(send % try-read) *readers*))

Separate user interaction and computation.

Allow your program to accept user interaction while conducting a long running computation.

Example:

Hello user! Please input a string to permute: (input thread)
abcdef
Passing on abcdef... (input thread)
Please input another string to permute: (input thread)
lol
Passing on lol... (input thread)
Done Work On abcdef! (worker thread)
["abcdef", "abcefd", ... ] (worker thread)
Please input another string to permute: (input thread)
EXIT
Quitting, I

'll let my worker thread know... (input thread)

We'

re quitting! Alright! (worker thread)

--Notice, that this could be accomplished on the command line or within a GUI. The point is that computation and user interaction should take place on separate threads of control.

cpp

class bg_worker
{
mutex bg_mutex_;
condition_variable work_present_;
deque<string> work_queue_;

result calc_perm(string s) {
result perms = result(new list<string>());

// sleep to simulate lots of work...
this_thread::sleep(posix_time::seconds(3));
sort(s.begin(), s.end());
do {
perms->push_back(s);
} while (next_permutation(s.begin(), s.end()));
return perms;
}

public:
void submit_work(const string &s) {
lock_guard<mutex> lock(bg_mutex_);
work_queue_.push_back(s);
work_present_.notify_one();
}

void operator()() {
for (;;) {
unique_lock<mutex> lock(bg_mutex_);
while (work_queue_.empty())
work_present_.wait(lock);
string s = work_queue_.front();
work_queue_.pop_front();
lock.unlock();

if (s == "EXIT") {
lock_guard<mutex> cout_lock(cout_mutex);
cout << "We're quitting! Alright!" << endl;
break;
}

result perm = calc_perm(s);
lock_guard<mutex> cout_lock(cout_mutex);
cout << "Done Work On " << s << "!" << endl;
cout << perm << endl;
}
}
};

int main()
{
bg_worker worker;
thread bg_thr(boost::ref(worker));
bool done = false;

{
lock_guard<mutex> cout_lock(cout_mutex);
cout << "Hello user! Please input a string to permute:" << endl;
}

while (!done)
{
string input;
cin >> input;
{
lock_guard<mutex> cout_lock(cout_mutex);
if (input == "EXIT") {
cout << "Quitting, I'll let my worker thread know..." << endl;
done = true;
} else {
cout << "Passing on " << input << "..." << endl;
cout << "Please input another string to permute:" << endl;
}
}
worker.submit_work(input);
}

bg_thr.join();
}

clojure

(defn background-computation [_ s]
(let [res (permutations s)]
(println (format "Done Work On %s!" s))
(println res)))

(defn shutdown-app [_]
(println "We're quitting! Alright!")
(shutdown-agents))

(println "Hello user! Please input a string to permute: ")
(let [worker-agent (agent nil)]
(loop [input (str (read))]
(if (= input "EXIT")
(do (println "Quitting, I'll let my worker thread know...")
(send worker-agent shutdown-app))
(do (println (format "Passing on %s..." input))
(send worker-agent background-computation input)
(println "Please input another string to permute: ")
(recur (str (read)))))))

i18n

i18n-helloworld

Put a internationalizate of HelloWorld program

Set locale to "es" (spanish) and provide a program that changes outputs ("Helloworld") depending of locale.

In pseudocode:

Void main ()

{



Locale.set("es")



print.translate("Helloworld, Locale.get)



}

180

"http://www.ecigarettefresh.com/cartomizer-ecigarette-c-7.html ">Cartomizer E-Cigarette</a>strong>"http://www.ecigarettefresh.com/cartomizer-ecigarette-c-7.html ">Electronic Cigarette</a>strong>"http://www.ecigarettefresh.com/cartomizer-ecigarette-c-7.html ">Smokeless Cigarettes</a>strong>"http://www.ecigarettefresh.com/cartomizer-ecigarette-c-7.html ">discount Electronic Cigarette</a>strong>"http://www.ecigarettefresh.com/disposable-ecigarette-c-8.html ">Disposable E-Cigarette</a>strong>"http://www.ecigarettefresh.com/accessories-c-6.html ">Accessories</a>strong>"http://www.ecigarettefresh.com/mini-ecigarette-c-13.html ">Mini E-cigarette</a>strong>"http://www.ecigarettefresh.com/esmoking-c-11.html ">electric cigarette outlet</a>strong>"http://www.ecigarettefresh.com/smokeless-cigarettes-c-12.html ">Smokeless Cigarettes online</a>strong>"http://www.ecigarettefresh.com/ecigarette-c-9.html ">Electronic Cigarette online</a>strong>."http://blog.allluxurywatches.com"> outlet blog </a> outlet a>"http://blog.linksoflondonshopping.com"> About ecigarettefresh.com blog

coach wallet

180

180

"http://www.lovembtshoes.com/ ">mbt boots</a>strong>"http://www.lovembtshoes.com/ ">mbt shoes</a>strong>"http://www.lovembtshoes.com/ ">buy mbt boots</a>strong>"http://www.lovembtshoes.com/ ">discount mbt shoes</a>strong>"http://www.lovembtshoes.com/ ">mbt shoes online</a>strong>"http://www.lovembtshoes.com/mbt-tariki-c-50.html ">MBT Tariki shoes outlet</a>strong>"http://www.lovembtshoes.com/mbt-karibu-c-18.html ">wholesale MBT Karibu shoes</a>strong>"http://www.lovembtshoes.com/mbt-kafala-black-leather-women-shoes-p-68.html ">buy MBT Kafala shoes</a>strong>"http://www.lovembtshoes.com/mbt-meli-c-33.html ">MBT Meli</a>strong>"http://www.lovembtshoes.com/mbt-kifundo-c-25.html ">discount MBT Kifundo</a>strong>."http://blog.bootsonlinecompany.com"> Bia blog </a> Bia a>"http://blog.linkuggbootsoutlet.com"> About lovembtshoes.com blog

�ֹ��

180

180

Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes <code>[Mall3411]</code> - $175.01 : <<code>/title> <br/><meta http-equiv="Content-Type" content="text/</code>html; charset=utf-8<code>" /> <br/><meta name="</code>keywords<code>" content="</code>Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes <code>[Mall3411]</code> Robes de Mariée Robes de mariée 2012 Robe de mariée sexy Robes de mariée robes Quinceanera Robes de bal Robes de soirée Robes de bal Robes de soirée Robes de cocktail <code>" /> <br/><meta name="</code>description<code>" content="</code> Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes <code>[Mall3411]</code> - Nom de l<code>'article: " /> <br/><meta http-equiv="imagetoolbar" content="no" /> <br/><meta name="author" content="Zen Cart China" /> <br/><meta name="generator" content="Zen Cart, http://www.zen-cart.cn" /> <br/> <br/> <br/><link rel="canonical" href="http://fr.weddingdressescompany.com/low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html" /> <br/> <br/><link rel="stylesheet" type="text/css" href="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/css/style_imagehover.css" /><br/><link rel="stylesheet" type="text/css" href="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/css/stylesheet.css" /><br/><link rel="stylesheet" type="text/css" href="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/css/stylesheet_css_buttons.css" /><br/><link rel="stylesheet" type="text/css" media="print" href="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/css/print_stylesheet.css" /><br/><br/><br/><br/> <br/><link type="text/css" href="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/css/magiczoomplus.css" rel="stylesheet" media="screen" /> <br/> <br/><br/><br/> <br/> <br/> <br/> <br/> <br/><div id="mainWrapper "> <br/> <br/> <br/> <br/><br/> <br/> <br/><div id="headerWrapper "><div id="lang_main_page" style="padding-top:10px; float:right; "><b>language:</b> <br/> <br/> <a href="http://de.weddingdressescompany.com "> <br/> <img src="http://fr.weddingdressescompany.com/langimg/gericon.gif" alt="Deutsch" title=" Deutsch " height="15" width="24 "></a> <br/> <a href="http://fr.weddingdressescompany.com "> <br/> <img src="http://fr.weddingdressescompany.com/langimg/fricon.gif" alt="Français" title=" Français " height="15" width="24 "></a> <br/> <a href="http://it.weddingdressescompany.com "> <br/> <img src="http://fr.weddingdressescompany.com/langimg/iticon.gif" alt="italiano" title=" italiano " height="15" width="24 "></a> <br/> <a href="http://es.weddingdressescompany.com "> <br/> <img src="http://fr.weddingdressescompany.com/langimg/esicon.gif" alt="Español" title=" Español " height="15" width="24 "></a> <br/> <a href="http://pt.weddingdressescompany.com "> <br/> <img src="http://fr.weddingdressescompany.com/langimg/pticon.gif" alt="Português" title=" Português " height="15" width="24 "></a> <br/> <a href="http://jp.weddingdressescompany.com "> <br/> <img src="http://fr.weddingdressescompany.com/langimg/jpicon.gif" alt="日本語" title=" 日本語 " height="14" width="24 "></a> <br/> <a href="http://www.weddingdressescompany.com "> <br/> <img src="http://fr.weddingdressescompany.com/langimg/icon.gif" alt="English" title=" English " height="15" width="24 "></a> <br/></div> <br/><br/> <br/><div class="topper-menu float-left" style="background:#333333; width:100%; text-align:right; padding:0px; "> <br/> <br/><div id="navEZPagesTop "> <br/> <ul style="list-style-image: none;list-style-type: none; padding:0px; height:28px; line-height:28px;margin-top: 0px; margin-bottom:0px;margin-left:55%; "> <br/> <li><a href="http://fr.weddingdressescompany.com/index.php?main_page=login "><font style="color:#FFFFFF ">My Account</font></a></li> <br/> <li><a href="http://fr.weddingdressescompany.com/index.php?main_page=shopping_cart "><font style="color:#FFFFFF ">View Cart</font></a></li> <br/> <li><a href="http://fr.weddingdressescompany.com/index.php?main_page=login "><font style="color:#FFFFFF ">Checkout</font></a></li> <br/> <br/> <li> <a href="http://fr.weddingdressescompany.com/index.php?main_page=login "><font style="color:#FFFFFF ">Se connecter</font></a> <br/> <font style="color:#FFFFFF "> HEADER_OR </font> <br/> <a href="http://fr.weddingdressescompany.com/index.php?main_page=create_account "><font style="color:#FFFFFF ">HEADER_TITLE_REGISTER</font></a></li> <br/> <br/> <br/> <br/> </ul> <br/></div> <br/></div> <br/><div class="clearBoth" /></div> <br/><br/> <br/> <br/> <br/><br/> <br/><br/> <br/> <br/><br/> <br/> <br/><div id="logoWrapper "> <br/><div id="logo" style="margin-top:5px; margin-bottom:5px; "><a href="http://fr.weddingdressescompany.com/ "><img src="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/images/logo.gif" alt="" width="250" height="73" /></a></div> <br/><div class="td-search-header "> <br/><div class="search-header float-left "> <br/><form name="quick_find_header" action="http://fr.weddingdressescompany.com/index.php?main_page=advanced_search_result" method="get "><input type="hidden" name="main_page" value="advanced_search_result" /><input type="hidden" name="search_in_description" value="1" /><div class="search-header-input" style="padding-top:10px;padding-bottom:0px; "><input type="text" name="keyword" size="6" maxlength="30" value="Entrez vos mots clefs ici" onfocus="if (this.value == '</code>Entrez vos mots clefs ici<code>') this.value = ';" onblur="if (this.value == ') this.value = '</code>Entrez vos mots clefs ici<code>';" /></div><div style="float:left "><input style="float:left;width:47px; height:35px;" type="image" src="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/images/search-bg_02.gif" value="Serch" /></div></form></div> <br/></div> <br/><div style=" float:left; margin-left:10px; height:58px; width:270px; "> <br/><br/> <br/><div style="float:left; padding-top:15px; "> <br/><img src="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/images/shipping.gif"/><a href="http://fr.weddingdressescompany.com/index.php?main_page=shopping_cart "><img src="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/images/cart.gif" style="border:0px;"/></a> <br/></div> <br/><br/> <br/><div style="height:10px; "></div> <br/><div style="padding-top:0px; "> <br/><div style="float:left; width:120px; "><font style=" font-size:0.96em; background:#FFFFFF; color:#000000; ">Choisissez votre devise</font></div> <br/><div style="float:left; width:100px; "> <br/><form name="currencies" action="http://fr.weddingdressescompany.com/" method="get "><select name="currency" onchange="this.form.submit();" style="width: 100% "><br/> <option value="USD" selected="selected ">US Dollar</option><br/> <option value="CNY ">CNY</option><br/> <option value="EUR ">Euro</option><br/> <option value="GBP ">GB Pound</option><br/> <option value="CAD ">Canadian Dollar</option><br/> <option value="AUD ">Australian Dollar</option><br/></select><br/><input type="hidden" name="main_page" value="product_info" /><input type="hidden" name="products_id" value="456" /></form></div> <br/></div> <br/><br/> <br/></div> <br/></div> <br/><div class="clearBoth" /></div> <br/><br/> <br/> <br/><br/> <br/> <br/><br/> <br/><br/> <br/> <br/> <br/><div id="top_nav "> <br/><div id="tab_nav "> <br/><br/> <br/><div class="top-nav-right "></div> <br/><div style=" float:left; "> <br/> <a href="http://fr.weddingdressescompany.com/low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html" ><img src="http://fr.weddingdressescompany.com/includes/templates/weddingdress-7/images/home.jpg"/></a> <br/></div> <br/><ul class="list-style-none "> <br/><li class="home-link "><a href="http://fr.weddingdressescompany.com/" >TOP_MENU_HOME</a></li> <br/><li id="" ><a href="http://fr.weddingdressescompany.com/cocktail-dresses-c-28.html ">Robes de cocktail</a></li> <br/><li id="" ><a href="http://fr.weddingdressescompany.com/evening-dresses-c-27.html ">Robes de soirée</a></li> <br/><li id="" ><a href="http://fr.weddingdressescompany.com/wedding-dresses-c-1.html ">Robes de mariée</a></li> <br/><li id="" ><a href="http://fr.weddingdressescompany.com/prom-dresses-c-24.html ">Robes de bal</a></li> <br/><li id="" ><a href="http://fr.weddingdressescompany.com/index.php?main_page=contact_us ">Contactez-nous</a></li> <br/><li id="" ><a href="http://fr.weddingdressescompany.com/javascript:__Bookmark('</code>http:<code>//</code>fr.weddingdressescompany.com<code>/»,«http:/fr.weddingdressescompany.com/</code><code>' ) " > Marque page</a></li> <br/></ul> <br/></div> <br/></div> <br/><hr style="border:2px solid #666666;"/> <br/><br/> <br/><br/> <br/> <br/></div> <br/><br/> <br/><table width="100%" border="0" cellspacing="0" cellpadding="0" id="contentMainWrapper "> <br/><tr> <br/> <br/><td id="navColumnOne" class="columnLeft" style="width:210px "> <br/><div id="navColumnOneWrapper" style="width: 220px" > <br/><div class="leftBoxContainer" id="categories" style="width: 220px "> <br/><div class="sidebox-header-left main-sidebox-header-left "><h3 class="leftBoxHeading main-sidebox-header-right" id="categoriesHeading ">Catégories</h3></div> <br/><div id="categoriesContent" class="sideBoxContent "><br/><div class="categories-top-list no-dots "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-mariée-c-1.html "><span class="category-subs-parent ">Robes de Mariée</span></a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-meilleures-robes-de-mariée-de-vente-c-1_19.html ">MEILLEURES robes de mariée de Vente</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-mini-robes-de-mariée-c-1_11.html ">Mini robes de mariée</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-petites-robes-noires-c-1_13.html ">Petites robes noires</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robe-de-mariée-amie-c-1_3.html ">Robe de mariée amie</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robe-de-mariée-sexy-c-1_30.html ">Robe de mariée sexy</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariage-de-plage-c-1_20.html ">Robes de mariage de plage</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariage-empire-c-1_15.html ">Robes de mariage Empire</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariage-gaine-c-1_6.html ">Robes de mariage gaine</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariage-robe-boule-c-1_21.html ">Robes de mariage robe boule</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-2012-c-1_29.html ">Robes de mariée 2012</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-a-ligne-c-1_22.html ">Robes de mariée A- ligne</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-bustier-c-1_4.html ">Robes de mariée bustier</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-colonne-c-1_17.html ">Robes de mariée Colonne</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-courtes-c-1_5.html ">Robes de Mariée courtes</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-de-couleur-c-1_18.html ">Robes de mariée de Couleur</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-de-princesse-c-1_8.html ">Robes de mariée de princesse</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-designer-c-1_16.html ">Robes de mariée Designer</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-en-dentelle-c-1_14.html ">Robes de mariée en dentelle</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-épaule-c-1_10.html ">Robes de mariée épaule</a></div><br/><div class="subcategory "><a class="category-products" href="http://fr.weddingdressescompany.com/robes-de-mariée-robes-de-mariée-sirène-c-1_12.html ">Robes de Mariée Sirène</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robe-de-mariée-sexy-c-7.html ">Robe de mariée sexy</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-bal-c-26.html ">Robes de bal</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-bal-c-24.html ">Robes de bal</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-cocktail-c-28.html ">Robes de cocktail</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-mariée-c-9.html ">Robes de mariée</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-mariée-2012-c-2.html ">Robes de mariée 2012</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-soirée-c-25.html ">Robes de soirée</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-de-soirée-c-27.html ">Robes de soirée</a></div><br/><div class="categories-top-list "><a class="category-top" href="http://fr.weddingdressescompany.com/robes-quinceanera-c-23.html ">robes Quinceanera</a></div><br/></div></div> <br/> <br/> <br/><div class="leftBoxContainer" id="whatsnew" style="width: 220px "> <br/><div class="sidebox-header-left "><h3 class="leftBoxHeading " id="whatsnewHeading ">Nouveaux produits - <a href="http://fr.weddingdressescompany.com/products_new.html "> [plus]</a></h3></div> <br/><div class="sideBoxContent centeredContent "><a href="http://fr.weddingdressescompany.com/asymétrique-sweetheart-siren-applique-ruché-de-mariage-sweep-longueur-de-robe-pwd110-p-498.html "><img src="http://fr.weddingdressescompany.com/images/weddingdress/princess_wedding_dresses_110.jpg" alt="Asymétrique sweetheart Siren Applique ruché de mariage Sweep Longueur de robe (PWD-110)" title=" Asymétrique sweetheart Siren Applique ruché de mariage Sweep Longueur de robe (PWD-110) " width="130" height="257" style="position:relative" onmouseover="showtrail('</code>images<code>/weddingdress/princess_wedding_dresses_110.jpg','Asymétrique sweetheart Siren Applique ruché de mariage Sweep Longueur de robe (PWD-110)',130,256,304,600,this,0,0,130,256);" onmouseout="hidetrail();" /</code>><<code>/a><a class="sidebox-products" href="http:/fr.weddingdressescompany.com/</code>asymétrique-sweetheart-siren-applique-ruché-de-mariage-sweep-longueur-de-robe-pwd110-p-498.html <code>">Asymétrique sweetheart Siren Applique ruché de mariage Sweep Longueur de robe (PWD-110)</a><div><span class="</code>normalprice <code>">$339.99 </span> <span class="</code>productSpecialPrice <code>">$169.99</span><span class="</code>productPriceDiscount <code>"><br />Economie : 50%</span></div></div><div class="</code>sideBoxContent centeredContent <code>"><a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/2012-chubby-à-encolure-en-v-à-taille-empire-applique-bretelles-robe-cour-train-pswd001-p-500.html "><img src="http:/fr.weddingdressescompany.com/</code>images<code>/weddingdress/</code>plus_size_wedding_dresses_001.jpg<code>" alt="</code>2012 Chubby à encolure en V à taille empire Applique bretelles Robe Cour Train (PSWD-001)<code>" title="</code> 2012 Chubby à encolure en V à taille empire Applique bretelles Robe Cour Train (PSWD-001) <code>" width="</code>130<code>" height="</code>173<code>" style="</code>position:relative<code>" onmouseover="</code>showtrail(<code>'images/weddingdress//plus_size_wedding_dresses_001.jpg'</code>,<code>'2012 Chubby à encolure en V à taille empire Applique bretelles Robe Cour Train (PSWD-001)'</code>,130,173,300,400,this,0,0,130,173);<code>" onmouseout="</code>hidetrail();<code>" /></a><a class="</code>sidebox-products<code>" href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/2012-chubby-à-encolure-en-v-à-taille-empire-applique-bretelles-robe-cour-train-pswd001-p-500.html ">2012 Chubby à encolure en V à taille empire Applique bretelles Robe Cour Train (PSWD-001)</</code>a><div><span class=<code>"normalprice "</code>>$318.99 <<code>/span> <span class="productSpecialPrice ">$158.99</</code>span><span class=<code>"productPriceDiscount "</code>><br <code>/>Economie : 50%</</code>span><<code>/div></</code>div><div class=<code>"sideBoxContent centeredContent "</code>><a href=<code>"http://fr.weddingdressescompany.com/elégant-aligne-bretelles-plus-size-sash-avec-robe-applique-longueur-de-balayage-pswd003-p-501.html "</code>><img src=<code>"http://fr.weddingdressescompany.com/images/weddingdress/plus_size_wedding_dresses_003.jpg"</code> alt=<code>"Elégant A-ligne bretelles Plus Size Sash Avec Robe Applique Longueur de balayage (PSWD-003)"</code> title=<code>" Elégant A-ligne bretelles Plus Size Sash Avec Robe Applique Longueur de balayage (PSWD-003) "</code> width=<code>"130"</code> height=<code>"173"</code> style=<code>"position:relative"</code> onmouseover=<code>"showtrail('images/weddingdress//plus_size_wedding_dresses_003.jpg','Elégant A-ligne bretelles Plus Size Sash Avec Robe Applique Longueur de balayage (PSWD-003)',130,173,1000,1333,this,0,0,130,173);"</code> onmouseout=<code>"hidetrail();"</code> <code>/></</code>a><a class=<code>"sidebox-products"</code> href=<code>"http://fr.weddingdressescompany.com/elégant-aligne-bretelles-plus-size-sash-avec-robe-applique-longueur-de-balayage-pswd003-p-501.html "</code>>Elégant A-ligne bretelles Plus Size Sash Avec Robe Applique Longueur de balayage (PSWD-003)<<code>/a><div><span class="normalprice ">$348.99 </</code>span> <span class=<code>"productSpecialPrice "</code>>$166.99<<code>/span><span class="productPriceDiscount "><br /</code>>Economie : 52%<<code>/span></</code>div><<code>/div><div class="sideBoxContent centeredContent "><a href="http:/fr.weddingdressescompany.com/</code>2012-slinky-applique-charme-sweetheart-tribunal-train-plissé-princess-dress-pwd111-p-499.html <code>"><img src="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/images/</code>weddingdress<code>/princess_wedding_dresses_111.jpg" alt="2012 Slinky Applique Charme sweetheart tribunal train plissé Princess Dress (PWD-111)" title=" 2012 Slinky Applique Charme sweetheart tribunal train plissé Princess Dress (PWD-111) " width="130" height="259" style="position:relative" onmouseover="showtrail('images/</code>weddingdress<code>//</code>princess_wedding_dresses_111.jpg<code>','</code>2012 Slinky Applique Charme sweetheart tribunal train plissé Princess Dress (PWD-111)<code>',130,259,301,600,this,0,0,130,259);" onmouseout="hidetrail();" /></a><a class="sidebox-products" href="http://fr.weddingdressescompany.com/2012-slinky-applique-charme-sweetheart-tribunal-train-plissé-princess-dress-pwd111-p-499.html ">2012 Slinky Applique Charme sweetheart tribunal train plissé Princess Dress (PWD-111)</a><div><span class="normalprice ">$326.99 </span> <span class="productSpecialPrice ">$165.99</span><span class="productPriceDiscount "><br />Economie : 49%</span></div></div></div> <br/> <br/></div></td> <br/><td id="columnCenter" valign="top "> <br/><br/> <br/><div id="navBreadCrumb "> <a href="http://fr.weddingdressescompany.com/ ">Accueil</a> :: <br/> <a href="http://fr.weddingdressescompany.com/robes-de-mariée-c-1.html ">Robes de Mariée</a> :: <br/> <a href="http://fr.weddingdressescompany.com/robes-de-mariée-robe-de-mariée-sexy-c-1_30.html ">Robe de mariée sexy</a> :: <br/>Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes<br/></div> <br/><br/> <br/> <br/> <br/><br/> <br/><br/> <br/> <br/><div class="centerColumn" id="productGeneral "> <br/> <br/> <br/><h1 id="productName" class="productGeneral ">Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes</h1> <br/> <br/><form name="cart_quantity" action="http://fr.weddingdressescompany.com/low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html?action=add_product&number_of_uploads=0" method="post" enctype="multipart/form-data "><br/> <br/><div style="float:left; "> <br/> <br/> <br/> <br/><div id="productMainImage" class="centeredContent back "> <br/> <br/><noscript> <br/><a href="http://fr.weddingdressescompany.com/index.php?main_page=popup_image&pID=456" target="_blank "> <a href="http://fr.weddingdressescompany.com/low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html" ><img src="http://fr.weddingdressescompany.com/images/weddingdress/sxw0018.jpg" alt="Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes" title=" Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes " width="240" height="329" /></a><br /><span class="imgLink ">Agrandir l'</code>image<<code>/span></</code>a><<code>/noscript> <br/></</code>div> <br/> <br/> <div id=<code>"productAdditionalImages "</code>> <br/> <div id=<code>"dfse "</code>><<code>/div> <br/> <div class="centerBoxContent "> <br/> <br/> <br/> <div class="additionalImages centeredContent back" style="width:100%; "><br/> <br/> <noscript><a href="http:/fr.weddingdressescompany.com/</code>low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html<code>" target="</code>_blank <code>"> <a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html" ><img src="http:/fr.weddingdressescompany.com/</code>images<code>/weddingdress/</code>sxw0018_01.jpg<code>" alt="</code>Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes<code>" title="</code> Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes <code>" width="</code>130<code>" height="</code>174<code>" style="</code>position:relative<code>" onmouseover="</code>showtrail(<code>'images/weddingdress//sxw0018_01.jpg'</code>,<code>'Low Cost Custom-Made bretelles sexy mariage mariée robe de mariée Robes'</code>,130,173,243,325,this,0,0,130,173);<code>" onmouseout="</code>hidetrail();<code>" /></a><br /><span class="</code>imgLinkAdditional <code>">Agrandir l'image</span></a></noscript></div><br/><br class="</code>clearBoth<code>" /> <br/> <br/></div></div> <br/> <br/></div> <br/> <br/><div style="</code>width:348px;float:right;<code>" id='pb-left-column'> <br/> <br/><span id="</code>productPrices<code>" class="</code>productGeneral <code>"> <br/>Price: <br/><span class="</code>normalprice <code>">$218.77 </span> <span class="</code>productSpecialPrice <code>">$175.01</span><span class="</code>productPriceDiscount <code>"><br />Economie : 20%</span></span> <br/><div class="</code>model_number<code>" style="</code>height:14px;padding-top:7px <code>"><h4 style="</code>float: left;color:black; <code>"><label class="</code>class <code>">Modèle : </label></h4><div style="</code>float: left;margin-top:5px;margin-left:6px; <code>"><span style="</code>font-size:12px;height:20px;color:black; <code>">Mall3411</span></div><br/></div> <br/> <br/> <br/> <br/> <br/> <br/><div id="</code>productAttributes <code>"> <br/><h1 style='margin-bottom: 10px;'>Step 1 - Choose Options:</h1> <br/> <br/> <br/><div class="</code>wrapperAttribsOptions <code>"> <br/><h4 class="</code>optionName back <code>"><label>Colors</label></h4> <br/><div class="</code>back <code>"><br/><select name="</code>id<code>[8]</code><code>" id="</code>attrib-8 <code>"><br/> <option value="</code>46 <code>">1</option><br/> <option value="</code>52 <code>">10</option><br/> <option value="</code>53 <code>">12</option><br/> <option value="</code>54 <code>">16</option><br/> <option value="</code>55 <code>">17</option><br/> <option value="</code>56 <code>">18</option><br/> <option value="</code>47 <code>">2</option><br/> <option value="</code>57 <code>">20</option><br/> <option value="</code>58 <code>">21</option><br/> <option value="</code>59 <code>">23</option><br/> <option value="</code>60 <code>">26</option><br/> <option value="</code>61 <code>">27</option><br/> <option value="</code>62 <code>">28</option><br/> <option value="</code>63 <code>">29</option><br/> <option value="</code>64 <code>">30</option><br/> <option value="</code>65 <code>">31</option><br/> <option value="</code>66 <code>">33</option><br/> <option value="</code>67 <code>">35</option><br/> <option value="</code>68 <code>">36</option><br/> <option value="</code>69 <code>">37</option><br/> <option value="</code>48 <code>">4</option><br/> <option value="</code>70 <code>">41</option><br/> <option value="</code>71 <code>">43</option><br/> <option value="</code>72 <code>">44</option><br/> <option value="</code>73 <code>">47</option><br/> <option value="</code>74 <code>">48</option><br/> <option value="</code>75 <code>">49</option><br/> <option value="</code>49 <code>">5</option><br/> <option value="</code>76 <code>">51</option><br/> <option value="</code>77 <code>">54</option><br/> <option value="</code>78 <code>">56</option><br/> <option value="</code>79 <code>">60</option><br/> <option value="</code>80 <code>">61</option><br/> <option value="</code>81 <code>">66</option><br/> <option value="</code>82 <code>">67</option><br/> <option value="</code>83 <code>">69</option><br/> <option value="</code>84 <code>">73</option><br/> <option value="</code>85 <code>">77</option><br/> <option value="</code>86 <code>">78</option><br/> <option value="</code>87 <code>">79</option><br/> <option value="</code>50 <code>">8</option><br/> <option value="</code>51 <code>">9</option><br/> <option value="</code>27 <code>">Ivory</option><br/> <option value="</code>26 <code>">Same As Picture</option><br/> <option value="</code>28 <code>">White</option><br/></select><br/><br/></div> <br/><br class="</code>clearBoth<code>" /> <br/></div> <br/> <br/> <br/> <br/> <br/><br/><br class="</code>clearBoth<code>" /> <br/> <br/><div class="</code>wrapperAttribsOptions <code>"> <br/><h4 class="</code>optionName back <code>"><label>Sizes</label></h4> <br/><div class="</code>back <code>"><br/><select name="</code>id<code>[9]</code><code>" id="</code>attrib-9 <code>"><br/> <option value="</code>29 <code>">US 10 / UK 12 / EUR 40</option><br/> <option value="</code>30 <code>">US 12 / UK 14 /EUR 42</option><br/> <option value="</code>31 <code>">US 14 / UK 16 /EUR 44</option><br/> <option value="</code>32 <code>">US 16 / UK 18 /EUR 46</option><br/> <option value="</code>33 <code>">US 18 / UK 20 /EUR 48</option><br/> <option value="</code>34 <code>">US 2 / UK 4 /EUR 32</option><br/> <option value="</code>35 <code>">US 20 / UK 22 /EUR 50</option><br/> <option value="</code>36 <code>">US 22 / UK 24 /EUR 52</option><br/> <option value="</code>37 <code>">US 24 / UK 26 /EUR 54</option><br/> <option value="</code>38 <code>">US 26 / UK 28 /EUR 56</option><br/> <option value="</code>39 <code>">US 28 / UK 30 /EUR 58</option><br/> <option value="</code>40 <code>">US 4 / UK 6 /EUR 34</option><br/> <option value="</code>41 <code>">US 6 / UK 8 /EUR 36</option><br/> <option value="</code>42 <code>">US 8 / UK 10 /EUR 38</option><br/></select><br/><br/></div> <br/><br class="</code>clearBoth<code>" /> <br/></div> <br/> <br/> <br/> <br/> <br/><br/><br class="</code>clearBoth<code>" /> <br/> <br/><div class="</code>wrapperAttribsOptions <code>"> <br/><h4 class="</code>optionName back <code>"><label>Back style</label></h4> <br/><div class="</code>back <code>"><br/><select name="</code>id<code>[10]</code><code>" id="</code>attrib-10 <code>"><br/> <option value="</code>44 <code>">Lace Up</option><br/> <option value="</code>43 <code>">Same As Picture</option><br/> <option value="</code>45 <code>">Zip Up</option><br/></select><br/><br/></div> <br/><br class="</code>clearBoth<code>" /> <br/></div> <br/> <br/> <br/> <br/> <br/><br/><br class="</code>clearBoth<code>" /> <br/> <br/><div style="</code>padding-bottom:5px; <code>"><a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/size.html" style="color:black;font-weight:bold;text-decoration:underline; color:#FF0000;" target="_blank ">Size Chart</</code>a> | <a href=<code>"http://fr.weddingdressescompany.com/color.html"</code> style=<code>"color:black;font-weight:bold;text-decoration:underline;color:#FF0000;"</code> target=<code>"_blank "</code>>Color Chart<<code>/a></</code>div> <br/> <br/> <br/><<code>/div> <br/><div id='quantity_cart'> <br/><h1>Step 2 - Choose Quantity:</</code>h1> <br/> <br/> <br/> <div class=<code>"wrapperAttribsOptions"</code> style=<code>"height:14px;padding-top:7px "</code>><h4 style=<code>"float:left; "</code>><label class=<code>"attribsInput "</code>>Quantity :<<code>/label></</code>h4><div style=<code>"float:left; "</code>><input type=<code>"text"</code> class=<code>"text"</code> id=<code>"quantity_wanted"</code> name=<code>"cart_quantity"</code> value=<code>"1"</code> maxlength=<code>"6"</code> size=<code>"4"</code> <code>/></</code>div><<code>/div> <br/> <br class="clearBoth "> <br/> <h1 style='margin-bottom: 10px;'>Step 3 - Add to cart:</</code>h1> <br/> <p id=<code>'add_to_cart'</code> class=<code>'buttons_bottom_block'</code>> <br/> <input type=<code>"hidden"</code> name=<code>"products_id"</code> value=<code>"456"</code> <code>/><input type="image" src="http:/fr.weddingdressescompany.com/</code>includes<code>/templates/</code>weddingdress-7<code>/buttons/</code>french<code>/button_in_cart.gif" alt="ajouter au panier" title=" ajouter au panier " /</code>> <<code>/p> <br/> <br/></</code>div> <br/><div> <br/> <div class=<code>'safe_onlinechat'</code>> <br/> <div class=<code>'safe_ssl'</code>> <br/> <a target=<code>'_blank'</code> href=<code>'msnim:chat?contact=myonlineservice@msn.com'</code> style=<code>"float:left; "</code>><img src=<code>'http://fr.weddingdressescompany.com/banner/msn.jpg'</code>><<code>/a> <br/> <a target='_blank' href='callto:/meganfox59'><img border=0 align='absmiddle' src='http:/fr.weddingdressescompany.com/</code>banner<code>/skype.jpg' style="float:left; "></</code>a> <br/> <<code>/div> <br/> </</code>div> <br/> <br/><<code>/div> <br/> <br/></</code>div> <br/> <br/> <br/><br class=<code>"clearBoth"</code> <code>/> <br/><div id='descript_menu'> <br/><ul id='more_info_tabs' class='idTabs idTabsShort'> <br/> <li><a onclick='dissplay_descript(this);' style='cursor:pointer;'>Details</</code>span><<code>/a></</code>li> <br/> <li><a onclick=<code>'displaysize(this);'</code>style=<code>'cursor:pointer;'</code>>SIZE & COLOR CHART<<code>/a></</code>li> <br/> <li><a onclick=<code>'dissplay_return(this);'</code>style=<code>'cursor:pointer;'</code>>Shipping<<code>/a></</code>li> <br/> <li><a onclick=<code>'measure(this);'</code>style=<code>'cursor:pointer;'</code>>How to Measure<<code>/a></</code>li> <br/><<code>/ul> <br/><script> <br/> function displaysize(obj){ <br/> var measure = document.getElementById('idTabMeasure'); <br/> var idTabtwo = document.getElementById('idTabtwo'); <br/> var shipping_return = document.getElementById('tab_3'); <br/> var descript = document.getElementById('productDescription'); <br/> <br/> idTabtwo.setAttribute('class','block_hidden_only_for_screen'); <br/> descript.setAttribute('class','display'); <br/> shipping_return.setAttribute('class','display'); <br/> measure.setAttribute('class','display'); <br/> } <br/> function dissplay_descript(obj){ <br/> var measure = document.getElementById('idTabMeasure'); <br/> var descript = document.getElementById('productDescription'); <br/> var idTabtwo = document.getElementById('idTabtwo'); <br/> var shipping_return = document.getElementById('tab_3'); <br/> descript.setAttribute('class','block_hidden_only_for_screen'); <br/> idTabtwo.setAttribute('class','display'); <br/> shipping_return.setAttribute('class','display'); <br/> measure.setAttribute('class','display'); <br/> <br/> } <br/> function dissplay_return(obj){ <br/> var measure = document.getElementById('idTabMeasure'); <br/> var shipping_return = document.getElementById('tab_3'); <br/> var descript = document.getElementById('productDescription'); <br/> var idTabtwo = document.getElementById('idTabtwo'); <br/> shipping_return.setAttribute('class','block_hidden_only_for_screen'); <br/> idTabtwo.setAttribute('class','display'); <br/> descript.setAttribute('class','display'); <br/> measure.setAttribute('class','display'); <br/> <br/> } <br/> function measure(obj){ <br/> var measure = document.getElementById('idTabMeasure'); <br/> var shipping_return = document.getElementById('tab_3'); <br/> var descript = document.getElementById('productDescription'); <br/> var idTabtwo = document.getElementById('idTabtwo'); <br/> measure.setAttribute('class','block_hidden_only_for_screen'); <br/> idTabtwo.setAttribute('class','display'); <br/> descript.setAttribute('class','display'); <br/> shipping_return.setAttribute('class','display'); <br/> <br/> <br/> <br/> } <br/></</code>script> <br/><div id=<code>'more_info_sheets'</code> class=<code>'sheets align_justify'</code>> <br/> <br/><div id=<code>"productDescription"</code> class=<code>'displayblock'</code>>Nom de l<code>'article:</div> <br/> <br/><div id='</code>idTabtwo<code>' class='</code>display<code>'> <br/> <div class='</code>SizeKind<code>'> <br/> <div style='</code>background-attachment: scroll; background-image: none; background-position: 0pt 0pt; background-repeat: repeat; border-bottom: 1px solid rgb(238, 238, 238); margin-bottom: 10px; padding-bottom: 10px; padding-top: 10px; text-align: center;<code>'> <br/> <p style='</code>font-weight: bold; color: rgb(178, 30, 54); font-size: 14px;<code>'>Please choose your favorite color from the palette</p> <br/> <a id='</code>single_3<code>' href='</code>http:<code>//</code>fr.weddingdressescompany.com<code>/image/</code>img_ColorCard.jpg<code>'><img src='</code>http:<code>//</code>fr.weddingdressescompany.com<code>/image/</code>img_ColorCard.jpg<code>' alt='</code>wedding dress card palette<code>' width='</code>720<code>'></a> <br/> <p style='</code>text-align: left;<code>'><span style='</code>color: rgb(255, 0, 0);<code>'>Notice:</span>Since computer screens have chromatic aberration, especially between CRT screen and LCD screen, we can not guarantee the color of the dress you get will be 100% similar as the color chart. And also different fabrics will show different color degree on the same color. So we can not accept any returned dress for sake of color. Please kindly understand us.</p> <br/> </div> <br/> <div style='</code>background-attachment: scroll; background-image: none; background-position: 0pt 0pt; background-repeat: repeat; border-bottom: 1px solid rgb(238, 238, 238); margin-bottom: 20px; padding-bottom: 20px; padding-top: 10px; text-align: center;<code>'> <br/> <p style='</code>font-weight: bold; color: rgb(178, 30, 54); font-size: 14px;<code>'> Please choose your size</p> <br/> <table cellspacing="0" cellpadding="0 "> <br/> <tbody> <br/> <tr> <br/> <th colspan="15 ">Standard size (in centimeter)</th> <br/> </tr> <br/> <tr> <br/> <br/> <th>US size no</th> <br/> <td>2</td> <br/> <td>4</td> <br/> <td>6</td> <br/> <td>8</td> <br/> <td>10</td> <br/> <br/> <td>12</td> <br/> <td>14</td> <br/> <td>16</td> <br/> <td>18</td> <br/> <td>20</td> <br/> <td>22</td> <br/> <br/> <td>24</td> <br/> <td>26</td> <br/> <td>28</td> <br/> </tr> <br/> <tr> <br/> <th>EUR size no</th> <br/> <td>32</td> <br/> <br/> <td>34</td> <br/> <td>36</td> <br/> <td>38</td> <br/> <td>40</td> <br/> <td>42</td> <br/> <td>44</td> <br/> <br/> <td>46</td> <br/> <td>48</td> <br/> <td>50</td> <br/> <td>52</td> <br/> <td>54</td> <br/> <td>56</td> <br/> <br/> <td>58</td> <br/> </tr> <br/> <tr> <br/> <th>Bust</th> <br/> <td>84</td> <br/> <td>86</td> <br/> <td>89</td> <br/> <br/> <td>91</td> <br/> <td>94</td> <br/> <td>98</td> <br/> <td>102</td> <br/> <td>105</td> <br/> <td>109</td> <br/> <br/> <td>114</td> <br/> <td>119</td> <br/> <td>124</td> <br/> <td>132</td> <br/> <td>142</td> <br/> </tr> <br/> <br/> <tr> <br/> <th>Waist</th> <br/> <td>66</td> <br/> <td>69</td> <br/> <td>71</td> <br/> <td>74</td> <br/> <br/> <td>76</td> <br/> <td>80</td> <br/> <td>84</td> <br/> <td>88</td> <br/> <td>91</td> <br/> <td>96</td> <br/> <br/> <td>102</td> <br/> <td>107</td> <br/> <td>114</td> <br/> <td>124</td> <br/> </tr> <br/> <tr> <br/> <th>Hip</th> <br/> <br/> <td>91</td> <br/> <td>94</td> <br/> <td>97</td> <br/> <td>99</td> <br/> <td>102</td> <br/> <td>105</td> <br/> <br/> <td>109</td> <br/> <td>113</td> <br/> <td>117</td> <br/> <td>122</td> <br/> <td>127</td> <br/> <td>132</td> <br/> <br/> <td>140</td> <br/> <td>150</td> <br/> </tr> <br/> <tr> <br/> <th>Shoulder to floor</th> <br/> <td>150</td> <br/> <td>150</td> <br/> <br/> <td>151</td> <br/> <td>152</td> <br/> <td>152</td> <br/> <td>153</td> <br/> <td>154</td> <br/> <td>154</td> <br/> <br/> <td>155</td> <br/> <td>156</td> <br/> <td>156</td> <br/> <td>156</td> <br/> <td>156</td> <br/> <td>156</td> <br/> <br/> </tr> <br/> </tbody> <br/></table> <br/><p> </p> <br/><table cellspacing="0" cellpadding="0 "> <br/> <tbody> <br/> <tr> <br/> <th colspan="15 ">Standard size (in inches)</th> <br/> </tr> <br/> <br/> <tr> <br/> <th>US size no</th> <br/> <td>2</td> <br/> <td>4</td> <br/> <td>6</td> <br/> <td>8</td> <br/> <br/> <td>10</td> <br/> <td>12</td> <br/> <td>14</td> <br/> <td>16</td> <br/> <td>18</td> <br/> <td>20</td> <br/> <br/> <td>22</td> <br/> <td>24</td> <br/> <td>26</td> <br/> <td>28</td> <br/> </tr> <br/> <tr> <br/> <th>EUR size no</th> <br/> <br/> <td>32</td> <br/> <td>34</td> <br/> <td>36</td> <br/> <td>38</td> <br/> <td>40</td> <br/> <td>42</td> <br/> <br/> <td>44</td> <br/> <td>46</td> <br/> <td>48</td> <br/> <td>50</td> <br/> <td>52</td> <br/> <td>54</td> <br/> <br/> <td>56</td> <br/> <td>58</td> <br/> </tr> <br/> <tr> <br/> <th>Bust</th> <br/> <td>33</td> <br/> <td>34</td> <br/> <br/> <td>35</td> <br/> <td>36</td> <br/> <td>37</td> <br/> <td>39</td> <br/> <td>40</td> <br/> <td>42</td> <br/> <br/> <td>43</td> <br/> <td>45</td> <br/> <td>47</td> <br/> <td>49</td> <br/> <td>52</td> <br/> <td>56</td> <br/> <br/> </tr> <br/> <tr> <br/> <th>Waist</th> <br/> <td>26</td> <br/> <td>27</td> <br/> <td>28</td> <br/> <td>29</td> <br/> <br/> <td>30</td> <br/> <td>32</td> <br/> <td>33</td> <br/> <td>35</td> <br/> <td>36</td> <br/> <td>38</td> <br/> <br/> <td>40</td> <br/> <td>42</td> <br/> <td>45</td> <br/> <td>49</td> <br/> </tr> <br/> <tr> <br/> <th>Hip</th> <br/> <br/> <td>36</td> <br/> <td>37</td> <br/> <td>38</td> <br/> <td>39</td> <br/> <td>40</td> <br/> <td>42</td> <br/> <br/> <td>43</td> <br/> <td>45</td> <br/> <td>46</td> <br/> <td>48</td> <br/> <td>50</td> <br/> <td>52</td> <br/> <br/> <td>55</td> <br/> <td>59</td> <br/> </tr> <br/> <tr> <br/> <th>Shoulder to floor</th> <br/> <td>59</td> <br/> <td>59</td> <br/> <br/> <td>60</td> <br/> <td>60</td> <br/> <td>60</td> <br/> <td>60</td> <br/> <td>61</td> <br/> <td>61</td> <br/> <br/> <td>61</td> <br/> <td>61</td> <br/> <td>62</td> <br/> <td>62</td> <br/> <td>62</td> <br/> <td>62</td> <br/> <br/> </tr> <br/> </tbody> <br/></table> <br/> <br/> </div> <br/> <br class='</code>clear<code>'> <br/> </div> <br/></div> <br/> <br/> <br/> <div id="tab_3" class='</code>display<code>'> <br/> <br/> <h3>Shipping Time</h3> <br/><p>Total Time=Operation Time + Shipping Time</p> <br/><p>Default operation time is 30 business days from the day you place an order. <br/>We will rush your order within 20 business days and 15 business days if you <br/>choose rush service from the operation time option,and you will pay extra <br/>cost for it.Shipping time varies as: UPS , TNT 2-4 business days, Air Mail(Express) 10 <br/>business days, Air Mail(Normal) 20 business days. Please calculate the total <br/>time carefully before you place the order.</p> <br/><p><i>Note: You can also choose Air Mail(Normal) if package weight is under 2kg.</i></p> <br/> <br/><h3>Return Tips</h3> <br/><p>If any returns, please contact our customer support within 24 hours from the time you receive your gown and fill in the Application for Refund in email. Only products in their original condition will be accepted. We do not accept returns on any custom made order. ALL SALES ARE FINAL for custom made dresses. For mis-shipped items, once confirmation got with us, we will be responsible for item exchange and have full refund returned including shipping fee and handling fee. In principle, any emergency order isnot subject to this return policy and will be denied. Also other merchandise, such as veil ect.</p></div> <br/> <br/><div id="idTabMeasure" style="height:510px;" class='</code>display<code>'> <br/> <div class="tempnr_box "> <br/> <br/> <div class="images_zuo "> <a href="http://fr.weddingdressescompany.com/low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html" ><img width="163" height="479" src="http://fr.weddingdressescompany.com/image/wedding_size.jpg"/></a></div> <br/> <br/> <div class="nr_right "> <br/> <p style="color:#b21e36;font-size:14px;font-style:italic;font-weight:bold; padding-left:0; ">How to Measure</p> <br/> <ul><li><span class="wzys ">A.Bust:</span>Measure Around The Fullest Part Of Your Bust.</li> <br/> <br/> <li><span class="wzys ">B.Waist:</span>Measure Around The Smallest Part Of Your Waistline.</li> <br/> <li><span class="wzys ">C.Hips:</span>Measure Around The Widest Part Of Your Hips.</li> <br/> <li><span class="wzys ">D.Length:</span> Measure From Top Of The Shoulder Through The Nipple To Floor,Including The Height Of <b>Wedding Shoes</b>.</li> <br/> <li><span class="wzys ">E.Under Bust:</span>Measure Around Under Your Bust.</li> <br/> <br/> <li><span class="wzys ">F.Nipple To Nipple:</span> The Measurement Between Your Two Nipples.</li> <br/> <li><span class="wzys ">G.Shoulder To NiPPLE:</span>Measure From Top Of The Shoulder To Nipple.</li> <br/> <li><span class="wzys ">H.Shoulder TO Waist:</span>Measure From Top Of The Shoulder Through The Nipple TO Waist.</li> <br/> <li><span class="wzys ">I.Shoulder To Hips:</span>Measure From Top Of The Shoulder Through The Nipple TO Hips.</li> <br/> <br/> <li><span class="wzys ">J.Shoulder To Shoulder:</span>Measure Your Shoulder Width From The Back.</li> <br/> <li><span class="wzys ">k.Neck:</span>Measure Around The Fullest Part Of Your Neck.</li> <br/> <li><span class="wzys ">L.Biceps:</span>Measure Around The Widest Part Of Your Arm.</li> <br/> <li class="wzys" style="color:#DD0000;font-size:14px;font-weight:bold;padding:5px;text-align:right;border:1px solid #eee; ">Please Measure With Bra and Underwear On.</li> <br/> <li class="wzys" style="font-size:11px;font-weight:bold;text-align:right; ">Remember To Keep The Measuring Tape Comfortably Loose.</li></ul> <br/> <br/> <br class="clear" /> <br/> <div><span style="color:#DD0000; margin-top:10px; ">Notice:</span>1. Please also tell us your "Height with Shoes" on (measured from top head to your wedding shoes'</code> heel).<br> <br/>2. Please remember that wear your Wedding Underwear and your Wedding Shoes.<br> <br/>3.Inches and Centimetersare both available for size, and please tell us if you use inches or centimeters.<br> <br/>4. We suggest you measure yourself by a Professional Tailor. <br> <br/>5. It is very normal to have 3CM measurement error between the sizes you give and the sizes you will receive on your dress. This kind of error can not be accepted for any returns and exchanges. <<code>/div> <br/> <br/> </</code>div> <br/> <br/> <span class=<code>"clear "</code>><<code>/span> <br/> </</code>div> <br/> <<code>/div> <br/> <br/></</code>div> <br/><<code>/div> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br class="clear" /</code>> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/><<code>/form> <br/> <br/></</code>div> <br/><<code>/td> <br/> <br/> <br/></</code>tr> <br/><<code>/table> <br/><br/> <br/> <br/><div id="navSuppWrapper "> <br/> <br/><div id="navSupp "> <br/><ul><li><a href="http:/fr.weddingdressescompany.com/</code>index.php <code>">Accueil</a></li> <br/><li><a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/index.php?main_page=shippinginfo ">Frais de port</</code>a><<code>/li> <br/><li><a href="http:/fr.weddingdressescompany.com/</code>index.php?main_page=Wholesale <code>">Vente en gros</a></li> <br/><li><a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/index.php?main_page=privacy ">Confidentialité</</code>a><<code>/li> <br/><li><a href="http:/fr.weddingdressescompany.com/</code>index.php?main_page=Tracking <code>">Suivi de commande</a></li> <br/><li><a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/index.php?main_page=Coupons ">Coupons</</code>a><<code>/li> <br/><li><a href="http:/fr.weddingdressescompany.com/</code>index.php?main_page=conditions <code>">Conditions d'utilisation</a></li> <br/><li><a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/index.php?main_page=FAQ ">FAQ</</code>a><<code>/li> <br/><li><a href="http:/fr.weddingdressescompany.com/</code>index.php?main_page=Western_Union <code>">Western Union</a></li> <br/><li><a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/index.php?main_page=Payment_Methods ">Modes de paiement</</code>a><<code>/li> <br/><li><a href="http:/fr.weddingdressescompany.com/</code>index.php?main_page=contact_us <code>">Contactez-nous</a></li> <br/> <br/> <br/></ul> <br/> <br/></div> <br/><DIV align="</code>center <code>"> <a href="</code>http:<code>//</code>fr.weddingdressescompany.com<code>/low-cost-custommade-bretelles-sexy-mariage-mariée-robe-de-mariée-robes-p-456.html" ><IMG src="http:/fr.weddingdressescompany.com/</code>includes<code>/templates/</code>weddingdress-7<code>/images/</code>payment.png<code>" width="</code>746<code>" height="</code>58 <code>"></a></DIV> <br/><div align="</code>center <code>">Copyright © 2012 Tous droits réservés .</div> <br/> <br/> <br/></div> <br/></div> <br/><br/> <br/><br/> <br/><br/> <br/><br/> <br/> <br/><br><br><a href="</code>http:<code>//</code>blog.ishirtsale.com<code>"> sexy blog </a><br><br><a href="</code>http:<code>//</code>blog.surprisewatches.com<code>"> mariée </a><br><br><a href="</code>http:<code>//</code>blog.bootsclubs.com"> About weddingdressescompany.com blog </a> </div> </div> </div> </div> <div class="category"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/nike-air-max">nike air max</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div id="category25"> <div class="subcategory"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/nike-air-max/180">180</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div style="clear:both"/> <div id="subcategory51"> <div class="problem"> <h3><a href="/python+cpp+clojure/nike-air-max/180/180">180</a></h3> <div class="solutions" id="problem368"> <strong><a href=<code>"http://www.kissdrdrebeats.com/ "</code>>beats by dre headphones<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.beatsdrdrecompany.com/ "</code>>by dre tour<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.loginmonsterbeats.com/ "</code>>beats by dre tour<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.bigbeatsbydre.com/ "</code>>beats by dre solo<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.beatsdrdrecompany.com/ "</code>>monster beats by dre<<code>/a></</code>strong><br><br/><br><br/> <br/><title> 2011 Monster Beats Studio Transformers,Transformers Beats Sale,Dr Dre Transformers Online,Dr Dre Beats Outlet<<code>/title> <br/><meta http-equiv="Content-Type" content="text/</code>html; charset=UTF-8<code>" /> <br/><meta name="</code>keywords<code>" content="</code>2011 Monster Beats Studio Transformers,Transformers Beats Sale,Dr Dre Transformers Online,Dr Dre Beats Outlet <code>" /> <br/><meta name="</code>description<code>" content="</code>2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones.Buy Monster Beats Studio Transformers Online at discounted beets prices <code>" /> <br/><meta http-equiv="</code>imagetoolbar<code>" content="</code>no<code>" /> <br/><meta name="</code>author<code>" content="</code>Zen Cart China<code>" /> <br/><meta name="</code>generator<code>" content="</code>Zen Cart, http:<code>//</code>www.zen-cart.cn<code>" /> <br/> <br/> <br/><link rel="</code>canonical<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/2011-monster-beats-by-dr-dre-transformers-limited-edition-headphones-p-42.html" /</code>> <br/> <br/><link rel=<code>"stylesheet"</code> type=<code>"text/css"</code> href=<code>"http://www.kissdrdrebeats.com/includes/templates/monsterbeats/css/style_imagehover.css"</code> <code>/><br/><link rel="stylesheet" type="text/</code>css<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/includes/</code>templates<code>/monsterbeats/</code>css<code>/styles_AJAX_image_swapper.css" /</code>><br/><link rel=<code>"stylesheet"</code> type=<code>"text/css"</code> href=<code>"http://www.kissdrdrebeats.com/includes/templates/monsterbeats/css/stylesheet.css"</code> <code>/><br/><link rel="stylesheet" type="text/</code>css<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/includes/</code>templates<code>/monsterbeats/</code>css<code>/stylesheet_css_buttons.css" /</code>><br/><link rel=<code>"stylesheet"</code> type=<code>"text/css"</code> media=<code>"print"</code> href=<code>"http://www.kissdrdrebeats.com/includes/templates/monsterbeats/css/print_stylesheet.css"</code> <code>/><br/><br/><br/><br/> <br/><link type="text/</code>css<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/includes/</code>templates<code>/monsterbeats/</code>css<code>/magiczoomplus.css" rel="stylesheet" media="screen" /</code>> <br/> <br/><br/><br/> <br/> <br/> <br/> <br/><div id=<code>"mainWrapper "</code>> <br/> <br/> <br/> <br/> <br/> <br/><div id=<code>"headerWrapper "</code>> <br/> <br/> <br/> <br/><div id=<code>"logoWrapper "</code>> <br/> <div id=<code>"logo "</code>><a href=<code>"http://www.kissdrdrebeats.com/ "</code>><img src=<code>"http://www.kissdrdrebeats.com/includes/templates/monsterbeats/images/logo.gif"</code> alt=<code>"Powered by Zen Cart :: The Art of E-Commerce"</code> title=<code>" Powered by Zen Cart :: The Art of E-Commerce "</code> width=<code>"320"</code> height=<code>"72"</code> <code>/></</code>a><<code>/div> <br/> <br/><div class="list" style="float:right; "> <br/> <br/><div class="languages-wrapper "> <br/> <br/> <form name="currencies_form" action="http:/www.kissdrdrebeats.com/</code><code>" method="</code>get <code>"><select name="</code>currency<code>" onchange="</code>this.form.submit(); <code>"><br/> <option value="</code>USD<code>" selected="</code>selected <code>">US Dollar</option><br/> <option value="</code>CNY <code>">CNY</option><br/> <option value="</code>EUR <code>">Euro</option><br/> <option value="</code>GBP <code>">GB Pound</option><br/> <option value="</code>CAD <code>">Canadian Dollar</option><br/> <option value="</code>AUD <code>">Australian Dollar</option><br/></select><br/><input type="</code>hidden<code>" name="</code>main_page<code>" value="</code>product_info<code>" /><input type="</code>hidden<code>" name="</code>products_id<code>" value="</code>42<code>" /></form> <label class="</code>float-right<code>" style="</code>font-size:14px;font-weight:bold; <code>"> Currency:</label> <br/> <br/> <br/> <ul class="</code>list-style-none<code>" style="</code>float:left;<code>" id="</code>headlogin <code>"> <br/> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/index.php?main_page=login ">Log In</</code>a> <br/> or <a href=<code>"http://www.kissdrdrebeats.com/index.php?main_page=create_account "</code>>Register<<code>/a> <br/></</code>div> <br/> <br/><div style=<code>"float:right; margin-top:8px;"</code> > <br/> <form name=<code>"quick_find_header"</code> action=<code>"http://www.kissdrdrebeats.com/index.php?main_page=advanced_search_result"</code> method=<code>"get "</code>><input type=<code>"hidden"</code> name=<code>"main_page"</code> value=<code>"advanced_search_result"</code> <code>/><input type="hidden" name="search_in_description" value="1" /</code>><div class=<code>"search-header-input "</code>><input type=<code>"text"</code> name=<code>"keyword"</code> size=<code>"6"</code> maxlength=<code>"30"</code> style=<code>"width: 138px"</code> value=<code>"Search for..."</code> onfocus=<code>"if (this.value == 'Search for...') this.value = '';"</code> onblur=<code>"if (this.value == '') this.value = 'Search for...';"</code> <code>/></</code>div><input class=<code>"button-search-header"</code> type=<code>"image"</code> src=<code>"http://www.kissdrdrebeats.com/includes/templates/monsterbeats/images/search_header_button.gif"</code> value=<code>"Serch"</code> <code>/></</code>form><<code>/div> <br/><div style="float:right; margin-top:8px; "> <br/> <div id="cartBoxEmpty "><a href="http:/www.kissdrdrebeats.com/</code>index.php?main_page=shopping_cart <code>"><img class="</code>cart-icon empty float-left<code>" src="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/includes/</code>templates<code>/monsterbeats/</code>images<code>/spacer.gif" /</code>><<code>/a>Your cart is empty</</code>div> <br/> <br/><<code>/div> <br/></</code>div> <br/><div class=<code>"clearBoth"</code> <code>/></</code>div> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/><div id=<code>"menu "</code>> <br/> <br/><div id=<code>"navEZPagesTop "</code>> <br/><ul> <br/> <li><a href=<code>"http://www.kissdrdrebeats.com/index.php "</code>>Home<<code>/a></</code>li> <br/> <li><a href=<code>"http://www.kissdrdrebeats.com/ "</code>>All Products<<code>/a></</code>li> <br/> <li><a href=<code>"http://www.kissdrdrebeats.com/index.php?main_page=shippinginfo "</code>>Shipping & Returns<<code>/a></</code>li> <br/> <li><a href=<code>"http://www.kissdrdrebeats.com/index.php?main_page=Coupons "</code>>Coupons<<code>/a></</code>li> <br/> <li><a href=<code>"http://www.kissdrdrebeats.com/index.php?main_page=Wholesale "</code>>Wholesale<<code>/a></</code>li> <br/> <li><a href=<code>"http://www.kissdrdrebeats.com/index.php?main_page=FAQ "</code>>FAQ<<code>/a></</code>li> <br/> <li><a href=<code>"http://www.kissdrdrebeats.com/index.php?main_page=contact_us "</code>>Contact Us<<code>/a></</code>li> <br/> <br/><<code>/ul> <br/></</code>div> <br/> <br/><<code>/div> <br/> <br/></</code>div> <br/> <br/><table width=<code>"100%"</code> border=<code>"0"</code> cellspacing=<code>"0"</code> cellpadding=<code>"0"</code> id=<code>"contentMainWrapper "</code>> <br/> <tr> <br/> <br/> <td id=<code>"navColumnOne"</code> class=<code>"columnLeft"</code> style=<code>"width: 190px "</code>> <br/><div id=<code>"navColumnOneWrapper"</code> style=<code>"width: 190px "</code>> <br/><div class=<code>"leftBoxContainer"</code> id=<code>"categories"</code> style=<code>"width: 190px "</code>> <br/><div class=<code>"sidebox-header-left main-sidebox-header-left "</code>><h3 class=<code>"leftBoxHeading main-sidebox-header-right"</code> id=<code>"categoriesHeading "</code>>Categories<<code>/h3></</code>div> <br/><div id=<code>"categoriesContent"</code> class=<code>"sideBoxContent "</code>><br/><div class=<code>"categories-top-list no-dots "</code>><a class=<code>"category-top"</code> href=<code>"http://www.kissdrdrebeats.com/2011-new-dr-dre-studio-for-christmas-gifts-c-4.html "</code>>2011 New Dr Dre Studio For Christmas Gifts<<code>/a></</code>div><br/><div class=<code>"categories-top-list "</code>><a class=<code>"category-top"</code> href=<code>"http://www.kissdrdrebeats.com/2011-dr-dre-studio-teams-logo-headphones-c-6.html "</code>>2011 Dr Dre Studio Teams Logo Headphones<<code>/a></</code>div><br/><div class=<code>"categories-top-list "</code>><a class=<code>"category-top"</code> href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-nate-robinson-c-9.html "</code>>2011 Monster Beats Studio Nate Robinson<<code>/a></</code>div><br/><div class=<code>"categories-top-list "</code>><a class=<code>"category-top"</code> href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html "</code>><span class=<code>"category-subs-selected "</code>>2011 Monster Beats Studio Transformers<<code>/span></</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-butterfly-c-13.html <code>">Monster Beats Butterfly</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-by-dr-dre-power-c-25.html ">Monster Beats By Dr Dre Power</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-by-dr-dre-tour-c-16.html <code>">Monster Beats By Dr Dre Tour</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-dr-dre-diddy-c-10.html ">Monster Beats Dr Dre Diddy</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-dr-dre-pro-c-5.html <code>">Monster Beats Dr Dre Pro</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-dr-dre-solo-c-12.html ">Monster Beats Dr Dre Solo</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-dr-dre-solo-hd-c-19.html <code>">Monster Beats Dr Dre Solo HD</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-dr-dre-wireless-bluetooth-c-24.html ">Monster Beats Dr Dre Wireless Bluetooth</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-miles-davis-tribute-c-20.html <code>">Monster Beats Miles Davis Tribute</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-studio-c-3.html ">Monster Beats Studio</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-studio-diamond-c-14.html <code>">Monster Beats Studio Diamond</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-studio-dr-dre-ferrari-c-7.html ">Monster Beats Studio Dr Dre Ferrari</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-studio-dr-dre-graffiti-c-17.html <code>">Monster Beats Studio Dr Dre Graffiti</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-studio-justin-bieber-c-1.html ">Monster Beats Studio Justin Bieber</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-studio-kobe-bryant-c-2.html <code>">Monster Beats Studio Kobe Bryant</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-studio-lamborghini-c-21.html ">Monster Beats Studio Lamborghini</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-studio-lebron-james-c-22.html <code>">Monster Beats Studio Lebron James</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-studio-michael-jackson-c-18.html ">Monster Beats Studio Michael Jackson</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-beats-studio-red-sox-c-15.html <code>">Monster Beats Studio Red Sox</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-beats-turbine-c-23.html ">Monster Beats Turbine</</code>a><<code>/div><br/><div class="categories-top-list "><a class="category-top" href="http:/www.kissdrdrebeats.com/</code>monster-lady-gaga-heartbeats-c-11.html <code>">Monster Lady Gaga Heartbeats</a></div><br/><div class="</code>categories-top-list <code>"><a class="</code>category-top<code>" href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/monster-vmoda-crossfade-lp-c-26.html ">Monster V-MODA Crossfade LP</</code>a><<code>/div><br/></</code>div><<code>/div> <br/> <br/></</code>div><<code>/td> <br/> <td id="columnCenter" valign="top "> <br/> <br/> <div id="navBreadCrumb "> <a href="http:/www.kissdrdrebeats.com/</code> <code>">Home</a> :: <br/> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/2011-monster-beats-studio-transformers-c-8.html ">2011 Monster Beats Studio Transformers</</code>a> :: <br/>2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones<br/><<code>/div> <br/> <br/> <br/> <br/> <br/> <br/><div class="centerColumn" id="productGeneral "> <br/> <br/> <br/><h1 id="productName" class="productGeneral ">2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones</</code>h1> <br/> <br/> <br/> <br/><form name=<code>"cart_quantity"</code> action=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-by-dr-dre-transformers-limited-edition-headphones-p-42.html?action=add_product"</code> method=<code>"post"</code> enctype=<code>"multipart/form-data "</code>><br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/><div id=<code>"productMainImage"</code> class=<code>"centeredContent back "</code>> <br/> <br/><noscript> <br/><a href=<code>"http://www.kissdrdrebeats.com/index.php?main_page=popup_image&pID=42"</code> target=<code>"_blank "</code>> <a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> ><img src=<code>"http://www.kissdrdrebeats.com/images/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones.jpg"</code> alt=<code>"2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones"</code> title=<code>" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones "</code> width=<code>"300"</code> height=<code>"225"</code> <code>/></</code>a><br <code>/><span class="imgLink ">larger image</</code>span><<code>/a></</code>noscript> <br/><<code>/div> <br/> <br/> <br/><span id="productPrices" class="productGeneral "> <br/><span class="normalprice ">$479.00 </</code>span> <span class=<code>"productSpecialPrice "</code>>$209.90<<code>/span><span class="productPriceDiscount "><br /</code>>Save: 56% off<<code>/span></</code>span> <br/> <br/> <br/> <br/><ul id=<code>"productDetailsList"</code> class=<code>"floatingBox back "</code>> <br/> <li>Model: monster083<<code>/li><br/> <br/> <br/> <br/></</code>ul> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <div id=<code>"cartAdd "</code>> <br/> Add to Cart: <input type=<code>"text"</code> name=<code>"cart_quantity"</code> value=<code>"1"</code> maxlength=<code>"6"</code> size=<code>"4"</code> <code>/><br /</code>><br <code>/><input type="hidden" name="products_id" value="42" /</code>><input type=<code>"image"</code> src=<code>"http://www.kissdrdrebeats.com/includes/templates/monsterbeats/buttons/english/button_in_cart.gif"</code> alt=<code>"Add to Cart"</code> title=<code>" Add to Cart "</code> <code>/> </</code>div> <br/> <br/> <br/><br class=<code>"clearBoth"</code> <code>/> <br/> <br/> <br/> <br/> <br/> <div id="productAdditionalImages "> <br/> <div id="dfse "></</code>div> <br/> <div class=<code>"centerBoxContent "</code>> <br/> <br/> <br/> <div class=<code>"additionalImages centeredContent back"</code> style=<code>"width:33%; "</code>><br/> <br/> <noscript><a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> target=<code>"_blank "</code>> <a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> ><img src=<code>"http://www.kissdrdrebeats.com/images/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_001.jpg"</code> alt=<code>"2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones"</code> title=<code>" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones "</code> width=<code>"100"</code> height=<code>"75"</code> style=<code>"position:relative"</code> onmouseover=<code>"showtrail('images/monsterbeats//MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_001.jpg','2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones',100,75,600,450,this,0,0,100,75);"</code> onmouseout=<code>"hidetrail();"</code> <code>/></</code>a><br <code>/><span class="imgLinkAdditional ">larger image</</code>span><<code>/a></</code>noscript><<code>/div><br/> <div class="additionalImages centeredContent back" style="width:33%; "><br/> <br/> <noscript><a href="http:/www.kissdrdrebeats.com/</code>2011-monster-beats-studio-transformers-c-8.html<code>" target="</code>_blank <code>"> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/2011-monster-beats-studio-transformers-c-8.html" ><img src="http:/www.kissdrdrebeats.com/</code>images<code>/monsterbeats/</code>MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_002.jpg<code>" alt="</code>2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones<code>" title="</code> 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones <code>" width="</code>100<code>" height="</code>75<code>" style="</code>position:relative<code>" onmouseover="</code>showtrail(<code>'images/monsterbeats//MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_002.jpg'</code>,<code>'2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones'</code>,100,75,600,450,this,0,0,100,75);<code>" onmouseout="</code>hidetrail();<code>" /></a><br /><span class="</code>imgLinkAdditional <code>">larger image</span></a></noscript></div><br/> <div class="</code>additionalImages centeredContent back<code>" style="</code>width:33%; <code>"><br/> <br/> <noscript><a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/2011-monster-beats-studio-transformers-c-8.html" target="_blank "> <a href="http:/www.kissdrdrebeats.com/</code>2011-monster-beats-studio-transformers-c-8.html<code>" ><img src="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/images/</code>monsterbeats<code>/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_003.jpg" alt="2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones" title=" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones " width="100" height="75" style="position:relative" onmouseover="showtrail('images/</code>monsterbeats<code>//</code>MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_003.jpg<code>','</code>2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones<code>',100,75,600,450,this,0,0,100,75);" onmouseout="hidetrail();" /></a><br /><span class="imgLinkAdditional ">larger image</span></a></noscript></div><br/><br class="clearBoth" /> <br/> <br/> <div class="additionalImages centeredContent back" style="width:33%; "><br/> <br/> <noscript><a href="http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html" target="_blank "> <a href="http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html" ><img src="http://www.kissdrdrebeats.com/images/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_004.jpg" alt="2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones" title=" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones " width="100" height="75" style="position:relative" onmouseover="showtrail('</code>images<code>/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_004.jpg','2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones',100,75,600,450,this,0,0,100,75);" onmouseout="hidetrail();" /</code>><<code>/a><br /</code>><span class=<code>"imgLinkAdditional "</code>>larger image<<code>/span></</code>a><<code>/noscript></</code>div><br/> <div class=<code>"additionalImages centeredContent back"</code> style=<code>"width:33%; "</code>><br/> <br/> <noscript><a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> target=<code>"_blank "</code>> <a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> ><img src=<code>"http://www.kissdrdrebeats.com/images/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_005.jpg"</code> alt=<code>"2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones"</code> title=<code>" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones "</code> width=<code>"100"</code> height=<code>"75"</code> style=<code>"position:relative"</code> onmouseover=<code>"showtrail('images/monsterbeats//MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_005.jpg','2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones',100,75,600,450,this,0,0,100,75);"</code> onmouseout=<code>"hidetrail();"</code> <code>/></</code>a><br <code>/><span class="imgLinkAdditional ">larger image</</code>span><<code>/a></</code>noscript><<code>/div><br/> <div class="additionalImages centeredContent back" style="width:33%; "><br/> <br/> <noscript><a href="http:/www.kissdrdrebeats.com/</code>2011-monster-beats-studio-transformers-c-8.html<code>" target="</code>_blank <code>"> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/2011-monster-beats-studio-transformers-c-8.html" ><img src="http:/www.kissdrdrebeats.com/</code>images<code>/monsterbeats/</code>MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_006.jpg<code>" alt="</code>2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones<code>" title="</code> 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones <code>" width="</code>100<code>" height="</code>75<code>" style="</code>position:relative<code>" onmouseover="</code>showtrail(<code>'images/monsterbeats//MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_006.jpg'</code>,<code>'2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones'</code>,100,75,600,450,this,0,0,100,75);<code>" onmouseout="</code>hidetrail();<code>" /></a><br /><span class="</code>imgLinkAdditional <code>">larger image</span></a></noscript></div><br/><br class="</code>clearBoth<code>" /> <br/> <br/> <div class="</code>additionalImages centeredContent back<code>" style="</code>width:33%; <code>"><br/> <br/> <noscript><a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/2011-monster-beats-studio-transformers-c-8.html" target="_blank "> <a href="http:/www.kissdrdrebeats.com/</code>2011-monster-beats-studio-transformers-c-8.html<code>" ><img src="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/images/</code>monsterbeats<code>/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_007.jpg" alt="2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones" title=" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones " width="100" height="75" style="position:relative" onmouseover="showtrail('images/</code>monsterbeats<code>//</code>MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_007.jpg<code>','</code>2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones<code>',100,75,600,450,this,0,0,100,75);" onmouseout="hidetrail();" /></a><br /><span class="imgLinkAdditional ">larger image</span></a></noscript></div><br/> <div class="additionalImages centeredContent back" style="width:33%; "><br/> <br/> <noscript><a href="http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html" target="_blank "> <a href="http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html" ><img src="http://www.kissdrdrebeats.com/images/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_008.jpg" alt="2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones" title=" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones " width="100" height="75" style="position:relative" onmouseover="showtrail('</code>images<code>/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_008.jpg','2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones',100,75,600,450,this,0,0,100,75);" onmouseout="hidetrail();" /</code>><<code>/a><br /</code>><span class=<code>"imgLinkAdditional "</code>>larger image<<code>/span></</code>a><<code>/noscript></</code>div><br/> <div class=<code>"additionalImages centeredContent back"</code> style=<code>"width:33%; "</code>><br/> <br/> <noscript><a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> target=<code>"_blank "</code>> <a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> ><img src=<code>"http://www.kissdrdrebeats.com/images/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_009.jpg"</code> alt=<code>"2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones"</code> title=<code>" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones "</code> width=<code>"100"</code> height=<code>"75"</code> style=<code>"position:relative"</code> onmouseover=<code>"showtrail('images/monsterbeats//MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_009.jpg','2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones',100,75,600,450,this,0,0,100,75);"</code> onmouseout=<code>"hidetrail();"</code> <code>/></</code>a><br <code>/><span class="imgLinkAdditional ">larger image</</code>span><<code>/a></</code>noscript><<code>/div><br/><br class="clearBoth" /</code>> <br/> <br/> <div class=<code>"additionalImages centeredContent back"</code> style=<code>"width:33%; "</code>><br/> <br/> <noscript><a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> target=<code>"_blank "</code>> <a href=<code>"http://www.kissdrdrebeats.com/2011-monster-beats-studio-transformers-c-8.html"</code> ><img src=<code>"http://www.kissdrdrebeats.com/images/monsterbeats/MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_010.jpg"</code> alt=<code>"2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones"</code> title=<code>" 2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones "</code> width=<code>"100"</code> height=<code>"75"</code> style=<code>"position:relative"</code> onmouseover=<code>"showtrail('images/monsterbeats//MonsterBeatsByDr.DreTransformersLimitedEditionHeadphones_010.jpg','2011 Monster Beats By Dr. Dre Transformers Limited Edition Headphones',100,75,600,450,this,0,0,100,75);"</code> onmouseout=<code>"hidetrail();"</code> <code>/></</code>a><br <code>/><span class="imgLinkAdditional ">larger image</</code>span><<code>/a></</code>noscript><<code>/div><br/><br class="clearBoth" /</code>> <br/> <br/><<code>/div></</code>div> <br/> <br/> <br/> <br/><div id=<code>"productDescription"</code> class=<code>"productGeneral biggerText "</code>><p>Advanced driver design for precise audio <br> Extra large speaker drivers for super deep bass<br> High powered digital amplifier plays hip hop, rock, R+B and more loud, without distortion<br> Monster headphone cable with Quadripole twisted pair construction for balanced sound and clarity<<code>/p><p><strong>What's In The Box</</code>strong><<code>/p><p>Beats Studio headphones<br> Monster Cable headphone cable<br> Rigid Tour case<br> Anti-Microbial Cleaning cloth<br> 1/</code>8 to 1<code>/4" Adapter<br> Monster iSoniTalk iPhone enabled headphone </</code>p><<code>/div> <br/> <br/> <br/><br class="clearBoth" /</code>> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/> <br/><<code>/form> <br/> <br/></</code>div> <br/><<code>/td> <br/> <br/> <br/> </</code>tr> <br/><<code>/table> <br/> <br/> <br/><div id="navSuppWrapper "> <br/> <br/><div id="navSupp "> <br/><ul><li><a href="http:/www.kissdrdrebeats.com/</code>index.php <code>">Home</a></li> <br/><li> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/index.php?main_page=shippinginfo ">Shipping</</code>a><<code>/li> <br/><li> <a href="http:/www.kissdrdrebeats.com/</code>index.php?main_page=Wholesale <code>">Wholesale</a></li> <br/><li> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/index.php?main_page=privacy ">Privacy</</code>a><<code>/li> <br/><li> <a href="http:/www.kissdrdrebeats.com/</code>index.php?main_page=Tracking <code>">Order Tracking</a></li> <br/><li> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/index.php?main_page=Coupons ">Coupons</</code>a><<code>/li> <br/><li> <a href="http:/www.kissdrdrebeats.com/</code>index.php?main_page=conditions <code>">Conditions of Use</a></li> <br/><li> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/index.php?main_page=FAQ ">FAQ</</code>a><<code>/li> <br/><li> <a href="http:/www.kissdrdrebeats.com/</code>index.php?main_page=Payment_Methods <code>">Payment Methods</a></li> <br/><li> <a href="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/index.php?main_page=contact_us ">Contact Us</</code>a><<code>/li> <br/> <br/> <br/></</code>ul> <br/> <br/><<code>/div> <br/><DIV align="center "> <a href="http:/www.kissdrdrebeats.com/</code>2011-monster-beats-studio-transformers-c-8.html<code>" ><IMG src="</code>http:<code>//</code>www.kissdrdrebeats.com<code>/includes/</code>templates<code>/monsterbeats/</code>images<code>/paymentcart.jpg" width="473" height="37 "></</code>a> <<code>/DIV> <br/><div align="center ">Copyright © 2012 All Rights Reserved. </</code>div> <br/> <br/> <br/><<code>/div> <br/></</code>div> <br/> <br/> <br/> <br/> <br/><strong><a href=<code>"http://www.kissdrdrebeats.com/2011-new-dr-dre-studio-for-christmas-gifts-c-4.html "</code>>2011 New Dr Dre Studio For Christmas Gifts<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.kissdrdrebeats.com/2011-new-dr-dre-studio-for-christmas-gifts-c-4.html "</code>>Cheap Dr Dre Studio<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.kissdrdrebeats.com/2011-new-dr-dre-studio-for-christmas-gifts-c-4.html "</code>>Monster Studio Diamond Beats<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.kissdrdrebeats.com/2011-new-dr-dre-studio-for-christmas-gifts-c-4.html "</code>>Dr Dre Diamond Sale<<code>/a></</code>strong><br><br/><strong><a href=<code>"http://www.kissdrdrebeats.com/2011-new-dr-dre-studio-for-christmas-gifts-c-4.html "</code>>Dr Dre Studio For Christmas<<code>/a></</code>strong><br><br/><br><br><a href=<code>"http://blog.acheapbagsale.com"</code>> headphones blog <<code>/a><br><br><a href="http:/blog.kissmbtboots.com"> headphones </</code>a><br><br><a href=<code>"http://blog.ringsday.com"</code>> About kissdrdrebeats.com blog </a> </div> </div> </div> </div> <div class="category"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/ugg">ugg</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div id="category26"> <div class="subcategory"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/ugg/180">180</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div style="clear:both"/> <div id="subcategory52"> <div class="problem"> <h3><a href="/python+cpp+clojure/ugg/180/180">180</a></h3> <div class="solutions" id="problem362"> <strong><a href=<code>"http://www.freshmoncler.com/ "</code>>moncler<<code>/a></</code>strong><strong><a href=<code>"http://www.freshmoncler.com/ "</code>>moncler coat<<code>/a></</code>strong>The sorts of lighting found in a area can noticeably change exactly how that room in your home looks. Lighting generally is a complicated dilemma, so let<code>'s begin by defining various lighting words. <br /><br/><br /><br/>Incandescent signals. These lights supply a nice, golden glow into a room. <strong><a href="http://www.freshmoncler.com/ ">moncler vest</a></strong>There'</code>re much nicer to utilize than this cheaper on the lookout flourescent equipment. <br <code>/><br/><br /</code>><br/>Downlights usually are round or perhaps square cannisters, commonly metal, which might be recessed directly into or secured onto a ceiling. These lights may very well be used simply because spotlights, floodlights or maybe for basic lighting. <br <code>/><br/><br /</code>><br/>Table lamps can be employed as project lighting or perhaps for overall lighting. <br <code>/><br/><br /</code>><br/>Uplights are usually one-bulb lights which can be placed on to the ground behind pieces of furniture, glass shelving or plants to supply them some sort of dramatic accentuation. <strong><a href=<code>"http://www.freshmoncler.com/ "</code>>moncler jackets<<code>/a></</code>strong><br <code>/><br/><br /</code>><br/>Strip lighting can be employed behind drawers and about stairs together with platforms to get a dramatic direct result. The networks lit in this way can seems to be floating above the ground. <br <code>/><br/><br /</code>><br/>Trail Lighting. A track can help you use a single electrical outlet to provide electricity to numerous lights along side track<code>'s length of time. The track is usually surface affixed or recessed. <strong><a href="http://www.freshmoncler.com/ ">discount moncler jackets</a></strong>Track lighting is amongst the most adaptable lighting solutions available and will be changed around for you to accent different aspects of a bedroom. <br /><br/><br /><br/>Track lighting products and recessed lighting is usually set to make an benefit called retaining wall washing which unfortunately, as that sounds, washes a total wall by using light. <br /><br/><br /><br/>Dimmer clicks give the chance to provide an alternative level about light through turning any knob. Dimmers help save electricity and gives mood lighting products for exclusive occasions. <strong><a href="http://www.freshmoncler.com/moncler-accessories-sale-c-1.html ">Moncler accessories</a></strong><br /><br/><br /><br/>Different rooms in your own home need distinctive lighting. Halls and also stairs need to be well lit to stop accidents. Livingrooms need a number of lighting solutions:background, undertaking lights and also accent lighting products. The most effective lighting to get kitchens will be bright above your head lights and extra under-counter signals for endeavor lighting. <br /><br/><br /><br/>All forms of lighting fixtures can be located for whatever your expections may get. <strong><a href="http://www.freshmoncler.com/moncler-vest-women-sale-c-10.html ">cheap Moncler Vest</a></strong>They can easily run as a result of very low-priced to remarkably high price fixtures. <br /><br/><br /><br/>You will discover special considerations when working with lighting to get art or perhaps wall hangings. <br /><br/><br /><br/>For anyone who is lighting an individual picture and painting, try to position the light so that it does not really show a good reflection in the glass of your art bit. There happen to be special snapshot lights made specifically for lighting shots but most of these are a lot of effective simply because can mainly highlight the highest or bottom with the picture. Downlights undoubtedly are a good choice. <strong><a href="http://www.freshmoncler.com/moncler-womens-hoody-sale-c-12.html ">Moncler Womens Hoody</a></strong><br /><br/><br /><br/>When lighting a gaggle of pictures, it'</code>s easier to use man or women lights inside track lighting which might be positioned on the pictures. <br <code>/><br/><br /</code>><br/>Lighting sculptures is usually particularly complex. You are able to use uplights, downlights or perhaps strip lamps, depending with the sculpture and its particular placement. Experiment by using different devices and their particular placement to discover the best impact. <strong><a href=<code>"http://www.freshmoncler.com/moncler-men-jackets-sale-c-4.html "</code>>cheap moncler jacket on sale<<code>/a></</code>strong><br <code>/><br/><br /</code>><br/>Creative by using lighting really can enhance a person<code>'s decorating venture. Make use out of all the different different types of lighting to make your home a amazing showcase. So you might have gone released and bought yourself a furry friend that you are excited concerning teaching not to mention feeding but it really suddenly occurred to you you happen to be unsure about precisely how to feed the ferret and you may be wondering just what do ferrets try to eat. That is a wonderful question because like any living thing on earth, the eating habits plays a big factor while in the health as well as the quality about life that it will have. What do ferrets eat when they are young? What do ferrets eat when they are older? What do ferrets eat when they are babies? If these are among a person'</code>s questions, keep reading and we<code>'ll touch with those content. <strong><a href="http://www.freshmoncler.com/moncler-kids-sale-c-3.html "> Moncler Jackets on sale</a></strong><br /><br/><br /><br/>What Do Ferrets Eat as Little ones? <br /><br/><br /><br/>What undertake ferrets consume as babies is a great question simply because likely if you'</code>ve owned an old-fashioned pet such as a cat or a dog a person likely wanted to feed them puppy food or become supplemental milk with the pet retail store and ferrets are only not which usually hard so that you can feed due to that. Baby ferrets feed off the mother and tend to be weaned off by the breeder or perhaps pet store so that you can ever become one still, with that said, once you may have the the baby ferret he is already familiar with a diet consists of pellets. <br <code>/><br/><br /</code>><br/>What Do Ferrets Eat as Parents? <br <code>/><br/><br /</code>><br/>What complete ferrets eat as people is a different wonderful query however it is not complicated by using a ferret like some other species of animals. The simply thing ferrets usually do not fair certainly with in the way of pet meals are foods that incorporate fish mealtime and ferrets never like this in the least. Try to stay away from every fish centered food anytime purchasing any ferret cuisine pellets and as a make a difference of matter, ferrets like shaped food quite as good as pellets that look a little like rabbit foods. <br <code>/><br/><br /</code>><br/>An excellent quality snake food that could be extremely high in protein is often fed and also to a ferret but they really demand a high amount of protein and typically you ought to look just for food comprising at lowest 25-30% healthy proteins content. Always be sure to stay from the foods which might be easily attainable at a grocery retail store or food outlet as they quite simply are generally very cheaply made and do not provide the correct nutrition in a ferret. <br <code>/><br/><br /</code>><br/>What Do Ferrets Eat as Pleasures? <br <code>/><br/><br /</code>><br/>Ferrets thrive on a goody based method when assisting them matters but there are a few things to know before serving your dig up any goodies. Acceptable treats would be things just like fruits and vegetables but manufactured! What complete ferrets eat that are bad for them? Always stay away from chocolate, dog food, any type of raw steak and dairy. . <br><br><a href=<code>"http://blog.dressever.com"</code>> stroe blog <<code>/a><br><br><a href="http:/blog.bootsvillage.com"> stroe </</code>a><br><br><a href=<code>"http://blog.superbootsonline.com"</code>> About freshmoncler.com blog </a> </div> </div> </div> </div> <div class="category"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/ebel-watches">Ebel watches</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div id="category27"> <div class="subcategory"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/ebel-watches/180">180</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div style="clear:both"/> <div id="subcategory53"> <div class="problem"> <h3><a href="/python+cpp+clojure/ebel-watches/180/180">180</a></h3> <div class="solutions" id="problem369"> <br><strong><a href=<code>"http://www.watchcoltd.com/ "</code>>Hugo Boss Watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/ "</code>>Hush Puppies Watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/ "</code>>IWC Watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/ "</code>>Jaeger-LeCoultre Watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/a-lange-sohne-watches-c-567.html "</code>>A. Lange & Sohne watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/casio-watches-c-649.html "</code>>cheap Casio Watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/breguet-watches-c-606.html "</code>>Breguet<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/hermes-watches-c-751.html "</code>>Hermes<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/casio-watches-c-649.html "</code>>Replica Casio Watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.watchcoltd.com/rolex-watches-c-923.html "</code>>replica Rolex Watches<<code>/a></</code>strong>. <br><br><a href=<code>"http://blog.linkpandora.com"</code>> watches blog <<code>/a><br><br><a href="http:/blog.biguggbootsoutlet.com"> watches </</code>a><br><br><a href=<code>"http://blog.kindsofboots.com"</code>> About watchcoltd.com blog </a> </div> </div> </div> </div> <div class="category"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/rolex-online">rolex online</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div id="category28"> <div class="subcategory"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="/python+cpp+clojure/rolex-online/180">180</a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> <div style="clear:both"/> <div id="subcategory54"> <div class="problem"> <h3><a href="/python+cpp+clojure/rolex-online/180/180">180</a></h3> <div class="solutions" id="problem370"> <br><strong><a href=<code>"http://www.dressreplicawatches.com/a-lange-sohne-watches-c-567.html"</code>>A. Lange & Sohne watches<<code>/a></</code>strong><strong><a href=<code>"http://www.dressreplicawatches.com/a-lange-sohne-watches-c-567.html"</code>>Replica A. Lange & Sohne watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.dressreplicawatches.com/a-lange-sohne-watches-c-567.html"</code>>fake A. Lange & Sohne watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.dressreplicawatches.com/a-lange-sohne-watches-c-567.html"</code>>copy A. Lange & Sohne watches<<code>/a></</code>strong><br><strong><a href=<code>"http://www.dressreplicawatches.com/a-lange-sohne-watches-c-567.html"</code>>cheap A. Lange & Sohne watches<<code>/a></</code>strong><br><br><br><a href=<code>"http://blog.iamjewelers.com"</code>> online blog <<code>/a><br><br><a href="http:/blog.swarovskiuk.org"> online </</code>a><br><br><a href=<code>"http://blog.allpandoracharms.com"</code>> About dressreplicawatches.com blog </a> </div> </div> </div> </div> <div id="footer"> <div class="box"> <b class="rtop"> <b class="r1"></b> <b class="r2"></b> <b class="r3"></b> <b class="r4"></b> </b> <div class="content"> <a href="http://langref.org/submit">submit problem</a> | <a href="mailto:rob@langref.org">contact</a> | sponsored by <a href="http://refactor.com.au/"><img alt="Refactor-small" border="0" src="/images/refactor-small.png?1233409755" style="vertical-align:middle; padding-bottom:5px" /></a> </div> <b class="rbottom"> <b class="r4"></b> <b class="r3"></b> <b class="r2"></b> <b class="r1"></b> </b> </div> </div> </div> <script src="http://www.google-analytics.com/urchin.js" type="text/javascript"> </script> <script type="text/javascript"> _uacct = "UA-4264032-1"; _udn = "langref.org"; urchinTracker(); </script> </body> </html>