lapla-cogito

Keybase proof

I hereby claim:

• I am laplaciancpp on github.
• I am laplacian (https://keybase.io/laplacian) on keybase.
• I have a public key ASDmXb-0EH-iEmbja4_8eIWD3pc95Yz9dTqFW5gDJlpcAAo

To claim this, I am signing this object:

lapla-cogito

#include "bits/stdc++.h"
using namespace std;
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		int m;
		cin >> m;
		string h;
		cin >> h;

lapla-cogito

#include "bits/stdc++.h"
using namespace std;
int main() {
	long long n;
	cin >> n;
	for (long long k = 1; k <= n; ++k) {
		string h;
		cin >> h;
		bool  mon = 0;
		vector<char>a, b;

lapla-cogito

#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, ans = 0;
	cin >> N;
	//bitの長さは2N
	N *= 2;
	//括弧列が条件を満たしているかのチェック
	bool bye;

lapla-cogito

#include <bits/stdc++.h>
using namespace std;

//nから1までの階乗を求める
long long upperfloor(long long n) {
	long long ans = 1;
	while (n) {
		ans *= n;
		--n;
	}

lapla-cogito

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <vector>

lapla-cogito

#include <bits/stdc++.h>
using namespace std;

vector<int> digits(long long n){
  vector<int>res;
  while(n){
    res.push_back(n%10);
    n/=10;
  }
  sort(res.begin(),res.end());

lapla-cogito

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
  long long int a,b,c,d,e;
  cin>>a>>b>>c>>d>>e;
  long long ans=min(e*4*a,min(e*2*b,e*c));
  cout<<min(e/2*d+e%2*ans/e,ans)<<endl;
}