问题标题: 酷町堂：1000

是装的吧

• #define qwertjfgdbcsjghjsdghbgnhgfgh int #define djkjfnsJDTKNDKJHDKLgbjkBJHHJh main #define GHVHBHJghjvhjKHVhjghGHJHRGFnjfDS using #define NVNHFGFBGFGVGHFvghfVCSDASsaCHJKLHHFgFtTFhgf namespace #define DFAEWFDVHGFgvhggFCxDCfdsDCgfsxdfwGJkdFDNHJTyd { #define jgfHGHFbjfgvbdsedHKJfCVJG } #define jbvhjgHJJGhvHHgcvhgfhgvhF cout #define jhghHGHfdssdFSDFBGddHHGDgdgh () #define HFHVHJHhjfJKVghghGHFvghGHVHghvHF << #define sfdsafkjkjh ; #define GHCVJHGFhvghfhklFDghxfdDGGFhd return #define FHGJGHfHFghhGFGHBGvgbFHFhcghfCK 0 #define HGHBHJGHJvGHVjhfVHJhF "Hello, World!" #include<iostream> GHVHBHJghjvhjKHVhjghGHJHRGFnjfDS NVNHFGFBGFGVGHFvghfVCSDASsaCHJKLHHFgFtTFhgf std sfdsafkjkjh qwertjfgdbcsjghjsdghbgnhgfgh djkjfnsJDTKNDKJHDKLgbjkBJHHJh jhghHGHfdssdFSDFBGddHHGDgdgh DFAEWFDVHGFgvhggFCxDCfdsDCgfsxdfwGJkdFDNHJTyd jbvhjgHJJGhvHHgcvhgfhgvhF HFHVHJHhjfJKVghghGHFvghGHVHghvHF HGHBHJGHJvGHVjhfVHJhF sfdsafkjkjh GHCVJHGFhvghfhklFDghxfdDGGFhd FHGJGHfHFghhGFGHBGvgbFHFhcghfCK sfdsafkjkjh jgfHGHFbjfgvbdsedHKJfCVJG
• 满分代码

cout<<"Hello, World!"

额 你都回答别人这题 ，

简单的莫队+二叉堆建树

给个基**函数，主函数自己写

int ms, p=0, fflag = 0, pd, fei;

struct F{
    char ml;
    bool used;
}px[30*MAXN];

bool check(int n) { 
    for(int i=1; i<=n; i++) {
        if(ans[i] != t[i]) return 1;//判断对照组与实际是否相同 
    }
    return 0;
}

void ensh(int sea) {
    if(sea == 0) sea = 0;
    if(sea == 1) {
        cout << "I can't do this problem!It's so difficult!";
        fei = 1;
    }
}

bool ff(int du) {
    pd = du;
    pd -= 1;
    du = pd;
    if(du != 0) return 1;
    return 0;
}

void date(int a, int b) {
    if(check(ms)!= 1 && p==0 && ff(fflag)==0 && a+b==2 && fei == 0)
        cout << "Hello, World!";
    else if(fei == 1) cout << "I can't do this problem!It's so difficult!";
}

bool wcheck(string x,string y) {
    if(x==y) return true;
}

提示一下主函数要有这个东西

int ii = sqrt(ms);
    int jj = kk - ii;
    for(int i=1; i<=ii; i++) {
        for(int j=1; j<=kk; j++) {
            sh[i][j] = t[j];
        }
    }

    for(int i=1; i<=kk; i++) {
        if(sh[1][i] == t[i]) {
            fflag = 1;
        }
    }

    for(int i=0; i<kk; i++) {
        px[i].ml = t[i];
        px[i].used = 0;
    }
    for(int i=0; i<kk; i++){
        if(px[i].ml == t[i]) px[i].used = 1;
    }
    for(int i=0; i<kk; i++) {
        if(px[i].used == 0)fei = 1;
    }

输出即可AC。

望采纳！

cout<<"Hello, World!";

cout<<"Hello,World!";

望采纳

只要上了第一节课的都会，你是没上课吗？

思路：

使用cout标准输出，在写完代码框架后，使用cout，格式为：cout<<"Hello, World!";

望采纳~

shui

老早就看你问问题了，第一节课肯定上了

请问你上过编程课吗？

装，你继续装