Codeforces Round #226 (Div. 2) 题解

最新推荐文章于 2021-10-09 14:58:20 发布
最新推荐文章于 2021-10-09 14:58:20 发布
阅读量590 收藏
点赞数
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/u013559351/article/details/18777019
版权

总体感觉比以往的only div2简单点

A. Bear and Raspberry

签到题，求的是 max (x [ i ] - x [ i + 1 ]) - m    1 <= i < n

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define PB              push_back
#define SIZE(x)         (int)x.size()
#define clr(x,y)        memset(x,y,sizeof(x))
#define MP(x,y)         make_pair(x,y)
#define RS(n)           scanf ("%s", n)
#define ALL(t)          (t).begin(),(t).end()
#define FOR(i,n,m)      for (int i = n; i <= m; i ++)
#define ROF(i,n,m)      for (int i = n; i >= m; i --)
#define IT              iterator
#define FF              first
#define SS              second

typedef long long               ll;
typedef unsigned int            uint;
typedef unsigned long long      ull;
typedef vector<int>             vint;
typedef vector<string>          vstring;
typedef pair<int, int>          PII;

void RI (int& x){
        x = 0;
        char c = getchar ();
        while (!(c>='0' && c<='9' || c=='-'))     c = getchar ();
        bool flag = 1;
        if (c == '-'){
                flag = 0;
                c = getchar ();
        }
        while (c >= '0' && c <= '9'){
                x = x * 10 + c - '0';
                c = getchar ();
        }
        if (!flag)      x = -x;
}
void RII (int& x, int& y){RI (x), RI (y);}
void RIII (int& x, int& y, int& z){RI (x), RI (y), RI (z);}
void RC (char& c){
        c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
}
char RC (){
        char c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
        return c;
}

/**************************************END define***************************************/

const ll mod = 1e9+7;
const ll LINF = 1e18;
const int INF = 1e9;
const double EPS = 1e-8;

int main (){
        int n, m;
        cin >> n >> m;
        vint vec;
        FOR (i, 1, n){
                int t;
                cin >> t;
                vec.PB (t);
        }
        int maxx = 0;
        FOR (i, 1, SIZE (vec) - 1){
                maxx = max (maxx, (vec[i-1] - vec[i]));
        }
        maxx -= m;
        cout << max (maxx, 0) << endl;
}

B. Bear and Strings

长度为5000的字符串，求有多少对i, j 使得s (i, j)子串存在“bear" 

由于字符串只有5000，直接n^2暴力就好，不过应该有更高效的做法，没多作考虑

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define PB              push_back
#define SIZE(x)         (int)x.size()
#define clr(x,y)        memset(x,y,sizeof(x))
#define MP(x,y)         make_pair(x,y)
#define RS(n)           scanf ("%s", n)
#define ALL(t)          (t).begin(),(t).end()
#define FOR(i,n,m)      for (int i = n; i <= m; i ++)
#define ROF(i,n,m)      for (int i = n; i >= m; i --)
#define IT              iterator
#define FF              first
#define SS              second

typedef long long               ll;
typedef unsigned int            uint;
typedef unsigned long long      ull;
typedef vector<int>             vint;
typedef vector<string>          vstring;
typedef pair<int, int>          PII;

void RI (int& x){
        x = 0;
        char c = getchar ();
        while (!(c>='0' && c<='9' || c=='-'))     c = getchar ();
        bool flag = 1;
        if (c == '-'){
                flag = 0;
                c = getchar ();
        }
        while (c >= '0' && c <= '9'){
                x = x * 10 + c - '0';
                c = getchar ();
        }
        if (!flag)      x = -x;
}
void RII (int& x, int& y){RI (x), RI (y);}
void RIII (int& x, int& y, int& z){RI (x), RI (y), RI (z);}
void RC (char& c){
        c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
}
char RC (){
        char c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
        return c;
}

/**************************************END define***************************************/

const ll mod = 1e9+7;
const ll LINF = 1e18;
const int INF = 1e9;
const double EPS = 1e-8;

int main (){
        string s;
        cin >> s;
        int ans = 0;
        FOR (i, 0, SIZE (s) - 1){
                FOR (j, i, SIZE (s) - 4){
                        if (s[j]=='b' && s[j+1]=='e' && s[j+2]=='a' && s[j+3]=='r'){
                                ans += SIZE (s) - j - 3;
                                break;
                        }
                }
        }
        cout << ans << endl;
}

C. Bear and Prime Numbers

