Submission #12115489


Source Code Expand

Copy
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr long double EPS = 1e-8;

long long int N, M, K, L, R, H, W;
//int N, M, K, L, R, H, W;


int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	long double a;
	cin >> a;
	cout << setprecision(20) << a * 2 * 3.14159265358979 << endl;
}

Submission Info

Submission Time
Task A - Circle Pond
User olphe
Language C++ (GCC 9.2.1)
Score 100
Code Size 837 Byte
Status AC
Exec Time 6 ms
Memory 3804 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 12
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 3 ms 3716 KB
02.txt AC 2 ms 3744 KB
03.txt AC 2 ms 3712 KB
04.txt AC 2 ms 3804 KB
05.txt AC 2 ms 3704 KB
06.txt AC 2 ms 3732 KB
07.txt AC 2 ms 3804 KB
08.txt AC 6 ms 3760 KB
09.txt AC 2 ms 3716 KB
10.txt AC 2 ms 3732 KB
s1.txt AC 2 ms 3712 KB
s2.txt AC 2 ms 3716 KB