1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
| #include <iostream>
#include <cstring>
#include <algorithm>
#include <deque>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <bitset>
#include <iterator>
#include <random>
#include <iomanip>
using namespace std;
typedef long long ll;
const ll N= 1010;
ll n,sum[N],ans[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n-1;++i) {
cout<<"? 1 "<<n-i+1<<endl;
cin>>sum[n-i+1];
}
cout<<"? 2 3"<<endl;
ll temp;
cin>>temp;
for(int i=n;i>=3;--i) {
ans[i]=sum[i]-sum[i-1];
}
ans[1]=sum[3]-temp;
ans[2]=sum[2]-ans[1];
cout<<"! ";
for(int i=1;i<=n;++i) {
cout<<ans[i]<<" ";
}
cout<<endl;
}
|