Submission #3775380
Source Code Expand
#include <bits/stdc++.h> #define repd(i,a,b) for (int i=(a);i<(b);i++) #define rep(i,n) repd(i,0,n) typedef long long ll; using namespace std; const int MOD = 1000000007; const int INF = 1010000000; const double EPS = 1e-10; const array<pair<int,int>,4> fd{make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)}; //ll int main(){ int k,s;cin>>k>>s; int ans = 0; rep(x,k+1){ rep(y,k+1){ if(s-x-y>=0&&k>=s-x-y)ans++; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Sum of Three Integers |
User | okitz |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 499 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 7 ms | 256 KB |
subtask_1_02.txt | AC | 3 ms | 256 KB |
subtask_1_03.txt | AC | 6 ms | 256 KB |
subtask_1_04.txt | AC | 2 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 2 ms | 256 KB |
subtask_1_07.txt | AC | 5 ms | 256 KB |
subtask_1_08.txt | AC | 2 ms | 256 KB |