• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            coreBugZJ

            此 blog 已棄。

            Round Table Knights,Codeforces Beta Round #65 (Div. 2) ,C

            C. Round Table Knights
            time limit per test
            3 seconds
            memory limit per test
            256 megabytes
            input
            standard input
            output
            standard output



            There are n knights sitting at the Round Table at an equal distance from each other. Each of them is either in a good or in a bad mood.

            Merlin, the wizard predicted to King Arthur that the next month will turn out to be particularly fortunate if the regular polygon can be found. On all vertices of the polygon knights in a good mood should be located. Otherwise, the next month will bring misfortunes.

            A convex polygon is regular if all its sides have same length and all his angles are equal. In this problem we consider only regular polygons with at least 3 vertices, i. e. only nondegenerated.

            On a picture below some examples of such polygons are present. Green points mean knights in a good mood. Red points mean ones in a bad mood.

            King Arthur knows the knights' moods. Help him find out if the next month will be fortunate or not.



            Input

            The first line contains number n, which is the number of knights at the round table (3 ≤ n ≤ 105). The second line contains space-separated moods of all the n knights in the order of passing them around the table. "1" means that the knight is in a good mood an "0" means that he is in a bad mood.

            Output

            Print "YES" without the quotes if the following month will turn out to be lucky. Otherwise, print "NO".



            Sample test(s)
            Input
            3
            1 1 1
            Output
            YES

            Input
            6
            1 0 1 1 1 0
            Output
            YES

            Input
            6
            1 0 0 1 0 1
            Output
            NO



            水之。。。


             1 #include <iostream>
             2 #include <cstdio>
             3 
             4 using namespace std;
             5 
             6 #define  L  100009
             7 int n, a[ L ], s[ L ];
             8 
             9 int yes() {
            10         int i, j, m = n/3, k;
            11         for ( i = 1; i <= m; ++i ) {
            12                 if ( n % i == 0 ) {
            13                         for ( j = 1; j <= i; ++j ) {
            14                                 s[ j ] = a[ j ];
            15                         }
            16                         for ( j = i+1; j <= n; ++j ) {
            17                                 s[ j ] = s[ j - i ] + a[ j ];
            18                         }
            19                         k = n / i;
            20                         for ( j = n-i+1; j <= n; ++j ) {
            21                                 if ( s[ j ] == k ) {
            22                                         return 1;
            23                                 }
            24                         }
            25                 }
            26         }
            27         return 0;
            28 }
            29 
            30 int main() {
            31         int i;
            32         while ( scanf( "%d"&n ) == 1 ) {
            33                 for ( i = 1; i <= n; ++i ) {
            34                         scanf( "%d", a+i );
            35                 }
            36                 if ( yes() ) {
            37                         puts( "YES" );
            38                 }
            39                 else {
            40                         puts( "NO" );
            41                 }
            42         }
            43         return 0;
            44 }
            45 


            posted on 2011-03-31 20:43 coreBugZJ 閱讀(388) 評論(0)  編輯 收藏 引用 所屬分類: ACM

            色老头网站久久网| 亚洲综合伊人久久综合| 日本久久久精品中文字幕| 久久综合综合久久97色| 久久婷婷五月综合成人D啪| 久久人人爽人人人人爽AV| aaa级精品久久久国产片| 久久久网中文字幕| 久久久久久国产精品免费无码| 久久精品国产91久久综合麻豆自制| 久久精品夜色噜噜亚洲A∨| 久久久www免费人成精品| 青青草原综合久久| 日产精品99久久久久久| 久久99精品久久久久久噜噜 | 久久91精品国产91久| www.久久热.com| 777午夜精品久久av蜜臀| 久久九九亚洲精品| 精品免费久久久久久久| 久久精品免费全国观看国产| 青青草国产精品久久久久| 亚洲AV日韩AV天堂久久| 免费精品国产日韩热久久| 国产精品免费久久| 亚洲狠狠综合久久| 久久免费国产精品一区二区| 无码AV波多野结衣久久| 99精品国产99久久久久久97 | 久久精品国产精品亜洲毛片| 99精品国产在热久久| 久久九九精品99国产精品| 欧美亚洲国产精品久久久久| 亚洲婷婷国产精品电影人久久| 国内精品久久久久久麻豆| 国产精品99久久久久久董美香 | 久久免费视频一区| 久久综合亚洲色HEZYO国产| 久久久久99精品成人片| 久久久久婷婷| 97精品伊人久久久大香线蕉 |