SRM 531 div1 600/300 div2 950

最新推荐文章于 2017-04-13 20:00:36 发布
最新推荐文章于 2017-04-13 20:00:36 发布
阅读量1k 收藏
点赞数
分类专栏： 图论 文章标签： div string vector path ini iterator
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/waitfor_/article/details/8044432
版权

600是比较好的图论

// BEGIN CUT HERE

// END CUT HERE
#line 5 "MonsterFarm.cpp"
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;

typedef long long ll;

class MonsterFarm
{
    public:
    int numMonsters(vector <string> transforms){
        const int Mod=1000000007;
        int g[51][51],d[51],path[51][51];
        int len,i,j,k;
        int n=transforms.size();
        memset(g,0,sizeof(g));
        memset(d,0,sizeof(d));
        memset(path,0,sizeof(path));
        for(i=0;i<n;i++){
            len=transforms[i].size();
            int tem=0;
            for(j=0;j<len;j++){
                if(transforms[i][j]==' '){
                    d[i]++;
                    g[i][tem-1]++;
                    path[i][tem-1]=1;
                    tem=0;
                    continue;
                }
                tem=tem*10+transforms[i][j]-'0';
            }
            d[i]++;
            g[i][tem-1]++;
            path[i][tem-1]=1;
        }
        for(k=0;k<n;k++)
            for(i=0;i<n;i++)
                for(j=0;j<n;j++)
                    path[i][j]=(path[i][j] || (path[i][k] && path[k][j]));
        for(i=0;i<n;i++)
            if(d[i]>=2 && path[0][i] && path[i][i])
                return -1;

        ll num[2][51];
        int cur=0;
        for(i=0;i<n;i++)
            num[cur][i]=0;
        num[cur][0]=1;
        for(i=0;i<n;i++){
            cur^=1;
            for(j=0;j<n;j++)num[cur][j]=0;
            for(j=0;j<n;j++)
                for(k=0;k<n;k++)
                    num[cur][k]=(num[cur][k]+num[cur^1][j]*g[j][k])%Mod;
        }
        ll ans=0;
        for(i=0;i<n;i++)
            ans=(ans+num[cur][i])%Mod;
        return (int)ans;
    }

// BEGIN CUT HERE
	public:
	void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); if ((Case == -1) || (Case == 5)) test_case_5(); }
	private:
	template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
	void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
	void test_case_0() { string Arr0[] = {"1"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; verify_case(0, Arg1, numMonsters(Arg0)); }
	void test_case_1() { string Arr0[] = {"1 1"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = -1; verify_case(1, Arg1, numMonsters(Arg0)); }
	void test_case_2() { string Arr0[] = {"2", "3", "1"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; verify_case(2, Arg1, numMonsters(Arg0)); }
	void test_case_3() { string Arr0[] = {"1", "3 4", "2", "2"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1; verify_case(3, Arg1, numMonsters(Arg0)); }
	void test_case_4() { string Arr0[] = {"2 2", "3", "4 4 4", "5", "6", "7 7 7 7", "7"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 24; verify_case(4, Arg1, numMonsters(Arg0)); }
	void test_case_5() { string Arr0[] = {"2 3","5 7","2 4","5","6","4","7"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 5; verify_case(5, Arg1, numMonsters(Arg0)); }

// END CUT HERE

};

// BEGIN CUT HERE
int main()
{
    MonsterFarm ___test;
    ___test.run_test(-1);
    return 0;
}
// END CUT HERE


div1的300是比较好的dp计数


// BEGIN CUT HERE

// END CUT HERE
#line 5 "NoRepeatPlaylist.cpp"
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;

typedef long long ll;

class NoRepeatPlaylist
{
        public:
        int numPlaylists(int N, int M, int P)
        {
            ll dp[110][110];
            const int mod=1000000007;
            int i,j;
            memset(dp,0,sizeof(dp));
            dp[0][0]=1;
            for(i=0;i<P;i++)
                for(j=0;j<=N && j<=i ;j++)
                    if(dp[i][j]){
                        if(j<N)
                            dp[i+1][j+1]=(dp[i+1][j+1]+dp[i][j]*(N-j))%mod;
                        if(j>=M+1 && i>=M+1)
                            dp[i+1][j]=(dp[i+1][j]+dp[i][j]*(j-M))%mod;  //dp[i][j]记录的是已播放的i首歌有j种的所有情况（且这些排列的连续M首没有相同的歌）
                    }
            return dp[P][N];
        }

// BEGIN CUT HERE
	public:
	void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); if ((Case == -1) || (Case == 5)) test_case_5(); }
	private:
	template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
	void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
	void test_case_0() { int Arg0 = 1; int Arg1 = 0; int Arg2 = 3; int Arg3 = 1; verify_case(0, Arg3, numPlaylists(Arg0, Arg1, Arg2)); }
	void test_case_1() { int Arg0 = 1; int Arg1 = 1; int Arg2 = 3; int Arg3 = 0; verify_case(1, Arg3, numPlaylists(Arg0, Arg1, Arg2)); }
	void test_case_2() { int Arg0 = 2; int Arg1 = 0; int Arg2 = 3; int Arg3 = 6; verify_case(2, Arg3, numPlaylists(Arg0, Arg1, Arg2)); }
	void test_case_3() { int Arg0 = 4; int Arg1 = 0; int Arg2 = 4; int Arg3 = 24; verify_case(3, Arg3, numPlaylists(Arg0, Arg1, Arg2)); }
	void test_case_4() { int Arg0 = 2; int Arg1 = 1; int Arg2 = 4; int Arg3 = 2; verify_case(4, Arg3, numPlaylists(Arg0, Arg1, Arg2)); }
	void test_case_5() { int Arg0 = 50; int Arg1 = 5; int Arg2 = 100; int Arg3 = 222288991; verify_case(5, Arg3, numPlaylists(Arg0, Arg1, Arg2)); }

// END CUT HERE

};

// BEGIN CUT HERE
int main()
{
        NoRepeatPlaylist ___test;
        ___test.run_test(-1);
        return 0;
}
// END CUT HERE

div2 950是一道很简单的生成树问题

// BEGIN CUT HERE

// END CUT HERE
#line 5 "KingdomReorganization.cpp"
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;

typedef long long ll;
int head1[51],head2[51],cnt;
int f[51];
struct Edge{
    int u,v,w;
}edge[3000];
void addedge(int u,int v,int w){
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt++].w=w;
}
bool cmp1(struct Edge a,struct Edge b){
    return a.w>b.w;
}
bool cmp2(struct Edge a,struct Edge b){
    return a.w<b.w;
}
int find(int u){
    if(f[u]==u)return u;
    return f[u]=find(f[u]);
}
int cal(char s){
    if(s<='Z' && s>='A')return s-'A';
    return s-'a'+26;
}
class KingdomReorganization
{
        public:
        int getCost(vector <string> kingdom, vector <string> build, vector <string> destroy)
        {
            int n=kingdom.size();
            int len,i,j;
            int sum=0;
            cnt=0;
            for(i=0;i<n;i++)f[i]=i;
            for(i=0;i<n;i++){
                for(j=0;j<n;j++){
                    if(j>=i)break;
                    if(kingdom[i][j]=='1'){
                        addedge(i,j,cal(destroy[i][j]));
                        sum+=cal(destroy[i][j]);
                    }
                }
            }
            sort(edge,edge+cnt,cmp1);
            for(i=0;i<cnt;i++){
                int x=find(edge[i].u);
                int y=find(edge[i].v);
                if(x!=y){
                    sum-=edge[i].w;
                    f[x]=y;
                }
            }
            cnt=0;
            for(i=0;i<n;i++){
                for(j=0;j<n;j++){
                    if(j>=i)break;
                    if(kingdom[i][j]=='0')
                        addedge(i,j,cal(build[i][j]));
                }
            }
            sort(edge,edge+cnt,cmp2);
            for(i=0;i<cnt;i++){
                int x=find(edge[i].u);
                int y=find(edge[i].v);
                if(x!=y){
                    sum+=edge[i].w;
                    f[x]=y;
                }
            }
            return sum;
        }

// BEGIN CUT HERE
	public:
	void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); if ((Case == -1) || (Case == 5)) test_case_5(); }
	private:
	template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
	void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
	void test_case_0() { string Arr0[] = {"000","000","000"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"ABD","BAC","DCA"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); string Arr2[] = {"ABD","BAC","DCA"}; vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 3; verify_case(0, Arg3, getCost(Arg0, Arg1, Arg2)); }
	void test_case_1() { string Arr0[] = {"011","101","110"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"ABD","BAC","DCA"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); string Arr2[] = {"ABD","BAC","DCA"}; vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 1; verify_case(1, Arg3, getCost(Arg0, Arg1, Arg2)); }
	void test_case_2() { string Arr0[] = {"011000","101000","110000","000011","000101","000110"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"ABDFFF","BACFFF","DCAFFF","FFFABD","FFFBAC","FFFDCA"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); string Arr2[] = {"ABDFFF","BACFFF","DCAFFF","FFFABD","FFFBAC","FFFDCA"}; vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 7; verify_case(2, Arg3, getCost(Arg0, Arg1, Arg2)); }
	void test_case_3() { string Arr0[] = {"0"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"A"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); string Arr2[] = {"A"}; vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 0; verify_case(3, Arg3, getCost(Arg0, Arg1, Arg2)); }
	void test_case_4() { string Arr0[] = {"0001","0001","0001","1110"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"AfOj","fAcC","OcAP","jCPA"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); string Arr2[] = {"AWFH","WAxU","FxAV","HUVA"}; vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 0; verify_case(4, Arg3, getCost(Arg0, Arg1, Arg2)); }
	void test_case_5() { string Arr0[] = {"0000000000","0000000011","0001010000","0010010000","0000001000","0011000000","0000100000","0000000011","0100000101","0100000110"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"AhPEqkSFMM","hAfKPtsDad","PfAyGQkaqN","EKyAeLpRpm","qPGeASfNwo","ktQLSAnCAK","SskpfnAdJS","FDaRNCdAZz","MaqpwAJZAn","MdNmoKSznA"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); string Arr2[] = {"AgTqWWxEYH","gAXPgjzIRA","TXAleTmWvT","qPlAQkwxRO","WgeQAqgbJJ","WjTkqAiTzl","xzmwgiAuHb","EIWxbTuAwk","YRvRJzHwAn","HATOJlbknA"}; vector <string> Arg2(Arr2, Arr2 + (sizeof(Arr2) / sizeof(Arr2[0]))); int Arg3 = 65; verify_case(5, Arg3, getCost(Arg0, Arg1, Arg2)); }

// END CUT HERE

};

