A cộng B

View as PDF

Submit solution


Points: 0.01 (partial)
Time limit: 1.0s
Memory limit: 512M

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

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.



  • 0
    K24NVNTin  commented on 16, Nov, 2021, 15:57

    B-)


  • -1
    K24LAQUAN  commented on 16, Nov, 2021, 15:57

    bài này phù hợp để lên điểm nhé ae


  • -3
    mronjudge  commented on 30, Oct, 2021, 10:40

    bài khó quá


  • 9
    darkkcyan  commented on 8, Sep, 2021, 16:35

    thinkingcat

    • 1
      jalsol  commented on 9, Sep, 2021, 16:33


    • -5
      SPyofgame  commented on 8, Sep, 2021, 16:37

      This comment is hidden due to too much negative feedback. Click here to view it.


  • -18
    SPyofgame  commented on 8, Sep, 2021, 16:29

    This comment is hidden due to too much negative feedback. Click here to view it.


    • -1
      someone  commented on 9, Sep, 2021, 20:43

      chịu thật nếu idea như này cho mình xin code với


    • 8
      pichu  commented on 8, Sep, 2021, 16:36

      uoc j


      • -10
        SPyofgame  commented on 8, Sep, 2021, 16:37

        This comment is hidden due to too much negative feedback. Click here to view it.


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

    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; }


    • -8
      nguyenvana123  commented on 5, Aug, 2021, 10:21

      This comment is hidden due to too much negative feedback. Click here to view it.