Submission #24106207

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;

int main(){

  ll a,b;
  cin >> a >> b;
  if(b-a+1>0){
    cout << b-a+1 << endl;
  }else{
    cout << 0 << endl;
  }
}

Submission Info

Submission Time
Task A - Counting
User takkey
Language C++ (GCC 9.2.1)
Score 100
Code Size 624 Byte
Status AC
Exec Time 8 ms
Memory 3568 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 9
Set Name Test Cases
Sample sample_00.txt, sample_01.txt, sample_02.txt
All case_00.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, sample_00.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
case_00.txt AC 8 ms 3552 KiB
case_01.txt AC 2 ms 3568 KiB
case_02.txt AC 2 ms 3440 KiB
case_03.txt AC 2 ms 3524 KiB
case_04.txt AC 2 ms 3556 KiB
case_05.txt AC 2 ms 3440 KiB
sample_00.txt AC 1 ms 3528 KiB
sample_01.txt AC 2 ms 3544 KiB
sample_02.txt AC 2 ms 3524 KiB