Submission #400238


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) begin(a),end(a)
#define MS(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
const ll INF = 114514810;
const ll MOD = 1000000007;
const double EPS = 1e-8;
const double PI = acos(-1.0);
struct edge
{
	int from, to, cost;
	bool operator < (const edge& e) const { return cost < e.cost; }
	bool operator >(const edge& e) const { return cost > e.cost; }
};
int dx[] = { -1, 0, 0, 1 }; int dy[] = { 0, -1, 1, 0 };
bool valid(int x, int y, int h, int w) { return (x >= 0 && y >= 0 && x < h&&y < w); }
///*************************************************************************************///
///*************************************************************************************///
///*************************************************************************************///

ll n, m;
ll a[20], memo[(1 << 20) + 1]; int p[20];
double ans;

ll gcd(ll a, ll b)
{
	if (a < b) swap(a, b);
	return (a%b ? gcd(a%b, b) : b);
}

ll lcm(ll a, ll b)
{
	return a / gcd(a, b)*b;
}


void calc(vi v)
{
	if (v.size() == 0) return;
	double exp = 1;
	REP(i, n)
	{
		if (find(ALL(v), i) != v.end())
		{
			exp *= p[i] / 100.0;
		}
		else
		{
			exp *= (100 - p[i]) / 100.0;
		}
	}
	ll sum = 0;
	REP(i, 1 << v.size())
	{
		vi w;
		REP(j, v.size())
		{
			if ((i >> j) & 1 == 1) w.push_back(j);
		}
		if (w.size() == 0) continue;
		ll lc = 1;
		REP(j, w.size())
		{
			lc = lcm(lc, a[v[w[j]]]);
		}
		sum += m / lc*(w.size() % 2 == 1 ? 1 : -1);
	}
	ans += sum*exp;
}

void solve(int i, vi v)
{
	if (i == n)
	{
		calc(v);
	}
	else
	{
		solve(i + 1, v);
		v.push_back(i);
		solve(i + 1, v);
	}
}

int main()
{
	string s;
	cin >> s;
	cout << s[0] + s[1] - '0' * 2 << endl;
	return 0;
}

Submission Info

Submission Time
Task A - 加算王
User amano
Language C++11 (GCC 4.9.2)
Score 100
Code Size 2007 Byte
Status AC
Exec Time 26 ms
Memory 920 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 15
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt
All subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 26 ms 676 KB
subtask0-sample02.txt AC 25 ms 920 KB
subtask0-sample03.txt AC 22 ms 916 KB
subtask1-01.txt AC 22 ms 676 KB
subtask1-02.txt AC 22 ms 808 KB
subtask1-03.txt AC 24 ms 800 KB
subtask1-04.txt AC 22 ms 808 KB
subtask1-05.txt AC 22 ms 788 KB
subtask1-06.txt AC 22 ms 804 KB
subtask1-07.txt AC 23 ms 812 KB
subtask1-08.txt AC 22 ms 804 KB
subtask1-09.txt AC 22 ms 920 KB
subtask1-10.txt AC 24 ms 892 KB
subtask1-11.txt AC 22 ms 920 KB
subtask1-12.txt AC 22 ms 772 KB