lweipku
BAN USER#include <iostream>
#include <string>
using namespace std;
int main(){
string input_string;
cin>>input_string;
int count=0;
for(int start=0;start<input_string.size();start++){
++count;
//cout<<input_string.substr(start,1)<<" ";
char dif_char=' ';
for(int end=start+1;end<input_string.size();end++){
if(dif_char==' '){
if(input_string[end]==input_string[start]){
++count;
//cout<<input_string.substr(start,end-start+1)<<" ";
}else{
++count;
dif_char=input_string[end];
//cout<<input_string.substr(start,end-start+1)<<" ";
}
}
else if(input_string[end]==input_string[start]||
input_string[end]==dif_char){
++count;
//cout<<input_string.substr(start,end-start+1)<<" ";
}
else
break;
}
}
cout<<count<<endl;
return 0;
}
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <sstream>
#include <cctype>
using namespace std;
int main()
{
set<string> words;
map<string, int> words_counts;
string read_str;
getline(cin,read_str);
istringstream line(read_str);
string word;
while (line >> word){
for(int i=0;i<word.size();++i){
if(!isalpha(word[i]))
word.erase(i);
}
++words_counts[word];
words.insert(word);
}
for(set<string>::iterator it=words.begin();it!=words.end();++it){
cout<<(*it)<<"="<<words_counts[(*it)]<<" ";
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
bool FindStringInMatrix(int i,int j,char**str_matrix, char* str_tofind, int str_tag){
if(str_tag>strlen(str_tofind)-1){
return true;
}
if (str_tofind[str_tag]==str_matrix[i][j]){
//cout<<"find "<<str_tofind[str_tag]<<" in ("<<i<<","<<j<<") :"<< str_tag<<endl;
if(FindStringInMatrix(i+1,j,str_matrix,str_tofind,str_tag+1))
return true;
if(FindStringInMatrix(i,j+1,str_matrix,str_tofind,str_tag+1))
return true;
if(FindStringInMatrix(i+1,j+1,str_matrix,str_tofind,str_tag+1))
return true;
}
return false;
}
int main(){
char** str_read=new char*[3];
for(int i=0;i<3;i++){
str_read[i]=new char[3];
}
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin>>str_read[i][j];
}
}
char* str_tofind=new char[4];
for(int i=0;i<3;i++){
cin>>str_tofind[i];
}
str_tofind[3]='\0';
if(FindStringInMatrix(0,0,str_read,str_tofind,0))
cout<<"String in the Matrix"<<endl;
else
cout<<"Not find in the Matrix"<<endl;
return 0;
}
#include <iostream>
#include <string>
using namespace std;
bool FindStringInMatrix(int i,int j,char**str_matrix, char* str_tofind, int str_tag){
if(str_tag>strlen(str_tofind)-1){
return true;
}
if (str_tofind[str_tag]==str_matrix[i][j]){
//cout<<"find "<<str_tofind[str_tag]<<" in ("<<i<<","<<j<<") :"<< str_tag<<endl;
if(FindStringInMatrix(i+1,j,str_matrix,str_tofind,str_tag+1))
return true;
if(FindStringInMatrix(i,j+1,str_matrix,str_tofind,str_tag+1))
return true;
if(FindStringInMatrix(i+1,j+1,str_matrix,str_tofind,str_tag+1))
return true;
}
return false;
}
int main(){
char** str_read=new char*[3];
for(int i=0;i<3;i++){
str_read[i]=new char[3];
}
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin>>str_read[i][j];
}
}
char* str_tofind=new char[4];
for(int i=0;i<3;i++){
cin>>str_tofind[i];
}
str_tofind[3]='\0';
if(FindStringInMatrix(0,0,str_read,str_tofind,0))
cout<<"String in the Matrix"<<endl;
else
cout<<"Not find in the Matrix"<<endl;
return 0;
}
- lweipku April 03, 2013