Submission #672208

#	Time	Username	Problem	Language	Result	Execution time	Memory
672208		Alihan_8	Chessboard (IZhO18_chessboard)	C++17	0 / 100	18 ms	3780 KiB

chessboard

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k; cin >> n >> k;
    struct rec{
        int lx, ly, rx, ry;
    };
    vector <rec> p(k);
    for ( auto &[lx, ly, rx, ry]: p ) cin >> lx >> ly >> rx >> ry;
    int Mn = 1e18;
    for ( int i = 1; i*i <= n; i++ ){
        if ( n%i ) continue;
        int l = n/i;
    }
    cout << Mn;

    cout << '\n';
}

Compilation message (stderr)

chessboard.cpp: In function 'int main()':
chessboard.cpp:26:13: warning: unused variable 'l' [-Wunused-variable]
   26 |         int l = n/i;
      |             ^
chessboard.cpp: In function 'void IO(std::string)':
chessboard.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
chessboard.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 23
• Subtask 6: 0 / 30