大佬们 帮帮

P1909 [NOIP2016 普及组] 买铅笔

``` #include<bits/stdc++.h> using namespace std; int main(){ int n; int a[4], b[4]; cin>>n; for(int i=1;i<=3;i++){ cin>>a[i]>>b[i]; } int z[4]={0}, m[4]={0}; for(int i=1;i<=3;i++){ z[i]=n/a[i]; if(n%a[i]!=0){ z[i]++; } m[i]=z[i]*b[i]; } sort(m+1,m+1+3); cout<<m[1]; return 0; } ```
by wmbwww @ 2023-08-22 18:52:27


@[wmbwww](/user/1037359) 不是别人求助你发自己的代码干什么啊
by hexuchen @ 2023-08-22 18:53:38


因为他的代码我看不懂
by wmbwww @ 2023-08-22 18:56:10


@[Achenfeng](/user/402229) 写错符号了,是%,不是/ ```cpp #include<iostream> using namespace std; struct pencil { int num; int price; int sum; }; int main() { int a,b; cin >> a; pencil arr1[3]; for (int i = 0; i < 3; i++) { cin >> arr1[i].num >> arr1[i].price; } for (int i = 0; i < 3; i++) { if (a % arr1[i].num == 0) //是% { arr1[i].sum = arr1[i].price * (a / arr1[i].num); } else { arr1[i].sum = arr1[i].price * (a / arr1[i].num + 1); } } for (int i = 0; i < 2; i++) { for (int j = 0; j < 2 - i; j++) { if (arr1[j].sum > arr1[j + 1].sum) { int temp = arr1[j].sum; arr1[j].sum = arr1[j + 1].sum; arr1[j + 1].sum = temp; } } } cout << arr1[0].sum << endl; system("pause"); return 0; } ```
by hexuchen @ 2023-08-22 18:56:23


@[Achenfeng](/user/402229) 如果一个数%另外一个数等于0,说明这个数可以被另外一个数整除
by hexuchen @ 2023-08-22 18:57:12


@[Achenfeng](/user/402229) 求关注~
by hexuchen @ 2023-08-22 18:57:28


@[hexuchen](/user/945742) 嘶 没注意 谢谢
by Achenfeng @ 2023-08-23 18:21:28


|