Codeforces Gym 101608 - 2017 ACM Jordanian Collegiate Programming Contest

最新推荐文章于 2023-10-27 10:40:58 发布
最新推荐文章于 2023-10-27 10:40:58 发布
阅读量1.4k 收藏
点赞数
分类专栏： 日常训练
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/sinat_35406909/article/details/79145137
版权

A. Chrome Tabs
time limit per test
2.0 s
memory limit per test
256 MB
input
tabs.in
output
standard output

Before participating in any online contest, you only keep the tab of the online contest open and close everything else.

You have n open tabs, numbered from 1 to n from left to right. Tab number k is the tab of the online contest and it is the current selected one. You have only two buttons:

  • Close all tabs to the left of the selected tab.
  • Close all tabs to the right of the selected tab.

What is the minimum number of clicks needed to close all tabs except tab number k?

Input

The first line of input contains a single integer T (1 ≤ T ≤ 5050), the number of test cases.

Each test case consists of a single line that contains two space-separated integers n and k(1 ≤ k ≤ n ≤ 100), the number of open tabs, and the tab of the online contest, respectively.

Output

For each test case, print the minimum number of clicks needed to close all tabs except the tab of the online contest.

Example
input 
4
72 1
5 2
10 7
64 64
output 
1
2
2
1


水题

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=100005,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);

int main() {
	freopen("tabs.in","r",stdin);
	int cas;
	scanf("%d",&cas);
	while (cas--) {
		int n,k,pos,ans;
		scanf("%d%d",&n,&k);
		if (k==1||k==n) ans=1; else ans=2;
		if (k==1&&n==1) ans=0;
		printf("%d\n",ans);
	}
fclose(stdin);
	return 0;
}

B. OverCode
time limit per test
1.0 s
memory limit per test
256 MB
input
overcode.in
output
standard output

In a competitive coding contest called OverCode, matches are held between two teams. Each team must have exactly 6 coders. In order to form fair matches between coders, the absolute difference between the ratings of any two members of the same team shouldn't exceed 1000.

What is the maximum number of teams that can be formed out of n coders if you were given their ratings, such that each coder is a member of at most one team?

Input

The first line of input contains a single integer T (1 ≤ T ≤ 512), the number of test cases.

The first line of each test case contains a single integer n (1 ≤ n ≤ 500), the number of coders participating in OverCode.

The next line contains n space-separated integers r1, r2, ..., rn (1 ≤ ri ≤ 4000), ri is the rating of the ithcoder.

The total sum of n overall test cases doesn't exceed 1.5 × 105.

Output

For each test case, print the maximum number of teams that can be formed, on a single line.

Example
input 
3
5
4 1 5 3 2
6
1 1001 2 4 3 5
13
7 9 7 2 1000 1001 2 3 9 4 5 2 5
output 
0
1
2


排序之后贪心。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=505,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
int a[maxn];

int main() {
	freopen("overcode.in","r",stdin);
	int cas;
	scanf("%d",&cas);
	while (cas--) {
		int n,i,j,ans=0;
		scanf("%d",&n);
		for (i=1;i<=n;i++) scanf("%d",&a[i]);
		sort(a+1,a+n+1);
		int cnt=1;j=1;
		for (i=2;i<=n;i++) {
			if (abs(a[i]-a[j])>1000) {
				ans+=cnt/6;
				while (abs(a[i]-a[j])>1000) j++;
				cnt=i-j+1;
			} else {
				cnt++;
				if (cnt==6) ans++,cnt=0,j=i+1; 
			}
		}
		printf("%d\n",ans);
	}
	fclose(stdin);
	return 0;
}
C. A message for you!
time limit per test
3.0 s
memory limit per test
256 MB
input
scoreboard.in
output
standard output

You’re participating in the ACM JCPC for the first time. Your team solved k out of the 13 problems. Since your last successful submission, you have been trying to solve new problems with no luck.

After all the frustration from the wrong answers, you decided to quit. You raised your head looking for a volunteer, then noticed a big white screen with some red and green dashes. You put your glasses on and, it is a scoreboard! You didn't know this contest has a scoreboard! Now that you do, you noticed that some problems have been solved by many teams! You decided to focus and try to solve the problem that has been solved by the maximum number of teams.

