제출 #838900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
838900		vjudge1	Bosses (BOI16_bosses)	C++17	0 / 100	1 ms	212 KiB

bosses

/*#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")*/
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
//#define int long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define str string
#define pii pair<int,int>
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define mii map<int,int>
#define mll map<ll,ll>
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yess cout<<"Yes\n";
#define noo cout<<"No\n";
using namespace std;

const str num1[10]={"ZERO", "ONE", "TWO", "THREE", "FOUR", "FIVE", "SIX", "SEVEN", "EIGHT", "NINE"};
const int num2[10]={0,1,2,3,4,5,6,7,8,9};

const int dx[8] = {1, -1, 0, 0,1,-1,-1,1};
const int dy[8] = {0, 0, -1, 1,1,-1,1,-1};

const ll mod=1000000007;
const ll oo=9000000000000000000;

ll binmod(int n,int m){if(m==0){return 0;}if(m==1){return n;}if(m%2==1){return n*(binmod(n,m-1))%mod;}int c=binmod(n,m/2);return c*c%mod;}
ll bin(int n,int m){if(m==0){return 0;}if(m==1){return n;}if(m%2==1){return n*(bin(n,m-1));}int c=bin(n,m/2);return c*c;}

void solve(){
	int n;
	cin>>n;
	cout<<n*2;
}

signed main(){
	//ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	//srand( time(0));
	//rand()
	//freopen("sum.in", "r", stdin);
	//freopen("sum.out", "w", stdout);
    int tests=1;
    //cin>>tests;
    for(int i=1;i<=tests;i++){
		//cout<<"TEST CASE : "<<i<<"\n";
		solve();
	}
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 45
• Subtask 3: 0 / 33