#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <numeric>
#include <iterator>
#include <queue>
#include <set>
#include <map>
#include <vector>
#define mp make_pair
#define pb push_back
#define sqr(x) ((x)*(x))
#define foreach(it,c) for(typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
template<typename T> int size(const T &a) { return a.size(); }
int main(void)
{
long long in;
cin >> in;
cout << in*in*111 + in*11 + 1 << endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1672 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1672 KB |
Output is correct |
