Submission #375128

#	Time	Username	Problem	Language	Result	Execution time	Memory
375128		Lightning	Sifra (COCI21_sifra)	C++14	50 / 50	1 ms	364 KiB

Main

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 2e5 + 5;
const int oo = 1e9 + 5;

string s;
set <int> st;

void solve() {
    cin >> s;
    for (int i = 0; i < sz(s); ++i) {
        if ('0' <= s[i] && s[i] <= '9') {
            int x = 0;
            while(i < sz(s) && '0' <= s[i] && s[i] <= '9') {
                x *= 10;
                x += (s[i] - '0');
                ++i;
            }
            st.insert(x);
        }
    }
    cout << sz(st);
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message (stderr)

Main.cpp:63:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 |  main () {
      |        ^

• Subtask 1: 50 / 50