#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 5;
long long n, arr[N], ans[N][N], dist[N];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++) cin >> arr[i];
for(int i = 1; i <= n; i++){
for(int j = i + 1; j <= n; j++){
if(arr[j] % arr[i] == 0){
dist[j] = max(dist[j], dist[i] + 1);
}
else ans[i][j] = 3;
}
}
for(int i = 1; i <= n; i++){
for(int j = i + 1; j <= n; j++){
if(ans[i][j] == 0){
if(dist[i] / 4 == dist[j] / 4) ans[i][j] = 1;
else if(dist[i] / 16 == dist[j] / 16) ans[i][j] = 2;
else ans[i][j] = 3;
}
}
}
for(int i = 2; i <= n; i++){
for(int j = 1; j < i; j++){
cout << ans[j][i] << " ";
}
cout << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
580 KB |
Output is correct |
8 |
Correct |
35 ms |
8140 KB |
Output is correct |
9 |
Correct |
1 ms |
712 KB |
Output is correct |
10 |
Correct |
1 ms |
724 KB |
Output is correct |
11 |
Correct |
31 ms |
7372 KB |
Output is correct |
12 |
Correct |
35 ms |
8140 KB |
Output is correct |
13 |
Correct |
32 ms |
7536 KB |
Output is correct |
14 |
Correct |
2 ms |
1236 KB |
Output is correct |
15 |
Correct |
32 ms |
7564 KB |
Output is correct |
16 |
Correct |
33 ms |
7588 KB |
Output is correct |
17 |
Correct |
32 ms |
7708 KB |
Output is correct |
18 |
Correct |
33 ms |
7588 KB |
Output is correct |
19 |
Correct |
34 ms |
7652 KB |
Output is correct |
20 |
Correct |
32 ms |
7648 KB |
Output is correct |
21 |
Correct |
32 ms |
7628 KB |
Output is correct |
22 |
Correct |
31 ms |
7632 KB |
Output is correct |
23 |
Correct |
35 ms |
8244 KB |
Output is correct |