diff --git a/src/apple.c b/src/apple.c
index 766d543..309ed78 100644
--- a/src/apple.c
+++ b/src/apple.c
@@ -4,6 +4,16 @@ int n;
 int k;
 int A[100000];
 
+int p(int m, int *A){
+  int sum = 0;
+  int i;
+  for (i = 0; i < n; i++){
+    sum += (A[i] + m -1) / m;
+  }
+  return sum <= k;
+}
+
+
 
 int main(){
   int i, lb, ub;
@@ -11,7 +21,18 @@ int main(){
   for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
   }
-
+  lb = 0;
+  ub = 1000000000;
+  while ( ub - lb > 1) {
+    int mid = ( lb + ub ) / 2;
+    if( p ( mid , A )){
+      ub = mid ;
+    }
+    else {
+      lb = mid ;
+    }
+  }
+  printf ( "%d\n " , ub );
 
   return 0;
 }
diff --git a/src/array.c b/src/array.c
index 13ed925..07f06c2 100644
--- a/src/array.c
+++ b/src/array.c
@@ -11,8 +11,13 @@ int main(){
   for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
   }
-
-
-
-  return 0;
+  lb = -1;
+  ub = n;
+  while(ub - lb > 1){
+    int mid = (lb + ub) / 2;
+    if(A[mid] >= k) ub = mid;
+    else lb = mid;
+  }
+  printf("%d\n", ub);
+  return ub;
 }
diff --git a/src/spear.c b/src/spear.c
index 766d543..a961267 100644
--- a/src/spear.c
+++ b/src/spear.c
@@ -4,6 +4,14 @@ int n;
 int k;
 int A[100000];
 
+int p(int m, int *A){
+  int sum = 0;
+  int i;
+  for (i = 0; i < n; i++){
+    sum += A[i] / m;
+  }
+  return sum < k;
+}
 
 int main(){
   int i, lb, ub;
@@ -11,7 +19,18 @@ int main(){
   for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
   }
-
-
+  lb = 0;
+  ub = 1000000001;
+  while ( ub - lb > 1) {
+    int mid = ( lb + ub ) / 2;
+    if( p ( mid , A )){
+      ub = mid ;
+    }
+    else {
+      lb = mid ;
+    }
+  }
+  printf ( "%d\n " , lb );
   return 0;
+  
 }
diff --git a/src/works.c b/src/works.c
index 766d543..13ab31b 100644
--- a/src/works.c
+++ b/src/works.c
@@ -4,6 +4,22 @@ int n;
 int k;
 int A[100000];
 
+int p(int m, int k, int *A){
+  int i;
+  int save = m;
+  int p = 0;
+  for (i = 0; i < n; i++){
+    if (m - A[i]>= 0){
+      m -= A[i];
+    }
+    else{
+      m = save-A[i];
+      p++;
+    }
+  }
+  
+  return p <= k;
+}
 
 int main(){
   int i, lb, ub;
@@ -11,7 +27,24 @@ int main(){
   for(i = 0; i < n; i++){
     scanf("%d", &A[i]);
   }
-
-
+  int max;
+  max = A[0];
+  for (i = 0; i < n; i++) {
+      if (A[i] > max) {
+          max = A[i];
+      }
+  }
+  lb = max;
+  ub = 1000000001; 
+  while ( ub - lb > 1) {
+    int mid = ( lb + ub ) / 2;
+    if( p ( mid , k , A )){
+      ub = mid ;
+    }
+    else {
+    lb = mid ;
+    }
+  }
+  printf ( "%d\n " , ub );
   return 0;
 }