Please turn JavaScript on

Latest ClueOJ Comments

Following Latest ClueOJ Comments's news feed is very easy. Subscribe using the "follow" button on the top right and if you want to, choose the updates by topic or tag.

We will deliver them to your inbox, your phone, or you can use follow.it like your own online RSS reader. You can unsubscribe whenever you want with one click.

Keep up to date with Latest ClueOJ Comments!

Latest ClueOJ Comments: Trang chủ - ClueOJ: Clue Online Judge

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  2.93 / day

Message History

https://ideone.com/AvizMS mọi người cho em hỏi sao code em TLE vậy ạ


Read full story

AD sai test vd 2 hả , đề chính là : 7 2 15 2 7 10 1 8 3 chứ


Read full story
include <bits/stdc++.h>

using namespace std; void solve(){ int n; cin >> n; vector<int> odd; long long sum = 0; for(int i=1;i<=n;i++){ int x; cin >> x; if(x%2==0) sum+=x; else odd.pushback(x); } sort(odd.rbegin(),odd.rend()); for(sizet i=0;i+1<odd.size();i+=2){ sum+=odd[i]+odd[i+1]; } cout << sum; } int main(){ iosbase::sync


Read full story

đề chuyên tuyên quang cho mấy bạn thi lại à


Read full story