// BEGIN CUT HERE
int main()
{
        KingdomReorganization ___test;
        ___test.run_test(-1);
        return 0;
}
// END CUT HERE


Benzema67
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
SRM2Mult_1.2_srm2_compositionqw7_
10-03
SRM2Multi dumper for hsap
[topcoder]KingdomReorganization
weixin_30800987的博客
10-03 70
http://community.topcoder.com/stat?c=problem_statement&pm=11282&rd=14724 这道题是最小生成树，但怎么转化是关键。首先是把所有的路都destroy掉，得到基本的MassiveCost，然后在选MST的过程中，遇上这些边相当于还回去，它们的cost就是-destroy[i][j]。这样转化完毕。 用K...
TopCoder 300 points 1-SRM 144 DIV 1 90/300 30%
slightleaves的专栏
05-30 713
Problem Statement   Let's say you have a binary string such as the following: 011100011 One way to encrypt this string is to add to each digit the sum of its adjacent digits. For exampl
TopCoder 300 points 27-SRM 157 DIV 1 90/300 30%
slightleaves的专栏
08-05 738
Problem Statement   Often employees at a company time stamp their arrivals and departures, so when the month is over the boss can check how much each employee has worked. Given the time sta
SRM549 Div1 600
倘若天下着雨。。。你还在
04-13 258
/* 对于每一个帽子有3个状态(1 没有开 2 开了有硬币 3 开了没有硬币) 由于题目有限制条件，如果我们每次转移的时候都判断一下太麻烦了 又因为帽子的摆放和硬币的是唯一的所以可以再最后判断 */ #include<bits/stdc++.h> using namespace std; const int M=15,INF=1555,N=1694323; int dp[
1SRM1008029 - 马达規格書20180110.pdf
12-12
1SRM1008029 - 马达規格書20180110.pdf
TC SRM 388 div 2 problem 3
04-16
topcoder的数学类算法题目。一个整数被称为k-smooth当且仅当它的最大素因子不大于k，给定N和K，计算出1 - N中有多少个整数是k-smooth。1 , 1 <= K <= 1000.
omron系列CPM1/CPM1A/CPM2A/CPM2C/SRM1(-V2) PLC编程手册.pdf
10-14
omron系列CPM1/CPM1A/CPM2A/CPM2C/SRM1(-V2) PLC编程手册pdf,omron系列CPM1/CPM1A/CPM2A/CPM2C/SRM1(-V2) PLC编程手册
srm-admin-8-1.pdf
10-22
VMware SRM 系统管理员手册 技术手册 云计算 虚拟化必备
倍增求LCA的模板
1292765944的专栏
10-14 4402
/* 2^17=131072; 2^18=262144; */ const int POW = 18; void dfs(int u,int fa){ d[u]=d[fa]+1; p[u][0]=fa; for(int i=1;i<POW;i++) p[u][i]=p[p[u][i-1]][i-1]; int sz=edge[u].size(); for(int i=0;i<sz;
Codeforces 124 E
1292765944的专栏
09-28 3316
最小生成树的好题！ 需要构造只包含k个点的图，但是如果暴力去搞必然超时，所以只加入有可能成为MST中的边的边，最后求一遍最小生成树 First of all, we can note that if each graph vertex is portal, the answer will be a sum of all edges' weights in MST (minimal span
POJ 1041 John's trip欧拉路
1292765944的专栏
02-08 2527
很简单的一道求欧拉路的题。用矩阵的话最好用关联矩阵，因为可能两点间连好几条路，用vector存的话记着要sort #include #include #include #include using namespace std; int map[46][2000],d[46],m; bool vis[2000]; stackst; int max(int a,int b){ return a>
HDU 4757
1292765944的专栏
10-13 2292
可持久化trie树。不会可持久化数据结构的话推荐先看陈立杰的论文。先掌握可持久化线段树和可持久化trie树。
2011年北京区域赛A题
1292765944的专栏
09-05 2058
次小生成树的简单应用 #include #include #include #include #include #define N 1010 using namespace std; int x[N],y[N],p[N],vis[N]; double dis[N][N],d[N],mx[N][N]; int main(){ int t,T,i,j,n; double A,B,
POJ 3728 The merchant
1292765944的专栏
02-16 1776
这个题算是LCA的一个高级应用吧。 其实就是在维护u,v到其最近公共祖先的几个数据（将u,v分成两段,一个从u到LCA(u,v),一个从LCA(u,v)到v,分别维护即可） #include #include #include #define con 50100 using namespace std; int head1[con],head2[con],head3[con],p,n,num[
[SCOI2005]王室联邦
1292765944的专栏
03-09 1773
Description “余”人国的国王想重新编制他的国家。他想把他的国家划分成若干个省，每个省都由他们王室联邦的一个成员来管理。他的国家有n个城市，编号为1..n。一些城市之间有道路相连，任意两个不同的城市之间有且仅有一条直接或间接的道路。为了防止管理太过分散，每个省至少要有B个城市，为了能有效的管理，每个省最多只有3B个城市。每个省必须有一个省会，这个省会可以位于省内，也可以在该省外。但
HDU 4756 && HDU 4126
1292765944的专栏
10-04 1765
两个题次小生成树的扩展题。 先prim求出最小生成树，枚举删除每条树边后求分割成的两部分之间的最小连接费用，这一步用一个O（n^2）的n遍dfs求解。 不过HDU 4756这个题我被sqrt函数卡死，之前的写法HDU被卡爆栈，給sqrt传负数爆栈 //double tmp=(double)(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]); dis[i][j]=dis[j][i]=sqrt(tmp);
hdu 4115
1292765944的专栏
10-04 1657
简单2-sat 方法一：找到矛盾项（选x不能选y） 若c == 0{   //第u次与第v次相同             if(a[u] != a[v]) g[u].push_back(v+n),g[v].push_back(u+n);             if(a[u] != b[v]) g[u].push_back(v),g[v+n].push_back(u+n);
./shutdown.sh Using CATALINA_BASE: /usr/local/wangli_srm/tomcat_srm_7772 Using CATALINA_HOME: /usr/local/wangli_srm/tomcat_srm_7772 Using CATALINA_TMPDIR: /usr/local/wangli_srm/tomcat_srm_7772/temp Using JRE_HOME: /usr/local/wangli_srm/software/jdk1.8.0_211 Using CLASSPATH: /usr/local/wangli_srm/tomcat_srm_7772/bin/bootstrap.jar:/usr/local/wangli_srm/tomcat_srm_7772/bin/tomcat-juli.jar这是什么意思
最新发布
05-05
这是一个shell脚本，用于关闭Tomcat服务器。其中，CATALINA_BASE指定Tomcat的基础目录，CATALINA_HOME指定Tomcat的安装目录，CATALINA_TMPDIR指定Tomcat的临时文件目录，JRE_HOME指定Java运行环境的安装目录，...

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

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

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值