2016-2017 ACM-ICPC, NEERC, Central Subregional Contest A

 

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define ll long long
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
using namespace std;
const int N=1e5+100;
/////2016-2017 ACM-ICPC, NEERC, Central Subregional Contest

///AAAA

int n,k,a;
int main(){
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    cin>>n>>k;
    int a=min(n,k);
    int ans=n*2/a;
    if(((n*2)%a)!=0) ans++;
    cout<<ans;
    return 0;
}

 

 

Fried Fish

题意：一个锅一次可以烤k条鱼，一共有n条鱼，每条鱼要烤2面，问最少多少次能把鱼全部烤完

思路：每次能最多能烤min(k,n)条鱼一共要烤2n面，xjb写

AC代码：

转载于:https://www.cnblogs.com/max88888888/p/7123125.html