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!
using namespace std;
define int long longconst int maxn = 1e5+6; int a[maxn]; int cd[maxn]; int l,r;
signed main() { ios::syncwithstdio(false); cin.tie(0); int n,q; cin >> n >> q; for (int i=1;i<=n;i++) cin >> a[i]; sort(a+1,a+n+1); for (int i=1;i<=n;i++) cd[i] = cd[i-1] + a[i]; int x,y,z...
const int MAXN=1e6+5; using namespace std; const int a[]={1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,484,529,576,625,676,729,784,841,900,961,1024,1089,1156,1225,1296,1369,1444,1521,1600,1681,1764,1849,1936,2025,2116,2...
cách giải: đối với sub1: ta chỉ duyệt các các số trong đoạn [l;r] rồi đếm số thỏa mãn. sub2: bài này thực chất là đếm các số chia hết cho 6 trong đoạn [l;r]. nó sẽ là r/6-(l-1)/6.