Comments

• 
  

  0

  

  bennie15025_meow  commented on July 31, 2025, 1:31 p.m.

  Code này tle 2 test nhé:

  include<bits/stdc++.h>

  using namespace std; typedef long long ll; const ll ma=1e6; vector<ll>fib(ma+5); void sang() { fib[0]=0; fib[1]=1; for(ll i=2;i<=ma;i++) fib[i]=fib[i-1]+fib[i-2]; } ll a[ma+5],n,d=0; int main() { os::syncwithstdio(0); cin.tie(nullptr); sang(); cin>>n; for(ll i=0;i<n;i++) { cin>>a[i]; ll x=count(fib.begin(),fib.end(),a[i]); if(x!=0){ cout<<a[i]<<" "; d++; } } if(d==0)cout<<"NONE"; }

• 
  

  0

  

  panchi146  commented on July 30, 2025, 1:24 p.m. ← edit 3 →

  include <bits/stdc++.h>

  using namespace std;
  
  int main(){
      int n;
      cin >> n;
      int a[n];
      int max = 0, min = 100000, imax = 0, imin = 0;
      for(int i=0; i < n; i++) cin >> a[i];
  
      for(int i=0; i < n; i++){
          if(a[i]>max){
              max=a[i];
              imax=i;
          }
          if(a[i]<=min){
              min=a[i];
              imin=i;
          }
      }
      cout << imin << " " << imax << endl;
      return 0;
  }
  

• 
  

  0

  

  chau2010  commented on July 25, 2025, 7:19 a.m.

  void solve() { int n,index=-1; cin>>n; vector<int> v1(n), v2; for(int&i:v1)cin>>i; v2 = v1; sort(v2.begin(), v2.end()); for(int i=0;i<n;i++) if(v1[i] == v2[0]) index = i; cout << index << ' '; for(int i=0;i<n;i++){ if(v1[i] == v2[n-1]){ cout << i; return; } }

  }
  

• 
  

  -1

  

  vanh14  commented on July 9, 2025, 6:20 a.m.

  Làm trâu như thế này mà cũng đc AC :))

  include <algorithm>

  include <set>

  include <iostream>

  include<vector>

  include <unordered_set>

  include<math.h>

  include <string>

  using namespace std;

  define ll long long

  int main() { ll n; cin >> n; ll x, dem = 0, mo=0; vector<ll> a; for (ll i = 0; i < n; i++) { cin >> x; a.push_back(x); } ll max = a[0]; ll min = a[1]; for (ll k = 0; k < n; k++) { if(a[k]>max){ max = a[k];

      }
      if (a[k] < min) {
          min = a[k];
      }
  }
  for (ll k = 0; k < n; k++) {
      if (a[k] == min) {
          dem++;
      }
  }
  for (ll k = 0; k < n; k++) {
      if (a[k] == min) {
          mo++;
          if (mo == dem) {
              cout << k << " ";
          }
      }
  }
  for (ll k = 0; k < n; k++) {
      if (a[k] == max) {
          cout << k;
          break;
      }
  }
  return 0;
  

  }

• 
  

  0

  

  bengokyeuanh99  commented on July 9, 2025, 11:05 a.m.

  include <set>

  include <unordered_set>

  include <string>

  include <cmath>

  include <algorithm>

  …mà không dùng 1 cái nào 🤡 Code xấu nhưng số hưởng, miễn pass là được, còn sạch để sau kkk

• 
  

  -5

  

  gryphware  commented on Nov. 24, 2024, 2:02 p.m.

  include <stdio.h>

  include <limits.h>

  int main(){

  int indexOfMin, indexOfMax;
  int min = INT_MAX, max = INT_MIN;
  
  int size; 
  scanf("%d", &size);
  
  for(size_t i = 0; i < size; i++){
      int num;
      scanf("%d", &num);
  
      if(min > num){
          min = num;
          indexOfMin = i;
      } else if (min == num){
          indexOfMin = i;
      }
      if(max < num){
          max = num;
          indexOfMax = i;
      }
  }
  
  printf("%d %d", indexOfMin, indexOfMax);
  
  return 0;
  

  }

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

