A cộng B

View as PDF

Submit solution


Points: 0.01 (partial)
Time limit: 1.0s
Memory limit: 512M
Input: stdin
Output: stdout

Problem source:
Just to test
Problem type
Allowed languages
C, C++, Java, Kotlin, Pascal, PyPy, Python, Scratch

Cho ~2~ số nguyên ~A~ và ~B~. Hãy tính ~A + B~.

Input

Gồm ~1~ dòng chứa ~2~ số nguyên ~A~ và ~B~ ~(1 \le A, B \le 1000)~, cách bởi ~1~ dấu cách.

Output

Ghi ra tổng ~A + B~.

Sample Input

3 4

Sample Output

7

Note

Gợi ý: Sử dụng toán tử "+".


Comments

Please read the guidelines before commenting.



  • -1
    bautroidaysao   commented on Sept. 20, 2022, 10:19 p.m.

    cho e hoi sao e lai IR bai nay a :( e dung python bth thoi a :(


    • 3
      jalsol   commented on Sept. 22, 2022, 5:29 p.m.

      Bài này cho 2 số A và B trên cùng một dòng. Hàm input() thì đọc hết nguyên một dòng luôn.

      Bạn có thể đọc input như sau:

      a, b = map(int, input().split())


  • 17
    NDAnhTuanKhongCopCode   commented on Aug. 8, 2022, 7:17 p.m.

    xin 1 upvote


  • -7
    avatarstar1133   commented on July 29, 2022, 5:11 p.m.

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


  • -7
    trantungduong   commented on June 10, 2022, 4:28 p.m.

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


  • -8
    QioCass   commented on June 9, 2022, 9:09 a.m. edit 2

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


  • -14
    caubechepcode   commented on Feb. 9, 2022, 3:38 p.m.

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


    • 1
      Minhquank25Clqd   commented on Sept. 6, 2022, 8:54 p.m.

      khum cậu ẹa:))) làm bth là đc~~


  • -10
    nictysine1   commented on Feb. 8, 2022, 2:34 p.m.

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


    • -10
      ntkiet   commented on June 7, 2022, 9:24 p.m.

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


  • -20
    AnNoProo   commented on Dec. 30, 2021, 2:27 p.m.

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


  • -8
    K24NVNTin   commented on Nov. 16, 2021, 3:57 p.m.

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


  • -15
    K24LAQUAN   commented on Nov. 16, 2021, 3:57 p.m.

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


  • -14
    mronjudge   commented on Oct. 30, 2021, 10:40 a.m.

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


  • 9
    darkkcyan   commented on Sept. 8, 2021, 4:35 p.m.

    thinkingcat


    • 2
      jalsol   commented on Sept. 9, 2021, 4:33 p.m.


    • -18
      SPyofgame   commented on Sept. 8, 2021, 4:37 p.m.

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


  • -33
    SPyofgame   commented on Sept. 8, 2021, 4:29 p.m.

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


    • -6
      ntkiet   commented on June 7, 2022, 9:23 p.m.

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


    • -9
      someone   commented on Sept. 9, 2021, 8:43 p.m.

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


    • 7
      pichu   commented on Sept. 8, 2021, 4:36 p.m.

      uoc j


  • 14
    caubecanlao   commented on Aug. 5, 2021, 10:19 a.m.

    công thức quy hoạch động khá đơn giản

    include <bits/stdc++.h>

    using namespace std; const int N = 1e3 + 1e2; int dp[N][N]; int main() { cin.tie(0)->syncwithstdio(0); dp[1][0] = 1; dp[0][1] = 1; for (int i = 1; i <= 1000; i++) { for (int j = 1; j <= 1000; j++) { dp[i][j] = max({dp[i - 1][j] - (-1), dp[i][j - 1] - (-1), dp[i - 1][j - 1] - (-2)}); } } int a, b; cin >> a >> b; cout << max(dp[a][b], dp[b][a]); return 0; }


    • -3
      HN_CSP_FTRs   commented on Jan. 8, 2022, 8:05 p.m.

      anh quả là hảo hán


    • -16
      nguyenvana123   commented on Aug. 5, 2021, 10:21 a.m.

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