| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1139833 | mariac | Cutting a rectangle (LMIO18_staciakampis) | C++20 | 0 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
const int KMAX = 1e5;
int k;
vector <pair<int, int>> rec;
int dp[KMAX+1];//nr de posib pana la poz i
long long sum;
void read()
{
int a, b;
cin>>k;
for(int i=0; i<k; i++)
{
cin>>a>>b;
rec.push_back({a, b});
if(i!=k-1) sum+=a;
}
}
int main()
{
read();
cout<<2<<'\n'<<1<<'\n'<<2;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
