|
|
|
|
讨论 Discussion |
|
| |
 666 |
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("p10.in","r",stdin);
freopen("p10.out","w",stdout);
int n,a[10000]={0},i=2,t=2,k,j,q=0;
cin>>n;
a[1]=2;
a[2]=3;
if(n==1||n==2)cout<<a[n];
for(j=2;j<=10000;j++){
k=0;
for(j=1;j<=2;j++){
k++;
a[i+1]=a[i]+t;
i++;
if(i==n){q=1;
cout<<a[i];break;
}
if(k==2)t++;
}
if(q==1)break;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( ) |
| fgeryry |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
freopen("p1674.in","r",stdin);
freopen("p1674.out","w",stdout);
int n;
cin >> n;
int cost1, cost2, cost3;
int num1, price1;
cin >> num1 >> price1;
int count1 = (n + num1 - 1) / num1;
cost1 = count1 * price1;
int num2, price2;
cin >> num2 >> price2;
int count2 = (n + num2 - 1) / num2;
cost2 = count2 * price2;
int num3, price3;
cin >> num3 >> price3;
int count3 = (n + num3 - 1) / num3；
cost3 = count3 * price3;
int min_cost = min(min(cost1, cost2), cost3);
cout << min_cost << endl;
fclose(stdin);
fclose(stdout);
return 0;
}
( )
|
|
|
|
|
|
|
|
|
|
Flag |
|
题号 |
P1055 |
|
其它 |
通过 |
0人 |
提交 |
70次 |
通过率 |
0% |
难度 |
2 |
|
|
|
|
|
|
