I'm dealing with data that stores its state as a String, treating the string like a stack. I also have to combine that with error handling. To that end, I'm using the type StateT String Maybe a. I have a function to pop and to push a Char from and to the string: pop :: StateT String Maybe Char ...

The program is finding the number with the greatest number of divisors and lowest value. I have been working on it for about 7 hour and it keep saying "Time Limit Exceed", so I'd like to show me how to optimize it. I've written 2 programs for this: #include<iostream> #include<string> #include<

Each class should contain: One or more instance variables. One or more of the instances variables should be assigned a default value. One or more functions that displays the value assigned to the instance variables. I want the class to be named Statistics

The Help page suggest that if a question received no answer the poster should: Edit the question to provide status and progress updates Document continued efforts to answer the question Offering a bounty I opened this question, I think it has all the qualities of a good question It's on top...

so these are three methods that are part of a bigger program. alg1 asks if a random letter between A-Z are part of your name, if its not it is put into an arraylist of wrong guesses to keep of the wrong guesses to avoid repetition. However, I have two problems with this, 1) when I press no, the d...

I'm starting to learn OOP with PHP, all I've learned so far is just by searching and reading. So I have this need to check input data for certain things, like, min of chars, max of chars, spaced or not spaced, just letters or not. So far I've just created the alpha() method wich is just for lett...

I was trying to solve a problem which needed you to count the number of perfect square in the given range. This is the code I have written in C. #include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int isPerfectSquare(int x) { float s = sqrt(x); if (fmod(s,1) ==0...

Here is the code I use for implementing Dijkstra's algorithm. Consider a graph with n vertices and m edges. Shouldn't it run in O(n^2 m) ? Someone may say that there are n vertices and each edge gets processed once, therefore it is O(nm). But the while loop can run at most n times, the 1st for lo...

I am about a month into learning Java and I'm just looking for some comments on my code. Specifically, I would like to know if I'm being as efficient as I can be. This is the most complex thing I've come up with so far (that works) and I wanted some feedback on my developing coding style. Than...

Is it possible to make the hexStr function faster? #include <sstream> #include <iomanip> #include <stdio.h> std::string hexStr(unsigned char* data, int len) { std::stringstream ss; ss << std::hex; for(int i=0;i<len;++i) ss << std::setw(2) << std::setfill('0') << (int)data[i]...

This is my first that i used classes. How could this be improved? #include <iostream> class TicTacToe { char m_field[3][3]; char sign; public: char Sign(char x) {sign=x;}; void MakeField(); void DrawField(); bool IsFree(int...

This is the follow up version of a previous question on combining different categories and their properties. The home page contains the overarching company information. The product page contains product information and links to the home page. I do not get any error messages in Google testing to...

Hi I wrote this code for android server interaction. the way I built the client was an onSharePreference of strings includes photo encoded to a base 64 String object {imei , barcode0, barcode1, photo0, photo1, time_taken0, time_taken1,..} because I had the possibility the user won't be connected ...