Codeforces Beta Round #36 / 36A Extra-terrestrial Intelligence(模拟)
2013-08-16 13:56
411 查看
A. Extra-terrestrial Intelligence
http://codeforces.com/problemset/problem/36/A
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
output
input
output
input
output
水。
完整代码:
http://codeforces.com/problemset/problem/36/A
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
水。
完整代码:
/*30ms,100KB*/ #include<cstdio> int main() { int n, count = 0, interval = 0; bool is_intelligence = true; freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); scanf("%d", &n); getchar(); while (n--) { if (getchar() == '1') break; } while (n--) { if (getchar() == '0') interval++; else break; } while (n--) { if (getchar() == '0') count++; else { if (count == interval) count = 0; else { is_intelligence = false; break; } } } printf(is_intelligence ? "YES" : "NO"); return 0; }
相关文章推荐
- 【codeforces 】Educational Codeforces Round 36 (Rated for Div. 2)(C.模拟 D.拓扑排序判断环)
- 【Codeforces Beta Round 2A】【模拟 map 有map的java实现哦】Winner 第一个达到最终最高分的人名
- Codeforces Beta Round #1 B. Spreadsheets 模拟
- Codeforces Beta Round #35 (Div. 2) / 35A Shell Game(模拟)
- 【Codeforces Beta Round 2C】【计算几何 转化 模拟退火】Commentator problem 求一个点,使得该点到三个圆的视角范围尽可能接近
- Codeforces Beta Round #98 (Div. 2) / 137A Postcards and photos (模拟)
- Codeforces Beta Round #90 C. Education Reform
- Codeforces Beta Round #13 E. Holes (分块)
- 【Educational Codeforces Round 36 D】 Almost Acyclic Graph
- Educational Codeforces Round 7(B)模拟
- Codeforces Round #158 (Div. 2)C. Balls and Boxes(模拟)
- Codeforces Beta Round #14 (Div. 2) C. Four Segments 水题
- Codeforces Round #126 (Div. 2) C 模拟
- Codeforces Round #360 (Div. 2) 前三题题解【简单模拟+思维+二分图判定二分染色】
- Codeforces Round #346 (Div. 2) C模拟
- Codeforces Beta Round #3——B. Lorry
- Codeforces Round 389 Div.2 B. Santa Claus and Keyboard Check(模拟)
- Codeforces Beta Round #90, problem: (C) Education Reform DP
- Codeforces Round #158 (Div. 2) C. Balls and Boxes 模拟
- 【Codeforces Round 334 (Div 2)A】【模拟 水题】Uncowed Forces CF算分模拟