Submission #7983623
Source Code Expand
#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
if(a<b)return b;
else return a;
}
ll lmin(ll a,ll b){
if(a<b)return a;
else return b;
}
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(b==0)return a;
if(a%b==0)return b;
return gcd(b,a%b);
}
ll Pow(ll n,ll k){
ll ret=1;
ll now=n;
while(k>0){
if(k&1)ret*=now;
now*=now;
k/=2;
}
return ret;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int n;cin>>n;
if(n==0)cout<<32<<endl;
if(n==1)cout<<1<<endl;
if(n==2)cout<<6<<endl;
if(n==3)cout<<0<<endl;
if(n==4)cout<<2<<endl;
if(n==5)cout<<4<<endl;
if(n==6)cout<<7<<endl;
if(n==7)cout<<13<<endl;
if(n==8)cout<<11<<endl;
if(n==9)cout<<5<<endl;
}
Submission Info
Submission Time |
|
Task |
C - 円周率 |
User |
ttttan |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1435 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0, 1, 2, 3 |
All |
0, 1, 2, 3, 4, 5, 6, 7, 8, 9 |
Case Name |
Status |
Exec Time |
Memory |
0 |
AC |
1 ms |
256 KB |
1 |
AC |
1 ms |
256 KB |
2 |
AC |
1 ms |
256 KB |
3 |
AC |
1 ms |
256 KB |
4 |
AC |
1 ms |
256 KB |
5 |
AC |
1 ms |
256 KB |
6 |
AC |
1 ms |
256 KB |
7 |
AC |
1 ms |
256 KB |
8 |
AC |
1 ms |
256 KB |
9 |
AC |
1 ms |
256 KB |