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.48 / day

Message History

hoangnamphong061212 -> TS10 Điện Biên 2026 - Quản lý nông trại6 hrs

tranh vong lap vo han la dc

Read full story

nam1276758928489427598 -> HSG9 Cần Thơ 2026 - Đơn hàng18 hrs

include<iostream>

using namespace std; const int N = 1e6+7; int a[N];

int main(){ iosbase::syncwith_stdio(false); cin.tie(NULL); long long k, t, dem = 0 , n; cin >> n >> k >> t; for(long long i = 1; i <= n; i++){ cin >> a[i];
} for(long long i = 1; i <= n; i++){ if(a[i] > k && a[i] % t == 0){ cout ...

Read full story

nam1276758928489427598 -> HSG9 Cần Thơ 2026 - Đơn hàng18 hrs

lam z dai the

Read full story

OtsgrS561 -> HSG9 Cần Thơ 2026 - Tiết kiệm1 day

#include <bits/stdc++.h> #define int long long using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; vector<int> a(n + 1); vector<int> sl(n + 1, 0); vector<int> sc(n + 1, 0); for (int i = 1; i <= n; i++) { cin >> a[i]; sc[i] = sc[i - 1]; sl[i] = sl[i - 1]; if (...

Read full story