Submission #1983372


Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <numeric>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

/*************** using variables ***************/
int k, s;
int ans = 0;
/**********************************************/

int main(){
    cin >> k >> s;
    
    FOR(i, 0, k+1){
        FOR(j, 0, k+1){
            FOR(m, 0, k+1){
                if(i+j+m == s) ans++;
            }
        }
    }

    cout << ans << endl;
}

Submission Info

Submission Time
Task B - Sum of Three Integers
User wheson
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1169 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 2
AC × 7
TLE × 3
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 TLE 2103 ms 256 KB
subtask_1_02.txt AC 761 ms 256 KB
subtask_1_03.txt TLE 2103 ms 256 KB
subtask_1_04.txt AC 1128 ms 256 KB
subtask_1_05.txt AC 3 ms 256 KB
subtask_1_06.txt AC 146 ms 256 KB
subtask_1_07.txt TLE 2103 ms 256 KB
subtask_1_08.txt AC 61 ms 256 KB