Submission

Status:

[P][P][P][P][P][P][P][PP][PP][PP]

Subtask/Task Score:

{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}{10/10}

Score: 100

User: Nitro_Legacy

Problemset: แปลงดอกไม้

Language: cpp

Time: 0.002 second

Submitted On: 2026-05-08 15:45:14

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
    ll L, N;
    cin>>L>>N;  
    if (N==1){
        cout<<1;
        return 0;
    }
    for (ll i=1; i<N; i++){
        if ((L*i)*(L*i+1)/2 < N && N <= (L*(i+1))*(L*(i+1)+1)/2 ){
            cout<<i+1;
        }
    }
    return 0;
}