| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351386 | trigon | Bouquet (EGOI24_bouquet) | C++20 | 3095 ms | 1860 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> l(n);
vector<int> r(n);
int x;
for(int i=0;i<n;i++){
cin >> l[i] >> r[i];
x=l[i];
}
int idx=0,ans=0;
while(idx<n){
ans++;
idx+=x;
}
cout<<ans<<"\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
