I am trying to generate some lists of permutations of ints but I can't make std::next_permutation work for me. The problem is I need to include permutations which don't use every number. For example take the array of numbers [1, 2]. I need an algo that will return:
1
2
12
21
Must work with up to 8 numbers.
I know how to generate all permutations of a list like: {'h','e','k','p'}
But I am needing to know how to generate all permutations like: {{'a','b'}, {'h','k','d'}, ..... } such that the first character is either an 'a' or a 'b' and the second character is one of the three in the second list, etc. There will be less than 600 000 permutations.
I've a big problem. I'd like to generate of all permutations of objects present on my list and i don't know how to do this. I've found a few examples, but i can't use them in my code...
#include <iostream>
#include <string>
#include <list>
#include <fstream>
#include <cstddef>
#include <cstdlib>
#include <iterator>
using namespace std;
class Item {
private:
[Code]...
Input file with objects:
3
2 0 0 4
5 0 1 5
3 0 2 6
and output should be:
2 0 0 4
5 0 1 5
3 0 2 6
2 0 0 4
3 0 2 6
5 0 1 5
3 0 2 6
2 0 0 4
5 0 1 5
etc... 3! so 6 permutations for this example.
I was 'fighting' with this for few days, and I'm so downcast.
I am getting a string from the consle and that all works fine. I'm expecting a string of number, ie 123456.... I store that fine in my string object. I then need to take each individual number, ie 1, and put it in a vector then take the next number, ie 2, and put that in the next element in my vector.
Everything i've found and does eaither takes the entire string and stores it as an int, or takes the ascii representation of the number and stores that. How do I seperate each individual number and store them seperatly. below is a few different variations i've tried that doesn't produce my desired results.
cout<<"Please type the memory memory frames (numbers 0-9) to be used to simulate the input memory "<<endl;
cout<<"Your input: ";
string line="";
cin>>line;
cout<<"
Please wait while your input is processed and validated..."<<endl;
[code].....
the only thing i havn't tried yet is string streams and i don't necessarly like using them. Am i going to have to go that route? will that even work?
EDIT:I forgot to mention that this is being done on linux and then ported to unix.
We are considering a word C containing only lowercase. An anagram of the word C is a word formed by the letters of C in another order eventually. E.g.
'armata' is an anagram of the word 'tamara'
but 'maree' is not an anagram of the word 'amare'
A word is an angram of itself.
Determine the number of different anagrams that a word has. Because this number may be very high, there will be posted its decomposition into prime numbers
The input file anagrame.in contains the word C.
The output file anagrame.out will contain the decomposition into prime numbers of the number of anagrams of the word C. On each line there will be a prime factor followed by one space and then its multiplicity(power). The factors will be written in ascending order.
0 < the length of the word <= 1000
e.g
anagrame.in
amar
anagrame.out
2 2
3 1
anagrame.in
informatician
anagrame.out
2 7
3 4
5 2
7 1
11 1
13 1
I need to find all the possible permutations of a list and I am completely stumped. The specification for the function is:
void allPerms(intListType *toOrigList, intListType *answer)
where *toOrigList is a pointer to a list and *answer is an array of lists. intListType has several member functions and I will post them if you want them, but for the most part they are barely used in this function (which is not a member function). I'm having trouble outputting the permutations because the program keeps crashing. I cannot change the specification of the function. Anyway, here is what I have of the function so far:
#include "allPerms.h"
#include <string>
#include <cstddef>
#include <iostream>
using namespace std;
void allPerms(intListType *toOrigList, intListType *answer)
//Pre: list is not empty
//Post: computes all permutations of a given list
[Code] ....
I have been trying to write a recursive function to print the permutations of a n-digit number. This is the logic that i am trying to use.
1.call the permutation function,
2.keep the first digit in the first place and send the remaining 2 digits back to the permutation function recursively.
3.keep one of the two digits received and send the remaining digit to the permute function.
4. keep doing this till only one digit remains. this is the smallest solution so return it.
I can't seem to figure out the algorithm to find the right permutation(s) of operands and operators.
We basically have a list of 6 unsigned integers. Using arithmetic operations (addition, subtraction, multiplication, division), find the arithmetic expression that evaluates to a target integer.
Example:
myIntegers = {3, 7, 8, 10, 50, 100};
trgtInt = 315;
Solution is (50 + 10) * 7 - 100 - 8 + 3
We also have the following conditions:
1) Each number from the list can be used only once, but does not have to be used. i.e an expression with 5 or less numbers is acceptable
2) Operators can be used multiple times
I am thinking a parenthesis-free notation like Polish or Reverse Polish notation should be used.
This is my program, for now it is intended to compute permutations of any string entered, but the function ox will not return the final x value. ox is the function that actually computes the permutations so the return of the x value is critical.
Code:
#include<stdio.h>
#include<string.h>
int ox(int x);
int main() {
int x;
char input[10];
[Code] .....
Given a stack with an equal amount of even and odd numbers: 4, 22, 15, 3. The output should be in any order: [even], [odd], [even], [odd].
int main() {
Stack<int, 4> stk; stk.ClearStack(); int x;
for (int i = 0; i < 4; i++) {
cin >> x;
stk.PushStack(x);
[Code] ....
Output is:
Wed Feb 19 20:09:10 2014
4 7 5 22 //input
22 5 4 //output
Press any key to continue . . .
I know the logic fails if the first number is not even, but I cant seem to figure out another way to do it.
I have some paper work to do about a game I should be able to play with my class mates. We should be able to send and recive a struct concerning about the 'moves' of the pieces at the game. This struct is made of 4 ints, simple as that.
I had a previous paper work to do where I'd have to send ints and that was ok, but now that I have to send a struct I'm failing to do so. This is What I've tried:
//SERVER
struct message{
int code;
int piece;
int x;
int y;
}send;
bytes_sent=write(new_socket,&send,sizeof(message));
cout<<bytes_sent;
So far so good, I see 16 as bytes_sent's value.
On the other hand:
//CLIENT
struct message{
int code;
int piece;
int x;
int y;
}recive;
bytes_recvd=read(my_socket,&recive,sizeof(message));
cout<<bytes_recvd;
I always see 0 as the bytes_recvd's value.
I have gotten it to record the date and I can printf it either on the same function, or in the main(). However, one of the requirements I must adhere to is to printf the statement in a brand new function, but when I do that, it just doesn't work. Heres what I mean:
Code:
#include <stdio.h>
#define TICKER "LRCX"
#define INVESTMENT_AMOUNT "10,000.00"
//Prototypes
int getdate(int* month1,int* day1,int* year1,int* month2,int* day2,int* year2);
float getprice(float* BPrice, float* SPrice);
void printdate(int month1, int day1, int year1);
}
[code]....
I'm having trouble making a .obj loader at present I'm trying to load faces that are defined as follows:
f 1/1/1 2/2/2/ 3/3/3
So far I've separated the the three number groupings into three strings, I've had a few issues with stringstreams and would like a simple solution.
At first i had my int variables in global scope however i cant do the so im trying to pass my variables from my main to the void functions but cant.....
View 1 Replies View RelatedI am trying to figure out the larger 2 out of 3 integers when i call them into a function from main program so far i have . How to write a simple function that will take 3 ints and find the sum of the higher 2?
Code:
int findsum(int a,int b,int c)// will find the highest int and return it to our main program {
int max,max2;// this sets our local variable max
// next we will find the larger of our first 2 variables
if( a>=b)
[Code]....
How to get the second highest number and add it to max...
I'm supposed to create a program that will find the min/max values of two ints, doubles, and chars, It's not completely done but here's what I have so far.
It's giving me an Error 1 error LNK2019: unresolved external symbol "public: __thiscall MinMax<int>::MinMax<int>(int,int)" (??0?$MinMax@H@@QAE@HH@Z) referenced in function _mainC:UsersDerickDesktopCiss243Week3 Assignment2Week3 Assignment2Main.objWeek3 Assignment2
Header file
#ifndef MINMAX_H
#define MINMAX_H
#include <iostream>
using namespace std;
template <class T>
class MinMax
[Code] ....
I don't know why the site is adding in extra bits of code like /> in certain areas, it's not there when I paste it in and it's not in my code ....
I have been trying to figure this out for a text based game. Lets say your money is 500. Then you save your game, but when you start the game the starting is 50, so when you load it, you still have 500 money, I tried lots of test, and im having trouble?
View 10 Replies View RelatedThe code is supposed to take either an int or a string (and their respective vectors) and insert a given int or string into the vector in ascending order. My code works properly for ints, but it's having a problem with strings.
The order I get with the strings given is
penguin
banana
great
jungle
For some reason comparing penguin to banana/great doesn't give the expected result. The template attached only includes the function and the private vectors needed for the function.
template<class T>
class orderedList {
public:
void insert(const T& item);
private:
vector<T> list;
int total = 0;
[Code] ....
I have saved the contents of an int vector to a txt file and the numerical data was converted into a c-string. Nov I need to import and read the contents back into my program but I have not been able to convert c-string numerical data back into ints.
View 1 Replies View RelatedI'm trying to write a program to sort 2 ints on ascending/descending order, using function pointers. here is my code so far:
Code:
#include <stdio.h>
#include <stdlib.h>
int min_el(int a,int b);
[code]....
I am working on an assignment to create a Complex number calculator. In this assignment I am to ask the user for input to the calculator. We are given a sample run output that looks like this.
Enter operand1: 3 4
operand1: (3, 4)
Enter operation : +
Enter operand2: 1 2
(3, 4) + (1, 2) = (4, 6)
My question is how would I take from the user: an integer followed by a space followed by another integer and convert that into two seperate accessible int values that I can save as real and imaginary values.
I have this:
Code:
for (chr_min = 0; chr_min <= 24; chr_min += 3) {
strOut = "";
for (ctr_row = 1; ctr_row <=3; ctr_row++) {
switch (ctr_row) {
case 1:
strOut = strOut + Line1.substr(chr_min, 3);
[Code] ....
it is outputting to the shell window, this:
Code:
1
1
1
2
2
3
and that pattern apparently repeats for every iteration that's specified in the outer loop. am I missing something here?
I got a permutation question, I got two different std::list:
list<string> slist;
slist.push_back("str111");
slist.push_back("str222");
slist.push_back("str333");
list<int> ilist;
ilist.push_back(100);
ilist.push_back(200);
I need the permutation for both two lists, the result should be like this:
#include <iostream>
#include <string>
#include <list>
#include <algorithm>
using namespace std;
template <typename value_t>
void dump_list(const list<value_t>& lst) {
[Code] ....
See, there are two do while loop, if I need a permutation with more than two lists, there'll be more and more do-while loops, that's make code looks ugly, I wonder if stl has some tricky way that can do this with just one next_permutation.
I'm trying to set up a simple implementation of a double linked list. I can't make it fly.
Code:
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
[Code] ...
I seem to create a root vertex, but I can't establish if I connect sub nodes to my list.
I am merging two linked list but the output of the program is not printing insert
Code:
typedef struct Merge
{
int info;
[Code].....
In our homework assignment it states to, "write a set of dynamic linked lists" and so on. Now, the problem I'm confusing myself is at the storage inside of each node. To my understanding, each node contains the prev and next nodes, but also a pointer to the data, in this case being a string. He has asked us to manage these strings as rows of chars such as
char[0] = c // first node being addressed here
char[1] = a
char[2] = t
char[3] =
char[4] = d // second node starting here
char[5] = o
char[6] = g
char[7] =
I have written my code where each node is holding a string, not separated as shown above... my question is to how you can build your doubly linked list where each node is being address a set of chars.
