/in/foo.cc: In member function 'void Seg_tree::Insert(int&, int, int, int, int)':
/in/foo.cc:18:201: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
inline void Insert(int &root,int l,int r,int x,int num){if (l>r||l>x||r<x) return;if (!root) root=++cnt;if (l==r&&l==x){tree[root].sum+=num;tree[root].lg=(double)num*(double)log(x);return;}int Mid=l+r>>1;if (x<=Mid) Insert(tree[root].l,l,Mid,x,num);else Insert(tree[root].r,Mid+1,r,x,num);updata(root);}
~^~
/in/foo.cc: In member function 'int Seg_tree::del(int&, int, int, int, int)':
/in/foo.cc:20:146: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
inline int del(int &root,int l,int r,int ql,int qr){if (l>qr||r<ql||l>r) return 0;if (l==r) {tree[root].lg=tree[root].sum=0;return 0;}int Mid=l+r>>1;return del(tree[root].l,l,Mid,ql,qr)+del(tree[root].r,Mid+1,r,ql,qr);updata(root);}
~^~
/in/foo.cc: In member function 'int Seg_tree::rank(int, int, int, int)':
/in/foo.cc:21:75: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
inline int rank(int root,int l,int r,int x){if (l==r) return l;int Mid=l+r>>1;if (x<=tree[tree[root].l].sum) return rank(tree[root].l,l,Mid,x);else return (tree[root].r,Mid+1,r,x-tree[tree[root].l].sum);}
~^~
/in/foo.cc:21:170: warning: left operand of comma operator has no effect [-Wunused-value]
inline int rank(int root,int l,int r,int x){if (l==r) return l;int Mid=l+r>>1;if (x<=tree[tree[root].l].sum) return rank(tree[root].l,l,Mid,x);else return (tree[root].r,Mid+1,r,x-tree[tree[root].l].sum);}
~~~~~~~~~~~^
/in/foo.cc:21:175: warning: right operand of comma operator has no effect [-Wunused-value]
inline int rank(int root,int l,int r,int x){if (l==r) return l;int Mid=l+r>>1;if (x<=tree[tree[root].l].sum) return rank(tree[root].l,l,Mid,x);else return (tree[root].r,Mid+1,r,x-tree[tree[root].l].sum);}
~~~^~
/in/foo.cc:21:201: warning: right operand of comma operator has no effect [-Wunused-value]
inline int rank(int root,int l,int r,int x){if (l==r) return l;int Mid=l+r>>1;if (x<=tree[tree[root].l].sum) return rank(tree[root].l,l,Mid,x);else return (tree[root].r,Mid+1,r,x-tree[tree[root].l].sum);}
^~~
ValueError("invalid literal for int() with base 10: '1.in|1.out|20|5|165888\\n'",)