Submission #61554169

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
int T[105], L[105];
int main(){
  int n, d;
  cin >> n >> d;
  for(int i = 1; i <= n; i ++) {
    cin >> T[i] >> L[i];
  }
  for(int i = 1; i <= d; i ++) {
    int Max = 0;
    for(int j = 1; j <= n; j ++) {
      Max = max(Max, T[j] * (L[j] + i));
    }
    cout << Max << '\n';
  }
  return 0;
} 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>

using namespace std;

int T[105], L[105];

int main(){
	int n, d;
	cin >> n >> d;
	for(int i = 1; i <= n; i ++) {
		cin >> T[i] >> L[i];
	}
	for(int i = 1; i <= d; i ++) {
		int Max = 0;
		for(int j = 1; j <= n; j ++) {
			Max = max(Max, T[j] * (L[j] + i));
		}
		cout << Max << '\n';
	}
	return 0;
} 

Submission Info

Judge Result