0 like 0 dislike
7k views

Write a program that reads a string of up to 100 characters, and if its length is less than three characters, it should force the user to enter a new one. Next, the program should read a character and check if the string contains the input character three times in a row. The program should display the position of the first triad found.

Sample input:

fg
DuplicateThis
D

Sample output: 

Not found

 

Sample input: 

Deeeply
e

Sample output:

1

Sample input: 

Deeeppply
p

Sample output:

4

 

[Exam] asked in Midterm
ID: 23786 - Available when: Unlimited - Due to: Unlimited

reshown by | 7k views

65 Answers

0 like 0 dislike
Hidden content!
#include ** **** ** * *

#include *** * * *

#include ** * * **

int main(){

 char s[101];

 int i,a,b=0,j;

 char key ;

 

while (a<3){


**** **** **** * * **** ** ** * * *
*** * * * *** strlen(s);

}

fflush(stdin);
* * * * * **** ******* * * *

 
** ** * * * * *
* * * * **** * **** * * ** * *
* ****** ** **** ** * * **** * *** * *****
** * *** * * * * **
** ** ***** ** * * * ** (b>=3){
** * * * * * ** * * ** *** *
** ** * ** ** * * **** ** * ** * * ***** *
**** * * *** *** * * ** * * **** ** * *** ** *** * * *** * *
* ** * ** ** * ***** * ** * * * * ****** * *** ** 0 ;}
*** *** ** * * * *
* * ** ** ******* ******
*** * * * *** ** *** *

** ** * **** *** *** ** * *** * **** * found");
* * * * * ** **** 0;
* *** ** * *** * * * ** *

 
** **** 0;



}
answered by (-136 points)
0 like 0 dislike
Hidden content!
#include * *** **

#include ** ** ** **

#include *** * *

int main(){

 char s[100];

 int i,a,b=0,j;

 char key ;

 

while (a<3){


** ** ** * ** *** * * * ** ** *** * ***
**** * * ** * * * strlen(s);



}

fflush(stdin);
*** * * * * ***** ******

 
* *** * * ** * * ** *
*** ******* ******* ** ** * ** **
** * * * **** ** ** ***** ** * *** ** * * *
** * ** * **
* *** *** ** * * * (b>=3){
* ** * * * * *** * *** * * * ** ***
* ***** * ** * * ** ** ** ** * *** * *
*** ** * ** ** ** **** ** * * * ** ** * *** * * *** * **
* * * **** * * ** * * * ********* * * * **** * * 0 ;}
* * ***** *
* * * * ** * * **** * *
*** * * ** * ** *** *

* * *** * ** * * **** * * found");
* * * ** ********* * 0;
** * * ** ** **** ****

 
** ** * * 0;



}
answered by (-136 points)
0 like 0 dislike
Hidden content!
#include * ** **** *

#include *** * * **

#define MAX 100



