Accepted
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<long long,long long> PLL;
#define int long long
#define all(v) v.begin(),v.end()
#define faster {ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);}
const LL mod = 1e9 + 7;
const int N = 2e5 + 10;
const LL inf = 1e9;
void solve(int test){
int n; cin>>n;
int ans = n / 3;
if(n % 3) ans++;
cout<<ans<<'\n';
}
signed main(){
faster
int t = 1;
// cin>>t;
for(int i = 1; i <= t; i++){
solve(i);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1106 too easy or three easy
- Contest
- Brain Booster #6
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-10-03 15:32:17
- Judged At
- 2024-12-17 11:37:00
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 492.0 KiB