import java.util.Scanner; /** * [程序38] * * 题目:写一个函数,求一个字符串的长度,在main函数中输入字符串,并输出其长度. * * @author James * */ public class 第三十八题统计字符串的长度 { public static void main(String[] args) { System.out.println("请输入一个字符串"); Scanner in = new Scanner(System.in);
#include<stdio.h> /*使用n=strlen(s)时加这个#include<string.h>*/ int main(void) { ];/*定义变量*/ int i, j, n, k; printf("请输入一串有重复字符的字符串:\n"); gets_s(s);/*输入字符串*/ ; s[n] != '\0'; n++); /*用于得到字符串长度,也可以使用n=strlen(s);*/ ; i < n ; i++) { ; j <
SPOJ Problem Set (classical) 694. Distinct Substrings Problem code: DISUBSTR Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T<=20; Each test case consists of one string, whose length is <=
Oulipo Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7141 Accepted Submission(s): 2835 Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, wit