ABC-185(A~F)

最新推荐文章于 2024-05-19 16:45:21 发布
最新推荐文章于 2024-05-19 16:45:21 发布
阅读量624 收藏
点赞数
分类专栏： contest 刷题 文章标签： 算法 acm竞赛
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_43272813/article/details/111186586
版权

比赛地址

个人博客

github

A

/*
 * Author: Moon-light
 * 按照题意输出
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;  
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;

template <class T> void clear(T& a) { T().swap(a);}
template <class T,class S>
inline bool upmin(T& a,const S&b){ return a>b ? a=b,1:0;}
template <class T,class S>
inline bool upmax(T&a, const S&b){ return a<b? a=b,1:0;}

//fast read(improved by fread)
char buf[1<<21],*p1=buf,*p2=buf;
inline int getc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;
}
inline int redi() {
    int ret = 0,f = 0;char ch = getc();
    while (!isdigit (ch)) {
        if (ch == '-') f = 1;
        ch = getc();
    }
    while (isdigit (ch)) {
        ret = ret * 10 + ch - 48;
        ch = getc();
    }
    return f?-ret:ret;
}

//global variable
const int N = 1;
const int mod = 1e9+7;

//functions
LL qmi(LL a,LL k,LL mod){
    LL res = 1;
    while(k){
        if(k&1) res = res*a%mod;
        k >>= 1;
        a = a*a%mod;
    }
    return mod;
}
int gcd(int a,int b) {
    return b==0? a:gcd(b,a%b);
}
//


//code from here! Come on! Have a pleasant experience~
int main()
{
    IO;
    int a,b,c,d;
    cin>>a>>b>>c>>d;

    cout<<min(a,min(b,min(c,d)))<<endl;
    return 0;
}

B

/*
 * Author: Moon-light
 * 按照题意边模拟边判断即可
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;  
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;

template <class T> void clear(T& a) { T().swap(a);}
template <class T,class S>
inline bool upmin(T& a,const S&b){ return a>b ? a=b,1:0;}
template <class T,class S>
inline bool upmax(T&a, const S&b){ return a<b? a=b,1:0;}

//fast read(improved by fread)
char buf[1<<21],*p1=buf,*p2=buf;
inline int getc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;
}
inline int redi() {
    int ret = 0,f = 0;char ch = getc();
    while (!isdigit (ch)) {
        if (ch == '-') f = 1;
        ch = getc();
    }
    while (isdigit (ch)) {
        ret = ret * 10 + ch - 48;
        ch = getc();
    }
    return f?-ret:ret;
}

//global variable
const int N = 1;
const int mod = 1e9+7;

//functions
LL qmi(LL a,LL k,LL mod){
    LL res = 1;
    while(k){
        if(k&1) res = res*a%mod;
        k >>= 1;
        a = a*a%mod;
    }
    return mod;
}
int gcd(int a,int b) {
    return b==0? a:gcd(b,a%b);
}
//
LL m,n,t;
LL a,b;

//code from here! Come on! Have a pleasant experience~
int main()
{
    IO;
    cin>>n>>m>>t;
    
    LL left = n;
    LL last = 0;
    m -= 1;
    cin>>a>>b;
    left -= a;
    if(left <= 0) {
        cout<<"No"<<endl;
        return 0;
    }
    left += (b-a);
    last = b;
    if(left > n) left = n;
    for(int i = 1; i<=m; i++){
        cin>>a>>b;
        left = left - (a-last);
        if(left <= 0) {
            cout<<"No"<<endl;
            return 0;
        }
        left = left + (b-a);
        if(left > n) left = n;
        last = b;
    }
    
    left = left - (t-last);
    if(left <= 0){
        cout<<"No"<<endl;
    }else{
        cout<<"Yes"<<endl;
    }
    return 0;
}

C

/*
 * Author: Moon-light
 * 题意：一根木棍分成12段的切法数量，两种切法不同当且仅当切割的位置不同
 * 求组合数即可，注意一个木棍可切割的位置是n-1
 * 那么answer = C(11,n-1);
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;  
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;

template <class T> void clear(T& a) { T().swap(a);}
template <class T,class S>
inline bool upmin(T& a,const S&b){ return a>b ? a=b,1:0;}
template <class T,class S>
inline bool upmax(T&a, const S&b){ return a<b? a=b,1:0;}

//fast read(improved by fread)
char buf[1<<21],*p1=buf,*p2=buf;
inline int getc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;
}
inline int redi() {
    int ret = 0,f = 0;char ch = getc();
    while (!isdigit (ch)) {
        if (ch == '-') f = 1;
        ch = getc();
    }
    while (isdigit (ch)) {
        ret = ret * 10 + ch - 48;
        ch = getc();
    }
    return f?-ret:ret;
}

//global variable
const int N = 300;
const int mod = 1e9+7;
LL c[N][N];
int n;
//functions
LL qmi(LL a,LL k,LL mod){
    LL res = 1;
    while(k){
        if(k&1) res = res*a%mod;
        k >>= 1;
        a = a*a%mod;
    }
    return mod;
}
int gcd(int a,int b) {
    return b==0? a:gcd(b,a%b);
}

void solve(){
    for(int i = 0; i<N; i++){
        for(int j = 0; j<=i; j++){
            if(!j) c[i][j] = 1;
            else c[i][j] = c[i-1][j] + c[i-1][j-1];
        }
    }
}
//

//code from here! Come on! Have a pleasant experience~
int main()
{
    IO;
    cin>>n;
    solve();
    cout<<c[n-1][11]<<endl;
    return 0;
}

D

/*
 * Author: Moon-light
 * 
 * 思路：因为不能碰到蓝色的方块，所以我们只能找蓝色方块分割开的白色序列中找最小的连续的子序列
 * 然后求次数即可，注意首尾的边界情况
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;  
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;

template <class T> void clear(T& a) { T().swap(a);}
template <class T,class S>
inline bool upmin(T& a,const S&b){ return a>b ? a=b,1:0;}
template <class T,class S>
inline bool upmax(T&a, const S&b){ return a<b? a=b,1:0;}

//fast read(improved by fread)
char buf[1<<21],*p1=buf,*p2=buf;
inline int getc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;
}
inline int redi() {
    int ret = 0,f = 0;char ch = getc();
    while (!isdigit (ch)) {
        if (ch == '-') f = 1;
        ch = getc();
    }
    while (isdigit (ch)) {
        ret = ret * 10 + ch - 48;
        ch = getc();
    }
    return f?-ret:ret;
}

//global variable
const int N = 2e5+100;
const int mod = 1e9+7;
LL n,m;
LL a[N];


//functions
LL qmi(LL a,LL k,LL mod){
    LL res = 1;
    while(k){
        if(k&1) res = res*a%mod;
        k >>= 1;
        a = a*a%mod;
    }
    return mod;
}
int gcd(int a,int b) {
    return b==0? a:gcd(b,a%b);
}
//


//code from here! Come on! Have a pleasant experience~
int main()
{
    IO;
    cin>>n>>m;

    for(int i = 1; i<=m; i++){
        cin>>a[i];
    }   
    sort(a+1,a+1+m);

    if(m == 0){
        cout<<1<<endl;
        return 0;
    }
    if(n == m) {
        cout<<0<<endl;
        return 0;
    }
    
    LL range = a[1] - 1;
    LL last = a[1];
    for(int i = 2; i<=m; i++){
        LL t = a[i] - last - 1;
        if(range  == 0) range = t;
        else if(t > 0) range = min(range,t);
        last = a[i];
    }
    if(n > last){
        if(range == 0) range = (n-last);
        else range = min(range,n-last);
    }
        
    //cout<<range<<endl;
    LL ans = 0;
    last = a[1];
    if(a[1] > 1){
        ans += (a[1]-2)/range+1;
    }
    for(int i = 2; i<=m; i++){
        int cnt = a[i]-last-1;
        ans += (cnt-1)/range+1;
        last = a[i];
    }
    if(n>last)
        ans += (n-last-1)/range + 1;
    cout<<ans<<endl; 
    return 0;
}

E

/*
 * Author: Moon-light
 * 
 * 题意: 有两个长度分别为N和M的序列A,B
 * 删除序列A中的a个元素得到A' , 0<=a<=N
 * 删除序列B中的b个元素得到B' , 0<=b<=M
 * 使得A'的长度等于B'的长度
 * 令x = a + b
 *   y = Sum of i A'i != B'i 
 * 
 * 思路: 编辑距离模型
 * 设dp[i][j] 表示对A前i个及对B前j个元素的最小答案
 * 那么对于当前的A[i]和 B[j]
 * 有三种情况： 1.删除A[i]，保留B[j] dp[i-1][j] + 1
 *              2.保留A[i]，删除B[j] dp[i][j-1] + 1
 *              3.保留A[i], 保留A[j] dp[i-1][j-1] + (a[i]==b[j]?0:1)
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;  
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;

template <class T> void clear(T& a) { T().swap(a);}
template <class T,class S>
inline bool upmin(T& a,const S&b){ return a>b ? a=b,1:0;}
template <class T,class S>
inline bool upmax(T&a, const S&b){ return a<b? a=b,1:0;}

//fast read(improved by fread)
char buf[1<<21],*p1=buf,*p2=buf;
inline int getc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;
}
inline int redi() {
    int ret = 0,f = 0;char ch = getc();
    while (!isdigit (ch)) {
        if (ch == '-') f = 1;
        ch = getc();
    }
    while (isdigit (ch)) {
        ret = ret * 10 + ch - 48;
        ch = getc();
    }
    return f?-ret:ret;
}

//global variable
const int N = 1010;
const int mod = 1e9+7;

int n,m;
int a[N],b[N];
int dp[N][N];

//functions
LL qmi(LL a,LL k,LL mod){
    LL res = 1;
    while(k){
        if(k&1) res = res*a%mod;
        k >>= 1;
        a = a*a%mod;
    }
    return mod;
}
int gcd(int a,int b) {
    return b==0? a:gcd(b,a%b);
}
//


//code from here! Come on! Have a pleasant experience~
int main()
{
    IO;
    cin>>n>>m;

    rep(i,1,n) cin>>a[i];
    rep(i,1,m) cin>>b[i];

    //initialization
    rep(i,1,n) dp[i][0] = i;
    rep(i,1,m) dp[0][i] = i;

    rep(i,1,n){
        rep(j,1,m){
            //删一个
            dp[i][j] = min(dp[i-1][j]+1,dp[i][j-1]+1);
            //不删
            dp[i][j] = min(dp[i][j], dp[i-1][j-1] + (a[i]==b[j]?0:1));
        }
    }
    cout<<dp[n][m];
    return 0;
}

F

/*
 * Author: Moon-light
 * 题意: 1.单点修改 Ax = Ax ^ Y
 *       2.区间查询 Ax1 ^ Ax2 ^ Ax3 ^... ^ Ay
 * 
 * 思路: 树状数组模板
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;  
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;

template <class T> void clear(T& a) { T().swap(a);}
template <class T,class S>
inline bool upmin(T& a,const S&b){ return a>b ? a=b,1:0;}
template <class T,class S>
inline bool upmax(T&a, const S&b){ return a<b? a=b,1:0;}

//fast read(improved by fread)
char buf[1<<21],*p1=buf,*p2=buf;
inline int getc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;
}
inline int redi() {
    int ret = 0,f = 0;char ch = getc();
    while (!isdigit (ch)) {
        if (ch == '-') f = 1;
        ch = getc();
    }
    while (isdigit (ch)) {
        ret = ret * 10 + ch - 48;
        ch = getc();
    }
    return f?-ret:ret;
}

//global variable
const int N = 3e5+100;
const int mod = 1e9+7;
int n,q,t,x,y;
int tr[N];

//functions
LL qmi(LL a,LL k,LL mod){
    LL res = 1;
    while(k){
        if(k&1) res = res*a%mod;
        k >>= 1;
        a = a*a%mod;
    }
    return mod;
}
int gcd(int a,int b) {
    return b==0? a:gcd(b,a%b);
}

void update(int u,int x){
    for(int i = u; i<=n; i+=lowbit(i)){
        tr[i] ^= x;
    }
}

int query(int x){
    int res = 0;
    for(int i = x; i; i-=lowbit(i)){
        res ^= tr[i];
    }
    return res;
}
//


//code from here! Come on! Have a pleasant experience~
int main()
{
    IO;
    cin>>n>>q;
    rep(i,1,n){
        cin>>x;
        update(i,x);
    }

    rep(i,1,q){
        cin>>t>>x>>y;
        if(t == 1){
            update(x,y);
        }else{
            cout<<(query(y)^query(x-1))<<endl;
        }
    }
    return 0;
}
zxdxz
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
有26个字母a~z，找出所有字母组合，a、b、c、ab、abc、a~z 都是一个组合(顺序无关)
orange_yoo的博客
09-04 4436
1.*这个问题有点像小学课本上握手问题，每个人都握到最后那个人，这样也就好理解点了 2.*我们可以通过循环加上字符串拼接每次加一个字母，然后存储到数组中，好比：a,a+b,a+b+c,a+b+c+d等等，到了b就清空继续这个操作 *3.*这样一看我们可以采用双重for循环一个负责首字母一个负责后续的拼接 public class ABC { public static void main(String[] args) { ArrayList<String> list = ne.
ABC 315 提交代码（A-F）
08-19
ABC 315 题解 详细可见 Eric_Cui 提交记录
AtCoder题解 —— AtCoder Beginner Contest 185 —— B - Smartphone Addiction —— 模拟算法
努力中的老周的专栏
12-13 497
题目相关 题目链接 AtCoder Regular Contest 185 B 题，https://atcoder.jp/contests/abc185/tasks/abc185_b。 Problem Statement The battery of Takahashi's smartphone has N mAh capacity. At time 0.5, 1.5, 2.5, and so on (that is, at time n+0.5 for every integer n), the
ABC185 F - Range Xor Query（线段树）
zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz
04-12 230
题意： 解法： 发现题目只有单点修改与区间异或和查询, 直接上线段树就行了. code： #include<bits/stdc++.h> #define int long long #define PI pair<int,int> using namespace std; const int maxm=2e6+5; int n,q; struct Tree{ int a[maxm<<2]; inline void pp(int node){
AtCoder题解 —— AtCoder Beginner Contest 185 —— D - Stamp —— 模拟
努力中的老周的专栏
12-16 539
题目相关 题目链接 AtCoder Regular Contest 185 D 题，https://atcoder.jp/contests/abc185/tasks/abc185_d。 Problem Statement There are N squares arranged in a row from left to right. Let Square i be the i-th square from the left. M of those squares, Square A1, A2, A
AtCoder题解 —— AtCoder Beginner Contest 185 —— A - ABC Preparation
努力中的老周的专栏
12-13 442
题目相关 题目链接 AtCoder Regular Contest 185 A题，https://atcoder.jp/contests/abc185/tasks/abc185_a。 Problem Statement Takahashi has decided to hold some number of programming contests. Holding one contest requires one 100-point problem, one 200-point problem,.
AtCoder题解 —— AtCoder Beginner Contest 185 —— C - Duodecim Ferra —— 组合数学、背包
努力中的老周的专栏
12-14 703
题目相关 题目链接 AtCoder Regular Contest 185 B 题， Problem Statement There is an iron bar of length L lying east-west. We will cut this bar at 11 positions to divide it into 12 bars. Here, each of the 12 resulting bars must have a positive integer length. Find
AtCoder Beginner Contest 260 A~F 题解
天生我材必有用，千金散尽还复来。
07-19 7068
A - A Unique Letter B - Better Students Are Needed! C - Changing Jewels D - Draw Your Cards E - At Least One F - Find 4-cycle G - Scalene Triangle Area Ex - Colorfulness
AtCoder ABC 239题解(A ~ E)
DM010maker的博客
03-07 4572
AtCoder ABC 239 A Horizon(语法 + 数学) sqrt(a∗b)==sqrt(a)∗sqrt(b) sqrt(a * b) == sqrt(a) * sqrt(b) sqrt(a∗b)==sqrt(a)∗sqrt(b) int main() { LL n; scanf("%lld", &n); double res = sqrt(n) * sqrt(12800000 + n);//防溢出 printf("%.2f\n", res); r
docker inspect -f 详解(查询在主机上的进程pid)
热门推荐
m0_45406092的博客
12-23 1万+
转载原文链接：https://blog.csdn.net/p656456564545/article/details/51538457 概述 很多 Docker 用户都知道 docker inspect 命令，该命令用于获取容器/镜像的元数据，其中 -f 参数可以用于获取指定的数据，例如使用 docker inspect -f {{.IPAddress}} 来获取容器的 IP 地址。不过很多用户容...
AtCoder Beginner Contest 196 A~E题解
天生我材必有用，千金散尽还复来。
04-01 8194
ABC196 A~E 题解 A - Difference Max B - Round Down C - Doubled D - Hanjo E - Filters
ABC312 Code (A-E)
08-01
Atcoder Beginner Contest 312 AC C++ 代码 板子较多，但码风清新（ 可以使用 g++ 消灭板子！...https://atcoder.jp/contests/abc312/submissions?f.Task=&f.LanguageName=&f.Status=&f.User=Eric_Cui
荧光分析法和ABC-BP神经网络相结合的多环芳烃的检测
03-17
分析了苯并[k]荧蒽(Bk F)、苯并[a]芘(Ba P)和两者混合物的荧光特性,结果表明Bk F存在2个荧光特征峰,Ba P存在6个荧光特征峰,Bk F和Ba P的最佳发射波长均为405 nm。不同浓度配比的混合物荧光特性差异较大,但最佳发射...
K-ABC对天才儿童的建构效度
06-29
CONSTRUCT VALIDITY O F THE K-ABC FOR GIFTED CHILDREN R . STEVE MCCALLUM, FRANCES A. KARNES, AND JUDY OEHLER-STINNETT University of Southern Mississippi Fifty-four elementary-age gifted students ...
63147c9f-b876-4939-9fea-59e03027414a_gridwithincellccadingdropdownlists
08-18
asp.net 63147c9f-b876-4939-9fea-59e03027414a_gridwithincellccadingdropdownlists
496.下一个更大的元素
最新发布
m0_73800437的博客
05-19 265
刷算法题：第一遍：1.看5分钟，没思路看题解2.通过题解改进自己的解法，并且要写每行的注释以及自己的思路。3.思考自己做到了题解的哪一步，下次怎么才能做对(总结方法)4.整理到自己的自媒体平台。5.再刷重复的类似的题目，根据时间和任务安排刷哪几个板块6.用c++语言 都刷过一遍了 就刷中等。
链接表存储图(C++注释详解): 构建表 & 深度优先遍历 (DFS)
H13420972436的博客
05-15 452
代码实现: 构建表 & 深度优先遍历 (DFS)
【算法】二分算法——x的平方根
2302_79031646的博客
05-17 819
用二分边界算法来求解——x的平方根，从暴力求解到二分的优化细说
day09
2202_76101487的博客
05-17 755
正值少年的日常打卡！！！
1、假定文件abc.txt中有以下文法： E->TB B->ATB B->-M B->~ T->FC C->MFC C->~ F->(E) F->i A->+ A->- M->* M->/ 2、将文法依次读入内存中，并实现LL(1)文法的判定 3、对输入程序“i+i*i#”进行预测分析
06-12
6. 读入输入串中的下一个字符i，此时栈顶符号为F，查找分析表中Fi的值，得到F->i。 7. 将i从输入串中删除，此时栈顶符号为C。 8. 查找分析表中C*的值，得到C->~。 9. 将~从栈中弹出，此时栈顶符号为F。 10. 查找分析...

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

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

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值