全部评论 8

  • 13行开始

    2024-01-31 来自 江苏

    1
  • for(int i=0;i<=100000;i++){
    if(m[i]>maxi1){
    maxi1=m[i];
    num = i;
    }
    }

    2024-01-31 来自 江苏

    1
  • 烤骨

    2天前 来自 江苏

    0
  • na
    na
    na\na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na
    na\

    展开全部

    2天前 来自 江苏

    0
  • #include <algorithm>
    #include<bits/stdc++.h>
    #include <iostream>
    using namespace std;
    int main(){
    short n;
    cin>>n;
    short x;
    short s[1000000]={0};
    for(short i=0;i<n;i++){
    cin>>x;
    s[x];
    }cout<<max_element(s,s+1000000)-s;
    return 0;
    }#include <algorithm>
    #include<bits/stdc
    .h>
    #include <iostream>
    using namespace std;
    int main(){
    short n;
    cin>>n;
    short x;
    short s[1000000]={0};
    for(short i=0;i<n;i++){
    cin>>x;
    s[x];
    }cout<<max_element(s,s+1000000)-s;
    return 0;
    }#include <algorithm>
    #include<bits/stdc
    .h>
    #include <iostream>
    using namespace std;
    int main(){
    short n;
    cin>>n;
    short x;
    short s[1000000]={0};
    for(short i=0;i<n;i++){
    cin>>x;
    s[x];
    }cout<<max_element(s,s+1000000)-s;
    return 0;
    }#include <algorithm>
    #include<bits/stdc
    .h>
    #include <iostream>
    using namespace std;
    int main(){
    short n;
    cin>>n;
    short x;
    short s[1000000]={0};
    for(short i=0;i<n;i++){
    cin>>x;
    s[x];
    }cout<<max_element(s,s+1000000)-s;
    return 0;
    }#include <algorithm>
    #include<bits/stdc
    .h>
    #include <iostream>
    using namespace std;
    int main(){
    short n;
    cin>>n;
    short x;
    short s[1000000]={0};
    for(short i=0;i<n;i++){
    cin>>x;
    s[x]++;
    }cout<<max_element(s,s+1000000)-s;
    return 0;
    }

    2天前 来自 江苏

    0
  • e

    2天前 来自 江苏

    0
  • 代码?

    2024-01-31 来自 浙江

    0
  • 真就无语了

    2023-07-18 来自 上海

    0
暂无数据

提交答案之后,这里将显示提交结果~

首页