感谢cf的服务器这么叼，10^7再乘个log都过了，就是利用筛法求素数的过程预处理

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define PB              push_back
#define SIZE(x)         (int)x.size()
#define clr(x,y)        memset(x,y,sizeof(x))
#define MP(x,y)         make_pair(x,y)
#define RS(n)           scanf ("%s", n)
#define ALL(t)          (t).begin(),(t).end()
#define FOR(i,n,m)      for (int i = n; i <= m; i ++)
#define ROF(i,n,m)      for (int i = n; i >= m; i --)
#define IT              iterator
#define FF              first
#define SS              second

typedef long long               ll;
typedef unsigned int            uint;
typedef unsigned long long      ull;
typedef vector<int>             vint;
typedef vector<string>          vstring;
typedef pair<int, int>          PII;

void RI (int& x){
        x = 0;
        char c = getchar ();
        while (!(c>='0' && c<='9' || c=='-'))     c = getchar ();
        bool flag = 1;
        if (c == '-'){
                flag = 0;
                c = getchar ();
        }
        while (c >= '0' && c <= '9'){
                x = x * 10 + c - '0';
                c = getchar ();
        }
        if (!flag)      x = -x;
}
void RII (int& x, int& y){RI (x), RI (y);}
void RIII (int& x, int& y, int& z){RI (x), RI (y), RI (z);}
void RC (char& c){
        c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
}
char RC (){
        char c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
        return c;
}

/**************************************END define***************************************/

const ll mod = 1e9+7;
const ll LINF = 1e18;
const int INF = 1e9;
const double EPS = 1e-8;

int a[10000005];
bool pr[10000005];
int ans[10000005];

int main (){
        int n;
        cin >> n;
        FOR (i, 1, n){
                int t;
                cin >> t;
                a[t] ++;
        }
        FOR (i, 2, 10000000){
                if (pr[i] == 0){
                        ans[i] += a[i];
                        for (int j = 2; i * j <= 10000000; j ++){
                                pr[i*j] = true;
                                ans[i] += a[i*j];
                        }
                }
        }
        FOR (i, 2, 10000000){
                ans[i] += ans[i-1];
        }
        int q;
        cin >> q;
        while (q --){
                int l, r;
                cin >> l >> r;
                l = min (l, 10000000);
                r = min (r, 10000000);
                cout << ans[r] - ans[l-1] << endl;
        }
}

D. Bear and Floodlight

状压dp 

dp[1<<n]  ,  dp[ i ] 表示状态为 i 时能走到的最大x坐标，中间算坐标时用正弦定理简单推一下就行了

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define PB              push_back
#define SIZE(x)         (int)x.size()
#define clr(x,y)        memset(x,y,sizeof(x))
#define MP(x,y)         make_pair(x,y)
#define RS(n)           scanf ("%s", n)
#define ALL(t)          (t).begin(),(t).end()
#define FOR(i,n,m)      for (int i = n; i <= m; i ++)
#define ROF(i,n,m)      for (int i = n; i >= m; i --)
#define IT              iterator
#define FF              first
#define SS              second

typedef long long               ll;
typedef unsigned int            uint;
typedef unsigned long long      ull;
typedef vector<int>             vint;
typedef vector<string>          vstring;
typedef pair<int, int>          PII;

void RI (int& x){
        x = 0;
        char c = getchar ();
        while (!(c>='0' && c<='9' || c=='-'))     c = getchar ();
        bool flag = 1;
        if (c == '-'){
                flag = 0;
                c = getchar ();
        }
        while (c >= '0' && c <= '9'){
                x = x * 10 + c - '0';
                c = getchar ();
        }
        if (!flag)      x = -x;
}
void RII (int& x, int& y){RI (x), RI (y);}
void RIII (int& x, int& y, int& z){RI (x), RI (y), RI (z);}
void RC (char& c){
        c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
}
char RC (){
        char c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
        return c;
}

/**************************************END define***************************************/

const ll mod = 1e9+7;
const ll LINF = 1e18;
const int INF = 1e9;
const double EPS = 1e-8;

const double PI = acos (-1.0);

double dp[1<<20];
bool vis[1<<20];

struct Point {
        double x, y, angle;
        friend double dist (const Point& a, const Point& b){
                return sqrt ((a.x-b.x) * (a.x-b.x) + (a.y-b.y) * (a.y-b.y));
        }
        Point (double a, double b, double c):x(a), y(b), angle (c){}
};

void init (){
        clr (vis, 0);
        FOR (i, 0, (1<<20) - 1){
                dp[i] = -LINF;
        }
}

