#include <iostream> #include <cstring> using namespace std ; int main () { char ss [ 100 ], s [ 10010 ][ 100 ], a [ 10010 ][ 100 ]; int l , i , j , k , t = 0 , b [ 10010 ]= { 0 } , p = 0 ; cin >> ss ; l = strlen ( ss ); for ( i = 0 ; i < l ; i ++) for ( j = i ; j < l ; j ++) { t ++; for ( k = i ; k <= j ; k ++) s [ t ][ k - i ]= ss [ k ]; s [ t ][ j - i +1 ]= ' \0 ' ; } for ( i = 1 ; i <= t ; i ++) if ( b
子串计算
最新推荐文章于 2022-11-08 20:07:17 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)
#include <iostream> #include <cstring> using namespace std ; int main () { char ss [ 100 ], s [ 10010 ][ 100 ], a [ 10010 ][ 100 ]; int l , i , j , k , t = 0 , b [ 10010 ]= { 0 } , p = 0 ; cin >> ss ; l = strlen ( ss ); for ( i = 0 ; i < l ; i ++) for ( j = i ; j < l ; j ++) { t ++; for ( k = i ; k <= j ; k ++) s [ t ][ k - i ]= ss [ k ]; s [ t ][ j - i +1 ]= ' \0 ' ; } for ( i = 1 ; i <= t ; i ++) if ( b