2248: Sequence
| Result | TIME Limit | MEMORY Limit | Run Times | AC Times | JUDGE |
|---|---|---|---|---|---|
| 3s | 8192K | 340 | 105 | Standard |
Jojer has been given a sequence of integers, and he should find the next integer of the sequence. Can you help him? Just see the samples to understand the problem.
Input
The input consists of several test cases. Each case will give you an integer N ( 0 < N < 21 ) which indicates the number of the integers on the first line. And N integers on the next line.Output
You should output the next integer of the sequence.Sample Input
2 10 12 3 7 8 11 4 9 9 9 9 1 2
Sample Output
14 16 9 2
Problem Source: fennec
#include<stdio.h>
int main()
{
int a[50][50];
int n,i,j;
while(scanf("%d",&n)==1)
{
for(i=0;i<n;i++) scanf("%d",&a[0][i]);
for(i=1;i<n;i++) for(j=0;j+i<n;j++) a[i][j]=a[i-1][j+1]-a[i-1][j];
a[n-1][1]=a[n-1][0];
for(i=n-2;i>=0;i--) a[i][n-i]=a[i][n-i-1]+a[i+1][n-i-1];
printf("%d/n",a[0][n]);
}
return 0;
}
本文介绍了一种用于预测整数数列中下一个数值的算法。该算法通过计算数列中各元素之间的差值来推断数列的规律,并据此预测数列的下一个数值。文章包含完整的算法实现代码。
715

被折叠的 条评论
为什么被折叠?



