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 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 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'm trying to solve the following problem:
Given a query, find all possible tokens, i.e. query-splits
Example:
query = New York Hotel
tokens = {New, York, Hotel, New York, New Hotel, ...., New Hotel York, Hotel New York, ...}
Given a query with word count n, the total number of tokens is:
n + n*(n-1) + n*(n-1)*(n-2) + ... + n! (any explicit formula available for this sum?)
Now, I have came across various code snippets to generate permutations for a string, but never for a sentence.
So my assignment requires us to write a C program to generate a list of powers of 3 where each output line lists three numbers: k 3k 3‐k
It should look like this (just pretend all the numbers are lined up in their respective columns)
1 0 1.0
3 1 0.333333343
9 2 0.111111112
27 3 0.037037037
81 4 0.012345679
243 5 0.004115226
729 6 0.001371742
2187 7 0.000457247
6561 8 0.000152416
19683 9 0.000050805
This is what I keep getting:
1 0 1.000000000
3 1 0.333333343
9 2 0.111111112
27 3 0.037037037
81 4 0.012345679
243 5 0.004115226
729 6 0.001371742
2187 7 0.000457247
6561 8 0.000152416
19683 9 0.000050805
My input:
Code:
#include <stdio.h>
#include <stdlib.h>
void powers(void) {
int i=0;
int n=9;
int x=1;
float h=1;
[Code] .....
Notice how I'm getting 1.000000000 for my first h value in my output whereas I should be getting 1.0. What am I doing wrong?
I need to create a list of all members of a struct using the sturct definition as input. The struct is NOT part of the program, but is the input to the program.
The struct that I am using changes over time as features are added. I need the complete, fully qualified field names to then generate a table with all names with their offsets, type and length.
This information then allows me to create readers of the data that will run on different architectures, compilers and operating systems.
The struct currently has 800+ lines and uses typedef and embedded structs.
Perhaps this could be done creating LEX, YACC, Perl, SED, AWK or other language system.
I am just starting out programming and have an assignment due in the near future. the problem is I cant seem to figure it out. I started it already but got stuck cant seem to figure it out. Here is the assignment.
Create a program that will generate a list of 200 random numbers (ranging from 1-1000) and determine the medium, mode, and average of the list of numbers. Have the program display the original list ant then display the list in ascending and descending order on the screen.
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 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] .....
I'm trying to generate random numbers so that I can assign people to teams. So far I have come up with this
Code:
int generateTeam(){
int i, teamNumber, c, n;
for (c = 0; c <= 5; c++) {
n = rand()%100 + 1;
}
[code]....
}//end generateTeam I'm not sure how to make it so that I can exclude the previous random number when generating the next one. As an example, I have 22 students and I get the number 19. Now I can't have 19 again because that guy already has it.
I am a very very beginner at programming with C. Well, basically i have to generate a real number between 0 and 1 (which as the same as from 0 to 100 k and than dividing everything with 100 k).
Why I am constantly talking about 100 k? Because I would need approx 50 000 random numbers between 0 and 1. My code currently looks something like this:
Code:
int main(int argc, char** argv) { int min,max;
double number;
srand((unsigned)time(NULL));
number = 1 + rand()%100;
printf("The number is: %lf",number);
sleep(2);
return (EXIT_SUCCESS);
}
And If I am not mistaken, should generate numbers between 0 and 100. But I can't figure it out how to change to code in order to get enough numbers.
Using loops that would generate the same results. I need to use a loop that would make the syntax less lengthy ....
Code:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
float check(float s);
void load(float*);
[Code] .....
Code: I have these two columns.
ID Group
0 2
1 2
2 3
3 4
4 4
5 4
6 4
7 4 Code: I want to store ID values on the bases of same Group, like we do in Hash table (key, value) .
Group ID
2 0,1
3 2
4 3,4,5,6,7
so when i said key 2 it will give me 0,1. how can i do it. As first i thought that i can use array of array but then how i can store the value of key. Now I am thinking of hash but i don't know how I will store and retrieve these values.
I just re-installed my OS some days ago,which contained Visual Studio.But I don't want to use the VS any more(at least in my computer) as the interminable installing process.Then I take Eclipse as my C/C++ IDE by MinGW and CDT. My Java program need to load an DLL file which wrote by C.But when I generating the DLL file,I got some errors.It seems that the compiler cannot find the header files. By the way,I just want to implement the hello-world program in C and invoke it in the Java program.This is my Java testing program:
Code:
public class HelloWorld{ public native void printHelloWorld();
static{
System.loadLibrary("hello");
}
public static void main(String[] args){
new HelloWorld().printHelloWorld();
}
}
And this is the header file generating by "javah HelloWorld":
Code:
/* DO NOT EDIT THIS FILE - it is machine generated */#include <jni.h>/* Header for class HelloWorld */
#ifndef _Included_HelloWorld
#define _Included_HelloWorld
#ifdef __cplusplus
extern "C" {
#endif
[code]....
I'm trying to write a program that generates a random number between 50 and 200. I made a program that generates random numbers, but how to make those random numbers be in-between 50 and 200. Any example of a program that generates random numbers that are confined in-between certain values?
View 1 Replies View RelatedI try to write my data into two different files and i just use something like this
ofstream myfile;
myfile.open("phase 1.txt");
if (myfile.is_open()) {
for(i=0;i<M; i++)
[Code] ....
But it only generate the first file. How should i modify this?
I am trying to generate two arrays from one big array, of which the sum of the 2 array's elements are as close to equal or equal to each other if possible, or one array summed up minus the second array summed up will be as close to zero as possible. I start with int array of 30.
It says that the lowest possible combination of one array minus the other is 239 which I know is not true. Also this needs to run in under ten minutes.
#include <iostream>
using namespace std;
const int size = 30;
[Code]....
I just can't seem to get this right. What I want to happen is when the program runs a random word should pop up.
I have included my code. I'm not sure by putting tag around my code.
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
[Code].....
I have an application thats has been coded in C#. After build it generates a standalone dll file and the exe file.
I want to use this code in Matlab. I found out from this page that I can load the C# classes or codes into Matlab.
dll_in_matlab = NET.addAssembly('location to the dll file)
I have the code and the application buty unfortunately I do not understand C# at all. So after using this command I was able to see a .NET object in my workspace and this is what I got for its properties and its classes:
evmaps =
NET.Assembly handle
Package: NET
Properties for class NET.Assembly:
AssemblyHandle
Classes
Structures
Enums
GenericTypes
[code]....
This is the application it produces: [URL] and here is the virustotal result for my application just to ensure that its clean. [URL] .....
Given a number "n" supplied by the user, write all the prime numbers less than or equal to "n"
not at all how to make the number I enter me for the numbers that I need even a couple makes the prime number if the command is used repeat for but and decision making but the truth is that I can think of no way to do for this exercise is that the prime numbers are those numbers which are divided only by 1 and themselves also
until the moment I have this code
#include <stdio.h>
#include <stdlib.h>
main(){
int n;
n=0;
printf("enter the desired number: ");
scanf("%f",&n);
system("pause");
}
The program is to generate random numbers to a file and will have one integer parameter, Open a file and then using a loop write the required number of random numbers to the file. Scale the random numbers from 1 and 100 inclusive. Then closes the file .The last function will read the numbers in the file into your program. so far i have
Code: #include <iostream>
#include <string>
#include <iomanip>
#include <ctime>
#include <fstream>
#include <cstdlib>
[Code] .....
I'm a beginner in C programming and I've got a task that can't finish it..I'm supposed to generate and print the subsets of a group that its size I should enter. Pointers are not allowed!!
View 1 Replies View Relatedso I'm creating a program that generates random sentences with structs..I'm trying to use structs and and create 4 different groupings article, noun, verb, and preposition. Then I'm trying to use "r = rand() % ;" to randomly pick one one word from each group to make a sentence. this is what i have
Code:
typedef enum article {
the = 1, a, one, some, any
} article;
typedef enum noun {
boy = 1, girl, dog, town, car
}
[code]....
