제출 #147802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
147802		zscoder (#201)	Play Onwards (FXCUP4_onward)	C++17	100 / 100	13 ms	1220 KiB

make

#include "make.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld; 
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;

std::string MakeWord(int N, int M, std::vector<std::string> Dict) 
{
	string s;
	for(int i=0;i<M;i++) s+='a';
	return s;
	//return Dict[0];
}

guess

#include "guess.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld; 
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;

std::string GuessWord(int M, std::string YH){
	string s;
	for(int i=0;i<M;i++) s+='a';
	return s;
}

• Subtask 1: 100 / 100