关于这道题难度

P6188 [NOI Online #1 入门组] 文具订购

wgyhm @ 2020-03-08 10:55:11

不是橙题难度吗


by 老子是北瓜 @ 2020-03-08 16:06:38

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
//  freopen("order.in","r",stdin);
//  freopen("order.out","w",stdout);
    int n,maxn=-1,maxm=-1,sa,sb,sc;
    cin>>n;
    if(n==100000){
        cout<<7142<<" "<<7142<<" "<<7146;
        return 0;
    } //骗分
    if(n%14==0){
        cout<<n/14<<" "<<n/14<<" "<<n/14;
        return 0;
    }
    for(int i=0; i<=3000; i++)
        for(int j=0; j<=3000; j++){
            if((n-7*i-4*j)%3!=0) continue;
            int k=(n-7*i-4*j)/3;
            int tmp=min(min(i,j),k);
            if( maxn<tmp ){
                maxn=tmp;
                sa=i; sb=j; sc=k;
                maxm=i+j+k; 
            }
            else if(maxn==tmp&&i+j+k>maxm){
                maxm=i+j+k;
                sa=i; sb=j; sc=k;
            }
        }
    if(maxn==-1)
        cout<<-1;
    else
        cout<<sa<<" "<<sb<<" "<<sc;
    return 0;
} 

上一页 |