Input

The first line of input contains a single integer T (1 ≤ T ≤ 53235), the number of test cases.

The first line of each test case contains a single integer k (1 ≤ k < 13), the number of problems your team successfully solved.

The second line contains a string of k distinct uppercase English letters that represent the problems your team solved. The letters are given in the alphabetical order. Each problem from 1 to 13 has a corresponding letter from 'A' to 'M'.

The third line contains 13 integers t1, t2, ..., t13 (0 ≤ ti ≤ 92), ti is the number of teams that solved problem the ith problem.

It is guaranteed that the input is valid, and there's at least one problem not solved by your team and solved by other teams.

Output

For each test case, print an uppercase letter that represents the next problem to be solved, which is the one that has been completed by the maximum number of teams.

It is guaranteed that the answer is unique.

Example
input 
3
2
CE
3 0 47 0 76 0 0 2 0 0 0 0 0
7
ADEFHLM
1 1 2 1 1 1 1 1 0 1 1 1 1
2
DG
35 14 40 13 11 18 1 7 41 29 8 19 43
output 
A
C
M




水题，模拟。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=55,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
int c[maxn];
char s[maxn];
bool a[maxn];

int main() {
	freopen("scoreboard.in","r",stdin);
	int cas;
	scanf("%d",&cas);
	while (cas--) {
		int n,i,ans;
		for (i=0;i<13;i++) a[i]=true;
		scanf("%d",&n);
		scanf("%s",s);
		for (i=0;i<n;i++) {
			a[s[i]-'A']=false;
		} 
		ans=-1;
		for (i=0;i<13;i++) {
			scanf("%d",&c[i]);
			if (a[i]) 
				if (ans==-1) ans=i; else 
					if (c[ans]<c[i]) ans=i;
		}
		printf("%c\n",(char)('A'+ans));
	}
	fclose(stdin);
	return 0;
}

D. Test Cases
time limit per test
2.0 s
memory limit per test
256 MB
input
cases.in
output
standard output

You want to prepare test cases for a problem with the following description:

"Given an array of n positive integers, and a number of queries. Each query will ask about a range [l, r](1 ≤ l ≤ r ≤ n), where each of the values between index l and index r (both inclusive) occurs an even number of times except one value. The answer to each query is the value that occurs an odd number of times in the given range."

You have generated an array of n positive integers, you need to know the number of valid queries you can ask on this array. A query is valid if it has an answer, and that answer is unique.

Input

The first line of input contains a single integer T (1 ≤ T ≤ 64), the number of test cases.

The first line of each test case contains a single integer n (1 ≤ n ≤ 5000), the size of the array.

The next line contains n space-separated integers, a1, a2, ..., an (1 ≤ ai ≤ 106), the values of the array.

The total sum of n overall test cases doesn't exceed 72000.

Output

For each test case, print a single line with the number of valid queries you can ask.

Example
input 
1
7
9 1 1 2 1 9 9
output 
12

暴力大法好，O(n^2)水过 

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=5005,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
int a[maxn],cnt[1000005];

int main() {
	freopen("cases.in","r",stdin);
	int cas;
	scanf("%d",&cas);
	mem0(cnt);
	while (cas--) {
		int n,i,j,ans=0,o,e;
		scanf("%d",&n);
		for (i=1;i<=n;i++) {
			scanf("%d",&a[i]);
		}
		for (i=1;i<=n;i++) {
			o=e=0;
			for (j=i;j<=n;j++) {
				cnt[a[j]]++;
				if (cnt[a[j]]==1) e++; else 
					if (cnt[a[j]]%2) e++,o--; else e--,o++;
				if (e==1) ans++;
			}
			for (j=i;j<=n;j++) cnt[a[j]]=0;
		}
		printf("%d\n",ans);
	}
	fclose(stdin);
	return 0;
}

G. WiFi Password
time limit per test
2.0 s
memory limit per test
256 MB
input
wifi.in
output
standard output

Just days before the JCPC, your internet service went down. You decided to continue your training at the ACM club at your university. Sadly, you discovered that they have changed the WiFi password. On the router, the following question was mentioned, the answer is the WiFi password padded with zeros as needed.

