C++ :: Count Number Of Distinct Edges Using Set Based Algorithm
Sep 8, 2014
So I have this set
13
14
24
31
62
35
36
42
13
44
62
now using sba or Set Based Algorithm I have to pair it out and towards the end find the size of the resulting set
#include <iostream>
#include <set>
int main()
[Code]......
this is the code just reads the edges that's 3... that is when we input the code. But what if its in a file? how do I read from there and show the paired count and the time taken?
Also I have the file that works and reads any txt file..but how do i get the code from it?
[URL]
this is the file..you have to run it as ./edgecount for it to work
View 1 Replies
ADVERTISEMENT
Mar 5, 2014
I am trying to write a function that will count the number of distinct values in an array of N size and return that number. For example array a[n] = {1, 2, 3, 1, 2, 3, 1}. My code won't look exactly like this because I am using an array that can be modified by user input. it is part of a bigger program that will also has a function for finding the Equilibrium Index for that same array. This is what my Code looks like:
void findDistinctValues() {
int t = 0;
int j = 0;
int disValue = 0;
for( i = 0; i < arraySize; i++) {
[Code] .....
This function works but the problem is it returns 16, or the number of times that the number being compared does not equal the one it is being compared to. how do I get it to only return the number of distinct values? The data set mentioned above is what I am using for input data so it should only have 3 values.
View 9 Replies
View Related
Sep 12, 2013
I'm trying to calculate the number of distinct values entered into an array. If i enter the followings "3,4,5,6,7,7,6,e (anything that's not a number)" . I get a total of 7 but in reality it should be a 5.
Code:
#include <stdio.h>
//---------function to find the distinct values----
int find_distinct(int list[], int size)
{
int i, j,size2, distinct = 0;
for(i = 0; i < size; i++)
[Code]...
View 9 Replies
View Related
Sep 3, 2014
Suppose you have defined a container of elements and you want do define a comparison function between elements based on the ordering of the elements in that container. What algorithm for the comparison would be the most efficient?
Example:
master = {tom, sam, mary, sally, bert, frank}
subset = {bert, sam, mary, tom}
goal: change subset to {tom, sam, mary, bert}
My current idea is to simply iterate from the beginning of the container, and whichever of the two elements is found first is the lesser (assuming the second is not the same as the first). It seems kind of naïve though. Any better performing algorithm? This is what I have so far:
#include <iostream>
#include <iterator>
#include <list>
#include <vector>
#include <stdexcept>
#include <algorithm>
[code]....
Would perhaps forcing the container to have a random access iterator, like vector, and then writing a specialized comparison function based on that perform even faster? Or perhaps force the container to be a map to integers, and compare the elements by comparing the integer mapped values?
View 19 Replies
View Related
Oct 5, 2014
I just don't understand how you would have it count how many negatives and positives there are based on the user's input? Here's the problem and the code it provides:
Modify the program so that is displays the average of the positive and negative numbers. (Hint: be careful not to count the number 0 as a negative number.)
Code:
#include <stdio.h>
#define MAXNUMS 5
int main() {
int i;
float number;
float postotal = 0.0f;
float negtotal = 0.0f;
[Code]...
View 6 Replies
View Related
Feb 6, 2014
In this program what i'm doing is to search for a number when the vector is in order, and count how many times that number appears, the problem is that count how many times the number does not appear, but when its appear the program stays in an "standby mode" and the cursor does not move.
int buscarNumOrdenado (int x [MAX]) //MAX is the define {
int num,d, LimiteInferior, LimiteSuperior,mitad;
d=0;
LimiteInferior = 0;
LimiteSuperior = MAX-1;
[Code] ....
View 2 Replies
View Related
Sep 26, 2012
I'm running a game online and designing a program to generate Enemy Stats. Basically, it's supposed to generate 25 numbers between 0 and 7(to represent 8 Attributes on a 25 Point Buy system) and count how many times each number shows up.
Here's what the code looks like:
Code:
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
int Generate() {
int r= rand();
int s= r%7;
[Code] ....
And here's two outputs.
1: Code:
12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 12133089220 Stats[0]= 25 Stats[1]= 0 Stats[2]= 0 Stats[3]= 0 Stats[4]= 0 Stats[5]= 0 Stats[6]= 0 Stats[7]= 0 Stats[8]= 0 Disallowed system call: SYS_socketcall
2: Code:
14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 14787708434 Stats[0]= 0 Stats[1]= 0 Stats[2]= 0 Stats[3]= 0 Stats[4]= 25 Stats[5]= 0 Stats[6]= 0 Stats[7]= 0 Stats[8]= 0 Disallowed system call: SYS_socketcall
Note that the number does change, but only between runs.
View 3 Replies
View Related
Mar 9, 2013
The following fuction from a class is supposed to count the number less then the average of all number combined. but it does not do that, now the fun part if you change it to count the number greater then the average it works great.
void IntegerArray::countBelowAverage() {
avrg=calcAverage(avg);
int count=0;
for(int x=0; x<100; x++) {
if (list[x]<avrg)
[Code]...
How do i get this to post in the proper format?
View 1 Replies
View Related
Dec 16, 2014
4.1 Write a program that will count from 1 to 12 and print the count, and its square, for each count.
4.2 Write a program that counts from 1 to 12 and prints the count and its inversion to 5 decimal places for each count. This will require a floating point number.
4.3 Write a program that will count from 1 to 100 and print only those values between 32 and 39, one to a line. Use the incrementing operator for this program.
View 2 Replies
View Related
Apr 11, 2013
i am writing a program that accepts a decimal number from the user and convert it to binary numbers. After the conversion, i should count the number of 1's and 0's in the said binary number. I got upto converting and counting 1's using Brian Kernighan’s Algorithm. But, i can't seem to get it to count the number of 0's.
#include <iostream>
#include<bitset>
using namespace std;
int main() {
int num,count=0,Zero,count1 =0;
cout<<"Enter the number:";
cin>>num;
string binary;
[code].....
View 7 Replies
View Related
Oct 19, 2014
Can I possibly get a better implementation of a prime number detecting algorithm than the one I already have below?
Code:
#include <cstdio>
#include <cstdlib>
int main() {
int no, high, low;
int divisor;
[Code] .....
View 8 Replies
View Related
Jun 12, 2014
I'm writting an algorithm which equals to std::to_string. The inttostring part is fine, and the decimal_part too. But when the number digits > 5, the program loops infinitely.
#include <iostream>
#include <string>
#include <algorithm>
[Code]...
In this code, the program runs ok. But try to add a 5 at decimal_part. What should I do to get this 'decimal_part' ok?
View 6 Replies
View Related
May 16, 2013
I'm tinkering with a serial quick sort algorithm. Normally I use qsort() but I wanted to test this.
Somehow I loose the highest number. I can't see where I drop it.
Code:
// function to quicksort, leave them in front of qsort.
void swap(float_t *left, float_t *right){
float_t temp;
temp = *left;
*left = *right;
*right = temp;
[Code] .....
View 2 Replies
View Related
Sep 5, 2014
I am writing a program that counts the number of sentences in a string. I count the number of '.' '?' '!'. However, there are Mr. Mrs. PhD. Dr. .
int number_of_sentences = 0;
for(unsigned int i=0; i <= text.length()-1; i++){
if(text[i] == '.' || text[i] == '?' ||text[i] == '!'){
++number_of_sentences;
}
}
return number_of_sentences;
View 3 Replies
View Related
Jul 7, 2014
I was wondering how to limit error message to one only.
For example
cin.getline(stringname,7);
for(int i=0;i<size;i++){
if(strcmp(stringname, "hello")=0)
cout<<"Found!"<<endl;
else
cout<<"not found"<<endl;
}
not found
not found
.......
I want to get only once not found
View 2 Replies
View Related
Apr 28, 2015
#include <fstream>
#include <iostream>
#include <string>
[Code].....
When I try to run my program I get:
1>LINK : error LNK2001: unresolved external symbol _mainCRTStartup
1>C:UsersDocumentsVisual Studio 2010ProjectsCS 111Lab10Lab10DebugLab10.exe : fatal error LNK1120: 1 unresolved externals
What I'm trying to do is get my program to count the number of words in an inputted data file. I've attached the assignment directions
Attached File(s) : lab10_data_.zip (9.27K)
View 4 Replies
View Related
Dec 24, 2014
This shows any prime number between a and b and also counts them*/
#include <iostream>
using namespace std;
int main(){
int a;
int b;
[Code] .....
View 1 Replies
View Related
Jan 31, 2014
I want to count number of words from my textfile and then make the first word ToUpper and second word ToLower and do that for the rest of the textfile.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.IO;
namespace ConsoleApplication3 {
internal class Program {
private static void Main(string[] args) {
[Code] ....
View 14 Replies
View Related
Jan 29, 2014
I want know if the query returned zero rows or not.
Don't want to use count(*)
sql = "select * from TABLE where employeefirstname = @First order by EmploymentStatusDescription";
using (SqlCommand cmd = new SqlCommand(sql, conn)) {
cmd.Parameters.AddWithValue("@First", First);
reader = cmd.ExecuteReader();
} while (reader.Read())
View 7 Replies
View Related
Dec 20, 2014
Write a c++ program to count no of letters in a given line
Write a c++ program to calculate employee salary
validation : for the salary less than 5000
a. HRA IS 15% OF BASIC salary
b. DA is 35% of basic salary
for salary above 5000
a. HRA is 5% of basic salary
b. DA is 25% of basic salary
View 7 Replies
View Related
Feb 4, 2013
Below is the response XML my programmer is getting from business service -
<Data>
<Maintain>
<AssetList>
<AssetDetails>
<AssetDescriptor>
<ns1:ParentProductCat category="ABC">ABC</ns1:ParentProductCat
[code].....
In above XMl if you check the ParentProductCat is prefixed with ns1:,ns2:,ns3:....
My XSLT code only checkes for the ParentProductCat but since it is prefixed with "ns*:" (* is integer) it fails to find it. So that in C# code replace function is used to replace ns*: a for loop is used for this and it goes until 1000
But now my response crossed the 1000 mark and this time the XML contains total 14500 lines.So I want to replace all ns:*
For this I want to count the number of lines present in the XML so that the for loop will run until that line number. how to do that?
View 2 Replies
View Related
Jan 15, 2014
write a program that counts the number of digits in a file?
For example the file contains:
5 6 7 -8 9obvsefs
6 7 8i uhbnm
8 8
And the program returns: "The number of all digits is 10"
View 3 Replies
View Related
Mar 27, 2014
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....
View 6 Replies
View Related
Jan 14, 2014
the text file looks like: one hello hi twenty-five billion fifty maths three thousand and two
output: count the number of text numbers: 4
View 1 Replies
View Related
Feb 1, 2014
I wrote a function to count the number of characters in a string. Curious as to why I have to return x-1 and why x isn't the number of characters.
Code:
int count(char *string){
55 int x = 0;
56 char *p;
57 p = string;
58
[Code] .....
View 4 Replies
View Related
Mar 3, 2013
I am forking 3 times in a loop like this but the variable "count" does not increment, it stays on '1' and therefore this is an infinite loop, and this simple thing dont make sense to me.
I have checked so that the pointer address is the correct one every loop.
Code:
void increase(int* x) {
*x += 1;
}
main() {
int pid, i, number = 0;
[Code] .....
View 8 Replies
View Related
