Accepted
Code
/**
* Author: AhSaN (JUST-22)
* Created: 05-10-2024 06:12:19
**/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void Sol(int Cs) {
int n;
cin >> n;
cout << (n / 3) + (n % 3 > 0) << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int Tc = 1;
// cin >> Tc;
for (int Cs = 1; Cs <= Tc; Cs++) {
Sol(Cs);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1106 too easy or three easy
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-10-05 01:13:21
- Judged At
- 2024-11-11 02:41:01
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 492.0 KiB