Treceți la conținutul principal

words play cpp code

//netestat

#include <iostream>

using namespace std;

int lengthOfxArray(double [] xArray){
 return sizeof(xArray)/sizeof(double);
}

double prod(double [] xArray){
 int length = lengthOfxArray(xArray);
 int product = 1; 
 for(int i = 0; i <= length ; i++){
  product*=xArray[i];  
 } 
 return product;
}

double sum(double [] xArray){
 int length = lengthOfxArray(xArray);
 int suma = 0; 
 for(int i = 0; i <= length ; i++){
  suma+=xArray[i];  
 } 
 return suma;
}

void word2char(char [] word){
 int length = lengthOfxArray(word);
  
 for(int i = 0; i <= length ; i++){
  std::cout<<" "<<word[i]<<" ";   
 } 
}

void word2charStFi(char [] word, int st, int fi){
 int length = fi-st;
  
 for(int i = st; i <= fi ; i++){
  std::cout<<" "<<word[st+i]<<" ";
     
 } 
}

int countSpaces(char [] prop){
 int length = lengthOfxArray(prop);
 int spaces=0;
 for(int i = 0; i <= length ; i++){
  if(prop[i]==' ') {
   spaces++;
  }   
 }
 return spaces; 
}


int findNextSpace(char [] prop,int st){
 int length = lengthOfxArray(prop);
 
 for(int i = st; i <= length ; i++){
  if(prop[i]==' ') {
   return i;
  } 
    
 }
 return 0;  
}

int wordCounterInProp(char [] proposition){
 int length = lengthOfxArray(proposition);
 int nrspaces = countSpaces(proposition); 
 return nrspaces;

}

void prop2word(char [] prop){
 int length = lengthOfxArray(prop);
 int nrspaces = wordCounterInProp(prop); 
 int st = 0;
 int fi = 0;
 
 //from start to end of proposition  
 //select start space and fi space
  //find the word between st and fi

  for(int i = 0; i <= length ; i++){
  fi = findNextSpace(prop,st);
  if(i==length){fi=length;}
  word2charStFi(prop,st,fi);
  }
}










Comentarii

Postări populare de pe acest blog

program principal cpp

#include "clasa.h" #include <stdio.h> #include <conio.h> #include <stdlib.h> #include <string.h> #define DELAY 9000000 void delay() { for(long i=0;i<DELAY;i++); } //constructor cu initializare de la tastatura BigInt::BigInt() {char x; signed char t[400]; int i; printf("\nNumarul cu semn "); do s=getche(); while((s!='+')&&(s!='-')); n=0; do {x=getche(); t[n]=x-'0'; n++; } while((x>='0')&&(x<='9')); n--; for(i=0;i<n;i++) nr[i]=t[n-i-1]; } //constructor cu initializare prin parametri BigInt::BigInt(char semn,signed char numar[],int dim) {int i; s=semn; n=dim; for(i=0;i<n;i++) nr[i]=numar[n-i-1]; } //transform un int negativ in pozitiv int BigInt::Pozitiv(int x) {int a,vb; a=0; vb=0; while(vb==0) if((x+a)==0) vb=1; else a=a+1; x=a; return x; } //constructor dintr-un nr int obisnuit BigInt::BigInt(int x) {int i; if(x>=0) s='+'…

NUMERE PRIME ALGORITM C++

// NUMERE PRIME ALGORITM C++//  reediting from scratch //on this page is just the study for a next algoritm for generating the parime nr series like Fibonnaci or ....if possibile

74111121313417374414124343447 if u know the red part you can generate the orange part
1 0 1 111112222 1 1 23

o aplicatie php localitati romania

//APLICATIA SE REFERA LA BAZA DE DATE SIRUTA

//dragtable.js


/* dragtable v1.0 June 26, 2008 Dan Vanderkam, http://danvk.org/dragtable/ http://code.google.com/p/dragtable/ \Bsortabledraggable\B Instructions: - Download this file - Add <script src="dragtable.js"></script> to your HTML. - Add class="draggable" to any table you might like to reorder. - Drag the headers around to reorder them. This is code was based on: - Stuart Langridge's SortTable (kryogenix.org/code/browser/sorttable) - Mike Hall's draggable class (http://www.brainjar.com/dhtml/drag/) - A discussion of permuting table columns on comp.lang.javascript Licensed under the MIT license. */ // Here's the notice from Mike Hall's draggable script: //***************************************************************************** // Do not remove this notice. // // Copyright 2001 by Mike Hall. // See http…