Submission #481573

#	Time	Username	Problem	Language	Result	Execution time	Memory
481573		ssense	Cluedo (IOI10_cluedo)	C++14	100 / 100	17 ms	272 KiB

cluedo

#include <bits/stdc++.h>
#include "grader.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
																																						int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}//ssense
void Solve()
{
	int m = 1, l = 1, w = 1;
	while(true)
	{
		int now = Theory(m, l, w);
		if(now == 1)
		{
			m++;
		}
		if(now == 2)
		{
			l++;
		}
		if(now == 3)
		{
			w++;
		}
		if(now == 0)
		{
			return;
		}
	}
}

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50