/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 2ms 320.0 KiB
#3 Accepted 1ms 496.0 KiB
#4 Wrong Answer 2ms 428.0 KiB
#5 Wrong Answer 22ms 588.0 KiB
#6 Wrong Answer 22ms 584.0 KiB
#7 Wrong Answer 22ms 764.0 KiB
#8 Wrong Answer 23ms 620.0 KiB

Code

#include <bits/stdc++.h>

using namespace std;

int main() {
    int t;cin>>t;
    while(t--){
    /*
      int n;cin>>n;
      vector<int>vl(n);
      for(int i=0;i<n;i++)cin>>vl[i];
      
      vector<int> vll(n+1,0);
        bool flag = true;
        for (int u: vl) {
            if (u< 1 || u> n || vll[u] != 0) {
                flag = false;
                break;
            }
            vll[u]++;
        }
        
        if(flag)cout<<"YES"<<endl;
        else cout<<"NO"<endl;*/
        int n;cin>>n;
        if(n%2==0)cout<<n/2<<endl;
        else cout<<(n-1)/2<<endl;
        
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1052 Yet Another Array Partition
Contest
Brain Booster #3
Language
C++20 (G++ 13.2.0)
Submit At
2024-05-06 15:41:27
Judged At
2024-10-03 13:51:39
Judged By
Score
10
Total Time
23ms
Peak Memory
764.0 KiB