A subarray [l, r] of an array A is defined as a sequence of consecutive elements Al, Al + 1, ..., Ar, the length of such subarray is r - l + 1. The bitwise OR of the subarray is defined as: Al OR Al + 1 OR ... OR Ar, where OR is the bitwise OR operation (check the notes for details).

Given an array A of n positive integers and an integer v, find the maximum length of a subarray such that the bitwise OR of its elements is less than or equal to v.

Input

The first line contains an integer T (1 ≤ T ≤ 128), where T is the number of test cases.

The first line of each test case contains two space-separated integers n and v (1 ≤ n ≤ 105)(1 ≤ v ≤ 3 × 105).

The second line contains n space-separated integers A1, A2, ..., An (1 ≤ Ai ≤ 2 × 105), the elements of the array.

The sum of n overall test cases does not exceed 106.

Output

For each test case, if no subarray meets the requirement, print 0. Otherwise, print the maximum length of a subarray that meets the requirement.

Example
input 
3
5 8
1 4 5 3 1
5 10
8 2 6 1 10
4 2
9 4 5 8
output 
5
3
0
Note

To get the value of x OR y, consider both numbers in binary (padded with zeros to make their lengths equal), apply the OR operation on the corresponding bits, and return the result into decimal form. For example, the result of 10 OR 17 = 01010 OR 10001 = 11011 = 27.


把每个数都拆成二进制记录每一位"1"的最晚出现时间，每次把合法区间的右界向右移一格，左界跟着一起移动(如果这时区间的或和超过所给上界)，贪心的选择移动最少的方案。复杂度O(nlogn)。

贪心的依据是OR运算的单调不减性

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=100005,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
int a[maxn],last[25];

int main() {
	freopen("wifi.in","r",stdin);
	int cas;
	scanf("%d",&cas);
	while (cas--) {
		int n,i,k;
		scanf("%d%d",&n,&k);
		int u=k,p=0,div;
		while (u) {
			u/=2;
			p++;
		}
		div=p-1;
		for (i=0;i<=25;i++) last[i]=0;
		for (i=1;i<=n;i++) {
			scanf("%d",&a[i]);
		}
		int now=0,j=1,ans=0;
		for (i=1;i<=n;i++) {
			if (a[i]>k) {
				now=0;j=i+1;
				continue;
			}
			now=now|a[i];
			u=a[i],p=0;
			while (u) {
				if (u%2) last[p]=i;
				u/=2;
				p++;
			}
			if (now>k) 
		/*	if (last[div]!=i) {
				j=last[div]+1;
				now=0;
				for (int q=0;q<div;q++) {
					if (last[q]>=j) now=now|(1<<q);
				}
			} else */{
				int x=now,w=a[i],dig=inf;
				for (int q=0;q<=div;q++) {
					if (x%2==1&&w%2==0&&(now-(1<<q))<=k) {
						dig=min(dig,last[q]+1);
					}
					x/=2;w/=2;
				}
				if (dig==inf) dig=i;
				j=dig;
				now=0;
				for (int q=0;q<=div;q++) {
					if (last[q]>=j) now=now|(1<<q);
				}
			}
			ans=max(ans,i-j+1);
		}
		printf("%d\n",ans);
	}
	fclose(stdin);
	return 0;
}

M. Winning Cells
time limit per test
1.0 s
memory limit per test
256 MB
input
chess.in
output
standard output

You and your friend decided to play a new game using a squared chessboard of size n × n and one rook. Rows are numbered from 1 to n from top to bottom, and columns are numbered from 1 to n from left to right. Each cell is identified by a pair (r, c) which means that the cell is located at row r and column c.

The rules are simple, you and your friend will take turns, and you will start first. In each turn a player can move the rook at least 1 cell, and at most k cells in only one direction, either up or left, without going outside the chessboard. The player who moves the rook to the top-left cell (1, 1) wins.

You will choose the starting position for the rook. You are not allowed to choose the top-left cell. If you both will play optimally, how many cells can you choose as a starting position to win the game.

Input

The first line of input contains an single integer T (1 ≤ T ≤ 2 × 104), the number of test cases.

Each test case consists of a single line that contains two space-separated integers n and k(1 ≤ k < n ≤ 109), where n is the size of the chessboard, and k is the maximum allowed move.

