Submission #376663
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int MOD = 1e9+7; typedef long long ll; const int INF = 1e9; int main(void) { int A,B; cin >> A >> B; vector<ll> a(1000001); for(ll i=0;i<1000001;i++){ a[i] = i*i*(i+1)/2; } ll ans = 0; for(int i=A;i<=B;i++){ ans += a[i]; ans %= (ll)1e9+7; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Counting on a Triangle |
User | tkzw_21 |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 362 Byte |
Status | AC |
Exec Time | 52 ms |
Memory | 8736 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 80 / 80 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask0_sample_01.txt, subtask0_sample_02.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 42 ms | 8608 KB |
subtask0_sample_02.txt | AC | 41 ms | 8732 KB |
subtask0_sample_03.txt | AC | 40 ms | 8736 KB |
subtask1_01.txt | AC | 42 ms | 8608 KB |
subtask1_02.txt | AC | 43 ms | 8608 KB |
subtask1_03.txt | AC | 41 ms | 8608 KB |
subtask1_04.txt | AC | 42 ms | 8608 KB |
subtask1_05.txt | AC | 42 ms | 8608 KB |
subtask1_06.txt | AC | 42 ms | 8612 KB |
subtask1_07.txt | AC | 43 ms | 8544 KB |
subtask1_08.txt | AC | 41 ms | 8612 KB |
subtask1_09.txt | AC | 43 ms | 8612 KB |
subtask1_10.txt | AC | 43 ms | 8608 KB |
subtask1_11.txt | AC | 42 ms | 8612 KB |
subtask2_01.txt | AC | 49 ms | 8608 KB |
subtask2_02.txt | AC | 52 ms | 8616 KB |
subtask2_03.txt | AC | 44 ms | 8612 KB |
subtask2_04.txt | AC | 44 ms | 8616 KB |
subtask2_05.txt | AC | 42 ms | 8616 KB |
subtask2_06.txt | AC | 45 ms | 8616 KB |
subtask2_07.txt | AC | 47 ms | 8616 KB |
subtask2_08.txt | AC | 44 ms | 8612 KB |
subtask2_09.txt | AC | 51 ms | 8600 KB |
subtask2_10.txt | AC | 51 ms | 8608 KB |
subtask2_11.txt | AC | 51 ms | 8600 KB |
subtask2_12.txt | AC | 49 ms | 8612 KB |