int main(){

char s[MAX];

char c;

int len;

int i;

int pos=0;

int rep=0;
*** * ** *** * ** * *

;

len=strlen(s);



while (len <3){
*** ** * * ** ** * ** ** * *
* * * * ** *

}


* *** * * ***** * *



for (i=0;i<len;i++){
* * ** * * * *** * * * * ***** ** * ** * * (rep==3)
* ** * * **** **** ***** * ** * *** ******* * *** *** * * ** *
* ** ** * ***  if (s[i]!=s[i-1])
** **** * * * ** * * * ** ** * **** * * *** * ****** * ******* ** * ** ** ***** ** * * * * * * * * ** assures that 3 times in a row
** * ** ** * * ** * * if (c==s[i]){
* ** * * ** ** * * * **** *** **** * * ** ***
* ** ** ****** * ** ** *** ** ** * * * ** * *
** ** * * * * * * ****** * * * ** *** **** ** *** * *** * ** * ** ***** ** * **** * * ** * * * * *** ******** the position
* ** * * * * ** * * ** ** **** * * if (rep==3)
* * ** ** * * * ****** * ** * * **** * * **** ** * ****** * * ** *
** * *** * * ***



}


* *** ********





return 0;}
answered by (-34 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include ** **

#define MAX 100



int main(){

char s[MAX];

char c;

int len;

int i;

int pos=0;

int rep=0;
** ** * * **** *** ***

len=strlen(s);



while (len <3){
***** *** * * * *** * * **
* *** *** * ** ****

}


* ** ** * ** *



for (i=0;i<len;i++){
** *** * * * * * * * * * ** *** ** * * (rep==3)
* * * ** * * **** ** ** * * * * * ***** * * * * *** ** * *
**** * **** *  if (s[i]!=s[i-1])
* ** ** * ** * ** * ****** ** ********* * * *** * * ** ** ** * * * * ** * * **** *** *** * * * ** ****** ** assures that 3 times in a row
* * **** * * ** * * * * * if (c==s[i]){
* * * ** ** * * * * ** * * * *** **** ** * * *** *
** * * *** **** **** *** * * * **** *** *
*** *** * ** * **** * * **** ** * *** **** ** * ** ** * ** ** * * **** ** * * ****** * ** * ** * * ** *** * * ** the position
** ** ** **** ** ** ******* ** * * ** * * *** * * if (rep==3)
****** ** * ** ** * * * * *** * * ** * ******** ******
* ***** * *****



}


*** * *** ** *
answered by (-34 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include * ***** * * *

#define MAX 100



int main(){

char s[MAX];

char c;

int len;

int i;

int pos=0;

int rep=0;
* *** ** * ** ***** *

len=strlen(s);



while (len <3){
** ** * * * * *** * * *** * * ** * *
* **** * ** *

}


* ** **** ** * *****



for (i=0;i<len;i++){
* ** * *** ** ** * ****** * ** * * ** * (rep==3)
** * ** ** * * ** * * * * * ** ** ** *** * *** * * * * *
* * * *** * *  if (s[i]!=s[i-1])
*** * * ** *** *** * * ** * * * ***** ** **** ** *** ** * * * * **** * * ** ***** * ** ** * ** *** * **** * ** assures that 3 times in a row
* ** * ** * * * * ** if (c==s[i]){
* * *** * ** * ****** * * *** * ** * * * * **
** *** ***** * ** ** ** *** *** ** ** * * *
* *** * **** ** ** ** ** * * ** *** * * * ** ***** * * ** *** * **** ****** ** * * * * *** * * ** ** * *** *** ** * *** * * the position
* * * *** * *** ***** * * * * ******* if (rep==3)
** ** * * ** ** ***** * ** ** *** * * * * * * * ** * * ** *
*** * * ** * **** * *** ***



}


*** * ****
answered by (-34 points)
0 like 0 dislike
Hidden content!
#include * ******

#include *** **** * ***

#define MAX 100



int main(){

char s[MAX];

char c;

int len;

int i;

int pos=0;

int rep=0;
* * * * * * **

len=strlen(s);



while (len <3){
* ** ** * ** * ** * * * * *
* * * * ** *

}


** ** **** *** *** **



for (i=0;i<len;i++){
* ****** *** *** * ** **** * **** ** * ** (rep==3)
** * * ** * ** * ** *** * * * ** * ***** * ** ** ***
** **** * * **** *  if (s[i]!=s[i-1])
*** ** ** * ** * * ****** * **** * ** * * ** * * * * * * * *** * * *** * * *** *** ** *** ** ********** *** assures that 3 times in a row
** *** ***** * * ** if (c==s[i]){
* * * * * *** * ** * ** * * * *** ****** * * *
* * * * * * * **** **** * * ** **** ** * * ***
* * * ** * * **** * * **** ******* * *** ** * *** * * * *** * ** *** ***** * * ** ** * ** *** * ***** * ** **** **** the position
* * * * * * * *** * *** * ***** *** if (rep==3)
***** ** *** * * ******* * **** * *** ** * *** * ** ** * * *
* * ***** ******* *



}


* * **** * *** * **





return 0;}
answered by (-34 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include * ** **



int main()

{
* * ***** * ******* * ch, str[100];
** * **** ***** * * * i, len;
* * ** ** * * **** ***
**** ** ** **** ****
* ** * * * ** ******* * * ********* * *** ** *
* *** ******* * ** * ** *** ** ** * ** **** ** * = strlen(str);
*** * * * **** *** while(len < 3);
* * ** *** * * **** ****** * * *** * = getchar();
** * *** * * * ** * * * *** = 0; i <= len-3; i++)
* * *** * * * * ** * ** * ** * * * * * ** * == ch && str[i+1] == ch && str[i+2] == ch)
* *** ** * * *** ** ** * *** ****** ****
* *** * * ** * ** * * *** ******* * * * ******* ** ** ** ** * * ******** ** * * *
**** * * * ***** ** * * ** * * ** *** *** * * * *** ***** **** *** 0;
** **** **** ** ** ** * * ** ** ** ** *** *
* * * * ** ** *** ****** * * * * * found\n");
*** * ** * * ** *** * ** * * * 0;

}
answered by (38 points)
0 like 0 dislike
Hidden content!
#include * * * ** **

#include * * ** **

#define MAX 100



int main(){

char s[MAX];

char c;

int len;

int i;

int pos=0;

int rep=0;
* * * ****** * ** **** ** *

;

len=strlen(s);



while (len <3){
******* * **** * * ** * **** * * ***
* ** * * * *

}


* * * ** * * ** * * *



for (i=0;i<len;i++){
* ** *** *** *** * * ** * ***** * ** * ** *** (rep==3)
** ** * * * ** ** *** ** * ** *** *** ** ** * * *** * * *** ***
****** *** * ******* **  if (s[i]!=s[i-1])
***** * ** *** ***** *** * ** ** * * * * ** ** * * *** * ** *** **** * **** * * * * ** * * * * * ** ** * assures that 3 times in a row
* *** ** * * *** * **** if (c==s[i]){
** * * ** *** ** * *** *** * * * ** ***
*** * * ** * * ** ****** ***** * * ******
**** ** * * * *** ** ** **** *** **** * ** ***** *** * *** **** * * **** * * ***** ** * * **** * * * **** * * * * * * the position
** ***** * ** *** ** * ****** *** **** * if (rep==3)
* ** ** ****** ** * ** * **** * * * * * *** ** **** * ** ** **
** * * * **



}


* ** *** ******** **** **





return 0;}
answered by (-34 points)
0 like 0 dislike
Hidden content!
#include * * * *

#include ** ***** ****

#include * *** **** ***

int main(){
** ***** s[100];
* ** ** * i,a;
* ** *** key ;

 

while (a<3){


*** **** ******** * * * * *** * * **
* * * ***** * strlen(s);



}
* *
* * ** * * ** * * * ** ** * ** **

 
** ******* ** ** * *
*** * * ** ******** * * ** ***** * ** ** * * *** * ** *
**** * ** * * ** ** * ** * ** * * ** * ** **
*** ** * ** **** * * ** 0;}
** * ** ** *** * *

 }
** * * * *** * *
* * ** ** * * ***** ** * * * *** * ** * ** ** ** *
* **** * * ***** *** * 0 ;

 

}
answered by (-136 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <string.h>

#define KK 100



int main(void)

{

    char word[KK],mod='0';

    int i,j,times=0,z=0,qq=1;


*** * * *** ***** *** ** ** **
* *** * * * ** *** ** *

    {
** ******* ** * * *** **** ** * * * * ****** * * * * *
* ** *** * * * * ******* *
** * * * * ** ** * ** * * * **** ** ****** ** ** * ** * * **** ** * * *** ** ***
**** *** * * ** * ** ****** * ** * * *** * *
* * *** ** *** * ** ** ** **** * ** * * *
** ****** ** *** ***** * ***** * **
******* ** ** * * * * *** **** ** *** *** * ** ********* * * ***** *
* * ** * * * ************** * *** ** **** * **

    }


*** ** **** * * * * **


********* * *** * ** * * * * * * ** ** * * *



    for(i=0; i<z; i++)

    {
** * * * ** * **** * * **** * * * **** * * * *
*** **** ** ** **** * * * * * * ***** *
** * *** * ** ***** * * * * * * ** ****** * * * ** ** ***
** * ** * * ***** *** ** ** * ** * ** ** ***** *** * * * * ** ** ** ** *
** * * **** ** **** * * **** *** ** * * *** *** * * **** *** *
** * * *** * ****** * **** * * * ** ***** ** * ** ** * * * *** * * ** * * * ** ** **** ******* ** ** ** **** **
** **** * * * ***** * * * **** * * * * *** * ** ** ** * * *** ** * ******
* * * * **** * * * * * ** ** ** * ** **** * ***** * * * ** * * * * ** ***** *** ***
***** *** ** ***** * * ** ** *** * * * * * * * ** ** * **
* ** * ** * ** ** * *** * * * *** *** * *

    }
* ** ******* * ** * * *

    {
** ** * *** ** ** * * ** * * ** * * ** * * found");

    }







}
answered by (-324 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.178.44
©2016-2025

Related questions

0 like 0 dislike
11 answers
[Exam] asked Apr 21, 2017 in Midterm
ID: 24270 - Available when: Unlimited - Due to: Unlimited
| 1.8k views
0 like 0 dislike
13 answers
[Exercise] Coding (C) - asked Apr 21, 2017 in Midterm
ID: 24268 - Available when: Unlimited - Due to: Unlimited
| 1.8k views
0 like 0 dislike
47 answers
[Exam] asked Apr 13, 2017 in Midterm
ID: 23784 - Available when: Unlimited - Due to: Unlimited
| 5.2k views
0 like 0 dislike
8 answers
[Exam] asked Apr 21, 2017 in Midterm
ID: 24273 - Available when: Unlimited - Due to: Unlimited
| 1.3k views
0 like 0 dislike
4 answers
[Exam] asked Apr 21, 2017 in Midterm
ID: 24272 - Available when: Unlimited - Due to: Unlimited
| 948 views
12,783 questions
183,442 answers
172,219 comments
4,824 users