Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 21 additions & 2 deletions src/apple.c
Original file line number Diff line number Diff line change
@@ -1,9 +1,16 @@
#include <stdio.h>

int n;
int k;
int A[100000];

int p(int m){
unsigned int i, s;
s = 0;
for(i = 0; i < n; i++){
s = s + A[i] /m;
}
return s < k;
}

int main(){
int i, lb, ub;
Expand All @@ -13,5 +20,17 @@ int main(){
}


lb = 0;
ub = 1000000000;
while(ub - lb > 1){
int mid = (lb + ub) / 2;
if(p(mid)){
ub = mid;
}
else{
lb = mid;
}
}
printf("%d\n", ub);
return 0;
}
}
14 changes: 13 additions & 1 deletion src/array.c
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,19 @@ int main(){
scanf("%d", &A[i]);
}


lb = -1;
ub = n;
while (ub - lb > 1){
int mid = (lb + ub) / 2;
if(A[mid] < k) {lb = mid;

}
else {ub = mid;

}
}
printf("%d", ub);


return 0;
}
38 changes: 29 additions & 9 deletions src/spear.c
Original file line number Diff line number Diff line change
@@ -1,17 +1,37 @@
#include <stdio.h>

int n;
int k;
int A[100000];

int p(int x){
int s = 0;
for(int i = 0; i < n; i++){
s = s + A[i] / x;
}
return (int) s < k;
}

int main(){
int i, lb, ub;
scanf("%d%d", &n, &k);
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}
int main(){
int i, lb, ub;
scanf("%d%d", &n, &k);
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}


lb = 0;
ub = 1000000000;
while (ub - lb > 1){
int mid = (ub + lb) / 2;
if(p(mid)){
ub = mid;
}
else{
lb = mid;
}
}

return 0;
}
printf("%d",lb);

return 0;
}
30 changes: 28 additions & 2 deletions src/works.c
Original file line number Diff line number Diff line change
@@ -1,17 +1,43 @@
#include <stdio.h>

int n;
int k;
int A[100000];

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

pの中身だったりlb ubの初期値だったり色々怪しそうです.


int p(int m){
int k_need = 1;
int sum = 0;
for(int i = 0; i < n; i++){
if(A[i] > m){
return 0;
}else if(sum + A[i] <= m){
sum = sum + A[i];
}else{
k_need++;
sum = A[i];
}
}
return k_need <= k;
}


int main(){
int i, lb, ub;
scanf("%d%d", &n, &k);
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}
lb = 0;
ub = 1000000000;
while(ub - lb > 1){
int mid = (ub + lb) / 2;
if(p(mid)){
ub = mid;
}else{
lb = mid;
}
}

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

そもそも何も出力してないです.


printf("%d", ub);

return 0;
}
}