Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <string>
- #include <vector>
- #include <map>
- #include <list>
- #include <iterator>
- #include <set>
- #include <queue>
- #include <iostream>
- #include <sstream>
- #include <stack>
- #include <deque>
- #include <cmath>
- #include <memory.h>
- #include <cstdlib>
- #include <iomanip>
- #include <cstdio>
- #include <unordered_map>
- #include <cctype>
- #include <algorithm>
- #include <utility>
- #include <assert.h>
- #include <time.h>
- #define sz(s) ((int)s.size())
- #define int long long
- #define fs first
- #define sc second
- #define forn(i, k, n) for(int i = k; i < (int)n; ++i)
- #define forc(i, k, n) for(int i = k - 1; i >= (int)n; --i)
- #define pb push_back
- #define mp make_pair
- using namespace std;
- typedef vector<int> vi;
- typedef vector<vi> vii;
- typedef vector<bool> vb;
- typedef pair<int, int> pii;
- typedef vector<pii> vpii;
- typedef long long ll;
- //#define FILE
- //#define TIME
- #define FAST
- int32_t main() {
- #ifdef FAST
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- #endif
- #ifdef FILE
- freopen("s.in", "r", stdin);
- freopen("s.out", "w", stdout);
- #endif
- int n;
- cin >> n;
- int X[n][n];
- forn(i, 0, n) {
- forn(j, 0, n) {
- cin >> X[i][j];
- }
- }
- int Y[n], Z[n];
- fill(Y, Y + n, 0);
- fill(Z, Z + n, 0);
- forn(i, 0, n) {
- forn(j, 0, i + 1) {
- if(X[i][j] > 0) {
- Y[i] += X[i][j];
- Z[i]++;
- }
- }
- }
- forn(i, 0, n) {
- forn(j, 0, n) {
- cout << X[i][j] << " ";
- }
- cout <<" Y = " <<Y[i] << " Z = " << Z[i] << endl;
- }
- #ifdef TIME
- cout << endl;
- cout << fixed << setprecision(3) << (double) clock() / CLOCKS_PER_SEC << endl;
- #endif
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement