HDU 2515 Yanghee 的算术【找规律】

 1 #include<iostream>  
 2 #include<cstdio>  
 3 #include<cstring> 
 4 #include <cmath> 
 5 #include<stack>
 6 #include<vector>
 7 #include<map> 
 8 #include<set>
 9 #include<queue> 
10 #include<algorithm>  
11 using namespace std;
12 
13 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
14 
15 typedef long long LL;
16 const int INF = (1<<30)-1;
17 const int mod=1000000007;
18 const int maxn=100005;
19 
20 
21 int a[maxn],sum[maxn];
22 
23 int main(){
24     
25     int n;
26     cin>>n;
27     for(int i=1;i<=n*(n-1)/2;i++) cin>>sum[i];
28     
29     a[1]=(sum[1]+sum[2]-sum[n])/2;
30     
31     for(int i=2;i<=n;i++)
32     a[i]=sum[i-1]-a[1];
33     
34     for(int i=1;i<=n;i++)
35     printf("%d\n",a[i]);
36     
37     return 0;
38 }