#include #include long long int count_subsequent(char s[],char k[],long long int size1,long long int size2) { if((size1==0 && size2==0) || size2==0) { return 1; if(size1==0){ return 0; if (s[size1-1]==k[size2-1]){ return count_subsequent (s,k,size1-1,size2-1) + count_subsequent (s,k,size1-1,size2); Jelse{ return count_subsequent(s,k,size1-1,size2); } } int main() { long long int counter,kasus=0; scanf("%lld",&counter); while(counter>0){ kasus = kasus+1; char s[20]; char k[8]; scanf("%s",s); scanf("%s",k); long long int sizes = strlen(s); long long int sizek = strlen(k); long long int hitung = count_subsequent(s,k,sizes,sizek); printf ("Case #%lld: %lld\n", kasus, hitung); counter counter - 1; } return 0;

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Make a Flow Chart From this C Programming Language Code

#include <stdio.h>
#include<string.h>
long long int count_subsequent(char s[],char k[],long long int size1,long long int size2) {
if((size1==0 && size2==0) || size2==0) {
return 1;
if(size1==0){
return 0;
}
if (s[size1-1]==k[size2-1]){
return count_subsequent(s,k,size1-1,size2-1) + count_subsequent(s,k,size1-1,size2);
}else{
return count_subsequent(s,k,size1-1,size2);
}
}
int main() {
long long int counter, kasus=0;
scanf("%lld",&counter);
while(counter>0){
kasus = kasus+1;
char s[20];
char k[8];
scanf("%s",s);
scanf("%s",k);
long long int sizes = strlen(s);
long long int sizek = strlen(k);
long long int hitung = count_subsequent(s,k,sizes, sizek);
printf ("Case #%1ld: %lld\n", kasus, hitung);
counter = counter - 1;
11
}
return 0;
}
Transcribed Image Text:#include <stdio.h> #include<string.h> long long int count_subsequent(char s[],char k[],long long int size1,long long int size2) { if((size1==0 && size2==0) || size2==0) { return 1; if(size1==0){ return 0; } if (s[size1-1]==k[size2-1]){ return count_subsequent(s,k,size1-1,size2-1) + count_subsequent(s,k,size1-1,size2); }else{ return count_subsequent(s,k,size1-1,size2); } } int main() { long long int counter, kasus=0; scanf("%lld",&counter); while(counter>0){ kasus = kasus+1; char s[20]; char k[8]; scanf("%s",s); scanf("%s",k); long long int sizes = strlen(s); long long int sizek = strlen(k); long long int hitung = count_subsequent(s,k,sizes, sizek); printf ("Case #%1ld: %lld\n", kasus, hitung); counter = counter - 1; 11 } return 0; }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Array
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education