Codeforces Round #519 B. Lost Array(思维)(1043B)

#include <bits/stdc++.h>
#define inf 1000005
using namespace std;
int n;
int pre[1005];
int b[1005],a[1005];

int main()
{
  scanf("%d",&n);
  int num = 0,num1 = 0;
  pre[0] = 0;
  for(int i=1;i<=n;i++){
    scanf("%d",&pre[i]);
  }
  for(int i=0;i<n;i++){
    a[i] = pre[i+1] - pre[i];
  }
  for(int i=1;i<=n;i++){
    int flag = 0;
    for(int j=i;j<=n;j++){
      if(pre[j] - pre[j-1] != a[(j-1)%i]){
        flag = 1;
        break;
      }
    }
    if(flag == 0){
      b[num++] = i;
    }
  }
  printf("%d\n",num);
  for(int i=0;i<num;i++){
    printf("%d ",b[i]);
  }
  puts("");
  return 0;
}