Search:
Type: Posts; User: SamstaUK
Search:
Search took 0.03 seconds.
-
December 7th, 2012, 09:19 PM
I have identified the bottleneck in my code, and I was hoping for some advice on how to get the code running more quickly/efficiently.
for(s = 0; s < start.size(); s++){
inc =...
-
November 22nd, 2012, 01:14 PM
Thank you, I didn't realise it was that straight forward! :)
Here is the code in case anyone else needs to do something similar:
#include <iostream>
#include <boost/thread.hpp>
using...
-
November 22nd, 2012, 11:32 AM
I was wondering if it was possible to access data from an array inside a threaded function after it has finished executing?
Take this example:
#include <iostream>
#include...
-
August 29th, 2012, 10:56 AM
I'm attempting to recreate the project shown here, using perl and GD: http://rogeralsing.com/2008/12/07/genetic-programming-evolution-of-mona-lisa/
Here is a link to my code:...
-
Thank you for the monte carlo suggestion, I'll have a read about it :)
I'm using a sort of hybrid technique, I'm getting *really* close now, only 1 number is off, but still no solution.
What...
-
I'm trying to create a self enumerating pangram, here is an example of one:
I've tried two different approaches.
The first approach was to generate a sentence with random numbers. I would...
-
June 13th, 2012, 07:06 PM
I am trying to run this code:
(NOTE: This code will start a bind shell on port 1337 if you get this working, so don't leave it running!)
section .text
global _start
_start:
xor eax, eax
-
Sorry, I was trying something else before I posted this and forgot to change it
-
I want my function to return the type mpz_t, but I'm not sure how?
I've tried:
mpz_t MyFunction(mpz_t A, mpz_t B){}
But it didn't work, here is my code so far, I have bolded the parts of the...
-
Hmm, I've started using even bigger numbers and now it's working again.
Mods can delete this thread.
-
I have been writing a program to generate pairs of RSA keys using small prime numbers. I have been using mpz_invert() to get a value for d for the private key. On small prime numbers it calculates...
-
I'm wanting to create an image, all I need is to be able to set RGB values and X-Y coordinates, I'm not wanting to read or manipulate images.
I was hoping someone could recommend an easy to use...
-
I was trying to get onto project euler the other night but there was an error on the website, I will check them out, thank you :)
-
There have been some programming exercises I have done which I've found really interesting, and was hoping for some suggestions on some more exercises I could try out.
The ones which I have...
-
It wont have values that high unless I'm checking the highest prime numbers which have been discovered, it's nice to be prepared though :)
Here is the function using GMP, I would estimate it's...
-
I was wondering if I should post my solution or is it unlikely someone will have the same problem as me?
-
I have this code which previously used the BigInteger library, however now I have GMP installed and I want to use that instead.
I have read the manual but I cannot figure out how to use GMP in...
-
How does GMP compare to python in terms of speed? Python can calculate 2 to the power of 100,000 in 1 second, would GMP have the same or better performance?
-
Is there an easy way to embed python in C/C++?
I'm using visual studio 2010, and the performance of the BigInteger library is really slow compared to how python handles large integers. Is there a...
-
I looked into multithreading but it looked far too complicated for my to tackle right now, I've only been learning C++ for about 1 week.
Unless there is an easier way of creating threads?
-
I got it down to 8.3 seconds, thank you :) It's still faster on my laptop than a server with 2 quad core processors for some reason though!
How complicated would making this program use multiple...
-
1 - It was formatted correctly when I pasted it from notepad++, however after posting all the tabs have been removed
2 - I'm using visual studio 2010
3/4 - I'll fix those and post back with the...
-
Okay I ran the program 5 times, here is the average time for calculating pi to 10000 decimal places:
Run 1: 13.744
Run 2: 13.806
Run 3: 13.526
Run 4: 13.838
Run 5: 13.791
Avg: 13.741...
-
I made a program which finds the prime numbers from 0 to 100 million, and ran it on my laptop (core 2 duo, 1.83ghz, 2gb ram).
It takes around 35 seconds for it to sieve all the non-prime numbers...
-
I'm new to C++, and as an exercise I created a program which calculates pi to n decimal places.
It works, but I want to make it go faster, at the minute it calculates 10,000 digits in around 13...
|
Click Here to Expand Forum to Full Width
|