[Mảng 1 Chiều Cơ Bản]. Bài 38. Tổng dãy số

View as PDF

Submit solution

All submissions

Best submissions

Points: 1.00 (partial)

Time limit: 1.0s

Memory limit: 256M

Input: stdin

Output: stdout

Author:

28tech.com.vn

Problem source:

28Tech

Problem type

Allowed languages

C, C#, C++, Java, Kotlin, Pascal, PyPy, Python, Scratch

Cho mảng A[] gồm N phần tử, bạn hãy tính tổng của 2 số liên tiếp, 3 số liên tiếp, 4 số liên tiếp trong mảng.

Đầu vào

Dòng 1 là N : số phần tử trong mảng
Dòng 2 là N số trong mảng viết cách nhau 1 dấu cách

Giới hạn

4<=N<=1000
0<=A[i]<=1000

Đầu ra

Dòng 1 in ra tổng 2 số liên tiếp trong mảng
Dòng 2 in ra tổng 3 số liên tiếp trong mảng
Dòng 3 in ra tổng 4 số liên tiếp trong mảng

Ví dụ :

Input 01

8
5 17 4 17 2 13 7 14

Output 01

22 21 21 19 15 20 21 
26 38 23 32 22 34 
43 40 36 39 36

Comments

Please read the guidelines before commenting.

ngocminh commented on Aug. 17, 2026, 12:35 a.m.

include<bits/stdc++.h>

using namespace std;

int a[1001];

int main(){

int n; cin >> n;

for(int i = 0; i < n; i ++) cin >> a[i];

for(int i = 0; i < n-1; i ++) cout << a[i] + a[i+1] << " "; cout << endl;

for(int i = 0; i < n-2; i ++) cout << a[i] + a[i+1] + a[i+2] << " "; cout << endl;

for(int i = 0; i < n-3; i ++) cout << a[i] + a[i+1] + a[i+2] + a[i+3] << " "; cout << endl;

return 0;

}

Tuan_Khoi commented on July 29, 2026, 2:17 p.m.

FULL AC: (khá giống giống sliding window)

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
   int n; cin>> n;
   int a[n];
   for(int i=0;i < n;i++)
   {
 cin>> a[i];
   }
   for(int i=0;i < n-2+1;i++)
   {
    cout<< a[i]+a[i+1] <<" ";
   }
   cout<< endl;
     for(int i=0;i < n-3+1;i++)
   {
    cout<< a[i]+a[i+1]+a[i+2] <<" ";
   }
   cout<< endl;
   for(int i=0;i < n-4+1;i++)
   {
cout<< a[i]+a[i+1]+a[i+2]+a[i+3] <<" ";
   }
    return 0;
    }

-1

KieuQuangMinh commented on May 24, 2026, 6:17 a.m.

include<bits/stdc++.h>

using namespace std;

int main(){

int n; cin >> n;
int a[n];
for(int i=1;i<=n;i++) cin >> a[i];
int sum=0;
vector<int> v;
for(int i=1;i<=n-1;i++){
    sum=a[i]+a[i+1];
    v.push_back(sum);
    sum=0;
}
for(int x:v) cout << x << " ";
cout << "\n";
v.clear();
for(int i=1;i<=n-2;i++){
    sum=a[i]+a[i+1]+a[i+2];
    v.push_back(sum);
    sum=0;
}
for(int y:v) cout << y << " ";
cout << "\n";
v.clear();
for(int i=1;i<=n-3;i++){
    sum=a[i]+a[i+1]+a[i+2]+a[i+3];
    v.push_back(sum);
    sum=0;
}
for(int z:v) cout << z << " ";
return 0;

}

-1

Hoshino commented on May 6, 2026, 2:26 p.m.

include<bits/stdc++.h>

using namespace std;

define ll long long

ll a[1123456],b[1123456],d1,d2,s,s1,s2,maxx=LLONGMIN,minn=LLONGMAX,maxx2=LLONGMIN,x,k,n,m; ll mark[11234567]; int main() { iosbase::syncwithstdio(false); cin.tie(nullptr); cin>>n; for(ll i=1; i<=n; i++) { cin>>a[i]; } for(ll i=2;i<=n;i++) { s=a[i]+a[i-1]; cout<<s<<" "; } cout<<'\n'; for(ll i=3;i<=n;i++) { s1=a[i]+a[i-1]+a[i-2]; cout<<s1<<" "; } cout<<'\n'; for(ll i=4;i<=n;i++) { s2=a[i]+a[i-1]+a[i-2]+a[i-3]; cout<<s2<<" "; } cout<<'\n'; return 0; }

-1
kietne commented on Dec. 29, 2025, 5:01 a.m.
include <bits/stdc++.h>

using namespace std; using ll = long long; using ull = unsigned long long;

