【读入】#36 A. Extra-terrestrial Intelligence

本文介绍了一种检测外星信号规律性的算法实现。通过记录连续信号间的等间距判断是否有智慧生命迹象。

A. Extra-terrestrial Intelligence
time limit per test
2 seconds
memory limit per test
64 megabytes
input
input.txt
output
output.txt

Recently Vasya got interested in finding extra-terrestrial intelligence. He made a simple extra-terrestrial signals’ receiver and was keeping a record of the signals for n days in a row. Each of those n days Vasya wrote a 1 in his notebook if he had received a signal that day and a 0 if he hadn’t. Vasya thinks that he has found extra-terrestrial intelligence if there is a system in the way the signals has been received, i.e. if all the intervals between successive signals are equal. Otherwise, Vasya thinks that the signals were sent by some stupid aliens no one cares about. Help Vasya to deduce from the information given by the receiver if he has found extra-terrestrial intelligence or not.

Input

The first line contains integer n (3 ≤ n ≤ 100) — amount of days during which Vasya checked if there were any signals. The second line contains n characters 1 or 0 — the record Vasya kept each of those n days. It’s guaranteed that the given record sequence contains at least three 1s.

Output

If Vasya has found extra-terrestrial intelligence, output YES, otherwise output NO.

Sample test(s)
input
8
00111000
output
YES
input
7
1001011
output
NO
input
7
1010100
output
YES

这道题……我太蠢了,真的太蠢了……我一直wa了7次,就因为我看到这个是数字然后用%d来读……全都读完了……

改成%c即AC……

这道题的意思是在10序列中看1的位置是否等距,所以使用flag记录第一个和第二个出现的1,获得步长pace,然后如果之后1不是按照pace的步长出现,即为NO,读完即为YES

#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
	int n,pace=0,p=0;
	int first=0,flag=0;
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout); 
	cin>>n;
	char c;
	scanf("%c",&c);
	for(int i=1;i<=n;i++)
	{
		scanf("%c",&c);
		if(flag==0)
		{
			if(c=='1')flag=1;
			else;
		}
		else if(flag==1)
		{
			if(c=='1')flag=2;
			else pace++;
		}
		else
		{
			if(c=='1')
			{
				if(p!=pace)
				{
					puts("NO");
					return 0;
				}
				else p=0;
			}
			else p++;
		}
	} 
	puts("YES");
	return 0;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

糖果天王

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值