CSES - Datatähti 2022 alku - Results
Submission details
Task:Karkit
Sender:berqiamouad
Submission time:2021-10-06 17:22:40
Language:C++17
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED100
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.01 sdetails
#3ACCEPTED0.01 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.01 sdetails

Code

#include<bits/stdc++.h>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O2")
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef vector <string> vs;
typedef pair<int,int> pi;
typedef vector <pair<int,int>> vii;
typedef vector <long long> vll;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;

#define MP make_pair
#define deb(x) cout << x << " "
#define pb push_back
#define ins insert
#define all(c) c.begin(), c.end()
#define e(n) n%2==0
#define o(n) n%2!=0
#define rep(e,n,a) for(int i=e; i<=n; i+=a)
#define sz(c) (int)c.size()
#define MOD 1000000007
template <typename T> void rd(T& x){cin >> x;}
template<typename H, typename... T> void rd(H& h, T&... t) {
    rd(h);
    rd(t...);
}
template <typename T> void wt(T& x){cout << x;}

void print(){cout << "\n";}



void solve(){
    int n,a,b; cin >> n >> a >> b ;
    int x = n / min(a,b);
    x += (n%min(a,b)) / max(a,b);

    cout << x << "\n";
}




signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt", "r",stdin);
    //freopen("output.txt", "w", stdout);

    int t=1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Test details

Test 1

Verdict: ACCEPTED

input
100
1
1

correct output
100

user output
100

Test 2

Verdict: ACCEPTED

input
1
100
100

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
50
2
3

correct output
25

user output
25

Test 4

Verdict: ACCEPTED

input
100
17
3

correct output
33

user output
33

Test 5

Verdict: ACCEPTED

input
5
5
5

correct output
1

user output
1