Submission #3203238
Source Code Expand
/** * File : D.cpp * Author : Kazune Takahashi * Created : 2018-9-15 22:13:36 * Powered by Visual Studio Code */ #include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <functional> #include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725)); #include <chrono> // std::chrono::system_clock::time_point start_time, end_time; // start = std::chrono::system_clock::now(); // double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count(); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int main() { int N; cin >> N; for (auto i = 0; i < N; i++) { for (auto j = 0; j < N; j++) { cout << i + j + 2; if (j < N - 1) { cout << " "; } else { cout << endl; } } } }
Submission Info
Submission Time | |
---|---|
Task | D - Modulo Matrix |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1455 Byte |
Status | WA |
Exec Time | 22 ms |
Memory | 1152 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt |
All | sample_01.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | WA | 1 ms | 256 KB |
test_01.txt | WA | 22 ms | 1152 KB |
test_02.txt | WA | 22 ms | 1152 KB |
test_03.txt | WA | 1 ms | 256 KB |
test_04.txt | WA | 1 ms | 256 KB |
test_05.txt | WA | 1 ms | 256 KB |
test_06.txt | WA | 12 ms | 768 KB |
test_07.txt | WA | 2 ms | 256 KB |