Submission #673335

#	Time	Username	Problem	Language	Result	Execution time	Memory
673335		Cutebol	Chessboard (IZhO18_chessboard)	C++17	8 / 100	1 ms	328 KiB

chessboard

#include <bits/stdc++.h>
 
using namespace std;
 
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define Scaramouche ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define itn int
#define endl "\n"
#define ff first
#define ss second
   
const int N = 2e5 + 5 ;
const int mod = 1e9 + 7 ;
const int inf = 1e12 ;

int n , k , m , sum , ans = inf ;
int x[N] , y[N] , cnt1[2] ;

void solve(){
	
	cin >> n >> m ;
	for ( int i = 1 ; i <= n/2 ; i ++ ){
		if ( !(n % i)){
			n /= i ;
			ans = min ( ans , (n*n/2)*i*i ) ;
			n *= i ;
		}
	}
	cout << ans ;
//	int cnt[2] ;
//	cnt[1] = n*n/2 , cnt[0] = (n*n+1)/2 ;
//	for ( int i = 0 ; i < m ; i ++ ){
//		cin >> x[i] >> y[i] >> x[i] >> y[i] ;
//		cnt[((x[i]%2)+(y[i]%2))%2] -- ;
//		cnt1[((x[i]%2)+(y[i]%2))%2] ++ ;
//	}
//	cout << min ( cnt[0] + cnt1[1] , cnt[1] + cnt1[0] )  ;
}
 
signed main(){
//  fopn("blocks") ;
    Scaramouche ;
    int t = 1 ;
//    	cin >> t ;
    while ( t -- ) solve() ; 
}

Compilation message (stderr)

chessboard.cpp: In function 'void fopn(std::string)':
chessboard.cpp:5:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
chessboard.cpp:5:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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