Submission #3046065
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<string> #include<cmath> #include<map> #include<cstdio> #include<stack> #include<queue> #include<fstream> #include<cstdio> #include<deque> #include<iomanip> #include <numeric> using namespace std; #define ok1 printf("ok1\n"); #define ok2 printf("ok2\n"); #define M 1000000000000000000LL #define rep(i,n) for(int i=0;i<n;i++) #define REP(i,s,n) for(int i=(s);i<(n);i++) #define repr(i,n) for(int i=n-1;i>=0;i--) #define REPR(i,s,n) for(int i=(s);i>=(n);(i)--) #define all(a) (a).begin(),(a).end() #define reall(a) (a).rbegin(),(a).rend() #define pb push_back #define pf push_front #define MIN(a,b) a=min((a),(b)) #define MAX(a,b) a=max((a),(b)) #define SIZE(v) (int)v.size() const double pi = acos(-1.0); typedef vector<int> vi; typedef vector<string> vs; typedef long long ll; typedef vector<ll> vll; typedef vector<vi> vvi; typedef deque<ll> dll; typedef pair<string, int> P; #define mod 1e9 + 7; ll gcd(ll x, ll y) { ll r; while ((r = x % y) != 0) { x = y; y = r; } return y; } ll lcm(ll x, ll y) { x /= gcd(x, y); y /= gcd(x, y); return (x * y); } int main() { ios_base::sync_with_stdio(false); ll n, m, q; cin >> n; cout << (int)sqrt(n) * (int)sqrt(n) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Exponential |
User | side |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1330 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | WA | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | WA | 1 ms | 256 KB |
1_007.txt | WA | 1 ms | 256 KB |
1_008.txt | AC | 1 ms | 256 KB |