/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Wrong Answer 2ms 520.0 KiB
#2 Wrong Answer 2ms 404.0 KiB
#3 Accepted 2ms 336.0 KiB
#4 Wrong Answer 2ms 496.0 KiB
#5 Time Exceeded ≥1071ms ≥568.0 KiB
#6 Time Exceeded ≥1076ms ≥560.0 KiB
#7 Time Exceeded ≥1059ms ≥548.0 KiB
#8 Time Exceeded ≥1022ms ≥556.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main () {
  int t = 1;
  cin >> t;
  while (t--) {
      int n, x, ans = INT_MAX;
      cin >> n;
      if (n%2) {
          ans = n;
          for (int i = 2; i*i <= n; i++) {
              if (n%i == 0) {
                  ans = min (ans, min (i, n/i));
              }
          }
      }
      else ans = n/2;
      cout << ans << "\n";
  }
}

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:18:58
Judged At
2024-10-03 13:52:26
Judged By
Score
5
Total Time
≥1076ms
Peak Memory
≥568.0 KiB