Scribd
Upload
35 views10 pages

Programming in C Extension Problem: (CSE SECTION-9) (BATCH-04)

This document discusses a C programming extension problem to maximize the number of equal pieces a string can be cut into. It provides the problem statement, describes splitting a string into contiguous equal pieces, and includes sample inputs and outputs. The source code, flowchart, and test cases are presented to demonstrate the algorithm for solving this problem. The conclusion reflects on learning concepts for writing simple but complete C programs using suitable data structures and control flow.

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 PPTX, PDF, TXT or read online on Scribd
35 views10 pages

Programming in C Extension Problem: (CSE SECTION-9) (BATCH-04)

This document discusses a C programming extension problem to maximize the number of equal pieces a string can be cut into. It provides the problem statement, describes splitting a string into contiguous equal pieces, and includes sample inputs and outputs. The source code, flowchart, and test cases are presented to demonstrate the algorithm for solving this problem. The conclusion reflects on learning concepts for writing simple but complete C programs using suitable data structures and control flow.

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 PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

PROGRAMMING IN C

EXTENSION PROBLEM

(CSE SECTION-9)(BATCH-04)
BATCH MEMBERS:
01.NIKHIL TRIPATHY (221FA04727)
02.ANNU WINSHLATE (221FA04706)
03. SHAIK ASHRAF (221FA04684)
ABSTRACT:
THIS PROBLEM IS AIMED TO IMPACT KNOWLEDGE ON BASIC CONCEPTS OF C
PROGRAMMING LANGUAGE AND PROBLEM SOLVING THROUGH PROGRAMMING .IT
COVERS BASIC STRUCTURE OF C PROGRAM ,DATA TYPES ,OPERATORS,DECISSION
MAKING STATEMENTS,LOOPS AND ARRAYS.THIS MODULE IS IMPLEMENTED USING
CODE BLOCKS WHICH IS A CROSSPLATFORM IDE (INTEGRATED DEVELOPMENT
ENVIRONMENT TO CODE BUILD ,RUN AND DEPLOY PROJECTS.THIS REPORT MAINLY
DISCUSSES ABOUT
PROBLEM STATEMENT:
YOU HAVE AN INTRESTING STRING S OF LENGTH N. IT IS INTERSTING BECAUSE YOU
CAN REARRANGE THE CHARACTERS OF THIS STRINGS IN ANY ORDER . YOU WANT
TO CUT THIS STRING INTO SOME CONTIGUOUS PIECES SUCH THAT AFTER CUTTING ,
ALL THE PIECES ARE EQUAL TO ONE ANOTHER. YOU CAN’T REARRANGE
THECHARACTERS IN THE CUT PIECES OR JOIN THE PIECES TOGETHER . YOU WANT
TO MAKE THE NUMBER OF PIECES AS LARGE AS POSSIBLE . WHAT IS THE MAXIMUM
NUMBER OF PIECES YOU CAN GET ? NOTE:YOU CAN OBSERVE THAT YOU MAY NOT
WANT TO CUT THE STRING AT ALL , THEREFORE THE NUMBER OF PIECES IS 1 .
HENCE, THE ANSWER ALWAYS EXISTS.
SAMPLE INPUT 1: ZZZZZ
SAMPLE OUTPUT 1:
5
SAMPLE INPUT 2:
ABABCC
SAMPLE INPUT 2:
2
DISCRIPTION:
GIVEN AN STRING OF LENGTH S. THE LENGTH OF N PIECES OF STRING AND AN
INTEGER I, AT LEAST K PIECES OF THE SAME LENGTH NEED TO BE CUT FROM THE
GIVEN STRING. THE TASK IS TO FIND THE MAXIMUM NUMBER OF PIECES WE GET.
ALGORITH 01.DEFINE A STRING AND DEFINE N,I.E,NUMBER OF EQUAL PART THAT
STRING NEEDS TO BE DIVIDED IN. 02.NO. OF CHARACTER(VARIABLE CHARS) IN
EACH SUBSTRING W ILL BE FOUND OUT BY DIVIDING THE LEN. OF THE STR. BY N.
03.IF THE STRING CAN’T BE DIVIDED INTO N EQUAL PART , THEN DISPLAY AN ERROR
MESSEGE . 04.ELSE DIVIDED THE STRING FROMINTO CHARS (NO. OF CHARACTER).
05.THEN INCREMENT THE COUNT BY CHAR AND CONTINUE DIVIDING THE STRING
TILL YOU GET ALL THE PARTS OF THE STRING. 06.PRINT THE COUNT.
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 min=0;i<50;i++)
{
If(min>b[i] && b[i] !=0)
{
FLOW CHART:
IF
MIN>b[i]
START &&b[i]!=0

LENGTH OF DON’T REPLACE


MIN=b [I] THE MIN VALUE
STRING

CONSIDER OUTER
INTEGER ARRAY
%MIN!
[i ]
AND EXECUTE THE IF b= 0
=
VALUE OF B
NO
YES
C=1

PRINT MIN.
PRINT1
PRINT
STOP
TEST CASES:
 1 ST TEST CASE:
6
zzzzzz
6
 2nd TEST CASE:
6
Ababcc
2
 3rd CASES TEST:
10
asdfgasdfg
2
 4 TH 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 WORK CORRECTLY IN THE FIRST ATTEMPT.
REFERENCE:
01.E.BALAGURUSWAMY ‘PROGRAMMING IN C’, 02.PROGRAMMING AND
PROBLEMSOLVING THROUGH ‘C’LANGUAGE PAPER BACK2006 BY HARSHA PRIYA.
03.Y.KANETKAR “LETS C”.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy