/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 324.0 KiB
#2 Wrong Answer 2ms 320.0 KiB
#3 Wrong Answer 185ms 1.02 MiB
#4 Wrong Answer 183ms 1.414 MiB

Code


//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define Endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{

  int n;
  cin>>n;
  cout<<n/2 -1<<endl;



}
int32_t main()
{
    ios::sync_with_stdio(false);
    //faster
    TC
    {
        //cout<<"Case "<<i<<": ";
        s();

    }



}




Information

Submit By
Type
Submission
Problem
P1073 Pair Sum
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 15:42:47
Judged At
2024-10-03 13:30:22
Judged By
Score
0
Total Time
185ms
Peak Memory
1.414 MiB