Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.IO;
- using System.Collections.Generic;
- using System.Linq;
- using System.Text;
- using System.Threading.Tasks;
- namespace c_sharp_try
- {
- class Program
- {
- static void Main(string[] args)
- {
- List<Case> cases = readFromFile();
- System.IO.File.WriteAllLines(@"output.txt", lines);
- }
- static List<Case> readFromFile()
- {
- string[] lines = System.IO.File.ReadAllLines(@"input.txt");
- int caseCount = Convert.ToInt32(lines[0]);
- var cases = new List<Case>();
- caseCount=0;
- for (int i=1; i< lines.Length; i++)
- {
- if (i%2!=0)
- {
- String[] strs1 = lines[i].Split(new char[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
- cases.Add(new Case(Convert.ToInt32(strs1[0]), Convert.ToInt32(strs1[1])));
- }
- if (i%2==0)
- {
- for (int j=0; j<cases[caseCount].sumCount; j++)
- {
- String[] strs1 = lines[i].Split(new char[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
- cases[caseCount].minSum[j] = Convert.ToInt32(strs1[j]);
- }
- caseCount++;
- }
- }
- return cases;
- }
- static string[] calculation(List<Case> cases)
- {
- string[] result;
- for (int i=0; i<cases.Count; i++)
- {
- int min = cases[i].minSum[0];
- foreach (int min2 in cases[i].minSum)
- {
- if (min2 < min)
- min = min2;
- }
- if (min < Convert.ToInt16(Math.Ceiling((cases[i].giftPrice / (double)cases[i].sumCount))))
- {
- }
- }
- return null;
- }
- }
- class Case
- {
- public int giftPrice, sumCount;
- public int[] minSum, factSum;
- public Case(int giftPrice, int sumCount)
- {
- this.giftPrice = giftPrice;
- this.sumCount = sumCount;
- this.minSum = new int[sumCount];
- this.factSum = new int[sumCount];
- }
- public int findMidSum()
- {
- return Convert.ToInt32(Math.Ceiling((giftPrice / (double)sumCount)));
- }
- public int findMin()
- {
- int min = minSum[0];
- for (int i=0; i<sumCount; i++)
- {
- if (factSum[i]!=0 && minSum[i]<min)
- {
- min = minSum[i];
- }
- }
- return min;
- }
- public int[] findFact()
- {
- int[] values = new int[sumCount];
- if (findMin()<findMidSum())
- {
- for (int i=0; i<sumCount; i++)
- {
- values[i] = findMidSum();
- }
- }
- else
- {
- for (int i=0; i<sumCount; i++)
- {
- }
- }
- return null;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement