Scribd Logo
Upload

Welcome to Scribd!

  • Fibonacci Strings

    Uploaded by

    da
    11 views1 page
    The document contains C code to count the frequency of substrings in a string. It takes user input for the number k and m, generates the Fibonacci string of length k, takes m search queries as input, and calls the frequencies function to count the occurrences of each query in the Fibonacci string, outputting the counts. The frequencies function takes two strings as input, loops through the main string to find matches with the search string, and returns the count of matches found.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains C code to count the frequency of substrings in a string. It takes user input for the number k and m, generates the Fibonacci string of length k, takes m search queries as input, and calls the frequencies function to count the occurrences of each query in the Fibonacci string, outputting the counts. The frequencies function takes two strings as input, loops through the main string to find matches with the search string, and returns the count of matches found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    11 views1 page

    Fibonacci Strings

    Uploaded by

    da
    The document contains C code to count the frequency of substrings in a string. It takes user input for the number k and m, generates the Fibonacci string of length k, takes m search queries as input, and calls the frequencies function to count the occurrences of each query in the Fibonacci string, outputting the counts. The frequencies function takes two strings as input, loops through the main string to find matches with the search string, and returns the count of matches found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    #include<stdio.

    h>
    #include<conio.h>
    #include<string.h>
    int frequencies(char * str, char * Search);
    int main()
    {
    char a[1000][40],b[1000][40],temp[100];
    int k,m,i,j,count;
    strcpy(a[0],"a");
    strcpy(a[1],"b");
    printf("enter k,m\n");
    scanf("%d%d",&k,&m);
    for(i=2;i<k;i++)
    {
    strcpy(a[i],a[i-1]);
    strcat(a[i],a[i-2]);
    }
    printf("\nenter queries\n");
    for(j=0;j<m;j++)
    {
    scanf("%s",b[j]);
    }
    strcpy(temp,a[k-1]);
    for(i=0;i<m;i++)
    {
    count = frequencies(temp, b[i]);
    printf("%d\n",count);
    }
    return 0;
    }
    int frequencies(char * str, char * Search)
    {
    int i, j, found, count;int len, searchLen;
    len = strlen(str);
    searchLen = strlen(Search);
    count = 0;
    for(i=0; i<= len-searchLen; i++)
    {
    found = 1;
    for(j=0; j<searchLen; j++)
    {
    if(str[i + j] != Search[j])
    {
    found = 0; break;
    }
    }
    if(found == 1)
    {
    count++;
    }
    }
    return count;
    }

    You might also like