-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathP173PROA.cpp
More file actions
59 lines (52 loc) · 1.06 KB
/
P173PROA.cpp
File metadata and controls
59 lines (52 loc) · 1.06 KB
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<bits/stdc++.h>
using namespace std;
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Ford(i, a, b) for(int i = a; i >= b; i--)
#define ll long long
#define here cout<<"I am Here"<<endl;
int const maxn = 1000000;
int const base = 1e9 + 7;
map <int, int> Mp, Xp;
int main(void){
int N;
int Ar[505], F[505];
bool used[505];
cin>>N;
For(i, 1, N){
cin>>Ar[i];
}
int maxs = 0;
For(i, 1, N){
F[1] = Ar[i];
For(j, 1, N){
if(j != i){
memset(used, true, sizeof used);
F[2] = Ar[j];
used[j] = false;
used[i] = false;
int x = 3, res = 2, ok = 1;
while(ok == 1){
ok = 0;
For(k, 1, N){
if(used[k] == true){
if(Ar[k] == F[x-2] + F[x-1]){
ok = 1;
F[x] = Ar[k];
x++;
res++;
used[k] = false;
}
}
}
}
if(res == N){
cout<<res;
return 0;
}
if(res > maxs) maxs = res;
}
}
}
cout<<maxs;
return 0;
}