int main() { ios::syncwithstdio(false); cin.tie(nullptr); int n; cin >> n; int a[n]; for (auto &i : a) cin >> i; for (int i = 0; i < n - 1; i++) { cout << a[i] + a[i + 1] << " "; } cout << "\n"; for (int i = 0; i < n - 2; i++) { cout << a[i] + a[i + 1] + a[i + 2] << " "; } cout << "\n"; for (int i = 0; i < n - 3; i++) { cout << a[i] + a[i + 1] + a[i + 2] + a[i + 3] << " "; }

return 0;

}

-2

hngoc commented on July 6, 2025, 1:57 p.m.

n=int(input())
a=list(map(int, input().split()))
for i in range(2, 5):
    for j in range(n-i+1):
        t=0
        for k in range(j, j+i):
            t+=a[k]
        print(t,end=' ')
    print()

-1

aduangzi commented on July 1, 2025, 3:43 p.m.

oke predix sum

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    freopen("vao.inp","r",stdin);
    freopen("ra.out","w",stdout);
    int n;
    cin >> n;
    vector<int> a(n),f(n);
    for (auto& x : a)
        cin >> x;
    f[0] = a[0];
    for (int i = 1; i < n; i++)
        f[i] = f[i-1] + a[i];
    int idx = 2, k = 3;
    while (k--)
    {
        for (int i = 0; i <= n - idx; i++)
        {
            if (i == 0)
                cout << f[i+idx-1] << " ";
            else
                cout << f[i+idx-1] - f[i-1] << " ";
        }
        idx++;
        cout << endl;
    }
return 0;
}

-2

VDev commented on Jan. 18, 2025, 5:02 a.m.

FULL AC

#include <bits/stdc++.h>
#include <iomanip>
#include <cmath>
#include <climits>
#define ll long long
using namespace std;
ll a[10000011];
ll cnt = 0, s = 0, mark[10000011];

int main(){
    ll n;
    cin >> n;
    for(ll i = 0; i < n; i++){
        cin >> a[i];
    }
    for(ll i = 0; i < n - 1; i++){
        cout << a[i] + a[i + 1] << " ";
    }
    cout << endl;
    for(ll i = 0; i < n - 2; i++){
        cout << a[i] + a[i + 1] + a[i + 2] << " ";
        }
        cout << endl;
        for(ll i = 0; i < n - 3; i++)
            cout << a[i] + a[i + 1] + a[i + 2] + a[i + 3] << " ";
    return 0;
}

-5

itachi123 commented on Sept. 2, 2024, 8:50 a.m.

include<bits/stdc++.h>

using namespace std; int main() { int n;cin>>n; int a[n]; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;(i + 1) <= (n - 1);i++) { int x = i; int tong = 0; while(i<=x+1) { tong+=a[i]; ++i; } cout<<tong<< " "; i=x; } cout<<endl; for(int i=0;(i + 2) <= (n - 1);i++) { int x = i; int tong = 0; while(i<=x+2) { tong+=a[i]; ++i; } cout<<tong<< " "; i=x; } cout<<endl; for(int i=0;(i + 3) <= (n - 1);i++) { int x = i; int tong = 0; while(i<=x+3) { tong+=a[i]; ++i; } cout<<tong<< " "; i=x; } }

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

-5

hairep2005 commented on July 17, 2024, 1:49 a.m.

include<bits/stdc++.h>

using namespace std ; int mark[10000000] ; int main(){ int n ; cin>> n ; int a[n] ;int b[n];int c[n] ; for(int i=0;i<n;i++){ cin>>a[i] ; b[i] = a[i] ; c[i] = a[i]; } for(int i=0;i<n-1;i++){ a[i]+=a[i+1] ; } for(int i=0;i<n-2;i++){ b[i] =b[i] +b[i+1]+ b[i+2] ; } for(int i=0;i<n-3;i++){ c[i]=c[i]+c[i+1]+c[i+2]+c[i+3] ; } for(int i=0;i<n-1;i++){ cout<<a[i]<<" " ; } cout<<endl ; for(int i=0;i<n-2;i++){ cout<<b[i]<<" " ; } cout<<endl ; for(int i=0;i<n-3;i++){ cout<<c[i]<<" " ; } }

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

-6

VuxPerfect commented on June 11, 2024, 9:34 a.m.

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

-7

xuanthinh commented on April 29, 2024, 1:02 a.m.

include <bits/stdc++.h>

using namespace std;

define ll long long

define FOR(i,l,r) for(int i=l;i<=r;i++)

define FOR2(i,r,l) for(int i=r;i>=l;i--)

ll a[1001],f[1001]; ll n,k,x,tam,maxx=-1000008,minn=10000007; vector<int>v1,v2; int main() { iosbase::syncwith_stdio(false); cin.tie(NULL); cin>>n; f[0]=0; FOR(i,1,n) { cin>>a[i]; f[i]=f[i-1]+a[i]; } FOR(i,2,n) { cout<<f[i]-f[i-2]<< " "; } cout<<endl; FOR(i,3,n) { cout<<f[i]-f[i-3]<< " "; } cout<<endl; FOR(i,4,n) { cout<<f[i]-f[i-4]<< " "; } return 0; }

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