UVA - 10340 All in All
来源:互联网 发布:怎样把nginx部署到公网 编辑:程序博客网 时间:2024/05/01 18:40
UVA - 10340 All in All
题目大意:给定2个字符串 判断后面一个字符串经过删减后是否能得到前面打字符串
解题思路: 将前面打字符串的字符单个取出 并按顺序与后一个字符串 一一对比
#include <stdio.h>#include <string.h>int main(){ char a[100000],b[100000]; while (scanf("%s%s", &a, &b) != EOF ){ bool bb = 1; int s = 0; int a1 = strlen(a); int b1 = strlen(b); for (int i = 0; i < a1; i++) { for (int j = s; j < b1; j++){ if ( a[i] == b[j] ){ bb = 1; s = j + 1; break; } else bb = 0; } if (!bb) break; } if ( bb ) printf("Yes\n"); else printf("No\n"); }}
0 0
- UVa 10340 - All in All
- UVa 10340 - All in All
- uva 10340 - All in All
- uva 10340 - All in All
- UVa 10340 - All in All
- UVA 10340 All in All
- UVa 10340 - All in All
- uva 10340 all in all
- UVa 10340 - All in All
- Uva 10340 ALL IN ALL
- uva 10340 All in All
- UVA 10340 - All in All
- uva 10340 All in All
- uva 10340 All in All
- uva 10340 All in All
- uva 10340 - All in All
- UVA-10340-All in All
- UVa 10340 - All in All
- Hdu 4016 Magic Bitwise And Operation
- linux 目录结构
- UVA - 1368 DNA Consensus String
- UVA - 1587 Box
- Stree 解题报告
- UVA - 10340 All in All
- Junit学习之路二--搭建环境
- UVA - 232 Crossword Answers
- 拓扑序列的实现
- STM32上移植FreeRTOS
- UVA - 401 Palindromes
- UVA - 10010 Where's Waldorf?
- Android性能优化之ViewStub
- UVA - 1586 Molar mass?