# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72459 | 인프라웨어 상한가 가주세요. 물렸어요 (#118) | First-to-Solve Hunter (FXCUP3_firstsolve) | Text | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 101;
int get(int c, int p) {
return (c * p) % mod;
}
int main() {
//int num[12] = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 12 , 34 };
int num[12] = { 34 , 2 , 12 , 4 , 8 , 6 , 7 , 5 , 9 , 10 , 3 , 1 };
for (int i = 0; i < 12; ++i)
cout << num[i] << " ";
//vector<int> mx;
//for (int i = 1; i <= 100; ++i) {
// vector<int> tmp;
// int delay = 0;
// for (int j = 0; j < 12; ++j) {
// int add = get(i, num[j]);
// delay += add;
// tmp.push_back(add);
// }
// int idx = max_element(tmp.begin(), tmp.end()) - tmp.begin();
// mx.push_back(tmp[idx]);
// cout << delay << '\n';
//}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |