NYOJ NO.5 Binary String Matching
来源:互联网 发布:codol武器大全数据 编辑:程序博客网 时间:2024/04/29 01:09
#include<stdio.h>#include<string.h>int main(){ int n; scanf("%d", &n); while(n--) { char a[15], b[1005], c[15]; int lenga, lengb, i , j ,k, sum = 0; scanf("%s", a); scanf("%s", b); lenga = strlen(a); lengb = strlen(b); for(i = 0; i <= lengb - lenga; i++) { for(j = 0; j< lenga; j++) c[j] = b[i+j]; c[j] = '\0'; if(!strcmp(a ,c)) sum++; } printf("%d\n",sum); } return 0;}
0 0
- NYOJ NO.5 Binary String Matching
- NYoj 5 Binary String Matching
- NYOJ 5 Binary String Matching
- NYOJ 5-Binary String Matching
- nyoj-5-Binary String Matching
- NYOJ 5 Binary String Matching
- nyoj 5Binary String Matching
- NYOJ 5 Binary String Matching
- Nyoj 5 Binary String Matching
- NYOJ 5 Binary String Matching
- NYOJ-5 Binary String Matching
- 【NYOJ-5】 Binary String Matching
- nyoj 5 Binary String Matching
- nyoj-5 Binary String Matching
- NYOJ 5 Binary String Matching
- nyoj 5 Binary String Matching
- NYOJ 5 Binary String Matching
- NYOJ 5 Binary String Matching
- Construct Binary Tree from Preorder and Inorder Traversal
- const与#define优缺点
- if判断和比较
- 杨幂与刘恺威首度合体古装戏 曝因怀孕辞演秋香
- HDU 4722 Good Numbers
- NYOJ NO.5 Binary String Matching
- NYOJ NO.86 找球号(一)
- Construct Binary Tree from Inorder and Postorder Traversal
- c/c++和java层函数互调
- java 基础5 抽象类 接口 final
- new/delete和malloc/free的使用场合和区别
- 后端控制器之MultiActionController
- 深度优先算法和广度优先算法
- 游戏中自动寻路通用算法