Scribd
Upload
32 views4 pages

Programming in C Extensionproblem: CSE (SECTION-09) (BATCH-17)

This document discusses a C programming problem to find the maximum number of equal length pieces a string can be cut into. It provides the problem statement, algorithm, flowchart, source code, test cases, and conclusion. The problem is to take a string and cut it into contiguous pieces of equal length to maximize the number of pieces. The algorithm divides the string length by the number of pieces to get the length of each piece, then divides the string accordingly and increments the count.

Uploaded by

Sk Mohammad Ashraf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views4 pages

Programming in C Extensionproblem: CSE (SECTION-09) (BATCH-17)

This document discusses a C programming problem to find the maximum number of equal length pieces a string can be cut into. It provides the problem statement, algorithm, flowchart, source code, test cases, and conclusion. The problem is to take a string and cut it into contiguous pieces of equal length to maximize the number of pieces. The algorithm divides the string length by the number of pieces to get the length of each piece, then divides the string accordingly and increments the count.

Uploaded by

Sk Mohammad Ashraf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

PROGRAMMING IN C

EXTENSIONPROBLEM

CSE (SECTION-09)(BATCH-17)

BATCH MEMBERS:

01.NIKHIL TRIPATHY (221FA04727)


02.ANNU WINSHLATE (221FA04706)
03.SHAIK MOHAMMAD (221FA04684)
ASHRAF
ABSTRACT:
THIS PROBLEM IS AIMED TO
IMPACT KNOW LEDGE ON BASIC SAMPLE OUTPUT 1:
CONCEPTS O F C P ROG RA MMIN G 5
LA NG UAGE AND PROBLEM
SOLVING THROUGH SAMPLE INPUT 2:
PROGRAMMING .IT COVERS BASIC ABABCC
STRUCTURE OF C PROGRAM
,DATA TYPES
,OPERATORS,DECISSION MAKING SAMPLE INPUT 2:
STATEMENTS,LOOPS AND 2
ARRAYS.THIS MODULE IS
IMPLEMENTED USING CODE DISCRIPTION:
BLOCKS WHICH IS A CROSS-
PLATFORM IDE (INTEGRATED
DEVELOPMENT ENVIRONMENT TO GIVEN AN STRING OF LENGTH S .
CODE BUILD ,RUN AND DEPLOY THE LENGTH OF N PIECES OF
PROJECTS.THIS REPORT MAINLY STRING AND AN INTEGER I, AT
DISCUSSES ABOUT LEAST K PIECES OF THE SAME
LENGTH NEED TO BE CUT FROM
THE GIVEN STRING. THE TASK IS
PROBLEM STATEMENT: TO FIND THE MAXIMU M NU MBER
OF PIECES W E GET.
YOU HAVE AN INTRESTING STRING
S OF LENGTH N. IT IS INTERSTING
ALGORITH
BECAUSE YOU CAN REARRANGE
THE CHARACTERS OF THIS
STRINGS IN ANY ORDER . YOU 01.DEFINE A STRING AND
WANT TO CUT THIS STRING INTO DEFINE N,I.E,NUMBER OF
SOME CONTIGUOUS PIECES SUCH EQUAL PART THAT STRING
THAT AFTER CUTTING , ALL THE NEEDS TO BE DIVIDED IN.
PIECES ARE EQUAL TO ONE
ANOTHER. 02.NO. OF
CHARACTER(VARIABLE CHARS)
IN EACH SUBSTRING W ILL BE
YOU CAN’T REARRANGE FOUND OUT BY D IV ID ING THE
THECHARACTERS IN THE CUT LEN. OF THE STR. BY N.
PIECES OR JOIN THE PIECES
TOGETHER . YOU WANT TO MAKE 03.IF THE STRING CAN’T BE
THE NUMBER OF PIECES AS
DIVIDED INTO N EQUAL PART ,
LARGE AS POSSIBLE . WHAT IS
THEN DISPLAY AN ERROR MESSEGE
THE MAXIMUM NUMBER OF PIECES
.
YOU CAN GET ?
04.ELSE DIVIDED THE STRING
FROMINTO CHARS (NO. OF
NOTE:YOU CAN OBSERVE THAT
CHARACTER).
YOU MAY NOT WANT TO CUT THE
STRING AT ALL , THEREFORE THE
05.THEN INCREMENT THE COUNT
NUMBER OF PIECES IS 1 . HENCE,
BY CHAR AND CONTINUE
THE ANSWER ALWAYS EXISTS.
DIVIDING THE STRING TILL YOU
GET ALL THE PARTS OF THE
SAMPLE INPUT 1:
STRING.
ZZZZZ
06.PRINT THE COUNT.
FLOW CHART: SOURCE CODE:
#include<stdio.h>
int main()
{
int a,c =0,d=0;
scan f(“%s”,s);
int b[50] ={0};
For (int i =0;i<a;i++)
{
b[s[i]-‘a’]++;
}
int min =999999;
for (int i =0;i<50;i++)
{
if (min >b[i] && b[i] !=0)
{
min =b[i];
{
C = 1;
break;
}
}
If (c ==0)
printf(%d\n”,min);
else
printf(“1\n”);
}
TEST CASES:
SOLVING THROUGH
‘C’LANGUAGE PAPER BACK -
 1ST TEST CASE: 2006 BY HARSHA PRIYA.
6 03.Y.KANETKAR “LETS C”
zzzzzz
6
 2ND TEST CASE:
6
Ababcc
2
 3RD CASES TEST:
10
asdfgasdfg
2
 4TH TEST CASE:
5
aszas
1

CONCLUSION:
I UNDERSTAND THE CONCEPT
OF
WRITING SIMPLE ,BUT
COMPLETE C PROGRAMS
BY SELECTING PROBLEM
SPECIFIC DATA
STRUCTURES AND
SUITABLE ACCESSING
METHODS.ALSO APPLYING
DECISSION MAKING AND
ITERATIVE FEATURES TO
DEVELOP C PROGRAMS
THAT ARE
UNDERSTANDABLE,
MAINTAINABLE AND MORE
LIKELY TO W ORK
CORRECTLY IN THE FIRST
ATTEMPT.

REFERENCE:
01.E.BALAGURUSW AMY
‘PROGRAMMING IN C’,
02.PROGRAMMING AND
PROBLEM

You might also like