鞭屍

pA

#include <bits/stdc++.h> 
using namespace std; 
  
main() { 
    cout << "aem5"; 
} 

aem5 是啥

#include <bits/stdc++.h> 
using namespace std; 
  
main() { 
    ios::sync_with_stdio(0); cin.tie(0); 
  
    int a, b; 
    cin >> a >> b; 
    cout << "Yes\n"; 
} 

恭喜猜對 50%

#include<bits/stdc++.h> 
using namespace std; 
using ll = long long; 
  
int main(){ 
    ll a, b; cin >> a >> b; 
    bool res = abs((abs(a % 2) + abs(b % 2)) % 2); 
  
    if (res = 1) cout << "Yes\n"; 
    else cout << "No\n"; 
}

你以為這是數論運算是不是,要三個 abs

#include<bits/stdc++.h> 
using namespace std; 
main(){ 
    ios :: sync_with_stdio ( false ); 
    cin . tie ( nullptr ); 
    unsigned long long a,b; 
    cin>>a>>b; 
    if((a-b)%2==0)cout<<"No"; 
    else cout<<"Yes"; 
  
} 

哪有人 :: 跟 . 要空格的

#include <iostream> 
using namespace std; 
#define int unsigned long long 
  
signed main(){ 
    std :: ios :: sync_with_stdio ( false ); 
    std :: cin . tie ( nullptr ); 
    string a, b; 
    cin >> a >> b; 
  
    int a_num, b_num; 
    a_num = a.back(); 
    b_num = b.back(); 
  
  
    if((a_num+b_num)%2 == 1){ 
        cout << "Yes" << "\n"; 
    } 
    else{ 
        cout << "No" << "\n"; 
    } 
}

你都 using namespace std; 了還 std :: 甚至空格

#include <bits/stdc++.h> 
using namespace std; 
  
main() { 
    ios::sync_with_stdio(0); cin.tie(0); 
  
    __int64 a, b; 
    cin >> a >> b; 
  
    if ((a + b) % 2 == 1) { 
        cout << "Yes\n"; 
    } else { 
        cout << "No\n"; 
    } 
} 

有人掏出了 _int64

#include <iostream> 
using namespace std; 
#define int unsigned long long 
  
signed main(){ 
    std :: ios :: sync_with_stdio ( false ); 
    std :: cin . tie ( nullptr ); 
    string a, b; 
    cin >> a >> b; 
  
    int a_num, b_num; 
    a_num = a.back(); 
    b_num = b.back(); 
  
  
    if((a_num+b_num)%2 == 1){ 
        cout << "Yes" << "\n"; 
    } 
    else{ 
        cout << "No" << "\n"; 
    } 
}

我其實蠻好奇你知不知道你自己在寫什麼

#include<bits/stdc++.h> 
using namespace std; 
main(){ 
    string a,b; 
    int x,y; 
    cin>>a>>b; 
    stringstream ss,ss1; 
    ss<<a[a.size()-1]; 
    ss>>x; 
    ss1<<b[b.size()-1]; 
    ss1>>y; 
    if((x+y)%2==0)cout<<"No"; 
    else cout<<"Yes"; 
} 

為什麼不直接對兩個 string 操作就好了

#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string c;
    int a,b;
    cin>>c;
    a=int(c[c.length()-1])-48;
    cin>>c;
    b=int(c[c.length()-1])-48;
    if((a+b)%2==0)cout<<"No";
    else cout<<"Yes";
    return 0;
}

跟上上個形成強烈對比

但你可以直接 - '0' 誰會記 48

#include <bits/stdc++.h> 
using namespace std; 
#define int long long 
  
main() { 
    string a, b; 
    cin >> a >> b; 
  
    if(a[a.size()-1] == '0' || a[a.size()-1] == '2' || a[a.size()-1] == '4' || a[a.size()-1] == '6' || a[a.size()-1] == '8') { 
        if(b[b.size()-1] == '0' || b[b.size()-1] == '2' || b[b.size()-1] == '4' || b[b.size()-1] == '6' || b[b.size()-1] == '8') { 
            cout << "No\n"; 
        } else { 
            cout << "Yes\n"; 
        } 
    } 
}