double cal (Point po, double x){
        double d1 = dist (po, Point (x, 0, 0));
        double ang1 = acos ((po.x - x) / d1);
        double ang2 = PI - ang1 - po.angle;
        if (ang2 <= 0)  return INF;
        return d1 * sin (po.angle) / sin (ang2) + x;
}

int main (){
        //freopen ("1.txt", "r", stdin);
        init ();
        int n;
        double l, r;
        cin >> n >> l >> r;
        vector<Point> vec;
        FOR (i, 1, n){
                double x, y, angle;
                cin >> x >> y >> angle;
                angle = PI * angle / 180.0;
                vec.PB (Point (x, y, angle));
        }
        queue<int> q;
        FOR (i, 0, n-1){
                dp[1<<i] = cal (vec[i], l);
                //cout << dp[1<<i][i] << endl;
                q.push (1<<i);
                vis[1<<i] = true;
        }
        while (SIZE (q)){
                int tx = q.front ();
                q.pop ();
                vis[tx] = false;
                FOR (i, 0, n-1){
                        if (!((1<<i) & tx)){
                                int sx = tx | (1<<i);
                                double t = cal (vec[i], dp[tx]);
                                if (t > dp[sx]){
                                        dp[sx] = t;
                                        if (!vis[sx]){
                                                vis[sx] = true;
                                                q.push (sx);
                                        }
                                }
                        }
                }
        }
        double maxx = dp[(1<<n) - 1];
        maxx = min (maxx, r);
        printf("%.12f\n", maxx - l);
}

E. Bear in the Field

矩阵快速幂，根据题意构造递推式

Sx[n] = Sx[n-1] + dx[n-1]

Sy[n] = Sy[n-1] + dy[n-1]

dx[n] = dx[n-1] + Sx[n] + Sy[n] + n - 1

dy[n] = dy[n-1] + Sx[n] + Sy[n] + n - 1

整理一下有

Sx[n] = Sx[n-1] + dx[n-1]

Sy[n] = Sy[n-1] + dy[n-1]

dx[n] = 2*dx[n-1] + dy[n-1] + Sx[n-1] + Sy[n-1] + n - 1

dy[n] = dx[n-1] + 2*dy[n-1] + Sx[n-1] + Sy[n-1] + n - 1

这样就变成了n和n-1的关系，可以用矩阵递推。

根据上面的递推式构造矩阵就可以，这步就不解释了


#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define PB              push_back
#define SIZE(x)         (int)x.size()
#define clr(x,y)        memset(x,y,sizeof(x))
#define MP(x,y)         make_pair(x,y)
#define RS(n)           scanf ("%s", n)
#define ALL(t)          (t).begin(),(t).end()
#define FOR(i,n,m)      for (int i = n; i <= m; i ++)
#define ROF(i,n,m)      for (int i = n; i >= m; i --)
#define IT              iterator
#define FF              first
#define SS              second

typedef long long               ll;
typedef unsigned int            uint;
typedef unsigned long long      ull;
typedef vector<int>             vint;
typedef vector<string>          vstring;
typedef pair<int, int>          PII;

void RI (int& x){
        x = 0;
        char c = getchar ();
        while (!(c>='0' && c<='9' || c=='-'))     c = getchar ();
        bool flag = 1;
        if (c == '-'){
                flag = 0;
                c = getchar ();
        }
        while (c >= '0' && c <= '9'){
                x = x * 10 + c - '0';
                c = getchar ();
        }
        if (!flag)      x = -x;
}
void RII (int& x, int& y){RI (x), RI (y);}
void RIII (int& x, int& y, int& z){RI (x), RI (y), RI (z);}
void RC (char& c){
        c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
}
char RC (){
        char c = getchar ();
        while (c == ' '||c == '\n')     c = getchar ();
        return c;
}

/**************************************END define***************************************/

const ll LINF = 1e18;
const int INF = 1e9;
const double EPS = 1e-8;

ll mod;

ll a[6][6] = {
        1, 0, 1, 1, 0, 0,
        0, 1, 1, 1, 0, 0,
        1, 0, 2, 1, 0, 0,
        0, 1, 1, 2, 0, 0,
        0, 0, 1, 1, 1, 0,
        0, 0, 0, 0, 1, 1
};

