I am trying to write a program that checks whether the number is in sequence(as in if the numbers are in order it is a sequence). Ex: If the numbers are {1,2,3,6,7,8,9,10,11,13,15,17,20,21}, then, the underlined parts are a sequence. Now i want to find
1) the no of sequence in the array(in the above it is 3 )
2) the longest sequence (7to 11 which is 5).
I have to write a program to find the nth number of the Ulam numbers.
It's a bit complicated to explain what an Ulam number is but Wolfram explains it very well here: [URL]
I have to find the nth Ulam number but I don't know what I have to do to get that. My program gives me all the Ulam numbers from a range of 0 to n.
What I want the program to do is tell me that the 49th Ulam number is 243.
/*
C++ Program to find nth Ulam Number
*/
#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int num = 0;
vector<int> v;
[code]....
The next code is right. I mean it works. It gives the sequence of fibonaci numbers ...
Code:
#include <iostream>
#include <iomanip>
using namespace std;
int fibo(int pos) {
if(!pos)return 0;
if(pos==1)return 1;
[Code] .....
But.... when I change the lines:
Code:
int r1=fibo(pos1);
int r2=fibo(pos2);
int r=r1+r2;
For the lines:
Code:
int r=fibo(pos1)+fibo(pos2);
It doesn't work right. Apparently it should work the same.
I'm saving the images in folder by using:
webClient.DownloadFile(href, sourcepath);
I don't want to give name as Current date and time..shown in given below code
string sub = @"Gadhada";
DirectoryInfo subFolder = dir1.CreateSubdirectory(sub);
Imagename = DateTime.Now.Year.ToString() + DateTime.Now.Month.ToString() +
[Code].....
I want to save my imagename as 1.jpg, 2.jpg, 3.jpg.
I was trying to create a code to calculate the nth number in a Fibonacci sequence, when the nth number is entered interactively.
View 4 Replies View RelatedI need to implement the fibonacci number sequence. Here is an example output of the program:
Server:Waiting for connection
Server:Receive connection from client
Client:10
Server:Print 10 Fibonacci
Server:1 1 2 3 5 8 13 21 34 54
Client:1 1 2 3 5 8 13 21 34 54
if Client send value of 5, the output would be 1 1 2 3 5
When ever I enter a value higher than 10, my out put looks like this
How many numbers are in the Fibonacci Series? 20
0 0 0 0 0 0
0 0 0 0 34 21
13 8 5 3 2 1
1 0
Press any key to continue . . .
This is what I got when I entered the value 20.
As you can see, it will only display up to the 10 term of the Fibonacci sequence
I'm trying to get the output to look like this:
4181 2584 1597 987 610 377
233 144 89 55 34 21
13 8 5 3 2 1
1 0
Here is my code:
#include <iostream>
#include <iomanip>
using namespace std;
#define SIZE 20
void Fibonacci( int );
int main( ) {
cout << "How many numbers are in the Fibonacci Series? ";
[code].....
I have to made a programme which will search for given number and it must work in O(log(n)). The problem is that this programme beside finding this number have to find how many times this given number is used in this sequence.
Sequence is from lowest to highest only one possibility to use binary search algorithm
For example when we have squence
-1 -2 3 3 3 3 4 5 6 7 7 8 9 9 9 9 10
The numbers we need to search are
1 , 3 , 7 , 9 , 11 , 12
The answer is
0 , 4 , 2 , 4 , 0 , 0
So we need to find the sum of used number in sequence.
I have written algorithm Code: int start = 0;
int end = sequencelenght - 1;
int mid = 0;
/// Binary serach
while (start<=end) {
int mid=(start+end)/2;
if (sequence[mid]==givennumber) {
[Code] .....
As u see i search for given numer with binary with O(log(n)) but when i have to sum the duplicates the only good way i see is using loop to right and left but this have got log(n) specification (because when sequence would be for example 7 7 7 7 7 7 7 7 7 and given number to search will be 7 this will be O(n) loop).
How would look the most optimal algorithm look for this exercise? I mean O(log(n)) the fastest algorithm....
I was doing a side project from my textbook about finding the mode, which is the number that occurs most often in a sequence of numbers. I racked my brain on this for an embarrassing amount of time and finally came up with this, which I think works but for some reason I still feel like I'm not done.
#include "stdafx.h"
#include <iostream>
using namespace std;
void mode(int *, int);
void main() {
const int NUMBERS = 15;
int list[NUMBERS] = {99,73,56,14,28,42,93,64,51,26,56,16,38,81,98};
mode(list,NUMBERS);
[Code] ....
Console Output:
Final Mode 56
Press any key to continue . . .
There it is, I would have commented more but I couldnt think of the right words to explain everything.
write a program in c to read a sequence of N integers and print the number that appears the maximum number of times in the sequence.
View 1 Replies View RelatedTrying to make a program that stores a sequence of integers in an array by using functions. This is my code so far:
# include <iostream>
using namespace std;
int Sequence_Length(int seq_length)
{
[Code]....
I get an error in the main, not completely sure how to "call" functions to the main..
unsigned char x1, x2, x3;
size_t ix = 0;
size_t count;
std::string Input = "EFEF9E9475C8C2D938C204EAE058F2B3";
[code]....
when debug and have a watch on out i get incomplete sequence,
Code:
int main()
{
int n;
int* fib;
printf("
Fibonacci test 1: enter an integer
");
scanf("%d",&n);
fib = fibonacci(n);
printf("fib(%d) = ", n);
for(int i = 0; i < n; ++i){
printf("%d ", fib[i]);
}
What should I do/write for the fibonnaci function Code: int fibonnaci(int size)
I made a fibonacci series with label above it now how to put the label after the first layer because as you can see in the screenshot the label is continuous.
View 2 Replies View RelatedWhy is it that in the STL it is standard to indicate a sequence of elements in a container by a begin iterator that points to the first element and an end iterator that points to one past the last element?
View 2 Replies View RelatedMy assignment is to write a program that reads in a number from the user and then generates the hailstone sequence from that point. I'm not sure if I should use an if statement or string loop. The beginning of an attempt
#include <iostream>
#include <vector>
#include <string>
using namespace std;
vector<string> Numbers;
/// if n is equal to 1 the sequence has ended
/// if n is even divide the number by 2
/// if n is odd, multiply by 3 and add 1 to new number
[Code] ....
I made a program that prints out arithmetic sequence.. but problem is that,
when I enter a(first term) =5, d(differnce)=2.4 and n=3 the program prints out only first two terms not three.. for all the other numbers it works correctly..
Q) How to do nested loops?
Q) How to do Array?
Q) How to do Fibonacci sequence?
I'm doing some file input/output work here in C and received this warning during compilation (GCC). My research indicates that this error is in response to white space or a character cancellation function or something like that. I'm not 100% sure exactly what it means. My code works fine, but the following warning does appear.
Code:
warning: unknown escape sequence: '40'
Here's my code (excluding a bunch of comments at the bottom of the file).
Code:
#include <stdio.h>
int main(void){
FILE *file;
file = fopen("Running Practice.c", "a");
fprintf(file, "Testing...
");
fclose(file);
}
I believe the error I received has to do with either the ' ' I used when appending text to my file, or something to do with there being a space in the file name itself.
A sequence point in a C program is defined as "Any point in a program's execution at which it is gauranteed that all side effects of previous evaluations will have been performed and no side effects from subsequent evaluations have yet been performed."
What is a side effect?
Write a C program that calculates the sum and average of a sequence of numbers. Assume the first number specifies the number of values remaining to be entered. If the first number is less than 1, then the program should display an "Invalid Entry ... Please enter a positive number." message.
THIS IS HOW IT SHOULD COME OUT...
Enter the number of values to process 0
Invalid Entry ... Please enter a positive number.
Enter the number of values to process 3
Enter 3 numbers:
1
2
3
Sum: 6
Avg: 2
THIS IS THE CODE I HAVE SO FAR...
#include <stdio.h>
int main(void) {
int total=0;
int howmany;
int i;
int value;
[Code] ....
my data structures and algorithms professor gave us the following assignment. We are to reimpliment a class we wrote earlier in semester called sequence(which holds a sequence of floats) using a linked list. However I am having trouble with the class's copy constructor and assignment operator, specifically when the sequence is not empty.
links to google drive files
node
node header file
test program
sequence implmentation
sequence header file
Write a program that gets a sequence of unsigned integers.the user can enter at most 100 integers.
After getting the numbers, the program allows the user to repeatedly choose one of the three options:
1. swap the location of two entries in the sequence. if this option is chosen the user is prompted to enter the two locations to be swapped.
2. print out the sequence.
3. repeatedly swap two locations in the sequence until getting back to the state before this operation started. then print out the number of swaps performed.
The following is a part of a hailstone cpp program. I want to write an option to let users enter 2 numbers and the program evaluates the longest sequence the number has within the 2-number range and return the count.
Code:
int longestHailstoneSequenceLength(int start, int end)
{
int max = 0;
int s= start;
while (s!=1)
[Code] ....
Code:
#include <iostream>
using namespace std;
int j;
int n;
int recursive ( int arr[j] );
int main() {
int i;
int arr[10000];
[code]....
This is how I tried making the program..
I want it with a recursive function
I want if the sequence is non decreasing return true else return false
Given a set of DNA string. Find minimum length string S so that, given DNA strings are subsequence of S.
For example, if given set of string is: {CAGT, ATGC, CGTT, ACGT, AATT} then answer is: 8. Because, ACAGTGCT contains all given DNA as subsequence.
Given n such DNA string (n <= 8), each of length atmost 5. Find out the least length.
Sample:
5
AATT
CGTT
CAGT
ACGT
ATGC
Output:
8