Output

For each test case, print a single line that contains the number cells you can choose as a starting position to win the game.

Example
input 
3
2 1
3 1
9 4
output 
2
4
64



画图可以发现，对角线不行，对于n*n方阵相比(n-1)*(n-1)多出来的部分，横竖各每隔k个格子有一个不合法。由此可以推出公式。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);

int main() {
	freopen("chess.in","r",stdin);
	int cas;
	scanf("%d",&cas);
	while (cas--) {
		ll n,k,ans;
		scanf("%I64d%I64d",&n,&k);
		if (n==k+1) ans=n*n-n; else {
			ll m=(n-1)/(k+1);
			ll a=m*2+1;
			ans=n*n-(k+1)-(k+1)*(3+a)*m/2;
			if (n%(k+1)!=0) 
				ans+=((k+1)-n%(k+1))*a;
		}
		printf("%I64d\n",ans);
	}
	fclose(stdin);
	return 0;
}

Gym - 101608G （尺取）
now_ing的博客
04-25 362
https://vjudge.net/contest/208695#problem/G Just days before the JCPC, your internet service went down. You decided to continue your training at the ACM club at your university. Sadly, you discov...
Codeforces Gym 101466 - 2017 ACM-ICPC, Universidad Nacional de Colombia Programming Contest
J. Cole
01-22 1782
A. Gaby And Addition time limit per test 6.0 s memory limit per test 1024 MB input standard input output standard output Gaby is a little baby who loves playing with num
2017 ACM Jordanian Collegiate Programming Contest
weixin_33910137的博客
11-17 173
A. Chrome Tabs 当$n=1$时答案为$0$，当$k=1$或$k=n$时答案为$1$，否则答案为$2$。 #include&lt;cstdio&gt; int T,n,k; int main(){ freopen("tabs.in","r",stdin); scanf("%d",&amp;T); while(T--){ scanf("%d%d",&amp;
Gym - 101608D（区间问题）
Fusheng_Yizhao的博客
02-11 633
You want to prepare test cases for a problem with the following description: "Given an array of n positive integers, and a number of queries. Each query will ask about a range [l, r] (1 ≤ l ≤ r ≤ n),...
Codeforces Gym 101608 G WiFi Password（尺取/二分+ST表 ）
记录一些思考的过程。
03-25 434
G. WiFi Passwordtime limit per test  2.0 smemory limit per test  256 MBinput  wifi.inoutput  standard outputJust days before the JCPC, your internet service went down. You decided to continue your tra...
2017 ACM Jordanian Collegiate Programming Contest I(Counting Votes-特征值)
nike0good |Oier&ACMer | 熟能生巧
11-16 646
在一个n*m的白板上有若干8联通联通块，每块必须是字母(H,M,Y) 中的一个，统计白板上各字母出现次数。注意各字母字体相同. 记录特征值。#include<bits/stdc++.h> using namespace std; #define For(i,n) for(int i=1;i<=n;i++) #define Fork(i,k,n) for(int i=k;i<=n;i++) #def
【Codeforces】2015-2016 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2015) E 线段树+离散化
ZZZZone的博客
08-01 798
题目链接：https://vjudge.net/contest/175173#problem/E 题目大意： 给你n 个区间段l[i], r[i]   0 (1 解题思路：  这道题就是给你n个区间段， 让你选择尽可能多的段使得任意区间不重叠的加强版。  所以首先我们会吧区间段按照r排序，r相同l大的靠前， 因为r越小， 给后面其他段腾出来的时间就越长， 当r相同时， l越大
Codeforces 185A - Plant 全测试点49个
08-13
Codeforces 185A - Plant 全测试点49个 Codeforces 是一个在线编程平台，提供了大量的编程题目和比赛。其中，185A - Plant 是一个经典的题目，要求编写一个程序来解决植物生长的问题。 在这个题目中，输入是一个...
2019-2020 ACM-ICPC Brazil Subregional Programming Contest 题解
过路人丶的博客
10-30 2216
题目链接:http://codeforces.com/gym/102346 A.Artwork 将相交的圆用并查集合并，最后查询一下是否有一个或者两个在一个并查集里面的圆形成这样的一个封闭 #include <bits/stdc++.h> #define x first #define y second #define mid (l+r>>1) #def...
2019-2020 Saint-Petersburg Open High School Programming Contest 8/11
BPM136(BPMThor)
11-17 650
A 解个方程，就a=b+ca = b + ca=b+c和s−a=s−b=s−cs - a = s - b = s - cs−a=s−b=s−c sss是最后做完操作的每个数，aaa是最小的那个数要补多少，然后接这个方程就行。 #include <iostream> #include <algorithm> int main () { int a[3]; std::c...
Gym101608L Knights(dp)
hnust_Derker的博客
04-19 256
题目链接 题意： &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;\ \ \ \ \ \ 一个n∗mn∗mn * m的网格， 网格每一行都有一个骑士，现在骑士要移动到安全的地方，即网格中字符为′.′′.′'.'的地方，每个骑士必须要移动，原来骑士所在的位置也是不安全的位置，问共有多少种方案让骑士移动...
Gym101608K Running Threads（有界最小费用流）
hnust_Derker的博客
04-17 240
题源 题意： &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;\ \ \ \ \ \ 有kkk个程序分配了若干个线程任务，每个程序完成一定的线程时会打印出任务进度，任务不会超过一次被执行而且属于同一个程序的任务进度一定是严格递增的，现在kkk个程序打印出nnn个任务进度，问最少/最多还有多少线程任务...
A - Chrome Tabs Gym - 101608A B - OverCode Gym - 101608B C - A message for you! Gym - 10160 【简单题 】
Mercury_Lc的博客
03-06 342
A - Chrome Tabs Gym - 101608A &amp;：之所以整理是因为自己傻到WA了好多次。 #include &lt;bits/stdc++.h&gt; using namespace std; typedef long long ll; int main() { int t; int k,n; freopen("tabs.in","r",...
0x3f3f3f3f是什么意思
Selfishness_x的博客
01-13 2127
补充上课没好好听到的点
0x3f~0x3f3f3f3f的来龙去脉（详解）
最新发布
wenhaoyan的博客
10-27 4812
0x3f~0x3f3f3f3f的来龙去脉
0x3f3f3f3f 和0x3f3f3f3f3f3f3f3f
z_zssss的博客
04-10 189
对于一些变量的初始化，我们希望它足够大，但是却又不希望它稍微变换一下就超出了数据范围，因此我们巧妙的用一个接近数据最大值的一个值INF。若数据是long long16位则定义#define INF 0x3f3f3f3f3f3f3f3f大约是一个19位的值。若数据是int4位则定义#define INF 0x3f3f3f3f 大约是一个略大于1000000000的值。
0x3F3F3F3F——算法比赛中的无穷大常量
Yannie's Blog
11-11 1536
在算法竞赛中，我们常常需要用到设置一个常量用来代表“无穷大”。 比如对于int类型的数，有的人会采用INT_MAX，即0x7fffffff作为无穷大。但是以INT_MAX为无穷大常常面临一个问题，即加一个其他的数会溢出。 而这种情况在动态规划，或者其他一些递推的算法中常常出现，很有可能导致算法出问题。 所以在算法竞赛中，我们常采用0x3f3f3f3f来作为无穷大。0x3f3f3f3f主要有如下好处： 0x3f3f3f3f的十进制为1061109567，和INT_MAX一个数量级，即10^9数量级，而一般场合
2017 ACM Amman Collegiate Programming Contest J - Spilt the String
Bule-Zst的博客
09-21 736
略略略
GYM 2017 ACM Amman Collegiate Programming Contest
zcc的博客
10-06 304
题目链接：点击打开链接 A题：水题，找出频率出现次数最多的且数值最小的数 #include #define cle(n) memset(n,0,sizeof(n)) typedef long long ll; const int maxn =1e6+10; using namespace std; int T,n,m; string s; int a[maxn];
SolveNext-Codeforces: 利用 CLI 排序 Codeforces 问题集
最后，文件名称列表中的"SolveNext-Codeforces-master"表明该工具的源代码托管在版本控制系统中，如Git。文件名中的"master"表明这是主分支（main branch），通常包含最新和最稳定的代码版本。用户可以通过下载...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值