Submission #7254645
Source Code Expand
Copy
#include <bits/stdc++.h> using namespace std;; #define ll long long #define rep(i, n) for(int i = 0;i < n;i++) #define repr(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define FORR(i, m, n) for(int i = m;i >= n;i--) #define INF 1<<30 #define LINF 1LL<<62 #define all(x) (x).begin(), (x).end() #define mp make_pair #define pb push_back const int MOD = 1000000007; typedef pair<ll, ll> P; typedef pair<ll, P> PP; int main(){ ios::sync_with_stdio(false); cin.tie(0); ll n;cin >> n; cout << n * (n-1) / 2 << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - ModSum |
User | mathda1 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 582 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 400 / 400 | 0 / 0 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01 | AC | 1 ms | 256 KB |
sample_02 | AC | 1 ms | 256 KB |
sample_03 | AC | 1 ms | 256 KB |
testcase_01 | AC | 1 ms | 256 KB |
testcase_02 | AC | 1 ms | 256 KB |
testcase_03 | AC | 1 ms | 256 KB |
testcase_04 | AC | 1 ms | 256 KB |
testcase_05 | AC | 1 ms | 256 KB |
testcase_06 | AC | 1 ms | 256 KB |
testcase_07 | AC | 1 ms | 256 KB |
testcase_08 | AC | 1 ms | 256 KB |
testcase_09 | AC | 1 ms | 256 KB |
testcase_10 | AC | 1 ms | 256 KB |
testcase_11 | AC | 1 ms | 256 KB |
testcase_12 | AC | 1 ms | 256 KB |