老哥你的 else 呢

#include <bits/stdc++.h> 
using namespace std; 
#define int long long 
  
main() { 
    string a, b; 
    cin >> a >> b; 
  
    if(a[a.size()-1] == '0' || a[a.size()-1] == '2' || a[a.size()-1] == '4' || a[a.size()-1] == '6' || a[a.size()-1] == '8') { 
        if(b[b.size()-1] == '0' || b[b.size()-1] == '2' || b[b.size()-1] == '4' || b[b.size()-1] == '6' || b[b.size()-1] == '8') { 
            cout << "No\n"; 
        } else { 
            cout << "Yes\n"; 
        } 
    } else { 
        if(b[b.size()-1] == '0' || b[b.size()-1] == '2' || b[b.size()-1] == '4' || b[b.size()-1] == '6' || b[b.size()-1] == '8') { 
            cout << "Yes\n"; 
        } else { 
            cout << "No\n"; 
        } 
    } 
}

老哥你的 else 呢

對嘛加上就過了

#include<bits/stdc++.h> 
using namespace std; 
  
int main(){ 
string a; 
string b; 
  
cin >> a; 
cin >> b; 
int slena,slenb; 
slena = a.length(); 
slenb = b.length(); 
int c=a[slena-1]+b[slenb-1]; 
if(c%2==0){ 
    cout<<"No"; 
} 
else{ 
    cout<<"Yes"; 
} 
  
  
} 

真的不打算加個縮排嗎

slena 是誰

pB

#include<bits/stdc++.h> 
using namespace std; 
main(){ 
    cout<<150; 
} 

喇分挺好的

pC

#include <bits/stdc++.h>
using namespace std;
 
int main(){
    long long n,Max=INT_MIN;
    cin>>n;
    vector<long long> num;
    vector<long long> plus;
    for(long long i = 0;i<n;i++){
        long long a;
        cin>>a;
        num.push_back(a);
        if(i!=0){
            plus.push_back(plus[i-1]+a);
        }
        else{
            plus.push_back(a);
        }
        Max=max(Max,plus[i]);
    }
    for(long long i = 1;i<n;i++){
        if(num[i]<num[i+1]){
            continue;
        }
        if(num[i]<=0 && num[i]==num[i+1]){
            continue;
        }
        for(long long j = i;j<n;j++){
            Max=max(Max,plus[j]-plus[i-1]);
 
        }  
    }    
    cout<<Max;
}

Max = max() 大小寫命名法喔

pD

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long n, m;
    cin >> n >> m;

    long long INF = n + 1;
    vector<vector<long long>> map((n + 1), vector<long long>(n + 1, INF));

    // cout << map[3][3];
    // return 0;

    for (long long i = 0; i < m; i++)
    {
        long long a, b;
        cin >> a >> b;

        map[a][b] = 1;
        map[b][a] = 1;
    }

    for (long long k = 1; k <= n; k++)
    {
        for (long long i = 1; i <= n; i++)
        {
            for (long long j = 1; j <= n; j++)
            {
                map[i][j] = min(map[i][j], map[i][k] + map[k][j]);
            }
        }
    }

    for (long long i = 1; i <= n; i++)
    {
        long long count = 0;
        for (long long j = 1; j <= n; j++)
        {
            if (j != i)
            {
                count += map[i][j];
            }
        }
        cout << count << ' ';
    }

    return 0;
}

bits/stdc++.h 還 include iostream

哪有人陣列叫map

#include <bits/stdc++.h> 
using namespace std; 
  
signed main(){ 
    cout << "5 5 4 5 5"; 
}

至少比賽中有人進步了

#include<bits/stdc++.h>
using namespace std;
int main(){
    cout<<5<<" "<<5<<" "<<4<<" "<<5<<" "<<5;
}

啊??

pE

pF

pG

鞭屍

By wen Ian

鞭屍

  • 243