oj.uz

답안 #381980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
381980 2021-03-26T08:25:38 Z kartel Hop (COCI21_hop) C++14
110 / 110
 59 ms 1388 KB 
#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#include <time.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
//#define M ll(1e9 + 7)
#define M ll(998244353)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
#define vi vector<int>
#define eps (ld)1e-9
using namespace std;
typedef long long ll;
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef double ld;
typedef unsigned long long ull;
typedef short int si;

int main()
{
//    mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());;
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	in("toys.in");
//	out("toys.out");
//    in("input.txt");
//    out("output.txt");
//    cerr.precision(9); cerr << fixed;

//    clock_t tStart = clock();

    int n;
    cin >> n;

    for (int i = 1; i <= n - 1; i++, cout << el) {
        for (int j = 1; j <= i; j++) {
            cout << rand() % 3 + 1 << " ";
        }
    }
}


/*

7
4 6 7 2 3 1 5
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #2
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 59 ms 1352 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 39 ms 1132 KB Output is correct
12 Correct 46 ms 1388 KB Output is correct
13 Correct 40 ms 1260 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 40 ms 1260 KB Output is correct
16 Correct 53 ms 1260 KB Output is correct
17 Correct 44 ms 1260 KB Output is correct
18 Correct 41 ms 1260 KB Output is correct
19 Correct 41 ms 1280 KB Output is correct
20 Correct 41 ms 1260 KB Output is correct
21 Correct 41 ms 1260 KB Output is correct
22 Correct 40 ms 1260 KB Output is correct
23 Correct 46 ms 1388 KB Output is correct