Submission #12136483


Source Code Expand

Copy
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;

int main()
{
    double r;
    cin>>r;
    const double pi=acos(-1.0);
    printf("%.7lf\n", 2*pi*r);
	return 0;
}

Submission Info

Submission Time
Task A - Circle Pond
User chocorusk
Language C++ (GCC 9.2.1)
Score 100
Code Size 691 Byte
Status AC
Exec Time 7 ms
Memory 3776 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 7 ms 3716 KB
02.txt AC 2 ms 3572 KB
03.txt AC 2 ms 3776 KB
04.txt AC 2 ms 3688 KB
05.txt AC 2 ms 3688 KB
06.txt AC 2 ms 3656 KB
07.txt AC 2 ms 3688 KB
08.txt AC 3 ms 3764 KB
09.txt AC 2 ms 3692 KB
10.txt AC 1 ms 3692 KB
s1.txt AC 2 ms 3576 KB
s2.txt AC 2 ms 3708 KB