Submission #640352

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
640352	2022-09-14T10:14:26 Z	Mher777	Split (info1cup19_split)	C++17	10 / 100	0 ms	320 KB

split

//////////////////////////////// Mher777
/* -------------------- Includes -------------------- */
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef float fl;
typedef double db;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e8);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	return;
}

void precision(int x) {
	cout.setf(ios::fixed | ios::showpoint);
	cout.precision(x);
	return;
}

void usaco() {
	freopen("closing.in", "r", stdin);
	freopen("closing.out", "w", stdout);
}

ll gcd(ll a, ll b) {
	while (b) {
		a %= b;
		swap(a, b);
	}
	return a;
}

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

ll range_sum(ll a, ll b) {
	ll dif = a - 1, cnt = b - a + 1;
	ll ans = ((b - a + 1) * (b - a + 2)) / 2;
	ans += ((b - a + 1) * dif);
	return ans;
}

string to2(ll a)
{
	string s = "";
	for (ll i = a; i > 0; ) {
		ll k = i % 2;
		i /= 2;
		char c = k + 48;
		s += c;
	}
	if (a == 0) {
		s = "0";
	}
	reverse(all(s));
	return s;
}

bool isPrime(ll a) {
	if (a == 1) {
		return false;
	}
	for (ll i = 2; i * i <= a; i++) {
		if (a % i == 0) {
			return false;
		}
	}
	return true;
}

int dig_sum(ll a) {
	int sum = 0;
	while (a) {
		sum += int(a % 10);
		a /= 10;
	}
	return sum;
}

ll binpow(ll a, int b) {
	ll ans = 1;
	while (b) {
		if ((b & 1) == 1) {
			ans *= a;
		}
		b >>= 1;
		a *= a;
	}
	return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
	ll ans = 1;
	while (b) {
		if ((b & 1) == 1) {
			ans *= a;
			ans %= mod;
		}
		b >>= 1;
		a *= a;
		a %= mod;
	}
	return ans;
}

ll factorial(int a) {
	ll ans = 1;
	for (int i = 2; i <= a; i++) {
		ans *= ll(i);
	}
	return ans;
}

ll factorial_by_mod(int a, ll mod) {
	ll ans = 1;
	for (int i = 2; i <= a; i++) {
		ans *= ll(i);
		ans %= mod;
	}
	return ans;
}

/* -------------------- Solution -------------------- */

void slv() {
	string s;
	cin >> s;
	int n = s.size();
	for (int i = 0; i < n; i++) {
		if (i == n / 2) cout << " ";
		cout << s[i] << " ";
	}
}

void cs() {
	int tstc = 1;
	//cin >> tstc;
	while (tstc--) {
		slv();
	}
}

void precalc() {
	return;
}

int main() {
	fastio();
	precalc();
	//usaco();
	//precision(5);
	cs();
	return 0;
}

Compilation message

split.cpp:25: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
   25 | #pragma warning(disable : 4996)
      | 
split.cpp:26: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
   26 | #pragma warning(disable : 6031)
      | 
split.cpp: In function 'll range_sum(ll, ll)':
split.cpp:100:18: warning: unused variable 'cnt' [-Wunused-variable]
  100 |  ll dif = a - 1, cnt = b - a + 1;
      |                  ^~~
split.cpp: In function 'void usaco()':
split.cpp:83:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |  freopen("closing.in", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
split.cpp:84:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |  freopen("closing.out", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 100.0

#	Verdict	Memory	Grader output
1	Correct	312 KB	Output is correct
2	Correct	320 KB	Output is correct
3	Incorrect	312 KB	Output isn't correct
4	Incorrect	212 KB	Output isn't correct
5	Incorrect	212 KB	Output isn't correct
6	Incorrect	320 KB	Output isn't correct
7	Incorrect	316 KB	Output isn't correct
8	Incorrect	212 KB	Output isn't correct
9	Incorrect	212 KB	Output isn't correct
10	Incorrect	212 KB	Output isn't correct
11	Incorrect	212 KB	Output isn't correct
12	Incorrect	212 KB	Output isn't correct
13	Incorrect	212 KB	Output isn't correct
14	Incorrect	212 KB	Output isn't correct
15	Incorrect	212 KB	Output isn't correct
16	Incorrect	212 KB	Output isn't correct
17	Incorrect	316 KB	Output isn't correct
18	Incorrect	212 KB	Output isn't correct
19	Incorrect	212 KB	Output isn't correct
20	Incorrect	212 KB	Output isn't correct

Submission #640352

Compilation message

Subtask #1 10.0 / 100.0

Subtask #1
10.0 / 100.0