Re: [Mailman-Developers] Probe messages should not sent Precedenceheader
On Sat, Feb 18, 2012 at 7:15 AM, Mark Sapiro m...@msapiro.net wrote: Aamir Khan wrote: As suggested by Barry, I am working on this new bug, 808821https://bugs.launchpad.net/mailman/+bug/808821. As i browsed though the code of mailman, i found that 'src/mailman/bin/disabled.py' is the script which runs to send the messages to all the email addresses disabled may be because of over bouncing, by user himself, by admin, etc.. So, i just have to find out the way, so that bouncing mail won't set the precedence header. Am i on correct path ? I think you are at the start of a twisted path. I'm sorry, but I'm still not completely up to speed with mm3, but here's what I can tell you from 2.1. In 2.1, cron/disabled which I think is analogous to bin/disabled.py sends warnings, but it is not the only thing which does. Warnings are actually sent by the list method sendNextNotification() which is defined in 2.1 in Mailman/Bouncer.py. The sendNextNotification() method in turn uses the UserNotification() class defined in Mailman/Message.py to actually create and send the message. The UserNotification.send() method will add a Precedence: bulk header to any message which doesn't have any Precedence: header. Thus, there are two possible approaches. One approach is to add a noprecedence argument to the send() method with default = False, and in the method itself skip adding the Precedence: bulk header if noprecedence is true, and add a noprecedence=True argument to the call to the send() method in sendNextNotification(). I guess in MM3, there is no function as sendNextNotification(), because i used command, grep sendNextNotification() -r * and the result was only file 'src/mailman/bin/disabled.py'. There is a file 'src/mailman/email/messages.py', in which UserNotification() class is defined. It has a send function, which sets the precedence header. In file 'src/mailman/app/bouces.py', I guess the probe messages are sent directly using send() function of UserNotification() class. I think that from line 211 to 228, probe message is used to send VERP probe. But then, i am not able to find out the place from where probe message is sent after disabling of the address because of over bouncing. I have tried to make some changes to code and pushed it to my local branch [1]. Ran through all the tests, and none of them failed. Is there any way to run through a subset of test rather than running them using 'bin/test' command. Comments, feedback required on patch. [1] = http://bazaar.launchpad.net/~syst3mw0rm/mailman/precedence/revision/7080 -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org Security Policy: http://wiki.list.org/x/QIA9
[Bug 890675] Re: test_moderation fails on approved_at date comparison
Why is a '-' at the end of date ? I have changed it to '+' and it works! But i don't know whether it is correct way to rectify the error. ** Patch added: time.diff https://bugs.launchpad.net/mailman/+bug/890675/+attachment/2749070/+files/time.diff -- You received this bug notification because you are a member of Mailman Coders, which is subscribed to GNU Mailman. https://bugs.launchpad.net/bugs/890675 Title: test_moderation fails on approved_at date comparison To manage notifications about this bug go to: https://bugs.launchpad.net/mailman/+bug/890675/+subscriptions ___ Mailman-coders mailing list Mailman-coders@python.org http://mail.python.org/mailman/listinfo/mailman-coders
[Merge] lp:~syst3mw0rm/mailman/bug-890675 into lp:mailman
Aamir Khan has proposed merging lp:~syst3mw0rm/mailman/bug-890675 into
lp:mailman.
Requested reviews:
Mailman Coders (mailman-coders)
For more details, see:
https://code.launchpad.net/~syst3mw0rm/mailman/bug-890675/+merge/93669
--
https://code.launchpad.net/~syst3mw0rm/mailman/bug-890675/+merge/93669
Your team Mailman Coders is requested to review the proposed merge of
lp:~syst3mw0rm/mailman/bug-890675 into lp:mailman.
=== modified file 'src/mailman/app/tests/test_moderation.py'
--- src/mailman/app/tests/test_moderation.py 2012-01-30 15:37:16 +
+++ src/mailman/app/tests/test_moderation.py 2012-02-18 00:34:20 +
@@ -80,8 +80,8 @@
self.assertTrue('x-peer' in message)
# The X-Mailman-Approved-At header has local timezone information in
# it, so test that separately.
-self.assertEqual(message['x-mailman-approved-at'][:-4],
- 'Mon, 01 Aug 2005 07:49:23 -')
+self.assertEqual(message['x-mailman-approved-at'][:-5],
+ 'Mon, 01 Aug 2005 07:49:23 ')
del message['x-mailman-approved-at']
# The Message-ID matches the original.
self.assertEqual(message['message-id'], 'alpha')
=== modified file 'src/mailman/docs/NEWS.rst'
--- src/mailman/docs/NEWS.rst 2012-02-12 15:01:07 +
+++ src/mailman/docs/NEWS.rst 2012-02-18 00:34:20 +
@@ -617,3 +617,4 @@
* The List-Help, List-Subscribe, and List-Unsubscribe headers were
incorrectly suppressed in messages that Mailman sends directly to users.
* The 'adminapproved' metadata key is renamed 'moderator_approved'.
+ * Test case failure due to X-Mailman-Approved-At, patch by blacktav (LP: #890675)
___
Mailman-coders mailing list
Mailman-coders@python.org
http://mail.python.org/mailman/listinfo/mailman-coders
[Mailman-Developers] Add the equivalent of postconf
Referring to this bug, https://bugs.launchpad.net/mailman/+bug/518517 I am planning to implement the command 'mailconf' analogous to 'postconf'. As mentioned in bug description, the idea is to dump all or one variable of the mailman configuration variables. How can i find the configuration variables of mailman to be dumped using this command ? -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org Security Policy: http://wiki.list.org/x/QIA9
Re: [Mailman-Developers] Error while setting up mailman UI
On Fri, Feb 17, 2012 at 11:20 PM, Florian Fuchs f...@state-of-mind.de wrote:
Hi,
On Friday, February 17, 2012 17:13 CET, Aamir Khan syst3m.w...@gmail.com
wrote:
Hi,
I tried to create a virtualEnv in python and start the installation from
scratch. But i a still getting the errors. Screenshot is attached. I also
tried running the tests and many tests failed. One of the dominant error
was,
ImproperlyConfigured: Module mailman_django.context_processors does
not
define a lists_of_domain callable request processor
You can find an up to date (and tested) version of the settings.py in
lp:~flo-fuchs/mailmanweb/django_dev_setup
If you update to the latest version it *should* work now.
Awesome, It worked!!
Thanks a lot!
Cheers
Florian
On Fri, Feb 17, 2012 at 5:48 AM, Florian Fuchs f...@state-of-mind.de
wrote:
Hi,
On Friday, February 17, 2012 00:40 CET, Aamir Khan
syst3m.w...@gmail.com
wrote:
REST_SERVER = 'http://localhost:8001'
I guess that should be,
REST_SERVER = 'http://localhost:8000' because the django app runs
on
8000
port.
Yep, the Django dev server runs on port 8000. But the REST_SERVER
setting
refers to the Mailman API which usually runs on port 8001. Did you try
that, too?
Also, did you start mailman by running 'bin/mailman start' from your
mailman directory?
If that doesn't work, you could try and run the wui tests:
1) stop mailman ('bin/mailman stop' from inside your mailman dir)
2) set MAILMAN_TEST_BINDIR in your settings.py (full path to:
.../mailman/bin)
3) from the folder where the settings.py lives run: 'python manage.py
test'
If the tests run through you know the web ui is setup correctly and can
talk to the mailman REST API.
If they don't the output should give us a hint where the problem might
be...
I hope that helps...
Florian
When, changing it to above line, the URL 'http://localhost:8000'
takes
forever to load but at least no error popped out.
where it probably now says:
REST_SERVER = 'localhost:8001'
(missing url scheme...)
Sorry for not having updated the settings-branch on launchpad
earlier...
:-/
Is this solving the problem?
(If you have any further questions please don't hesitate to
contact me
via
mail or on irc - florianf on freenode.)
Cheers
Florian
On Thursday, February 16, 2012 17:54 CET, Aamir Khan
syst3m.w...@gmail.com wrote:
Hi,
I am getting error while trying to setup mailman UI by following
the
guide
of setting up mailman web UI running[0].
I have attached the screenshot of the same. Any help will be
appreciated.
[0] =
http://wiki.list.org/display/DEV/A+5+minute+guide+to+get+the+Mailman+web+UI+running
--
Aamir Khan | 3rd Year | Computer Science Engineering | IIT
Roorkee
___
Mailman-Developers mailing list
Mailman-Developers@python.org
http://mail.python.org/mailman/listinfo/mailman-developers
Mailman FAQ: http://wiki.list.org/x/AgA3
Searchable Archives:
http://www.mail-archive.com/mailman-developers%40python.org/
Unsubscribe:
http://mail.python.org/mailman/options/mailman-developers/syst3m.w0rm%40gmail.com
Security Policy: http://wiki.list.org/x/QIA9
--
Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee
--
Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee
--
Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee
___
Mailman-Developers mailing list
Mailman-Developers@python.org
http://mail.python.org/mailman/listinfo/mailman-developers
Mailman FAQ: http://wiki.list.org/x/AgA3
Searchable Archives:
http://www.mail-archive.com/mailman-developers%40python.org/
Unsubscribe:
http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org
Security Policy: http://wiki.list.org/x/QIA9
[Mailman-Developers] Probe messages should not sent Precedence header
Hi, As suggested by Barry, I am working on this new bug, 808821https://bugs.launchpad.net/mailman/+bug/808821. As i browsed though the code of mailman, i found that 'src/mailman/bin/disabled.py' is the script which runs to send the messages to all the email addresses disabled may be because of over bouncing, by user himself, by admin, etc.. So, i just have to find out the way, so that bouncing mail won't set the precedence header. Am i on correct path ? -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org Security Policy: http://wiki.list.org/x/QIA9
[Mailman-Developers] Grackle archive framework
Hi, I talked to people on #launchpad-dev, as suggested by barry to investigate about the possibility of using grackle as new archive framework for mailman. The project isn't functional yet. There are two parts, client and back-end service to store the messages. Client will hopefully be completed by end of next week. For backend-service implementation, i am also thinking to get involved during its development. They are planning to have cassandra based store for storing the messages. Any thoughts about which backend service would be ideal to store messages for mailman installations ? -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org Security Policy: http://wiki.list.org/x/QIA9
Re: [Mailman-Developers] Error while setting up mailman UI
On Fri, Feb 17, 2012 at 4:32 AM, Florian Fuchs f...@state-of-mind.de wrote: Hi Aamir, thanks for being interested in MM3 and its web ui! A small change I recently made to the default settings seems to be the cause of the error message: In line 32 of your settings.py it should say: REST_SERVER = 'http://localhost:8001' I guess that should be, REST_SERVER = 'http://localhost:8000' because the django app runs on 8000 port. When, changing it to above line, the URL 'http://localhost:8000' takes forever to load but at least no error popped out. where it probably now says: REST_SERVER = 'localhost:8001' (missing url scheme...) Sorry for not having updated the settings-branch on launchpad earlier... :-/ Is this solving the problem? (If you have any further questions please don't hesitate to contact me via mail or on irc - florianf on freenode.) Cheers Florian On Thursday, February 16, 2012 17:54 CET, Aamir Khan syst3m.w...@gmail.com wrote: Hi, I am getting error while trying to setup mailman UI by following the guide of setting up mailman web UI running[0]. I have attached the screenshot of the same. Any help will be appreciated. [0] = http://wiki.list.org/display/DEV/A+5+minute+guide+to+get+the+Mailman+web+UI+running -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/syst3m.w0rm%40gmail.com Security Policy: http://wiki.list.org/x/QIA9 -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org Security Policy: http://wiki.list.org/x/QIA9
[Mailman-Developers] Hello
Hi all, I am undergraduate student at IIT Roorkee. I am looking forward to contribute to Mailman project. I’ve used Git and SVN before; BZR will be new to me. I’m looking forward to contribute to the project. ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org Security Policy: http://wiki.list.org/x/QIA9
Re: [android-developers] can use ATM cum debit card of State Bank of India (SBI) for registration.
On Sat, Dec 31, 2011 at 2:47 PM, Mohd Arshi Khan arshikha...@gmail.comwrote: I'm student. so i don't have credit card. so it is possible to use ATM cum Debit Card of State Bank of India (SBI) for registration on android Market for publish my App. Not possible to pay via Debit Card. Aamir Khan -- You received this message because you are subscribed to the Google Groups Android Developers group. To post to this group, send email to android-developers@googlegroups.com To unsubscribe from this group, send email to android-developers+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/android-developers?hl=en
Re: [algogeeks] A theoritical question
On Mon, Dec 5, 2011 at 3:31 PM, saurabh singh saurab...@gmail.com wrote: I was wondering can we design a machine(Even hypothetical) that can find a *perfect square root *of any integer thats given to it. My logic why we can't is since there are uncountably infinite real numbers, there will be uncountably infinite numbers requiring infinite states on a turing machine.But since there are only finite number of states,we cant make such a machine.And since we cant make a turing machine for calculating the square root we cant make any computing machine for the same. I am not sure about my logic though.Thats why i have this doubt. Just a thought, If you are saying that there are infinite real numbers then it will require infinite number of states on turing machine. So, the same explanation holds for every arithmetic operation. If you talk about addition then also there are infinite number of numbers so there must be infinite number of states and so not possible to have such a machine according to your argument but we do have such machines. My point is that you are wrong somewhere that since there are infinite real numbers so we must have infinite number of states in turing machine. -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] A theoritical question
On Mon, Dec 5, 2011 at 4:33 PM, saurabh singh saurab...@gmail.com wrote: I said *uncountably infinite.* *Integers are countably infinite.* *A countably infinite set will require finite number of states as we can arrange them in order.* What about addition of real numbers then. Real numbers are uncountably infinite. On Mon, Dec 5, 2011 at 4:26 PM, Aamir Khan ak4u2...@gmail.com wrote: On Mon, Dec 5, 2011 at 3:31 PM, saurabh singh saurab...@gmail.comwrote: I was wondering can we design a machine(Even hypothetical) that can find a *perfect square root *of any integer thats given to it. My logic why we can't is since there are uncountably infinite real numbers, there will be uncountably infinite numbers requiring infinite states on a turing machine.But since there are only finite number of states,we cant make such a machine.And since we cant make a turing machine for calculating the square root we cant make any computing machine for the same. I am not sure about my logic though.Thats why i have this doubt. Just a thought, If you are saying that there are infinite real numbers then it will require infinite number of states on turing machine. So, the same explanation holds for every arithmetic operation. If you talk about addition then also there are infinite number of numbers so there must be infinite number of states and so not possible to have such a machine according to your argument but we do have such machines. My point is that you are wrong somewhere that since there are infinite real numbers so we must have infinite number of states in turing machine. -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] NUMBER OF MST ?
On Sun, Dec 4, 2011 at 12:10 AM, praveen raj praveen0...@gmail.com wrote: N!/2 N!/2 is definitely wrong as you guys are thinking of MST with just two terminal nodes. All the MSTs will be much more than N!/2 because of any number of terminal nodes possible, but i can't find the closed form it. On 03-Dec-2011 11:30 PM, Dipit Grover dipitgro...@gmail.com wrote: ^ we need to count each permutation and its reverse together as one possibility since both would result in identical mst. Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] facebook interview question
Take numbers in pair of 2, compare with each other and then compare the maximum among them with max (maximum element so far) and minimum among them with min (minimum element so far) , In this way you will be able to find max, min in 3 comparisons for each 2 integers. Hence 3n/2 comparisons needed for finding min and max simultaneously in an array. On Mon, Nov 28, 2011 at 9:56 PM, Nitin Garg nitin.garg.i...@gmail.comwrote: Find the min and max in an array. Now do it in less than 2n comparisons. (they were looking for the solution that finds both max and min in about 3/2 n comparisons). -- Nitin Garg Personality can open doors, but only Character can keep them open -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: finding closest points
On Tue, Nov 22, 2011 at 8:43 PM, Dave dave_and_da...@juno.com wrote: @Ganesha: You could use a max-heap of size k in time O(n log k), which is less than O(n log n) if k O(n). We can always ensure that k = n/2. If k = n/2 then the problem can be stated as, find m points farthest from the given point by creating min-heap of size m. The elements which were present in input but not in heap will be the points nearest to the given point, where m = n-k. Dave On Nov 22, 8:56 am, ganesha suresh.iyenga...@gmail.com wrote: Given a set of points in 2D space, how to find the k closest points for a given point, in time better than nlgn. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] An Array Problem
On Tue, Nov 22, 2011 at 11:50 PM, tech coder techcoderonw...@gmail.comwrote: here is an O(n) approach using a stack. problem can be stated as find the 1st smaller element on the right. put the first element in stack. take next element suppose num if this number is less than elements stored in stack, pop those elements , for these pooped elements num will be the required number. put the the element (num) in stack. repeat this. at last the elements which are in next , they will have 0 (valaue) @techcoder : If the numbers are not in sorted order, What benefit the stack would provide ? So, are you storing the numbers in sorted order inside the stack ? I can think of this solution : Maintain a stack in which the elements will be stored in sorted order. Get a new element from array and lets call this number as m. Push m into the stack. Now, find all elements which are = (m-1) using binary search. Pop out all these elements and assign the value m in the output array. Elements remaining at the end will have the value 0. I am not sure about the complexity of this algorithm... On Wed, Nov 23, 2011 at 12:02 AM, Anup Ghatage ghat...@gmail.com wrote: I can't think of a better than O(n^2) solution for this.. Any one got anything better? On Tue, Nov 22, 2011 at 8:23 PM, Ankuj Gupta ankuj2...@gmail.com wrote: Input: A unsorted array of size n. Output: An array of size n. Relationship: elements of input array and output array have 1:1 correspondence. output[i] is equal to the input[j] (ji) which is smaller than input[i] and jth is nearest to ith ( i.e. first element which is smaller). If no such element exists for Input[i] then output[i]=0. Eg. Input: 1 5 7 6 3 16 29 2 7 Output: 0 3 6 3 2 2 2 0 0 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- * Regards* *The Coder* *Life is a Game. The more u play, the more u win, the more u win , the more successfully u play* -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Long nCr Calculations
Lets say i want to calculate (1000C500)%MOD.
*My Code : *
*
*
long long ans=n;
for(int i=1;i=r;i++) {
ans=(ans*(n-i+1))/i;
ans = ans%MOD;
}
But when the ans inside the loop starts exceeding MOD and you take
ans=ans%MOD then you cannot be sure to get the correct answer..
How to deal with this situation ?
--
Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] What Data Structure to use ?
On Sun, Oct 30, 2011 at 1:17 AM, Aamir Khan ak4u2...@gmail.com wrote: In a university, students can enroll in different courses. A student may enroll for more than one course. Both students and courses can be identified by IDs given to them. Design a data structure to store students, courses, and the student-course relationships. You can use arrays, lists, stacks, trees, graphs, etc. or come up with your own data structures. Give the running times, in Big O notation, for the following operations for your data structure and justify the answers: a) Return all students in a list. b) Return all courses in a list. c) Return all courses in a list for a given student. d) Return all students in a list for a given course. Lets bring a little bit complication, What if a students wants to know list of all people who share maximum number of courses with him/her ? Naive approach : First getting all the courses from the hash tables and then for each course traversing its list of students, for each student encountered in this way we can just increase the count. Then all the people having maximum count and print them. Any better approach ? Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] What Data Structure to use ?
In a university, students can enroll in different courses. A student may enroll for more than one course. Both students and courses can be identified by IDs given to them. Design a data structure to store students, courses, and the student-course relationships. You can use arrays, lists, stacks, trees, graphs, etc. or come up with your own data structures. Give the running times, in Big O notation, for the following operations for your data structure and justify the answers: a) Return all students in a list. b) Return all courses in a list. c) Return all courses in a list for a given student. d) Return all students in a list for a given course. Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] [SPOJ] ZSUM
As far as modular arithmetic is concerned,
(x * z *z )%MOD = (x *(z *z)%MOD)%MOD = ((x%MOD)*(z%MOD)*(z%MOD))%MOD
But when you try to calculate *(x * z * z)%MOD*, the intermediate result of* (x
* z * z) *overflows the integer limit and hence gives the wrong result.
similarly, intermediate value of *(x%MOD) * (y%MOD) * (z%MOD)* might also
overflow the integer limit hence you are getting WA.
On Tuesday, October 25, 2011, Kunal Patil wrote:
Can you tell why (x * z * z) % MOD is different from (x * ( (z*z)%MOD) ) %
MOD
Again why ((x%MOD)*(z%MOD)*(z%MOD))%MOD is giving WA
I thought of a simple examples like
(100* 53*72) % 90
-- ((90+10)*53*72) % 90
-- (10*53*72)% 90 which is same as (100%90 * 53%90 * 72%90) % 90
Another example
(100*91*92)%90
-- ( (90+10)*(90+1)*(90+2) ) % 90
-- 10 * 1 * 2 which is again same as (100%90 * 91%90 * 92%90) % 90
Are results different because of range overflow in case of bigger z ???
I'm weak at modular mathematics [?] So please help !!
On Thu, Oct 20, 2011 at 11:48 AM, Wasif Hossain
wasifhossain@gmail.com wrote:
Just a MINOR change.
please change the RED line(I've marked it below) in your code by the
following line:
*return (x*((z*z)%MOD))%MOD;*
and enjoy an *ACCEPTED *verdict.*
*
*Wasif Hossain**
*
B.Sc. Student of Final Semester,
Computer Science and Engineering(CSE),
Bangladesh University of Engineering and Technology(BUET),
Dhaka-1000
Bangladesh.
On Thu, Oct 6, 2011 at 1:13 AM, hashd kirandandupr...@gmail.com wrote:
I'm getting WA on the question :
ZSUM-SPOJhttps://www.spoj.pl/problems/ZSUM/
Here is my code: Let me know if you can find the problem with the code
#includecstdio
#define MOD 1007
typedef unsigned long long u64;
using namespace std;
u64 modExp(u64 x, u64 y){
if(x==0)
return 0;
if(y==0)
return 1;
u64 z = modExp(x,y/2);
if(y%2==0)
return (z*z)%MOD;
else
*return (x*z*z)%MOD;*
}
int main(){
u64 n, k; scanf(%llu%llu,n,k);
while(nk){
u64 ans = 0;
if(n0)
ans = (2*modExp(n-1,k) + modExp(n,k) + 2*modExp(n-1,n-1) +
modExp(n,n))%MOD;
printf(%llu\n,ans);
scanf(%llu%llu,n,k);
}
return 0;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/p6j7nmaEUb4J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
33D.gif
Re: [algogeeks] Re: Modular arithmetic
On Sat, Oct 22, 2011 at 9:04 PM, Mad Coder imamadco...@gmail.com wrote: Can anyone explain why ((n%p)*(m%p))%p will give wrong answer ? Lets say, n = 10^15 , m = 10^15 and p = 10^18 So, n%p = 10^15 m%p = 10^15 And the intermediate result (n%p)*(m%p) will overflow the long long range. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Modular arithmetic
Lets say n,m and p are three long long integers. i want to calculate (n*m)%p. If (n*m) overflows the limit of long long then the answer would be wrong. Moreover if i do ((n%p)*(m%p))%p then also there is no certainty of getting correct answer. How should i do this in C++ ? -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] i cannot solve this written test question
Answer won't be possible in for each N. What would be answer for N=999 ? On Sun, Oct 9, 2011 at 4:22 PM, Ankur Garg ankurga...@gmail.com wrote: Is it sum of bits or sum of digits ? On Sun, Oct 9, 2011 at 1:39 PM, wujin chen wujinchen...@gmail.com wrote: Given a positive number N, find a minimum number M greater than N, M has the same length with N and the sum of the bits are equal. example: N=134 , M=143, // 1+3+4=1+4+3 N=020, M = 101, //2=1+1 the length of N is less than 1000. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Segment Tree Optimization
I am trying to solve http://www.spoj.pl/problems/LITE/ using segment tree.
Here's the code but i am getting TLE. Can somebody help me to optimize the
code ?
#includecstdio
#includealgorithm
struct node{
int l;
int r;
bool el ;
node *left;
node *right;
};
struct node *build(int l, int r) {
struct node *root = new node;
root-l = l;
root-r = r;
root-el = 0;
if(l==r) {
root-left=NULL;
root-right=NULL;
return root;
}
root-left = build(l,(l+r)/2);
root-right= build((l+r)/2+1,r);
return root;
}
int query(struct node *root, int l, int r) {
if(root==NULL || rl)
return 0;
if((root-el) (root-l)=l (root-r)=r) {
return (r - l + 1);
}
int mid = (root-l + root-r)/2;
return query(root-left, l, std::min(mid,r)) + query(root-right,
std::max(mid+1,l), r);
}
void update(struct node *root, int l,int r) {
if(root-l==l root-r==r (root-left==NULL || root-el)) {
root-el = 1 - root-el;
return;
}
if(root-el) {
root-left-el = 1;
root-right-el = 1;
root-el = 0;
}
int mid = (root-l + root-r)/2;
if(l = mid)
update(root-left, l, std::min(mid,r));
if(r mid)
update(root-right, std::max(mid+1,l), r);
}
int main() {
int N, M;
scanf(%d %d,N,M);
struct node *root = build(1,N);
int L,R;
int c;
while(M--) {
scanf(%d %d %d\n,c,L,R);
if(c==0)
update(root, L, R);
else
printf(%d\n,query(root,L,R));
}
return 0;
}
Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Segment Tree Optimization
On Tue, Sep 27, 2011 at 1:27 PM, sunny agrawal sunny816.i...@gmail.comwrote: implement segment tree with lazy propagation :) What do you mean by lazy propagation ? -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Amazon online test
@shiv : Correct Answer should be : 5C3 X 5 X 4 X3 = 600 Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [Mailman-Developers] MailMan Usage
I have tried Fetchmail to fetch the mail and Procmail to process the mail and then invoke custom python script to do my job. This is working fine, the only problem i think it has is fetchmail has to check the mailbox in every 10 seconds and deliver it to procmail...if somehow i can reduce the time or make something like whenever a mail is arrived at may mail it is delivered directly to procmail then it would be really helpful.. On Mon, Jun 27, 2011 at 12:21 PM, Barry Warsaw ba...@list.org wrote: On Jun 26, 2011, at 01:04 PM, Mark Sapiro wrote: On 6/26/2011 4:55 AM, Aamir Khan wrote: I would like to dedicate a email lets say h...@example.com where you can send emails and depending upon the Text written inside the Mail..(doing some Regexp matching)...I have to call different actions like retrieving data from DB and then answering the query etc... So i would like to know whether Mailman is suitable for my problem to be solved...if not, can you suggest me the open source solution that can fulfill my need. I don't think Mailman is suitable for this. I'm not aware offhand of any off-the-shelf open source solution. Aamir sent me private email. I mentioned that I thought Mailman could do this if you wrote some custom Python. I agree it's not a great fit for what he wants to do, but thought this would be the place to contact if he wanted help in writing that custom stuff. -Barry ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/ak4u2009%40gmail.com Security Policy: http://wiki.list.org/x/QIA9 -- Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aamir...@iitr.ernet.in ak4u2...@gmail.com ___ Mailman-Developers mailing list Mailman-Developers@python.org http://mail.python.org/mailman/listinfo/mailman-developers Mailman FAQ: http://wiki.list.org/x/AgA3 Searchable Archives: http://www.mail-archive.com/mailman-developers%40python.org/ Unsubscribe: http://mail.python.org/mailman/options/mailman-developers/archive%40jab.org Security Policy: http://wiki.list.org/x/QIA9
[LUG@IITD:14155] Help in Web Development
I have a website with some pages and simple login mechanism.some of the pages are private and some of them are public...If user wants to access private page, i want the user directed to login page with some additional parameters using which after logging of the user will proceed to the page he requested first...i mean i don't want to show the home page after user logged in but the page user requested first while he was not logged in.. To make it simple...if you give some message address of your gmail and you are not logged in then it redirects you to login page but after you log in it servers the page (message in this case) rather than showing you your inbox. In many professional websites the behavior i explained is pretty much common and i want to know the best way to implement it. -- Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aamir...@iitr.ernet.in ak4u2...@gmail.com -- Mailing list guidelines and other related articles: http://lug-iitd.org/Footer
[Owncloud] Re: Help for the website
I think we should set up a full fledged demo server website to show the working and features of ownCloud. On Sun, Jun 5, 2011 at 7:24 PM, Michael Gapczynski gapczyns...@gmail.comwrote: The KDE Userbase doesn't have a page about ownCloud yet. Maybe this would be a good spot to start. Michael Gapczynski On Sun, Jun 5, 2011 at 8:18 AM, Damien Tardy-Panis damientardypa...@gmail.com wrote: Hey, anybody here ? I have time to help. I really want to promote ownCloud and first I'd like to help about the website. I'll maybe also do some coding after. Please, tell me how to help you about the website. Looking forward to some answers. Cheers, Damien On Tuesday 31 May 2011 01:27:43 Damien Tardy-Panis wrote: Hi everybody, I'm Damien. I have been part of the KDE promo team for several months now and I was considering to help you guys too. I have been looking at the project from the beginning and now that Google just released their ChromeOS, I told me OK we should absolutely do something :-S I saw very recently on the mailing that Jan-Christoph was planning to start a real website for ownCloud. Can I help you with that ? Did you already start something ? Cheers, Damien ___ Owncloud mailing list Owncloud@kde.org https://mail.kde.org/mailman/listinfo/owncloud ___ Owncloud mailing list Owncloud@kde.org https://mail.kde.org/mailman/listinfo/owncloud -- Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aamir...@iitr.ernet.in ak4u2...@gmail.com ___ Owncloud mailing list Owncloud@kde.org https://mail.kde.org/mailman/listinfo/owncloud
[Owncloud] Fwd: Glip GIT DIFF
-- Forwarded message -- From: Patrik Fimml pat...@fimml.at Date: Thu, May 26, 2011 at 2:32 AM Subject: Re: Glip GIT DIFF To: Aamir Khan ak4u2...@gmail.com Hey! On Wed, May 25, 2011 at 07:52:43PM +0530, Aamir Khan wrote: I am using GLIP to implement server-server syncing functionality in owncloud as my project. Basically i wanted to use something like git diff but i think this functionality is not implemented in glip. So if you can provide me with some pointers how i can achieve git diff using glip then it would be great. Currently, glip has no facilities to do so, except for GitTree::treeDiff which is somethat like git log --stat. If not possible,then i would love to contribute to glip as well to enhance its functionality and implement git diff. Implementing it in PHP will likely be rather slow (glip is too, of course). You might have a look at how MediaWiki does it, I think they have support for some module(s) in there. Regards, Patrik -- Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aami...@iitr.ernet.in aamir...@iitr.ernet.in ak4u2...@gmail.com ___ Owncloud mailing list Owncloud@kde.org https://mail.kde.org/mailman/listinfo/owncloud
Re: [algogeeks] Re: Run for a google years
double n will overflow...
On 5/13/11, bittu shashank7andr...@gmail.com wrote:
@Dave... I think 1 Googol Year is =10^100 not 10^116.5 ?? why u have
used
so then we have to write the single line program that googol years of
time ?? we have processor that can execute the instruction in 10^9
per second so the time required by googol year in second
which is equals to time t=pow(10,109)*365*86400 sec.
so program is like
#include stdio.h
#include math.h
int main() {
double n = pow(10, 109) * 365 * 86400;
while(n--);
}
Correct me if anything wrong???
Thanks Regards
Shashank ManiThe Best Way To Escape From The problem is Solve It
Computer Science Engg.
BIT Mesra
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Aamir Khan
Indian Institute of Technology Roorkee,
Roorkee, Uttarakhand,
India , 247667
Phone: +91 9557647357
email: aami...@iitr.ernet.in aamir...@iitr.ernet.in
ak4u2...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Run for a google years
On Mon, May 9, 2011 at 8:31 PM, Don dondod...@gmail.com wrote:
That would do it if you have a 64-bit type, which most implementations
have, but the standard does not require.
I think that I can make it shorter and cleaner.
int main(int argc, char* argv[])
{
const int n=49;
char a[n]={0};
int p=0;
// This line will run for 10^100 years
for(; p n; p = ++a[p] ? 0 : p + 1);
return 0;
}
The array of 49 bytes provides 392 bits of state, which will take more
than the 2^387 cycles available in a google years.
If the processor takes 9 operations to execute the loop, a value of
n=48 would be sufficient.
Can you elaborate the 9 operations that execution of for loop will take.
Don
On May 7, 12:24 pm, Dave dave_and_da...@juno.com wrote:
@Don: Here is my solution:
unsigned long long int a=1;
unsigned long long int b=0;
unsigned long long int c=0;
unsigned long long int d=0;
unsigned long long int e=0;
unsigned long long int f=0;
unsigned long long int g=0;
unsigned long long int h=0;
/* here is the line /
while(a)if(!++h)if(!++g)if(!++f)if(!++e)if(!++d)if(!++c)if(!++b)++a;
My reasoning is as follows: 1 google years ~= 10^116.5 nanoseconds ~=
2^387. Thus, incrementing an integer of length 387 bits once every
nanosecond should take a google years to overflow. Seven 64-bit
integers provides 448 bits of state.
Dave
On May 6, 11:25 am, Don dondod...@gmail.com wrote:
What is the shortest single line in a C program which will take more
than a google years to execute, but will eventually complete? You are
permitted to have code before or after the line, but execution of the
code must remain on that line, meaning no function calls, etc. Assume
a processor which executes 1 billion operations a second.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Aamir Khan
Indian Institute of Technology Roorkee,
Roorkee, Uttarakhand,
India , 247667
Phone: +91 9557647357
email: aami...@iitr.ernet.in aamir...@iitr.ernet.in
ak4u2...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Run for a google years
On Mon, May 9, 2011 at 8:31 PM, Don dondod...@gmail.com wrote:
That would do it if you have a 64-bit type, which most implementations
have, but the standard does not require.
I think that I can make it shorter and cleaner.
int main(int argc, char* argv[])
{
const int n=49;
char a[n]={0};
I think we can use a single character like char a=0; instead of array of
characters as ultimately the value is incremented for a[0] only in your
code.
And i was testing with smaller values of n=1 and found something strange
like the value of a[p] increases from 0 to 127 (thats normal) but after
adding 1 to 127 it shows -128..I know that char is of 1byte or 8 bits only
and after +127 its value will overflow.
I have question regarding the same:
1) How to calculate the next value in case of overflow. As i tried
calculating by binary addition and 0111 + 1 = 1000 thats means
answer should have been -0 or 0.
int p=0;
// This line will run for 10^100 years
for(; p n; p = ++a[p] ? 0 : p + 1);
return 0;
}
The array of 49 bytes provides 392 bits of state, which will take more
than the 2^387 cycles available in a google years.
If the processor takes 9 operations to execute the loop, a value of
n=48 would be sufficient.
Don
On May 7, 12:24 pm, Dave dave_and_da...@juno.com wrote:
@Don: Here is my solution:
unsigned long long int a=1;
unsigned long long int b=0;
unsigned long long int c=0;
unsigned long long int d=0;
unsigned long long int e=0;
unsigned long long int f=0;
unsigned long long int g=0;
unsigned long long int h=0;
/* here is the line /
while(a)if(!++h)if(!++g)if(!++f)if(!++e)if(!++d)if(!++c)if(!++b)++a;
My reasoning is as follows: 1 google years ~= 10^116.5 nanoseconds ~=
2^387. Thus, incrementing an integer of length 387 bits once every
nanosecond should take a google years to overflow. Seven 64-bit
integers provides 448 bits of state.
Dave
On May 6, 11:25 am, Don dondod...@gmail.com wrote:
What is the shortest single line in a C program which will take more
than a google years to execute, but will eventually complete? You are
permitted to have code before or after the line, but execution of the
code must remain on that line, meaning no function calls, etc. Assume
a processor which executes 1 billion operations a second.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Aamir Khan
Indian Institute of Technology Roorkee,
Roorkee, Uttarakhand,
India , 247667
Phone: +91 9557647357
email: aami...@iitr.ernet.in aamir...@iitr.ernet.in
ak4u2...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Extract Top K elements from a List of N elements based on frequency
On Mon, May 9, 2011 at 11:44 AM, Ashish Goel ashg...@gmail.com wrote: Dave, w.r.t statement, After all integers are processed, compress out the unused hash table entries and find the Kth largest element, I could not understand the compress concept...are you saying something on counting sort philosophy? say the list is 5 4 4 3 3 3 2 2 2 2 1 1 1 1 1 so the hash map will have 5,1 5 is 1 time 4,2,4 is two time 3,3,... 2,4,... 1,5... so if the question is to find say 3rd largest element based on frequency, it would be 4 3rd largest element based on frequency should be 3 i think? This essentially means that we probably need dynamic order statistics where the node contains the starting rank for a particular entry in the RBTree. Each RBTree node contains the number, its frequency and rank. then this becomes O(n) +O(lgn) i.e. O(n) Best Regards Ashish Goel Think positive and find fuel in failure +919985813081 +919966006652 On Sat, May 7, 2011 at 11:03 PM, Dave dave_and_da...@juno.com wrote: @Gaurav: As I understand your solution, you are finding the K largest integers based on value, rather than the K with the highest frequency of occurrence. @Amit: Hash the integers into a hash table that includes a field for the frequency count. When a new entry is made, set the frequency count to 1. When an integer already is in the table, increment its count. After all integers are processed, compress out the unused hash table entries and find the Kth largest element. The overall algorithm can be done in O(n). Dave On May 7, 12:06 pm, Gaurav Aggarwal 0007gau...@gmail.com wrote: It can be done without sorting. Take the first element as pivot element. Calculate its position using Partition algorithm. If its new index is K, then on left side are top K integers. If indexK, apply algo on left side Else apply algo on right side. Best Case: O(1) Worst Case: O(n^2) But there are very less chances of worst case. It is when the list is already sorted. On Thu, May 5, 2011 at 1:06 AM, amit amitjaspal...@gmail.com wrote: Hi , We are give a list of integers now our task is to find the top K integers in the list based on frequency. Apart from sorting the data can there be any other algorithm? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Gaurav Aggarwal SCJP- Hide quoted text - - Show quoted text - -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aami...@iitr.ernet.in aamir...@iitr.ernet.in ak4u2...@gmail.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[Owncloud] Summer of KDE 2011
Hi All! I would like to participate in Summer of KDE 2011. The project which i would like to work on is Server-Server Syncing + Sync Protocol to determine which files are to be transferred.I have talked with Robin Appelman and he said that he would search for mentor for this project and he is convinced that project is good enough for this summer. So, if anybody have available time during summer then please come forward to mentor me. I am having my university exams from tomorrow so may be my replies to mail can be a bit late. -- Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aami...@iitr.ernet.in aamir...@iitr.ernet.in ak4u2...@gmail.com ___ Owncloud mailing list Owncloud@kde.org https://mail.kde.org/mailman/listinfo/owncloud
[Owncloud] KDE Season 2011
Hi All, I would like to get involved with OwnCloud during this summer under KDE Season 2011.Could anybody suggest me a project to work on? I would be happy if anybody could step forward to mentor me in the project as well. -- Thanks, Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aami...@iitr.ernet.in aamir...@iitr.ernet.in ak4u2...@gmail.com ___ Owncloud mailing list Owncloud@kde.org https://mail.kde.org/mailman/listinfo/owncloud
Re: Anybody willing to mentor for GSoC
I got no reply from you Norman! -- Aamir Khan Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India , 247667 Phone: +91 9557647357 email: aami...@iitr.ernet.in nikgp...@iitr.ernet.in ak4u2...@gmail.com nikhilg.8...@gmail.com
Re: Anybody willing to mentor for GSoC
On Sat, Apr 16, 2011 at 12:41 AM, Norman Maurer nor...@apache.org wrote: Hi Aamir, let me think about if I have enough time. I will come back to you tommorrow.. Thanks Norman. I was loosing hope otherwise. Thanks, Norman 2011/4/15 AAMIR KHAN ak4u2...@gmail.com: Anybody else? On Fri, Apr 15, 2011 at 3:37 AM, Robert Burrell Donkin robertburrelldon...@gmail.com wrote: On Thu, Apr 14, 2011 at 1:25 PM, AAMIR KHAN ak4u2...@gmail.com wrote: Hi Aamir As i talked with Eric who earlier wanted to co-mentor me, He asked me to find a new mentor because he is much busy with other projects. So, I am asking over mailing list if anybody else is willing to mentor me My computer time is very limited ATM so I'm not really able to co-mentor any more projects that I've already committed to. Sorry :-/ (It's really important with GSOC to apply in plenty of time) Robert - To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org For additional commands, e-mail: server-dev-h...@james.apache.org - To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org For additional commands, e-mail: server-dev-h...@james.apache.org
Re: Jenkins build became unstable: mailbox-integration-tests » Apache James Mailbox Integration Tester #263
Is it due to the recently reported JIRA ticket : https://issues.apache.org/jira/browse/MAILBOX-52 On Thu, Apr 14, 2011 at 5:06 PM, Apache Hudson Server hud...@hudson.apache.org wrote: See https://hudson.apache.org/hudson/job/mailbox-integration-tests/org.apache.james$apache-james-mailbox-integration-tester/263/ - To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org For additional commands, e-mail: server-dev-h...@james.apache.org
Anybody willing to mentor for GSoC
As i talked with Eric who earlier wanted to co-mentor me, He asked me to find a new mentor because he is much busy with other projects. So, I am asking over mailing list if anybody else is willing to mentor me *Modified proposal for project :* * * * Proposal Title: Design and Implement Mailbox with CouchDB storage.https://issues.apache.org/jira/browse/MAILBOX-45 Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: Since most of the mail contents are semi-structured in nature.CouchDB is non-relational, semi-structured database having great potential for mail storage. Main beneficial characteristics include consistency,simple APIs and high scalability. My project is to design and implement mail storage in James Mailbox using CouchDB on the same level as JPA(Java Persistence API) and JCR(Java Content Repository) to serve as drop-in replacement for SQL storage. RESTful integration API http://wiki.apache.org/couchdb/HTTP_Document_APIfor Retrieving and Deleting mails will also be done. The APIs should be designed so as to offer abstraction of mail storage from RESTful APIs. The Project is to be implemented in following phases : 1) Design of RESTful integration APIhttp://wiki.apache.org/couchdb/HTTP_Document_APIand implementation for as many targets as i can 2) Implementation of CouchDB using Java impl 3) Development of RESTful integration API. As suggested by Norman i think this project could be very helpful in development process. http://code.google.com/p/ektorp/ Detailed Description: Why? Lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Then various RESTful APIs can be used to access mail storage. e.g.) GET /database_name/mail_id HTTP/1.0 POST /database_name/ HTTP/1.0 DELETE /database_name/mail_id?revid=current_version HTTP/1.0 Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Design : 1 week 2) Programming : 7 Weeks 3) Review and Testing : 1 week 4) Bug Fixing Time : 1 week 5) Documentation : 1 week 6) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule I tried for exploring JPA source : jpa/src/main/java/org/apache/james/mailbox/jpa https://svn.apache.org/repos/asf/james/mailbox/trunk/jpa/src/main/java/org/apache/james/mailbox/jpa/and found that already existing APIs include : deleteEverything,MailboxMembership,createMailboxMapper,createMessageMapper and other session handling handling functions. So,I think APIs to be built should include Session Handling features,Creation and deletion of Mailboxes,Retrieving and deletion of mails from Mailbox,Attachment features,Caching of messages etc. April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Discuss the design for implementation of CouchDB after discussion with whole community. -Discuss the implementation procedure of MailBox Creation,Deletion and SessionManager class. May 24 - May 31 : Finalise the design for implementation of CouchDB after discussion with whole community. June 1 - 20 June : Implement the finalised plan for Couch DB. This would be done by implementing Java impl classes for Couch DB. June 21 - June 25 : Test and debug implementation of Couch DB with regressive test. June 26 - July 30 : -Implement RESTful integration API for Retrieving mail. This should be performed using GET operation at the document’s URL. -This will implement : GET /database_name/mail_id HTTP/1.0http://wiki.apache.org/couchdb/HTTP_Document_API#GET. Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Retrieving mail API. -Implement RESTful integration API for Deleting mail. This should be done using DELETE operation of HTTP_Document_API. -This will implement : DELETE /database_name/mail_id?revid=current_version HTTP/1.0 http://wiki.apache.org/couchdb/HTTP_Document_API#DELETE . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation
Re: Anybody willing to mentor for GSoC
This is modified proposal and i want to edit my original proposal over google-melange site if mentor permits me to do so. On Thu, Apr 14, 2011 at 5:55 PM, AAMIR KHAN ak4u2...@gmail.com wrote: As i talked with Eric who earlier wanted to co-mentor me, He asked me to find a new mentor because he is much busy with other projects. So, I am asking over mailing list if anybody else is willing to mentor me *Modified proposal for project :* * * * Proposal Title: Design and Implement Mailbox with CouchDB storage.https://issues.apache.org/jira/browse/MAILBOX-45 Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: Since most of the mail contents are semi-structured in nature.CouchDB is non-relational, semi-structured database having great potential for mail storage. Main beneficial characteristics include consistency,simple APIs and high scalability. My project is to design and implement mail storage in James Mailbox using CouchDB on the same level as JPA(Java Persistence API) and JCR(Java Content Repository) to serve as drop-in replacement for SQL storage. RESTful integration API http://wiki.apache.org/couchdb/HTTP_Document_APIfor Retrieving and Deleting mails will also be done. The APIs should be designed so as to offer abstraction of mail storage from RESTful APIs. The Project is to be implemented in following phases : 1) Design of RESTful integration APIhttp://wiki.apache.org/couchdb/HTTP_Document_APIand implementation for as many targets as i can 2) Implementation of CouchDB using Java impl 3) Development of RESTful integration API. As suggested by Norman i think this project could be very helpful in development process. http://code.google.com/p/ektorp/ Detailed Description: Why? Lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Then various RESTful APIs can be used to access mail storage. e.g.) GET /database_name/mail_id HTTP/1.0 POST /database_name/ HTTP/1.0 DELETE /database_name/mail_id?revid=current_version HTTP/1.0 Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Design : 1 week 2) Programming : 7 Weeks 3) Review and Testing : 1 week 4) Bug Fixing Time : 1 week 5) Documentation : 1 week 6) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule I tried for exploring JPA source : jpa/src/main/java/org/apache/james/mailbox/jpa https://svn.apache.org/repos/asf/james/mailbox/trunk/jpa/src/main/java/org/apache/james/mailbox/jpa/and found that already existing APIs include : deleteEverything,MailboxMembership,createMailboxMapper,createMessageMapper and other session handling handling functions. So,I think APIs to be built should include Session Handling features,Creation and deletion of Mailboxes,Retrieving and deletion of mails from Mailbox,Attachment features,Caching of messages etc. April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Discuss the design for implementation of CouchDB after discussion with whole community. -Discuss the implementation procedure of MailBox Creation,Deletion and SessionManager class. May 24 - May 31 : Finalise the design for implementation of CouchDB after discussion with whole community. June 1 - 20 June : Implement the finalised plan for Couch DB. This would be done by implementing Java impl classes for Couch DB. June 21 - June 25 : Test and debug implementation of Couch DB with regressive test. June 26 - July 30 : -Implement RESTful integration API for Retrieving mail. This should be performed using GET operation at the document’s URL. -This will implement : GET /database_name/mail_id HTTP/1.0http://wiki.apache.org/couchdb/HTTP_Document_API#GET. Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Retrieving mail API. -Implement RESTful integration API for Deleting mail. This should
Re: Anybody willing to mentor for GSoC
Anybody else? On Fri, Apr 15, 2011 at 3:37 AM, Robert Burrell Donkin robertburrelldon...@gmail.com wrote: On Thu, Apr 14, 2011 at 1:25 PM, AAMIR KHAN ak4u2...@gmail.com wrote: Hi Aamir As i talked with Eric who earlier wanted to co-mentor me, He asked me to find a new mentor because he is much busy with other projects. So, I am asking over mailing list if anybody else is willing to mentor me My computer time is very limited ATM so I'm not really able to co-mentor any more projects that I've already committed to. Sorry :-/ (It's really important with GSOC to apply in plenty of time) Robert - To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org For additional commands, e-mail: server-dev-h...@james.apache.org
[algogeeks] Square of Large integer
#includecstdio
#define MOD (int)1e9
using namespace std;
int main() {
int A = 33554432;
printf(%d\n,A*A);
printf(%d\n,((A*A)%MOD));
return 0;
}
How can i calculate, lets say last 9 digits of square of 33554432 ?
Thanks,
Aamir
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Square of Large integer
*Output:*
0
0
On Thu, Apr 14, 2011 at 7:01 PM, AAMIR KHAN ak4u2...@gmail.com wrote:
#includecstdio
#define MOD (int)1e9
using namespace std;
int main() {
int A = 33554432;
printf(%d\n,A*A);
printf(%d\n,((A*A)%MOD));
return 0;
}
How can i calculate, lets say last 9 digits of square of 33554432 ?
Thanks,
Aamir
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Square of Large integer
On Thu, Apr 14, 2011 at 7:40 PM, Akash Mukherjee akash...@gmail.com wrote:
search nd read chinese remainder theorem
please elaborate how can i use chinese remainder theorem.
On Thu, Apr 14, 2011 at 7:04 PM, AAMIR KHAN ak4u2...@gmail.com wrote:
*Output:*
0
0
On Thu, Apr 14, 2011 at 7:01 PM, AAMIR KHAN ak4u2...@gmail.com wrote:
#includecstdio
#define MOD (int)1e9
using namespace std;
int main() {
int A = 33554432;
printf(%d\n,A*A);
printf(%d\n,((A*A)%MOD));
return 0;
}
How can i calculate, lets say last 9 digits of square of 33554432 ?
Thanks,
Aamir
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Square of Large integer
On Thu, Apr 14, 2011 at 9:08 PM, Dave dave_and_da...@juno.com wrote:
@AAmir: The easiest way is to declare A as long long int. Be sure to
change the printf format string.
I know that. But since i want to have only the last 9 digits of the answer
that can be accommodated in int only so there is no need for long long i
think.
Dave
On Apr 14, 8:31 am, AAMIR KHAN ak4u2...@gmail.com wrote:
#includecstdio
#define MOD (int)1e9
using namespace std;
int main() {
int A = 33554432;
printf(%d\n,A*A);
printf(%d\n,((A*A)%MOD));
return 0;
}
How can i calculate, lets say last 9 digits of square of 33554432 ?
Thanks,
Aamir
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: Design and Implement Mailbox in James using NoSQL databases
Proposal Title: Design and Implement Mailbox with CouchDB storage.https://issues.apache.org/jira/browse/MAILBOX-45 Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: Since most of the mail contents are semi-structured in nature.CouchDB is non-relational, semi-structured database having great potential for mail storage. Main beneficial characteristics include consistency,simple APIs and high scalability. My project is to design and implement mail storage in James Mailbox using CouchDB on the same level as JPA(Java Persistence API) and JCR(Java Content Repository). RESTful integration API http://wiki.apache.org/couchdb/HTTP_Document_APIfor Retrieving,Sending and Deleting mails will also be done. The APIs should be designed so as to offer abstraction of mail storage from RESTful APIs. The Project is to be implemented in two phases (layers) : 1) Implementation of CouchDB using Java impl 2) Design of RESTful integration APIhttp://wiki.apache.org/couchdb/HTTP_Document_APIand implementation for as many targets as i can As suggested by Norman i think this project could be very helpful in development process. http://code.google.com/p/ektorp/ Detailed Description: Why? Lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Then various RESTful APIs can be used to access mail storage. e.g.) GET /database_name/mail_id HTTP/1.0 POST /database_name/ HTTP/1.0 DELETE /database_name/mail_id?revid=current_version HTTP/1.0 Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Design : 1 week 2) Programming : 7 Weeks 3) Review and Testing : 1 week 4) Bug Fixing Time : 1 week 5) Documentation : 1 week 6) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Discuss the design for implementation of CouchDB after discussion with whole community. May 24 - May 31 : Finalise the design for implementation of CouchDB after discussion with whole community. June 1 - 20 June : Implement the finalised plan for Couch DB. This would be done by implementing Java impl classes for Couch DB. June 21 - June 28 : Test and debug implementation of Couch DB with regressive test. July 1 - July 10 : -Implement RESTful integration API for Retrieving mail. This should be performed using GET operation at the document’s URL. -This will implement : GET /database_name/mail_id HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Retrieving mail API. July 11 - July 20 : -Implement RESTful integration API for Sending mail. This should be done using POST operation of HTTP_Document_API. -This will implement : POST /database_name/ HTTP/1.0 . -Test and debug implementation of Sending mail API. July 21 - July 30 : -Implement RESTful integration API for Deleting mail. This should be done using DELETE operation of HTTP_Document_API. -This will implement : DELETE /database_name/mail_id?revid=current_version HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Deleting mail API. The time line specified above is somewhat adjustable. If i can complete the above mentioned integrations before time, I would proceed with the following API’s integration in order: -Inline Attachments -Multiple Attachments -Stand Alone Attachments -ETags/Caching August 1-August 15 (Buffer Time): Second phase of testing: Testing of debugged code. August 15-August 22: -Work on Documentation. -Finally discuss the project with mentors. -Debugging the bugs (if any reported by Mentor) -Improve the Documentation, Release. August 22 - August 26 : -Final Evaluation Submission Available Time I am committed to giving at least 40-50 hours per week to GSOC. Since I am not doing anything this summer, I believe that the time devoted to GSOC will be much more than that, for sure. I have
Maven Tests Failed in mailbox-integration-tester
I tried cloning with svn checkout https://svn.apache.org/repos/asf/james/mailbox-integration-tester/ . And then changes directory to mailbox-integration-tester. tried mvn tests and it fails. *Stacktrace :* aamir@aamir-laptop:/media/Workspace/mailbox-integration-tester$ mvn test [INFO] Scanning for projects... [INFO] [ERROR] FATAL ERROR [INFO] [INFO] Error building POM (may not be this project's POM). Project ID: org.apache.james:apache-james-mailbox-integration-tester:jar:null Reason: Cannot find parent: org.apache.james:apache-james-mailbox for project: org.apache.james:apache-james-mailbox-integration-tester:jar:null for project org.apache.james:apache-james-mailbox-integration-tester:jar:null [INFO] [INFO] Trace org.apache.maven.reactor.MavenExecutionException: Cannot find parent: org.apache.james:apache-james-mailbox for project: org.apache.james:apache-james-mailbox-integration-tester:jar:null for project org.apache.james:apache-james-mailbox-integration-tester:jar:null at org.apache.maven.DefaultMaven.getProjects(DefaultMaven.java:404) at org.apache.maven.DefaultMaven.doExecute(DefaultMaven.java:272) at org.apache.maven.DefaultMaven.execute(DefaultMaven.java:138) at org.apache.maven.cli.MavenCli.main(MavenCli.java:362) at org.apache.maven.cli.compat.CompatibleMain.main(CompatibleMain.java:60) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:57) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:616) at org.codehaus.classworlds.Launcher.launchEnhanced(Launcher.java:315) at org.codehaus.classworlds.Launcher.launch(Launcher.java:255) at org.codehaus.classworlds.Launcher.mainWithExitCode(Launcher.java:430) at org.codehaus.classworlds.Launcher.main(Launcher.java:375) Caused by: org.apache.maven.project.ProjectBuildingException: Cannot find parent: org.apache.james:apache-james-mailbox for project: org.apache.james:apache-james-mailbox-integration-tester:jar:null for project org.apache.james:apache-james-mailbox-integration-tester:jar:null at org.apache.maven.project.DefaultMavenProjectBuilder.assembleLineage(DefaultMavenProjectBuilder.java:1396) at org.apache.maven.project.DefaultMavenProjectBuilder.buildInternal(DefaultMavenProjectBuilder.java:823) at org.apache.maven.project.DefaultMavenProjectBuilder.buildFromSourceFileInternal(DefaultMavenProjectBuilder.java:508) at org.apache.maven.project.DefaultMavenProjectBuilder.build(DefaultMavenProjectBuilder.java:200) at org.apache.maven.DefaultMaven.getProject(DefaultMaven.java:604) at org.apache.maven.DefaultMaven.collectProjects(DefaultMaven.java:487) at org.apache.maven.DefaultMaven.getProjects(DefaultMaven.java:391) ... 12 more Caused by: org.apache.maven.project.ProjectBuildingException: POM 'org.apache.james:apache-james-mailbox' not found in repository: Unable to download the artifact from any repository org.apache.james:apache-james-mailbox:pom:0.2-M2-SNAPSHOT from the specified remote repositories: central (http://repo1.maven.org/maven2) for project org.apache.james:apache-james-mailbox at org.apache.maven.project.DefaultMavenProjectBuilder.findModelFromRepository(DefaultMavenProjectBuilder.java:605) at org.apache.maven.project.DefaultMavenProjectBuilder.assembleLineage(DefaultMavenProjectBuilder.java:1392) ... 18 more Caused by: org.apache.maven.artifact.resolver.ArtifactNotFoundException: Unable to download the artifact from any repository org.apache.james:apache-james-mailbox:pom:0.2-M2-SNAPSHOT from the specified remote repositories: central (http://repo1.maven.org/maven2) at org.apache.maven.artifact.resolver.DefaultArtifactResolver.resolve(DefaultArtifactResolver.java:228) at org.apache.maven.artifact.resolver.DefaultArtifactResolver.resolve(DefaultArtifactResolver.java:90) at org.apache.maven.project.DefaultMavenProjectBuilder.findModelFromRepository(DefaultMavenProjectBuilder.java:558) ... 19 more Caused by: org.apache.maven.wagon.ResourceDoesNotExistException: Unable to download the artifact from any repository at org.apache.maven.artifact.manager.DefaultWagonManager.getArtifact(DefaultWagonManager.java:404) at org.apache.maven.artifact.resolver.DefaultArtifactResolver.resolve(DefaultArtifactResolver.java:216) ... 21 more [INFO] [INFO] Total time: 1 second [INFO] Finished at: Wed Apr 13 19:31:07 IST 2011 [INFO] Final Memory: 1M/45M [INFO]
Re: Design and Implement Mailbox in James using NoSQL databases
Hi Eric, I would like to have your comments over my proposal. On Sat, Apr 9, 2011 at 10:00 AM, Eric Charles e...@apache.org wrote: Hi Aamir, The error message came probably from google closing the applications. http://twitter.com/#!/gsoc/status/56431319927889921 I now have access again to your application an have request mentorship. Good luck :) - Eric On 8/04/2011 20:56, AAMIR KHAN wrote: the proposal i sent to google-melange is the same as posted over mailing list. Maybe you can comment it over here. On Sat, Apr 9, 2011 at 12:15 AM, Eric Charlese...@apache.org wrote: Hi Aamir, That's good. Once I will get access to your application on google melange, I will ask for mentorship. Tks, Eric On 8/04/2011 19:42, AAMIR KHAN wrote: Revised Proposal : Proposal Title: Design and Implement Mailbox with CouchDB mail storage. Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: Since most of the mail contents are semi-structured in nature.CouchDB is non-relational, semi-structured database having great potential for mail storage. My project is to design and implement mail storage in James Mailbox using CouchDB. RESTful integration API for Retrieving,Sending and Deleting mails will also be done. Detailed Description: Why? lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Design : 1 week 2) Programming : 7 Weeks 3) Review and Testing : 1 week 4) Bug Fixing Time : 1 week 5) Documentation : 1 week 6) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Discuss the design for implementation of CouchDB after discussion with whole community. May 24 - May 31 : Finalise the design for implementation of CouchDB after discussion with whole community. June 1 - 20 June : Implement the finalised plan for Couch DB. June 21 - June 28 : Test and debug implementation of CouchDB with regressive test. July 1 - July 10 : -Implement RESTful integration API for Retrieving mail. This should be performed using GET operation at the document’s URL. -This will implement : GET /database_name/mail_id HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Retrieving mail API. July 11 - July 20 : -Implement RESTful integration API for Sending mail. This should be done using POST operation of HTTP_Document_API. -This will implement : POST /database_name/ HTTP/1.0 . -Test and debug implementation of Sending mail API. July 21 - July 30 : -Implement RESTful integration API for Deleting mail. This should be done using DELETE operation of HTTP_Document_API. -This will implement : DELETE /database_name/mail_id?revid=current_version HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Deleting mail API. The time line specified above is somewhat adjustable. If i can comeplete the above mentioned integrations before time, I would proceed with the following API’s integration in order: -Inline Attachments -Multiple Attachments -Stand Alone Attachments -ETags/Caching August 1-August 15 (Buffer Time): Second phase of testing: Testing of debugged code. August 15-August 22: -Work on Documentation. -Finally discuss the project with mentors. -Debugging the bugs (if any reported by Mentor) -Improve the Documentation, Release. August 22 - August 26 : -Final Evaluation Submission Available Time I am committed to giving at least 40-50 hours per week to GSOC. Since I am not doing anything this summer, I believe that the time devoted to GSOC will be much more than that, for sure. I have excellent work ethics, and a goal oriented guy. Additional Information: Bio
[jira] [Commented] (MAILBOX-45) [gsoc2011] Design and Implement Mailbox with NoSQL Storage
[ https://issues.apache.org/jira/browse/MAILBOX-45?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanelfocusedCommentId=13019009#comment-13019009 ] Aamir Khan commented on MAILBOX-45: --- Hi Eric Do we have some kind of IRC channel for James Server Mailbox Project discussion? [gsoc2011] Design and Implement Mailbox with NoSQL Storage -- Key: MAILBOX-45 URL: https://issues.apache.org/jira/browse/MAILBOX-45 Project: James Mailbox Issue Type: New Feature Reporter: Eric Charles Assignee: Norman Maurer Labels: gsoc2011 Context: The mailbox subproject (http://james.apache.org/mailbox/) supports maildir, SQL database (via JPA) and Java Content Repository (JCR) as technology for mail storage. This flexibility is achieved thanks to a API design that abstracts mail storage from the mail protocols. Task: NoSQL storage (for example CouchDB or Cassandra) has great potential for mail storage. Design and develop an suitable RESTful integration API and implementations for as many NoSQL targets as possible in the time. Mentor: rdonkin at apache dot org Complexity: easy -- This message is automatically generated by JIRA. For more information on JIRA, see: http://www.atlassian.com/software/jira - To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org For additional commands, e-mail: server-dev-h...@james.apache.org
Re: Design and Implement Mailbox in James using NoSQL databases
I have started following books over Beginning CouchDBhttp://www.amazon.com/Beginning-CouchDB-Joe-Lennon/dp/1430272376 and i am trying to design the database implementation for mail storage. First of all i want to get your feedbacks over my proposalhttp://www.google-melange.com/gsoc/proposal/review/google/gsoc2011/aamirkhan/8005due to two reasons: 1) Have i understood the project completely and made proposal relevant to it? 2) Do you think that deliverables are up to the mark for 12 weeks work. But i have written according to what i felt at that time and also quoted that if i get extra time i will implement other API implementations as well. For designing database for mail storage, I have installed CouchDB on my localhost and trying to tweak with it. I would like to ask how the email messages are stored in any database, may be relational or non-relational (the procedure of storing messages). In my opinion it should be something like this : Whenever JAMES MAILBOX receives a message it will invoke some function like SAVE_MESSAGE which in turn will invoke the PUT/POST CouchDB API to put the message into the database. And whenever it wants to retrieve the message it would call some function like GET_MESSAGE which in turn will invoke the GET CouchDB API to get the message out of server. Correct me if i am wrong. I am starting with the simple one CouchDB database and try to tweak and test its different APIs in the mean time. If we save mails in only one database then to search for lets say messages addressed to x...@gmail.com we will have to traverse all the mails and check for to: tags. May be it is not very efficient method to store the mails, but that was my initial thought. Any thoughts? On Wed, Apr 13, 2011 at 12:00 AM, AAMIR KHAN ak4u2...@gmail.com wrote: Hi Eric, I would like to have your comments over my proposal. On Sat, Apr 9, 2011 at 10:00 AM, Eric Charles e...@apache.org wrote: Hi Aamir, The error message came probably from google closing the applications. http://twitter.com/#!/gsoc/status/56431319927889921 I now have access again to your application an have request mentorship. Good luck :) - Eric On 8/04/2011 20:56, AAMIR KHAN wrote: the proposal i sent to google-melange is the same as posted over mailing list. Maybe you can comment it over here. On Sat, Apr 9, 2011 at 12:15 AM, Eric Charlese...@apache.org wrote: Hi Aamir, That's good. Once I will get access to your application on google melange, I will ask for mentorship. Tks, Eric On 8/04/2011 19:42, AAMIR KHAN wrote: Revised Proposal : Proposal Title: Design and Implement Mailbox with CouchDB mail storage. Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: Since most of the mail contents are semi-structured in nature.CouchDB is non-relational, semi-structured database having great potential for mail storage. My project is to design and implement mail storage in James Mailbox using CouchDB. RESTful integration API for Retrieving,Sending and Deleting mails will also be done. Detailed Description: Why? lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Design : 1 week 2) Programming : 7 Weeks 3) Review and Testing : 1 week 4) Bug Fixing Time : 1 week 5) Documentation : 1 week 6) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Discuss the design for implementation of CouchDB after discussion with whole community. May 24 - May 31 : Finalise the design for implementation of CouchDB after discussion with whole community. June 1 - 20 June : Implement the finalised plan for Couch DB. June 21 - June 28 : Test and debug implementation of CouchDB with regressive test. July 1 - July 10 : -Implement RESTful integration API
Re: Design and Implement Mailbox in James using NoSQL databases
I already applied to google-melange Eric... http://www.google-melange.com/gsoc/proposal/review/google/gsoc2011/aamirkhan/8005 http://www.google-melange.com/gsoc/proposal/review/google/gsoc2011/aamirkhan/8005 On Fri, Apr 8, 2011 at 9:23 AM, Eric Charles e...@apache.org wrote: Also, ping us on this mailing list when you will have applied on google-melange so we can review it. Tks, - Eric On 8/04/2011 05:26, Eric Charles wrote: Hi, The idea of RESTful is to let communicate a client system with a server system via HTTP, transfering request parameters as http_request_params, getting response ax structured document (xml or json) in the http_response_body. You can read more on http://en.wikipedia.org/wiki/Representational_State_Transfer Couchdb has such an API (http://wiki.apache.org/couchdb/HTTP_Document_API ) It seems you are good at sprint :) (you are just in time for the deadline). You could outline in your application that event if the first implementation will be for couchdb, the RESTful framework will be designed to support other datastores. Therefor, 1 week design before the 8 weeks (becoming 7 weeks) would be good. Hopes this help. (Don't wait to register and inject this on google melange, you can always update it after). - Tks, Eric On 8/04/2011 00:49, AAMIR KHAN wrote: I would like to have valuable suggestions over my proposal.. On Fri, Apr 8, 2011 at 4:18 AM, AAMIR KHANak4u2...@gmail.com wrote: * Proposal Title: Design and Implement Mailbox with CouchDB storage. Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: CouchDB is non-relational, semi-structured database having great potential for mail storage. My project is to design and implement mail storage in James Mailbox using CouchDB. RESTful integration API will also be done. Detailed Description: Why? lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Programming : 8 Weeks 2) Review and Testing : 1 week 3) Bug Fixing Time : 1 week 4) Documentation : 1 week 5) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Finalise the design for implementation of CouchDB after discussion with whole community. May 24 - 20 June : Implement the finalised plan for Couch DB. June 21 - June 28 : Test and debug implementation of CouchDB with regressive test. July 1 - July 10 : -Implement RESTful integration API for Retrieving mail. -Test and debug implementation of Retrieving mail API. July 11 - July 20 : -Implement RESTful integration API for Sending mail. -Test and debug implementation of Sending mail API. July 21 - July 30 : -Implement RESTful integration API for Deleting mail. -Test and debug implementation of Deleting mail API. August 1-August 15 (Buffer Time): Second phase of testing: Testing of debugged code. August 15-August 22: -Work on Documentation. -Finally discuss the project with mentors. -Debugging the bugs (if any reported by Mentor) -Improve the Documentation, Release. August 22 - August 26 : -Final Evaluation Submission Available Time I am committed to giving at least 40-50 hours per week to GSOC. Since I am not doing anything this summer, I believe that the time devoted to GSOC will be much more than that, for sure. I have excellent work ethics, and a goal oriented guy. Additional Information: Bio I am 19 years old. I live in India.Studying at one of the most premier institute in India namely Indian Institute of Technology Roorkeehttp://www.iitr.ac.in/pursuing my Bachelor of Technology Computer Science Engineering.I have took courses like Computer programming in C++ at school and college levels.I have started serious problem solving around two months back.I have also worked in PHP as mentioned
Re: Design and Implement Mailbox in James using NoSQL databases
Revised Proposal : Proposal Title: Design and Implement Mailbox with CouchDB mail storage. Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: Since most of the mail contents are semi-structured in nature.CouchDB is non-relational, semi-structured database having great potential for mail storage. My project is to design and implement mail storage in James Mailbox using CouchDB. RESTful integration API for Retrieving,Sending and Deleting mails will also be done. Detailed Description: Why? lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Design : 1 week 2) Programming : 7 Weeks 3) Review and Testing : 1 week 4) Bug Fixing Time : 1 week 5) Documentation : 1 week 6) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Discuss the design for implementation of CouchDB after discussion with whole community. May 24 - May 31 : Finalise the design for implementation of CouchDB after discussion with whole community. June 1 - 20 June : Implement the finalised plan for Couch DB. June 21 - June 28 : Test and debug implementation of CouchDB with regressive test. July 1 - July 10 : -Implement RESTful integration API for Retrieving mail. This should be performed using GET operation at the document’s URL. -This will implement : GET /database_name/mail_id HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Retrieving mail API. July 11 - July 20 : -Implement RESTful integration API for Sending mail. This should be done using POST operation of HTTP_Document_API. -This will implement : POST /database_name/ HTTP/1.0 . -Test and debug implementation of Sending mail API. July 21 - July 30 : -Implement RESTful integration API for Deleting mail. This should be done using DELETE operation of HTTP_Document_API. -This will implement : DELETE /database_name/mail_id?revid=current_version HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Deleting mail API. The time line specified above is somewhat adjustable. If i can comeplete the above mentioned integrations before time, I would proceed with the following API’s integration in order: -Inline Attachments -Multiple Attachments -Stand Alone Attachments -ETags/Caching August 1-August 15 (Buffer Time): Second phase of testing: Testing of debugged code. August 15-August 22: -Work on Documentation. -Finally discuss the project with mentors. -Debugging the bugs (if any reported by Mentor) -Improve the Documentation, Release. August 22 - August 26 : -Final Evaluation Submission Available Time I am committed to giving at least 40-50 hours per week to GSOC. Since I am not doing anything this summer, I believe that the time devoted to GSOC will be much more than that, for sure. I have excellent work ethics, and a goal oriented guy. Additional Information: Bio I am 19 years old. I live in India.Studying at one of the most premier institute in India namely Indian Institute of Technology Roorkeehttp://www.iitr.ac.inpursuing my Bachelor of Technology Computer Science Engineering.I have took courses like Computer programming in C++ at school and college levels.I have started serious problem solving around two months back.I have also worked in PHP as mentioned in experiences.I have got prizes in various website designing competitions at school college levels. I like to contribute in open source communities because it gives me experience,technical expertise and it teaches spirit of team work. And its my time to give back to community from which i gained a lot of experience and motivation. You can have a look over myResumehttps://docs.google.com/viewer?a=vpid=explorerchrome=truesrcid
Re: Design and Implement Mailbox in James using NoSQL databases
the proposal i sent to google-melange is the same as posted over mailing list. Maybe you can comment it over here. On Sat, Apr 9, 2011 at 12:15 AM, Eric Charles e...@apache.org wrote: Hi Aamir, That's good. Once I will get access to your application on google melange, I will ask for mentorship. Tks, Eric On 8/04/2011 19:42, AAMIR KHAN wrote: Revised Proposal : Proposal Title: Design and Implement Mailbox with CouchDB mail storage. Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: Since most of the mail contents are semi-structured in nature.CouchDB is non-relational, semi-structured database having great potential for mail storage. My project is to design and implement mail storage in James Mailbox using CouchDB. RESTful integration API for Retrieving,Sending and Deleting mails will also be done. Detailed Description: Why? lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Design : 1 week 2) Programming : 7 Weeks 3) Review and Testing : 1 week 4) Bug Fixing Time : 1 week 5) Documentation : 1 week 6) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Discuss the design for implementation of CouchDB after discussion with whole community. May 24 - May 31 : Finalise the design for implementation of CouchDB after discussion with whole community. June 1 - 20 June : Implement the finalised plan for Couch DB. June 21 - June 28 : Test and debug implementation of CouchDB with regressive test. July 1 - July 10 : -Implement RESTful integration API for Retrieving mail. This should be performed using GET operation at the document’s URL. -This will implement : GET /database_name/mail_id HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Retrieving mail API. July 11 - July 20 : -Implement RESTful integration API for Sending mail. This should be done using POST operation of HTTP_Document_API. -This will implement : POST /database_name/ HTTP/1.0 . -Test and debug implementation of Sending mail API. July 21 - July 30 : -Implement RESTful integration API for Deleting mail. This should be done using DELETE operation of HTTP_Document_API. -This will implement : DELETE /database_name/mail_id?revid=current_version HTTP/1.0 . Here mail_id will be used to identify a particular unique Email Content. -Test and debug implementation of Deleting mail API. The time line specified above is somewhat adjustable. If i can comeplete the above mentioned integrations before time, I would proceed with the following API’s integration in order: -Inline Attachments -Multiple Attachments -Stand Alone Attachments -ETags/Caching August 1-August 15 (Buffer Time): Second phase of testing: Testing of debugged code. August 15-August 22: -Work on Documentation. -Finally discuss the project with mentors. -Debugging the bugs (if any reported by Mentor) -Improve the Documentation, Release. August 22 - August 26 : -Final Evaluation Submission Available Time I am committed to giving at least 40-50 hours per week to GSOC. Since I am not doing anything this summer, I believe that the time devoted to GSOC will be much more than that, for sure. I have excellent work ethics, and a goal oriented guy. Additional Information: Bio I am 19 years old. I live in India.Studying at one of the most premier institute in India namely Indian Institute of Technology Roorkeehttp://www.iitr.ac.inpursuing my Bachelor of Technology Computer Science Engineering.I have took courses like Computer programming in C++ at school and college levels.I have started serious problem solving around two months back.I have also worked in PHP as mentioned
Re: [HACKERS] GSoC 2011 Eager MV implementation proposal
As you people think and may be possible that complete implementation of Eager MVs cannot be completed in summer. So maybe i can pick up the work left to be done in snapshot MVs. I have cloned the repository of pavel baros from https://github.com/pbaros/postgres.git and i will be looking to find whats left out. Could anybody help me in figuring out what is left to be done in snapshot MVs implementation? There are a number of hard problems in getting a working implementation of materialized views that all get ignored by all of the student proposals we get, and what you're talking about doesn't address any of them. As soon as i know the shortcomings of snapshot MVs implementation and once go through the code committed during GSoC, I will revert back with the issues and how would i be tackling them. You really should read all of the messages in the following threads: http://archives.postgresql.org/pgsql-hackers/2010-04/msg00479.php http://archives.postgresql.org/pgsql-hackers/2010-06/msg00743.php http://archives.postgresql.org/pgsql-hackers/2010-07/msg00396.php And the following summaries: http://wiki.postgresql.org/wiki/Materialized_Views_GSoC_2010 http://rhaas.blogspot.com/2010/04/materialized-views-in-postgresql.html And then say how what you're suggesting fits into the issues raised last summer. The theory and way to implement eager MVs are interesting problems. But working on them won't lead toward code that can be committed to PostgreSQL this year.
Design and Implement Mailbox in James using NoSQL databases
I am interested in design and implementation of mailbox using CouchDB. I would like to know the rough proposal that i should follow to implement it. I have read about CouchDB that it is very efficient in file storage. Thanks, Aamir Khan
Re: Design and Implement Mailbox in James using NoSQL databases
In project idea it was mentioned try to implement as many RESTful integrations as possible... what exactly it means basically? On Fri, Apr 8, 2011 at 1:29 AM, Robert Burrell Donkin robertburrelldon...@gmail.com wrote: On Thu, Apr 7, 2011 at 8:56 PM, Norman Maurer nor...@apache.org wrote: Hi Aamir, cool to see you are interested in implementation of such a feature. I think the best think would be to outline some milestone plan and how you plan to implement. +1 (RESTful storage designs have been on my mind recently as well) Robert - To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org For additional commands, e-mail: server-dev-h...@james.apache.org
Re: Design and Implement Mailbox in James using NoSQL databases
Could anybody tell me what exactly is RESTful integration API? On Fri, Apr 8, 2011 at 2:37 AM, AAMIR KHAN ak4u2...@gmail.com wrote: In project idea it was mentioned try to implement as many RESTful integrations as possible... what exactly it means basically? On Fri, Apr 8, 2011 at 1:29 AM, Robert Burrell Donkin robertburrelldon...@gmail.com wrote: On Thu, Apr 7, 2011 at 8:56 PM, Norman Maurer nor...@apache.org wrote: Hi Aamir, cool to see you are interested in implementation of such a feature. I think the best think would be to outline some milestone plan and how you plan to implement. +1 (RESTful storage designs have been on my mind recently as well) Robert - To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org For additional commands, e-mail: server-dev-h...@james.apache.org
Re: Design and Implement Mailbox in James using NoSQL databases
* Proposal Title: Design and Implement Mailbox with CouchDB storage. Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: CouchDB is non-relational, semi-structured database having great potential for mail storage. My project is to design and implement mail storage in James Mailbox using CouchDB. RESTful integration API will also be done. Detailed Description: Why? lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Programming : 8 Weeks 2) Review and Testing : 1 week 3) Bug Fixing Time : 1 week 4) Documentation : 1 week 5) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Finalise the design for implementation of CouchDB after discussion with whole community. May 24 - 20 June : Implement the finalised plan for Couch DB. June 21 - June 28 : Test and debug implementation of CouchDB with regressive test. July 1 - July 10 : -Implement RESTful integration API for Retrieving mail. -Test and debug implementation of Retrieving mail API. July 11 - July 20 : -Implement RESTful integration API for Sending mail. -Test and debug implementation of Sending mail API. July 21 - July 30 : -Implement RESTful integration API for Deleting mail. -Test and debug implementation of Deleting mail API. August 1-August 15 (Buffer Time): Second phase of testing: Testing of debugged code. August 15-August 22: -Work on Documentation. -Finally discuss the project with mentors. -Debugging the bugs (if any reported by Mentor) -Improve the Documentation, Release. August 22 - August 26 : -Final Evaluation Submission Available Time I am committed to giving at least 40-50 hours per week to GSOC. Since I am not doing anything this summer, I believe that the time devoted to GSOC will be much more than that, for sure. I have excellent work ethics, and a goal oriented guy. Additional Information: Bio I am 19 years old. I live in India.Studying at one of the most premier institute in India namely Indian Institute of Technology Roorkeehttp://www.iitr.ac.in/pursuing my Bachelor of Technology Computer Science Engineering.I have took courses like Computer programming in C++ at school and college levels.I have started serious problem solving around two months back.I have also worked in PHP as mentioned in experiences.I have got prizes in various website designing competitions at school college levels. I like to contribute in open source communities because it gives me experience,technical expertise and it teaches spirit of team work. And its my time to give back to community from which i gained a lot of experience and motivation. You can have a look over my Resumehttps://docs.google.com/viewer?a=vpid=explorerchrome=truesrcid=0BxMbL0XOZUogOGI5NWM0MTctYjUwMy00MTM2LTljZjEtZmRhYjM3ZjcyMzlkhl=enauthkey=COmbsIQC Experiences Skills: -Working Knowledge of GIT -1 year experience in web development using PHP,HTML,JavaScript,Postgres,MySQL -Have knowledge of Design Patterns -Working Knowledge of PHP I, as a part of team manages institutes website www.iitr.ac.in We have setup a intranet portal (totally managed by students) inside campus of IIT Rookee which has around 80 applications (mostly in PHP) hosted on it.I have created Ebooks sharing portal within the intranet.I have very good experience in web designing (e.g, I have created website during last year summer internship www.raysconsultants.com ). Open Source contributions I have submitted following patches in PhpMyAdmin : 1)XML export of viewshttps://sourceforge.net/tracker/?func=detailaid=3258216group_id=23067atid=377410 2)XML Plugin for database Exporthttps://sourceforge.net/tracker/?func=detailaid=3135414group_id=23067atid=377410 3)Left Frame not updatedhttps://sourceforge.net/tracker/?func=detailaid=3091778group_id=23067atid=377410 https://sourceforge.net/tracker
Re: Design and Implement Mailbox in James using NoSQL databases
I would like to have valuable suggestions over my proposal.. On Fri, Apr 8, 2011 at 4:18 AM, AAMIR KHAN ak4u2...@gmail.com wrote: * Proposal Title: Design and Implement Mailbox with CouchDB storage. Student Name: Aamir Khan Student E-mail: ak4u2...@gmail.com Organization/Project: James Mailbox Apache Software Foundation Assigned Mentor: Robert Burrell Donkin (rdon...@apache.org ) Proposal Abstract: CouchDB is non-relational, semi-structured database having great potential for mail storage. My project is to design and implement mail storage in James Mailbox using CouchDB. RESTful integration API will also be done. Detailed Description: Why? lets consider a example Mail: “From” : “ak4u2...@gmail.com” “To” : “server-dev@james.apache.org” “Subject” : “Implementation of CoucheDB” “Body” : “Implementation Proposal” All the messages like the one stated above will be stored as a flat collection in CouchDB. Since the mail contents are generally semi structured thats why CouchDB is most preferable database for the same. Distributivity: Since CouchDB is a distributed system. We can have multiple independent copies of mails to different servers (faster performance) and whenever we want we can redistribute changes bidirectionally.It is also helpful if one of the mail server fails then other backup servers can fulfill the requests. How? Road Map 0) Code Familiarity : Already started and going. 1) Programming : 8 Weeks 2) Review and Testing : 1 week 3) Bug Fixing Time : 1 week 4) Documentation : 1 week 5) Buffer Time for any unpredicted delay and Second phase of testing : 1 week Deliverable Project Schedule April 25-May 23(Community Bonding Period) : I would be in constant touch with my mentor and james mailbox community as a whole. I would discuss further about the project with my mentor and keep posting about implementation plans over the main server-dev@james.apache.org mailing list. Finalise the design for implementation of CouchDB after discussion with whole community. May 24 - 20 June : Implement the finalised plan for Couch DB. June 21 - June 28 : Test and debug implementation of CouchDB with regressive test. July 1 - July 10 : -Implement RESTful integration API for Retrieving mail. -Test and debug implementation of Retrieving mail API. July 11 - July 20 : -Implement RESTful integration API for Sending mail. -Test and debug implementation of Sending mail API. July 21 - July 30 : -Implement RESTful integration API for Deleting mail. -Test and debug implementation of Deleting mail API. August 1-August 15 (Buffer Time): Second phase of testing: Testing of debugged code. August 15-August 22: -Work on Documentation. -Finally discuss the project with mentors. -Debugging the bugs (if any reported by Mentor) -Improve the Documentation, Release. August 22 - August 26 : -Final Evaluation Submission Available Time I am committed to giving at least 40-50 hours per week to GSOC. Since I am not doing anything this summer, I believe that the time devoted to GSOC will be much more than that, for sure. I have excellent work ethics, and a goal oriented guy. Additional Information: Bio I am 19 years old. I live in India.Studying at one of the most premier institute in India namely Indian Institute of Technology Roorkeehttp://www.iitr.ac.in/pursuing my Bachelor of Technology Computer Science Engineering.I have took courses like Computer programming in C++ at school and college levels.I have started serious problem solving around two months back.I have also worked in PHP as mentioned in experiences.I have got prizes in various website designing competitions at school college levels. I like to contribute in open source communities because it gives me experience,technical expertise and it teaches spirit of team work. And its my time to give back to community from which i gained a lot of experience and motivation. You can have a look over my Resumehttps://docs.google.com/viewer?a=vpid=explorerchrome=truesrcid=0BxMbL0XOZUogOGI5NWM0MTctYjUwMy00MTM2LTljZjEtZmRhYjM3ZjcyMzlkhl=enauthkey=COmbsIQC Experiences Skills: -Working Knowledge of GIT -1 year experience in web development using PHP,HTML,JavaScript,Postgres,MySQL -Have knowledge of Design Patterns -Working Knowledge of PHP I, as a part of team manages institutes website www.iitr.ac.in We have setup a intranet portal (totally managed by students) inside campus of IIT Rookee which has around 80 applications (mostly in PHP) hosted on it.I have created Ebooks sharing portal within the intranet.I have very good experience in web designing (e.g, I have created website during last year summer internship www.raysconsultants.com ). Open Source contributions I have submitted following patches in PhpMyAdmin : 1)XML export of viewshttps://sourceforge.net/tracker/?func=detailaid=3258216group_id=23067atid=377410 2)XML Plugin
[HACKERS] GSoC 2011 Eager MV implementation proposal
Title: Implementation of Eager Materialized views in postgres Name of Proposer Email : Aamir Khan ak4u2...@gmail.com Synopsis: I would like to implement eager materialized view.An eager materialized view will be updated whenever the view changes. This is done with a system of triggers on all of the underlying tables. Benefits to the PostgreSQL Community: First of all, it would be the best if my work is helpful to everybody who misses materialized views in PostgreSQL, because PostgreSQL do not have still implemented materialized views. In addition, MV is mentioned as the top rated feature in TODO list. Deliverables: First of all, at the end of whole my project is not only finishing the patch if possible, get patch into next PostgreSQL release, or keep git repository actual to last PosgreSQL version. Bio I am student of one of the most premier institute in India namely Indian Institute of Technology Roorkee pursuing my Bachelor of Technology Computer Science Engineering. I, as a part of team manages institutes website www.iitr.ac.in . We have setup a intranet portal inside campus of IIT Rookee which has around 80 applications hosted on it. I have created ebooks sharing portal within the intranet. I have very good experience in web designing (e.g, I have created website during last year summer internship www.raysconsultants.com ). Regarding open source work : i have submitted many patches for phpmyadmin I like to contribute in open source communitites because it gives me experience,technical expertise and it teaches spirit of team work. And its my time to give back to community from which i gained a lot of experience and motivation. Project plan I am completely free this summer. I intend to indulge in some of my hobbies this summer, like Squash etc, leaving me plenty of time to complete my project. The tentative schedule as discussed with my mentor is : (1) Identify how an eager MV system would work, by labelling and identifying every table, query, trigger, etc... This would be a written document that has been checked by me for completeness, precision, and correctness. (1 week) (2) Identify the internal structure of a parsed query, the basic atomic parts of this structure, and how each atomic structure maps precisely to our MV system described in (1). Again, a written document approved by myself, and reviewed by the PostgreSQL community. (2 weeks) (3) Outline how a create_eager_mv function would work, starting with the interface (what parameters it takes), and working through the exact SQL commands that must be executed to complete the process. Identify which SQL commands depend on the structure of the query. (2 weeks) (4) Write unit tests that check a variety of queries against your (as of yet, unwritten) function. Ensure completeness by reviewing with me. (1 week) (5) Finally, given all of the above, translate (3) into working code, likely implemented in PL/Python or C, that passes the unit tests. Submit to PostgreSQL community for review. (2 weeks) Contact Information Name: Aamir Khan Country: Indian School and degree: Indian Institute of Technology, Roorkee, Bachelor of Technology Email: ak4u2...@gmail.com Phone: +91-9557647357
Re: [algogeeks] An Interesting Question Calculate nth Power of Integer
Try this...
#include iostream
#include cmath
using namespace std;
#define DIGITS 10001
void mult(int N,int pro[],int len) {
int carry = 0;
for(int i=0;ilen;i++) {
int temp = pro[i]*N + carry;
pro[i] = temp%10;
carry = temp/10;
}
if(carry0) {
pro[len] = carry;
len++;
}
}
int main() {
int t,N,E;
scanf(%d,t);
while(t--) {
int pro[DIGITS];
scanf(%d %d,N,E);
if(N==1) {
printf(1 1\n);
continue;
}
pro[0] = 1; int len = 1;
for(int i=0;iE;i++) {
mult(N,pro,len);
}
for(int i=len-1;i=0;i--) {
printf(%d,pro[i]);
}
printf(\n);
}
return 0;
}
Here t stands for number of testcases...
N = the number for which power is to be calculated..
E = the exponent..
On Thu, Mar 24, 2011 at 12:22 PM, bittu shashank7andr...@gmail.com wrote:
How you will print the 100th power of a single digit( which is of type
int). How do you maintain that big number in memory?
Lets C The Approach
Thank Regards
Shashank
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] An Interesting Question Calculate nth Power of Integer
Yeah i know the algorithm is not very much efficient...But i was trying to
show how to tackle with big integers in C++ (i.e, using arrays)
On Thu, Mar 24, 2011 at 1:06 PM, radha krishnan
radhakrishnance...@gmail.com wrote:
You can do it in (log n) assuming multiplication is O(1)
suppose u are going to calculate 8 power 33
u compute 8 power 16 and multiply with the same to get 8 power 32
then multiply with 8 to get the result
On Thu, Mar 24, 2011 at 1:04 PM, AAMIR KHAN ak4u2...@gmail.com wrote:
Try this...
#include iostream
#include cmath
using namespace std;
#define DIGITS 10001
void mult(int N,int pro[],int len) {
int carry = 0;
for(int i=0;ilen;i++) {
int temp = pro[i]*N + carry;
pro[i] = temp%10;
carry = temp/10;
}
if(carry0) {
pro[len] = carry;
len++;
}
}
int main() {
int t,N,E;
scanf(%d,t);
while(t--) {
int pro[DIGITS];
scanf(%d %d,N,E);
if(N==1) {
printf(1 1\n);
continue;
}
pro[0] = 1; int len = 1;
for(int i=0;iE;i++) {
mult(N,pro,len);
}
for(int i=len-1;i=0;i--) {
printf(%d,pro[i]);
}
printf(\n);
}
return 0;
}
Here t stands for number of testcases...
N = the number for which power is to be calculated..
E = the exponent..
On Thu, Mar 24, 2011 at 12:22 PM, bittu shashank7andr...@gmail.com
wrote:
How you will print the 100th power of a single digit( which is of type
int). How do you maintain that big number in memory?
Lets C The Approach
Thank Regards
Shashank
--
You received this message because you are subscribed to the Google
Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] suggestion required
You could try http://domjudge.sourceforge.net/ and do customizations in its source code only.. On Thu, Mar 24, 2011 at 1:22 PM, .bashrc saurab...@gmail.com wrote: Hi I have been working on a progrmming judge that can be deployed in my college.I have already developed a prototype in bash.I want it to be as general as possible,just like spoj,but i also want to add features to it like detecting copying of source code.Moreover to analyse the design of the code i need a source code parser,instead of plain gcc or any other compiler for other languages.Please give your opinions what more features we can add to the judge in context of academic use.I am currently working on gcc compiler to try some modification in it for analysing the design of code.But since i have to do the same for many other languages its prooving to be a daunting task. Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[9fans] GSoC 2011 suggested projects!
Hi all! I would like to participate in GSoC 2011 in some of the project related to plan9. Can i get the suggested list of projects? Thanks Regards Aamir Khan
Re: [9fans] Happy Birthday
Happy Birth day Ken On Fri, Feb 4, 2011 at 10:47 PM, Michaelian Ennis michaelian.en...@gmail.com wrote: Today is Ken's birthday! Happy Birthday Ken!
[Libreoffice] (no subject)
___ LibreOffice mailing list LibreOffice@lists.freedesktop.org http://lists.freedesktop.org/mailman/listinfo/libreoffice
[ns] Source code samples to calculate bandwidth
Hello all, I want to know how to calculate bandwidth in different ways. Please can you send me source code samples related to bandwidth calculation. Thanks. Best Regards Aamir Khan _ Hotmail: Free, trusted and rich email service. https://signup.live.com/signup.aspx?id=60969
[gcj] Coderforces Round # 14
I was doing some practice for codeforces round 15 to be held in around
27 hours from now
I have written the C++ source code for codeforces round 14/A problem
(Letter)...
I am getting runtime error which i am not able to understand...
Please help..
Error:
terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check
Aborted
Source Code:
/**
Header Files
**/
#include iostream
#include vector
#include cstdio
#include cstdlib
#include stdexcept
#include string
#include iomanip
using namespace std;
typedef vectorint vi;
int main()
{
int row,col;
cinrowcol;
const int cols=col;
const int rows=row;
char Array[rows][cols];
string sentence;
vi A;
vi B;
for(int i=0;irows;i++)
{ cinsentence;
for (int j=0;jcols;j++)
{Array[i][j]=sentence[j];
if (Array[i][j]=='*')
{ A.push_back(i);
B.push_back(j); }
}
}
for(int i=A.at(0);iA.at(A.size());i++)
{
int max_B=0;
int min_B=row-1;
for ( unsigned l=0;lB.size();l++)
{
if(max_B B.at(l))
max_B=B.at(l);
if(min_B B.at(l))
min_B=B.at(l);
}
for (int j=min_B;jmax_B;j++)
{ coutArray[i][j];
}
}
cin.get();
cin.ignore();
return 0;
}
And if you have better algorithm to solve the problem then please
share it here
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
[gcj] Re: Coderforces Round # 14
i have written iA.size().not i=A.size()
i think thats not error..and i have tried it also
On May 28, 5:35 pm, Bharath Raghavendran rbharat...@gmail.com wrote:
I dont know what the question is or what the algo is supposd to do. But i
guess the error is happening at this point :
A.at(A.size())
maybe you need to do A.at(A.size()-1) ?
On 28 May 2010 17:49, Aamir Khan aamir.cod...@gmail.com wrote:
I was doing some practice for codeforces round 15 to be held in around
27 hours from now
I have written the C++ source code for codeforces round 14/A problem
(Letter)...
I am getting runtime error which i am not able to understand...
Please help..
Error:
terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check
Aborted
Source Code:
/**
Header Files
**/
#include iostream
#include vector
#include cstdio
#include cstdlib
#include stdexcept
#include string
#include iomanip
using namespace std;
typedef vectorint vi;
int main()
{
int row,col;
cinrowcol;
const int cols=col;
const int rows=row;
char Array[rows][cols];
string sentence;
vi A;
vi B;
for(int i=0;irows;i++)
{ cinsentence;
for (int j=0;jcols;j++)
{ Array[i][j]=sentence[j];
if (Array[i][j]=='*')
{ A.push_back(i);
B.push_back(j); }
}
}
for(int i=A.at(0);iA.at(A.size());i++)
{
int max_B=0;
int min_B=row-1;
for ( unsigned l=0;lB.size();l++)
{
if(max_B B.at(l))
max_B=B.at(l);
if(min_B B.at(l))
min_B=B.at(l);
}
for (int j=min_B;jmax_B;j++)
{ coutArray[i][j];
}
}
cin.get();
cin.ignore();
return 0;
}
And if you have better algorithm to solve the problem then please
share it here
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.comgoogle-code%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
[gcj] Re: Coderforces Round # 14
oh i got it.
i got my mistake but still don't know what should be the right code...
or right algorithm...
by the way thanks to everybody who helped me...
On May 28, 11:14 pm, Carlos Guia zyx3d...@gmail.com wrote:
I'm pretty sure Bharath is right on that one. A.at(A.size()) is going to
throw an exception no matter the size or values of A. Changing that may not
make the algorithm right, but that instruction is wrong nevertheless, it is
always accessing an element outside A's range.
The algorithm itself has other errors, you must print the rectangle that
encloses the image, not process lines independently. For example:
Input
*.*.
..*.
*...
Correct output
*.*
..*
...
*..
Your logic's output:
*.*
*
*
Carlos Guía
On Fri, May 28, 2010 at 1:16 PM, Aamir Khan aamir.cod...@gmail.com wrote:
i have written iA.size().not i=A.size()
i think thats not error..and i have tried it also
On May 28, 5:35 pm, Bharath Raghavendran rbharat...@gmail.com wrote:
I dont know what the question is or what the algo is supposd to do. But
i
guess the error is happening at this point :
A.at(A.size())
maybe you need to do A.at(A.size()-1) ?
On 28 May 2010 17:49, Aamir Khan aamir.cod...@gmail.com wrote:
I was doing some practice for codeforces round 15 to be held in around
27 hours from now
I have written the C++ source code for codeforces round 14/A problem
(Letter)...
I am getting runtime error which i am not able to understand...
Please help..
Error:
terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check
Aborted
Source Code:
/**
Header Files
**/
#include iostream
#include vector
#include cstdio
#include cstdlib
#include stdexcept
#include string
#include iomanip
using namespace std;
typedef vectorint vi;
int main()
{
int row,col;
cinrowcol;
const int cols=col;
const int rows=row;
char Array[rows][cols];
string sentence;
vi A;
vi B;
for(int i=0;irows;i++)
{ cinsentence;
for (int j=0;jcols;j++)
{ Array[i][j]=sentence[j];
if (Array[i][j]=='*')
{ A.push_back(i);
B.push_back(j); }
}
}
for(int i=A.at(0);iA.at(A.size());i++)
{
int max_B=0;
int min_B=row-1;
for ( unsigned l=0;lB.size();l++)
{
if(max_B B.at(l))
max_B=B.at(l);
if(min_B B.at(l))
min_B=B.at(l);
}
for (int j=min_B;jmax_B;j++)
{ coutArray[i][j];
}
}
cin.get();
cin.ignore();
return 0;
}
And if you have better algorithm to solve the problem then please
share it here
--
You received this message because you are subscribed to the Google
Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.comgoogle-code%2bunsubscr...@googlegroups.com
google-code%2bunsubscr...@googlegroups.comgoogle-code%252bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.comgoogle-code%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
[gcj] Re: Error in my C++ code
n is int in this casehow can pow(2,n) can workit requires
both the arguments to be double???
On May 15, 11:15 pm, tonka ritwik.sami1...@gmail.com wrote:
why the heck will you write such a clumsy and lengthy code??? take a
look at my code:
#includeiostream.h
#includefstream.h
#includeconio.h
#includemath.h
#includestdio.h
#includestring.h
void main()
{
int t,flag=0,n;
long int k;
ifstream fi(A-large.in,ios::binary|ios::in);
ofstream fo(outputlar.out,ios::out);
fit;
for(int t_c=0;t_ct;t_c++)
{
fink;
if(((k+1)%(long int)pow(2,n))==0)
foCase #(t_c+1): ONendl;
else
foCase #(t_c+1): OFFendl;
}
fi.close();
fo.close();
getch();
}
This works for the large input also.
On May 14, 7:49 pm, Bharath Raghavendran rbharat...@gmail.com wrote:
I found one mistake : If b PD, you are returning 0. Why is that?
Lets say you have 4 switches, PD = 16. If b = 15, the answer should be ON.
Other than that, there are many ways you can improve your code.
1.
dont use double. It will remove accuracy in many places. 10^8 will come
within 4 bytes (usually int suffices this. else use long int).
2.
To calculate 2^n, you can use the left shift operator. int PD = 1n will
put 2^n into PD.
3.
To check if b gives reminder PD -1, you don't need to run a loop. You can do
if (b%PD == PD-1)
On 13 May 2010 10:47, Aamir Khan aamir.cod...@gmail.com wrote:
#include cmath
#include cstdio
#include iostream
using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#define For(i,a,b) for (long i(a),_b(b); i = _b; ++i)
char buf[1024*1024];
bool isEven(long a,long b)
{ bool result=0;
if(b%2==0)
result=0;
else
{
double ad=0.00;
for(int j=0;j=30;j++)
{
if(int(ad)==a)
{ break;}
ad=ad+1.00;
}
long PD=long(pow(2.00,ad));
if(bPD)
result=0;
else
{
for(long i=PD;i=1;i+=PD)
{
if(b==i-1)
{
result=1;
break;
}
}
}
}
return result;
}
int main() {
freopen(A-large.in, rt, stdin);
freopen(output_Snapper_Chain.txt, wt, stdout);
gets(buf);
long size=atoi(buf);
For(test, 1, size)
{
// coutNo. of loopstest;
long N;
long K;
scanf(%d%d, N, K);
// coutNNKK;
bool res=isEven(N,K);
if(res)
printf(Case #%d: ON\n, test);
else
printf(Case #%d: OFF\n, test);
}
exit(0);
}
---
SNAPPER CHAIN:
Can anybody tell me the errors in the code.i have done this
problem using the simple concept which i knowit is not giving
right output
Brief explanation of code:
i have first converted the long taken from file into the double using
for loop..then using pow function i have found 2^N and then found
whether k==2^N-1;
_
Aamir
--
You received this message because you are subscribed to the Google Groups
google-codejam group. To post to this group, send email
togoogle-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.comgoogle-code%2bunsubscr...@googlegr
oups.com
.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
--
You received this message because you are subscribed to the Google Groups
google-codejam group. To post to this group, send email
togoogle-c...@googlegroups.com. To unsubscribe from this group, send email
togoogle-code+unsubscr...@googlegroups.com.
For more options, visit this group
athttp://groups.google.com/group/google-code?hl=en.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.To post to this group, send email
togoogle-c...@googlegroups.com.to unsubscribe from this group, send email
togoogle-code+unsubscr...@googlegroups.com.
For more options, visit this group
athttp://groups.google.com/group/google-code?hl=en.
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c
[gcj] Re: Error in my C++ code
the information given by you is good..but in other situations the
text written by you is not so much clearcould you please clearly
post it.what is to use logn multiplications
Thanks for help
On May 15, 11:50 pm, Davi Costa daf...@gmail.com wrote:
You should take care about (long int) cast, because in c++ most compilers
uses the int precision the same as long int precision (32 bits), if you need
more you should use (long long int).
Also using the function pow to exponentiate integers is a very bad ideia. It
first change it to double, use some expensive routines, return a double and
then you cast back to integer, what can cause lots of precision problems and
lost of speed.
In the specific case of base 2 just shift the bits, like
2^0 = 10 = 1b = 1
2^1 = 11 = 10b = 2
2^2 = 12 = 100b = 4
.
.
.
In other situations you should check this recurrence relation
[image: x^n= \begin{cases} 1, \mbox{if } n = 0 \\ x \cdot \left(
x^{\frac{n-1}{2}} \right)^2, \mbox{if } n \mbox { is odd} \\ \left(
x^{\frac{n}{2}} \right)^2, \mbox{if }n\mbox{ is even} \end{cases}]
to use logn multiplications.
On Sat, May 15, 2010 at 3:15 PM, tonka ritwik.sami1...@gmail.com wrote:
why the heck will you write such a clumsy and lengthy code??? take a
look at my code:
#includeiostream.h
#includefstream.h
#includeconio.h
#includemath.h
#includestdio.h
#includestring.h
void main()
{
int t,flag=0,n;
long int k;
ifstream fi(A-large.in,ios::binary|ios::in);
ofstream fo(outputlar.out,ios::out);
fit;
for(int t_c=0;t_ct;t_c++)
{
fink;
if(((k+1)%(long int)pow(2,n))==0)
foCase #(t_c+1): ONendl;
else
foCase #(t_c+1): OFFendl;
}
fi.close();
fo.close();
getch();
}
This works for the large input also.
On May 14, 7:49 pm, Bharath Raghavendran rbharat...@gmail.com wrote:
I found one mistake : If b PD, you are returning 0. Why is that?
Lets say you have 4 switches, PD = 16. If b = 15, the answer should be
ON.
Other than that, there are many ways you can improve your code.
1.
dont use double. It will remove accuracy in many places. 10^8 will come
within 4 bytes (usually int suffices this. else use long int).
2.
To calculate 2^n, you can use the left shift operator. int PD = 1n
will
put 2^n into PD.
3.
To check if b gives reminder PD -1, you don't need to run a loop. You can
do
if (b%PD == PD-1)
On 13 May 2010 10:47, Aamir Khan aamir.cod...@gmail.com wrote:
#include cmath
#include cstdio
#include iostream
using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#define For(i,a,b) for (long i(a),_b(b); i = _b; ++i)
char buf[1024*1024];
bool isEven(long a,long b)
{ bool result=0;
if(b%2==0)
result=0;
else
{
double ad=0.00;
for(int j=0;j=30;j++)
{
if(int(ad)==a)
{ break;}
ad=ad+1.00;
}
long PD=long(pow(2.00,ad));
if(bPD)
result=0;
else
{
for(long i=PD;i=1;i+=PD)
{
if(b==i-1)
{
result=1;
break;
}
}
}
}
return result;
}
int main() {
freopen(A-large.in, rt, stdin);
freopen(output_Snapper_Chain.txt, wt, stdout);
gets(buf);
long size=atoi(buf);
For(test, 1, size)
{
// coutNo. of loopstest;
long N;
long K;
scanf(%d%d, N, K);
// coutNNKK;
bool res=isEven(N,K);
if(res)
printf(Case #%d: ON\n, test);
else
printf(Case #%d: OFF\n, test);
}
exit(0);
}
---
SNAPPER CHAIN:
Can anybody tell me the errors in the code.i have done this
problem using the simple concept which i knowit is not giving
right output
Brief explanation of code:
i have first converted the long taken from file into the double using
for loop..then using pow function i have found 2^N and then found
whether k==2^N-1;
_
Aamir
--
You received this message because you are subscribed to the Google
Groups
google-codejam group. To post to this group, send
[gcj] Error in my C++ code
#include cmath
#include cstdio
#include iostream
using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#define For(i,a,b) for (long i(a),_b(b); i = _b; ++i)
char buf[1024*1024];
bool isEven(long a,long b)
{ bool result=0;
if(b%2==0)
result=0;
else
{
double ad=0.00;
for(int j=0;j=30;j++)
{
if(int(ad)==a)
{ break;}
ad=ad+1.00;
}
long PD=long(pow(2.00,ad));
if(bPD)
result=0;
else
{
for(long i=PD;i=1;i+=PD)
{
if(b==i-1)
{
result=1;
break;
}
}
}
}
return result;
}
int main() {
freopen(A-large.in, rt, stdin);
freopen(output_Snapper_Chain.txt, wt, stdout);
gets(buf);
long size=atoi(buf);
For(test, 1, size)
{
//coutNo. of loopstest;
long N;
long K;
scanf(%d%d, N, K);
// coutNNKK;
bool res=isEven(N,K);
if(res)
printf(Case #%d: ON\n, test);
else
printf(Case #%d: OFF\n, test);
}
exit(0);
}
---
SNAPPER CHAIN:
Can anybody tell me the errors in the code.i have done this
problem using the simple concept which i knowit is not giving
right output
Brief explanation of code:
i have first converted the long taken from file into the double using
for loop..then using pow function i have found 2^N and then found
whether k==2^N-1;
_
Aamir
--
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-c...@googlegroups.com.
To unsubscribe from this group, send email to
google-code+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en.
[ns] [Re]No CTS/RTS/ACK in trace file, why ?
Hello all, I am able to view the CTS/RTS/ACK in the old format trace file with the following command : Mac/802_11 RTSThreshold_ 0 (before node configuration) but I am unable to view it in the new trace-file format. Thanks. _ Hotmail: Free, trusted and rich email service. https://signup.live.com/signup.aspx?id=60969
[ns] No CTS/RTS/ACK in trace file, why?
Hello all, I have read in many posts that to set ON/OFF the MAC layer's CTS/RTS/ACK in the trace file, we have to add the following command : Mac/802_11 set RTSThreshold_ 0 In many posts I read that the value of RTSThreshold_ must be lower than the value of the packet size. In my simulations, packet size is 64 Bytes. Even then I don't see CTS/RTS/ACK in the trace file. Please help me. _ Hotmail: Powerful Free email with security by Microsoft. https://signup.live.com/signup.aspx?id=60969
[IdRO] Nice Four Seasons Of Malaysia
Four Seasons Sydney Sydney, Australia http://bit.ly/bL5XEp http://bit.ly/bL5XEp http://bit.ly/bL5XEp http://bit.ly/bL5XEp Four Seasons Jackson Hole Teton Village, WY, United States http://bit.ly/cwblIY http://bit.ly/cwblIY http://bit.ly/cwblIY http://bit.ly/cwblIY Four Seasons Provence Terre Blanche Terre Blanche, France http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 Four Seasons Resort Costa Rica at Peninsula Papagayo http://bit.ly/9S60EK http://bit.ly/9S60EK http://bit.ly/9S60EK http://bit.ly/9S60EK Four Seasons Langkawi Kedah Darul Aman, Malaysia http://bit.ly/9X6wx2 http://bit.ly/9X6wx2 http://bit.ly/9X6wx2 http://bit.ly/9X6wx2
[iklan-investasi] Nice Four Seasons Of Malaysia
Four Seasons Sydney Sydney, Australia http://bit.ly/bL5XEp http://bit.ly/bL5XEp http://bit.ly/bL5XEp http://bit.ly/bL5XEp Four Seasons Jackson Hole Teton Village, WY, United States http://bit.ly/cwblIY http://bit.ly/cwblIY http://bit.ly/cwblIY http://bit.ly/cwblIY Four Seasons Provence Terre Blanche Terre Blanche, France http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 Four Seasons Resort Costa Rica at Peninsula Papagayo http://bit.ly/9S60EK http://bit.ly/9S60EK http://bit.ly/9S60EK http://bit.ly/9S60EK Four Seasons Langkawi Kedah Darul Aman, Malaysia http://bit.ly/9X6wx2 http://bit.ly/9X6wx2 http://bit.ly/9X6wx2 http://bit.ly/9X6wx2
[IndoCareer - Execufinder Labor provider] Nice Four Seasons Of Malaysia
Four Seasons Sydney Sydney, Australia http://bit.ly/bL5XEp http://bit.ly/bL5XEp http://bit.ly/bL5XEp http://bit.ly/bL5XEp Four Seasons Jackson Hole Teton Village, WY, United States http://bit.ly/cwblIY http://bit.ly/cwblIY http://bit.ly/cwblIY http://bit.ly/cwblIY Four Seasons Provence Terre Blanche Terre Blanche, France http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 http://bit.ly/dz7Ok1 Four Seasons Resort Costa Rica at Peninsula Papagayo http://bit.ly/9S60EK http://bit.ly/9S60EK http://bit.ly/9S60EK http://bit.ly/9S60EK Four Seasons Langkawi Kedah Darul Aman, Malaysia http://bit.ly/9X6wx2 http://bit.ly/9X6wx2 http://bit.ly/9X6wx2 http://bit.ly/9X6wx2
[IdRO] The Monument Of Love in India Xclusive
The Monument Of Love - Taj Mahal http://bit.ly/cgNpf7 http://bit.ly/cgNpf7 The real hotels are seven stars http://bit.ly/cs7tl7 http://bit.ly/cs7tl7 Mardan Palace today's modern luxuries http://bit.ly/dhdnzI http://bit.ly/dhdnzI Taj MahalOriginal stays Original... http://bit.ly/aWDTHQ http://bit.ly/aWDTHQ Lilypad City The 21st Century Noah's Ark http://bit.ly/9K9vGu http://bit.ly/9K9vGu 7 star hotel - spacious luxury suites gourmet restaurants http://bit.ly/aARTlC http://bit.ly/aARTlC Expensive hotel in Europe http://bit.ly/9icd7Z http://bit.ly/9icd7Z true luxury hotel where you spend your downtime http://bit.ly/ditqaK http://bit.ly/ditqaK Places that can be visited for honeymoon http://bit.ly/dzqwe8 http://bit.ly/dzqwe8 list of the World's Top Ten Most Expensive Hotel Rooms http://bit.ly/cimjre http://bit.ly/cimjre
[iklan-investasi] The Monument Of Love in India Xclusive
The Monument Of Love - Taj Mahal http://bit.ly/cgNpf7 http://bit.ly/cgNpf7 The real hotels are seven stars http://bit.ly/cs7tl7 http://bit.ly/cs7tl7 Mardan Palace today's modern luxuries http://bit.ly/dhdnzI http://bit.ly/dhdnzI Taj MahalOriginal stays Original... http://bit.ly/aWDTHQ http://bit.ly/aWDTHQ Lilypad City The 21st Century Noah's Ark http://bit.ly/9K9vGu http://bit.ly/9K9vGu 7 star hotel - spacious luxury suites gourmet restaurants http://bit.ly/aARTlC http://bit.ly/aARTlC Expensive hotel in Europe http://bit.ly/9icd7Z http://bit.ly/9icd7Z true luxury hotel where you spend your downtime http://bit.ly/ditqaK http://bit.ly/ditqaK Places that can be visited for honeymoon http://bit.ly/dzqwe8 http://bit.ly/dzqwe8 list of the World's Top Ten Most Expensive Hotel Rooms http://bit.ly/cimjre http://bit.ly/cimjre
[IndoCareer - Execufinder Labor provider] The Monument Of Love in India Xclusive
The Monument Of Love - Taj Mahal http://bit.ly/cgNpf7 http://bit.ly/cgNpf7 The real hotels are seven stars http://bit.ly/cs7tl7 http://bit.ly/cs7tl7 Mardan Palace today's modern luxuries http://bit.ly/dhdnzI http://bit.ly/dhdnzI Taj MahalOriginal stays Original... http://bit.ly/aWDTHQ http://bit.ly/aWDTHQ Lilypad City The 21st Century Noah's Ark http://bit.ly/9K9vGu http://bit.ly/9K9vGu 7 star hotel - spacious luxury suites gourmet restaurants http://bit.ly/aARTlC http://bit.ly/aARTlC Expensive hotel in Europe http://bit.ly/9icd7Z http://bit.ly/9icd7Z true luxury hotel where you spend your downtime http://bit.ly/ditqaK http://bit.ly/ditqaK Places that can be visited for honeymoon http://bit.ly/dzqwe8 http://bit.ly/dzqwe8 list of the World's Top Ten Most Expensive Hotel Rooms http://bit.ly/cimjre http://bit.ly/cimjre
[job-studenti.ro] The Monument Of Love in India Xclusive
The Monument Of Love - Taj Mahal http://bit.ly/cgNpf7 http://bit.ly/cgNpf7 The real hotels are seven stars http://bit.ly/cs7tl7 http://bit.ly/cs7tl7 Mardan Palace today's modern luxuries http://bit.ly/dhdnzI http://bit.ly/dhdnzI Taj MahalOriginal stays Original... http://bit.ly/aWDTHQ http://bit.ly/aWDTHQ Lilypad City The 21st Century Noah's Ark http://bit.ly/9K9vGu http://bit.ly/9K9vGu 7 star hotel - spacious luxury suites gourmet restaurants http://bit.ly/aARTlC http://bit.ly/aARTlC Expensive hotel in Europe http://bit.ly/9icd7Z http://bit.ly/9icd7Z true luxury hotel where you spend your downtime http://bit.ly/ditqaK http://bit.ly/ditqaK Places that can be visited for honeymoon http://bit.ly/dzqwe8 http://bit.ly/dzqwe8 list of the World's Top Ten Most Expensive Hotel Rooms http://bit.ly/cimjre http://bit.ly/cimjre
[grosir_komputer] Funny Pictures Of The Month! Not 4 Girls
Dear Users! http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun We are closing this group. And This is final Warning. Because of spam messages we are not able to remain your membership in this group. If you wanted to keep the membership than you have to join the alternate group. Click On The below link And join the group. If you wanted to get some best stuff in your inbox instead of spam messages. Than Please don't wait and click on the link below and join it. This group will Close and this is the last warning to all the group members. So please click the link below and get the membership of this group. Where all of your messages will approve. And you can sent and receive the quality mails. http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun Thanks Regards, Owner Group
[grosir_komputer] All Boys Join This Girls Community.
This is the group in which you can introduce you self. Make new friends . And submit your bio data with name phone no. address, religious and other information that you wanted to displayed publicly. And Find new friends. Join FriendzPalace for new friends all the information and other friends contact will send you. http://groups.yahoo.com/subscribe/FriendzPalacehttp://groups.yahoo.com/subscribe/FriendzPalacehttp://groups.yahoo.com/subscribe/FriendzPalacehttp://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace
[IdRO] Funny Pictures Of The Month! Not 4 Girls
Dear Users! http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun We are closing this group. And This is final Warning. Because of spam messages we are not able to remain your membership in this group. If you wanted to keep the membership than you have to join the alternate group. Click On The below link And join the group. If you wanted to get some best stuff in your inbox instead of spam messages. Than Please don't wait and click on the link below and join it. This group will Close and this is the last warning to all the group members. So please click the link below and get the membership of this group. Where all of your messages will approve. And you can sent and receive the quality mails. http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun http://groups.yahoo.com/subscribe/hitfun Thanks Regards, Owner Group [Non-text portions of this message have been removed]
[IdRO] All Boys Join This Girls Community.
This is the group in which you can introduce you self. Make new friends . And submit your bio data with name phone no. address, religious and other information that you wanted to displayed publicly. And Find new friends. Join FriendzPalace for new friends all the information and other friends contact will send you. http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace [Non-text portions of this message have been removed]
[iklan-investasi] All Boys Join This Girls Community.
This is the group in which you can introduce you self. Make new friends . And submit your bio data with name phone no. address, religious and other information that you wanted to displayed publicly. And Find new friends. Join FriendzPalace for new friends all the information and other friends contact will send you. http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace [Non-text portions of this message have been removed]
[IndoCareer - Execufinder Labor provider] All Boys Join This Girls Community.
This is the group in which you can introduce you self. Make new friends . And submit your bio data with name phone no. address, religious and other information that you wanted to displayed publicly. And Find new friends. Join FriendzPalace for new friends all the information and other friends contact will send you. http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace [Non-text portions of this message have been removed]
[job-studenti.ro] All Boys Join This Girls Community.
This is the group in which you can introduce you self. Make new friends . And submit your bio data with name phone no. address, religious and other information that you wanted to displayed publicly. And Find new friends. Join FriendzPalace for new friends all the information and other friends contact will send you. http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace http://groups.yahoo.com/subscribe/FriendzPalace [Non-text portions of this message have been removed]
[ DUNIA-MUSLIM ] Xclusive Of Carlton Chicago Hidden Cam
Ritz Carlton Chicago, a Four Seasons Hotel Click Here For Detail http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html __ When are you planning to travel? Click Here For Detail http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html __ Trophy Hotels above US$ 1.000 pN minimum price Click Here For Detail http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html __ Sexiest Hotels Click Here For Detail http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
[IdRO] Xclusive Of Carlton Chicago Hidden Cam
Ritz Carlton Chicago, a Four Seasons Hotel Click Here For Detail http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html __ When are you planning to travel? Click Here For Detail http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html __ Trophy Hotels above US$ 1.000 pN minimum price Click Here For Detail http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html __ Sexiest Hotels Click Here For Detail http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
[IndoCareer - Execufinder Labor provider] Xclusive Of Carlton Chicago Hidden Cam
Ritz Carlton Chicago, a Four Seasons Hotel Click Here For Detail http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html __ When are you planning to travel? Click Here For Detail http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html __ Trophy Hotels above US$ 1.000 pN minimum price Click Here For Detail http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html __ Sexiest Hotels Click Here For Detail http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
[grosir_komputer] History Of Renault (1981-95)
History Of Renault (1981-95) (1996-99) Click Here For Complete Detail http://autorange.net/history-of-renault-1981-95-1996-99-t130.html __ History Of Renault (1972-80) Click Here For Complete Detail http://autorange.net/history-of-renault-1972-80-t129.html __ History Of Renault (1939-71) Click Here For Complete Detail http://autorange.net/history-of-renault-1939-71-t128.html __ History Of Renault (1919-38) Click Here For Complete Detail http://autorange.net/history-of-renault-1919-38-t127.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail.
[grosir_komputer] Xclusive Of Carlton Chicago Hidden Cam
Ritz Carlton Chicago, a Four Seasons Hotel Click Here For Detail http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html __ When are you planning to travel? Click Here For Detail http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html __ Trophy Hotels above US$ 1.000 pN minimum price Click Here For Detail http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html __ Sexiest Hotels Click Here For Detail http://tourism.activefun.net/sexiest-hotels-t830.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail.
[iklan-investasi] History Of Renault (1981-95)
History Of Renault (1981-95) (1996-99) Click Here For Complete Detail http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html __ History Of Renault (1972-80) Click Here For Complete Detail http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html __ History Of Renault (1939-71) Click Here For Complete Detail http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html __ History Of Renault (1919-38) Click Here For Complete Detail http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
[iklan-investasi] Xclusive Of Carlton Chicago Hidden Cam
Ritz Carlton Chicago, a Four Seasons Hotel Click Here For Detail http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html __ When are you planning to travel? Click Here For Detail http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html __ Trophy Hotels above US$ 1.000 pN minimum price Click Here For Detail http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html __ Sexiest Hotels Click Here For Detail http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
[job-studenti.ro] Xclusive Of Carlton Chicago Hidden Cam
Ritz Carlton Chicago, a Four Seasons Hotel Click Here For Detail http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html http://tourism.activefun.net/ritz-carlton-chicago-a-four-seasons-hotel-t834.html __ When are you planning to travel? Click Here For Detail http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html http://tourism.activefun.net/when-are-you-planning-to-travel-t833.html __ Trophy Hotels above US$ 1.000 pN minimum price Click Here For Detail http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html http://tourism.activefun.net/trophy-hotels-above-us-1-000-pn-minimum-price-t831.html __ Sexiest Hotels Click Here For Detail http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html http://tourism.activefun.net/sexiest-hotels-t830.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
[ DUNIA-MUSLIM ] History Of Renault (1981-95)
History Of Renault (1981-95) (1996-99) Click Here For Complete Detail http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html __ History Of Renault (1972-80) Click Here For Complete Detail http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html __ History Of Renault (1939-71) Click Here For Complete Detail http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html __ History Of Renault (1919-38) Click Here For Complete Detail http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
[IdRO] History Of Renault (1981-95)
History Of Renault (1981-95) (1996-99) Click Here For Complete Detail http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html http://autorange.net/history-of-renault-1981-95-1996-99-t130.html __ History Of Renault (1972-80) Click Here For Complete Detail http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html http://autorange.net/history-of-renault-1972-80-t129.html __ History Of Renault (1939-71) Click Here For Complete Detail http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html http://autorange.net/history-of-renault-1939-71-t128.html __ History Of Renault (1919-38) Click Here For Complete Detail http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html http://autorange.net/history-of-renault-1919-38-t127.html __ Join ActiveFun For 100% Entertainment. The Best Group Of Yahoo! http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun http://groups.yahoo.com/subscribe/activefun This email is not send to individuals. This is Post in Group. If you are receiving this message via email it means you are subscribed to a Yahoo group and have requested to receive individual e-mail. If you no longer wish to receive emails than edit your membership to no e-mail. [Non-text portions of this message have been removed]
