Comments

• 
  

  0

  

  dungdeptrai  commented on Feb. 23, 2025, 4:31 a.m.

  Gop vui 1 cach giai don gian

  include <stdio.h>

  include <math.h>

  void winK(int a[], int n, int k){ int sum = 0; int tmp = 0; while(k<=n){ for(int i = tmp; i<k;i++){ sum += a[i]; } printf("%d ", sum); sum = 0; ++tmp; ++k; } }

  int main(){ int n, k; scanf("%d%d", &n, &k); int a[n]; for(int i = 0; i < n; i++){ scanf("%d", &a[i]); } winK(a, n, k); return 0; }

• 
  

  0

  

  duongqt34  commented on Feb. 14, 2025, 2:21 p.m.

  include<bits/stdc++.h>

  using namespace std;

  define int long long

  const int mod=1000007; const int N=1e5+5; signed main(){ iosbase::syncwith_stdio(false); cin.tie(NULL);cout.tie(NULL); int n,k; cin>>n>>k; vector<int> a(n+1); vector<int> p(n+1,0); for(int i=1;i<=n;i++){ cin>>a[i]; p[i]=(p[i-1]+a[i]); } for(int i=1;i+k-1<=n;i++){ cout<<p[i+k-1]-p[i-1]<<' '; } return (0&1); }

• 
  

  0

  

  MisolHo  commented on Jan. 19, 2025, 7:16 a.m.

  include <bits/stdc++.h>

  using namespace std;

  int main() { int n, k; cin >> n >> k;

  int a[n];
  for(int i = 0 ; i < n ; i++){
      cin >> a[i];
  }
  for(int i = 0 ; i <= n-k ; i++){
      int s = 0;
      for(int j = i ; j < k+i ; j++){
          s+=a[j];
      }
      cout << s << " ";
  }
  return 0;
  

  }

• 
  

  2

  

  VDev  commented on Jan. 18, 2025, 12:12 p.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, k;
      cin >> n >> k;
      for(ll i = 0; i < n; i++){
          cin >> a[i];
      }
      for(ll i = 0; i <= n - k; i++){
              cnt = 0;
              for(ll j = 0; j < k; j++){
              cnt += a[i + j];
              }
              cout << cnt << " ";
      }
      return 0;
  }
  

• 
  

  0

  

  nguyen_luong_an  commented on Dec. 18, 2024, 8:42 p.m.

  <3

• 
  

  -34

  

  minhtran1482003  commented on April 22, 2024, 12:20 p.m.

  hi

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