Submission #73156724

Source Code Expand

#include <algorithm>
//#include <atcoder/all>
//#include <array>
//#include <bitset>
//#include <cmath>
//#include <deque>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll k; cin >> k;
    cout << k + 1 << endl;
}

Submission Info

Submission Time
Task A - Bacteria Growth Experiment
User scotch_at
Language C++23 (GCC 15.2.0)
Score 166
Code Size 1048 Byte
Status AC
Exec Time 1 ms
Memory 3692 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 166 / 166
Status
AC × 3
AC × 47
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3532 KiB
in02.txt AC 1 ms 3560 KiB
in03.txt AC 1 ms 3532 KiB
in04.txt AC 1 ms 3516 KiB
in05.txt AC 1 ms 3596 KiB
in06.txt AC 1 ms 3504 KiB
in07.txt AC 1 ms 3552 KiB
in08.txt AC 1 ms 3428 KiB
in09.txt AC 1 ms 3620 KiB
in10.txt AC 1 ms 3620 KiB
in11.txt AC 1 ms 3532 KiB
in12.txt AC 1 ms 3528 KiB
in13.txt AC 1 ms 3552 KiB
in14.txt AC 1 ms 3692 KiB
in15.txt AC 1 ms 3692 KiB
in16.txt AC 1 ms 3464 KiB
in17.txt AC 1 ms 3428 KiB
in18.txt AC 1 ms 3560 KiB
in19.txt AC 1 ms 3432 KiB
in20.txt AC 1 ms 3432 KiB
in21.txt AC 1 ms 3612 KiB
in22.txt AC 1 ms 3552 KiB
in23.txt AC 1 ms 3532 KiB
in24.txt AC 1 ms 3692 KiB
in25.txt AC 1 ms 3624 KiB
in26.txt AC 1 ms 3616 KiB
in27.txt AC 1 ms 3532 KiB
in28.txt AC 1 ms 3548 KiB
in29.txt AC 1 ms 3596 KiB
in30.txt AC 1 ms 3692 KiB
in31.txt AC 1 ms 3692 KiB
in32.txt AC 1 ms 3532 KiB
in33.txt AC 1 ms 3432 KiB
in34.txt AC 1 ms 3620 KiB
in35.txt AC 1 ms 3428 KiB
in36.txt AC 1 ms 3624 KiB
in37.txt AC 1 ms 3532 KiB
in38.txt AC 1 ms 3428 KiB
in39.txt AC 1 ms 3620 KiB
in40.txt AC 1 ms 3428 KiB
in41.txt AC 1 ms 3516 KiB
in42.txt AC 1 ms 3432 KiB
in43.txt AC 1 ms 3532 KiB
in44.txt AC 1 ms 3560 KiB
sample01.txt AC 1 ms 3504 KiB
sample02.txt AC 1 ms 3528 KiB
sample03.txt AC 1 ms 3564 KiB