Submission #2100047
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define ll long long #define vvi vector<vector<int>> #define vec vector #define pq priority_queue #define all(v) (v).begin(), (v).end() #define rep(i, n) for (int (i) = (0); (i) < (n); ++(i)) #define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i)) #define debug(x) cerr << #x << ": " << x << endl; #define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl; #define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl; #define debugB(x, y) cerr<<#x<<": "<<bitset<y>(x) << endl; #define line() cerr << "---------------" << endl; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, -1, 1}; template<typename T> void printA(vector<T> &printArray, char between = ' ') { int paSize = printArray.size(); for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;} if (between != '\n') {cerr << endl;} } // ------------------------------------------------------------------------------------------ ll f(int n) { return (n*n+4) / 8.0; } int main() { cout << f(f(f(20))) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 天下一合成関数 |
User | nomi |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1172 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | no-input |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
no-input | AC | 1 ms | 256 KB |