struct Mat {
        ll t[6][6];
        Mat () {
                clr (t, 0);
        }
        void initUnit (){
                FOR (i, 0, 5){
                        FOR (j, 0, 5){
                                t[i][j] = (i==j ? 1 : 0);
                        }
                }
        }
        void modul (){
                FOR (i, 0, 5){
                        FOR (j, 0, 5){
                                t[i][j] = (t[i][j]%mod + mod - 1) % mod + 1;
                        }
                }
        }
        friend Mat operator * (const Mat& x, const Mat& y){
                Mat t;
                FOR (i, 0, 5){
                        FOR (j, 0, 5){
                                FOR (k, 0, 5){
                                        t.t[i][j] += x.t[i][k] * y.t[k][j];
                                }
                        }
                }
                t.modul ();
                return t;
        }
        friend Mat operator ^ (Mat x, ll n){
                Mat ans;
                ans.initUnit ();
                while (n){
                        if (n & 1){
                                ans = ans * x;
                        }
                        x = x * x;
                        n >>= 1;
                }
                return ans;
        }
};

int main (){
        //freopen ("1.txt", "r", stdin);
        cin >> mod;                    
        ll sx, sy, dx, dy, t;
        cin >> sx >> sy >> dx >> dy >> t;
        dx += (sx + sy);
        dy += (sx + sy);
        dx = (dx%mod + mod - 1) % mod + 1;
        dy = (dy%mod + mod - 1) % mod + 1;
        vector<ll> vec;
        vec.PB (sx), vec.PB (sy), vec.PB (dx), vec.PB (dy);
        vec.PB (1), vec.PB (1);
        Mat x;
        FOR (i, 0, 5){
                FOR (j, 0, 5){
                        x.t[i][j] = a[i][j];
                }
        }
        x = x ^ t;
        ll ax = 0LL, ay = 0LL;
        FOR (k, 0, 5){
                ax += vec[k] * x.t[k][0];
                ax %= mod;
        }
        FOR (k, 0, 5){
                ay += vec[k] * x.t[k][1];
                ay %= mod;
        }
        ax = (ax+mod-1) % mod + 1;
        ay = (ay+mod-1) % mod + 1;
        cout << ax << " " << ay << endl;
}



