Comments

• 
  

  0

  

  perkbevis2k4  commented on Nov. 24, 2024, 5:36 a.m.

  Ai muốn tham khảo code thì vô github: perk bevis nha

• 
  

  0

  

  tuyen_pham  commented on Oct. 25, 2024, 2:12 p.m.

  include <bits/stdc++.h>

  using namespace std; int n,a[1000000]; vector<int>b; int main() { int t; cin>>t; int k=1; while(t--) { cin>>n; for(int i=0; i<n; i++) cin>>a[i]; int dem=1,m=0; for(int i=0; i<n; i++) { if(a[i]<a[i+1]) dem++; else { m=max(m,dem); dem=1; } } cout<<"Test #"<<k<<" :"<<endl;k++; cout<<m<

• 
  

  0

  

  luan54bc  commented on Aug. 22, 2024, 1:37 p.m.

  include <bits/stdc++.h>

  using namespace std;

  bool nt(int n) { if (n <= 1) return false; for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) return false; } return true; }

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

  int dem = 0, vt = 0, kiluc = 0;
  for (int i = 0; i < n; i++) {
      if (nt(a[i])) {
          dem++;
          if (dem > kiluc) {
              kiluc = dem;
              vt = i - dem + 1;
          }
      } else {
          dem = 0;
      }
  }
  
  if (kiluc == 0) {
      cout << "NOT FOUND" << endl;
  } else {
      cout << kiluc << endl;
      for (int i = vt; i < vt + kiluc; i++) {
          cout << a[i] << " ";
      }
      cout << endl;
  }
  
  return 0;
  

  } bai nay em dan sai bai nay cua 46 a

• 
  

  -5

  

  Hahaaaa  commented on July 11, 2024, 4:40 a.m.

  include <bits/stdc++.h>

  using namespace std; void test(){int n;cin>>n;vector<int> a(n);vector b;string s="";for(int&i:a){cin>>i;}s+=tostring(a[0])+' ';int tmp=1,maxx=0;for(int i=1;i<n;i++){if(a[i]>a[i-1]){s+=tostring(a[i])+' ';tmp++;}else{b.pushback({s,tmp});s.clear();s+=tostring(a[i])+' ';if(tmp>maxx){maxx=tmp;}tmp=1;}if(i==n-1){b.push_back({s,tmp});}}cout<>t;int x=1;while(t--){cout<<"Test #"<<x++<<" :"<<endl;test();}} mọi người cho em hỏi em bị sai ở đâu với ạ, vẫn có testcase bị sai ạ.

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

• 
  

  -5

  

  NTH11112222  commented on June 11, 2024, 1:43 p.m.

  include <bits/stdc++.h>

  using namespace std; void xuat(vector<int>& subseq) { for (int num : subseq) { cout << num << " "; } cout << endl; } int main() { int T; cin >> T; for (int t = 1; t <= T; ++t) { int N; cin >> N; vector<int> A(N); for (int i = 0; i < N; ++i) { cin >> A[i]; } int maxlen = 0; vector allsubseq; vector<int> subseq; for (int i = 0; i < N; ++i) { if (i == 0 || A[i] > A[i - 1]) { subseq.pushback(A[i]); } else { if (subseq.size() >= maxlen) { if (subseq.size() > maxlen) { allsubseq.clear(); maxlen = subseq.size(); } allsubseq.pushback(subseq); } subseq.clear(); subseq.pushback(A[i]); } } if (subseq.size() >= maxlen) { if (subseq.size() > maxlen) { allsubseq.clear(); maxlen = subseq.size(); } allsubseq.pushback(subseq); } cout << "Test #" << t << " :\n"; cout << maxlen << endl; for (vector<int>& seq : allsubseq) { xuat(seq); } } return 0; } Bài giải chỉ mang tính chất tham khảo cho những ai chưa biết làm nhé!

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