• 
  

  -3

  

  ichingu  commented on Nov. 6, 2024, 1:50 p.m.

  

• 
  

  -2

  

  khanhhduy_1305  commented on Sept. 14, 2024, 3:52 a.m.

  include<bits/stdc++.h>

  using namespace std; int main() { int n,x; vector<int> v; cin>>n; int maxn,minn; for(int i=0;i<n;i++) { cin>>x; v.pushback(x); } auto it=maxelement(v.begin(),v.end()); auto ki=min_element(v.begin(),v.end()); for(int i=0;i<v.size();i++) { if(v[i]==ki) minn=i; } for(int i=0;i<v.size();i++) { if(v[i]==it) {maxn=i;break;} } cout<<minn<<" "<<maxn; }

• 
  

  -13

  

  theguy777_jaboi  commented on July 31, 2024, 3:01 a.m.

  

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

• 
  

  -7

  

  kyvynguyen2006  commented on July 28, 2024, 6:38 a.m.

  include <bits/stdc++.h>

  using namespace std;

  int a[10000007];

  int main() { int n; cin >> n; for(int i = 0; i < n; i++) cin >> a[i]; int max = a[0], vtmax = 0, min = a[0], vtmin = 0; for(int i = 1; i < n; i++) { if (a[i] > max) { max = a[i]; } if (a[i] < min) { min = a[i]; } } for(int i = 0; i < n; i++) { if (max == a[i]) { vtmax = i; break; } } for(int i = n-1; i >= 0; i--) { if (min == a[i]) { vtmin = i; break; } } cout << vtmin << " " << vtmax;

  return 0;
  

  }

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

• 
  

  0

  

  truongkiritokun  commented on July 13, 2024, 12:32 p.m.

  using System; using System.Net;

  namespace Work { internal class MainControl {

      static void Main(string[] args)
      {
          int n = int.Parse(Console.ReadLine());
          string[] w = Console.ReadLine().Split(' ');
          int[] p = new int[n];
          for (int i = 0; i < n; i++)
          {
              p[i] = int.Parse(w[i]);
          }
          solve((arr) =>
          {
              int min = int.MaxValue, idxmin = 0;
              int max = int.MinValue, idxmax = 0;
              for (int i = 0; i < arr.Length; i++)
              {
                  if(arr[i] <= min)
                  {
                      min = arr[i];
                      idxmin = i;
                  }
                  if (arr[i] > max)
                  {
                      max = arr[i];
                      idxmax = i;
                  }
              }
              Console.WriteLine($"{idxmin} {idxmax}");
          }, p);
      }
      static void solve(Action<int[]> act, int[] a) => act(a);
  }
  

  }

• 
  

  -4

  

  longhk2012  commented on July 12, 2024, 6:14 a.m.

  .

• 
  

  -5

  

  longhk2012  commented on July 12, 2024, 6:14 a.m.

  bai nay kho hieu qua

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

• 
  

  -2

  

  kytoLam  commented on July 21, 2024, 4:04 p.m.

  hm,

• 
  

  -4

  

  hackerlo2803  commented on June 30, 2024, 5:30 p.m.

  .

• 
  

  -17

  

  Itachi  commented on May 1, 2024, 1:03 a.m.

  include<bits/stdc++.h>

  using namespace std;

  define ll long long;

  int main(){ ios::syncwithstdio(false); cin.tie(0);cout.tie(0); int n; cin>>n; int a[n]; int maxx=-1e9; int minn=1e9; int vt1,vt2; for(int i=0;i<n;i++){ cin>>a[i]; if(a[i]>maxx) {maxx=a[i]; vt1=i;} } for(int i=n-1;i>=0;i--){ if(a[i]<minn) { minn=a[i]; vt2=i; } } cout<<vt2<<" "<<vt1; return 0; }

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