2018烽火软件工程实习生编程题

1.

#include<iostream>
using namespace std;
int main()
{
	int n, k;
	cin >> n;
	cin >> k;
	int a[5000];
	for (int l = 0; l < n; ++l)
	{
		cin >> a[l];
	}
	int count = 0;
	for (int i = 0; i < n; ++i)
	{
		long long int sum = 0;
		for (int j = i; j <n; ++j)
		{
			sum += a[j];
			if (sum >= k)
				++count;
		}
	}
	cout << count<< endl;
	return 0;
}

2.

import java.util.Scanner;

public class TestDemo {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in 

);
		while(true){
			int n = sc.nextInt();
			int t = sc.nextInt();
			int [] xs = new int[n];
			int [] ts = new int[n];
			
			for(int i=0;i<n;i++){
				xs[i] = sc.nextInt();
				ts[i] = sc.nextInt();
			}
			
			int count = 0;
			int [] min_xs = new int[n-1];
			for(int y = 0;y<n-1;y++){
				min_xs[y] = xs[y+1] - xs[y];
				int dis = min_xs[y] - ts[y]/2 -ts[y+1]/2;
				int res1 = dis%t;
				if(res1 == 0){
					count+=dis/t;
				}else{
					count+=dis/t;
					count+=dis/t;
				}
			}
			System.out.println(count+2);
		}
	}
}

3.

 

#include<iostream>
using namespace std;
int main()
{
int n, m;
cin >> n;
cin >> m;
int a[20], b[20];
for (int i = 0; i < m; ++i)
{
cin >> a[i];
cin >> b[i];
}
int sum = 0;
int count = n;
while (count>0)
{
int temp = b[0];
int x=0;
for (int i = 0; i < m; ++i)
{
if (temp < b[i])
{
temp = b[i];
x = i;
}
}
if (a[x] >= count)
{
sum += (b[x] * count);
b[x] = 0;
count = 0;
}
else
{
sum += (b[x] * a[x]);
b[x] = 0;
count -= a[x];
}
}
cout << sum << endl;
}