__newSolar
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Codeforces Round #277 (Div. 2) 题解
码代码的猿猿
11-13 1770
Codeforces Round #277 (Div. 2) A. Calculating Function time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outp
Codeforces Round #262 (Div. 2) 题解
u010084308的专栏
08-22 1710
Codeforces Round #262 (Div. 2) 题解
Codeforces Round #659 (Div. 2)A-D题解
StandNotAlone的博客
07-27 9539
Codeforces Round #659 (Div. 2)A-D题解 //打牛客多校去了，CD晚点施工 //写于rating值2032/2056 这一场cf是补的，题目分布并没有按照往常的难度梯度递增。 这场是同时有div1和div2，对于div2的人来说这场如果策略得到及时跟过题人数多的题去写C的话是个上分的好机会。 A题难度为一般div2场的B B1B2题难度为一般div2场的DE CD难度对应一般div2场的DE Codeforces Round #659 (Div. 2) A题难度系数1200 一
Codeforces Round #747 (Div. 2)
万伏小太阳
10-09 248
Codeforces Round #747 (Div. 2) 这一场下班，下早了，C思路在一个分类的地方错了，写了个假算法，一直WA然后两题就下班了，这一场难度相对以前的Div2难度小一点吧，主要还是我反应太慢了，每次把问题复杂化，每次div2就只能过两题，真的很菜。以后争取CF都写一个题解总结一下。 A 给你一个n，要你求出两个数分别是 l,rl,rl,r,使得 $ l,l+1,l+2,l+3…,r-2,r-1,r$ 的和等于 n 一开始总在算前n项和，浪费好几分钟时间，最后发现根本解不出两个未知数的方
CF1438 C. Engineer Artem
萧瑟的博客
11-14 214
Artem is building a new robot. He has a matrix a consisting of n rows and m columns. The cell located on the i-th row from the top and the j-th column from the left has a value ai,j written in it. If two adjacent cells contain the same value, the robot wil
Codeforces Round #682 (Div. 2)题解
qq_43544481的博客
11-14 393
A. Specific Tastes of Andre 题解：全输出一样的数即可 代码： /* * @Author : Nightmare */ #include <bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define PII pair<int,int> #define ls 2 * rt #define rs 2 * rt + 1 #defi
Codeforces Round #682 (Div. 2)总结
JdiLfc的博客
11-14 304
A. Specific Tastes of Andre   这个挺简单的，就输出1就行了 #include<bits/stdc++.h> using namespace std; int main() { int t; cin>>t; int a[10001]; while(t--) { int n; cin>>n; for(int i=0;i<n;i++) {
Codeforces Round #723 (Div. 2).md
10-13
Codeforces Round #723 (Div. 2).md
Codeforces Round #627 (Div. 3) B. Yet Another Palindrome Problem
01-03
就是把所有相等的数放到一个vector里，如果他出现大于2次，看最远的间距是否大于2即可，找到一个就可以 代码： #include #include #include #include #include #include #include #include #include #include #...
Codeforces Round #627 (Div. 3) C. Frog Jumps（思维）
01-20
传送门 题意： 开始位置在0，问能否跳到n+1位置 每步只能跳d 在1——n每个位置有方向，L,R，求d的最小值 思路： 只用找相邻两个R之间的最大值即可 代码： #include #include ...typedef long long l
Codeforces Round #628 (Div. 2)
01-03
给两两节点放一个数字（0~n-2 唯一） 给你一棵树，求所有任意两节点相连的路以外的路上的数字的最小值最小 思路 构造 若一个点连了三条边及以上，则这个点的边从最小值开始赋值。其他边从最大点开始赋值。 证明：一...
Codeforces Round #479 (Div. 3) E. Cyclic Components
01-03
E. Cyclic Components 题目链接-E. Cyclic Components 题目大意 给你nnn个点和mmm条边，求所构成图中单圈环的个数 ...并查集并查集并查集 很明显单圈环每个点的度都为222，所以我们可以用数组cnt[]记录每个点的度，...
codeforcesDIV2-A
陈颜的博客
01-29 5679
不知道为什么，回家之后codeforces就进不去，然后也报不了名，刚才本来准备上床玩手机了，突然看到有人在牛客交流群里发了题面，就读了一下题，A题还是挺简单的。 A. Display The Number time limit per test1 second memory limit per test256 megabytes inputstandard input outputsta...
codeforces #532（DIV2）
jiotenno的博客
01-15 219
好容易手速快了一场，数组开小继续王八绿。。。 A - Roman and Browser 看懂题意直接暴力。。 #include &lt;bits/stdc++.h&gt; using namespace std; typedef long long ll; const int inf=0x3f3f3f3f; const double epos=1e-8; int arr[109]; i...
Codeforces round#722 (Div.2)题解
tian246319的博客
05-25 526
Codeforces round#722 (Div.2)题解 A.Eshag Loves Big Arrays 题意就是说，给定一个长度为n的序列，可以选择一段区间，并且将其中的严格大于区间平均数的元素删掉，并计算出可以这样操作的最多次数。 我的思路是采用双指针的写法，先将数组元素从小大排序，然后，计算a[i] 和a[j]的平均值，如果a[j]>avg，则让j-1 否则让i+1。 #include<iostream> #include<algorithm> using name
codeforces 1200（div2）题解
xyyxyyx的博客
10-06 271
文章目录C题意key思路E题意key思路F题意key思路总结 C 题意 走廊有两部分构成：内圈和外圈。内圈有n(n≤1018)n(n≤10^{18})n(n≤1018)个部分组成，外圈有m(m≤1018)m(m≤10^{18})m(m≤1018)个部分组成。有墙在每个部分中阻隔。但是内圈和外圈之间没有墙。并且在走廊的12点钟方向始终有一堵墙。 现在，有个人想要知道从(sx,sy)(sx,sy)(s...
Codeforces Round #682 (Div. 2) ABC 题解
待到山花烂漫时
11-14 260
A. Specific Tastes of Andre 题意：构造一个长度为n且任意子串和整除其长度的序列。 思路：n个1就行。 view code #include<iostream> #include<string> #include<algorithm> #include<cstdio> #include<cstring> #include<cmath> #include<map> #include <queu
codeforces div2 C题思路训练【C题好难，我好菜】
weixin_30551947的博客
08-11 182
1017C The Phone Number: 构造数列使得LIS和LDS的和最小，定理已知LIS=L，LDS=n/L的向上取整，根据样例可以得到设置L=根号n，构造方法如样例 截断法构造，不用考虑边界： Show an example ofn=22: "' 19 20 21 22 15 16 17 18 11 12 13 14 7 8 9 10 3 4 5 6 1 2 "' 1 ...
Crypto_30_vHsm_Types.h
最新发布
07-09
Crypto_30_vHsm_Types
codeforces round #772 (div. 2)
03-16
好的，Codeforces Round #772 (Div. 2) 是一场由Codeforces主办的在线编程竞赛。 该比赛的比赛链接为：https://codeforces.com/contest/772。 该比赛分为两个级别：Div.1和Div.2。 Div. 1级别通常比Div. 2级别更...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值