Tên đăng nhập Điểm Bài tập ▴ Giới thiệu
13401 630 1
13402 533 1
13403 50 1
13404 101 1
13405 20 1
13406 1601 1
13407 336 1
13408 201 1
13408 201 1
13410 1601 1
13411 201 1
13412 351 1
13413 85 1
13414 150 1
13415 101 1
13415 101 1
13415 101 1
13418 20 1
13419 101 1
13420 60 1
13421 301 1
13422 4 1
13423 101 1
13423 101 1
13425 801 1
13426 180 1
13427 101 1
13428 201 1
13429 101 1
13430 201 1
13430 201 1
13430 201 1
13430 201 1
13430 201 1
13435 401 1
13436 101 1
13436 101 1
13438 201 1
13439 92 1
13440 301 1
13441 201 1
13442 1401 1
13443 2001 1
13444 301 1
13444 301 1
13446 101 1
13446 101 1
13448 467 1

no

13449 101 1
13450 175 1
13451 60 1
13452 86 1
13453 171 1
13454 112 1
13455 201 1
13456 401 1
13457 101 1
13458 300 1
13459 401 1
13460 301 1
13461 810 1
13462 1601 1
13463 880 1
13464 40 1
13465 20 1
13466 201 1
13467 251 1
13468 101 1
13469 16 1
13470 336 1
13471 1401 1
13472 101 1
13472 101 1
13472 101 1

include <bits/stdc++.h>

using namespace std;

int main()
{
int n;
cin >> n;
cout << 2*n;
}

13475 1001 1
13476 180 1
13477 190 1

Hiiiiiiii

13478 90 1
13479 301 1
13480 101 1
13481 301 1
13482 101 1
13483 601 1
13484 101 1
13485 17 1

tấm chiếu mới .-.

13486 200 1
13486 201 1

:))))))))))))))))))))))))))

13488 301 1

include <bits/stdc++.h>

using namespace std;
int n, m, a[1000005], res, d[1000005];
int main() {
cin >> n >> m;
for ( int i = 1; i <= n; i++ ) {
cin >> a[i];
d[a[i]]++;
}
sort ( a + 1, a + 1 + n );
for ( int i = n; i >1; i-- ) {
res=res+ upper_bound ( a + 1, a + i, m - a[i] )-a-1;
}
cout<<res;
}

13489 190 1
13490 301 1

L

13490 301 1
13492 101 1
13493 301 1
13494 101 1
13494 101 1
13494 101 1
13494 101 1
13498 301 1
13499 101 1

include <iostream>

using namespace std;
int main()
{
int i;

cin >> i;
long p[i], q[i];
for (int j = 0; j < i; j++)
{
    cin >> p[j];
}
for (int j = 0; j < i; j++)
{
    if (p[j] < 4 || p[j] % 2 == 1)
    {
        cout << "-1"<<endl;
        break;
    }
    if(p[j]%4==0)
    cout<<p[j]*p[j]/16<<endl;
    else cout<<(p[j]/4)*(p[j]/4+1)<<endl; 
}
return 0;

}

13499 101 1