ĐẾM HÌNH

View as PDF
Submit solution
Points: 100.00 (partial)
Time limit: 1.0s
Memory limit: 512M
Input: stdin
Output: stdout
Problem type
Allowed languages
Python, Scratch

Comments

Please read the guidelines before commenting.


  • 0
    kietjumper   commented on Nov. 5, 2024, 10:46 p.m.

    include <bits/stdc++.h>

    using namespace std;

    int main() { int n, m , k; cin >> n >> m; k = min(n, m); long long s = 0; for (int i = 1;i <= k; i+=2){ s += (m-i+1)*(n-i+1); } cout<< s; }

    Khong co C++ :(((


  • 0
    tinhoc   commented on Aug. 18, 2024, 8:07 a.m.

    dem=0, i=1, lặp cho đến khi i>M hoặc i>N: dem=dem+(M+1-i)*(N+1-i), i=i+2


  • 1
    titantvman123   commented on July 6, 2024, 2:28 p.m. ← edit 4

    print("How")


  • 2
    KhiemNguyen   commented on June 28, 2024, 2:39 p.m.

    M=int(input()) N=int(input()) T=0 while (M>0)and(N>0): T+=M*N M-=2 N-=2 print(T)


  • -1
    thienthansanga2k13   commented on June 27, 2024, 2:18 p.m.

    tui làm được nhưng ràng buộc thì ko hiểu


  • -3
    giaminh   commented on June 26, 2024, 9:25 p.m.

    hiểu nhưng ko biết làm


  • -1
    HDG_12   commented on June 23, 2024, 7:54 a.m.

    SOS


  • -2
    tamduc   commented on June 17, 2024, 4:28 p.m.

    help me sos


  • 2
    tdhung2014   commented on June 11, 2024, 12:56 p.m.

    tôi hiểu đề bài nhưng ko biết làm


  • -5
    dangkhoi162013   commented on June 8, 2024, 8:38 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • 2
    ruby_annhien   commented on June 8, 2024, 6:14 p.m.

    pls help, mình ko biết làm


  • 2
    Camthao   commented on June 7, 2024, 6:01 p.m.

    đọc xong k hiểu j lun ó 😔🤨🤔


  • -2
    caodinhvinh2015   commented on June 6, 2024, 9:42 a.m.

    làm bằng scratch thì làm sao ạ?


    • 0
      KhiemNguyen   commented on June 28, 2024, 2:34 p.m.

      https://scratch.mit.edu/projects/1042902581/editor


  • -9
    KPKTuan   commented on May 28, 2024, 2:44 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • -7
    stulive55   commented on May 11, 2024, 3:44 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


  • 0
    anhducthcq   commented on May 5, 2024, 9:20 a.m.

    khó théeeeeeeeeeeeeeeeeeeeeee


  • 5
    MinhMinh2013   commented on March 21, 2024, 10:43 a.m.

    Bài này dễ mà! Cho M là số cột còn N là số hàng. Để đếm được số hình vuông có cạnh lẻ có trong hình, ta lấy MxN rồi M-2 x N-2(vì yêu cầu lấy số lẻ) làm như vậy sẽ tạo ra một đệ quy cho đến khi M-K x N-K = 1 mới thôi


    • 0
      SK24_A648   commented on June 10, 2024, 9:09 a.m.

      k đâu ra


    • 0
      truongphat   commented on June 9, 2024, 8:02 a.m.

      lặp lại cho đén khi n-k*M-k == 0


    • 0
      haidz118   commented on May 2, 2024, 9:15 p.m.

      ko hiểu


    • 0
      mtxvu23   commented on March 21, 2024, 10:43 a.m. ← edit 3

      Lần sau click reply nhé -_-(Tiện thể không hiểu OvOb)


  • 4
    mtxvu23   commented on March 21, 2024, 9:09 a.m.

    Pls help :3:


  • 5
    Quangnt   commented on March 16, 2024, 10:17 p.m.

    làm như nào vậy mn