submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | language stringclasses 3 values | code stringlengths 1 522k | compiler_output stringlengths 43 10.2k |
|---|---|---|---|---|
s856268833 | p03768 | C++ | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007; // 998244353
using ll = long long;
using namespace std;
struct query{
int vert;
int dist;
int col;
};
vector<int> graph[100010];
vector<query> ql;
// farbe[v] := 頂点 v は何色か？（初期値 0）
int farbe[100010];
// dmax[v] := 頂点 v から距離いくつまでのノードが塗られているか？
int dmax[100010];
void init(){
for( int i = 0; i < 100010; ++i ) dmax[i] = -1;
}
/*
void dfs( int i, int now, int nowd ){
query &q = ql[i];
if( nowd > q.dist ) return;
if( farbe[now] == 0 ) farbe[now] = q.col;
for( auto next : graph[now] ){
dfs( i, next, nowd+1 );
}
}
*/
int main(){
init();
int n, m; cin >> n >> m;
for( int i = 0; i < m; ++i ){
int a, b; cin >> a >> b; --a; --b;
graph[a].push_back(b);
graph[b].push_back(a);
}
int qnum; cin >> qnum;
for( int i = 0; i < qnum; ++i ){
int vt, dt, ct; cin >> vt >> dt >> ct; --vt;
ql.push_back((query){vt, dt, ct});
}
reverse( ql.begin(), ql.end() );
for( int i = 0; i < qnum; ++i ){
query &q = ql[i];
if( q.dist <= dmax[q.vert] ) continue;
dmax[q.vert] = q.dist;
int d[n];
for( int j = 0; j < n; ++j ) d[j] = -1;
queue<int> que;
que.insert(q.vert);
d[q.vert] = 0;
while( !que.empty() ){
int v = que.top(); que.pop();
if( farbe[v] == 0 ) farbe[v] = q.col;
if( d[v] == q.dist ) continue;
for( auto next : graph[v] ){
if( d[next] != -1 ) continue;
que.insert(next);
d[next] = d[v]+1;
}
}
}
for( int i = 0; i < n; ++i ){
cout << farbe[i] << endl;
}
} | a.cc: In function 'int main()':
a.cc:57:21: error: 'class std::queue<int>' has no member named 'insert'
57 | que.insert(q.vert);
| ^~~~~~
a.cc:60:37: error: 'class std::queue<int>' has no member named 'top'; did you mean 'pop'?
60 | int v = que.top(); que.pop();
| ^~~
| pop
a.cc:65:37: error: 'class std::queue<int>' has no member named 'insert'
65 | que.insert(next);
| ^~~~~~
|
s983763975 | p03768 | C++ |
Home
Problem
Status
Contest
User
Group
Forum
Article
Logout
_52hz
Have Fun
Begin: 2019-11-02 07:00 CST
图论和简单数据结构
End: 2019-11-05 07:00 CST
28:37:50
Elapsed: 28:37:50
Running
Remaining: 43:22:09
Overview
Problem
Status
Rank (28:37:45)
1 Comments
Rank
Team
Score
Penalty
A
B
C
D
E
F
G
12 / 34
9 / 22
1 / 3
21 / 57
19 / 84
21 / 105
12 / 44
1
Sionyyy (应智翔)
6 1953 08:09:28
(-1) 10:57:07
02:04:55
(-3) 01:04:35
04:22:29
(-3) 02:55:07
(-2)
2
parsnip (胡心畅)
6 2789 11:24:36
10:26:37
04:06:14
(-2) 02:37:17
(-2) 03:07:45
(-3) 12:06:57
(-1)
3
Dreadt (童培峻)
6 2824 12:27:12
08:26:15
03:56:55
(-1) 02:54:54
02:36:13
(-1) 13:22:48
(-8)
4
lbwnb (lbw)
6 3191 12:17:14
(-2) 08:32:36
(-1) 06:55:33
(-1) 03:56:31
(-4) 04:21:38
13:08:12
(-4)
5
zjh0709 (鸡你太美)
6 3950 13:47:21
12:58:02
(-1) 04:12:49
14:38:31
(-2) 04:13:00
14:20:51
(-2)
6
yangjiuzhi (杨久知)
6 4028 12:44:25
03:34:46
(-10) 10:59:51
07:25:11
(-15) 09:40:54
(-4) 12:03:11
(-3)
7
dsakhdkas (俞越)
6 4318 14:55:10
(-4) 07:41:53
(-1) 12:38:13
(-1) 06:24:33
(-6) 11:03:10
(-5) 13:35:56
8
Pictures
5 1249 07:33:57
(-1) 02:16:57
01:22:07
(-1) 04:14:32
(-1) 03:21:54
(-3)
9
Enkidu (lyh刘玥含)
5 3093 12:42:06
13:21:54
08:24:33
(-4) 06:55:05
(-1) 07:49:38
(-2) (-1)
10
2421594879 (郑权涌)
5 3268 14:54:48
06:42:52
(-2) 04:05:09
(-8) 08:29:16
(-10) 13:36:50
11
d_j (丁杰)
5 3818 12:32:03
(-7) 10:12:10
10:35:48
(-11) 08:03:19
14:55:31
(-4)
12
LHJKY (蒟蒻qt)
4 1776 12:27:46
(-1) 07:14:34
(-3) 03:42:18
(-1) 02:32:07
(-6)
13
Centuryee (徐维蔓)
4 2003 08:10:59
04:14:19
07:40:47
(-1) 12:17:43
(-2)
14
nzc (nzc)
4 2343 12:09:59
(-1) 08:19:10
(-1) 10:21:56
06:32:34
(-3)
15
pigzhou (小周猪猪)
3 727 (-1) 04:24:16
(-1) 02:04:11
(-1) 03:58:38
(-3)
16
zhuchangcheng (朱昶成)
3 1468 06:54:42
(-2) 11:13:05
(-3) 04:00:33
(-2)
17
yangjiahan_2023 (杨佳涵)
3 1639 05:59:07
(-4) 09:34:00
(-7) 04:25:57
(-11)
18
weihongyu (魏宏宇)
3 1702 04:11:31
08:16:11
(-3) 14:34:21
(-1)
19
liuchengguo (刘成果)
3 1710 (-2) 06:59:22
(-2) 15:01:35
04:49:49
(-3)
20
qyxpsx7 (潘舒钘)
3 2412 12:13:41
(-3) 07:39:36
(-15) 13:39:19
(-2)
21
chushouTV (蔡徐坤)
2 652 03:47:22
(-3) 02:45:15
(-10)
22
hzk_cpp (专业卖鱼100年)
1 896 14:16:02
(-2)
23
Froggyzqy (Froggy)
0 0 (-2) (-1)
24
_52hz (_52hz)
0 0 (-2)
[Find me]
All Copyright Reserved © 2010-2019 Xu Han
Server Time: 2019-11-03 11:37:50 CST
_52hz (_52hz)'s submissions for problem D
RunID Status Memory Time Language Length Submit Time
22650645
Submitted
C++14 (GCC 5.3.0)
971 28:31:28
22650620
Runtime Error
Bash (GNU bash v4.3.11)
971 28:30:18
_52hz (_52hz)'s submissions for problem D
RunID Status Memory Time Language Length Submit Time
22650645
Submitted
C++14 (GCC 5.3.0)
971 28:31:28
22650620
Runtime Error
Bash (GNU bash v4.3.11)
971 28:30:18
#22650645 | _52hz's solution for [Problem D]
Status
Wrong Answer
Length
971
Lang
C++14 (GCC 5.3.0)
Submitted
2019-11-03 11:31:28
Shared
8.0 / 35.0
Select Code
#include <bits/stdc++.h>
typedef long long ll;
const int maxn = 1e5 + 10;
int f[maxn][11], cor[maxn];
int a[maxn], b[maxn], c[maxn];
int n, m, q, x, y;
std::vector <int> v[maxn];
void Work(int x, int y, int z){
if (~f[x][y]) return;
if (!cor[x]) cor[x] = z;
if (y <= 0) return;
for (auto u : v[x]){
Work(u, y - 1, z);
}
f[x][y] = 1;
}
int read(){ int x = 0, ch = getchar(), f = 1; while(!isdigit(ch)){if(ch == '-')f = -1; ch = getchar();} while(isdigit(ch)){ x = x * 10 + ch - '0', ch = getchar();} return x * f; }
int main()
{
// freopen(".in","r",stdin); freopen(".out","w",stdout);
n = read(), m = read();
for(int i = 1; i <= m; ++ i) x = read(), y = read(), v[x].push_back(y), v[y].push_back(x);
q = read();
for( int i = 1; i <= n; ++ i ) a[i] = read(), b[i] = read(), c[i] = read();
memset(f, -1, sizeof f);
for( int i = q; i >= 1; i --) Work(a[i], b[i], c[i]);
for(int i = 1; i <= n ; ++ i) printf("%d\n", cor[i]);
return 0;
}
Preview:
| a.cc:21:18: error: invalid digit "9" in octal constant
21 | Remaining: 43:22:09
| ^~
a.cc:65:25: error: invalid digit "8" in octal constant
65 | 6 1953 08:09:28
| ^~
a.cc:65:28: error: invalid digit "9" in octal constant
65 | 6 1953 08:09:28
| ^~
a.cc:84:9: error: invalid digit "8" in octal constant
84 | 08:26:15
| ^~
a.cc:93:9: error: invalid digit "8" in octal constant
93 | (-2) 08:32:36
| ^~
a.cc:97:12: error: invalid digit "8" in octal constant
97 | 13:08:12
| ^~
a.cc:114:9: error: invalid digit "9" in octal constant
114 | (-15) 09:40:54
| ^~
a.cc:138:17: error: invalid digit "8" in octal constant
138 | 08:24:33
| ^~
a.cc:146:15: error: invalid digit "9" in octal constant
146 | (-2) 04:05:09
| ^~
a.cc:147:9: error: invalid digit "8" in octal constant
147 | (-8) 08:29:16
| ^~
a.cc:155:9: error: invalid digit "8" in octal constant
155 | (-11) 08:03:19
| ^~
a.cc:167:49: error: invalid digit "8" in octal constant
167 | 4 2003 08:10:59
| ^~
a.cc:174:28: error: invalid digit "9" in octal constant
174 | 4 2343 12:09:59
| ^~
a.cc:175:25: error: invalid digit "8" in octal constant
175 | (-1) 08:19:10
| ^~
a.cc:194:9: error: invalid digit "9" in octal constant
194 | (-4) 09:34:00
| ^~
a.cc:200:9: error: invalid digit "8" in octal constant
200 | 08:16:11
| ^~
a.cc:231:24: error: extended character © is not valid in an identifier
231 | All Copyright Reserved © 2010-2019 Xu Han
| ^
a.cc:233:14: warning: missing terminating ' character
233 | _52hz (_52hz)'s submissions for problem D
| ^
a.cc:233:14: error: missing terminating ' character
233 | _52hz (_52hz)'s submissions for problem D
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:238:12: error: too many decimal points in number
238 | C++14 (GCC 5.3.0)
| ^~~~~
a.cc:243:18: error: too many decimal points in number
243 | Bash (GNU bash v4.3.11)
| ^~~~~
a.cc:245:14: warning: missing terminating ' character
245 | _52hz (_52hz)'s submissions for problem D
| ^
a.cc:245:14: error: missing terminating ' character
245 | _52hz (_52hz)'s submissions for problem D
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:250:12: error: too many decimal points in number
250 | C++14 (GCC 5.3.0)
| ^~~~~
a.cc:255:18: error: too many decimal points in number
255 | Bash (GNU bash v4.3.11)
| ^~~~~
a.cc:257:11: error: "|" is not a valid filename
257 | #22650645 | _52hz's solution for [Problem D]
| ^
a.cc:257:18: warning: missing terminating ' character
257 | #22650645 | _52hz's solution for [Problem D]
| ^
a.cc:263:20: error: too many decimal points in number
263 | C++14 (GCC 5.3.0)
| ^~~~~
a.cc:2:1: error: 'Home' does not name a type
2 | Home
| ^~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:62,
from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
from a.cc:271:
/usr/include/c++/14/ext/type_traits.h:164:35: error: 'constexpr const bool __gnu_cxx::__is_null_pointer' redeclared as different kind of entity
164 | __is_null_pointer(std::nullptr_t)
| ^
/usr/include/c++/14/ext/type_traits.h:159:5: note: previous declaration 'template<class _Type> constexpr bool __gnu_cxx::__is_null_pointer(_Type)'
159 | __is_null_pointer(_Type)
| ^~~~~~~~~~~~~~~~~
/usr/include/c++/14/ext/type_traits.h:164:26: error: 'nullptr_t' is not a member of 'std'; did you mean 'nullptr_t'?
164 | __is_null_pointer(std::nullptr_t)
| ^~~~~~~~~
In file included from /usr/include/c++/14/cstddef:50,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:41:
/usr/lib/gcc/x86_64-linux-gnu/14/include/stddef.h:443:29: note: 'nullptr_t' declared here
443 | typedef decltype(nullptr) nullptr_t;
| ^~~~~~~~~
In file included from /usr/include/c++/14/bits/stl_pair.h:60,
from /usr/include/c++/14/bits/stl_algobase.h:64:
/usr/include/c++/14/type_traits:666:33: error: 'nullptr_t' is not a member of 'std'; did you mean 'nullptr_t'?
666 | struct is_null_pointer<std::nullptr_t>
| ^~~~~~~~~
/usr/lib/gcc/x86_64-linux-gnu/14/include/stddef.h:443:29: note: 'nullptr_t' declared here
443 | typedef decltype(nullptr) nullptr_t;
| ^~~~~~~~~
/usr/include/c++/14/type_traits:666:42: error: template argument 1 is invalid
666 | struct is_null_pointer<std::nullptr_t>
| ^
/usr/include/c++/14/type_traits:670:48: error: template argument 1 is invalid
670 | struct is_null_pointer<const std::nullptr_t>
| ^
/usr/include/c++/14/type_traits:674:51: error: template argument 1 is invalid
674 | struct is_null_pointer<volatile std::nullptr_t>
| ^
/usr/include/c++/14/type_traits:678:57: error: template argument 1 is invalid
678 | struct is_null_pointer<const volatile std::nullptr_t>
| ^
/usr/include/c++/14/type_traits:1429:37: error: 'size_t' is not a member of 'std'; did you mean 'size_t'?
1429 | : public integral_constant<std::size_t, alignof(_Tp)>
| ^~~~~~
/usr/lib/gcc/x86_64-linux-gnu/14/include/stddef.h:214:23: note: 'size_t' declared here
214 | typedef __SIZE_TYPE__ size_t;
| ^~~~~~
/usr/include/c++/14/type_traits:1429:57: error: template argument 1 is invalid
1429 | : public integral_constant<std::size_t, alignof(_Tp)>
| ^
/usr/include/c++/14/type_traits:1429:57: note: invalid template non-type parameter
/usr/include/c++/14/type_traits:1438:37: error: 'size_t' is not a member of 'std'; did you mean 'size_t'?
1438 | : public integral_constant<std::size_t, 0> { };
| ^~~~~~
/usr/lib/gcc/x86_64-linux-gnu/14/include/stddef.h:214:23: note: 'size_t' declared here
214 | typedef __SIZE_TYPE__ size_t;
| ^~~~~~
/usr/include/c++/14/type_traits:1438:46: error: template argument 1 is invalid
1438 | : public integral_constant<std::size_t, 0> { };
| ^
/usr/include/c++/14/type_traits:1438:46: note: invalid template non-type parameter
/usr/include/c++/14/type_traits:1440:26: error: 'std::size_t' has not been declared
1440 | template<typename _Tp, std::size_t _Size>
| ^~~
/usr/include/c++/14/type_traits:1441:21: error: '_Size' was not declared in this scope
1441 | struct rank<_Tp[_Size]>
| ^~~~~
/usr/include/c++/14/type_traits:1441:27: error: template argument 1 is invalid
1441 | struct rank<_Tp[_Size]>
| ^
/usr/include/c++/14/type_traits:1442:37: error: 'size_t' is not a member of 'std'; did you mean 'size_t'?
1442 | : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
| ^~~~~~
/usr/lib/gcc/x86_64-linux-gnu/14/include/stddef.h:214:23: note: 'size_t' declared here
214 | typedef __SIZE_TYPE__ size_t;
| ^~~~~~
/usr/include/c++/14/type_traits:1442:65: error: template argument 1 is invalid
1442 | : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
| ^
/usr/include/c++/14/type_traits:1442:65: note: invalid template non-type parameter
/usr/include/c++/14/type_traits:1446:37: error: 'size_t' is not a member of 'std'; did you mean 'size_t'?
1446 | : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
| ^~~~~~
/usr/lib/gcc/x86_64-linux-gnu/14/include/stddef.h:214:23: note: 'size_t' declared here
214 | typedef __SIZE_TYPE__ size_t;
| ^~~~~~
/usr/include/c++/14/type_traits:1446:65: error: template argument 1 is invalid
1446 | : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
| ^
/usr/include/c++/14/type_traits:1446:65: note: invalid template non-type parameter
/usr/include/c++/14/type_traits:2086:26: error: 'std::size_t' has not been declared
2086 | template<typename _Tp, std::size_t _Size>
| ^~~
/usr/include/c++/14/type_traits:2087:30: error: '_Size' was not declared in this scope
2087 | struct remove_extent<_Tp[_Size]>
| ^~~~~
/usr/include/c++/14/type_traits:2087:36: error: template argument 1 is invalid
2087 | struct remove_extent<_Tp[_Size]>
| ^
/usr/include/c++/14/type_traits:2099:26: error: 'std::size_t' has not been declared
2099 | template<typename _Tp, std::size_t _Size>
| ^~~
/usr/include/c++/14/type_traits:2100:35: error: '_Size' was not declared in this scope
2100 | struct remove_all_extents<_Tp[_Size]>
| ^~~~~
/usr/include/c++/14/type_traits:2100:41: error: template argument 1 is invalid
2100 | struct remove_all_extents<_Tp[_Size]>
| ^
/usr |
s069175515 | p03768 | C | #include<bits/stdc++.h>
using namespace std;
inline int read(int &a){a=0;int f=1;char c=getchar();
for(;c<'0'||c>'9';c=getchar())if(c=='-')f=-1;
for(;c<='9' && c>='0';a=a*10+c-'0',c=getchar());return a*=f;}
inline void print(int a){int s[20],t=0;if(!a){putchar('0');putchar('\n');return;}
while(a){s[t++]=a%10,a/=10;}for(;t--;putchar(s[t]+'0'));putchar('\n');}
struct pricture{
int next,y;
} e[200010];
int link[100010],lin;
void add(int a,int b){e[++lin].next=link[a],link[a]=lin,e[lin].y=b;}
int n,m,q;
int v[100010],d[100010],c[100010];
int s[100010],a[100010];
void dfs(int x,int d,int l)
{
if(!a[x]) a[x]=l;
if(!d || s[x]>=d) return;
s[x]=d;
for(int i=link[x];i;i=e[i].next)
dfs(e[i].y,d-1,l);
}
int main()
{
read(n),read(m);
for(int i=1;i<=m;i++)
{
int s,t;
read(s),read(t);
add(s,t);
add(t,s);
}
read(q);
for(int i=1;i<=q;i++) read(v[i]),read(d[i]),read(c[i]);
for(int i=q;i>=1;i--) dfs(v[i],d[i],c[i]);
for(int i=1;i<=n;i++) print(a[i]);
return 0;
} | main.c:1:9: fatal error: bits/stdc++.h: No such file or directory
1 | #include<bits/stdc++.h>
| ^~~~~~~~~~~~~~~
compilation terminated.
|
s547919112 | p03768 | C++ | ok.
reverse order.
Remember the radius at each vertex while searching.
Then, it is guaranteed that an edge is visited at most 10 times.
| a.cc:1:1: error: 'ok' does not name a type
1 | ok.
| ^~
|
s494688878 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1000000007;
struct point{int start,rest,color;};
template<class T> inline bool chmin(T &a,T b){
if (a>b){
a=b;
return true;
}
return false;
}
template<class T> inline bool chmax(T &a,T b){
if (a<b){
a=b;
return true;
}
return false;
}
int main() {
ll N,M;
cin >> N >> M;
vector<vector<ll>> G(N);
rep(i,M){
ll a,b;
cin >> a >> b;
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
ll Q;
cin >> Q;
vector<ll> v(Q),d(Q),c(Q);
rep(i,Q){
cin >> v[i] >> d[i] >> c[i];
v[i]--;
}
queue<point> que;
vector<ll> ans(N,0),range(N,0);
for (ll i=Q-1;i>=0;i--){
if (d[i]!=0){
que.push(point{v[i],d[i],c[i]});
}
chmax(range[v[i]],d[i]);
if (ans[v[i]]==0){
ans[v[i]]=c[i];
}
while(!que.empty()){
point p=que.front();
que.pop();
for (auto x:G[p.start]){
if (ans[x]==0){
ans[x]=p.color;
}
if (p.rest>1&&chmax(range[x],p.rest-1)){
que.push(point{x,p.rest-1,p.color});
}
}
}
}
rep(i,N){
cout << ans[i] << endl;
}
} | a.cc: In function 'int main()':
a.cc:48:42: warning: narrowing conversion of 'v.std::vector<long long int>::operator[](((std::vector<long long int>::size_type)i))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
48 | que.push(point{v[i],d[i],c[i]});
| ^
a.cc:48:42: warning: narrowing conversion of 'd.std::vector<long long int>::operator[](((std::vector<long long int>::size_type)i))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
a.cc:48:42: warning: narrowing conversion of 'c.std::vector<long long int>::operator[](((std::vector<long long int>::size_type)i))' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
a.cc:61:36: error: no matching function for call to 'chmax(__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type&, int)'
61 | if (p.rest>1&&chmax(range[x],p.rest-1)){
| ~~~~~^~~~~~~~~~~~~~~~~~~
a.cc:18:31: note: candidate: 'template<class T> bool chmax(T&, T)'
18 | template<class T> inline bool chmax(T &a,T b){
| ^~~~~
a.cc:18:31: note: template argument deduction/substitution failed:
a.cc:61:36: note: deduced conflicting types for parameter 'T' ('long long int' and 'int')
61 | if (p.rest>1&&chmax(range[x],p.rest-1)){
| ~~~~~^~~~~~~~~~~~~~~~~~~
a.cc:62:36: warning: narrowing conversion of 'x' from 'long long int' to 'int' [-Wnarrowing]
62 | que.push(point{x,p.rest-1,p.color});
| ^
|
s058663225 | p03768 | C++ | bool done[100010][15];
void f(int v,int d,int c)
{
if(done[v][d]) return;
done[v][d]=true;
if(colour[v]==0) colour[v]=c;
if(d==0) return;
for(int i=0;i<edge[v].size();i++)
{
int to=edge[v][i];
f(to,d-1,c);
}
} | a.cc: In function 'void f(int, int, int)':
a.cc:7:8: error: 'colour' was not declared in this scope
7 | if(colour[v]==0) colour[v]=c;
| ^~~~~~
a.cc:9:19: error: 'edge' was not declared in this scope
9 | for(int i=0;i<edge[v].size();i++)
| ^~~~
|
s775912845 | p03768 | C++ | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace std;
bool prime_(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b){
if(a<b){
swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd_(b,a%b);
}
}
long long lcm_(long long x, long long y){
return (x/gcd_(x,y))*y;
}
class UnionFind {
public:
//各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
//クラスを作るときは、Parentの値を全て-1にする。
//以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) {
Parent = vector<int>(N, -1);
}
//Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0) return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)];//先祖をrootで取っておきたい。
}
//AとBをくっ付ける
bool connect(int A, int B) {
//AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B)) swap(A, B);
//Aのサイズを更新する
Parent[A] += Parent[B];
//Bの親をAに変更する
Parent[B] = A;
return true;
}
};
vector<int> G[100'010];
vector<bool> used(100'010, false);
vector<int> color(100'010, 0);
void dfs(int v, int d, int c){
if(!used[v]){
color[v] = c;
used[v] = true;
}
if(d>0){
dfs(v, d-1, c);
}else{
return;
}
for(int next_:G[v]){
dfs(next_, d-1, c);
}
return;
}
int main(){
int n,m;
cin>>n>>m;
int a,b;
REP(i,m){
cin>>a>>b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
int q;
cin>>q;
int v[q],d[q],c[q];
REP(i,q){
cin>>v[i]>>d[i]>>c[i];
v[i]--;
}
for(int i=q-1;i>=0;i--){
dfs(v[i], q[i], c[i]);
}
REP(i,n){
cout<<color[i]<<endl;
}
return 0;
}
| a.cc: In function 'int main()':
a.cc:129:16: error: invalid types 'int[int]' for array subscript
129 | dfs(v[i], q[i], c[i]);
| ^
|
s668303698 | p03768 | C++ | 14 10
1 4
5 7
7 11
4 10
14 7
14 3
6 14
8 11
5 13
8 3
8
8 6 2
9 7 85
6 9 3
6 7 5
10 3 1
12 9 4
9 6 6
8 2 3 | a.cc:1:1: error: expected unqualified-id before numeric constant
1 | 14 10
| ^~
|
s994202664 | p03768 | C++ | 14 10
1 4
5 7
7 11
4 10
14 7
14 3
6 14
8 11
5 13
8 3
8
8 6 2
9 7 85
6 9 3
6 7 5
10 3 1
12 9 4
9 6 6
8 2 3 | a.cc:1:1: error: expected unqualified-id before numeric constant
1 | 14 10
| ^~
|
s964827210 | p03768 | C++ | #include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
using namespace std;
#define MOD 1000000007
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define ll long long
#define ull unsigned long long
#define all(hoge) (hoge).begin(),(hoge).end()
const long long INF = 1LL << 60;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
//sortは初期で昇順 greater<hoge>()で降順
//substr 文字列取り出し
//upper_bound ある値より大きい一番左のイテレータを返す、lowerは以上(setに対して使うとO(N)なので、setのメンバ関数を使う
//stoi
struct Edge {//グラフ
ll to, cap, rev;
Edge(ll _to, ll _cap, ll _rev) {
to = _to; cap = _cap; rev = _rev;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph& G, ll from, ll to, ll cap) {//最大フロー求める Ford-fulkerson
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
G[to].push_back(Edge(from, 0, (ll)G[from].size() - 1));
}
ll max_flow_dfs(Graph & G, ll v, ll t, ll f, vector<bool> & used)
{
if (v == t)
return f;
used[v] = true;
for (int i = 0; i < G[v].size(); ++i) {
Edge& e = G[v][i];
if (!used[e.to] && e.cap > 0) {
ll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
ll max_flow(Graph & G, ll s, ll t)
{
ll flow = 0;
for (;;) {
vector<bool> used(G.size());
REP(i, used.size())used[i] = false;
ll f = max_flow_dfs(G, s, t, INF, used);
if (f == 0) {
return flow;
}
flow += f;
}
}
template<class T> inline bool chmin(T & a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T & a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
class UnionFind {
vector<int> data;
public:
UnionFind(int size) : data(size, -1) { }
bool unionSet(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
bool findSet(int x, int y) {
return root(x) == root(y);
}
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) {
return -data[root(x)];
}
};
//約数求める //約数
void divisor(ll n, vector<ll> & ret) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
}
//階乗
long long factorial(long long n, long long mod) {
long long ret = 1;
for (long long i = 1; i <= n; i++) {
ret = (ret * i) % mod;
}
return ret;
}
//モジュラ逆数
long long inv_mod(long long n, long long mod) {
long long a = n % mod, b = mod - 2, ret = 1;
while (b > 0) {
if (b & 1) ret = (ret * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ret;
}
long long nPr(long long n, long long r, long long mod) {
long long ret = 1;
for (long long i = n; i >= n - r + 1; i--) {
ret = ret * (i % mod) % mod;
}
return ret;
}
long long nCr(long long n, long long r, long long mod) {
return nPr(n, r, mod)* inv_mod(factorial(r, mod), mod) % mod;
}
bool compare_by_b(pair<ll, ll> a, pair<ll, ll> b) {//降順second
if (a.second != b.second) {
return a.second > b.second;
}
else {
return a.first > b.first;
}
}
bool compare_by_a(pair<ll, ll> a, pair<ll, ll> b) {//降順first
if (a.first != b.first) {
return a.first > b.first;
}
else {
return a.second > b.second;
}
}
ll gcd(ll m, ll n) {
if (n == 0)return m;
return gcd(n, m % n);
}//gcd
ll dp[100001][11];
ll dfs(Graph &graph,ll v,ll d,ll i,Array &used) {
if (d == -1)return 0;
if (chmin(dp[v][d], (ll)i)) {
REP(j, d) {
chmin(dp[v][j], (ll)i);
}
REP(j, graph[v].size()) {
dfs(graph, graph[v][j].to, d - 1, i, used);
}
}
}
int main() {
ll n, m;
cin >> n >> m;
Graph graph(n + 1);
REP(i, m) {
ll a, b;
cin >> a >> b;
add_edge(graph, a, b, 0);
}
ll q;
cin >> q;
Array v(q), d(q), c(q);
REP(i, q) {
cin >> v[i] >> d[i] >> c[i];
}
REP(i, 100001) {
REP(j, 11) {
dp[i][j] = INF;
}
}
REP(i, q) {
dfs(graph, v[q - i - 1], d[q - i - 1], i, used);
}
REP(i, n) {
if (dp[i + 1][0] == INF) {
cout << 0 << endl;
}
else {
cout << c[q - 1 - dp[i + 1][0]] << endl;
}
}
return 0;
}
| a.cc: In function 'int main()':
a.cc:212:59: error: 'used' was not declared in this scope
212 | dfs(graph, v[q - i - 1], d[q - i - 1], i, used);
| ^~~~
a.cc: In function 'long long int dfs(Graph&, long long int, long long int, long long int, Array&)':
a.cc:190:1: warning: control reaches end of non-void function [-Wreturn-type]
190 | }
| ^
|
s103081874 | p03768 | C++ |
using namespace std;
int N, M, Q, a[100005], b[100005], v[100005],c[100005],d[100005];
vector<int> Adj[100005];
int q[100005];
int dis[100005];
/*int D_base;
int query_num;
void INIT(int K, int D) {
dis[K] = D;
if ((q[K] > 0) && ( D_base - dis[K] <= d[q[K]])) {
if (query_num < q[K]) { query_num = q[K]; }
}
if (D > 0) {
for (int u = 0; u < (int)Adj[K].size(); u++) {
int H = Adj[K][u];
if (dis[H] < D) { INIT(H, D - 1); }
}
}
dis[K] = 0;
}
*/
int check[100005];
int color[100005];
/*void PAINT(int v, int d, int c) {
check[v] = d;
if (color[v] == 0) { color[v] = c; }
if (d > 0) {
for (int u = 0; u < (int)Adj[v].size(); u++) {
int w = Adj[v][u];
if (check[w] < d) { PAINT(w, d - 1, c); }
//PAINT(w, d - 1, c);
}
}
check[v] = 0;
}*/
int memo[100005][15];
void FUNC(int V, int D, int C) {
//cout << "V= " << V << " D= " << D <<" C= " <<C<< endl;
memo[V][D] = C;
if (D>0 && memo[V][D - 1] == 0) { FUNC(V,D - 1,C); }
for (int u = 0; u < (int)Adj[V].size(); u++) {
int H = Adj[V][u];
if (D>0 && memo[H][D - 1] == 0) { FUNC(H, D - 1, C); }
}
}
int main(void) {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
cin >> a[i] >> b[i];
Adj[a[i]].push_back(b[i]);
Adj[b[i]].push_back(a[i]);
}
cin >> Q;
for (int i = 1; i <= Q; i++) {
cin >> v[i] >> d[i] >> c[i];
q[v[i]] = i;
}
for (int i = Q; i >= 1; i--) {
FUNC(v[i], d[i], c[i]);
}
/*
for (int i = 1; i <= N; i++) {
query_num = -1;
D_base = 10;
INIT(i, 10);
//cout << "query_num= " << query_num << endl;
if (query_num == -1) { cout << 0 << endl; }
else { cout << c[query_num] << endl; }
}*/
/*for (int i = Q; i >=1; i--) {
PAINT(v[i], d[i], c[i]);
}
for (int i = 1; i <= N; i++) {
cout << color[i] << endl;
}
*/
for (int i = 1; i <= N; i++) {
cout << memo[i][0] << endl;
}
//system("pause");
return 0;
} | a.cc:6:1: error: 'vector' does not name a type
6 | vector<int> Adj[100005];
| ^~~~~~
a.cc: In function 'void FUNC(int, int, int)':
a.cc:60:34: error: 'Adj' was not declared in this scope
60 | for (int u = 0; u < (int)Adj[V].size(); u++) {
| ^~~
a.cc: In function 'int main()':
a.cc:68:9: error: 'cin' was not declared in this scope
68 | cin >> N >> M;
| ^~~
a.cc:1:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
+++ |+#include <iostream>
1 |
a.cc:71:17: error: 'Adj' was not declared in this scope
71 | Adj[a[i]].push_back(b[i]);
| ^~~
a.cc:106:17: error: 'cout' was not declared in this scope
106 | cout << memo[i][0] << endl;
| ^~~~
a.cc:106:17: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:106:39: error: 'endl' was not declared in this scope
106 | cout << memo[i][0] << endl;
| ^~~~
a.cc:1:1: note: 'std::endl' is defined in header '<ostream>'; this is probably fixable by adding '#include <ostream>'
+++ |+#include <ostream>
1 |
|
s749470000 | p03768 | C++ | #include<iostream> #include<iomanip> #include<algorithm> #include<cstring> #include<string> #include<cmath> #include<vector> #include<queue> #include<stack> #include<map> #include<set> using namespace std; const int inf=2147483647,dx[]={-1,0,1,0},dy[]={0,-1,0,1}; const long long llinf=9223372036854775807ll; const int N=100005; int a[N][3],ma[N],ans[N],bfs[N]; vector<int> g[N]; void go(int in[]) { int x=in[0]-1,dd=in[1],v=in[2]; if(dd<ma[x]) return ; ma[x]=dd; bfs[0]=x; int rr=1; for(int i=0;i<rr;i++) { int x=bfs[i]; if(!ans[x]) ans[x]=v; if(!ma[x]) continue; for(int i=0;i<g[x].size();i++) { int y=g[x][i]; int nd=ma[x]-1; if(nd>ma[y]) { ma[y]=nd; bfs[rr++]=y; } } } } int n,m,q,x,y; int main(){ cin>>n>>m; for(int i=0;i<m;i++) { cin>>x>>y; x--,y--; g[x].push_back(y); g[y].push_back(x); } cin>>q; for(int i=0;i<q;i++) for(int j=0;j<3;j++) cin>>a[i][j]; for(int i=0;i<N;i++) ma[i]=-1; for(int i=q;i>=0;i--) go(a[i]); for(int i=0;i<n;i++) cout<<ans[i]<<'\n'; return | a.cc:1:20: warning: extra tokens at end of #include directive
1 | #include<iostream> #include<iomanip> #include<algorithm> #include<cstring> #include<string> #include<cmath> #include<vector> #include<queue> #include<stack> #include<map> #include<set> using namespace std; const int inf=2147483647,dx[]={-1,0,1,0},dy[]={0,-1,0,1}; const long long llinf=9223372036854775807ll; const int N=100005; int a[N][3],ma[N],ans[N],bfs[N]; vector<int> g[N]; void go(int in[]) { int x=in[0]-1,dd=in[1],v=in[2]; if(dd<ma[x]) return ; ma[x]=dd; bfs[0]=x; int rr=1; for(int i=0;i<rr;i++) { int x=bfs[i]; if(!ans[x]) ans[x]=v; if(!ma[x]) continue; for(int i=0;i<g[x].size();i++) { int y=g[x][i]; int nd=ma[x]-1; if(nd>ma[y]) { ma[y]=nd; bfs[rr++]=y; } } } } int n,m,q,x,y; int main(){ cin>>n>>m; for(int i=0;i<m;i++) { cin>>x>>y; x--,y--; g[x].push_back(y); g[y].push_back(x); } cin>>q; for(int i=0;i<q;i++) for(int j=0;j<3;j++) cin>>a[i][j]; for(int i=0;i<N;i++) ma[i]=-1; for(int i=q;i>=0;i--) go(a[i]); for(int i=0;i<n;i++) cout<<ans[i]<<'\n'; return
| ^
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status
|
s489182979 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>
#include <sstream>
#include <stack>
#include <time.h>
#include <vector>
#include <complex>
#include <map>
#include <set>
#include <iomanip>
#include <math.h>
#include <stdlib.h>
#include <list>
#include <utility>
#include <memory>
#include <cstring>
#include <fstream>
#include <numeric>
#include <assert.h>
#include <bits/stdc++.h>
using namespace std;
int cl[100004];
int lst[100004];
vector <int> eds[100004];
int n,m,q;
void dfs(int v,int d,int c){
if (!cl[v]) cl[v]=c;
if (lst[v]>=d) return;
lst[v]=d;
if (d==0) return;
for (int u:eds[v])
dfs(u,d-1,c);
}
vector <tuple<int,int,int> > vv;
int main(){
cin>>n>>m;
for (int i=0;i<m;i+++){
int a,b;
cin>>a>>b;
--a,--b;
eds[a].push_back(b);
eds[b].push_back(a);
}
cin>>q;
for (int i=0;i<q;i++){
int v,d,c;
cin>>v>>d>>c;
--v;
vv.push_back(make_tuple(v,d,c));
}
reverse (vv.begin(),vv.end());
for (int i=0;i<q;i++){
int v,d,c;
tie(v,d,c)=vv[i];
dfs(v,d,c);
}
for (int i=0;i<n;i++) cout<<cl[i]<<endl;
return 0;
} | a.cc: In function 'int main()':
a.cc:44:30: error: expected primary-expression before ')' token
44 | for (int i=0;i<m;i+++){
| ^
|
s080869189 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
int n,m,q,i,j,vt[100005],d[100005],c[100005],dp[100005],col[100005]
vector <int> g[100005];
void dfs(int v,int d,int c)
{
if (!col[v]) col[v]=c;
if (dp[v]>=d || d==0) return;
dp[v]=d;for (int i=0;i<g[v].size();++i)
dfs(g[v][i],d-1,c);
}
int main()
{
cin>>n>>m;
for (i=0;i<m;++i)
{
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
cin>>q;
for (i=0;i<q;++i) cin>>vt[i]>>d[i]>>c[i];
for (i=q-1;i>=0;--i) dfs(vt[i],d[i],c[i]);
for (i=1;i<=n;++i) cout<<col[i];
} | a.cc:4:1: error: expected initializer before 'vector'
4 | vector <int> g[100005];
| ^~~~~~
a.cc: In function 'void dfs(int, int, int)':
a.cc:7:14: error: 'col' was not declared in this scope; did you mean 'cosl'?
7 | if (!col[v]) col[v]=c;
| ^~~
| cosl
a.cc:9:32: error: 'g' was not declared in this scope
9 | dp[v]=d;for (int i=0;i<g[v].size();++i)
| ^
a.cc: In function 'int main()':
a.cc:19:17: error: 'g' was not declared in this scope
19 | g[u].push_back(v);
| ^
a.cc:25:34: error: 'col' was not declared in this scope; did you mean 'cosl'?
25 | for (i=1;i<=n;++i) cout<<col[i];
| ^~~
| cosl
|
s336380830 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
int n,m,q,i,j,vt[100005],d[100005],c[100005],dp[100005],col[100005]
vector <int> g[100005];
void dfs(int v,int d,int c)
{
if (!col[v]) col[v]=c;
if (dp[v]>=d || d==0) return;
dp[v]=d;for (i=0;i<g[v].size();++i)
dfs(g[v][i],d-1,c);
}
int main()
{
cin>>n>>m;
for (i=0;i<m;++i)
{
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
cin>>q;
for (i=0;i<q;++i) cin>>vt[i]>>d[i]>>c[i];
for (i=q-1;i>=0;--i) dfs(vt[i],d[i],c[i]);
for (i=1;i<=n;++i) cout<<col[i];
} | a.cc:4:1: error: expected initializer before 'vector'
4 | vector <int> g[100005];
| ^~~~~~
a.cc: In function 'void dfs(int, int, int)':
a.cc:7:14: error: 'col' was not declared in this scope; did you mean 'cosl'?
7 | if (!col[v]) col[v]=c;
| ^~~
| cosl
a.cc:9:28: error: 'g' was not declared in this scope
9 | dp[v]=d;for (i=0;i<g[v].size();++i)
| ^
a.cc: In function 'int main()':
a.cc:19:17: error: 'g' was not declared in this scope
19 | g[u].push_back(v);
| ^
a.cc:25:34: error: 'col' was not declared in this scope; did you mean 'cosl'?
25 | for (i=1;i<=n;++i) cout<<col[i];
| ^~~
| cosl
|
s892156508 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int a[10];
for(int i=0;i<10;i++)
{
for(int j=0;j<10;j+10)
{
for(int k=0;k<10;k++)
{
cin>>a[k];
cout<<a[k];
}
}
}
cout<<"defineansiloveccs"
return 0;
} | a.cc: In function 'int main()':
a.cc:19:30: error: expected ';' before 'return'
19 | cout<<"defineansiloveccs"
| ^
| ;
20 | return 0;
| ~~~~~~
|
s555291333 | p03768 | C++ | #include<bits/stdc++.h>
using namespace std;
int v[100001],c[100001],d[100001];
int dis[100001];
int co[100001];
int now;
vector<int> g[100001];
void bfs(){
queue<int> q;
q.push(v[now]);
dis[v[now]]=0;
while(!q.empty()){
int ths=q.front();
q.pop();
if(dis[ths]>d[now])
break;
if(!co[ths])
co[ths]=c[now];
if(dis[ths]==d[now])
continue;
for(int i=0;i<g[ths].size();i++)
if(dis[g[ths][i]]==-1){
if(co[g[ths][i]] && dis[ths]+2>n)
continue;
dis[g[ths][i]]=dis[ths]+1;
q.push(g[ths][i]);
}
}
}
int main(){
int n,m,k;
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int a,b;
scanf("%d%d",&a,&b);
g[a].push_back(b);
g[b].push_back(a);
}
cin>>k;
for(int i=0;i<k;i++)
scanf("%d%d%d",v+i,d+i,c+i);
for(now=k-1;now>=0;now--){
memset(dis,-1,sizeof(dis));
bfs();
}
for(int i=1;i<=n;i++)
printf("%d\n",co[i]);
return 0;
} | a.cc: In function 'void bfs()':
a.cc:23:48: error: 'n' was not declared in this scope
23 | if(co[g[ths][i]] && dis[ths]+2>n)
| ^
|
s376634540 | p03768 | C++ | //**************************
//*** writer : Alex Hu **
//************************
#include<bits/stdc++.h>
using namespace std;
#define CLEAN(a,b) memset(a,b,sizeof(a))
#define mkp make_pair
#define pb push_back
#define rept(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int maxn=1e5+10;
vi graph[maxn];
int mx[maxn],n,q,m,color[maxn],d[maxn],c[maxn],p[maxn];
int GG()
{
int x=0;
char ch=getchar();
while (!isdigit(ch))
{
ch=getchar();
while (isdigit(ch))
{
ch=getchar();
x=x*10+ch-'0';
}
}
return x;
}
void dfs(int x)
{
if (!color[x]) color[x]=color[q];
rept(i,0,g[x].size())
{
if (mx[x]-1>mx[i])
{
mx[i]=mx[x]-1;
dfs(i);
}
}
}
void gg(int x)
{
if (x>=10) gg(x/10);
putchar(x%10+'0');
}
int main()
{
CLEAN(mx,-1);
n=GG();
m=GG();
rept(i,1,m+1)
{
int uu,vv;
uu=GG();
vv=GG();
graph[uu].pb(vv);
graph[vv].pb(uu);
}
q=GG();
rept(i,1,q+1)
{
p[i]=GG();
d[i]=GG();
c[i]=GG();
}
while (q)
{
q--;
if (d[q]>mx[p[q]]) mx[p[q]]=d[q];
dfs(p[q]);
}
rept(i,1,n+1)
{
gg(col[i])
cout<<endl;
}
return 0;
} | a.cc: In function 'void dfs(int)':
a.cc:43:14: error: 'g' was not declared in this scope
43 | rept(i,0,g[x].size())
| ^
a.cc:12:48: note: in definition of macro 'rept'
12 | #define rept(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
| ^
a.cc: In function 'int main()':
a.cc:87:20: error: 'col' was not declared in this scope; did you mean 'cosl'?
87 | gg(col[i])
| ^~~
| cosl
|
s750977818 | p03768 | C++ | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int MAXN = (int)1e5 + 5;
struct que {
int v, d, col;
que() {
v = d = col = 0;
}
} req[MAXN];
vector<int> adj[MAXN];
int col[MAXN];
int lim[MAXN];
int u[MAXN];
int n, m, q;
int timer;
void solve() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
lim[i] = -1;
col[i] = 0;
u[i] = 0;
}
for (int i = 1, u, v; i <= m; ++i) {
scanf("%d %d", &u, &v);
adj[u].pb(v);
adj[v].pb(u);
}
scanf("%d", &q);
for (int i = 1; i <= q; ++i) {
scanf("%d %d %d", &req[i].v, &req[i].d, &req[i].col);
}
queue<pair<int, int> > Q;
for (int i = q; i > 0; --i) {
Q.push(mp(req[i].v, req[i].d));
++timer;
while (!Q.empty()) {
int v = Q.front().fi;
int d = Q.front().se;
Q.pop();
u[v] = timer;
if (d <= lim[v]) {
continue;
}
if (!col[v]) {
col[v] = req[i].col;
}
lim[v] = d;
for (int to : adj[v]) {
if (u[to] != timer) {
Q.push(mp(to, d - 1));
}
}
}
}
for (int i = 1; i <= n; ++i) {
printf("%d\n", col[i]);
}
return 0;
} | a.cc: In function 'void solve()':
a.cc:93:16: error: return-statement with a value, in function returning 'void' [-fpermissive]
93 | return 0;
| ^
|
s584885623 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>
#include <sstream>
#include <stack>
#include <time.h>
#include <vector>
#include <complex>
#include <map>
#include <set>
#include <iomanip>
#include <math.h>
#include <stdlib.h>
#include <list>
#include <utility>
#include <memory>
#include <cstring>
#include <fstream>
#include <numeric>
#include <assert.h>
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
int N,M,Q;
vector <int> g[100004];
int col[100004];
int dist[100004];
void bfs(int v,int d,int c){
fill (dist,dist+100004,1e7);
queue <int> q;
dist[v]=0;
q.push(v);
while(!q.empty()){
int x=q.front();
q.pop();
col[x]=c;
if (dist[x]==d) break;
for (int i=0;i<g[x].size();i++){
int n=g[x][i];
if (dist[n]>dist[x]+1){
dist[n]=dist[x]+1;
if ()q.push(n);
}
}
}
}
int main(){
memset (col,0,sizeof(col));
cin>>N>>M;
for (int i=0;i<M;i++){
int x,y;
cin>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
cin>>Q;
for (int i=0;i<Q;i++){
int v,d,c;
cin>>v>>d>>c;
bfs(v,d,c);
}
for (int i=1;i<=N;i++)
cout<<col[i]<<endl;
return 0;
} | a.cc: In function 'void bfs(int, int, int)':
a.cc:48:37: error: expected primary-expression before ')' token
48 | if ()q.push(n);
| ^
|
s078891193 | p03768 | C++ | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip> //do setprecision
#include <ctime>
#include <complex>
using namespace std;
#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;
int main(){
int n,m,q;
cin>>n>>m;
vector<int> a(n),b(n),mx(n+1,-1),ans(n+1,0);
vector<vector<int>> g=vector<vector<int>>(n+2,vector<int>());
FOR(i,0,m){
cin>>a[i]>>b[i];
g[a[i]].PB(b[i]);
g[b[i]].PB(a[i]);
}
cin>>q;
vector<int> v(q),d(q),c(q),
FOR(i,0,q)cin>>v[i]>>d[i]>>c[i];
FORD(i,n,0){
queue<pair<pair<int,int>,int>> q;
q.push(MP(MP(v[i],d[i]),c[i]));
while(q.size()){
pair<pair<int,int>,int> tpl=q.front();
q.pop();
int vv=tpl.ST.ST,dd=tpl.ST.ND,cc=tpl.ND;
if(mx[vv]>=dd)continue;
mx[vv]=dd;
if(ans[vv]==0)ans[vv]=cc;
int l=g[vv].size();
FOR(j,0,l){
if(mx[g[vv][j]]<dd-1){
q.push(MP(MP(g[vv][j],dd-1),cc));
}
}
}
}
FORQ(i,1,n){
cout<<ans[i]<<endl;
}
return 0;
}
| a.cc: In function 'int main()':
a.cc:22:20: error: expected unqualified-id before 'for'
22 | #define FOR(i,b,e) for(int i=(b);i<(e);++i)
| ^~~
a.cc:50:9: note: in expansion of macro 'FOR'
50 | FOR(i,0,q)cin>>v[i]>>d[i]>>c[i];
| ^~~
a.cc:50:13: error: 'i' was not declared in this scope
50 | FOR(i,0,q)cin>>v[i]>>d[i]>>c[i];
| ^
a.cc:22:34: note: in definition of macro 'FOR'
22 | #define FOR(i,b,e) for(int i=(b);i<(e);++i)
| ^
|
s426039158 | p03768 | C++ | //waz
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;
#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))
int F()
{
char ch;
int x, a;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-');
if (ch == '-') ch = getchar(), a = -1;
else a = 1;
x = ch - '0';
while (ch = getchar(), ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + ch - '0';
return a * x;
}
const int N = 1e5 + 10;
int n, m;
VI edge[N];
int mxd[N], co[N];
void dfs(int u, int d, int c)
{
if (d <= mxd[u]) return;
if (!co[u]) co[u] = c;
mxd[u] = d;
for (auto : edge[u])
dfs(v, d - 1, c);
}
int v[N], d[N], c[N];
int main()
{
gii(n, m);
for (int i = 1; i <= n; ++i) mxd[i] = -1;
for (int i = 1; i <= m; ++i)
{
int u, v;
gii(u, v);
edge[u].pb(v);
edge[v].pb(u);
}
int q;
gi(q);
for (int i = 1; i <= q; ++i)
giii(v[i], d[i], c[i]);
for (int i = q; i; --i)
dfs(v[i], d[i], c[i]);
for (int i = 1; i <= n; ++i)
printf("%d\n", co[i]);
} | a.cc: In function 'void dfs(int, int, int)':
a.cc:49:19: error: expected unqualified-id before ':' token
49 | for (auto : edge[u])
| ^
a.cc:50:21: error: 'v' was not declared in this scope
50 | dfs(v, d - 1, c);
| ^
|
s836945617 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 10;
typedef long long ll;
vector<int> q[MAXN];
int color[MAXN];
int flag[MAXN];
int n, m, q;
int v[MAXN], d[MAXN], c[MAXN];
void dfs(int x, int cnt, int c)
{
if (!color[x])
color[x] = c;
if (flag[x] >= cnt)
return;
if (cnt == 0)
return;
flag[x] = cnt;
for (int i = 0; i < q[x].size(); i++)
dfs(q[x][i], cnt - 1, c);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
int x, y;
cin >> x >> y;
q[x].push_back(y);
q[y].push_back(x);
}
cin >> q;
for (register int i = 1; i <= q; i++)
cin >> v[i] >> d[i] >> c[i];
for (register int i = q; i >= 1; i--)
dfs(v[i], d[i], c[i]);
for (register int i = 1; i <= n; i++)
cout << color[i] << "\n";
return 0;
} | a.cc:9:11: error: conflicting declaration 'int q'
9 | int n, m, q;
| ^
a.cc:6:13: note: previous declaration as 'std::vector<int> q [100010]'
6 | vector<int> q[MAXN];
| ^
a.cc: In function 'int main()':
a.cc:36:13: error: no match for 'operator>>' (operand types are 'std::istream' {aka 'std::basic_istream<char>'} and 'std::vector<int> [100010]')
36 | cin >> q;
| ~~~ ^~ ~
| | |
| | std::vector<int> [100010]
| std::istream {aka std::basic_istream<char>}
In file included from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127,
from a.cc:1:
/usr/include/c++/14/istream:170:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(bool&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
170 | operator>>(bool& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:170:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: cannot bind non-const lvalue reference of type 'bool&' to a value of type 'std::vector<int>*'
36 | cin >> q;
| ^
/usr/include/c++/14/istream:174:7: note: candidate: 'std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(short int&) [with _CharT = char; _Traits = std::char_traits<char>]' (near match)
174 | operator>>(short& __n);
| ^~~~~~~~
/usr/include/c++/14/istream:174:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'short int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(short int)((std::vector<int>*)(& q))' to 'short int&'
/usr/include/c++/14/istream:177:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(short unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
177 | operator>>(unsigned short& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:177:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'short unsigned int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(short unsigned int)((std::vector<int>*)(& q))' to 'short unsigned int&'
/usr/include/c++/14/istream:181:7: note: candidate: 'std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(int&) [with _CharT = char; _Traits = std::char_traits<char>]' (near match)
181 | operator>>(int& __n);
| ^~~~~~~~
/usr/include/c++/14/istream:181:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(int)((std::vector<int>*)(& q))' to 'int&'
/usr/include/c++/14/istream:184:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
184 | operator>>(unsigned int& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:184:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'unsigned int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(unsigned int)((std::vector<int>*)(& q))' to 'unsigned int&'
/usr/include/c++/14/istream:188:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
188 | operator>>(long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:188:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'long int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(long int)((std::vector<int>*)(& q))' to 'long int&'
/usr/include/c++/14/istream:192:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
192 | operator>>(unsigned long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:192:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'long unsigned int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(long unsigned int)((std::vector<int>*)(& q))' to 'long unsigned int&'
/usr/include/c++/14/istream:199:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
199 | operator>>(long long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:199:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'long long int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(long long int)((std::vector<int>*)(& q))' to 'long long int&'
/usr/include/c++/14/istream:203:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
203 | operator>>(unsigned long long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:203:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: invalid conversion from 'std::vector<int>*' to 'long long unsigned int' [-fpermissive]
36 | cin >> q;
| ^
| |
| std::vector<int>*
a.cc:36:16: error: cannot bind rvalue '(long long unsigned int)((std::vector<int>*)(& q))' to 'long long unsigned int&'
/usr/include/c++/14/istream:328:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
328 | operator>>(void*& __p)
| ^~~~~~~~
/usr/include/c++/14/istream:328:7: note: conversion of argument 1 would be ill-formed:
a.cc:36:16: error: cannot bind non-const lvalue reference of type 'void*&' to an rvalue of type 'void*'
36 | cin >> q;
| ^
/usr/include/c++/14/istream:219:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(float&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
219 | operator>>(float& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:219:25: note: no known conversion for argument 1 from 'std::vector<int> [100010]' to 'float&'
219 | operator>>(float& __f)
| ~~~~~~~^~~
/usr/include/c++/14/istream:223:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
223 | operator>>(double& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:223:26: note: no known conversion for argument 1 from 'std::vector<int> [100010]' to 'double&'
223 | operator>>(double& __f)
| ~~~~~~~~^~~
/usr/include/c++/14/istream:227:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
227 | operator>>(long double& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:227:31: note: no known conversion for argument 1 from 'std::vector<int> [100010]' to 'long double&'
227 | operator>>(long double& __f)
| ~~~~~~~~~~~~~^~~
/usr/include/c++/14/istream:122:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(__istream_type& (*)(__istream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
122 | operator>>(__istream_type& (*__pf)(__istream_type&))
| ^~~~~~~~
/usr/include/c++/14/istream:122:36: note: no known conversion for argument 1 from 'std::vector<int> [100010]' to 'std::basic_istream<char>::__istream_type& (*)(std::basic_istream<char>::__istream_type&)' {aka 'std::basic_istream<char>& (*)(std::basic_istream<char>&)'}
122 | operator>>(__istream_type& (*__pf)(__istream_type&))
| ~~~~~~~~~ |
s499850668 | p03768 | C++ | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
ll inf = llmax / 2;
struct edge {
int to, cost;
};
int V;
vector<edge> G[1000000];
ll d[3000][3000];
int v[200000], d[200000], c[200000];
void bfs(int n) {
fill(d[n], d[n] + 3000, inf);
queue<pii> que;
que.push(pii(n, 0));
d[n][n] = 0;
while (!que.empty()) {
pii p = que.front();
que.pop();
int num = p.first;
int len = G[num].size();
for (int i = 0; i < len; i++) {
if (d[n][G[num][i].to] == inf) {
d[n][G[num][i].to] = p.second + 1;
que.push(pii(G[num][i].to, p.second + 1));
}
}
}
}
int color[200000];
int main() {
int N, M;
cin >> N;
V = N;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
edge e1;
e1.to = b;
e1.cost = 1;
G[a].push_back(e1);
edge e2;
e2.to = a;
e2.cost = 1;
G[b].push_back(e1);
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> v[i] >> d[i] >> c[i];
}
for (int i = 0; i < N; i++) {
bfs(i);
}
fill(color, color + N, 0);
for (int i = Q - 1; i >= 0; i++) {
for (int j = 0; j < N; j++) {
if (color[j] == 0) {
if (d[j][v[i] - 1] <= d[i]) {
color[j] = c[i];
}
}
}
}
for (int i = 0; i < N; i++) {
cout << color[i] << endl;
}
}
| a.cc:40:16: error: conflicting declaration 'int d [200000]'
40 | int v[200000], d[200000], c[200000];
| ^
a.cc:39:4: note: previous declaration as 'll d [3000][3000]'
39 | ll d[3000][3000];
| ^
a.cc: In function 'int main()':
a.cc:82:21: error: no match for 'operator>>' (operand types are 'std::basic_istream<char>::__istream_type' {aka 'std::basic_istream<char>'} and 'll [3000]' {aka 'long long int [3000]'})
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~~~~~~~~~ ^~ ~~~~
| | |
| | ll [3000] {aka long long int [3000]}
| std::basic_istream<char>::__istream_type {aka std::basic_istream<char>}
In file included from /usr/include/c++/14/iostream:42,
from a.cc:2:
/usr/include/c++/14/istream:170:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(bool&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
170 | operator>>(bool& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:170:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: cannot bind non-const lvalue reference of type 'bool&' to a value of type 'll*' {aka 'long long int*'}
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
/usr/include/c++/14/istream:174:7: note: candidate: 'std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(short int&) [with _CharT = char; _Traits = std::char_traits<char>]' (near match)
174 | operator>>(short& __n);
| ^~~~~~~~
/usr/include/c++/14/istream:174:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'short int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(short int)((ll*)(& d[i]))' to 'short int&'
/usr/include/c++/14/istream:177:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(short unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
177 | operator>>(unsigned short& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:177:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'short unsigned int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(short unsigned int)((ll*)(& d[i]))' to 'short unsigned int&'
/usr/include/c++/14/istream:181:7: note: candidate: 'std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(int&) [with _CharT = char; _Traits = std::char_traits<char>]' (near match)
181 | operator>>(int& __n);
| ^~~~~~~~
/usr/include/c++/14/istream:181:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(int)((ll*)(& d[i]))' to 'int&'
/usr/include/c++/14/istream:184:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
184 | operator>>(unsigned int& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:184:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'unsigned int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(unsigned int)((ll*)(& d[i]))' to 'unsigned int&'
/usr/include/c++/14/istream:188:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
188 | operator>>(long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:188:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'long int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(long int)((ll*)(& d[i]))' to 'long int&'
/usr/include/c++/14/istream:192:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
192 | operator>>(unsigned long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:192:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'long unsigned int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(long unsigned int)((ll*)(& d[i]))' to 'long unsigned int&'
/usr/include/c++/14/istream:199:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
199 | operator>>(long long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:199:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'long long int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(long long int)((ll*)(& d[i]))' to 'long long int&'
/usr/include/c++/14/istream:203:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
203 | operator>>(unsigned long long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:203:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: invalid conversion from 'll*' {aka 'long long int*'} to 'long long unsigned int' [-fpermissive]
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
| |
| ll* {aka long long int*}
a.cc:82:27: error: cannot bind rvalue '(long long unsigned int)((ll*)(& d[i]))' to 'long long unsigned int&'
/usr/include/c++/14/istream:328:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
328 | operator>>(void*& __p)
| ^~~~~~~~
/usr/include/c++/14/istream:328:7: note: conversion of argument 1 would be ill-formed:
a.cc:82:27: error: cannot bind non-const lvalue reference of type 'void*&' to an rvalue of type 'void*'
82 | cin >> v[i] >> d[i] >> c[i];
| ~~~^
/usr/include/c++/14/istream:219:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(float&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
219 | operator>>(float& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:219:25: note: no known conversion for argument 1 from 'll [3000]' {aka 'long long int [3000]'} to 'float&'
219 | operator>>(float& __f)
| ~~~~~~~^~~
/usr/include/c++/14/istream:223:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
223 | operator>>(double& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:223:26: note: no known conversion for argument 1 from 'll [3000]' {aka 'long long int [3000]'} to 'double&'
223 | operator>>(double& __f)
| ~~~~~~~~^~~
/usr/include/c++/14/istream:227:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
227 | operator>>(long double& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:227:31: note: no known conversion for argument 1 from 'll [3000]' {aka 'long long int [3000]'} to 'long double&'
227 | operator>>(long double& __f)
| ~~~~~~~~~~~~~^~~
/usr/include/c++/14/istream:122:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(__istream_type& (*)(__istream_type&)) [with _CharT = char; _Traits = |
s728947236 | p03768 | C++ | 14 10
1 4
5 7
7 11
4 10
14 7
14 3
6 14
8 11
5 13
8 3
8
8 6 2
9 7 85
6 9 3
6 7 5
10 3 1
12 9 4
9 6 6
8 2 3
| a.cc:1:1: error: expected unqualified-id before numeric constant
1 | 14 10
| ^~
|
s195213674 | p03768 | C++ | #include <bits/stdc++.h>
//#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
struct edge {
int to, cost;
edge(int t,int c):to(t),cost(c) {}
};
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
//-----------------------------------------------------------------------------
int n,m,q;
vector<int> g[100000];
int c[100000];
int dp[11][100000];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
REP(i,11) fill(dp[i],dp[i]+100000,-1);
cin>>n>>m;
REP(i,m) {
int x,y;cin>>x>>y;x--,y--;
g[x].pb(y),g[y].pb(x);
}
cin>>q;
REP(i,q) {
cin>>v>>d>>c[i];
v--;
dp[d][v]=i;
}
for(int i=10;i>0;i--) {
REP(j,n) {
if(dp[i][j]!=-1) {
dp[i-1][j]=max(dp[i-1][j],dp[i][j]);
for(auto u:g[j]) dp[i-1][u]=max(dp[i-1][u],dp[i][j]);
}
}
}
REP(i,n) cout<<(dp[0][i]==-1?0:c[dp[0][i]])<<endl;
return 0;
}
| a.cc: In function 'int main()':
a.cc:47:22: error: 'v' was not declared in this scope
47 | cin>>v>>d>>c[i];
| ^
a.cc:47:25: error: 'd' was not declared in this scope
47 | cin>>v>>d>>c[i];
| ^
|
s795611003 | p03768 | C++ | #include<cstdio>
#include<algorithm>
#include<cstring>
#define maxn 200050
#define add(u,v)(to[++top]=head[u],head[u]=top,w[top]=v)
#define For(x) for (int h=head[x],o=w[h];h;o=w[h=to[h]])
using namespace std;
int n,m,to[maxn],head[maxn],w[maxn],u,v,top;
int a[maxn],b[maxn],c[maxn],co[maxn],r[maxn],q,i;
void dfs(int x,int rg,int col){
if (rg<=r[x]||rg<=0) return;
r[x]=rg;
if (co[x]==0) co[x]=col;
For(x) dfs(o,rg-1,col);
}
int main(){
scanf("%d%d",&n,&m);
while (m--){
scanf("%d%d",&u,&v);
add(u,v);add(v,u);
}
scanf("%d",&q);
for (i=1;i<=q;i++) scanf("%d%d%d",&a[i],&b[i],&c[i]);
memeset(co,0,sizeof(co));memset(r,0,sizeof(r));
for (i=q;i>=1;i--) dfs(a[i],b[i]+1,c[i]);
for (i=1;i<=n;i++) printf("%d\n",co[i]);
return 0;
} | a.cc: In function 'int main()':
a.cc:29:9: error: 'memeset' was not declared in this scope; did you mean 'memset'?
29 | memeset(co,0,sizeof(co));memset(r,0,sizeof(r));
| ^~~~~~~
| memset
|
s372006847 | p03768 | C++ | #include<cstdio>
using namespace std;
const int N=100000+5;
int n, m;
int d[N], v[N], c[N];
int cnt, first[N], to[2*N], next[2*N];
void add(int u, int v) {
to[++cnt]=v; next[cnt]=first[u]; first[u]=cnt;
to[++cnt]=u; next[cnt]=first[v]; first[v]=cnt;
}
int col[N], mark[N];
void work(int now, int len, int color) {
if(len<0||(col[now]&&mark[now]>=len)) return;
if(col[now]==0) col[now]=color, mark[now]=len;
for(int p=first[now]; p; p=next[p]) work(to[p], len-1, color);
}
int main() {
scanf("%d%d", &n, &m);
for(int i=1, a, b; i<=m; i++) {
scanf("%d%d", &a, &b);
add(a, b);
}
int Q;
scanf("%d", &Q);
for(int i=1; i<=Q; i++) scanf("%d%d%d", &v[i], &d[i], &c[i]);
for(int i=Q; i>=1; i--) work(v[i], 0, d[i], c[i]);
for(int i=1; i<=n; i++) printf("%d\n", col[i]);
return 0;
} | a.cc: In function 'int main()':
a.cc:31:37: error: too many arguments to function 'void work(int, int, int)'
31 | for(int i=Q; i>=1; i--) work(v[i], 0, d[i], c[i]);
| ~~~~^~~~~~~~~~~~~~~~~~~~~
a.cc:16:6: note: declared here
16 | void work(int now, int len, int color) {
| ^~~~
|
s303217541 | p03768 | C++ | /*
ID: 5ak0
PROG:
LANG: C++11
*/
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define mpr make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 7, MAXN = 1e5 + 10, MAXD = 11;
int n, m, q;
int c[MAXN], v, d;
vector <int> g[MAXN];
int dp[MAXN][MAXD];
int main(){
#ifndef SAKO
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
#endif // SAKO
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 1; i <= m; ++i){
cin >> v >> d;
g[v].pb(d);
g[d].pb(v);
}
cin >> q;
for (int i = 1; i <= q; ++i){
cin >> v >> d >> c[i];
dp[v][d] = i;
}
for (int i = 9; i >= 0; --i){
for (int j = 1; j <= n; ++j){
dp[j][i] = max(dp[j][i], dp[j][i + 1]);
for (auto to : e[j]){
dp[j][i]=max(dp[j][i],dp[to][i+1]);
}
}
}
for (int i = 1; i <= n; ++i)
cout << c[dp[i][0]] << "\n";
return 0;
}
| a.cc: In function 'int main()':
a.cc:44:40: error: 'e' was not declared in this scope
44 | for (auto to : e[j]){
| ^
|
s262966734 | p03768 | C++ | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
struct node {
int color;
int next[100001];
int nextnum = 0;
};
int n, m, q;
struct node Node[100001];
int visit[100001];
void color (int v, int d, int c) {
Node[v].color = c;
int i = v;
visit[i] = 1;
for (int j = 0; j < Node[i].nextnum; j++) {
//if (visit[Node[i].next[j]])
//continue;
if (d == 1) {
Node[Node[i].next[j]].color = c;
}
else {
Node[Node[i].next[j]].color = c;
color (Node[i].next[j], d - 1, c);
}
}
visit[i] = 0;
}
int main () {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
Node[i].color = 0;
Node[i].nextnum = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
Node[a].next[Node[a].nextnum++] = b;
Node[b].next[Node[b].nextnum++] = a;
}
scanf("%d", &q);
memset (visit, 0, sizeof(int) * n);
for (int i = 0; i < q; i++) {
int v, d, c;
scanf("%d%d%d", &v, &d, &c);
color (v, d, c);
}
for (int i = 1; i <= n; i++) {
printf("%d\n", Node[i].color);
}
return 0;
}
| /tmp/cceP1Gjn.o: in function `color(int, int, int)':
a.cc:(.text+0x40): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/cceP1Gjn.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/cceP1Gjn.o
/tmp/cceP1Gjn.o: in function `main':
a.cc:(.text+0x2ee): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/cceP1Gjn.o
collect2: error: ld returned 1 exit status
|
s465682856 | p03768 | C++ | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
struct node {
int color;
int next[100001];
int nextnum = 0;
};
int n, m, q;
struct node Node[100001];
int visit[100001];
void color (int v, int d, int c) {
Node[v].color = c;
int i = v;
visit[i] = 1;
for (int j = 0; j < Node[i].nextnum; j++) {
//if (visit[Node[i].next[j]])
//continue;
if (d == 1) {
Node[Node[i].next[j]].color = c;
}
else {
Node[Node[i].next[j]].color = c;
color (Node[i].next[j], d - 1, c);
}
}
visit[i] = 0;
}
int main () {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
Node[i].color = 0;
Node[i].nextnum = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
Node[a].next[Node[a].nextnum++] = b;
Node[b].next[Node[b].nextnum++] = a;
}
scanf("%d", &q);
memset (visit, 0, sizeof(int) * n);
for (int i = 0; i < q; i++) {
int v, d, c;
scanf("%d%d%d", &v, &d, &c);
color (v, d, c);
}
for (int i = 1; i <= n; i++) {
printf("%d\n", Node[i].color);
}
return 0;
}
| /tmp/ccfzPHTA.o: in function `color(int, int, int)':
a.cc:(.text+0x40): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccfzPHTA.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccfzPHTA.o
/tmp/ccfzPHTA.o: in function `main':
a.cc:(.text+0x2ee): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccfzPHTA.o
collect2: error: ld returned 1 exit status
|
s714577926 | p03768 | C++ | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
struct node {
int color;
int next[100001];
int nextnum = 0;
};
int n, m, q;
struct node Node[100001];
int visit[100001];
void color (int v, int d, int c) {
Node[v].color = c;
int i = v;
visit[i] = 1;
for (int j = 0; j < Node[i].nextnum; j++) {
//if (visit[Node[i].next[j]])
//continue;
if (d == 1) {
Node[Node[i].next[j]].color = c;
}
else {
Node[Node[i].next[j]].color = c;
color (Node[i].next[j], d - 1, c);
}
}
visit[i] = 0;
}
int main () {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
Node[i].color = 0;
Node[i].nextnum = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
Node[a].next[Node[a].nextnum++] = b;
Node[b].next[Node[b].nextnum++] = a;
}
scanf("%d", &q);
memset (visit, 0, sizeof(int) * n);
for (int i = 0; i < q; i++) {
int v, d, c;
scanf("%d%d%d", &v, &d, &c);
color (v, d, c);
}
for (int i = 1; i <= n; i++) {
printf("%d\n", Node[i].color);
}
}
| /tmp/ccmqBCjR.o: in function `color(int, int, int)':
a.cc:(.text+0x40): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccmqBCjR.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccmqBCjR.o
/tmp/ccmqBCjR.o: in function `main':
a.cc:(.text+0x2ee): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccmqBCjR.o
collect2: error: ld returned 1 exit status
|
s443695670 | p03768 | C++ | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
struct node {
int color;
int next[100001];
int nextnum = 0;
};
int n, m, q;
struct node Node[100001];
int visit[100001];
void color (int v, int d, int c) {
Node[v].color = c;
int i = v;
visit[i] = 1;
for (int j = 0; j < Node[i].nextnum; j++) {
//if (visit[Node[i].next[j]])
//continue;
if (d == 1) {
Node[Node[i].next[j]].color = c;
}
else {
Node[Node[i].next[j]].color = c;
color (Node[i].next[j], d - 1, c);
}
}
visit[i] = 0;
}
int main () {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
Node[i].color = 0;
Node[i].nextnum = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
Node[a].next[Node[a].nextnum++] = b;
Node[b].next[Node[b].nextnum++] = a;
}
scanf("%d", &q);
memset (visit, 0, sizeof(int) * n);
for (int i = 0; i < q; i++) {
int v, d, c;
scanf("%d%d%d", &v, &d, &c);
color (v, d, c);
}
for (int i = 1; i <= n; i++) {
printf("%d\n", Node[i].color);
}
}
| /tmp/ccOtTc4T.o: in function `color(int, int, int)':
a.cc:(.text+0x40): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccOtTc4T.o
a.cc:(.text+0x145): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccOtTc4T.o
/tmp/ccOtTc4T.o: in function `main':
a.cc:(.text+0x2ee): relocation truncated to fit: R_X86_64_PC32 against symbol `visit' defined in .bss section in /tmp/ccOtTc4T.o
collect2: error: ld returned 1 exit status
|
s315219774 | p03768 | C++ | #include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int n,m,q;
int dp[10][100001];
int d[100001],c[100001],v[100001];
vector<int> G[100001];
void f(int ver,int dist,int color){
//printf("%d %d %d\n",ver,dist,color);
if(dist<0)return ;
if(dp[dist][ver]!=0)return ;
dp[dist][ver]=color;
f(ver,dist-1,color);
for(int i=0;i<G[ver].size();i++){
int u=G[ver][i];
f(u,dist-1,color);
}
}
int main(){
cin >> n >> m;
for(int i=0;i<m;i++){
int a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
cin >> q;
for(int i=0;i<q;i++){
cin >> v[i] >> d[i] >> c[i];
v[i]--;
}
for(int i=q-1;i>=0;i--){
f(v[i],d[i],c[i]);
}
for(int i=0;i<n;i++)cout << dp[0][i] << endl;
return 0;
}
| a.cc: In function 'int main()':
a.cc:25:3: error: 'cin' was not declared in this scope
25 | cin >> n >> m;
| ^~~
a.cc:4:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
3 | #include <queue>
+++ |+#include <iostream>
4 | using namespace std;
a.cc:41:23: error: 'cout' was not declared in this scope
41 | for(int i=0;i<n;i++)cout << dp[0][i] << endl;
| ^~~~
a.cc:41:23: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:41:43: error: 'endl' was not declared in this scope
41 | for(int i=0;i<n;i++)cout << dp[0][i] << endl;
| ^~~~
a.cc:4:1: note: 'std::endl' is defined in header '<ostream>'; this is probably fixable by adding '#include <ostream>'
3 | #include <queue>
+++ |+#include <ostream>
4 | using namespace std;
|
s406196365 | p03768 | C++ | #include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <string>
#include <algorithm>
#include <climits>
#include <set>
#include <queue>
#include <unordered_set>
using namespace std;
#define ll long long
struct Question
{
int v;
int d;
int c;
};
class Solver
{
public:
int n;
int m;
int q;
vector<vector<int> > adj;
vector<Question> qs;
vector<vector<int> > dp;
unordered_set<int> us;
Solver();
void set(int cur, int depth, int color);
void exec();
};
Solver::Solver(){
cin >> n >> m;
adj.resize(n)
for (int i = 0; i < m; ++i)
{
int a, b;
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
adj[b].push_back(a);
us.insert(i);
}
cin >> q;
for (int i = 0; i < q; ++i)
{
Question tmpQ;
cin >> tmpQ.v >> tmpQ.d >> tmpQ.c;
tmpQ.v--;
qs.push_back(tmpQ);
}
dp = vector<vector<int> >(n, vector<int>(11, 0));
}
void Solver::set(int cur, int depth, int color){
if(dp[cur][depth] != 0) return;
dp[cur][depth] = color;
if(depth == 0) return;
set(cur, depth-1, color);
for (int i = 0; i < adj[cur].size(); ++i)
{
set(adj[cur][i] , depth-1, color);
}
}
void Solver::exec(){
for (int i = q-1; i >= 0; --i)
{
set(qs[i].v, qs[i].d, qs[i].c);
}
for (int i = 0; i < n; ++i)
{
cout << dp[i][0] << endl;
}
}
int main(){
Solver solution = Solver();
solution.exec();
}
| a.cc: In constructor 'Solver::Solver()':
a.cc:41:22: error: expected ';' before 'for'
41 | adj.resize(n)
| ^
| ;
42 | for (int i = 0; i < m; ++i)
| ~~~
a.cc:42:25: error: 'i' was not declared in this scope
42 | for (int i = 0; i < m; ++i)
| ^
|
s824565791 | p03768 | Java | import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public Main() {
// TODO Auto-generated constructor stub
}
public static void main(String[] args) {
SplatterPainting sp = new SplatterPainting();
sp.run();
}
}
class SplatterPainting {
class Vertex {
int id;
ArrayList<Vertex> neighbours;
int color;
public Vertex(int id) {
neighbours = new ArrayList<>();
color = 0;
this.id = id;
}
}
boolean[] isPainted;
Vertex[] vertices;
public SplatterPainting() {
}
public void run() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
vertices = new Vertex[N + 1];
int M = sc.nextInt();
for(int i = 0; i < M; i++) {
int a = sc.nextInt();
int b = sc.nextInt();
if(vertices[a] == null)
vertices[a] = new Vertex(a);
if(vertices[b] == null)
vertices[b] = new Vertex(b);
vertices[a].neighbours.add(vertices[b]);
vertices[b].neighbours.add(vertices[a]);
}
int Q = sc.nextInt();
for(int i = 0; i < Q; i++) {
int v = sc.nextInt();
int d = sc.nextInt();
int c = sc.nextInt();
isPainted = new boolean[N + 1];
paint(vertices[v], d, c);
}
sc.close();
for(int i = 1; i < N + 1; i++)
System.out.println(vertices[i].color);
}
public void paint(Vertex from, int distance, int color) {
from.color = color;
isPainted[from.id] = true;
if(distance == 0)
return;
for(int i = 0; i < from.neighbours.size(); i++) {
if(!isPainted[from.neighbours.get(i).id]) {
paint(from.neighbours.get(i), distance - 1, color);
}
}
}
}
}
| Main.java:84: error: class, interface, enum, or record expected
}
^
1 error
|
s316434459 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
void solve(int N, int M, const vector< vector< int > >& edge) {
int Q;
cin >> Q;
typedef pair< int, int > pii;
vector< vector< int > > last_paint(N, vector< int >(11, pii));
for_(q,0,Q) {
int v, d, c;
cin >> v >> d >> c;
--v;
last_paint[v][d] = pii(q, C);
}
//
vector< pii > ans(N, 0);
for_(v,0,N) {
set< int > vis;
queue< int > que;
que.push(v);
ans[v] = last_paint[v][0];
for_(REP,0,10) {
queue< int > nxt_que;
while (!que.empty()) {
int v = que.front(); que.pop();
for (int u : edge[v]) {
if (vis.count(u)) continue;
ans[v] = max(ans[v], last_paint[u][REP + 1]);
vis.insert(u);
nxt_que.push(u);
}
}
swap(que, nxt_que);
}
}
for_(v,0,N) printf("%d\n", ans[v].second);
}
int main() {
int N, M;
cin >> N >> M;
vector< vector< int > > edge(N, vector< int >());
for_(i,0,M) {
int u, v;
cin >> u >> v;
--u; --v;
edge[u].push_back(v);
edge[v].push_back(u);
}
solve(N, M, edge);
} | a.cc: In function 'void solve(int, int, const std::vector<std::vector<int> >&)':
a.cc:12:60: error: expected primary-expression before '(' token
12 | vector< vector< int > > last_paint(N, vector< int >(11, pii));
| ^
a.cc:12:68: error: expected primary-expression before ')' token
12 | vector< vector< int > > last_paint(N, vector< int >(11, pii));
| ^
a.cc:18:43: error: 'C' was not declared in this scope
18 | last_paint[v][d] = pii(q, C);
| ^
a.cc:22:31: error: no matching function for call to 'std::vector<std::pair<int, int> >::vector(int&, int)'
22 | vector< pii > ans(N, 0);
| ^
In file included from /usr/include/c++/14/vector:66,
from /usr/include/c++/14/functional:64,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:53,
from a.cc:1:
/usr/include/c++/14/bits/stl_vector.h:707:9: note: candidate: 'template<class _InputIterator, class> std::vector<_Tp, _Alloc>::vector(_InputIterator, _InputIterator, const allocator_type&) [with <template-parameter-2-2> = _InputIterator; _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >]'
707 | vector(_InputIterator __first, _InputIterator __last,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:707:9: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/14/bits/stl_algobase.h:65,
from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_iterator_base_types.h: In substitution of 'template<class _InIter> using std::_RequireInputIter = std::__enable_if_t<((bool)std::is_convertible<typename std::iterator_traits< <template-parameter-1-1> >::iterator_category, std::input_iterator_tag>::value)> [with _InIter = int]':
/usr/include/c++/14/bits/stl_vector.h:705:9: required from here
705 | typename = std::_RequireInputIter<_InputIterator>>
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator_base_types.h:252:57: error: no type named 'iterator_category' in 'struct std::iterator_traits<int>'
252 | input_iterator_tag>::value>;
| ^~~~~
/usr/include/c++/14/bits/stl_vector.h:678:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::initializer_list<_Tp>, const allocator_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; allocator_type = std::allocator<std::pair<int, int> >]'
678 | vector(initializer_list<value_type> __l,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:678:43: note: no known conversion for argument 1 from 'int' to 'std::initializer_list<std::pair<int, int> >'
678 | vector(initializer_list<value_type> __l,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:659:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, std::__type_identity_t<_Alloc>&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; std::__type_identity_t<_Alloc> = std::allocator<std::pair<int, int> >]'
659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:659:23: note: no known conversion for argument 1 from 'int' to 'std::vector<std::pair<int, int> >&&'
659 | vector(vector&& __rv, const __type_identity_t<allocator_type>& __m)
| ~~~~~~~~~^~~~
/usr/include/c++/14/bits/stl_vector.h:640:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::false_type) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; allocator_type = std::allocator<std::pair<int, int> >; std::false_type = std::false_type]'
640 | vector(vector&& __rv, const allocator_type& __m, false_type)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:640:7: note: candidate expects 3 arguments, 2 provided
/usr/include/c++/14/bits/stl_vector.h:635:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&, const allocator_type&, std::true_type) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; allocator_type = std::allocator<std::pair<int, int> >; std::true_type = std::true_type]'
635 | vector(vector&& __rv, const allocator_type& __m, true_type) noexcept
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:635:7: note: candidate expects 3 arguments, 2 provided
/usr/include/c++/14/bits/stl_vector.h:624:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&, std::__type_identity_t<_Alloc>&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; std::__type_identity_t<_Alloc> = std::allocator<std::pair<int, int> >]'
624 | vector(const vector& __x, const __type_identity_t<allocator_type>& __a)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:624:28: note: no known conversion for argument 1 from 'int' to 'const std::vector<std::pair<int, int> >&'
624 | vector(const vector& __x, const __type_identity_t<allocator_type>& __a)
| ~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:620:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>&&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >]'
620 | vector(vector&&) noexcept = default;
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:620:7: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:601:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >]'
601 | vector(const vector& __x)
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:601:7: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:569:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(size_type, const value_type&, const allocator_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; size_type = long unsigned int; value_type = std::pair<int, int>; allocator_type = std::allocator<std::pair<int, int> >]'
569 | vector(size_type __n, const value_type& __value,
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:569:47: note: no known conversion for argument 2 from 'int' to 'const std::vector<std::pair<int, int> >::value_type&' {aka 'const std::pair<int, int>&'}
569 | vector(size_type __n, const value_type& __value,
| ~~~~~~~~~~~~~~~~~~^~~~~~~
/usr/include/c++/14/bits/stl_vector.h:556:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(size_type, const allocator_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; size_type = long unsigned int; allocator_type = std::allocator<std::pair<int, int> >]'
556 | vector(size_type __n, const allocator_type& __a = allocator_type())
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:556:51: note: no known conversion for argument 2 from 'int' to 'const std::vector<std::pair<int, int> >::allocator_type&' {aka 'const std::allocator<std::pair<int, int> >&'}
556 | vector(size_type __n, const allocator_type& __a = allocator_type())
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_vector.h:542:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector(const allocator_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; allocator_type = std::allocator<std::pair<int, int> >]'
542 | vector(const allocator_type& __a) _GLIBCXX_NOEXCEPT
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:542:7: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_vector.h:531:7: note: candidate: 'std::vector<_Tp, _Alloc>::vector() [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >]'
531 | vector() = default;
| ^~~~~~
/usr/include/c++/14/bits/stl_vector.h:531:7: note: candidate expects 0 arguments, 2 provided
a.cc:28:41: error: no match for 'operator=' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::value_type' {aka 'std::pair<int, int>'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
28 | ans[v] = last_paint[v][0];
| ^
In file included from /usr/include/c++/14/bits/stl_algobase.h:64:
/usr/include/c++/14/bits/stl_pair.h:946:9: note: candidate: 'template<class _U1, class _U2> typename std::enable_if<std::__and_<std::is_assignable<_T1&, const _U1&>, std::is_assignable<_T2&, const _U2&> >::value, std::pair<_T1, _T2>&>::type std::pair<_T1, _T2>::operator=(const std::pair<_U1, _U2>&) [with _U2 = _U1; _T1 = int; _T2 = int]'
946 | operator=(const pair<_U1, _U2>& __p)
| ^~~~~~~~
/usr/include/c++/14/bits/stl_pair.h:946:9: note: template argument deduction/substitution failed:
a.cc:28:41: note: mismatched types 'const std::pair<_T1, _T2>' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'}
28 | ans[v] = last_paint[v][0];
| ^
/usr/include/c++/14/bits/stl_pair.h:957:9: note: candidate: 'template<class _U1, class _U2> typename std::enable_if<std::__and_<std::is_assignable<_T1&, _U1&&>, std::is_assignable<_T2&, _U2&&> >::value, std::pair<_T1, _T2>&>::type std::pair<_T1, _T2>::operator=(std::pair<_U1, _U2>&&) [with _U2 = _U1; _T1 = int; _T2 = int]'
957 | operator=(pair<_U1, _U2>&& __p)
| ^~~~~~~~
/usr/include/c++/14/bits/ |
s508051438 | p03768 | C++ | //It is made by ljh2000
//有志者，事竟成，破釜沉舟，百二秦关终属楚；苦心人，天不负，卧薪尝胆，三千越甲可吞吴。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <ctime>
using namespace std;
typedef long long LL;
const int MAXN = 100011;
const int MAXM = 200011;
int n,m,Q,ecnt,first[MAXN],to[MAXM],next[MAXM],col[MAXN],maxd[MAXN];
struct ask{ int x,d,c; }q[MAXN];
inline void link(int x,int y){ next[++ecnt]=first[x]; first[x]=ecnt; to[ecnt]=y; }
inline int getint(){
int w=0,q=0; char c=getchar(); while((c<'0'||c>'9') && c!='-') c=getchar();
if(c=='-') q=1,c=getchar(); while (c>='0'&&c<='9') w=w*10+c-'0',c=getchar(); return q?-w:w;
}
inline void dfs(int x,int d,int c){
if(d<0) return ; if(!col[x]) col[x]=c;
if(maxd[x]>=d) return ;
maxd[x]=d;
for(int i=first[x];i;i=next[i]) {
int v=to[i];
dfs(v,d-1,c);
}
}
inline void work(){
n=getint(); m=getint(); int x,y;
for(int i=1;i<=m;i++) { x=getint(); y=getint(); link(x,y); link(y,x); }
Q=getint(); memset(maxd,-1,sizeof(maxd));
for(int i=1;i<=Q;i++) { q[i].x=getint(); q[i].d=getint(); q[i].c=getint(); }
for(int i=Q;i>=1;i--) dfs(q[i].x,q[i].d,q[i].c);
for(int i=1;i<=n;i++) printf("%d\n",col[i]);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("B.in","r",stdin);
freopen("B.out","w",stdout);
#endif
work();
return 0;
}
//有志者，事竟成，破釜沉舟，百二秦关终属楚；苦心人，天不负，卧薪尝胆，三千越甲可吞吴。
| a.cc: In function 'void link(int, int)':
a.cc:18:32: error: reference to 'next' is ambiguous
18 | inline void link(int x,int y){ next[++ecnt]=first[x]; first[x]=ecnt; to[ecnt]=y; }
| ^~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:66,
from /usr/include/c++/14/algorithm:60,
from a.cc:3:
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:16:37: note: 'int next [200011]'
16 | int n,m,Q,ecnt,first[MAXN],to[MAXM],next[MAXM],col[MAXN],maxd[MAXN];
| ^~~~
a.cc: In function 'void dfs(int, int, int)':
a.cc:28:32: error: reference to 'next' is ambiguous
28 | for(int i=first[x];i;i=next[i]) {
| ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:16:37: note: 'int next [200011]'
16 | int n,m,Q,ecnt,first[MAXN],to[MAXM],next[MAXM],col[MAXN],maxd[MAXN];
| ^~~~
|
s435738048 | p03768 | C++ | #include<iostream>
#include<stack>
using namespace std;
static const int N = 100001;
int n, m,q,color[N];
void dfs(int v,int d,int c) {
color[v]=c;
if(d==0) return;
d--;
for(int i=1;i<=n;i++){
if(M[v][i]==1||M[i][v]==1){
dfs(i,d,c);
}
}
for(int i=1;i<=n;i++){
//ぬる
}
}
int main()
{
int a,b,v[N],d[N],c[N];
cin >> n >>m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < m; i++) {
cin >> a >> b;
M[a][b]=M[b][a]=1;
}
cin>>q;
for(int i=0;i<q;i++){
cin>>v[i]>>d[i]>>c[i];
}
for (int i = 1; i <= n; i++) {
color[i] = 0;
}
for(int i=q-1;i>0;i++){
dfs(v[i],d[i],c[i]);
}
for(int i=1;i<=n;i++){
cout<<color[i]<<endl;
}
return 0;
} | a.cc: In function 'void dfs(int, int, int)':
a.cc:13:8: error: 'M' was not declared in this scope
13 | if(M[v][i]==1||M[i][v]==1){
| ^
a.cc: In function 'int main()':
a.cc:32:25: error: 'M' was not declared in this scope
32 | M[i][j] = 0;
| ^
a.cc:38:5: error: 'M' was not declared in this scope
38 | M[a][b]=M[b][a]=1;
| ^
|
s287578756 | p03768 | C++ | #include<bits/stdc++.h>
#define INF 1e9+7
#define ll long long
#define F first
#define S second
#define N 100005
#define M 1000000009
#define mp make_pair
#define ull unsigned long long
#define sc(n) scanf("%d",&n)
#define gcd __gcd
#define pb push_back
using namespace std;
std::vector<int> v[N],jh;
stack<pair<int,pair<int,int> > > qu;
pair<int,pair<int,int> > pa;
int dis[N],col[N];
void line(int s,int d,int c){
if(!col[s])
col[s]=c;
if(dis[s]>=d || d<1)
return;
dis[s]=max(d,dis[s]);
for(int i: v[s]){
if(dis[i]<d-1)
line(i,d-1,c);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin>>n>>m;
for (int i = 0; i < m; ++i)
{
int x,y;
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int u,d,c,q;
cin>>q;
for(int i=0;i<q;i++){
cin>>u>>d>>c;
qu.push(mp(u,mp(d,c)));
}
while(!qu.empty()){
pa = qu.top();
qu.pop();
line(pa.F,pa.S.F,pa.S.S);
}
for(int i=1;i<=n;i++)
cout<<col[i]<<endl;
return 0;
} | a.cc: In function 'void line(int, int, int)':
a.cc:30:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
30 | int main(){
| ^~
a.cc:30:9: note: remove parentheses to default-initialize a variable
30 | int main(){
| ^~
| --
a.cc:30:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:30:11: error: a function-definition is not allowed here before '{' token
30 | int main(){
| ^
a.cc:56:2: error: expected '}' at end of input
56 | }
| ^
a.cc:20:29: note: to match this '{'
20 | void line(int s,int d,int c){
| ^
|
s613662118 | p03768 | C++ | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (int) 1e5 + 5;
const int mod = (int) 1e9 + 7;
vector<int> g[N];
int n, m, q, ans[N], ds[N], od[N];
void paint (int v, int d, int c, int ood) {
if (ans[v] != 0 && ds[v] >= d) {
return;
}
bool f = true;
if (!ans[v]) {
f = false;
od[v] = ood;
ans[v] = c;
ds[v] = d;
}
if (d) {
for (int to : g[v]) {
if (f && od[to] >= d && od[v] == od[to] && d[v] == d[to] - 1 && ans[v] == ans[to]) {
continue;
}
paint (to, d - 1, c, ood);
}
}
}
int v[N], d[N], c[N];
inline void solve () {
scanf ("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int x, y;
scanf ("%d%d", &x, &y);
g[x].emplace_back (y);
g[y].emplace_back (x);
}
scanf ("%d", &q);
for (int i = 1; i <= q; i++) {
scanf ("%d%d%d", &v[i], &d[i], &c[i]);
}
for (int i = q; i >= 1; i--) {
paint (v[i], d[i], c[i], d[i]);
}
for (int i = 1; i <= n; i++) {
printf ("%d\n", ans[i]);
}
}
int tests = 1;
int main () {
// freopen (".in", "r", stdin);
// freopen (".out", "w", stdout);
// scanf ("%d", &tests);
while (tests--) {
solve ();
}
return 0;
}
| a.cc: In function 'void paint(int, int, int, int)':
a.cc:27:69: error: invalid types 'int[int]' for array subscript
27 | if (f && od[to] >= d && od[v] == od[to] && d[v] == d[to] - 1 && ans[v] == ans[to]) {
| ^
a.cc:27:77: error: invalid types 'int[int]' for array subscript
27 | if (f && od[to] >= d && od[v] == od[to] && d[v] == d[to] - 1 && ans[v] == ans[to]) {
| ^
|
s078920543 | p03768 | C++ | #include <iostream>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
vector<int> adj[100001];
bool dp[100001][11];
int color[100001];
void dfs(int v,int d,int c){
if(color[v]==0) color[v]=c;
dp[v][d]=true;
for(int i=0;i<adj[v].size();i++){
int next = adj[v][i];
if(d>0 && !dp[next][d-1]){
dfs(next,d-1,c);
}
}
}
int main(int argc, const char * argv[]) {
int n,m;
scanf("%d %d",&n,&m);
for(int i=0,x,y;i<m;i++){
scanf("%d %d",&x,&y);
adj[x].push_back(y);
adj[y].push_back(x);
}
int q;
scanf("%d",&q);
for(int i=0;i<q;i++){
scanf("%d %d %d",&v[i],&d[i],&c[i]);
}
for(int i=q-1;i>=0;i--){
dfs(v[i],d[i],c[i]);
}
for(int i=1;i<=n;i++){
printf("%d\n",color[i]);
}
return 0;
}
| a.cc: In function 'int main(int, const char**)':
a.cc:40:27: error: 'v' was not declared in this scope
40 | scanf("%d %d %d",&v[i],&d[i],&c[i]);
| ^
a.cc:40:33: error: 'd' was not declared in this scope
40 | scanf("%d %d %d",&v[i],&d[i],&c[i]);
| ^
a.cc:40:39: error: 'c' was not declared in this scope
40 | scanf("%d %d %d",&v[i],&d[i],&c[i]);
| ^
a.cc:44:13: error: 'v' was not declared in this scope
44 | dfs(v[i],d[i],c[i]);
| ^
a.cc:44:18: error: 'd' was not declared in this scope
44 | dfs(v[i],d[i],c[i]);
| ^
a.cc:44:23: error: 'c' was not declared in this scope
44 | dfs(v[i],d[i],c[i]);
| ^
|
s810452616 | p03768 | C | #include <stdio.h>
#define FOR(i,a,n) for(int i=a;i<n;i++)
int g[100000][100000];
int size[100000];
int color[100000];
int visited[100000];
int c,d;
void dfs(int v,int n){
color[v]=c;
if(n==d) return;
visited[v]=1;
FOR(i,0,size[v]){
if(!visited[g[v][i]]){
dfs(g[v][i],n+1);
}
}
visited[v]=0;
return;
}
int main(void){
int n,m,q;
int a,b;
int v;
scanf("%d %d",&n,&m);
FOR(i,0,m){
scanf("%d %d",&a,&b);
g[a][size[a]++]=b,g[b][size[b]++]=a;
}
scanf("%d",&q);
FOR(i,0,q){
scanf("%d %d %d",&v,&d,&c);
dfs(v,0);
}
FOR(i,1,n+1) printf("%d\n",color[i]);
} | /tmp/cciDbt6W.o: in function `dfs':
main.c:(.text+0x10): relocation truncated to fit: R_X86_64_PC32 against symbol `c' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x25): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x2e): relocation truncated to fit: R_X86_64_PC32 against symbol `d' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x4b): relocation truncated to fit: R_X86_64_PC32 against symbol `visited' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x93): relocation truncated to fit: R_X86_64_PC32 against symbol `visited' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0xe8): relocation truncated to fit: R_X86_64_PC32 against symbol `size' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x108): relocation truncated to fit: R_X86_64_PC32 against symbol `visited' defined in .bss section in /tmp/cciDbt6W.o
/tmp/cciDbt6W.o: in function `main':
main.c:(.text+0x17e): relocation truncated to fit: R_X86_64_PC32 against symbol `size' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x196): relocation truncated to fit: R_X86_64_PC32 against symbol `size' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x1d5): relocation truncated to fit: R_X86_64_PC32 against symbol `size' defined in .bss section in /tmp/cciDbt6W.o
main.c:(.text+0x1ed): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
|
s924422543 | p03768 | C++ | #include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<cstdlib>
#include<list>
#include<set>
#include<numeric>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int N, M, Q;
vector<int> G[100010];
int dp[11][100010];
int color[100010];
int main() {
cin >> N >> M;
memset(dp, 0, sizeof(dp));
for (int i = 0; i < M; i++) {
int a, b;
scanf_s("%d %d",&a,&b);
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
cin >> Q;
for (int i = 1; i <= Q; i++) {
int v, d;
scanf_s("%d %d %d",&v,&d,&color[i]);
v--;
dp[d][v] = max(dp[d][v], i);
}
for (int i = 10; i > 0; i--) {
for (int j = 0; j < N; j++) {
dp[i - 1][j] = max(dp[i - 1][j], dp[i][j]);
for (int &to: G[j]) {
dp[i - 1][to] = max(dp[i - 1][to], dp[i][j]);
}
}
}
for (int i = 0; i < N; i++) {
printf("%d\n",color[dp[0][i]]);
}
return 0;
} | a.cc: In function 'int main()':
a.cc:31:17: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
31 | scanf_s("%d %d",&a,&b);
| ^~~~~~~
| scanf
a.cc:40:17: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
40 | scanf_s("%d %d %d",&v,&d,&color[i]);
| ^~~~~~~
| scanf
|
s221841382 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int nmax = 100010; const LL mod = 1000003;
int N,M,c[nmax],lg[2005][2005],w,as[nmax];
vector<int>G[nmax];
void fct(int nod,tata,int d,int cul){
if(d >= 0&&!c[nod])c[nod] = cul;
if(!d) return;
for(auto it: G[nod])
if(it != tata)
fct(it,nod,d-1,cul);
}
int main(void){
int i,j,x,y,T,z,t,e,nod,dist,cul;
// freopen("txt.in","r",stdin);
// freopen("txt.out","w",stdout);
ios::sync_with_stdio(false);
cin >> N >> M;
for(i = 1; i <= M; ++i){
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
cin >> T;
for(i =1 ; i <= T; ++i)
cin >> as[0] >> as[1] >> as[2];
while(T--)
fct(as[T],0,as[1],as[2]);
for(i = 1; i <= N; ++i)
cout << c[i] << '\n';
return 0;
} | a.cc:12:18: error: 'tata' has not been declared
12 | void fct(int nod,tata,int d,int cul){
| ^~~~
a.cc: In function 'void fct(int, int, int, int)':
a.cc:17:13: error: 'tata' was not declared in this scope
17 | if(it != tata)
| ^~~~
|
s743904559 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int nmax = 100010; const LL mod = 1000003;
int N,M,c[nmax],lg[2005][2005],w,as[nmax];
vector<int>G[nmax];
void fct(int nod,,tata,int d,int cul){
if(d >= 0&&!c[nod])c[nod] = cul;
if(!d) return;
for(auto it: G[nod])
if(it != tata)
fct(it,nod,d-1,cul);
}
int main(void){
int i,j,x,y,T,z,t,e,nod,dist,cul;
// freopen("txt.in","r",stdin);
// freopen("txt.out","w",stdout);
ios::sync_with_stdio(false);
cin >> N >> M;
for(i = 1; i <= M; ++i){
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
cin >> T;
for(i =1 ; i <= T; ++i)
cin >> as[0] >> as[1] >> as[2];
while(T--)
fct(as[T],0,as[1],as[2]);
for(i = 1; i <= N; ++i)
cout << c[i] << '\n';
return 0;
} | a.cc:12:18: error: expected identifier before ',' token
12 | void fct(int nod,,tata,int d,int cul){
| ^
a.cc:12:19: error: 'tata' has not been declared
12 | void fct(int nod,,tata,int d,int cul){
| ^~~~
a.cc: In function 'void fct(int, int, int, int, int)':
a.cc:17:13: error: 'tata' was not declared in this scope
17 | if(it != tata)
| ^~~~
a.cc:18:8: error: too few arguments to function 'void fct(int, int, int, int, int)'
18 | fct(it,nod,d-1,cul);
| ~~~^~~~~~~~~~~~~~~~
a.cc:12:6: note: declared here
12 | void fct(int nod,,tata,int d,int cul){
| ^~~
a.cc: In function 'int main()':
a.cc:37:8: error: too few arguments to function 'void fct(int, int, int, int, int)'
37 | fct(as[T],0,as[1],as[2]);
| ~~~^~~~~~~~~~~~~~~~~~~~~
a.cc:12:6: note: declared here
12 | void fct(int nod,,tata,int d,int cul){
| ^~~
|
s773643916 | p03768 | C | #include <iostream>
#include <vector>
#define REP(i, a, n) for(int i = (a); i <= (n); i++)
using namespace std;
int N, M, Q, v[100001], d[100001], c[100001];
vector<int> E[100001];
int dp[11][100001];
void dfs(int v, int d, int c) {
dp[d][v] = c;
if(d == 0) return;
if(dp[d - 1][v] == 0) dfs(v, d - 1, c);
for(int u : E[v]) if(dp[d - 1][u] == 0) dfs(u, d - 1, c);
}
int main(void) {
cin >> N >> M;
REP(i, 1, M) {
int a, b; cin >> a >> b;
E[a].push_back(b);
E[b].push_back(a);
}
cin >> Q;
REP(i, 1, Q) cin >> v[i] >> d[i] >> c[i];
REP(i, 0, 10) REP(j, 1, N) dp[i][j] = 0;
for(int i = Q; i > 0; i--) {
dfs(v[i], d[i], c[i]);
}
REP(i, 1, N) cout << dp[0][i] << endl;
return 0;
}
| main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s962036995 | p03768 | C++ | #include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
vector<int_least32_t> nodeColor;
vector< vector<int_least32_t>> map;
int paintNode(int_least32_t origin, int_least32_t range, int_least32_t color)
{
if(range == 0) {
return 0;
}
nodeColor[origin] = color;
for(auto& x : map[origin]) {
paintnode(x, range - 1, color);
}
return 0;
}
int main()
{
int_least32_t n, m;
cin >> n >> m;
nodeColor.resize(n);
map,resize(n);
int_least32_t a, b;
for(auto i = 0; i < m; ++i) {
cin >> a >> b;
map[a].push_back(b);
map[b].push_back(a);
}
int_least32_t q;
cin >> q;
int_least32_t v, d, c;
for(auto i = 0; i < q; ++i) {
cin >> v >> d >> c;
paintNode(v, d, q);
}
for(auto& x : nodeColor) {
cout << x << endl;
}
}
| a.cc: In function 'int paintNode(int_least32_t, int_least32_t, int_least32_t)':
a.cc:18:17: error: 'paintnode' was not declared in this scope; did you mean 'paintNode'?
18 | paintnode(x, range - 1, color);
| ^~~~~~~~~
| paintNode
a.cc: In function 'int main()':
a.cc:30:13: error: 'resize' was not declared in this scope; did you mean 'dysize'?
30 | map,resize(n);
| ^~~~~~
| dysize
|
s771573883 | p03768 | C++ | #include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
vector<int_least32_t> nodeColor;
vector< vector<int_least32_t>> map;
int paintNode(int_least32_t origin, int_least32_t range, int_least32_t color)
{
if(range == 0) {
return 0;
}
nodeColor[origin] = color;
for(auto& x : map[origin]) {
paintnode(x, range - 1, color);
}
return 0;
}
int main()
{
int_least32_t n, m;
cin >> n >> m;
nodeColor.resize(n);
map,resize(n);
int_least32_t a, b;
for(auto i = 0; i < m; ++i) {
cin >> a >> b;
map[a].push_back(b);
map[b].push_back(a);
}
int_least32_t q;
cin >> q;
int_least32_t v, m, c;
for(auto i = 0; i < q; ++i) {
cin >> v >> m >> c;
paintNode(v, m, q);
}
for(auto& x : nodeColor) {
cout << x << endl;
}
}
| a.cc: In function 'int paintNode(int_least32_t, int_least32_t, int_least32_t)':
a.cc:18:17: error: 'paintnode' was not declared in this scope; did you mean 'paintNode'?
18 | paintnode(x, range - 1, color);
| ^~~~~~~~~
| paintNode
a.cc: In function 'int main()':
a.cc:30:13: error: 'resize' was not declared in this scope; did you mean 'dysize'?
30 | map,resize(n);
| ^~~~~~
| dysize
a.cc:42:26: error: redeclaration of 'int_least32_t m'
42 | int_least32_t v, m, c;
| ^
a.cc:26:26: note: 'int_least32_t m' previously declared here
26 | int_least32_t n, m;
| ^
|
s827142362 | p03768 | C++ | #include <iostream>
#include <vector>
#include <cstdint>
using namespace std;
vector<int_least32_t> nodeColor;
vector< vector<int_least32_t>> map;
int paintNode(int_least32_t origin, int_least32_t range, int_least32_t color)
{
if(range == 0) {
return 0;
}
nodeColor[origin] = color;
for(auto& x : map[origin]) {
paintnode(x, range - 1, color);
}
return 0;
}
int main()
{
int_least32_t n, m;
cin >> n >> m;
nodeColor.resize(n);
map,resize(n);
int_least32_t a, b;
for(auto i = 0; i < m; ++i) {
cin >> a >> b;
map[a].pushback(b);
map[b].pushback(a);
}
int_least32_t q;
cin >> q;
int_least32_t v, m, c;
for(auto i = 0; i < q; ++i) {
cin >> v >> m >> c;
paintNode(v, m, q);
}
for(auto& x : nodeColor) {
cout << x << endl;
}
}
| a.cc: In function 'int paintNode(int_least32_t, int_least32_t, int_least32_t)':
a.cc:18:17: error: 'paintnode' was not declared in this scope; did you mean 'paintNode'?
18 | paintnode(x, range - 1, color);
| ^~~~~~~~~
| paintNode
a.cc: In function 'int main()':
a.cc:30:13: error: 'resize' was not declared in this scope; did you mean 'dysize'?
30 | map,resize(n);
| ^~~~~~
| dysize
a.cc:35:24: error: '__gnu_cxx::__alloc_traits<std::allocator<std::vector<int> >, std::vector<int> >::value_type' {aka 'class std::vector<int>'} has no member named 'pushback'; did you mean 'push_back'?
35 | map[a].pushback(b);
| ^~~~~~~~
| push_back
a.cc:36:24: error: '__gnu_cxx::__alloc_traits<std::allocator<std::vector<int> >, std::vector<int> >::value_type' {aka 'class std::vector<int>'} has no member named 'pushback'; did you mean 'push_back'?
36 | map[b].pushback(a);
| ^~~~~~~~
| push_back
a.cc:42:26: error: redeclaration of 'int_least32_t m'
42 | int_least32_t v, m, c;
| ^
a.cc:26:26: note: 'int_least32_t m' previously declared here
26 | int_least32_t n, m;
| ^
|
s809751003 | p03768 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
constexpr int MaxN = 100000 + 10;
constexpr int MaxD = 10;
int n, m, q;
vector<int> E[MaxN];
int C[MaxN];
int dp[MaxN][MaxD + 1];
void MaxAssign(int &a, int b) {
a = max(a, b);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--; b--;
E[a].push_back(b);
E[b].push_back(a);
}
cin >> q;
memset(dp, -1, sizeof(dp) / sizeof(int));
for (int i = 0; i < q; i++) {
int v, d, c;
cin >> v >> d >> c;
v--;
C[i] = c;
dp[v][d] = i;
}
for (int dist = 10; dist > 0; dist--) {
for (int no = 0; no < n; no++) {
if (dp[no][dist] >= 0) {
for (auto& to : E[no]) {
MaxAssign(dp[to][dist - 1], dp[no][dist]);
}
MaxAssign(dp[no][dist - 1], dp[no][dist]);
}
}
}
for (int i = 0; i < n; i++) {
int ans = dp[i][0] >= 0 ? C[dp[i][0]] : 0;
cout << ans << endl;
}
}
| a.cc: In function 'int main()':
a.cc:30:5: error: 'memset' was not declared in this scope
30 | memset(dp, -1, sizeof(dp) / sizeof(int));
| ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
3 | #include <algorithm>
+++ |+#include <cstring>
4 |
|
s355344397 | p03768 | Java | import java.util.ArrayList;
import java.util.Scanner;
public class B {
static Scanner scan = new Scanner(System.in);
static int N = scan.nextInt();
static int M = scan.nextInt();
static int dp[][]=new int[N][N];
static int count;
public static void paint(int v,int c,V vs[]){
if(count<0){return;}//探索が奥まで行ったら終了
vs[v].color=c;
for(int j=0;j<vs[v].size();j++){
count--;
paint(vs[v].get(j),c,vs);
count++;
}
}
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
V vs[] = new V[N];
for(int i =0;i<N;i++){
vs[i] = new V(i);
}
int a;
int b;
for(int i =0;i<M;i++){
a=scan.nextInt()-1;
b=scan.nextInt()-1;
vs[a].add(b);
vs[b].add(a);
// dp[a[i]][b[i]]=1;
// dp[b[i]][a[i]]=1;
//a_i,b_iは0 ~ N-1
//二つがつながっていたらdp=1
}
int Q = scan.nextInt();
int v[] = new int[Q];
int d[] = new int[Q];
int c[] = new int[Q];
for(int i =0;i<Q;i++){
v[i]=scan.nextInt() - 1;
d[i]=scan.nextInt();
c[i]=scan.nextInt();
}
//ここから塗りつぶし動作
for(int i =0;i<Q;i++){
count = d[i];
paint(v[i],c[i],vs);
}
for(int i=0;i<N;i++){
System.out.println(vs[i].color);
}
}
static class V extends ArrayList<Integer>{
int id;
int color = 0;
V(int _id){
id = _id;
}
}
}
| Main.java:4: error: class B is public, should be declared in a file named B.java
public class B {
^
1 error
|
s355453917 | p03768 | Java | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] a = new int[2*m];
int[] b = new int[2*m];
int[] color = new int[n];
int[][] dist = new int[n][n];
for(int i=0;i<n;i++){
color[i] = 0;
for(int j=0;j<n;j++){
dist[i][j] = Integer.MAX_VALUE;
}
dist[i][i] = 0;
}
int x;
int y;
for(int i=0;i<m;i++){
a[2*i] = sc.nextInt()-1;
b[2*i] = sc.nextInt()-1;
a[2*i+1] = b[2*i];
b[2*i+1] = a[2*i];
dist[a[2*i]][b[2*i]] = 1;
dist[b[2*i]][a[2*i]] = 1;
}
}
boolean changed = true;
int kouho1=0;
int kouho2=0;
while(changed){
changed = false;
for(int i=0; i<2*m; i++){
for(int j=0; j<n; j++){
if(dist[a[i]][j] != Integer.MAX_VALUE){
kouho1 = dist[a[i]][j]+1;
}else{
kouho1 = Integer.MAX_VALUE;
}
if(dist[b[i]][j] != Integer.MAX_VALUE){
kouho2 = dist[b[i]][j]+1;
}else{
kouho2 = Integer.MAX_VALUE;
}
if(dist[a[i]][j] > kouho2){
dist[a[i]][j] = kouho2;
changed = true;
}
if(dist[b[i]][j] > kouho1){
dist[b[i]][j] = kouho1;
changed = true;
}
}
}
}
int q = sc.nextInt();
int v;
int d;
int c;
for(int i=0; i<q; i++){
v = sc.nextInt()-1;
d = sc.nextInt();
c = sc.nextInt();
for(int j=0; j<n; j++){
if(dist[v][j]<=d){
color[j] = c;
}
}
/*for(int j=0; j<n; j++){
System.out.println(color[j]);
}*/
}
/*for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
System.out.println("dist["+i+"]["+j+"] = "+dist[i][j]);
}
}*/
for(int i=0; i<n; i++){
System.out.println(color[i]);
}
return;
}
} | Main.java:36: error: illegal start of type
while(changed){
^
Main.java:36: error: <identifier> expected
while(changed){
^
Main.java:66: error: illegal start of type
for(int i=0; i<q; i++){
^
Main.java:66: error: > or ',' expected
for(int i=0; i<q; i++){
^
Main.java:66: error: <identifier> expected
for(int i=0; i<q; i++){
^
Main.java:87: error: illegal start of type
for(int i=0; i<n; i++){
^
Main.java:87: error: > or ',' expected
for(int i=0; i<n; i++){
^
Main.java:87: error: <identifier> expected
for(int i=0; i<n; i++){
^
Main.java:90: error: illegal start of type
return;
^
Main.java:92: error: class, interface, enum, or record expected
}
^
10 errors
|
s050672878 | p03768 | C++ | a | a.cc:1:1: error: 'a' does not name a type
1 | a
| ^
|
s771573968 | p03768 | C++ | //部分点が狙えるかも、また、枝刈りで通ればいいなあ
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define pb push_back
typedef pair<int, int> Pi;
typedef pair<Pi, Pi> Ti;
#define fi first
#define se second
vector < int > G[100005];
int color[100005] = {0};
int power[100005] = {0};
int flag[100005];
int N, M;
priority_queue < Ti > pq;
void bfs() {
while(!pq.empty()) {
int v = pq.top().se.fi, d = pq.top().fi.fi, p = pq.top().fi.se, c = pq.top().se.se; pq.pop();
if(color[v]) continue;
color[v] = c, power[v] = p;
Rep(i, G[v].size()) {
int u = G[v][i];
if(color[u] && power[u] > p) continue;
if(d > 1) {
color[u] = c, power[u] = p;
pq.push(Ti(Pi(u, d - 1), Pi(p, c));
}
}
}
}
signed main()
{
int A, B;
int Q;
int v[100005], d[100005], c[100005];
cin >> N >> M;
while(M--) {
cin >> A >> B; --A, --B;
G[A].pb(B); G[B].pb(A);
}
cin >> Q;
int v, d, c;
fill_n(flag, 100005, -1);
Rep(i, Q) {
cin >> v >> d >> c; --v;
pq.push(Ti(Pi(d, i), Pi(v, c)));
}
bfs();
Rep(i, N) {
cout << color[i] << endl;
}
return 0;
}
| a.cc: In function 'void bfs()':
a.cc:35:43: error: expected ')' before ';' token
35 | pq.push(Ti(Pi(u, d - 1), Pi(p, c));
| ~ ^
| )
a.cc: In function 'int main()':
a.cc:56:7: error: conflicting declaration 'long long int v'
56 | int v, d, c;
| ^
a.cc:45:7: note: previous declaration as 'long long int v [100005]'
45 | int v[100005], d[100005], c[100005];
| ^
a.cc:56:10: error: conflicting declaration 'long long int d'
56 | int v, d, c;
| ^
a.cc:45:18: note: previous declaration as 'long long int d [100005]'
45 | int v[100005], d[100005], c[100005];
| ^
a.cc:56:13: error: conflicting declaration 'long long int c'
56 | int v, d, c;
| ^
a.cc:45:29: note: previous declaration as 'long long int c [100005]'
45 | int v[100005], d[100005], c[100005];
| ^
a.cc:59:9: error: no match for 'operator>>' (operand types are 'std::istream' {aka 'std::basic_istream<char>'} and 'long long int [100005]')
59 | cin >> v >> d >> c; --v;
| ~~~ ^~ ~
| | |
| | long long int [100005]
| std::istream {aka std::basic_istream<char>}
In file included from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127,
from a.cc:3:
/usr/include/c++/14/istream:170:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(bool&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
170 | operator>>(bool& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:170:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: cannot bind non-const lvalue reference of type 'bool&' to a value of type 'long long int*'
59 | cin >> v >> d >> c; --v;
| ^
/usr/include/c++/14/istream:174:7: note: candidate: 'std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(short int&) [with _CharT = char; _Traits = std::char_traits<char>]' (near match)
174 | operator>>(short& __n);
| ^~~~~~~~
/usr/include/c++/14/istream:174:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'short int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(short int)((long long int*)(& v))' to 'short int&'
/usr/include/c++/14/istream:177:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(short unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
177 | operator>>(unsigned short& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:177:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'short unsigned int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(short unsigned int)((long long int*)(& v))' to 'short unsigned int&'
/usr/include/c++/14/istream:181:7: note: candidate: 'std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(int&) [with _CharT = char; _Traits = std::char_traits<char>]' (near match)
181 | operator>>(int& __n);
| ^~~~~~~~
/usr/include/c++/14/istream:181:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(int)((long long int*)(& v))' to 'int&'
/usr/include/c++/14/istream:184:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
184 | operator>>(unsigned int& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:184:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'unsigned int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(unsigned int)((long long int*)(& v))' to 'unsigned int&'
/usr/include/c++/14/istream:188:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
188 | operator>>(long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:188:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'long int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(long int)((long long int*)(& v))' to 'long int&'
/usr/include/c++/14/istream:192:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
192 | operator>>(unsigned long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:192:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'long unsigned int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(long unsigned int)((long long int*)(& v))' to 'long unsigned int&'
/usr/include/c++/14/istream:199:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
199 | operator>>(long long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:199:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'long long int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(long long int)((long long int*)(& v))' to 'long long int&'
/usr/include/c++/14/istream:203:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long long unsigned int&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
203 | operator>>(unsigned long long& __n)
| ^~~~~~~~
/usr/include/c++/14/istream:203:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: invalid conversion from 'long long int*' to 'long long unsigned int' [-fpermissive]
59 | cin >> v >> d >> c; --v;
| ^
| |
| long long int*
a.cc:59:12: error: cannot bind rvalue '(long long unsigned int)((long long int*)(& v))' to 'long long unsigned int&'
/usr/include/c++/14/istream:328:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' (near match)
328 | operator>>(void*& __p)
| ^~~~~~~~
/usr/include/c++/14/istream:328:7: note: conversion of argument 1 would be ill-formed:
a.cc:59:12: error: cannot bind non-const lvalue reference of type 'void*&' to an rvalue of type 'void*'
59 | cin >> v >> d >> c; --v;
| ^
/usr/include/c++/14/istream:219:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(float&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
219 | operator>>(float& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:219:25: note: no known conversion for argument 1 from 'long long int [100005]' to 'float&'
219 | operator>>(float& __f)
| ~~~~~~~^~~
/usr/include/c++/14/istream:223:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
223 | operator>>(double& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:223:26: note: no known conversion for argument 1 from 'long long int [100005]' to 'double&'
223 | operator>>(double& __f)
| ~~~~~~~~^~~
/usr/include/c++/14/istream:227:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]'
227 | operator>>(long double& __f)
| ^~~~~~~~
/usr/include/c++/14/istream:227:31: note: no known conversion for argument 1 from 'long long int [100005]' to 'long double&'
227 | operator>>(long double& __f)
| ~~~~~~~~~~~~~^~~
/usr/include/c++/14/istream:122:7: note: candidate: 'std::basic_istream<_CharT, _Tr |
s643506243 | p03768 | C++ | #include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
#define newline puts("")
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;
vvi to;
int main() {
int n,m;
scanf("%d%d",&n,&m);
to = vvi(n);
rep(i,m) {
int a,b;
scanf("%d%d",&a,&b);
--a; --b;
to[a].pb(b);
to[b].pb(a);
}
vi vq, dq, cq;
int q;
scanf("%d",&q);
rep(i,q) {
vq.pb(in()-1);
dq.pb(in());
cq.pb(in());
}
vp p(n);
drep(qi,q) {
int v = vq[qi];
int d = dq[qi];
int c = cq[qi];
queue<int> q;
if (p[v].fi >= d) continue;
p[v] = P(d,c);
q.push(v);
while (sz(q)) {
v = q.front(); q.pop();
for (int u : to[v]) {
P x(p[v]);
x.fi--;
if (p[u].fi >= x.fi) continue;
p[u] = x;
q.push(u);
}
}
}
rep(i,n) {
printf("%d\n",p[i].se);
}
return 0;
}
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
#define newline puts("")
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;
vvi to;
int main() {
int n,m;
scanf("%d%d",&n,&m);
to = vvi(n);
rep(i,m) {
int a,b;
scanf("%d%d",&a,&b);
--a; --b;
to[a].pb(b);
to[b].pb(a);
}
vi vq, dq, cq;
int q;
scanf("%d",&q);
rep(i,q) {
vq.pb(in()-1);
dq.pb(in());
cq.pb(in());
}
vp p(n);
drep(qi,q) {
int v = vq[qi];
int d = dq[qi];
int c = cq[qi];
queue<int> q;
if (p[v].fi >= d) continue;
p[v] = P(d,c);
q.push(v);
while (sz(q)) {
v = q.front(); q.pop();
for (int u : to[v]) {
P x(p[v]);
x.fi--;
if (p[u].fi >= x.fi) continue;
p[u] = x;
q.push(u);
}
}
}
rep(i,n) {
printf("%d\n",p[i].se);
}
return 0;
}
| a.cc:181:12: error: redefinition of 'int in()'
181 | inline int in() { int x; scanf("%d",&x); return x;}
| ^~
a.cc:50:12: note: 'int in()' previously defined here
50 | inline int in() { int x; scanf("%d",&x); return x;}
| ^~
a.cc:182:13: error: redefinition of 'void priv(vi)'
182 | inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
| ^~~~
a.cc:51:13: note: 'void priv(vi)' previously defined here
51 | inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
| ^~~~
a.cc:183:30: error: redefinition of 'template<class T> std::istream& operator>>(std::istream&, std::vector<_Tp>&)'
183 | template<typename T>istream& operator>>(istream&i,vector<T>&v)
| ^~~~~~~~
a.cc:52:30: note: 'template<class T> std::istream& operator>>(std::istream&, std::vector<_Tp>&)' previously declared here
52 | template<typename T>istream& operator>>(istream&i,vector<T>&v)
| ^~~~~~~~
a.cc:185:28: error: redefinition of 'template<class T> std::string join(const std::vector<_Tp>&)'
185 | template<typename T>string join(const vector<T>&v)
| ^~~~
a.cc:54:28: note: 'template<class T> std::string join(const std::vector<_Tp>&)' previously declared here
54 | template<typename T>string join(const vector<T>&v)
| ^~~~
a.cc:187:30: error: redefinition of 'template<class T> std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)'
187 | template<typename T>ostream& operator<<(ostream&o,const vector<T>&v)
| ^~~~~~~~
a.cc:56:30: note: 'template<class T> std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)' previously declared here
56 | template<typename T>ostream& operator<<(ostream&o,const vector<T>&v)
| ^~~~~~~~
a.cc:189:43: error: redefinition of 'template<class T1, class T2> std::istream& operator>>(std::istream&, std::pair<_T1, _T2>&)'
189 | template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
| ^~~~~~~~
a.cc:58:43: note: 'template<class T1, class T2> std::istream& operator>>(std::istream&, std::pair<_T1, _T2>&)' previously declared here
58 | template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
| ^~~~~~~~
a.cc:191:43: error: redefinition of 'template<class T1, class T2> std::ostream& operator<<(std::ostream&, const std::pair<_T1, _T2>&)'
191 | template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v)
| ^~~~~~~~
a.cc:60:43: note: 'template<class T1, class T2> std::ostream& operator<<(std::ostream&, const std::pair<_T1, _T2>&)' previously declared here
60 | template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v)
| ^~~~~~~~
a.cc:193:11: error: redefinition of 'const int MX'
193 | const int MX = 100005, INF = 1001001001;
| ^~
a.cc:62:11: note: 'const int MX' previously defined here
62 | const int MX = 100005, INF = 1001001001;
| ^~
a.cc:193:24: error: redefinition of 'const int INF'
193 | const int MX = 100005, INF = 1001001001;
| ^~~
a.cc:62:24: note: 'const int INF' previously defined here
62 | const int MX = 100005, INF = 1001001001;
| ^~~
a.cc:194:10: error: redefinition of 'const ll LINF'
194 | const ll LINF = 1e18;
| ^~~~
a.cc:63:10: note: 'const ll LINF' previously defined here
63 | const ll LINF = 1e18;
| ^~~~
a.cc:195:14: error: redefinition of 'const double eps'
195 | const double eps = 1e-10;
| ^~~
a.cc:64:14: note: 'const double eps' previously defined here
64 | const double eps = 1e-10;
| ^~~
a.cc:197:5: error: redefinition of 'vvi to'
197 | vvi to;
| ^~
a.cc:66:5: note: 'vvi to' previously declared here
66 | vvi to;
| ^~
a.cc:199:5: error: redefinition of 'int main()'
199 | int main() {
| ^~~~
a.cc:68:5: note: 'int main()' previously defined here
68 | int main() {
| ^~~~
|
s355041037 | p03768 | C++ | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
#include<map>
#include<algorithm>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define MOD 1000000007
#define MAX 1000000001
#define INF 1410065408
#define EPS 1e-9
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{int from, to; ll cost;};
vector<ll> es[1000000];
vector<ll> color(1000000, 0);
ll v, d, c;
void dfs(ll vv, ll depth, vector<bool> use){
color[vv] = c;
use[vv] = true;
if(depth == d) return;
for(ll to : es[vv]){
if(!use[to]) dfs(to, depth+1, use);
}
}
signed main(){
ll N, M, Q;
scanf("%lld %lld", &N, &M);
rep(M){
ll tmp1, tmp2;
scanf("%lld %lld", &tmp1, &tmp2);
es[tmp1].push_back(tmp2);
es[tmp2].push_back(tmp1);
}
scanf("%lld", &Q);
rep(Q){
scanf("%lld %lld %lld", &v, &d, &c);
dfs(v, 0, vector<bool>(N+1, false));
}
rep(N){
printf("%lld\n", color[i+1]);
}
}
| a.cc:21:9: error: 'pair' does not name a type
21 | typedef pair<ll, ll> P;
| ^~~~
a.cc:24:1: error: 'vector' does not name a type
24 | vector<ll> es[1000000];
| ^~~~~~
a.cc:25:1: error: 'vector' does not name a type
25 | vector<ll> color(1000000, 0);
| ^~~~~~
a.cc:28:27: error: 'vector' has not been declared
28 | void dfs(ll vv, ll depth, vector<bool> use){
| ^~~~~~
a.cc:28:33: error: expected ',' or '...' before '<' token
28 | void dfs(ll vv, ll depth, vector<bool> use){
| ^
a.cc: In function 'void dfs(ll, ll, int)':
a.cc:29:9: error: 'color' was not declared in this scope
29 | color[vv] = c;
| ^~~~~
a.cc:30:9: error: 'use' was not declared in this scope
30 | use[vv] = true;
| ^~~
a.cc:32:21: error: 'es' was not declared in this scope
32 | for(ll to : es[vv]){
| ^~
a.cc: In function 'int main()':
a.cc:43:17: error: 'es' was not declared in this scope
43 | es[tmp1].push_back(tmp2);
| ^~
a.cc:49:27: error: 'vector' was not declared in this scope
49 | dfs(v, 0, vector<bool>(N+1, false));
| ^~~~~~
a.cc:49:27: note: suggested alternatives:
In file included from /usr/include/c++/14/vector:66,
from /usr/include/c++/14/queue:63,
from a.cc:5:
/usr/include/c++/14/bits/stl_vector.h:428:11: note: 'std::vector'
428 | class vector : protected _Vector_base<_Tp, _Alloc>
| ^~~~~~
/usr/include/c++/14/vector:93:13: note: 'std::pmr::vector'
93 | using vector = std::vector<_Tp, polymorphic_allocator<_Tp>>;
| ^~~~~~
a.cc:49:34: error: expected primary-expression before 'bool'
49 | dfs(v, 0, vector<bool>(N+1, false));
| ^~~~
a.cc:52:34: error: 'color' was not declared in this scope
52 | printf("%lld\n", color[i+1]);
| ^~~~~
|
s166724481 | p03768 | C++ | #include <iostream>
#include <vector>
using namespace std;
const int N = 100000;
int n, m, q, color[N], a[N], b[N], v[N], d[N], c[N], used[N];
vector <vector<int>>mat(N, vector<int>(N));
void use(int node, int length, int c) {
if (length == 0)return;
used[node] = 1;
for (int i = 0; i < mat[node].size(); i++) {
if (used[i] == 0)use(i, length - 1);
}
color[node] = c;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
mat[a[i] - 1][b[i] - 1] = 1;
mat[b[i] - 1][a[i] - 1] = 1;
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> v[i] >> d[i] >> c[i];
}
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++)used[j] = 0;
use(v[i] - 1, d[i], c[i]);
}
for (int i = 0; i < n; i++) {
cout << color[i] << endl;
}
} | a.cc: In function 'void use(int, int, int)':
a.cc:13:37: error: too few arguments to function 'void use(int, int, int)'
13 | if (used[i] == 0)use(i, length - 1);
| ~~~^~~~~~~~~~~~~~~
a.cc:9:6: note: declared here
9 | void use(int node, int length, int c) {
| ^~~
|
s715335583 | p03768 | C | #include <iostream>
#include <algorithm>
#include <set>
#include <array>
using namespace std;
int n, m, q;
int v[100000], d[100000], c[100000];
array< array< set<int>, 100000> , 11> dp;
int main() {
cin >> n >> m;
for(int i = 0; i < n; i++) {
dp[0][i].insert(i);
dp[1][i].insert(i);
}
for (int i = 0; i < m; i++) {
int ta, tb;
cin >> ta >> tb;
ta--; tb--;
dp[1][ta].insert(tb);
}
for (int i = 2; i < 11; i++) {
for (int j = 0; j < n; j++) {
dp[i][j].insert(dp[i -1][j].begin(),dp[i -1][j].end());
for (auto node : dp[i -1][j]) {
dp[i][j].insert(dp[1][node].begin(),dp[1][node].end());
}
}
}
cin >> q;
for (int i = 0; i< q; i++) {
cin >> v[i] >> d[i] >> c[i];
v[i] --;
}
for (int i = 0; i < n; i++) {
bool find_out = false;
for (int j = q - 1; j >= 0; j --) {
if (dp[d[j]][v[j]].find(i) != dp[d[j]][v[j]].end()) {
cout << c[j] << endl;
find_out = true;
break;
}
}
if (find_out == false) {
cout << 0 << endl;
}
}
return 0;
}
| main.c:1:10: fatal error: iostream: No such file or directory
1 | #include <iostream>
| ^~~~~~~~~~
compilation terminated.
|
s827554305 | p03768 | C++ | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
const int MaxN = 1e5;
using namespace std;
int vis[MaxN + 5][MaxN + 5] , dis[MaxN + 5][MaxN + 5];
int ans[MaxN + 5] , n , m , T;
queue<int>que;
vector<int>G[MaxN + 5];
void Init(){
memset(vis , 0 , sizeof(vis));
memset(ans , 0 , sizeof(ans));
for(int i = 1;i <= MaxN;i++){
for(int j = 1;j <= MaxN;j++){
dis[i][j] = 1 << 30;
}
}
for(int i = 1;i <= MaxN;i++) G[i].clear();
for(int i = 1;i <= m;i++){
int u , v;
scanf("%d%d" , &u , &v);
G[u].push_back(v);
G[v].push_back(u);
}
}
void SPFA(int x , int z){
vis[z][x] = 1;
dis[z][x] = 0;
que.push(x);
while(que.size()){
int now = que.front();
que.pop();
for(int i = 0;i < G[now].size();i++){
int v = G[now][i];
if(dis[z][v] > dis[z][now] + 1){
dis[z][v] = dis[z][now] + 1;
if(!vis[z][v]){
vis[z][v] = 1;
que.push(v);
}
}
vis[z][now] = 0;
}
}
}
void Solve(){
for(int i = 1;i <= n;i++){
while(que.size()) que.pop();
SPFA(i , i);
}
scanf("%d" , &T);
for(int i = 1;i <= T;i++){
int a , b , c;
scanf("%d%d%d" , &a , &b , &c);
for(int j = 1;j <= n;j++){
if(dis[a][j] <= b){
ans[j] = c;
}
}
}
for(int i = 1;i <= n;i++){
printf("%d\n" , ans[i]);
}
}
int main()
{
while(~scanf("%d%d" , &n , &m)){
Init();
Solve();
}
} | /tmp/ccGyhThR.o: in function `Init()':
a.cc:(.text+0x36): relocation truncated to fit: R_X86_64_PC32 against symbol `ans' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x74): relocation truncated to fit: R_X86_64_PC32 against symbol `dis' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0xb8): relocation truncated to fit: R_X86_64_PC32 against symbol `G' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x112): relocation truncated to fit: R_X86_64_PC32 against symbol `G' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x13e): relocation truncated to fit: R_X86_64_PC32 against symbol `G' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x15a): relocation truncated to fit: R_X86_64_PC32 against symbol `m' defined in .bss section in /tmp/ccGyhThR.o
/tmp/ccGyhThR.o: in function `SPFA(int, int)':
a.cc:(.text+0x1c5): relocation truncated to fit: R_X86_64_PC32 against symbol `dis' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x1da): relocation truncated to fit: R_X86_64_PC32 against symbol `que' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x1ee): relocation truncated to fit: R_X86_64_PC32 against symbol `que' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x202): relocation truncated to fit: R_X86_64_PC32 against symbol `que' defined in .bss section in /tmp/ccGyhThR.o
a.cc:(.text+0x230): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
|
s044046219 | p03768 | Java | import java.util.Scanner;
public class B {
static Scanner scan = new Scanner(System.in);
static int N = scan.nextInt();
static int M = scan.nextInt();
static int dp[][]=new int[N][N];
static int count;
static int color[]=new int[N];
public static void paint(int v,int c){
if(count<0){return;}
for(int j=0;j<N;j++){
if(dp[v][j]==1){
count--;
paint(j,c);
count++;
}
}
color[v]=c;
}
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
int a[] = new int[M];
int b[] = new int[M];
for(int i =0;i<M;i++){
a[i]=scan.nextInt()-1;
b[i]=scan.nextInt()-1;
dp[a[i]][b[i]]=1;
dp[b[i]][a[i]]=1;
//a_i,b_iは0 ~ N-1
//二つがつながっていたらdp=1
}
int Q = scan.nextInt();
int v[] = new int[Q];
int d[] = new int[Q];
int c[] = new int[Q];
for(int i =0;i<Q;i++){
v[i]=scan.nextInt() - 1;
d[i]=scan.nextInt();
c[i]=scan.nextInt();
}
//ここから塗りつぶし動作
for(int i =0;i<Q;i++){
count = d[i];
paint(v[i],c[i]);
}
for(int i=0;i<N;i++){
System.out.println(color[i]);
}
}
}
| Main.java:3: error: class B is public, should be declared in a file named B.java
public class B {
^
1 error
|
s007724602 | p03768 | C++ | #include <iostream>
#include <array>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <string>
#include <sstream>
#include <memory>
#include <cassert>
#include <functional>
#include <chrono>
#define SAFE_DELETE(p) { delete (p); (p) = nullptr; }
#define SAFE_DELETE_ARRAY(p) { delete[] (p); (p) = nullptr; }
using namespace std;
namespace ValLib {
const int MOD = 1000000007;
typedef unsigned long long ull;
template <typename Key, typename Value>
class unordered_vmap;
template <typename T>
using sptr = typename std::shared_ptr<T>;
class vnode;
class vegde;
class vgraph;
template<typename T>
void fill(vector<vector<T>>& vec, const T& value) {
for (vector<T>& t : vec) {
fill(t, value);
}
}
template<typename T>
void fill(vector<T>& vec, const T& value) {
fill(vec.begin(), vec.end(), value);
}
template<typename T>
void resize(vector<vector<T>>& vec, int size1, int size2) {
vec.resize(size1);
for (vector<T>& t : vec) {
t.resize(size2);
}
}
template<typename Key, typename Value>
class umap : public std::unordered_map<Key, Value> {
public:
bool containsKey(const Key& key) const;
bool containsValue(const Value& val) const;
};
template<typename Key, typename Value>
bool umap<Key, Value>::containsKey(const Key& key) const {
return (this->find(key) != this->end());
}
template<typename Key, typename Value>
bool umap<Key, Value>::containsValue(const Value& val) const {
for (auto itr = this->begin(); itr != this->end(); ++itr) {
if (itr->second == val) {
return true;
}
}
return false;
}
class Point {
public:
inline Point() :
x(-1),
y(-1)
{}
inline Point(int _x, int _y) :
x(_x),
y(_y)
{}
//static Point getDistance(const Point& p1, const Point& p2);
void setPos(const Point& pos) { x = pos.x; y = pos.y; }
void setPos(int x, int y) { this->x = x; this->y = y; }
Point operator+ (const Point &p) const { return move(Point(x + p.x, y + p.y)); }
Point operator- (const Point &p) const { return move(Point(x - p.x, y - p.y)); }
void operator+= (const Point &p) { x += p.x; y += p.y; }
void operator-= (const Point &p) { x -= p.x; y -= p.y; }
bool operator== (const Point &p) const { return x == p.x && y == p.y; }
bool operator!= (const Point &p) const { return x != p.x || y != p.y; }
//bool operator<(const Point &p) const {return x * x + y * y < p.x * p.x + p.y * p.y;}
const Point& getPos() const { return *this; }
string to_string() const { return "(" + std::to_string(x) + ", " + std::to_string(y) + ")"; }
int x;
int y;
};
//Point Point::getDistance(const Point& p1, const Point& p2) {
// return move(Point(abs(p1.x - p2.x), abs(p1.y - p2.y)));
//}
/// <summary>
/// 素集合データ構造
/// </summary>
class UnionFind {
public:
/// <summary>
/// コンストラクタ
/// </summary>
/// <param name="N">要素数</param>
UnionFind(int N) {
parent.resize(N);
for (int i = 0; i < N; ++i) {
parent[i] = i;
}
}
/// <summary>
/// 要素xの根を探索
/// </summary>
/// <param name="x">探索する要素番号(0～N-1)</param>
/// <returns>要素xの根(0～N-1)</returns>
int find(int x) {
if (parent[x] == x) {
return x;
}
else {
parent[x] = find(parent[x]); // 経路圧縮(間接的な要素をrootに直接つなぐ)
return parent[x];
}
}
/// <summary>
/// ２つの要素の根が同じか
/// </summary>
/// <param name="x1">探索する要素番号１(0～N-1)</param>
/// <param name="x2">探索する要素番号２(0～N-1)</param>
/// <returns>true: 同じ根, false: 異なる根</returns>
bool same(int x1, int x2) {
return find(x1) == find(x2);
}
/// <summary>
/// ２つの要素の根同士を繋ぐ
/// </summary>
/// <param name="x1">要素番号１(0～N-1)</param>
/// <param name="x2">要素番号１(0～N-1)</param>
void union_elements(int x1, int x2) {
int rootX1 = find(x1);
int rootX2 = find(x2);
parent[rootX2] = rootX1;
}
private:
vector<int> parent;
};
class vmath {
public:
// 約数を全て求める O(√n)
static ull calcDivisors(list<ull>* divisors, ull n) {
divisors->clear();
if (n <= 0ull) {
return 0ull;
}
divisors->push_back(1ull);
if (n != 1ull) {
divisors->push_back(n);
}
for (ull i = 2ull; i * i <= n; ++i) {
if (n % i == 0ull) {
divisors->push_back(i);
if (i != n / i) {
divisors->push_back(n / i);
}
}
}
return divisors->size();
}
// 約数の個数を返す O(√n)
static ull calcDivisorNum(ull n) {
if (n <= 0ull) {
return 0ull;
}
ull count = 1ull; // for 1
if (n != 1ull) {
++count; // for n
}
// for 2～n-1
for (ull i = 2ull; i * i <= n; ++i) {
if (n % i == 0ull) {
count += 1ull;
if (i != n / i) {
count += 1ull;
}
}
}
return count;
}
// 素因数分解 O(√n)
static int calcDecompositPrime(list<ull>* primes, ull n) {
primes->clear();
if (n == 0) {
return 0ull;
}
if (n == 1) {
primes->push_back(1);
return 1ull;
}
// 割る数の初期値
ull a = 2ull;
// √n ≧ a ( n ≧ a * a ) の間ループ処理
while (n >= a * a) {
if (n % a == 0ull) {
// a で割り切れたら、a は素因数
primes->push_back(a);
// そして、割られる数を a で割る
n /= a;
}
else {
// a で割り切れなかったら、 a を 1 増加させる
a++;
}
}
primes->push_back(n);
return primes->size();
}
// 素因数の数を返す O(√n)
static ull calcDecompositPrimeNum(ull n) {
if (n <= 1) {
return n;
}
ull count = 0ull;
// 割る数の初期値
ull a = 2ull;
// √n ≧ a ( n ≧ a * a ) の間ループ処理
while (n >= a * a) {
if (n % a == 0ull) {
// a で割り切れたら、a は素因数
++count;
// そして、割られる数を a で割る
n /= a;
}
else {
// a で割り切れなかったら、 a を 1 増加させる
a++;
}
}
++count; // for n
return count;
}
// 階乗
static ull fact(ull x) {
if (x == 0ull) {
return 1ull;
}
else {
return x * fact(x - 1ull);
}
}
// 順列 nPr
static ull permutation(int n, int r) {
assert(n >= r);
//return fact(n) / fact(n - r);
ull result = 1;
for (ull i = n; i > n - r; --i) {
result *= i;
}
return result;
}
// 組み合わせ nCr
// 先にmakePascalTriangleでパスカルの三角形を作成しておく必要がある
static ull combination(int n, int r) {
assert(n >= r);
assert(n <= mPascalTriangleDepth);
return mPascalTriangle[n][r];
}
// 重複組合せ nHr = n+r-1Cr
// 使いどころ：n人にr個を配るとき、同じ人に何個配っても良い場合とか
// 4人に5個の◯を配るときa=2,b=0,c=2,d=1のとき、◯◯||◯◯|◯みたいになる。
// これは◯と|を混ぜた組み合わせで、◯の数がn,棒の数はr-1だから全体でn+r-1
// (n-r)で割ったものが順列n+r-1Prで、それを更にrで割っているからnHr = n+r-1Cr
static ull repeatedCombination(int n, int r) {
return combination(n + r - 1, r);
}
// パスカルの三角形。組み合わせの計算に使用するのでこれを先に作成しておく必要がある。
static void makePascalTriangle(int depth) {
resize(mPascalTriangle, depth + 1, depth + 1);
for (int i = 0; i <= depth; ++i) {
mPascalTriangle[i][0] = 1;
for (int j = 1; j <= i; ++j) {
mPascalTriangle[i][j] = mPascalTriangle[i - 1][j] + mPascalTriangle[i - 1][j - 1];
}
}
mPascalTriangleDepth = depth;
}
// xのN桁目の数値を得る
static ull getNDigitNumber(ull x, ull n) {
return (x / pow(10ull, n - 1ull)) % 10;
}
// xのN桁目の数値を得る
static int getNDigitNumber(int x, int n) {
assert(n <= 10);
return (x / pow(10, n - 1)) % 10;
}
// xのN乗を求める(バイナリ法) O(logN)
static ull pow(ull x, ull n) {
assert(x >= 0ull);
assert(n >= 0ull);
if (x == 0ull) {
if (n == 0ull) {
return 1ull;
}
else {
return 0ull;
}
}
ull result = 1ull;
ull z = x;
while (n > 0ull) {
if (n & 1ull) {
result *= z;
}
z *= z;
n >>= 1;
}
return result;
}
// xのN乗を求める(バイナリ法) O(logN)
static int pow(int x, int n) {
assert(x >= 0);
assert(n >= 0);
if (x == 0) {
if (n == 0) {
return 1;
}
else {
return 0;
}
}
int result = 1;
int z = x;
while (n > 0) {
if (n & 1) {
result *= z;
}
z *= z;
n >>= 1;
}
return result;
}
private:
static int mPascalTriangleDepth;
static vector<vector<ull>> mPascalTriangle;
};
int vmath::mPascalTriangleDepth = 0;
vector<vector<ull>> vmath::mPascalTriangle;
class vmath_mod {
public:
// 階乗
static ull fact(ull x) {
ull result = 1ull;
for (ull i = 1ull; i <= x; ++i) {
result *= i;
result %= MOD;
}
return result;
}
// 順列 nPr
static ull permutation(int n, int r) {
assert(n >= r);
//return fact(n) / fact(n - r);
ull result = 1;
for (ull i = n; i > n - r; --i) {
result *= i;
result %= MOD;
}
return result;
}
// 組み合わせ nCr
// 先にmakePascalTriangleでパスカルの三角形を作成しておく必要がある
static ull combination(int n, int r) {
assert(n >= r);
assert(n <= mPascalTriangleDepth);
return mPascalTriangle[n][r];
}
// 重複組合せ nHr = n+r-1Cr
// 使いどころ：n人にr個を配るとき、同じ人に何個配っても良い場合とか
// 4人に5個の◯を配るときa=2,b=0,c=2,d=1のとき、◯◯||◯◯|◯みたいになる。
// これは◯と|を混ぜた組み合わせで、◯の数がn,棒の数はr-1だから全体でn+r-1
// (n-r)で割ったものが順列n+r-1Prで、それを更にrで割っているからnHr = n+r-1Cr
static ull repeatedCombination(int n, int r) {
return combination(n + r - 1, r);
}
// パスカルの三角形。組み合わせの計算に使用するのでこれを先に作成しておく必要がある。
static void makePascalTriangle(int depth) {
resize(mPascalTriangle, depth + 1, depth + 1);
for (int i = 0; i <= depth; ++i) {
mPascalTriangle[i][0] = 1;
for (int j = 1; j <= i; ++j) {
mPascalTriangle[i][j] = (mPascalTriangle[i - 1][j] + mPascalTriangle[i - 1][j - 1]) % MOD;
}
}
mPascalTriangleDepth = depth;
}
// xのN桁目の数値を得る
static ull getNDigitNumber(ull x, ull n) {
return (x / pow(10ull, n - 1ull)) % 10;
}
// xのN桁目の数値を得る
static int getNDigitNumber(int x, int n) {
assert(n <= 10);
return (x / pow(10, n - 1)) % 10;
}
// xのN乗を求める O(n)
static ull pow(ull x, ull n) {
if (x == 0ull) {
if (n == 0ull) {
return 1ull;
}
else {
return 0ull;
}
}
ull result = 1ull;
for (ull i = 0ull; i < n; ++i) {
result *= x;
result %= MOD;
}
return result;
}
// xのN乗を求める O(n)
static int pow(int x, int n) {
assert(x >= 0);
assert(n >= 0);
if (x == 0) {
if (n == 0) {
return 1;
}
else {
return 0;
}
}
int result = 1;
for (int i = 0; i < n; ++i) {
result *= x;
result %= MOD;
}
return result;
}
private:
static int mPascalTriangleDepth;
static vector<vector<ull>> mPascalTriangle;
};
int vmath_mod::mPascalTriangleDepth = 0;
vector<vector<ull>> vmath_mod::mPascalTriangle;
class vegde {
public:
vegde() : vegde(-1) {
}
vegde(int cost) :
mCost(cost) {
}
int getCost() const { return mCost; }
private:
int mCost;
};
class vnode {
public:
int v = 0;
vnode() : vnode(-1) {
}
vnode(int id) :
mID(id) {
}
void addEgde(const vegde& egde, const vnode* node) {
mEgdeList.emplace_back(egde, node);
}
void removeEgde(int nodeID) {
auto itrNewEnd = std::remove_if(mEgdeList.begin(), mEgdeList.end(), [=](const pair<vegde, const vnode*>& p)->bool {
return (p.second->getID() == nodeID);
});
mEgdeList.erase(itrNewEnd, mEgdeList.end());
}
int getID() const { return mID; }
const list<pair<vegde, const vnode*>>& getEgde() const { return mEgdeList; }
private:
list<pair<vegde, const vnode*>> mEgdeList;
int mID;
};
// グラフ
class vgraph {
public:
void outputResult() const {
for (vnode node : mNodes) {
cout << node.v << endl;
}
}
const int INF = 1000000;
vgraph(int nodeNum) {
mNodeNum = nodeNum;
mNodes.resize(nodeNum);
for (int i = 0; i < nodeNum; ++i) {
mNodes[i] = move(vnode(i));
}
mMinimumDists.resize(mNodeNum);
mPrevNodes.resize(mNodeNum);
}
void addEgde(int nodeID1, int nodeID2) {
addEgde(nodeID1, nodeID2, 1);
}
virtual void addEgde(int nodeID1, int nodeID2, int cost) = 0;
virtual void removeEgde(int nodeID1, int nodeID2) = 0;
// ダイクストラ法を使ってある頂点から全ての頂点への最短距離を求める
// 負のコストの辺があると最短距離を計算できない点に注意する
// O(E*logV)
void dijkstraSearch(int start) {
// Minimum distances for each nodes
vector<int>& dpMinDists = mMinimumDists;
fill(dpMinDists, INF);
// Result of the previous visited node
vector<int>& resultPrev = mPrevNodes;
fill(resultPrev, -1);
// Create a priority_queue for search.
typedef pair<int, int> P; // key: その頂点までの最短距離, value: 頂点の番号
priority_queue<P, vector<P>, greater<P>> pq_node;
// Mark the current node as visited and enqueue it
pq_node.push(P(0, start));
dpMinDists[start] = 0;
while (!pq_node.empty()) {
P p = pq_node.top();
pq_node.pop();
int nowDist = p.first;
int nowNodeID = p.second;
if (dpMinDists[nowNodeID] < nowDist) {
continue;
}
for (const pair<vegde, const vnode*>& egde : mNodes[nowNodeID].getEgde()) {
const vnode* nextNode = egde.second;
int nextNodeID = nextNode->getID();
int nextNodeDist = nowDist + egde.first.getCost();
if (nextNodeDist < dpMinDists[nextNodeID]) {
dpMinDists[nextNodeID] = nextNodeDist;
resultPrev[nextNodeID] = nowNodeID;
pq_node.push(P(nextNodeDist, nextNodeID));
}
}
}
}
int getNodeNum() const { return mNodeNum; }
const vector<vnode>& getNodes() const { return mNodes; }
const vector<int>& getMinimumDists() const { return mMinimumDists; }
const vector<int>& getPrevNodes() const { return mPrevNodes; }
protected:
int mNodeNum;
vector<vnode> mNodes;
vector<int> mMinimumDists;
vector<int> mPrevNodes;
};
// 無向グラフ UnDirected Val Graph.
class udvgraph : public vgraph {
public:
vector<bool> check;
void doAction(int v, int d, int c) {
fill(check, false);
doActionSub(v, d, c);
}
void doActionSub(int v, int d, int c) {
mNodes[v].v = c;
check[v] = true;
if (d == 0) {
return;
}
for (const pair<vegde, const vnode*>& egde : mNodes[v].getEgde()) {
if (check[egde.second->getID()) {
continue;
}
doActionSub(egde.second->getID(), d - 1, c);
}
}
udvgraph(int nodeNum) :
vgraph(nodeNum) {
}
void addEgde(int nodeID1, int nodeID2, int cost) {
mNodes[nodeID1].addEgde(move(vegde(cost)), &mNodes[nodeID2]);
mNodes[nodeID2].addEgde(move(vegde(cost)), &mNodes[nodeID1]);
}
void removeEgde(int nodeID1, int nodeID2) {
mNodes[nodeID1].removeEgde(nodeID2);
mNodes[nodeID2].removeEgde(nodeID1);
}
};
//class vegde {
//public:
// vegde() :
// mLeft(nullptr),
// mRight(nullptr) {
// }
// vegde(sptr<vnode> left, sptr<vnode> right) :
// vegde() {
// mLeft = left;
// mRight = right;
// }
// vegde(sptr<vnode> left, sptr<vnode> right, int cost) :
// vegde(left, right) {
// mCost = cost;
// }
// sptr<vnode> getOpponent(sptr<vnode> node) const {
// assert(node == mLeft || node == mRight);
// return (node == mLeft) ? mRight : (node == mRight) ? mLeft : nullptr;
// }
// void set(sptr<vnode> left, sptr<vnode> right) { mLeft = left; mRight = right; }
// const sptr<vnode>& getLeft() const { return mLeft; }
// const sptr<vnode>& getRight() const { return mRight; }
// int getCost() const { return mCost; }
//private:
// sptr<vnode> mLeft;
// sptr<vnode> mRight;
// int mCost;
//};
//class vnode {
//public:
// int v = 0;
// vnode() :
// mID(-1) {
// }
// vnode(int id) :
// vnode() {
// mID = id;
// }
// void addEgde(sptr<vegde> egde) {
// mEgdeList.push_back(egde);
// }
// void removeEgde(int nodeID1, int nodeID2) {
// auto itrNewEnd = std::remove_if(mEgdeList.begin(), mEgdeList.end(), [=](sptr<vegde> e)->bool {
// return (e->getLeft()->getID() == nodeID1 && e->getRight()->getID() == nodeID2);
// });
// mEgdeList.erase(itrNewEnd, mEgdeList.end());
// }
// int getID() const { return mID; }
// const list<sptr<vegde>>& getEgde() const { return mEgdeList; }
//private:
// list<sptr<vegde>> mEgdeList;
// int mID;
//};
class AdjacencyMatrix {
public:
AdjacencyMatrix() {
}
AdjacencyMatrix(int nodeNum) {
resize(mConnectionMap, nodeNum, nodeNum);
resize(mCostMap, nodeNum, nodeNum);
resize(mMinimumDistMap, nodeNum, nodeNum);
resize(mPrevNodeMap, nodeNum, nodeNum);
}
void addEgde(int nodeID1, int nodeID2, int cost) {
mConnectionMap[nodeID1][nodeID2] = true;
mConnectionMap[nodeID2][nodeID1] = true;
mCostMap[nodeID1][nodeID2] = cost;
mCostMap[nodeID2][nodeID1] = cost;
}
void removeEgde(int nodeID1, int nodeID2) {
mConnectionMap[nodeID1][nodeID2] = false;
mConnectionMap[nodeID2][nodeID1] = false;
mCostMap[nodeID1][nodeID2] = 0;
mCostMap[nodeID2][nodeID1] = 0;
}
void warshallFloyd(int nodeNum) {
for (int k = 0; k < nodeNum; ++k) {
for (int i = 0; i < nodeNum; ++i) {
for (int j = 0; j < nodeNum; ++j) {
if (mConnectionMap[i][j]) {
mMinimumDistMap[i][j] = mCostMap[i][j];
}
else {
mMinimumDistMap[i][j] = 99999999;
}
}
}
}
for (int k = 0; k < nodeNum; ++k) {
for (int i = 0; i < nodeNum; ++i) {
for (int j = 0; j < nodeNum; ++j) {
mMinimumDistMap[i][j] = min(mMinimumDistMap[i][j], mMinimumDistMap[i][k] + mMinimumDistMap[k][j]);
}
}
}
//for (int i = 0; i < mNodeNum; ++i) {
// for (int j = 0; j < mNodeNum; ++j) {
// cerr << mMinimumDistMap[i][j] << ", ";
// }
// cerr << endl;
//}
}
const vector<vector<bool>>& getConnectionMap() const { return mConnectionMap; }
const vector<vector<int>>& getCostMap() const { return mCostMap; }
const vector<vector<int>>& getMinimumDistMap() const { return mMinimumDistMap; }
const vector<vector<int>>& getPrevNodeMap() const { return mPrevNodeMap; }
private:
vector<vector<bool>> mConnectionMap;
vector<vector<int>> mCostMap;
vector<vector<int>> mMinimumDistMap;
vector<vector<int>> mPrevNodeMap;
};
//// グラフ
//class vgraph {
//public:
// void outputResult() const {
// for (sptr<vnode> node : mNodes) {
// cout << node->v << endl;
// }
// }
// const int INF = 1000000;
// vgraph(int nodeNum) {
// mNodeNum = nodeNum;
// mNodes.resize(nodeNum);
// for (int i = 0; i < nodeNum; ++i) {
// mNodes[i] = make_shared<vnode>(i);
// }
// mMinimumDists.resize(mNodeNum);
// mPrevNodes.resize(mNodeNum);
// }
// void addEgde(int nodeID1, int nodeID2) {
// addEgde(nodeID1, nodeID2, 1);
// }
// virtual void addEgde(int nodeID1, int nodeID2, int cost) = 0;
// virtual void removeEgde(int nodeID1, int nodeID2) = 0;
// // ベルマンフォード法を使ってある頂点から全ての頂点への最短距離を求める
// // startからたどり着ける場所に負のループが存在する場合はfalseを返す
// // ダイクストラ法と違い、負のコストの辺があっても最短距離を計算できる
// // O(V*E)
// bool bellmanFord(int start) {
// vector<int>& dist = mMinimumDists;
// fill(dist, INF);
// dist[start] = 0;
// for (int i = 0; i < mNodeNum; ++i) {
// bool update = false;
// for (sptr<vnode> node : mNodes) {
// for (sptr<vegde> egde : node->getEgde()) {
// int from = egde->getLeft()->getID();
// int to = egde->getRight()->getID();
// if (dist[from] == INF) {
// continue;
// }
// if (dist[node->getID()] + egde->getCost() < dist[to]) {
// dist[to] = dist[node->getID()] + egde->getCost();
// update = true;
// if (i == mNodeNum - 1) {
// //return false;
// }
// }
// }
// }
// if (!update) {
// break;
// }
// }
// return true;
// }
// // ダイクストラ法を使ってある頂点から全ての頂点への最短距離を求める
// // 負のコストの辺があると最短距離を計算できない点に注意する
// // O(E*logV)
// void dijkstraSearch(int start) {
// // Minimum distances for each nodes
// vector<int>& dpMinDists = mMinimumDists;
// fill(dpMinDists, INF);
// // Result of the previous visited node
// vector<int>& resultPrev = mPrevNodes;
// fill(resultPrev, -1);
// // Create a priority_queue for search.
// typedef pair<int, int> P; // key: その頂点までの最短距離, value: 頂点の番号
// priority_queue<P, vector<P>, greater<P>> pq_node;
// // Mark the current node as visited and enqueue it
// pq_node.push(P(0, start));
// dpMinDists[start] = 0;
// while (!pq_node.empty()) {
// P p = pq_node.top();
// pq_node.pop();
// int nowDist = p.first;
// int nowNodeID = p.second;
// if (dpMinDists[nowNodeID] < nowDist) {
// continue;
// }
// for (sptr<vegde> egde : mNodes[nowNodeID]->getEgde()) {
// sptr<vnode> nextNode = egde->getRight();
// int nextNodeID = nextNode->getID();
// int nextNodeDist = nowDist + egde->getCost();
// if (nextNodeDist < dpMinDists[nextNodeID]) {
// dpMinDists[nextNodeID] = nextNodeDist;
// resultPrev[nextNodeID] = nowNodeID;
// pq_node.push(P(nextNodeDist, nextNodeID));
// }
// }
// }
// }
// int calcMaxDepth() const {
// pair<int, int> farestNodeData = getFarestNodeID(0);
// pair<int, int> farestNodeData2 = getFarestNodeID(farestNodeData.first);
// return farestNodeData2.second;
// }
// int getNodeNum() const { return mNodeNum; }
// vector<sptr<vnode>> getNode() {
// return mNodes;
// }
// const vector<int>& getMinimumDists() const { return mMinimumDists; }
// const vector<int>& getPrevNodes() const { return mPrevNodes; }
//protected:
// // 引数で受け取ったノードから最も遠いノードのidと距離を返す
// // グラフにループがあると無限ループになるので注意する(つまり木専用)
// pair<int, int> getFarestNodeID(int start) const {
// queue<pair<int, int>> q; // nodeID, このノードまでの距離
// q.push(make_pair(start, 0));
// pair<int, int> finalNodeData;
// vector<bool> opened(mNodeNum);
// fill(opened, false);
// while (!q.empty()) {
// pair<int, int> nodeData = q.front();
// int nodeID = nodeData.first;
// int dist = nodeData.second;
// if (dist > finalNodeData.second) {
// finalNodeData.second = dist;
// finalNodeData.first = nodeID;
// }
// q.pop();
// for (sptr<vegde> egde : mNodes[nodeID]->getEgde()) {
// int id = egde->getRight()->getID();
// if (opened[id]) {
// continue;
// }
// opened[id] = true;
// q.push(make_pair(id, dist + egde->getCost()));
// }
// }
// return finalNodeData;
// }
// int mNodeNum;
// bool mUseMaps;
// vector<sptr<vnode>> mNodes;
// vector<int> mMinimumDists;
// vector<int> mPrevNodes;
//};
//// 無向グラフ UnDirected Val Graph.
//class udvgraph : public vgraph {
//public:
//
// udvgraph(int nodeNum) :
// vgraph(nodeNum) {
// }
// void addEgde(int nodeID1, int nodeID2, int cost) {
// mNodes[nodeID1]->addEgde(make_shared<vegde>(mNodes[nodeID1], mNodes[nodeID2], cost));
// mNodes[nodeID2]->addEgde(make_shared<vegde>(mNodes[nodeID2], mNodes[nodeID1], cost));
// }
// void removeEgde(int nodeID1, int nodeID2) {
// mNodes[nodeID1]->removeEgde(nodeID1, nodeID2);
// mNodes[nodeID2]->removeEgde(nodeID2, nodeID1);
// }
//};
// 隣接行列付きの無向グラフ。ワーシャルフロイドが使える。 UnDirected Val Graph Matrix
class udvgraph_m : public udvgraph {
public:
udvgraph_m(int nodeNum) :
udvgraph(nodeNum) {
mAdjacencyMatrix = AdjacencyMatrix(nodeNum);
}
void addEgde(int nodeID1, int nodeID2, int cost) {
udvgraph::addEgde(nodeID1, nodeID2, cost);
mAdjacencyMatrix.addEgde(nodeID1, nodeID2, cost);
}
void removeEgde(int nodeID1, int nodeID2) {
udvgraph::removeEgde(nodeID1, nodeID2);
mAdjacencyMatrix.removeEgde(nodeID1, nodeID2);
}
void warshallFloyd() {
mAdjacencyMatrix.warshallFloyd(mNodeNum);
}
const vector<vector<bool>>& getConnectionMap() const { return mAdjacencyMatrix.getConnectionMap(); }
const vector<vector<int>>& getCostMap() const { return mAdjacencyMatrix.getCostMap(); }
const vector<vector<int>>& getMinimumDistMap() const { return mAdjacencyMatrix.getMinimumDistMap(); }
const vector<vector<int>>& getPrevNodeMap() const { return mAdjacencyMatrix.getPrevNodeMap(); }
private:
AdjacencyMatrix mAdjacencyMatrix;
};
//// 有向グラフ Directed Val Graph.
//class dvgraph : public vgraph {
//public:
// dvgraph(int nodeNum) :
// vgraph(nodeNum) {
// }
// void addEgde(int nodeID1, int nodeID2, int cost) {
// mNodes[nodeID1]->addEgde(make_shared<vegde>(mNodes[nodeID1], mNodes[nodeID2], cost));
// }
// void removeEgde(int nodeID1, int nodeID2) {
// mNodes[nodeID1]->removeEgde(nodeID1, nodeID2);
// }
// // 入力のないノードのリストを返す
// list<int> searchStartNodes() const {
// list<int> startNodes;
// unordered_map<int, int> nodesInputs; // key:ノード番号, value:インプット数
// for (auto node : mNodes) {
// for (auto edge : node->getEgde()) {
// ++nodesInputs[edge->getRight()->getID()];
// }
// }
// for (int i = 0; i < mNodeNum; ++i) {
// if (nodesInputs.find(i) == nodesInputs.end()) {
// startNodes.push_back(i);
// }
// }
// return move(startNodes);
// }
//};
//// 隣接行列付きの有向グラフ。ワーシャルフロイドが使える。 Directed Val Graph Matrix
//class dvgraph_m : public dvgraph {
//public:
// dvgraph_m(int nodeNum) :
// dvgraph(nodeNum) {
// mAdjacencyMatrix = AdjacencyMatrix(nodeNum);
// }
// void addEgde(int nodeID1, int nodeID2, int cost) {
// dvgraph::addEgde(nodeID1, nodeID2, cost);
// mAdjacencyMatrix.addEgde(nodeID1, nodeID2, cost);
// }
// void removeEgde(int nodeID1, int nodeID2) {
// dvgraph::removeEgde(nodeID1, nodeID2);
// mAdjacencyMatrix.removeEgde(nodeID1, nodeID2);
// }
// void warshallFloyd() {
// mAdjacencyMatrix.warshallFloyd(mNodeNum);
// }
// const vector<vector<bool>>& getConnectionMap() const { return mAdjacencyMatrix.getConnectionMap(); }
// const vector<vector<int>>& getCostMap() const { return mAdjacencyMatrix.getCostMap(); }
// const vector<vector<int>>& getMinimumDistMap() const { return mAdjacencyMatrix.getMinimumDistMap(); }
// const vector<vector<int>>& getPrevNodeMap() const { return mAdjacencyMatrix.getPrevNodeMap(); }
//private:
// AdjacencyMatrix mAdjacencyMatrix;
//};
class Timer {
public:
Timer(const Timer&) = delete;
Timer& operator=(const Timer&) = delete;
Timer(Timer&&) = delete;
Timer& operator=(Timer&&) = delete;
static Timer& getInstance() {
static Timer timer;
return timer;
}
void setSize(int size) { mTimes.resize(size); mStopWatches.resize(size); }
void startTimer(int index) { mStopWatches[index] = chrono::system_clock::now(); }
void stopTimer(int index) { mTimes[index] += chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now() - mStopWatches[index]).count(); }
void addTime(int index, long long millisec) { mTimes[index] += millisec; }
void resetTimes() { fill(mTimes, 0LL); }
void resetTime(int index) { mTimes[index] = 0LL; }
long long getTime(int index) { return mTimes[index]; }
void outputTimes() { outputTimes(0, mTimes.size()); }
void outputTimes(int startIndex, int endIndex) {
for (int i = startIndex; i <= endIndex; ++i) {
cerr << "Time[" << i << "]: " << mTimes[i] << endl;
}
}
private:
Timer() {
mTimes.resize(100);
mStopWatches.resize(100);
resetTimes();
}
~Timer() = default;
vector<long long> mTimes;
vector<chrono::system_clock::time_point> mStopWatches;
};
// 立っているビットの数を返す
static int bitcount8(unsigned char b8) {
// 8 bits 限定アルゴリズムを利用している
//c_assert( 8 == (CHAR_BIT * sizeof( b8 )) );
b8 = (unsigned char)(((b8 & 0xAA) >> 1) + (b8 & 0x55));
b8 = (unsigned char)(((b8 & 0xCC) >> 2) + (b8 & 0x33));
b8 = (unsigned char)(((b8 & 0xF0) >> 4) + (b8 & 0x0F));
return b8;
}
// 立っているビットの数を返す
static int bitcount16(unsigned short w16) {
// 16 bits 限定アルゴリズムを利用している
//c_assert( 16 == (CHAR_BIT * sizeof( w16 )) );
w16 = (unsigned short)(((w16 & 0xAAAA) >> 1) + (w16 & 0x5555));
w16 = (unsigned short)(((w16 & 0xCCCC) >> 2) + (w16 & 0x3333));
w16 = (unsigned short)(((w16 & 0xF0F0) >> 4) + (w16 & 0x0F0F));
w16 = (unsigned short)(((w16 & 0xFF00) >> 8) + (w16 & 0x00FF));
return w16;
}
// 立っているビットの数を返す
static int bitcount32(unsigned long dw32) {
// 32 bits 限定アルゴリズムを利用している
//c_assert( 32 == (CHAR_BIT * sizeof( dw32 )) );
dw32 = ((dw32 & 0xAAAAAAAA) >> 1) + (dw32 & 0x55555555);
dw32 = ((dw32 & 0xCCCCCCCC) >> 2) + (dw32 & 0x33333333);
dw32 = ((dw32 & 0xF0F0F0F0) >> 4) + (dw32 & 0x0F0F0F0F);
dw32 = ((dw32 & 0xFF00FF00) >> 8) + (dw32 & 0x00FF00FF);
dw32 = ((dw32 & 0xFFFF0000) >> 16) + (dw32 & 0x0000FFFF);
return dw32;
}
// 条件を満たす最小の要素のindexを返す
// 存在しない場合は-1を返す
// 使い方の例: int result = binarySearch<int>(A, 0, N - 1, [=](int x) { return x >= K; });
template<typename T> int binarySearch(vector<T> vec, int beginIndex, int endIndex, function<bool(T)> confilm) {
// 解が両端にある場合や解なしの判定のために、両端の１つ外側から始める
int lb = beginIndex - 1; // lower bound
int ub = endIndex + 1; // upper bound
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (confilm(vec[mid])) {
ub = mid;
}
else {
lb = mid;
}
}
if (ub == endIndex + 1) {
// 解なし
return -1;
}
return ub;
}
}
using namespace ValLib;
//int main()
//{
// int N = 0;
// cin >> N;
// vector<ull> data(3 * N);
//
// for (int i = 0; i < N; ++i) {
// for (int j = 0; j < 3; ++j) {
// cin >> data[i * 3 + j];
// }
// }
//
// sort(data.begin(), data.end());
//
// ull ret = 0;
// for (int i = N * 3 - 2; i >= 0; i -= 2) {
// if (i < N) {
// break;
// }
// ret += data[i];
// }
//
// cout << ret << endl;
//}
int main()
{
int N, M;
cin >> N >> M;
udvgraph graph(N);
graph.check.resize(N);
fill(graph.check, false);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
graph.addEgde(a - 1, b - 1, 1);
}
int Q;
cin >> Q;
for (int i = 0; i < Q; ++i) {
int v, d, c;
cin >> v >> d >> c;
graph.doAction(v - 1, d, c);
}
graph.outputResult();
return 0;
}
| a.cc: In member function 'void ValLib::udvgraph::doActionSub(int, int, int)':
a.cc:656:63: error: expected ']' before ')' token
656 | if (check[egde.second->getID()) {
| ^
|
s951606608 | p03768 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589
#define izryt bool
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
pii Dir[8] = { //移動
{ 0 ,1 },{ -1 ,0 },{ 1 ,0 },{ 0 ,-1 },
{ 1 ,1 },{ 1 ,-1 },{ -1 ,1 },{ -1 ,-1 }
};
class Graph {
public:
int vn;
int sumcost = 0;
vector<vector<pii>> g;
Graph(int n) {
vn = n;
g.resize(n);
}
virtual void con(int a, int b, int w) = 0;
int getWeight(int f, int t) {
auto itr = lower_bound(ALL(g[f]), make_pair(t, INT_MIN));
if (itr != g[f].end())
return itr->second;
return INT_MIN;
}
int Costsum() {
return sumcost;
}
};
class BiDGraph : public Graph {//無向
public:
BiDGraph(int n) : Graph(n) {}
void con(int a, int b, int w = 1) {
g[a].push_back({ b,w });
g[b].push_back({ a, w });
sumcost++;
}
};
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) { }
bool unionSet(int x, int y) { //ｘの入ってる集合と yの入ってる集合を併合
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
bool findSet(int x, int y) { //xとyが同じ集合に入っているかどうかを判定
return root(x) == root(y);
}
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
bool isroot(int x) {
return data[x] < 0;
}
int size(int x) {
return -data[root(x)];
}
};
signed main() {
int n, m;
scnaf("%d %d", &n, &m);
BiDGraph g(n);
REP(i, m) {
int a, b;
scanf("%d %d", &a, &b);
g.con(--a, --b);
}
vector<pii> col(n, {0,-1});
vector<int> mosq(n);
int q;
scanf("%d", &q);
vector<pair<pii, int>> que(q);
vector<vector<int>> mat(n);
REP(i, q) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
que[i] = { {--a,b}, c };
}
reverse(ALL(que));
vector<int> al(n);
function<void(int,int,int,int)> dfs = [&](int cp, int dis, int c, int qn) {
if (col[cp].second >= dis) return;
if (col[cp].first) {
for(auto itr : mat[mosq[cp]])
dfs(itr, dis - col[cp].second-1 , c,qn);
mosq[cp] = qn;
return;
}
col[cp] = { c,dis };
if (dis) {
for (auto itr : g.g[cp])
dfs(itr.first, dis - 1, c,qn);
}
else {
for (auto itr : g.g[cp])
mat[qn].push_aback(itr.first);
}
};
REP (i,q) {
dfs(que[i].first.first, que[i].first.second, que[i].second, i);
}
REP(i, n) {
printf("%d\n", col[i]);
}
return 0;
} | a.cc: In lambda function:
a.cc:150:41: error: '__gnu_cxx::__alloc_traits<std::allocator<std::vector<int> >, std::vector<int> >::value_type' {aka 'class std::vector<int>'} has no member named 'push_aback'; did you mean 'push_back'?
150 | mat[qn].push_aback(itr.first);
| ^~~~~~~~~~
| push_back
|
s898080504 | p03768 | Java | import java.util.Scanner;
public class B {
static Scanner scan = new Scanner(System.in);
static int N = scan.nextInt();
static int M = scan.nextInt();
static int dp[][]=new int[N][N];
static int count;
static int color[]=new int[N];
public static void paint(int v,int c){
if(count<0){return;}
for(int j=0;j<N;j++){
if(dp[v][j]==1){
count--;
paint(j,c);
count++;
color[j]=c;
}
}
}
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
int a[] = new int[M];
int b[] = new int[M];
for(int i =0;i<M;i++){
a[i]=scan.nextInt()-1;
b[i]=scan.nextInt()-1;
dp[a[i]][b[i]]=1;
dp[b[i]][a[i]]=1;
//a_i,b_iは0 ~ N-1
//二つがつながっていたらdp=1
}
int Q = scan.nextInt();
int v[] = new int[Q];
int d[] = new int[Q];
int c[] = new int[Q];
for(int i =0;i<Q;i++){
v[i]=scan.nextInt() - 1;
d[i]=scan.nextInt();
c[i]=scan.nextInt();
}
//ここから塗りつぶし動作
for(int i =0;i<Q;i++){
count = d[i];
paint(v[i],c[i]);
}
for(int i=0;i<N;i++){
System.out.println(color[i]);
}
}
}
| Main.java:3: error: class B is public, should be declared in a file named B.java
public class B {
^
1 error
|
s954163252 | p03768 | C++ | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
#define ll long long
bool grid[2001][2001] = {};
int main()
{
int N, M, Q;
int v[2001], d[2001], c[2001], color[2001];
cin >> N >> M;
REP(i, 1, M+1) {
int x, y;
cin >> x >> y;
grid[x][y] = grid[y][x] = true;
}
cin >> Q;
REP(i, 1, Q+1) cin >> v[i] >> d[i] >> c[i];
memset(color, 0, sizeof color);
REP(i, 1, Q+1) {
bool hist[2001] = {};
queue<int> qu;
qu.push(v[i]);
hist[v[i]] = true;
color[v[i]] = c[i];
while (!qu.empty() && d[i] > 0) {
int q = qu.front();
qu.pop();
int flag = false;
REP(j, 1, N+1) {
if (grid[q][j] && !hist[j]) {
qu.push(j);
hist[j] = true;
color[j] = c[i];
flag = true;
}
}
if(flag) d[i]--;
}
}
REP(i, 1, N+1) cout << color[i] << endl;
return 0;
} | a.cc: In function 'int main()':
a.cc:23:9: error: 'memset' was not declared in this scope
23 | memset(color, 0, sizeof color);
| ^~~~~~
a.cc:5:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
4 | #include<queue>
+++ |+#include <cstring>
5 | using namespace std;
|
s522904203 | p03768 | C++ | #include<stdio.h>
#include<vector>
#include<queue>
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#define rep(i,n)for(int i=0;i<(n);i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
/*
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
*/
void reader(int *x) { int k, m = 0; *x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { *x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; *x = (*x) * 10 + k - '0'; }if (m)(*x) = -(*x); }
void reader(int *x, int *y) { reader(x); reader(y); }
void reader(int *x, int *y, int *z) { reader(x); reader(y); reader(z); }
void writer(int x, char c) { int i, sz = 0, m = 0; char buf[10]; if (x<0)m = 1, x = -x; while (x)buf[sz++] = x % 10, x /= 10; if (!sz)buf[sz++] = 0; if (m)mypc('-'); while (sz--)mypc(buf[sz] + '0'); mypc(c); }
vector<int>E[100000];
int d1[100000];
int c1[100000], c2[100000];
int que[100000];
int k[100000][12], t[100000][12];
signed main() {
int n, m; reader(&n, &m);
rep(i, m) {
int a, b; reader(&a, &b); a--; b--;
E[a].push_back(b); E[b].push_back(a);
}
memset(c2, -1, sizeof(c2));
int q; reader(&q);
memset(k, -1, sizeof(k));
rep(i, q) {
int v, d, c; reader(&v, &d, &c); v--;
k[v][d] = i; t[v][d] = c;
}
rep(i, n) {
for (int j = 9; j >= 0; j--) {
if (k[i][j] < k[i][j + 1]) {
k[i][j] = k[i][j + 1];
t[i][j] = t[i][j + 1];
}
}
int s = 0, g = 0;
if (c2[i] < k[i][0]) {
c1[i] = t[i][0]; c2[i] = k[i][0];
}
memset(d1, -1, sizeof(d1));
d1[i] = 0;
if (k[i][1] != -1)que[g++] = i;
while (s != g) {
int p = que[s++];
int siz = E[p].size();
rep(j, siz) {
int u = E[p][j];
if (d1[u] == -1) {
d1[u] = d1[p] + 1;
if (k[i][d1[u]] > c2[u]) {
c1[u] = t[i][d1[u]]; c2[u] = k[i][d1[u]];
}
if (k[i][d1[u] + 1] != -1)que[g++] = u;
}
}
}
}
rep(i, n)writer(c1[i], '\n');
} | a.cc: In function 'void reader(int*)':
a.cc:18:56: error: 'mygc' was not declared in this scope
18 | void reader(int *x) { int k, m = 0; *x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { *x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; *x = (*x) * 10 + k - '0'; }if (m)(*x) = -(*x); }
| ^~~~
a.cc:18:157: error: 'mygc' was not declared in this scope
18 | void reader(int *x) { int k, m = 0; *x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { *x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; *x = (*x) * 10 + k - '0'; }if (m)(*x) = -(*x); }
| ^~~~
a.cc: In function 'void writer(int, char)':
a.cc:21:156: error: 'mypc' was not declared in this scope
21 | void writer(int x, char c) { int i, sz = 0, m = 0; char buf[10]; if (x<0)m = 1, x = -x; while (x)buf[sz++] = x % 10, x /= 10; if (!sz)buf[sz++] = 0; if (m)mypc('-'); while (sz--)mypc(buf[sz] + '0'); mypc(c); }
| ^~~~
a.cc:21:179: error: 'mypc' was not declared in this scope
21 | void writer(int x, char c) { int i, sz = 0, m = 0; char buf[10]; if (x<0)m = 1, x = -x; while (x)buf[sz++] = x % 10, x /= 10; if (!sz)buf[sz++] = 0; if (m)mypc('-'); while (sz--)mypc(buf[sz] + '0'); mypc(c); }
| ^~~~
a.cc:21:200: error: 'mypc' was not declared in this scope
21 | void writer(int x, char c) { int i, sz = 0, m = 0; char buf[10]; if (x<0)m = 1, x = -x; while (x)buf[sz++] = x % 10, x /= 10; if (!sz)buf[sz++] = 0; if (m)mypc('-'); while (sz--)mypc(buf[sz] + '0'); mypc(c); }
| ^~~~
a.cc: In function 'int main()':
a.cc:34:9: error: 'memset' was not declared in this scope
34 | memset(c2, -1, sizeof(c2));
| ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
3 | #include<queue>
+++ |+#include <cstring>
4 | #define getchar_unlocked getchar
|
s503851325 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
#define Y second
#define FOR(x,e,b) (int e = head[x], b = vb[e]; e; e = nxt[e], b = vb[e])
#define N 200010
int n,m,q;
pii ans[N][11];
int M = 0, head[N], vb[N], nxt[N], vc[N];
void ins(int a,int b)
{
nxt[++ M] = head[a];
head[a] = M;
vb[M]=b;
}
void insert(int a,int b)
{
ins(a, b);
ins(b, a);
}
inline int read()
{
int x = 0, f = 1; char ch = getchar();
while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
int main()
{
n = read();
m = read();
for(int i = 1; i <= m; i ++)
{
int a, b;
a = read();
b = read();
insert(a, b);
}
q = read();
for(int i = 1; i <= q; i ++)
{
int v, d, c;
v = read();
d = read();
c = read();
ans[v][d] = max(ans[v][d], mp(i, c));
}
for(int i = 10; i >= 1; i --)
for(int j = 1; j <= n; j ++)
{
ans[j][i - 1] = max(ans[j][i - 1], ans[j][i]);
FOR(j, e, b)
ans[b][i - 1] = max(ans[b][i - 1], ans[j][i]);
}
for(int j = 1; j <= n; j ++)
printf("%d\n",ans[j][0].Y);
return 0;
} | a.cc: In function 'int main()':
a.cc:7:21: error: expected primary-expression before 'int'
7 | #define FOR(x,e,b) (int e = head[x], b = vb[e]; e; e = nxt[e], b = vb[e])
| ^~~
a.cc:57:25: note: in expansion of macro 'FOR'
57 | FOR(j, e, b)
| ^~~
a.cc:7:21: error: expected ')' before 'int'
7 | #define FOR(x,e,b) (int e = head[x], b = vb[e]; e; e = nxt[e], b = vb[e])
| ~^~~
a.cc:57:25: note: in expansion of macro 'FOR'
57 | FOR(j, e, b)
| ^~~
a.cc:57:32: error: 'e' was not declared in this scope
57 | FOR(j, e, b)
| ^
a.cc:7:49: note: in definition of macro 'FOR'
7 | #define FOR(x,e,b) (int e = head[x], b = vb[e]; e; e = nxt[e], b = vb[e])
| ^
a.cc:57:35: error: 'b' was not declared in this scope
57 | FOR(j, e, b)
| ^
a.cc:7:64: note: in definition of macro 'FOR'
7 | #define FOR(x,e,b) (int e = head[x], b = vb[e]; e; e = nxt[e], b = vb[e])
| ^
|
s430084409 | p03768 | C++ | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
#define Y second
#define esb(x,e,b) (int e = head[x], b = vb[e]; e; e = nxt[e], b = vb[e])
#define N 200010
int n,m,q;
pii ans[N][11];
int M = 0, head[N], vb[N], nxt[N], vc[N];
void ins(int a,int b)
{
nxt[++ M] = head[a];
head[a] = M;
vb[M]=b;
}
void insert(int a,int b)
{
ins(a, b);
ins(b, a);
}
inline int read()
{
int x = 0, f = 1; char ch = getchar();
while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
int main()
{
n = read();
m = read();
for(int i = 1; i <= m; i ++)
{
int a, b;
a = read();
b = read();
insert(a, b);
}
q = read();
for(int i = 1; i <= q; i ++)
{
int v, d, c;
v = read();
d = read();
c = read();
ans[v][d] = max(ans[v][d], mp(i, c));
}
for(int i = 10; i >= 1; i --)
for(int j = 1; j <= n; j ++)
{
ans[j][i - 1] = max(ans[j][i - 1], ans[j][i]);
FOR(j, e, b)
ans[b][i - 1] = max(ans[b][i - 1], ans[j][i]);
}
for(int j = 1; j <= n; j ++)
printf("%d\n",ans[j][0].Y);
return 0;
} | a.cc: In function 'int main()':
a.cc:57:32: error: 'e' was not declared in this scope
57 | FOR(j, e, b)
| ^
a.cc:57:35: error: 'b' was not declared in this scope
57 | FOR(j, e, b)
| ^
a.cc:57:25: error: 'FOR' was not declared in this scope
57 | FOR(j, e, b)
| ^~~
|
s523947310 | p03768 | C++ | #include <iostream>
#include <queue>
#include <vector>
#include <cstdio>
using namespace std;
vector<int> adj[2001];
int v[2001];
int d[2001];
int c[2001];
int check[2001];
int ans[2001];
void bfs(int i,int limit,int color){
memset(check,-1,sizeof(check));
check[i]=0;
ans[i]=color;
queue<int> q;
q.push(i);
while(!q.empty()){
int x = q.front();
q.pop();
for(int i=0;i<adj[x].size();i++){
int next = adj[x][i];
if(check[next]== -1 && check[x] + 1 <= limit){
check[next] = check[x]+1;
q.push(next);
ans[next] = color;
}
}
}
}
int main(int argc, const char * argv[]) {
int n,m;
scanf("%d %d",&n,&m);
if(n>=2001 || m>=2001) return 0;
for(int i=0,x,y;i<m;i++){
scanf("%d %d",&x,&y);
adj[x].push_back(y);
adj[y].push_back(x);
}
int q;
scanf("%d",&q);
if(q>=2001) return 0;
for(int i=0;i<q;i++){
scanf("%d %d %d",&v[i],&d[i],&c[i]);
}
for(int i=0;i<q;i++){
bfs(v[i],d[i],c[i]);
}
for(int i=1;i<=n;i++){
printf("%d\n",ans[i]);
}
return 0;
}
| a.cc: In function 'void bfs(int, int, int)':
a.cc:14:5: error: 'memset' was not declared in this scope
14 | memset(check,-1,sizeof(check));
| ^~~~~~
a.cc:5:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
4 | #include <cstdio>
+++ |+#include <cstring>
5 | using namespace std;
|
s992555507 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
struct edge {int to, cost; };
typedef pair<int, int> P;
int N, M;
vector<edge> G[100000];
int d[100000];
int INF = 99999999;
int color[100000];
void dijkstra(int s, int dd, int c){
priority_queue<P, vector<P>, greater<P> > que;
fill(d, d+N, INF);
d[s] = 0;
que.push(P(0, s));
while(!que.empty()){
P p = que.top();que.pop();
int v = p.second;
if(d[v] < p.first) continue;
FOR(i, 0, G[v].size()){
edge e = G[v][i];
if(d[e.to] > d[v] + e.cost){
d[e.to] = d[v] + e.cost;
if(d[e.to]<=dd) color[e.to] = c;
que.push(P(d[e.to], e.to));
}
}
}
}
int main(){
cin>>N>>M;
FOR(i, 0, M){
int a, b;
cin>>a>>b;
a--;b--;
edge in;
in.to = b;in.cost=1;
G[a].push_back(in);
in.to = a;in.cost=1;
G[b].push_back(in);
}
int Q;
cin>>Q;
FOR(i, 0, N) color[i] = 0;
FOR(i, 0, Q){
int v, dd, c;
cin>>v>>dd>>c;
v--;
dijkstra(v);
//FOR(j, 0, N){
// if(d[j]<=dd) color[j] = c;
//}
}
FOR(i, 0, N){
cout << color[i] << endl;
}
} | a.cc: In function 'int main()':
a.cc:67:17: error: too few arguments to function 'void dijkstra(int, int, int)'
67 | dijkstra(v);
| ~~~~~~~~^~~
a.cc:28:6: note: declared here
28 | void dijkstra(int s, int dd, int c){
| ^~~~~~~~
|
s816429131 | p03768 | Java | import java.util.Scanner;
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main
{
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
public InputReader(InputStream stream)
{
this.stream = stream;
}
public int read()
{
if (numChars==-1)
throw new InputMismatchException();
if (curChar >= numChars)
{
curChar = 0;
try
{
numChars = stream.read(buf);
}
catch (IOException e)
{
throw new InputMismatchException();
}
if(numChars <= 0)
return -1;
}
return buf[curChar++];
}
public String nextLine()
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
public int nextInt()
{
int c = read();
while(isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
int res = 0;
do
{
if(c<'0'||c>'9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public long nextLong()
{
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
long res = 0;
do
{
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public double nextDouble()
{
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.')
{
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
if (c == '.')
{
c = read();
double m = 1;
while (!isSpaceChar(c))
{
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public String readString()
{
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do
{
res.appendCodePoint(c);
c = read();
}
while (!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c)
{
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next()
{
return readString();
}
public interface SpaceCharFilter
{
public boolean isSpaceChar(int ch);
}
}
static LinkedList <Integer> adj[];
static int co=0,f=0;
public Check2(int n){
adj=new LinkedList[n+1];
for(int i=0;i<=n;i++){
adj[i]=new LinkedList();
}
}
static void add(int i,int j){
adj[i].add(j);
adj[j].add(i);
}
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
//Scanner in=new Scanner(System.in);
InputReader in=new InputReader(System.in);
PrintWriter w=new PrintWriter(System.out);
int n=in.nextInt();
Check2 g=new Check2(n);
int m=in.nextInt();
for(int i=0;i<m;i++){
int c=in.nextInt();
int d=in.nextInt();
g.add(c,d);
}
// w.println(n);
int q=in.nextInt();
int ans[]=new int[n+1];
for(int y=0;y<q;y++){
int v[]=new int[n+1];
int s=in.nextInt();
int d=in.nextInt();
int col=in.nextInt();
ans[s]=col;
Queue <node> f=new LinkedList();
node de=new node(s,0);
f.add(de);
int lvl=0;
while(!f.isEmpty()){
node gl=f.poll();
Iterator <Integer> it=adj[gl.df].iterator();
lvl=gl.lvl+1;
if(lvl>d){
break;
}
while(it.hasNext()){
int ne=it.next();
if(v[ne]==0){
node fg=new node(ne,lvl);
f.add(fg);
ans[ne]=col;
// w.println(ne+" "+y+" "+gl);
}
}
}
/* for(int i=1;i<=n;i++){
w.println(ans[i]);
}
w.println("-----");
*/
}
for(int i=1;i<=n;i++){
w.println(ans[i]);
}
w.close();
}
static class node{
int df;
int lvl;
node(int x,int y){
df=x;
lvl=y;
}
}
} | Main.java:189: error: invalid method declaration; return type required
public Check2(int n){
^
1 error
|
s673271664 | p03768 | Java | import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class A{
static final Scanner s =new Scanner(System.in);
static int n, m, q;
static boolean checked[];
static Node nodes[];
public static void main(String args[]){
n=s.nextInt();
m=s.nextInt();
checked=new boolean[n];
nodes=new Node[n];
for(int i=0; i<n; i++)
nodes[i]=new Node(i);
int bufa, bufb;
for(int i=0; i<m; i++){
bufa=s.nextInt()-1;
bufb=s.nextInt()-1;
nodes[bufa].edge.add(nodes[bufb]);
nodes[bufb].edge.add(nodes[bufa]);
}
q=s.nextInt();
if(n>3000||m>3000||q>3000)// judge reject
return;
int v,d,c;
for(int i=0;i<q;i++) {
v=s.nextInt()-1;
d=s.nextInt();
c=s.nextInt();
function(nodes[v],d,c);
}
Arrays.stream(nodes).forEach(n->System.out.println(n.color));
}
static ArrayDeque<Node> deque=new ArrayDeque<>();
static Node buf;
static void function(Node n,int maxDepth,int color) {
deque.clear();
Arrays.fill(checked,false);
int curDepth=0;
checked[n.no]=true;
n.color=color;
deque.add(n);
while(curDepth<=maxDepth&&!deque.isEmpty()) {
curDepth++;
for(int i=deque.size();i>0;i--) {
n=deque.poll();
n.color=color;
for(int j=0;j<n.edge.size();j++) {
buf=n.edge.get(j);
if(!checked[buf.no]) {
checked[buf.no]=true;
deque.add(buf);
}
}
}
}
}
}
class Node{
int no, color=0;
ArrayList<Node> edge=new ArrayList<>();
Node(int no){
this.no=no;
}
}
| Main.java:6: error: class A is public, should be declared in a file named A.java
public class A{
^
1 error
|
s007101505 | p03768 | Java | import java.util.Scanner;
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Check2
{
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
public InputReader(InputStream stream)
{
this.stream = stream;
}
public int read()
{
if (numChars==-1)
throw new InputMismatchException();
if (curChar >= numChars)
{
curChar = 0;
try
{
numChars = stream.read(buf);
}
catch (IOException e)
{
throw new InputMismatchException();
}
if(numChars <= 0)
return -1;
}
return buf[curChar++];
}
public String nextLine()
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
public int nextInt()
{
int c = read();
while(isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
int res = 0;
do
{
if(c<'0'||c>'9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public long nextLong()
{
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
long res = 0;
do
{
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public double nextDouble()
{
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-')
{
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.')
{
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
if (c == '.')
{
c = read();
double m = 1;
while (!isSpaceChar(c))
{
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public String readString()
{
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do
{
res.appendCodePoint(c);
c = read();
}
while (!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c)
{
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next()
{
return readString();
}
public interface SpaceCharFilter
{
public boolean isSpaceChar(int ch);
}
}
static LinkedList <Integer> adj[];
static int co=0,f=0;
public Check2(int n){
adj=new LinkedList[n+1];
for(int i=0;i<=n;i++){
adj[i]=new LinkedList();
}
}
static void add(int i,int j){
adj[i].add(j);
adj[j].add(i);
}
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
//Scanner in=new Scanner(System.in);
InputReader in=new InputReader(System.in);
PrintWriter w=new PrintWriter(System.out);
int n=in.nextInt();
Check2 g=new Check2(n);
int m=in.nextInt();
for(int i=0;i<m;i++){
int c=in.nextInt();
int d=in.nextInt();
g.add(c,d);
}
// w.println(n);
int q=in.nextInt();
int ans[]=new int[n+1];
for(int y=0;y<q;y++){
int v[]=new int[n+1];
int s=in.nextInt();
int d=in.nextInt();
int col=in.nextInt();
ans[s]=col;
Queue <node> f=new LinkedList();
node de=new node(s,0);
f.add(de);
int lvl=0;
while(!f.isEmpty()){
node gl=f.poll();
Iterator <Integer> it=adj[gl.df].iterator();
lvl=gl.lvl+1;
if(lvl>d){
break;
}
while(it.hasNext()){
int ne=it.next();
if(v[ne]==0){
node fg=new node(ne,lvl);
f.add(fg);
ans[ne]=col;
// w.println(ne+" "+y+" "+gl);
}
}
}
/* for(int i=1;i<=n;i++){
w.println(ans[i]);
}
w.println("-----");
*/
}
for(int i=1;i<=n;i++){
w.println(ans[i]);
}
w.close();
}
static class node{
int df;
int lvl;
node(int x,int y){
df=x;
lvl=y;
}
}
} | Main.java:8: error: class Check2 is public, should be declared in a file named Check2.java
public class Check2
^
Note: Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
1 error
|
s005358744 | p03768 | C++ | #include<vector>
using namespace std;
int n, m, q;
vector<vector<int>> vertex;
vector<int> color;
void paint(int v, int d, int c) {
color[v] = c;
if (d <= 0 || vertex[v].size() <= 0)
return;
else {
for (int i = 0; i < vertex[v].size(); i++) {
paint(vertex[v][i], d-1, c);
}
}
}
int main() {
cin >> n >> m;
vertex.resize(n+1);
color.resize(n+1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
vertex[a].push_back(b);
vertex[b].push_back(a);
}
cin >> q;
for (int i = 0; i < q; i++) {
int v, d, c;
cin >> v >> d >> c;
paint(v, d, c);
}
for (int i = 1; i <= n; i++)
cout << color[i] << endl;
}
| a.cc: In function 'int main()':
a.cc:20:9: error: 'cin' was not declared in this scope
20 | cin >> n >> m;
| ^~~
a.cc:2:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
1 | #include<vector>
+++ |+#include <iostream>
2 | using namespace std;
a.cc:40:17: error: 'cout' was not declared in this scope
40 | cout << color[i] << endl;
| ^~~~
a.cc:40:17: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:40:37: error: 'endl' was not declared in this scope
40 | cout << color[i] << endl;
| ^~~~
a.cc:2:1: note: 'std::endl' is defined in header '<ostream>'; this is probably fixable by adding '#include <ostream>'
1 | #include<vector>
+++ |+#include <ostream>
2 | using namespace std;
|
s559269997 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(int i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c, int N) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, N) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c, N);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c, N);
}
}
}
int main() {
int N, M;
cin >> N >> M;
REP(i, M) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c, N);
}
REP(i, N) {
cout << color[i] << endl;
}
return 0;
} | /tmp/cccSZ7lX.o: in function `ika(int, int, int, int)':
a.cc:(.text+0x27): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cccSZ7lX.o
/tmp/cccSZ7lX.o: in function `main':
a.cc:(.text+0x257): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cccSZ7lX.o
collect2: error: ld returned 1 exit status
|
s975329939 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(int i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int N, M;
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, N) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c);
}
}
}
int main() {
cin >> N >> M;
REP(i, M) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c);
}
REP(i, N) {
cout << color[i] << endl;
}
return 0;
} | /tmp/ccuas3tN.o: in function `ika(int, int, int)':
a.cc:(.text+0x24): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccuas3tN.o
/tmp/ccuas3tN.o: in function `main':
a.cc:(.text+0x259): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccuas3tN.o
collect2: error: ld returned 1 exit status
|
s353180170 | p03768 | C++ | //部分点が狙えるかも、また、枝刈りで通ればいいなあ
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define pb push_back
typedef pair<int, int> Pi;
#define fi first
#define se second
vector < int > G[100005];
int color[100005] = {0};
int power[100005] = {0};
int N, M;
void bfs(int sv, int sd, int c) {
queue < Pi > que;
if(!color[sv]) {
color[sv] = c;
power[sv] = sd;
}
que.push(Pi(sv, sd));
if(d == 0) return;
while(!que.empty()) {
int v = que.front().fi, d = que.front().se; que.pop();
Rep(i, G[v].size()) {
int u = G[v][i];
if(!color[u]) color[u] = c, power[u] = d - 1;
else if(d - 1 <= power[u]) continue;
if(d > 1) {
que.push(Pi(u, d - 1));
}
}
}
return;
}
signed main()
{
int A, B;
int Q;
int v[100005], d[100005], c[100005];
cin >> N >> M;
while(M--) {
cin >> A >> B; --A, --B;
G[A].pb(B); G[B].pb(A);
}
cin >> Q;
//reverseしながら読み込む
Rep(i, Q) cin >> v[Q - i - 1] >> d[Q - i - 1] >> c[Q - i - 1];
Rep(i, Q) {
v[i]--;
bfs(v[i], d[i], c[i]);
}
Rep(i, N) {
cout << color[i] << endl;
}
return 0;
}
| a.cc: In function 'void bfs(long long int, long long int, long long int)':
a.cc:28:6: error: 'd' was not declared in this scope; did you mean 'sd'?
28 | if(d == 0) return;
| ^
| sd
|
s767787340 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(int i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int n;
int m;
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c);
int main() {
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c);
}
REP(i, n) {
cout << color[i] << endl;
}
return 0;
}
void ika(int v, int d, int c) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, n) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c);
}
}
} | /tmp/cchebQLz.o: in function `main':
a.cc:(.text+0x16f): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cchebQLz.o
/tmp/cchebQLz.o: in function `ika(int, int, int)':
a.cc:(.text+0x1d3): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cchebQLz.o
collect2: error: ld returned 1 exit status
|
s353764108 | p03768 | C++ | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
void wf(int n,int d[n][n]){
int i,j,k;
for(i=0;i<n;i++){//中点
for(j=0;j<n;j++){//始点
for(k=0;k<n;k++){//終点
//printf("%d->%d->%d\n",j,i,k);
if(d[j][k]>d[j][i]+d[i][k]){
//printf("get shorter! %d->%d\n",d[j][k],d[j][i]+d[i][k]);
d[j][k]=d[j][i]+d[i][k];
}
}
}
}
return;
}
int main(){
int n,m,i,j,k;
scanf("%d%d",&n,&m);
int matrix[n][n];
for(i=0;i<n;i++){
for(j=0;j<n;j++){
matrix[i][j]=1000000;
}
matrix[i][i]=0;
}
int a,b;
for(i=0;i<m;i++){
scanf("%d%d",&a,&b);
a--;
b--;
matrix[a][b]=1;
matrix[b][a]=1;
}
/* for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("%12d ",d[i][j]);
}puts("");
}puts(""); */
wf(n,matrix);
/* for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("%12d ",d[i][j]);
}puts("");
} */
int color[n];
memset(color,0,sizeof(int)*n);
int q,v,d,c;
scanf("%d",&q);
for(i=0;i<q;i++){
scanf("%d%d%d",&v,&d,&c);
v--;
for(j=0;j<n;j++){
if(matrix[v][j]<=d){
color[j]=c;
}
}
}
for(i=0;i<n;i++){
printf("%d\n",color[i]);
}
return 0;
}
| a.cc:9:22: error: use of parameter outside function body before ']' token
9 | void wf(int n,int d[n][n]){
| ^
a.cc:9:25: error: use of parameter outside function body before ']' token
9 | void wf(int n,int d[n][n]){
| ^
a.cc: In function 'void wf(...)':
a.cc:11:19: error: 'n' was not declared in this scope
11 | for(i=0;i<n;i++){//中点
| ^
a.cc:15:36: error: 'd' was not declared in this scope
15 | if(d[j][k]>d[j][i]+d[i][k]){
| ^
|
s452091536 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(int i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int n, m;
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c);
int main() {
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c);
}
REP(i, n) {
cout << color[i] << endl;
}
return 0;
}
void ika(int v, int d, int c) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, n) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c);
}
}
} | /tmp/ccQZUl65.o: in function `main':
a.cc:(.text+0x16f): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQZUl65.o
/tmp/ccQZUl65.o: in function `ika(int, int, int)':
a.cc:(.text+0x1d3): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccQZUl65.o
collect2: error: ld returned 1 exit status
|
s763568742 | p03768 | C++ | // acdart
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <string>
#include <queue>
#include <vector>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <cstdlib>
#include <list>
#include <limits.h>
#include <utility>
#include <functional>
#include <deque>
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define X first
#define Y second
#define F first
#define S second
#define MOD9 1000000009ll
#define MOD7 1000000007ll
#define MOD
#define INF 1023456789ll
#define INF16 10000000000000000ll
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define SZ(x) ((int)(x).size())
#define MAXN 10010
#define MAXM
#define ALL(x) ((x).begin()),((x).end())
#define RESET(a,b) memset(a,b, sizeof a)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define LEN(X) strlen(X)
#define FI(a,b,c) for(int a=b; a<c; a++)
#define FD(a,b,c) for(int a=b; a>c; a--)
using namespace std;
typedef long long ll;
typedef long long LL;
typedef double db;
typedef double D;
typedef long double ld;
typedef long double LD;
/*********default*********/
#define maxn 100010
#define maxm 200010
#define inf 0x3f3f3f3f
struct Edge {
int to, next, val;
} edge[maxm];
int tot, n;
int head[maxn];
int vis[maxn];
int cnt[maxn];
int d[maxn][maxn];
int col[maxn];
void init() {
tot = 0;
memset(head, -1, sizeof head);
}
void add(int u, int v) {
edge[tot].to = v;
edge[tot].val = 1;
edge[tot].next = head[u];
head[u] = tot++;
}
bool spfa(int s) {
queue<int> q;
memset(d[s], 0x3f, sizeof d[s]);
memset(vis, 0, sizeof vis);
memset(cnt, 0, sizeof cnt);
q.push(s);
d[s][s] = 0;
cnt[s] = vis[s] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = 0;
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].to;
int w = edge[i].val;
if (d[s][u] + w < d[s][v]) {
d[s][v] = d[s][u] + w;
if (!vis[v]) {
vis[v] = 1;
if (++cnt[v] > n) {
return false;
}
q.push(v);
}
}
}
}
return true;
}
int main()
{
int x, y, z, q, m;
init();
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
scanf("%d", &q);
for (int i = 1; i <= n; i++) {
spfa(i);
}
while (q--) {
scanf("%d%d%d", &x, &y, &z);
for (int i = 1; i <= n; i++) {
if (d[x][i] <= y) {
col[i] = z;
}
}
}
for (int i = 1; i <= n; i++) {
printf("%d\n", col[i]);
}
} | /tmp/ccRmaETt.o: in function `main':
a.cc:(.text+0x5a7): relocation truncated to fit: R_X86_64_PC32 against symbol `col' defined in .bss section in /tmp/ccRmaETt.o
a.cc:(.text+0x5ec): relocation truncated to fit: R_X86_64_PC32 against symbol `col' defined in .bss section in /tmp/ccRmaETt.o
collect2: error: ld returned 1 exit status
|
s495893305 | p03768 | C | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(int i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int n, m;
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c);
int main() {
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c);
}
REP(i, n) {
cout << color[i] << endl;
}
return 0;
}
void ika(int v, int d, int c) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, n) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c);
}
}
} | main.c:1:10: fatal error: algorithm: No such file or directory
1 | #include <algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s467870825 | p03768 | Java | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class A{
static final Scanner s =new Scanner(System.in);
static int n, m, q;
static boolean checked[];
static Node nodes[];
public static void main(String args[]){
n=s.nextInt();
m=s.nextInt();
if(n>2000||m>2000||q>2000)// judge reject
return;
checked=new boolean[n];
nodes=new Node[n];
for(int i=0; i<n; i++)
nodes[i]=new Node(i);
int bufa, bufb;
for(int i=0; i<m; i++){
bufa=s.nextInt()-1;
bufb=s.nextInt()-1;
nodes[bufa].edge.add(nodes[bufb]);
nodes[bufb].edge.add(nodes[bufa]);
}
q=s.nextInt();
int v,d,c;
for(int i=0;i<q;i++) {
v=s.nextInt()-1;
d=s.nextInt();
c=s.nextInt();
Arrays.fill(checked,false);
checked[v]=true;
function(nodes[v],0,d,c);
}
Arrays.stream(nodes).forEach(n->System.out.println(n.color));
}
static Node buf;
static void function(Node n,int curDepth,int maxDepth,int color) {
n.color=color;
if(curDepth==maxDepth)
return;
for(int i=0;i<n.edge.size();i++) {
buf=n.edge.get(i);
if(!checked[buf.no]) {
checked[buf.no]=true;
function(buf,curDepth+1,maxDepth,color);
}
}
}
}
class Node{
int no, color=0;
ArrayList<Node> edge=new ArrayList<>();
Node(int no){
this.no=no;
}
}
| Main.java:5: error: class A is public, should be declared in a file named A.java
public class A{
^
1 error
|
s421714874 | p03768 | C | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(int i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int n, m;
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, n) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c);
}
}
}
int main() {
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c);
}
REP(i, n) {
cout << color[i] << endl;
}
return 0;
} | main.c:1:10: fatal error: algorithm: No such file or directory
1 | #include <algorithm>
| ^~~~~~~~~~~
compilation terminated.
|
s377636877 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(int i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int n, m;
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, n) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c);
}
}
}
int main() {
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c);
}
REP(i, n) {
cout << color[i] << endl;
}
return 0;
} | /tmp/cc2eUc2J.o: in function `ika(int, int, int)':
a.cc:(.text+0x24): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc2eUc2J.o
/tmp/cc2eUc2J.o: in function `main':
a.cc:(.text+0x259): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/cc2eUc2J.o
collect2: error: ld returned 1 exit status
|
s278427818 | p03768 | C++ | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair
#define MAX_N 100001
int n, m;
int ab[MAX_N][MAX_N];
int color[MAX_N];
void ika(int v, int d, int c) {
color[v-1] = c;
if (d == 0) {
return;
}
REP(i, n) {
if (ab[v-1][i] == 1) {
ika(i+1, d-1, c);
}
if (ab[i][v-1] == 1) {
ika(i+1, d-1, c);
}
}
}
int main() {
cin >> n >> m;
REP(i, m) {
int a, b;
cin >> a >> b;
ab[a-1][b-1] = 1;
ab[b-1][a-1] = 1;
}
// REP(i, n) {
// REP(j, n) {
// cout << ab[i][j] << ' ';
// }
// cout << endl;
// }
int q;
cin >> q;
REP(i, q) {
int v, d, c;
cin >> v >> d >> c;
ika(v, d, c);
}
REP(i, n) {
cout << color[i] << endl;
}
return 0;
} | /tmp/ccXzUMl0.o: in function `ika(int, int, int)':
a.cc:(.text+0x24): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccXzUMl0.o
/tmp/ccXzUMl0.o: in function `main':
a.cc:(.text+0x26a): relocation truncated to fit: R_X86_64_PC32 against symbol `color' defined in .bss section in /tmp/ccXzUMl0.o
collect2: error: ld returned 1 exit status
|
s927458331 | p03768 | C++ | #include<vector>
#include<iostream>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
typedef std::vector<std::set<int>> graph_t;
void splatter(graph_t const& graph, std::vector<std::int64_t>& color,int now, int target, int dist, std::int64_t flag, int& rest)
{
if (dist == -1)
{
return;
}
if (color[now] == -1)
{
color[now] = flag | target;
--rest;
}
else if ((color[now] & flag) == flag)
{
return;
}
color[now] = color[now] % (1 << 17) | flag;
for (auto v : graph[now])
{
splatter(graph, color, v, target, dist - 1, flag, rest);
}
}
int main()
{
int N, M;
std::cin >> N >> M;
graph_t graph(N);
for (int i{}; i < M; ++i)
{
int a, b;
std::cin >> a >> b;
--a;
--b;
graph[a].emplace(b);
graph[b].emplace(a);
}
int Q;
std::cin >> Q;
std::vector<std::int64_t> color(N, -1);
int rest = N;
struct data_t
{
int vertex;
int dist;
int color;
};
std::vector<data_t> query(Q);
for (int i{}; i < Q; ++i)
{
auto& q = query[i];
std::cin >> q.vertex >> q.dist >> q.color;
--q.vertex;
}
for (int j = 1; j <= Q; ++j)
{
int i = Q - j;
auto const& q = query[i];
splatter(graph, color, q.vertex, q.color, q.dist, j << 17, rest);
if (rest == 0)
{
break;
}
}
for (auto c : color)
{
std::cout << std::max(c % (1 << 17), 0ll) << std::endl;
}
} | a.cc:10:54: error: 'int64_t' is not a member of 'std'; did you mean 'int64_t'?
10 | void splatter(graph_t const& graph, std::vector<std::int64_t>& color,int now, int target, int dist, std::int64_t flag, int& rest)
| ^~~~~~~
In file included from /usr/include/x86_64-linux-gnu/sys/types.h:155,
from /usr/include/stdlib.h:514,
from /usr/include/c++/14/cstdlib:79,
from /usr/include/c++/14/ext/string_conversions.h:43,
from /usr/include/c++/14/bits/basic_string.h:4154,
from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:2:
/usr/include/x86_64-linux-gnu/bits/stdint-intn.h:27:19: note: 'int64_t' declared here
27 | typedef __int64_t int64_t;
| ^~~~~~~
a.cc:10:61: error: template argument 1 is invalid
10 | void splatter(graph_t const& graph, std::vector<std::int64_t>& color,int now, int target, int dist, std::int64_t flag, int& rest)
| ^
a.cc:10:61: error: template argument 2 is invalid
a.cc:10:101: error: 'std::int64_t' has not been declared
10 | void splatter(graph_t const& graph, std::vector<std::int64_t>& color,int now, int target, int dist, std::int64_t flag, int& rest)
| ^~~
a.cc: In function 'void splatter(const graph_t&, int&, int, int, int, int, int&)':
a.cc:16:18: error: invalid types 'int[int]' for array subscript
16 | if (color[now] == -1)
| ^
a.cc:18:22: error: invalid types 'int[int]' for array subscript
18 | color[now] = flag | target;
| ^
a.cc:21:24: error: invalid types 'int[int]' for array subscript
21 | else if ((color[now] & flag) == flag)
| ^
a.cc:25:14: error: invalid types 'int[int]' for array subscript
25 | color[now] = color[now] % (1 << 17) | flag;
| ^
a.cc:25:27: error: invalid types 'int[int]' for array subscript
25 | color[now] = color[now] % (1 << 17) | flag;
| ^
a.cc: In function 'int main()':
a.cc:48:26: error: 'int64_t' is not a member of 'std'; did you mean 'int64_t'?
48 | std::vector<std::int64_t> color(N, -1);
| ^~~~~~~
/usr/include/x86_64-linux-gnu/bits/stdint-intn.h:27:19: note: 'int64_t' declared here
27 | typedef __int64_t int64_t;
| ^~~~~~~
a.cc:48:33: error: template argument 1 is invalid
48 | std::vector<std::int64_t> color(N, -1);
| ^
a.cc:48:33: error: template argument 2 is invalid
a.cc:48:46: error: expression list treated as compound expression in initializer [-fpermissive]
48 | std::vector<std::int64_t> color(N, -1);
| ^
a.cc:73:23: error: 'begin' was not declared in this scope; did you mean 'std::begin'?
73 | for (auto c : color)
| ^~~~~
| std::begin
In file included from /usr/include/c++/14/vector:69,
from a.cc:1:
/usr/include/c++/14/bits/range_access.h:114:37: note: 'std::begin' declared here
114 | template<typename _Tp> const _Tp* begin(const valarray<_Tp>&) noexcept;
| ^~~~~
a.cc:73:23: error: 'end' was not declared in this scope; did you mean 'std::end'?
73 | for (auto c : color)
| ^~~~~
| std::end
/usr/include/c++/14/bits/range_access.h:116:37: note: 'std::end' declared here
116 | template<typename _Tp> const _Tp* end(const valarray<_Tp>&) noexcept;
| ^~~
|
s748072015 | p03768 | C++ | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<=n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define MOD 1000000007
#define MAX 1000000001
#define INF 1410065408
#define EPS 1e-9
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{int from, to; ll cost;};
vector<ll> es[1000000];
vector<ll> color(1000000, 0);
void dfs(ll v, ll d, ll c, ll depth, vector<bool> use){
color[v] = c;
use[v] = true;
if(d == depth) return;
for(ll to : es[v]){
if(!use[to]) dfs(to, d, c, depth+1);
}
}
signed main(){
ll N, M, Q;
cin >> N >> M;
rep(M){
ll tmp1, tmp2;
cin >> tmp1 >> tmp2;
es[tmp1].push_back(tmp2);
es[tmp2].push_back(tmp1);
}
cin >> Q;
rep(Q){
ll v, d, c;
cin >> v >> d >> c;
dfs(v, d, c, 0, vector<bool>(N+1, false));
}
rep(N){
cout << color[i+1] << endl;
}
}
| a.cc: In function 'void dfs(ll, ll, ll, ll, std::vector<bool>)':
a.cc:36:33: error: too few arguments to function 'void dfs(ll, ll, ll, ll, std::vector<bool>)'
36 | if(!use[to]) dfs(to, d, c, depth+1);
| ~~~^~~~~~~~~~~~~~~~~~~
a.cc:31:6: note: declared here
31 | void dfs(ll v, ll d, ll c, ll depth, vector<bool> use){
| ^~~
|
s861953592 | p03768 | C++ | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<cstring>
using namespace std;
#define maxn 1001000
#define llg int
#define yyj(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);
llg n,m,c[maxn],Q;
vector<llg>a[maxn];
struct node
{
llg po,dis,col;
}ask[maxn];
inline int getint()
{
int w=0,q=0; char c=getchar();
while((c<'0' || c>'9') && c!='-') c=getchar(); if(c=='-') q=1,c=getchar();
while (c>='0' && c<='9') w=w*10+c-'0', c=getchar(); return q ? -w : w;
}
void init()
{
cin>>n>>m;
for (llg i=1;i<=m;i++)
{
llg x=getint(),y=getint();
a[x].push_back(y),a[y].push_back(x);
}
cin>>Q;
for (llg i=1;i<=Q;i++) ask[i].po=getint(),ask[i].dis=getint(),ask[i].col=getint();
}
void dfs(llg x,llg dis,llg col)
{
// if (c[x]) return ;
c[x]=col;
if (dis==0) return ;
llg w=a[x].size();
for (llg i=0;i<w;i++)
{
llg v=a[x][i];
dfs(v,dis-1,col);
}
}
int main()
{
// yyj("B");
init();
for (llg i=1;i<=Q;i++) dfs(ask[i].po,ask[i].dis,ask[i].col);
for (llg i=1;i<=n;i++) printf("%d\n",c[i]);y
return 0;
}
| a.cc: In function 'int main()':
a.cc:58:52: error: 'y' was not declared in this scope; did you mean 'yn'?
58 | for (llg i=1;i<=n;i++) printf("%d\n",c[i]);y
| ^
| yn
|
s764988534 | p03768 | C++ | #include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<algorithm>
#include<queue>
using namespace std;
int ans[100000];
vector<int>rinsetu[100000];
int mincost[100000];
signed main() {
int a, b;
cin >> a >> b;
if (a > 2000 || b > 2000)return 0;
for (int c = 0; c < b; c++) {
int d, e; scanf("%d%d", &d, &e); d--; e--;
rinsetu[d].push_back(e);
rinsetu[e].push_back(d);
}
int c; cin >> c;
if (c > 2000)return 0;
for (int d = 0; d < c; d++) {
int e, f, g; scanf("%d%d%d", &e, &f, &g);
e--;
memset(mincost, -1, sizeof(mincost));
mincost[e] = 0;
queue<int>Q;
Q.push(e);
while (Q.size()) {
int i = Q.front(); Q.pop();
if (mincost[i] <= f)ans[i] = g;
for (int j : rinsetu[i]) {
if (mincost[j] == -1) {
mincost[j] = mincost[i] + 1;
Q.push(j);
}
}
}
}
for (int i = 0; i < a; i++) {
printf("%d\n", ans[i]);
}
} | a.cc: In function 'int main()':
a.cc:27:17: error: 'memset' was not declared in this scope
27 | memset(mincost, -1, sizeof(mincost));
| ^~~~~~
a.cc:8:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
7 | #include<queue>
+++ |+#include <cstring>
8 | using namespace std;
|
s503516963 | p03768 | C++ | #include<stdio.h>
#include<vector>
using namespace std;
#define ran 111111
int n,q;
vector<int> e[ran];
int vert[ran],query_dis[ran],query_col[ran];
int col[ran];
int dis[ran];
int que[ran],op,cl;
int inq[ran],T;
int main(){
int m;
scanf("%d%d",&n,&m);
while(m--){
int x,y;
scanf("%d%d",&x,&y);
e[x].push_back(y);
e[y].push_back(x);
}
scanf("%d",&q);
for(int i=0; i<q; i++)
scanf("%d%d%d",&vert[i],&query_dis[i],&query_col[i]);
memset(dis,-1,sizeof(dis));
while(q--){
int V = vert[q], D = query_dis[q], C = query_col[q];
if(dis[V] >= D)continue;
++T;
op=cl=0;
que[op++] = V;
if(dis[V] == -1)
col[V] = C;
dis[V] = D;
inq[V] = T;
while(cl<op){
V = que[cl++];
D = dis[V];
if(D == 0)continue;
--D;
for(vector<int>::iterator it = e[V].begin(); it!=e[V].end(); it++){
int y = *it;
if(inq[y] == T)continue;
if(dis[y] >= D)continue;
if(dis[y] == -1)
col[y] = C;
dis[y] = D;
inq[y] = T;
que[op++] = y;
}
}
}
for(int i=1; i<=n; i++)
printf("%d\n",col[i]);
return 0;
} | a.cc: In function 'int main()':
a.cc:26:9: error: 'memset' was not declared in this scope
26 | memset(dis,-1,sizeof(dis));
| ^~~~~~
a.cc:3:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
2 | #include<vector>
+++ |+#include <cstring>
3 | using namespace std;
|
s397990021 | p03769 | C++ | #include <cstdio>
#include <vector>
int main() {
long long n;
scanf("%lld", &n);
int all = 100;
std::vector <int> p, q;
while(n > 1) {
if(n & 1) {
p.push_back(all--);
n--;
}
else {
q.push_back(all--);
n >>= 1;
}
}
int sz = p.size() + q.size();
printf("%d\n", sz + 100);
for(int x: p)
printf("%d ", x);
std::reverse(q.begin(), q.end());
for(int x: q)
printf("%d ", x);
for(int i = 1; i <= 100; i++)
printf("%d ", i);
return 0;
} | a.cc: In function 'int main()':
a.cc:24:14: error: 'reverse' is not a member of 'std'
24 | std::reverse(q.begin(), q.end());
| ^~~~~~~
|
s477274283 | p03769 | C++ | #include <cstdio>
#include <vector>
int main() {
long long n;
scanf("%lld", &n);
int all = 100;
std::vector <int> p, q;
while(n > 1) {
if(n & 1) {
p.push_back(all--);
n--;
}
else {
q.push_back(all--);
n >>= 1;
}
}
int sz = p.size() + q.size();
printf("%d\n", sz + 100);
for(int x: p)
printf("%d ", x);
reverse(q.begin(), q.end());
for(int x: q)
printf("%d ", x);
for(int i = 1; i <= 100; i++)
printf("%d ", i);
return 0;
} | a.cc: In function 'int main()':
a.cc:24:9: error: 'reverse' was not declared in this scope
24 | reverse(q.begin(), q.end());
| ^~~~~~~
|
s218762034 | p03769 | C++ | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
out << "[";
fori (i, a.size())
out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
int sget(string s) {
int n = s.size();
int ans = 0;
fori (mask, 1 << n) {
string cur = "";
fori (i, n) {
if ((mask >> i) & 1) {
cur += s[i];
}
}
if (cur.size() & 1)
continue;
if (cur.size() == 0)
continue;
int h = SZ(cur) / 2;
ans += cur.substr(0, h) == cur.substr(h, h);
}
return ans;
}
const ll oo = 1e18 + 10;
ll sum(ll a, ll b) {
if (a >= oo)
return oo;
a += b;
return min(oo, a);
}
void insum(ll & a, ll b) {
a = sum(a, b);
}
ll comm(string s, string t) {
int n = s.size(), m = t.size();
vvl dp(n + 2, vl(m + 2, 0));
dp[0][0] = 1;
fori (i, n + 1) {
fori (j, m + 1) {
insum(dp[i + 1][j], dp[i][j]);
insum(dp[i][j + 1], dp[i][j]);
if (s[i] != t[j]) {
insum(dp[i + 1][j + 1], -dp[i][j]);
}
}
}
return dp[n][m];
}
ll fast_get(string s) {
int n = SZ(s);
ll ret = 0;
fori (l, n) {
for (int r = l + 1; r < n; ++r) {
if (s[l] == s[r]) {
insum(ret, comm(s.substr(0, l), s.substr(l + 1, r - l - 1)));
}
}
}
return ret;
}
string gen(int len, int cnt, int st) {
string s(len, 0);
for (int i = 0; i < len; ++i) {
s[i] = (i % cnt) + st;
}
return s;
}
string solve(ll n) {
int cur = 1;
string s = "";
vector<string> a;
for (int len = 80; len >= 1; len--) {
for (int cnt = 1; cnt <= 30; ++cnt) {
a.push_back(gen(len, cnt, 'A'));
}
}
sort(RALL(a), [&] (const string & s, const string & t) -> bool {
return fast_get(s) < fast_get(t);
});
for (auto s : a) {
cerr << "a[\"" << s << "\"] = " << fast_get(s) << ";" << endl;
}
return s;
}
void init();
map<string, int> a;
void smain() {
init();
ll n;
cin >> n;
string s = solve(n);
vi a(SZ(s));
fori (i, SZ(a)) {
a[i] = s[i];
}
cout << a.size() << '\n';
for (auto x : a) {
cout << x << ' ';
}
}
void init() {
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 1000000000000000000;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 675425858836496043;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 576460752303423487;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 375236588242497801;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 288230376151711743;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 225141952945498680;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 144115188075855871;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 125078862747499266;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 75047317648499559;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 72057594037927935;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 41692954249166421;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 36028797018963967;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 25015772549499852;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 24472470887456708;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 18014398509481983;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 15528076563665244;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 13897651416388806;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 10000136862780487;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 9007199254740991;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 8338590849833283;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 5777166706824387;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 4632550472129601;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 4503599627370495;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 3665681628846337;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 2779530283277760;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 2360712083917680;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 2251799813685247;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 1544183490709866;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 1363804060159152;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1125899906842623;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 1023286908188735;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 926510094425919;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 865350048279888;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 599427592618127;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 562949953421311;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 557288527109759;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 514727830236621;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 387497934832823;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 321950466187771;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 308836698141972;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 281474976710655;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 263352415571281;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 204281435726777;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 175568277047520;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 171575943412206;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 140737488355327;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 131557975478636;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 121128346358783;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 102945566047323;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 102845515571960;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 76002195408060;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 71013476416511;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 70368744177663;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 66484134834180;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 57191981137401;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 48224305372772;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 45956041445375;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 45184131144600;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 35184372088831;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 34315188682440;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 31846478675807;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 31056625195207;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 30122754096399;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 25165103729691;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 22520163121537;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 19063993712466;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 18232349847041;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 17941684555523;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 17645500813639;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 17592186044415;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 15283701522240;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 12481769544192;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 11438396227479;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 11406874172259;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 11384214235681;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 8960320386240;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 8796093022207;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 8020138996255;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 7752371296321;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 7331474697800;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 7267187183776;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 6354664570821;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 5995436138967;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 5798629818240;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 5168247530880;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 4659896003568;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGH"] = 4433822461695;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGA"] = 4410019821697;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 4398046511103;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 4235457185960;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 4018317021212;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 3812798742492;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 3234739314992;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFG"] = 3029160215488;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 3027489309888;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 2841543529536;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 2687448430040;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFG"] = 2510157932927;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 2345556411032;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 2199023255551;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 2118221523606;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGH"] = 1988201635072;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 1957110199392;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 1928463066239;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ"] = 1783822340095;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEF"] = 1743557718464;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 1730726403999;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 1699380773664;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEF"] = 1548325668543;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 1330096633344;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 1270932914163;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFG"] = 1215135739392;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMAB"] = 1164045058060;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 1163382831231;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 1130593014127;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDE"] = 1100756469952;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRST"] = 1099952029695;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1099511627775;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDE"] = 1043452129759;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 999855811675;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHI"] = 962861863423;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 886731088895;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMA"] = 873612853248;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABC"] = 852821221503;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCD"] = 825207292112;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEF"] = 812984337920;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCD"] = 757175266640;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCD"] = 755706683119;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 731657988071;
a["ABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 706073841201;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABC"] = 687622062128;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 677338437343;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKAB"] = 667007759375;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 634420515513;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDE"] = 588737374208;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLM"] = 585133359103;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABC"] = 571148297671;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 552873973680;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGH"] = 552381625087;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSAB"] = 550087163912;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRS"] = 550075629567;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 549755813887;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 519435045695;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 507022122283;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGH"] = 505490491648;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKA"] = 501322221569;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCD"] = 449788680288;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHAB"] = 435637162259;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 434316240399;
a["ABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 423644304720;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 413401253908;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSA"] = 412576382976;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 408569081796;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFG"] = 399084393728;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 358539505089;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABC"] = 351720577440;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJK"] = 345590232064;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGH"] = 345539631872;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFG"] = 342751032575;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 335787024095;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEF"] = 328570599808;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJ"] = 326300824575;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHA"] = 323444261633;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFG"] = 310285049600;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGA"] = 304101652032;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 301480965855;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKL"] = 297596112895;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEF"] = 275483462144;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDE"] = 275435926016;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQ"] = 275334168575;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQR"] = 275137429503;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRS"] = 275077136383;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 274877906943;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIAB"] = 273236352528;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 243329093904;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDE"] = 240899982080;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 236033939252;
a["ABABABABABABABABABABABABABABABABABABABABABABABABA"] = 235357947066;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEF"] = 231432268287;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCD"] = 230708675104;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 228208503745;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGH"] = 222340076544;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 218604942743;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFG"] = 208844542847;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCD"] = 206421360848;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIA"] = 204129122048;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJ"] = 194782028800;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABC"] = 190044723296;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHI"] = 182582238719;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABC"] = 171993071664;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOP"] = 171932385280;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDE"] = 168253344831;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 158380796353;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDE"] = 154390169023;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJK"] = 153827489791;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 152139002496;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLAB"] = 151342526476;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 149766367980;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 142655682864;
a["ABABABABABABABABABABABABABABABABABABABABABABABAB"] = 141214768239;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHI"] = 139509225471;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOP"] = 137863167999;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQ"] = 137665576959;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRAB"] = 137588899848;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQR"] = 137583394815;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 137438953471;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKL"] = 135451021312;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCD"] = 128656186143;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFG"] = 126510450176;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCD"] = 120982929759;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEF"] = 120122226623;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHI"] = 119377927168;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJK"] = 119065686016;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLA"] = 113586407424;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGH"] = 108942323455;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 108427247808;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJ"] = 106707335168;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRA"] = 103196262400;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNO"] = 101034229760;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABC"] = 100615615615;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 96450076807;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHI"] = 96295321600;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABC"] = 96225919047;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 92318977344;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 89120964296;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGH"] = 86822902528;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJ"] = 81716126719;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGH"] = 80457625856;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEF"] = 78595636992;
a["ABABABABABABABABABABABABABABABABABABABABABABABA"] = 78452649021;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJAB"] = 78241009679;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFG"] = 77803495168;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGH"] = 77035410943;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKL"] = 76285997055;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOAB"] = 75791269899;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDE"] = 75761068511;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFG"] = 70289279487;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMN"] = 69501124607;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNO"] = 69117214719;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEF"] = 69002201600;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOP"] = 68925587455;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQ"] = 68836524031;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQR"] = 68809129983;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 68719476735;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMN"] = 65585152000;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 63974934904;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 63130543520;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDE"] = 60305769216;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFG"] = 59176173824;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJA"] = 58645595137;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 57611945196;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOA"] = 57516490753;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 55720054659;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDE"] = 53383365120;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCD"] = 52060134895;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCD"] = 51659669712;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEF"] = 49104491903;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLM"] = 47322497024;
a["ABABABABABABABABABABABABABABABABABABABABABABAB"] = 47071589412;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEF"] = 46415522176;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFG"] = 45798503679;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHI"] = 45324115455;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 45239729040;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABC"] = 43037687856;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 40482191376;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ"] = 40414051328;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNO"] = 40321024000;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJK"] = 39204808703;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 39154389144;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCD"] = 38925063008;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 37981965255;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDE"] = 37767341568;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKL"] = 37384065024;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDE"] = 36641768895;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 35355043585;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLM"] = 35094388735;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMN"] = 34733490175;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNO"] = 34550906879;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOP"] = 34461777919;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQAB"] = 34427240456;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQ"] = 34424619007;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 34359738367;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJK"] = 31473283072;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCD"] = 31102089760;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 30702728895;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEF"] = 29667215103;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABC"] = 29559322016;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCD"] = 28534309215;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 28386133011;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 28102258768;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJ"] = 27509110784;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGH"] = 26739261183;
a["ABABABABABABABABABABABABABABABABABABABABABABA"] = 26150883006;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 26102926095;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQA"] = 25822298112;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABC"] = 25391961184;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHI"] = 24484642816;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMN"] = 23664918528;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHI"] = 22852157952;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 22768774560;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHAB"] = 22604361488;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABC"] = 22601728071;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGH"] = 21913230080;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGA"] = 20878433281;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDE"] = 20843824703;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJ"] = 20664214527;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 20377824148;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKAB"] = 20141371404;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFG"] = 19559948032;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJK"] = 18522161151;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 17999970175;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKL"] = 17868009471;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNAB"] = 17755275275;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLM"] = 17530740735;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMN"] = 17358585855;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEF"] = 17311533568;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNO"] = 17272471551;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOP"] = 17232363519;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQ"] = 17219977215;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 17179869183;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFG"] = 17032784383;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHA"] = 16790204672;
a["ABABABABABABABABABABABABABABABABABABABABABAB"] = 15690529803;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCD"] = 15557521951;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLM"] = 15336865792;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 15290740087;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDE"] = 15113454336;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKA"] = 15111609344;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 14764070560;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFG"] = 14343640320;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGH"] = 14071211264;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNA"] = 13451264001;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 13153720608;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCD"] = 12939493584;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABC"] = 11984054399;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRST"] = 11831083008;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEF"] = 11753424255;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 11648590815;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGH"] = 11515645951;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHI"] = 11341262335;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRS"] = 11283726336;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKL"] = 11038068736;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABC"] = 10777067568;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQR"] = 10741874688;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQ"] = 10202644480;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJK"] = 10187823103;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 10107226303;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 9884647083;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJ"] = 9835689983;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOP"] = 9664659456;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFG"] = 9516253952;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMN"] = 9418178560;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIAB"] = 9240475919;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJK"] = 9231777791;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNO"] = 9127264256;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKL"] = 8918413311;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLM"] = 8757305343;
a["ABABABABABABABABABABABABABABABABABABABABABA"] = 8716961001;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJK"] = 8686546944;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDE"] = 8681850303;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMN"] = 8675590143;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNO"] = 8635613183;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPAB"] = 8620146696;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOP"] = 8618901503;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMN"] = 8590147584;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 8589934591;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 8346193632;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEF"] = 8262222080;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 8072201383;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLM"] = 8053161984;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKL"] = 7516237824;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJ"] = 7275001856;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEF"] = 6993443200;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJK"] = 6979342336;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIA"] = 6899224065;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 6717831121;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCD"] = 6711415135;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGH"] = 6601875199;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUV"] = 6530531328;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFG"] = 6496184831;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGH"] = 6492790015;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPA"] = 6465847296;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJ"] = 6442460160;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHI"] = 6316621824;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTU"] = 6215958528;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRST"] = 5925502976;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHI"] = 5905584128;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 5884200159;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 5708237089;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRS"] = 5646581760;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGH"] = 5576416000;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLM"] = 5520416768;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDE"] = 5446943744;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHI"] = 5444225535;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 5374978559;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQR"] = 5373165568;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGH"] = 5368710912;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJ"] = 5314821119;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABC"] = 5290238023;
a["ABABABABABABABABABABABABABABABABABABABABAB"] = 5230176600;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDE"] = 5221512960;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQ"] = 5102370816;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFG"] = 4941094656;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJ"] = 4890605567;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOP"] = 4832821248;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFG"] = 4831838976;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHI"] = 4753142016;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJK"] = 4601266175;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNO"] = 4563861504;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZAB"] = 4563402759;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 4478554080;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKL"] = 4451479551;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDE"] = 4395630943;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLM"] = 4374781951;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCD"] = 4369032736;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEF"] = 4356114944;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMN"] = 4336320511;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNO"] = 4318363647;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOP"] = 4312793087;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMN"] = 4295180288;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEF"] = 4294967616;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 4294967295;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFG"] = 4143975167;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMAB"] = 4143067147;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFG"] = 4142176767;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLM"] = 4026630144;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEF"] = 3986454271;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWX"] = 3875536896;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 3873995664;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDE"] = 3795256064;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 3772687087;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKL"] = 3758141440;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDE"] = 3758096512;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCD"] = 3595500384;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKL"] = 3571535872;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZA"] = 3556769793;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 3556769792;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVW"] = 3539992576;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABC"] = 3515780704;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJK"] = 3489681408;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCD"] = 3439329391;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUV"] = 3309305856;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCD"] = 3245932752;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJ"] = 3221234688;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCD"] = 3221225520;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGH"] = 3200261375;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMA"] = 3132604417;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTU"] = 3128950784;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 3105172219;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRST"] = 2972712960;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHI"] = 2952794112;
a["ABABABABABABABABABABABABABABABABABABABABA"] = 2905653666;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHI"] = 2878320127;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEF"] = 2868904959;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRS"] = 2828009472;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEF"] = 2816542079;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJAB"] = 2770110476;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABC"] = 2751463455;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABC"] = 2702114864;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGH"] = 2701802240;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHI"] = 2696956415;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQR"] = 2688811008;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGH"] = 2684356352;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABC"] = 2684354576;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDE"] = 2671325503;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 2627576992;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 2623476240;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 2618597575;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 2617245696;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXY"] = 2617245696;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJK"] = 2563297280;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQ"] = 2552233984;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJ"] = 2431694847;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOP"] = 2416902144;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFG"] = 2415919872;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJK"] = 2293350399;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNO"] = 2282160128;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 2271196656;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKL"] = 2221944831;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYAB"] = 2197815303;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLM"] = 2190356480;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLM"] = 2185617407;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMN"] = 2167799807;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOAB"] = 2160918536;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNO"] = 2160328703;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMN"] = 2147696640;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEF"] = 2147483968;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^AB"] = 2147483652;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 2147483647;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDE"] = 2130706783;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWX"] = 2130706432;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJA"] = 2075890176;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDE"] = 2055181759;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFG"] = 2030045951;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLM"] = 2013364224;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJ"] = 2008496128;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 1970269049;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 1965725968;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCD"] = 1925044255;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 1898643987;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKL"] = 1879093248;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDE"] = 1879048320;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVW"] = 1862270976;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJK"] = 1744850944;
a["ABABABABABABABABABABABABABABABABABABABAB"] = 1743392199;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYA"] = 1711276033;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXY"] = 1711276032;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUV"] = 1698693120;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 1695937320;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFG"] = 1676132352;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHI"] = 1671979008;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCD"] = 1660944495;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGH"] = 1647920895;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOA"] = 1620967424;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJ"] = 1610621952;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCD"] = 1610612784;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^A"] = 1610612736;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTU"] = 1585446912;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGH"] = 1577065727;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCD"] = 1574646111;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRST"] = 1496317952;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHI"] = 1476399104;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 1469797152;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABC"] = 1449763199;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGA"] = 1446193920;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGH"] = 1440389888;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRS"] = 1418723328;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ"] = 1406239743;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEF"] = 1396704255;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 1375552769;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQR"] = 1346633728;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGH"] = 1342179072;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABC"] = 1342177296;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHI"] = 1335904767;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABC"] = 1325400095;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKL"] = 1282150400;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQ"] = 1277165568;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 1268860316;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFG"] = 1259159296;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWX"] = 1258291200;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXY"] = 1258291200;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABC"] = 1233899591;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJ"] = 1209055231;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOP"] = 1208942592;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFG"] = 1207960320;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 1152597600;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJK"] = 1143062527;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNO"] = 1141309440;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEF"] = 1140284800;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKL"] = 1109143551;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHAB"] = 1103655183;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEF"] = 1102055936;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLM"] = 1092083711;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMN"] = 1084096511;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNO"] = 1081606143;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMN"] = 1073954816;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEF"] = 1073742144;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]AB"] = 1073741828;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1073741823;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^"] = 1073741823;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXAB"] = 1056964615;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDE"] = 1031799135;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVW"] = 1023410176;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 1018537300;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFG"] = 1014770175;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLM"] = 1006731264;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFG"] = 994052863;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFG"] = 992819199;
a["ABABABABABABABABABABABABABABABABABABABA"] = 968551221;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLAB"] = 962752523;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDE"] = 956490496;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 941734656;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKL"] = 939569152;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDE"] = 939524224;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUV"] = 893386752;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJK"] = 872435712;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDE"] = 838160128;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJK"] = 828047360;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXA"] = 822083585;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWX"] = 822083584;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHA"] = 819154689;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCD"] = 816431312;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTU"] = 813694976;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJ"] = 805315584;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCD"] = 805306416;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]A"] = 805306368;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCD"] = 801112175;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGH"] = 777002239;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 768398399;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRST"] = 758120448;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHI"] = 748303871;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHI"] = 738201600;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 733031724;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLA"] = 726265857;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 720256848;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRS"] = 714080256;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEF"] = 679478271;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABC"] = 678993968;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEF"] = 677477759;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQR"] = 675545088;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGH"] = 671090432;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABC"] = 671088656;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHI"] = 661670399;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCD"] = 647452704;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQ"] = 639631360;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABC"] = 637534239;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOP"] = 604962816;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFG"] = 603980544;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVW"] = 603979776;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWX"] = 603979776;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJ"] = 601143295;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJ"] = 592500736;
a["ABABABABABABABABABABABABABABABABABABAB"] = 581130732;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNO"] = 570884096;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEF"] = 570187135;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJK"] = 569753599;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGH"] = 564057088;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKL"] = 553725951;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 548402752;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLM"] = 545841151;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNAB"] = 542801928;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMN"] = 542523391;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMN"] = 537083904;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEF"] = 536871232;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\AB"] = 536870916;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]"] = 536870911;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 536870911;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]"] = 536870911;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABC"] = 509802336;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWAB"] = 507510791;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKL"] = 507043840;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLM"] = 503414784;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDE"] = 499122527;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUV"] = 490733568;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 488814431;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDE"] = 486798783;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFG"] = 486542079;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKL"] = 469807104;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDE"] = 469762176;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 465117428;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHI"] = 461991936;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 450117359;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJK"] = 436228096;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTU"] = 427819008;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGH"] = 419335935;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNA"] = 407199744;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJ"] = 402662400;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCD"] = 402653232;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\A"] = 402653184;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIAB"] = 397387788;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWA"] = 394264577;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVW"] = 394264576;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRST"] = 389021696;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCD"] = 385876079;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGH"] = 382737663;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGH"] = 381885184;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHI"] = 369102848;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCD"] = 368802143;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRS"] = 361758720;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDE"] = 358871103;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 351736800;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQR"] = 340000768;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGH"] = 335546112;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABC"] = 335544336;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEF"] = 330302463;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHI"] = 327698943;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFG"] = 325922560;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFG"] = 323003136;
a["ABABABABABABABABABABABABABABABABABABA"] = 322850406;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQ"] = 320864256;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABC"] = 306184223;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOP"] = 302972928;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFG"] = 301990656;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 299537287;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJ"] = 298891263;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIA"] = 296960256;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJK"] = 296423424;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 290976839;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVW"] = 289406976;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUV"] = 289406976;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABC"] = 286851143;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 286574031;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNO"] = 285671424;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJK"] = 284016639;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEF"] = 281504256;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKL"] = 276508671;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLM"] = 272982015;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMN"] = 271876095;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMN"] = 268648448;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEF"] = 268435776;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[AB"] = 268435460;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 268435455;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFG"] = 252064255;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLM"] = 251756544;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCD"] = 246073247;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 244222560;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVAB"] = 243269639;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDE"] = 242594560;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDE"] = 241172831;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFG"] = 238029567;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKL"] = 234926080;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDE"] = 234881152;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTU"] = 234881024;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKAB"] = 222783499;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJK"] = 218124288;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCD"] = 206307536;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRST"] = 204472320;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEF"] = 202476160;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHI"] = 202217983;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJ"] = 201335808;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCD"] = 201326640;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ[A"] = 201326592;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 197754481;
a["ABABABABABABABABABABABABABABABABABAB"] = 193710243;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJ"] = 191113216;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVA"] = 188743681;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUV"] = 188743680;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGH"] = 188488959;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCD"] = 185598063;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRS"] = 185597952;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 185453831;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHI"] = 184553472;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 179219839;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 177119504;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 173045315;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQR"] = 172228608;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABC"] = 171266096;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGH"] = 167773952;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABC"] = 167772176;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKA"] = 167591937;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEF"] = 164316543;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHI"] = 162286079;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQ"] = 161480704;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEF"] = 160433151;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOP"] = 151977984;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEFG"] = 150995712;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJ"] = 148617215;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABC"] = 146800671;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNO"] = 143065088;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJK"] = 141606911;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDE"] = 138855936;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTU"] = 138412032;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUV"] = 138412032;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKL"] = 138145791;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMAB"] = 136814600;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLM"] = 136683519;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHI"] = 136314880;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMN"] = 134430720;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDEF"] = 134218048;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZAB"] = 134217732;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 134217727;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 134217727;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 134217727;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 134217727;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 134217727;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 133800847;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 131836320;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 128514483;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 128332608;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLM"] = 125927424;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKL"] = 117485568;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCDE"] = 117440640;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJK"] = 116807680;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFG"] = 116394751;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDE"] = 116392287;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUAB"] = 116391943;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDE"] = 115703231;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRST"] = 112197632;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGH"] = 110167551;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABCA"] = 109799329;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJK"] = 109072384;
a["ABABABABABABABABABABABABABABABABABA"] = 107616801;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGH"] = 105704192;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMA"] = 102641664;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCD"] = 102082848;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJ"] = 100672512;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABCD"] = 100663344;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZA"] = 100663296;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGA"] = 98386177;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRS"] = 97517568;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGH"] = 92806399;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHI"] = 92278784;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 90878465;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUA"] = 90177537;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTU"] = 90177536;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCD"] = 89129071;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQR"] = 88342528;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 87846399;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFG"] = 86654720;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCD"] = 86360415;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFGH"] = 83887872;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYABC"] = 83886096;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQ"] = 81788928;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHI"] = 80366079;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABC"] = 77963872;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEF"] = 77857791;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 77227928;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOP"] = 76480512;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEFG"] = 75498240;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJ"] = 73906175;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEF"] = 73120256;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNO"] = 71761920;
a["ABCABCABCABCABCABCABCABCABCABCABCABCABC"] = 70711160;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJK"] = 70631423;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABC"] = 70254623;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKL"] = 69087231;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLM"] = 68599807;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJ"] = 68212736;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFG"] = 67643520;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMN"] = 67321856;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDEF"] = 67109184;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYAB"] = 67108868;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 67108863;
a["AAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 67108863;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 67108863;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 67108863;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 67108863;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 67108863;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABC"] = 66512967;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTU"] = 66060288;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRST"] = 66060288;
a["ABABABABABABABABABABABABABABABABAB"] = 64570080;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFG"] = 64142335;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLM"] = 63012864;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDE"] = 62210816;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 61676448;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHAB"] = 59802892;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKL"] = 58765312;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCDE"] = 58720384;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFG"] = 56888063;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDE"] = 56099167;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTAB"] = 55574535;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJK"] = 54546432;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRS"] = 53477376;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCD"] = 52547792;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJAB"] = 51347467;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 51121343;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJ"] = 50340864;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABCD"] = 50331696;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXYA"] = 50331648;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 49923732;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQR"] = 46399488;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGHI"] = 46141440;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGH"] = 45686015;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHA"] = 44443648;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHI"] = 43915264;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABC"] = 43474992;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTA"] = 42991617;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRST"] = 42991616;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCD"] = 42729583;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFGH"] = 41944832;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXABC"] = 41943056;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQ"] = 41943040;
a["ABCABCABCABCABCABCABCABCABCABCABCABCAB"] = 40850456;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEF"] = 40493695;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHI"] = 39799295;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEF"] = 39084160;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOP"] = 38731776;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJA"] = 38492161;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEF"] = 37749759;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEFG"] = 37749504;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJ"] = 36763647;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 36159456;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNO"] = 36110336;
a["ABABABABABABABABABABABABABABABABA"] = 35872266;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJK"] = 35258367;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLAB"] = 34680840;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKL"] = 34619391;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 33929304;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMN"] = 33767424;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDEF"] = 33554752;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABC"] = 33554463;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXAB"] = 33554436;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWXY"] = 33554431;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXY"] = 33554431;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWXY"] = 33554431;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXY"] = 33554431;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXY"] = 33554431;
a["AAAAAAAAAAAAAAAAAAAAAAAAAA"] = 33554431;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXY"] = 33554431;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 32758815;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLM"] = 31555584;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRS"] = 31457280;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRST"] = 31457280;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGH"] = 31222528;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGH"] = 30399999;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKL"] = 29405184;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCDE"] = 29360256;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFG"] = 27790079;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDE"] = 27733439;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJK"] = 27283456;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDE"] = 27001183;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ"] = 26777600;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSAB"] = 26476551;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLA"] = 26017792;
a["ABCABCABCABCABCABCABCABCABCABCABCABCA"] = 25920104;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQR"] = 25427968;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJ"] = 25175040;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABCD"] = 25165872;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWXA"] = 25165824;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDE"] = 24804480;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFG"] = 24061696;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 23400960;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGHI"] = 23072768;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 22725631;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 22619535;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGH"] = 22486271;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQ"] = 22020096;
a["ABABABABABABABABABABABABABABABAB"] = 21523359;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFGH"] = 20973312;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWABC"] = 20971536;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCD"] = 20447343;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSA"] = 20447233;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRS"] = 20447232;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCD"] = 20276319;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOP"] = 19857408;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHI"] = 19712511;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEF"] = 19532288;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEFG"] = 18875136;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJ"] = 18298879;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEF"] = 18285567;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNO"] = 18284544;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJK"] = 17629183;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKL"] = 17416191;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCD"] = 17154080;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMN"] = 16990208;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFG"] = 16973055;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDEF"] = 16777536;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWAB"] = 16777220;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVWX"] = 16777215;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVWX"] = 16777215;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWX"] = 16777215;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVWX"] = 16777215;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWX"] = 16777215;
a["AAAAAAAAAAAAAAAAAAAAAAAAA"] = 16777215;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWX"] = 16777215;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWX"] = 16777215;
a["ABCABCABCABCABCABCABCABCABCABCABCABC"] = 16692639;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 16471311;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDE"] = 16251648;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 16216656;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABC"] = 15990815;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLM"] = 15826944;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHI"] = 15626752;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABC"] = 15404615;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRS"] = 14942208;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQR"] = 14942208;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKL"] = 14725120;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCDE"] = 14680192;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJK"] = 13651968;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFG"] = 13568767;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCD"] = 13562064;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 13250215;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDE"] = 12976479;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHIJ"] = 12592128;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABCD"] = 12582960;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRAB"] = 12582919;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVWA"] = 12582912;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 12579296;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQ"] = 12058624;
a["ABABABABABABABABABABABABABABABA"] = 11957421;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 11931777;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIAB"] = 11794699;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGHI"] = 11538432;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 11467680;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABC"] = 11151408;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGH"] = 11066623;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFGH"] = 10487552;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVABC"] = 10485776;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOP"] = 10420224;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEF"] = 10259583;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGH"] = 10051328;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHI"] = 9767423;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCD"] = 9764975;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRA"] = 9699329;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQR"] = 9699328;
a["ABCABCABCABCABCABCABCABCABCABCABCAB"] = 9643483;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEFG"] = 9437952;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 9430284;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNO"] = 9371648;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJ"] = 9119743;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKAB"] = 8871944;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEF"] = 8848383;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJK"] = 8843263;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIA"] = 8801281;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMN"] = 8601600;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 8565555;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDEF"] = 8388928;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVAB"] = 8388612;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUVW"] = 8388607;
a["AAAAAAAAAAAAAAAAAAAAAAAA"] = 8388607;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 8170624;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLM"] = 7962624;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 7782655;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABC"] = 7602207;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJKL"] = 7385088;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCDE"] = 7340160;
a["ABABABABABABABABABABABABABABAB"] = 7174452;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFG"] = 7124224;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQR"] = 7077888;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQ"] = 7077888;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGA"] = 6941568;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJK"] = 6836224;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDE"] = 6758591;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKA"] = 6653952;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFG"] = 6621951;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHIJ"] = 6300672;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABCD"] = 6291504;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUVA"] = 6291456;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDE"] = 6226271;
a["ABCABCABCABCABCABCABCABCABCABCABCA"] = 6118905;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHI"] = 6109440;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQAB"] = 5963783;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCDA"] = 5821345;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGHI"] = 5771264;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOP"] = 5701632;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEF"] = 5452288;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGH"] = 5446911;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFGH"] = 5244672;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUABC"] = 5242896;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNO"] = 4915200;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHI"] = 4844031;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCD"] = 4796511;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 4762944;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEFG"] = 4758271;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEFG"] = 4719360;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCD"] = 4653167;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQA"] = 4587521;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQ"] = 4587520;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 4562431;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJ"] = 4556799;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJK"] = 4464639;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMN"] = 4407296;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDE"] = 4373760;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEF"] = 4277247;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDEF"] = 4194624;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUAB"] = 4194308;
a["AAAAAAAAAAAAAAAAAAAAAAA"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTUV"] = 4194303;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKLM"] = 4030464;
a["ABABABABABABABABABABABABABABA"] = 3985806;
a["ABCABCABCABCABCABCABCABCABCABCABC"] = 3940596;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABCD"] = 3880896;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJKL"] = 3715072;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCDE"] = 3670144;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABC"] = 3604511;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABCD"] = 3574992;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHABC"] = 3572551;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGH"] = 3565312;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJK"] = 3428352;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOP"] = 3342336;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQ"] = 3342336;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFG"] = 3230463;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHIJ"] = 3154944;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABCD"] = 3145776;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTUA"] = 3145728;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 3059104;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDE"] = 2982239;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 2952319;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJABC"] = 2907696;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGHI"] = 2887680;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPAB"] = 2818055;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDEF"] = 2716031;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHAB"] = 2703115;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNO"] = 2686976;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGH"] = 2682111;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFGH"] = 2623232;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTABC"] = 2621456;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGHI"] = 2406911;
a["ABABABABABABABABABABABABABAB"] = 2391483;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEFG"] = 2360064;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLMN"] = 2310144;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJAB"] = 2301960;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEFG"] = 2293248;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHIJ"] = 2288639;
a["ABCABCABCABCABCABCABCABCABCABCAB"] = 2276516;
a["ABCDABCDABCDABCDABCDABCDABCDABCDABC"] = 2273376;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCD"] = 2211951;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPA"] = 2162689;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOP"] = 2162688;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 2126880;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDEF"] = 2097472;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTAB"] = 2097156;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["AAAAAAAAAAAAAAAAAAAAAA"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRSTU"] = 2097151;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEF"] = 2065407;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKLM"] = 2064384;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 2045743;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGHA"] = 2004225;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJKL"] = 1880064;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCDE"] = 1835136;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJA"] = 1724928;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJK"] = 1724416;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOABC"] = 1703967;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCDE"] = 1694911;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDEF"] = 1620992;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHIJ"] = 1582080;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEFG"] = 1575679;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABCD"] = 1572912;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMNO"] = 1572864;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNOP"] = 1572864;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRSTA"] = 1572864;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 1543948;
a["ABCDABCDABCDABCDABCDABCDABCDABCDAB"] = 1469616;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDEA"] = 1446593;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGHI"] = 1445888;
a["ABCABCABCABCABCABCABCABCABCABCA"] = 1444476;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCDE"] = 1425759;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFGH"] = 1387520;
a["ABABABABABABABABABABABABABA"] = 1328601;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOAB"] = 1327111;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFGH"] = 1322239;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFGH"] = 1312512;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSABC"] = 1310736;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLMN"] = 1261568;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCDE"] = 1230848;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGHI"] = 1200639;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEFG"] = 1180416;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHIJ"] = 1161215;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABCD"] = 1151839;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 1119040;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKLM"] = 1081344;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDEF"] = 1048896;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABCD"] = 1048687;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSAB"] = 1048580;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRST"] = 1048575;
a["AAAAAAAAAAAAAAAAAAAAA"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRST"] = 1048575;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNOA"] = 1015809;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMNO"] = 1015808;
a["ABCDABCDABCDABCDABCDABCDABCDABCDA"] = 998784;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDEF"] = 996351;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCDE"] = 981792;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABCD"] = 973008;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJKL"] = 962560;
a["ABCABCABCABCABCABCABCABCABCABC"] = 930247;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCDE"] = 917632;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJK"] = 872448;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 832839;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEFG"] = 810496;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNABC"] = 802847;
a["ABABABABABABABABABABABABAB"] = 797160;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHIJ"] = 795648;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABCD"] = 786480;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRSA"] = 786432;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIABC"] = 777008;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEFG"] = 768767;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDEF"] = 765567;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLMN"] = 737280;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMNO"] = 737280;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGHI"] = 724992;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCDE"] = 680287;
a["ABCDABCDABCDABCDABCDABCDABCDABCD"] = 665855;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFGH"] = 657152;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRABC"] = 655376;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFGH"] = 653567;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNAB"] = 622599;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 619019;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIAB"] = 609800;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGHI"] = 603647;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEFG"] = 590592;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKLM"] = 589824;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABCD"] = 575712;
a["ABCABCABCABCABCABCABCABCABCAB"] = 537411;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDEF"] = 524608;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRAB"] = 524292;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQRS"] = 524287;
a["AAAAAAAAAAAAAAAAAAAA"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQRS"] = 524287;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDEF"] = 521984;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJKL"] = 503808;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABCD"] = 495727;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDEF"] = 480255;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMNA"] = 475137;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLMN"] = 475136;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCDE"] = 458880;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHIA"] = 455936;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFGA"] = 454657;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJK"] = 446464;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCDE"] = 444351;
a["ABABABABABABABABABABABABA"] = 442866;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHIJ"] = 402432;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABCD"] = 393264;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQRA"] = 393216;
a["ABCDABCDABCDABCDABCDABCDABCDABC"] = 390047;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMABC"] = 376863;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEFG"] = 375551;
a["ABCDEABCDEABCDEABCDEABCDEABCDEABC"] = 372672;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCDE"] = 368128;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGHI"] = 364544;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKLM"] = 344064;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLMN"] = 344064;
a["ABCABCABCABCABCABCABCABCABCA"] = 340993;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFGH"] = 329472;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQABC"] = 327696;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFGH"] = 324863;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCDE"] = 323935;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEFG"] = 313600;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGHI"] = 308223;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEFG"] = 295680;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMAB"] = 290823;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABCD"] = 283743;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABCD"] = 276944;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJKL"] = 274432;
a["ABABABABABABABABABABABAB"] = 265719;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDEF"] = 262464;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQAB"] = 262148;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQR"] = 262143;
a["AAAAAAAAAAAAAAAAAAA"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQR"] = 262143;
a["ABCDEABCDEABCDEABCDEABCDEABCDEAB"] = 258316;
a["ABCDABCDABCDABCDABCDABCDABCDAB"] = 252143;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABCD"] = 233583;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJK"] = 233472;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDEF"] = 231423;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCDE"] = 229504;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLMA"] = 221185;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKLM"] = 221184;
a["ABCABCABCABCABCABCABCABCABC"] = 219600;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHABC"] = 214832;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHIJ"] = 205824;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABCD"] = 196656;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQA"] = 196608;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFABC"] = 196167;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGHI"] = 184320;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEFG"] = 184063;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDEF"] = 183552;
a["ABCDEABCDEABCDEABCDEABCDEABCDEA"] = 182688;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLABC"] = 176159;
a["ABCDABCDABCDABCDABCDABCDABCDA"] = 171361;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHAB"] = 166152;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFGH"] = 165632;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPABC"] = 163856;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFGH"] = 163327;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJKL"] = 159744;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKLM"] = 159744;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCDE"] = 153951;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEFG"] = 148224;
a["ABABABABABABABABABABABA"] = 147621;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFAB"] = 141835;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLAB"] = 135175;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDEF"] = 131392;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPAB"] = 131076;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOPQ"] = 131071;
a["AAAAAAAAAAAAAAAAAA"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOPQ"] = 131071;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJK"] = 126976;
a["ABCABCABCABCABCABCABCABCAB"] = 126864;
a["ABCDEABCDEABCDEABCDEABCDEABCDE"] = 123967;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGHA"] = 123648;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCDE"] = 118528;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCDE"] = 114816;
a["ABCDABCDABCDABCDABCDABCDABCD"] = 114240;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDEF"] = 111615;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABCD"] = 109679;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHIJ"] = 107520;
a["ABCDEFABCDEFABCDEFABCDEFABCDEFA"] = 102657;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKLA"] = 102401;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJKL"] = 102400;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABCD"] = 98352;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOPA"] = 98304;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGHI"] = 94208;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEFG"] = 90879;
a["ABABABABABABABABABABAB"] = 88572;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFGH"] = 83967;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFGH"] = 83712;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABCD"] = 83408;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKABC"] = 81951;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOABC"] = 81936;
a["ABCABCABCABCABCABCABCABCA"] = 80496;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEFG"] = 74496;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJK"] = 73728;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJKL"] = 73728;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCDE"] = 73055;
a["ABCDEABCDEABCDEABCDEABCDEABCD"] = 72623;
a["ABCDEFABCDEFABCDEFABCDEFABCDEF"] = 70400;
a["ABCDABCDABCDABCDABCDABCDABC"] = 66920;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDEF"] = 65856;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOAB"] = 65540;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOP"] = 65535;
a["AAAAAAAAAAAAAAAAA"] = 65535;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOP"] = 65535;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKAB"] = 62471;
a["ABCDEFGABCDEFGABCDEFGABCDEFGABC"] = 62000;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHIJ"] = 58368;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCDE"] = 57472;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDEF"] = 54015;
a["ABCABCABCABCABCABCABCABC"] = 51839;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABCD"] = 51311;
a["ABABABABABABABABABABA"] = 49206;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABCD"] = 49200;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGHI"] = 49152;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNOA"] = 49152;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJKA"] = 47105;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJK"] = 47104;
a["ABCDEABCDEABCDEABCDEABCDEABC"] = 46951;
a["ABCDEFGABCDEFGABCDEFGABCDEFGAB"] = 46856;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEFG"] = 45567;
a["ABCDABCDABCDABCDABCDABCDAB"] = 43260;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFGH"] = 42752;
a["ABCDEFABCDEFABCDEFABCDEFABCDE"] = 41312;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNABC"] = 40976;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJABC"] = 37919;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEFG"] = 37632;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCDE"] = 34655;
a["ABCDEFGABCDEFGABCDEFGABCDEFGA"] = 34560;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHIJ"] = 33792;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJK"] = 33792;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDEF"] = 33088;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNAB"] = 32772;
a["AAAAAAAAAAAAAAAA"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMNO"] = 32767;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMNO"] = 32767;
a["ABCDEABCDEABCDEABCDEABCDEAB"] = 32507;
a["ABCABCABCABCABCABCABCAB"] = 29947;
a["ABABABABABABABABABAB"] = 29523;
a["ABCDABCDABCDABCDABCDABCDA"] = 29400;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCDE"] = 28800;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJAB"] = 28679;
a["ABCDEFABCDEFABCDEFABCDEFABCD"] = 26768;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGHI"] = 26624;
a["ABCDEFGHABCDEFGHABCDEFGHABCDEF"] = 26367;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABCD"] = 24624;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMNA"] = 24576;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABCD"] = 23919;
a["ABCDEFGABCDEFGABCDEFGABCDEFG"] = 23551;
a["ABCDEABCDEABCDEABCDEABCDEA"] = 22977;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFGH"] = 22272;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJA"] = 21505;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHIJ"] = 21504;
a["ABCDEFGHIJKLMABCDEFGHIJKLMABC"] = 20496;
a["ABCDABCDABCDABCDABCDABCD"] = 19599;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEFG"] = 19200;
a["ABCABCABCABCABCABCABCA"] = 19001;
a["ABCDEFABCDEFABCDEFABCDEFABC"] = 18768;
a["ABCDEFGHIABCDEFGHIABCDEFGHIABC"] = 17439;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDEF"] = 16704;
a["ABCDEFGHABCDEFGHABCDEFGHABCDE"] = 16479;
a["ABABABABABABABABABA"] = 16401;
a["ABCDEFGHIJKLMABCDEFGHIJKLMAB"] = 16388;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLMN"] = 16383;
a["AAAAAAAAAAAAAAA"] = 16383;
a["ABCDEFGHIJKLMNABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLMN"] = 16383;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLMN"] = 16383;
a["ABCDEABCDEABCDEABCDEABCDE"] = 15600;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHIJ"] = 15360;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGHI"] = 15360;
a["ABCDEFGHIJKLABCDEFGHIJKLABCDE"] = 14464;
a["ABCDEFABCDEFABCDEFABCDEFAB"] = 13704;
a["ABCDEFGABCDEFGABCDEFGABCDEF"] = 13119;
a["ABCDEFGHIABCDEFGHIABCDEFGHIAB"] = 13063;
a["ABCDEFGHIJKLABCDEFGHIJKLABCD"] = 12336;
a["ABCDEFGHIJKLMABCDEFGHIJKLMA"] = 12288;
a["ABCABCABCABCABCABCABC"] = 12236;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFGH"] = 12032;
a["ABCDABCDABCDABCDABCDABC"] = 11479;
a["ABCDEFGHABCDEFGHABCDEFGHABCD"] = 11119;
a["ABCDEFGHIJKLABCDEFGHIJKLABC"] = 10256;
a["ABCDEFGHIJKABCDEFGHIJKABCDEFG"] = 9984;
a["ABCDEFABCDEFABCDEFABCDEFA"] = 9952;
a["ABABABABABABABABAB"] = 9840;
a["ABCDEFGHIABCDEFGHIABCDEFGHIA"] = 9729;
a["ABCDEFGHIJABCDEFGHIJABCDEFGHI"] = 9728;
a["ABCDEABCDEABCDEABCDEABCD"] = 9168;
a["ABCDEFGHIJKABCDEFGHIJKABCDEF"] = 8512;
a["ABCDEFGHIJKLABCDEFGHIJKLAB"] = 8196;
a["ABCDEFGHIJKLMNABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKLM"] = 8191;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLM"] = 8191;
a["AAAAAAAAAAAAAA"] = 8191;
a["ABCDEFGHABCDEFGHABCDEFGHABC"] = 7967;
a["ABCDEFGABCDEFGABCDEFGABCDE"] = 7903;
a["ABCDABCDABCDABCDABCDAB"] = 7419;
a["ABCDEFGHIJKABCDEFGHIJKABCDE"] = 7296;
a["ABCABCABCABCABCABCAB"] = 7068;
a["ABCDEFGHIABCDEFGHIABCDEFGHI"] = 6912;
a["ABCDEFGHIJABCDEFGHIJABCDEFGH"] = 6912;
a["ABCDEFABCDEFABCDEFABCDEF"] = 6783;
a["ABCDEFGHIJKABCDEFGHIJKABCD"] = 6192;
a["ABCDEFGHIJKLABCDEFGHIJKLA"] = 6144;
a["ABCDEABCDEABCDEABCDEABC"] = 5952;
a["ABCDEFGHABCDEFGHABCDEFGHAB"] = 5895;
a["ABABABABABABABABA"] = 5466;
a["ABCDEFGHIJABCDEFGHIJABCDEFG"] = 5376;
a["ABCDEFGABCDEFGABCDEFGABCD"] = 5167;
a["ABCDEFGHIJKABCDEFGHIJKABC"] = 5136;
a["ABCDABCDABCDABCDABCDA"] = 5041;
a["ABCABCABCABCABCABCA"] = 4484;
a["ABCDEFGHIJABCDEFGHIJABCDEF"] = 4416;
a["ABCDEFGHABCDEFGHABCDEFGHA"] = 4353;
a["ABCDEFGHIABCDEFGHIABCDEFGH"] = 4352;
a["ABCDEABCDEABCDEABCDEAB"] = 4136;
a["ABCDEFGHIJKABCDEFGHIJKAB"] = 4100;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJKL"] = 4095;
a["AAAAAAAAAAAAA"] = 4095;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPABCDEFGHIJKL"] = 4095;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJKL"] = 4095;
a["ABCDEFABCDEFABCDEFABCDE"] = 3871;
a["ABCDEFGHIJABCDEFGHIJABCDE"] = 3712;
a["ABCDEFGABCDEFGABCDEFGABC"] = 3615;
a["ABCDABCDABCDABCDABCD"] = 3360;
a["ABABABABABABABAB"] = 3279;
a["ABCDEFGHIJABCDEFGHIJABCD"] = 3120;
a["ABCDEFGHIABCDEFGHIABCDEFG"] = 3072;
a["ABCDEFGHIJKABCDEFGHIJKA"] = 3072;
a["ABCDEFGHABCDEFGHABCDEFGH"] = 3072;
a["ABCDEABCDEABCDEABCDEA"] = 2928;
a["ABCABCABCABCABCABC"] = 2887;
a["ABCDEFGABCDEFGABCDEFGAB"] = 2631;
a["ABCDEFGHIJABCDEFGHIJABC"] = 2576;
a["ABCDEFABCDEFABCDEFABCD"] = 2415;
a["ABCDEFGHIABCDEFGHIABCDEF"] = 2368;
a["ABCDEFGHIJABCDEFGHIJAB"] = 2052;
a["ABCDEFGHIJKABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNABCDEFGHIJK"] = 2047;
a["AAAAAAAAAAAA"] = 2047;
a["ABCDEFGHIJKLMABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJK"] = 2047;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJK"] = 2047;
a["ABCDEABCDEABCDEABCDE"] = 1983;
a["ABCDABCDABCDABCDABC"] = 1968;
a["ABCDEFGABCDEFGABCDEFGA"] = 1921;
a["ABCDEFGHABCDEFGHABCDEFG"] = 1920;
a["ABCDEFGHIABCDEFGHIABCDE"] = 1920;
a["ABABABABABABABA"] = 1821;
a["ABCABCABCABCABCAB"] = 1667;
a["ABCDEFABCDEFABCDEFABC"] = 1631;
a["ABCDEFGHIABCDEFGHIABCD"] = 1584;
a["ABCDEFGHIJABCDEFGHIJA"] = 1536;
a["ABCDEFGABCDEFGABCDEFG"] = 1344;
a["ABCDEFGHABCDEFGHABCDEF"] = 1344;
a["ABCDEFGHIABCDEFGHIABC"] = 1296;
a["ABCDABCDABCDABCDAB"] = 1272;
a["ABCDEFABCDEFABCDEFAB"] = 1159;
a["ABCDEABCDEABCDEABCD"] = 1151;
a["ABABABABABABAB"] = 1092;
a["ABCABCABCABCABCA"] = 1057;
a["ABCDEFGHIABCDEFGHIAB"] = 1028;
a["ABCDEFGHABCDEFGHABCDE"] = 1024;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRABCDEFGHIJ"] = 1023;
a["AAAAAAAAAAA"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPABCDEFGHIJ"] = 1023;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJ"] = 1023;
a["ABCDABCDABCDABCDA"] = 864;
a["ABCDEFABCDEFABCDEFA"] = 833;
a["ABCDEFGABCDEFGABCDEF"] = 832;
a["ABCDEFGHABCDEFGHABCD"] = 816;
a["ABCDEFGHIABCDEFGHIA"] = 768;
a["ABCDEABCDEABCDEABC"] = 735;
a["ABCABCABCABCABC"] = 680;
a["ABCDEFGHABCDEFGHABC"] = 656;
a["ABABABABABABA"] = 606;
a["ABCDEFGABCDEFGABCDE"] = 576;
a["ABCDEFABCDEFABCDEF"] = 576;
a["ABCDABCDABCDABCD"] = 575;
a["ABCDEFGHABCDEFGHAB"] = 516;
a["ABCDEFGHIJKLMNABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRABCDEFGHI"] = 511;
a["ABCDEFGHIABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOABCDEFGHI"] = 511;
a["ABCDEFGHIJKABCDEFGHI"] = 511;
a["ABCDEFGHIJKLABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGHI"] = 511;
a["AAAAAAAAAA"] = 511;
a["ABCDEFGHIJKLMNOPQABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGHI"] = 511;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGHI"] = 511;
a["ABCDEFGHIJABCDEFGHI"] = 511;
a["ABCDEABCDEABCDEAB"] = 503;
a["ABCDEFGABCDEFGABCD"] = 432;
a["ABCABCABCABCAB"] = 392;
a["ABCDEFGHABCDEFGHA"] = 384;
a["ABABABABABAB"] = 363;
a["ABCDEABCDEABCDEA"] = 353;
a["ABCDEFABCDEFABCDE"] = 352;
a["ABCDEFGABCDEFGABC"] = 336;
a["ABCDABCDABCDABC"] = 335;
a["ABCDEFGABCDEFGAB"] = 260;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGH"] = 255;
a["AAAAAAAAA"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQABCDEFGH"] = 255;
a["ABCDEFGHIABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGH"] = 255;
a["ABCDEFGHABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFGH"] = 255;
a["ABCDEFGHIJKABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFGH"] = 255;
a["ABCDEFGHIJABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNOPABCDEFGH"] = 255;
a["ABCDEFGHIJKLABCDEFGH"] = 255;
a["ABCDEFGHIJKLMABCDEFGH"] = 255;
a["ABCDEFGHIJKLMNABCDEFGH"] = 255;
a["ABCABCABCABCA"] = 248;
a["ABCDEFABCDEFABCD"] = 240;
a["ABCDEABCDEABCDE"] = 240;
a["ABCDABCDABCDAB"] = 215;
a["ABABABABABA"] = 201;
a["ABCDEFGABCDEFGA"] = 192;
a["ABCDEFABCDEFABC"] = 176;
a["ABCABCABCABC"] = 159;
a["ABCDABCDABCDA"] = 145;
a["ABCDEABCDEABCD"] = 144;
a["ABCDEFABCDEFAB"] = 132;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEFG"] = 127;
a["ABCDEFGHIABCDEFG"] = 127;
a["ABCDEFGHIJKLABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSABCDEFG"] = 127;
a["AAAAAAAA"] = 127;
a["ABCDEFGHABCDEFG"] = 127;
a["ABCDEFGHIJKLMABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQABCDEFG"] = 127;
a["ABCDEFGABCDEFG"] = 127;
a["ABCDEFGHIJKLMNABCDEFG"] = 127;
a["ABCDEFGHIJKABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUABCDEFG"] = 127;
a["ABCDEFGHIJABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTABCDEFG"] = 127;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEFG"] = 127;
a["ABABABABAB"] = 120;
a["ABCDEFABCDEFA"] = 96;
a["ABCDEABCDEABC"] = 96;
a["ABCDABCDABCD"] = 96;
a["ABCABCABCAB"] = 91;
a["ABCDEABCDEAB"] = 68;
a["ABABABABA"] = 66;
a["ABCDEFGHIJKLMABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDEF"] = 63;
a["ABCDEFGHIJKLMNOABCDEF"] = 63;
a["ABCDEFGHABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUABCDEF"] = 63;
a["ABCDEFGHIJABCDEF"] = 63;
a["AAAAAAA"] = 63;
a["ABCDEFGHIJKLMNOPQRABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEF"] = 63;
a["ABCDEFABCDEF"] = 63;
a["ABCDEFGHIABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPABCDEF"] = 63;
a["ABCDEFGHIJKLMNABCDEF"] = 63;
a["ABCDEFGHIJKLABCDEF"] = 63;
a["ABCDEFGHIJKABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSABCDEF"] = 63;
a["ABCDEFGABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDEF"] = 63;
a["ABCDEFGHIJKLMNOPQRSTUVABCDEF"] = 63;
a["ABCABCABCA"] = 57;
a["ABCDABCDABC"] = 56;
a["ABCDEABCDEA"] = 48;
a["ABABABAB"] = 39;
a["ABCDABCDAB"] = 36;
a["ABCABCABC"] = 36;
a["ABCDEFGHIJKLMNOPQRSTABCDE"] = 31;
a["ABCDEFGHIJKLABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCDE"] = 31;
a["ABCDEFGHIJKLMNOABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUABCDE"] = 31;
a["ABCDEABCDE"] = 31;
a["ABCDEFGHIJKLMABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRABCDE"] = 31;
a["ABCDEFGHIJKLMNABCDE"] = 31;
a["ABCDEFGHIJABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCDE"] = 31;
a["ABCDEFGHABCDE"] = 31;
a["ABCDEFGABCDE"] = 31;
a["ABCDEFGHIJKABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCDE"] = 31;
a["ABCDEFABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCDE"] = 31;
a["ABCDEFGHIABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDE"] = 31;
a["AAAAAA"] = 31;
a["ABCDEFGHIJKLMNOPABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSABCDE"] = 31;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDE"] = 31;
a["ABCDABCDA"] = 24;
a["ABABABA"] = 21;
a["ABCABCAB"] = 20;
a["ABCDEFGHIJKLMABCD"] = 15;
a["ABCDEFGHIJKLMNABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABCD"] = 15;
a["ABCDABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVABCD"] = 15;
a["AAAAA"] = 15;
a["ABCDEFGHIJKLMNOABCD"] = 15;
a["ABCDEFGHIJKLABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWXABCD"] = 15;
a["ABCDEABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTABCD"] = 15;
a["ABCDEFGABCD"] = 15;
a["ABCDEFGHIJABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSABCD"] = 15;
a["ABCDEFABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUABCD"] = 15;
a["ABCDEFGHIJKLMNOPABCD"] = 15;
a["ABCDEFGHIJKABCD"] = 15;
a["ABCDEFGHIJKLMNOPQABCD"] = 15;
a["ABCDEFGHABCD"] = 15;
a["ABCDEFGHIABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRABCD"] = 15;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABCD"] = 15;
a["ABCABCA"] = 12;
a["ABABAB"] = 12;
a["ABCDEFGHIJKLMNOPQRSTUABC"] = 7;
a["ABCDEFGHABC"] = 7;
a["AAAA"] = 7;
a["ABCDEFGHIJKLMNOPQRSABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZABC"] = 7;
a["ABCABC"] = 7;
a["ABCDEFGHIJABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTABC"] = 7;
a["ABCDEFGHIABC"] = 7;
a["ABCDEFGHIJKLMNOABC"] = 7;
a["ABCDEFGHIJKLMNABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWXABC"] = 7;
a["ABCDEFGHIJKLABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWABC"] = 7;
a["ABCDEFGHIJKLMNOPQABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVABC"] = 7;
a["ABCDEFGABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWXYABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[ABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABC"] = 7;
a["ABCDEFGHIJKLMNOPABC"] = 7;
a["ABCDEFGHIJKLMABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABC"] = 7;
a["ABCDEABC"] = 7;
a["ABCDEFABC"] = 7;
a["ABCDEFGHIJKABC"] = 7;
a["ABCDEFGHIJKLMNOPQRABC"] = 7;
a["ABCDABC"] = 7;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABC"] = 7;
a["ABABA"] = 6;
a["ABCAB"] = 3;
a["ABAB"] = 3;
a["ABCDEFGHIJKAB"] = 3;
a["AAA"] = 3;
a["ABCDEFGHIJKLMNAB"] = 3;
a["ABCDEFGAB"] = 3;
a["ABCDEFGHAB"] = 3;
a["ABCDAB"] = 3;
a["ABCDEFGHIJKLMAB"] = 3;
a["ABCDEFAB"] = 3;
a["ABCDEFGHIAB"] = 3;
a["ABCDEFGHIJKLMNOAB"] = 3;
a["ABCDEAB"] = 3;
a["ABCDEFGHIJAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^AB"] = 3;
a["ABCDEFGHIJKLMNOPQRAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZAB"] = 3;
a["ABCDEFGHIJKLMNOPQAB"] = 3;
a["ABCDEFGHIJKLAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]AB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWXYAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[AB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWXAB"] = 3;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\AB"] = 3;
a["ABCDEFGHIJKLMNOPAB"] = 3;
a["ABCDEFGHIA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVA"] = 1;
a["ABCDEFGHIJKLMA"] = 1;
a["ABCDEFGHIJKA"] = 1;
a["ABCDEFGHIJKLMNOPQRSA"] = 1;
a["ABCDA"] = 1;
a["ABCDEFGHIJKLMNOPQRA"] = 1;
a["AA"] = 1;
a["ABCDEFA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTA"] = 1;
a["ABCDEFGHIJKLMNOA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZA"] = 1;
a["ABA"] = 1;
a["ABCDEFGHIJA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWXYA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]A"] = 1;
a["ABCDEA"] = 1;
a["ABCDEFGA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\A"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWA"] = 1;
a["ABCDEFGHIJKLMNOPQA"] = 1;
a["ABCDEFGHIJKLMNOPA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWXA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^A"] = 1;
a["ABCDEFGHIJKLA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[A"] = 1;
a["ABCDEFGHA"] = 1;
a["ABCDEFGHIJKLMNOPQRSTUA"] = 1;
a["ABCA"] = 1;
a["ABCDEFGHIJKLMNA"] = 1;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDEF"] = 0;
a["ABCDE"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDE"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDE"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGH"] = 0;
a["ABCDEF"] = 0;
a["ABCDEF"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFG"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ["] = 0;
a["ABCDEFG"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["ABCDE"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["AB"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["AB"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["AB"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["A"] = 0;
a["AB"] = 0;
a["A"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABC"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCDE"] = 0;
a["ABCD"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABCD"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABC"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABCD"] = 0;
a["ABC"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNO"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUV"] = 0;
a["ABCDEFGHIJKLMNOPQRSTU"] = 0;
a["ABCDEFGHIJKLMN"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQR"] = 0;
a["ABCDEFGHIJKLMNOPQ"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJKLMNOPQRST"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOPQRS"] = 0;
a["ABCDEFGHIJKLMNOP"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXY"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXY"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXY"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXY"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXY"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXY"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWXYZ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHIJ"] = 0;
a["ABCDEFGHI"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVW"] = 0;
a["A"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJKLM"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJK"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWX"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWX"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWX"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWX"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWX"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWX"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKL"] = 0;
a["ABCDEFGHIJKLMNOPQRSTUVWX"] = 0;
} | a.cc:940:7: warning: missing terminating " character
940 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
| ^
a.cc:940:7: error: missing terminating " character
940 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:941:7: warning: missing terminating " character
941 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
| ^
a.cc:941:7: error: missing terminating " character
941 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:942:7: warning: missing terminating " character
942 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
| ^
a.cc:942:7: error: missing terminating " character
942 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 268435455;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:2187:7: warning: missing terminating " character
2187 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
| ^
a.cc:2187:7: error: missing terminating " character
2187 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:2188:7: warning: missing terminating " character
2188 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
| ^
a.cc:2188:7: error: missing terminating " character
2188 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:2340:7: warning: missing terminating " character
2340 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
| ^
a.cc:2340:7: error: missing terminating " character
2340 | a["ABCDEFGHIJKLMNOPQRSTUVWXYZ[\"] = 0;
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc: In function 'void init()':
a.cc:225:77: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
225 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:226:78: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
226 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:227:79: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
227 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:228:80: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
228 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:229:92: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
229 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:230:92: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
230 | a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:231:81: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
231 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:232:82: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
232 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:233:76: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
233 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:234:84: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
234 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:235:85: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
235 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:236:86: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
236 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:237:87: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
237 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:238:88: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
238 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:239:89: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
239 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:240:91: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
240 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:241:91: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
241 | a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:242:90: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
242 | a["ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABA"] = 1000000000000000000;
| ^~~~~~~~~~~~~~~~~~~
a.cc:243:83: warning: overflow in conversion from 'long int' to 'std::map<std::__cxx11::basic_string<char>, int>::mapped_type' {aka 'int'} changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
243 | a["AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"] = 1000000000000000000;
| |
s914902019 | p03769 | C++ | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
out << "[";
fori (i, a.size())
out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(4) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
const int L = 100;
int sz = 100;
vl solve(ll n) {
vl ret;
for (int x = 50; x > 0; --x) {
ll cur = (1LL << x - 1) - 1;
if (cur && cur <= n) {
assert(sz >= 1);
n -= cur;
fori (i, x) {
ret.push_back(sz);
}
sz--;
}
}
if (n == 0)
return ret;
vl add = solve(n);
ret.insert(ret.end(), ALL(add));
assert(ret.size() <= 200):
return ret;
}
void smain() {
// int n = 100000;
// int mx = 0;
// for (int i = 1; i <= n; ++i) {
// int x = rng() % (ll)(1e12) + 1;
// inmax(mx, solve(x));
// }
// watch(mx);
// watch(solve(2));
// watch(solve(1));
ll n;
cin >> n;
vl ans = solve(n);
cout << ans.size() << '\n';
for (auto x : ans) {
cout << x << ' ';
}
} | a.cc: In function 'vl solve(ll)':
a.cc:128:30: error: expected ';' before ':' token
128 | assert(ret.size() <= 200):
| ^
a.cc:130:1: warning: control reaches end of non-void function [-Wreturn-type]
130 | }
| ^
|
s085454848 | p03769 | C++ | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = LLONG_MAX;//10^18 = 2^60
//const int INF = 1 << 30;//10^9
const ll INF = INFL;
//ll MOD = 1000000007;
ll MOD = 998244353;
vector<ll> dy = {0, -1, 0, 1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};
void pres(double A, ll x = 10){cout << fixed << setprecision(x) << A << endl;}
//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll get_bit(ll x){return __builtin_popcountll(x);}
ll pow_long(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2) res *= x;
x *= x;
k /= 2;
}
return res;
}
ll pow_mod(ll x, ll k){
ll res = 1;
while(k > 0){
if(k % 2){
res *= x; res %= MOD;
}
x *= x; x %= MOD;
k /= 2;
}
return res;
}
ll inverse(ll x){return pow_mod(x, MOD - 2);};
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll x, ll y){return x / gcd(x, y) * y;};
ll kai_mod(ll x){
if(x == 0) return 1;
return x * kai_mod(x-1) % MOD;
}
//約数の列挙O(√n)
vector<ll> divisor(ll n){
vector<ll> res(0);
for(ll i = 1; i * i <= n; i++){
if(n % i == 0){
res.push_back(i);
if(i != n/i) res.push_back(n/i);
}
}
sort(res.begin(), res.end());
return res;
}
//素因数列挙
vector<ll> MakePrimeList(ll x) {
vector<ll> res;
for(ll k=2; k*k<=x; k++) {
if(x % k == 0) {
res.pb(k);
while(x % k == 0) x /= k;
}
}
if(x > 1) res.push_back(x);
return res;
}
//コンビネーション
const int MAXcomb = 100010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAXcomb; i++){
fac[i] = fac[i-1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
ll comb(int n, int k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
ll disit(ll x, ll d = 10){
ll res = 0;
while(x){
res++;
x /= d;
}
return res;
}
ll Cnt(ll D, vector<pair<ll, ll>> X){
D *= 2;
sort(X.begin(), X.end());
ll last = -INFL;
ll res = 0LL;
rep(i, X.size()){
if(X[i].f < last){
X[i].f = last;
}
if(X[i].s < X[i].f) continue;
res += (X[i].s - X[i].f) / D + 1;
last = max(last, X[i].s + D);
}
return res;
}
void solve(){
ll N;
cin >> N;
if(N == 2){
cout << 4 << endl;
cout << 1 << " " << 2 << " " << 1 << " " << 2 << endl;
return;
}
ll len = 0;
ll ok = 1;
while(pow_long(2, ok+1) - 1 <= N) ok++;
ok++;
vector<vector<ll>> ans(ok + 1);
rep(i, ok) ans[i + 1].pb(1);
len += ok * 1;
N -= pow_long(2, ok-1) - 1;
ll now = 2;
while(N){
ans[0].pb(now);
ll dec = 1;
while(pow_long(2, dec + 1) - 1 <= N) dec++;
dec++;
N -= pow_long(2, dec-1) - 1;
ans[ok-dec].pb(now);
now++;
len += 2;
}
cout << len << endl;
rep(i, ok+1){
rep(j, ans[i].size()){
cout << ans[i][j] << " ";
}
}
cout << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| a.cc:38:17: error: 'LLONG_MAX' was not declared in this scope
38 | const ll INFL = LLONG_MAX;//10^18 = 2^60
| ^~~~~~~~~
a.cc:16:1: note: 'LLONG_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
15 | #include <iomanip>
+++ |+#include <climits>
16 | using namespace std;
|
s932172742 | p03769 | C++ | #include <bits/stdc++.h>
using namespace std;
int p[202], q[202], cnt;
long long n;
void solve(long long n){
if (!n) return;
if (~n & 1)
q[++q[0]] = cnt++, solve(n - 1);
else
p[++p[0]] = cnt++, solve(n >> 1);
}
int main(){
scanf("%lld", &n), solve(v), printf("%d\n", cnt + 100);
for (int i = 1; i <= q[0]; ++i) printf("%d ", cnt - q[i]);
for (int i = p[0]; i; --i) printf("%d ", cnt - p[i]);
for (int i = 1; i <= 100; ++i) printf("%d ", i);
return 0;
}
| a.cc: In function 'int main()':
a.cc:16:34: error: 'v' was not declared in this scope
16 | scanf("%lld", &n), solve(v), printf("%d\n", cnt + 100);
| ^
|
s979415806 | p03769 | C++ | #include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
using namespace std;
typedef long long ll;
#ifdef iq
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
int main() {
#ifdef iq
freopen("a.in", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
ll k;
cin >> k;
k++;
function<vector<int>(ll)> solve = [&] (ll k) {
if (k == 1) {
return vector<int>{};
} else if (k % 2 == 0) {
auto a = solve(k / 2);
int ids = a.size();
a.push_back(ids);
return a;
} else {
auto a = solve(k - 1);
int ids = a.size();
a.insert(a.begin(), ids);
return a;
}
};
auto ok = solve(k);
cout << 2 * ok.size() << '\n';
for (int i = 0; i < (int) ok.size(); i++) cout << i + 1 << ' ';
for (int x : ok) cout << x + 1 << ' ';
cout << '\n';
}
| a.cc: In function 'int main()':
a.cc:42:3: error: 'function' was not declared in this scope
42 | function<vector<int>(ll)> solve = [&] (ll k) {
| ^~~~~~~~
a.cc:22:1: note: 'std::function' is defined in header '<functional>'; this is probably fixable by adding '#include <functional>'
21 | #include <cstring>
+++ |+#include <functional>
22 |
a.cc:42:23: error: expected primary-expression before '(' token
42 | function<vector<int>(ll)> solve = [&] (ll k) {
| ^
a.cc:42:26: error: expected primary-expression before ')' token
42 | function<vector<int>(ll)> solve = [&] (ll k) {
| ^
a.cc:42:29: error: 'solve' was not declared in this scope
42 | function<vector<int>(ll)> solve = [&] (ll k) {
| ^~~~~
|
s526320231 | p03769 | C++ | #include<iostream>
using namespace std;
long long N,M;
int i,j;
long long a[105];
long long b[105];
void solver(long long n){
if(n==1){
I ++;
b[I] = M--;
return ;
}
if(n&1) {
i++;
b[i]=M--;
solver(n>>=1);
}
else{
j++;
a[j]=M--;
solver(n-1);
}
}
int main()
{
long long N;
cin>>N;
M=100;
solver(N);
cout<<2*(i+j)<<endl;
for(int m=1;m<=j;m++){
cout<<a[m]<<" ";
}
for(int m=i;m>=1;m--){
cout<<b[m]<<" ";
}
for(int m=101-i-j;m<=100;m++){
cout<<m<<" ";
}
return 0;
}
| a.cc: In function 'void solver(long long int)':
a.cc:12:17: error: 'I' was not declared in this scope
12 | I ++;
| ^
|
s462624577 | p03769 | C++ | #include <iostream>
#include<stdio.h>
using namespace std;
int a[102];
int b[102];
int main()
{
long long n;
int p1 = 0, p2 = 0, m = 100;
scanf_s("%lld", &n);
n++;
while (n > 1)
{
if (n & 1)
{
a[++p1] = m--;
n--;
}
else
{
b[++p2] = m--;
n >>= 1;
}
}
printf("%d\n", p1 + p2 << 1);
for (int i = 1; i <= p1; i++)
printf("%d ", a[i]);
for (int i = p2; i >= 1; i--)
printf("%d ", b[i]);
for (int i = 101 - p1 - p2; i <= 100; ++i)
printf("%d ", i);
return 0;
}
| a.cc: In function 'int main()':
a.cc:10:9: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
10 | scanf_s("%lld", &n);
| ^~~~~~~
| scanf
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.