이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1000000007;
int n;
int v[1000001];
int fr[100000001];
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n;
for(int i=0;i<n;i++)
cin>>v[i];
for(int i=0;i<100000001;i++)
fr[i]=i;
cout<<0;
return 0;
for(int i=0;i<128;i++)
{
int inc=-1;
cout<<i<<": \n";
for(int j=0;j<128;j++)
{
if(((i+j)&(1<<6))!=0)
{
//cout<<i<<" "<<j<<"\n";
if(inc==-1)
inc=j;
}
else if(j>0 && ((i+(j-1))&(1<<6))!=0)
{
cout<<inc<<" -> "<<j-1<<"\n";
inc=-1;
}
}
if(inc!=-1)
cout<<inc<<" -> "<<127<<"\n";
cout<<"\n\n\n";
}
return 0;
}
/**
sa presupunem ca toate numerele au maxim x biti (cei mai mici x biti)
((i+j)&(1<<6))!=0, i,j < 128
127 = 1111111
64 = 1000000
0:
64 -> 127
1:
63 -> 126
2:
62 -> 125
3:
61 -> 124
4:
60 -> 123
5:
59 -> 122
6:
58 -> 121
7:
57 -> 120
8:
56 -> 119
9:
55 -> 118
10:
54 -> 117
11:
53 -> 116
12:
52 -> 115
13:
51 -> 114
14:
50 -> 113
15:
49 -> 112
16:
48 -> 111
17:
47 -> 110
18:
46 -> 109
19:
45 -> 108
20:
44 -> 107
21:
43 -> 106
22:
42 -> 105
23:
41 -> 104
24:
40 -> 103
25:
39 -> 102
26:
38 -> 101
27:
37 -> 100
28:
36 -> 99
29:
35 -> 98
30:
34 -> 97
31:
33 -> 96
32:
32 -> 95
33:
31 -> 94
34:
30 -> 93
35:
29 -> 92
36:
28 -> 91
37:
27 -> 90
38:
26 -> 89
39:
25 -> 88
40:
24 -> 87
41:
23 -> 86
42:
22 -> 85
43:
21 -> 84
44:
20 -> 83
45:
19 -> 82
46:
18 -> 81
47:
17 -> 80
48:
16 -> 79
49:
15 -> 78
50:
14 -> 77
51:
13 -> 76
52:
12 -> 75
53:
11 -> 74
54:
10 -> 73
55:
9 -> 72
56:
8 -> 71
57:
7 -> 70
58:
6 -> 69
59:
5 -> 68
60:
4 -> 67
61:
3 -> 66
62:
2 -> 65
63:
1 -> 64
64:
0 -> 63
65:
0 -> 62
127 -> 127
66:
0 -> 61
126 -> 127
67:
0 -> 60
125 -> 127
68:
0 -> 59
124 -> 127
69:
0 -> 58
123 -> 127
70:
0 -> 57
122 -> 127
71:
0 -> 56
121 -> 127
72:
0 -> 55
120 -> 127
73:
0 -> 54
119 -> 127
74:
0 -> 53
118 -> 127
75:
0 -> 52
117 -> 127
76:
0 -> 51
116 -> 127
77:
0 -> 50
115 -> 127
78:
0 -> 49
114 -> 127
79:
0 -> 48
113 -> 127
80:
0 -> 47
112 -> 127
81:
0 -> 46
111 -> 127
82:
0 -> 45
110 -> 127
83:
0 -> 44
109 -> 127
84:
0 -> 43
108 -> 127
85:
0 -> 42
107 -> 127
86:
0 -> 41
106 -> 127
87:
0 -> 40
105 -> 127
88:
0 -> 39
104 -> 127
89:
0 -> 38
103 -> 127
90:
0 -> 37
102 -> 127
91:
0 -> 36
101 -> 127
92:
0 -> 35
100 -> 127
93:
0 -> 34
99 -> 127
94:
0 -> 33
98 -> 127
95:
0 -> 32
97 -> 127
96:
0 -> 31
96 -> 127
97:
0 -> 30
95 -> 127
98:
0 -> 29
94 -> 127
99:
0 -> 28
93 -> 127
100:
0 -> 27
92 -> 127
101:
0 -> 26
91 -> 127
102:
0 -> 25
90 -> 127
103:
0 -> 24
89 -> 127
104:
0 -> 23
88 -> 127
105:
0 -> 22
87 -> 127
106:
0 -> 21
86 -> 127
107:
0 -> 20
85 -> 127
108:
0 -> 19
84 -> 127
109:
0 -> 18
83 -> 127
110:
0 -> 17
82 -> 127
111:
0 -> 16
81 -> 127
112:
0 -> 15
80 -> 127
113:
0 -> 14
79 -> 127
114:
0 -> 13
78 -> 127
115:
0 -> 12
77 -> 127
116:
0 -> 11
76 -> 127
117:
0 -> 10
75 -> 127
118:
0 -> 9
74 -> 127
119:
0 -> 8
73 -> 127
120:
0 -> 7
72 -> 127
121:
0 -> 6
71 -> 127
122:
0 -> 5
70 -> 127
123:
0 -> 4
69 -> 127
124:
0 -> 3
68 -> 127
125:
0 -> 2
67 -> 127
126:
0 -> 1
66 -> 127
127:
0 -> 0
65 -> 127
*/
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
