Codeforces 96A： Football（水题）

Footballtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to playersof one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then thesituation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 isnot. You are given the current situation. Determine whether it is dangerous or not.InputThe first input line contains a non-empty string consisting of characters "0" and "1", which represents players. The length of the string does not exceed 100 characters.There's at least one player from each team present on the field.OutputPrint "YES" if the situation is dangerous. Otherwise, print "NO".Examplesinput

001001

output

NO

input

1000000001

output

YES

题意：给你一个字符串，这个串中只要有连着的0或1，且个数大于等于7，那么就输出YES，没有的话就输出NO。

思路：从前往后扫，碰个字符就判断他后面的是否跟他一样，一样的话cnt++，不一样的话把cnt重置为0接着扫。

#include <stdio.h>#include <string.h>int main(){char s[110];while(scanf("%s",s)!=EOF){int size=strlen(s);int cnt=1;for(int i=0;i<size;i++){if(s[i]==s[i+1]){cnt++;}if(cnt>=7){printf("%YES\n");break;}if(s[i]!=s[i+1]){cnt=1;}}if(cnt<7){printf("NO\n");}}return 0;}