Submission #1139427

#TimeUsernameProblemLanguageResultExecution timeMemory
1139427mariacCutting a rectangle (LMIO18_staciakampis)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h>

using namespace std;
const int KMAX = 1e5;
int k;
vector <pair<long long, long long>> rec;
//int dp[KMAX+1];//nr de posib pana la poz i
long long sum;
void read()
{
    long long 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();
    if(sum == rec[k-1].first)
    {
        cout<<2<<'\n'<<1<<'\n'<<2;
        return 0;
    }
    cout<<1<<'\n'<<1;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...