/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 536.0 KiB
#3 Accepted 17ms 876.0 KiB
#4 Accepted 18ms 1.328 MiB

Code

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl '\n'
#define int long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int mxn = 1e6 + 123;
int a[mxn],b[mxn];
void solve(){
	int n;
	cin>>n;
	cout<<(n-1)/2<<endl;
} 
signed main() {
    fastio;
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
} 

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:35:33
Judged At
2024-11-11 03:18:46
Judged By
Score
100
Total Time
18ms
Peak Memory
1.328 MiB