text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
bool in[1010];
int main() {
int x, f(0);
while (~scanf("%d,", &x)) in[x] = true;
for (int i(1); i != 1010;)
if (in[i]) {
int j(i + 1);
while (in[j]) ++j;
if (j != i + 1)
cout << (f ? "," : (f = 1, "")) << i << '-' << j - 1;
else
cout << (f ? "," : (f = 1, "")) << i;
i = j;
} else
++i;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string seq;
cin >> seq;
int a[100];
int l = 0;
int i, j;
for (i = 0, j = 0; i < seq.size(); i++) {
if (seq[i] == ',') {
a[j++] = atoi(seq.substr(l, i - l).c_str());
l = i + 1;
}
}
a[j++] = atoi(seq.substr(l, seq.size() - l).c_str());
int n = j;
sort(a, a + n);
int p[1000][2];
int pp = 0;
l = a[0];
int r = a[0];
p[0][0] = a[0];
p[0][1] = a[0];
for (i = 1; i < n; i++) {
if (a[i] == l) continue;
if (a[i] - 1 == l) {
r = a[i];
l = a[i];
} else {
p[pp][1] = r;
pp++;
l = a[i];
r = a[i];
p[pp][0] = l;
p[pp][1] = l;
}
}
p[pp][1] = r;
pp++;
if (p[0][0] - p[0][1] != 0)
cout << p[0][0] << "-" << p[0][1];
else
cout << p[0][0];
for (i = 1; i < pp; i++) {
cout << ",";
if (p[i][0] - p[i][1] != 0)
cout << p[i][0] << "-" << p[i][1];
else
cout << p[i][0];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string input;
cin >> input;
int c = 0;
vector<int> g;
for (int i = 0; i < input.size(); i++) {
if (input[i] == ',') {
g.push_back(c);
c = 0;
} else {
c = c * 10 + (input[i] - '0');
}
}
g.push_back(c);
sort(g.begin(), g.end());
for (int i = 0; i < g.size() - 1; i++) {
if (g[i + 1] == g[i]) {
g.erase(g.begin() + i + 1);
i--;
}
}
int fi = 0;
vector<pair<int, int> > res;
for (int i = 0; i < g.size() - 1; i++) {
if (g[i + 1] - g[i] == 1)
continue;
else {
res.push_back(make_pair(fi, i));
fi = i + 1;
}
}
if (fi == g.size() - 1)
res.push_back(make_pair(fi, fi));
else
res.push_back(make_pair(fi, g.size() - 1));
for (int i = 0; i < res.size(); i++) {
if (i != 0) cout << ",";
if (res[i].first != res[i].second)
cout << g[res[i].first] << "-" << g[res[i].second];
else
cout << g[res[i].first];
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1999999999;
const double pi = acos(-1.0);
const double eps = 1e-10;
char gc() {
char c;
while (isspace(c = getchar()))
;
return c;
}
int main() {
char in[100000];
scanf("%s", in);
for (int i = 0; in[i]; i++)
if (!isdigit(in[i])) in[i] = ' ';
stringstream ss((string)in);
vector<int> v;
int t;
while (ss >> t) v.push_back(t);
sort((v).begin(), (v).end());
v.erase(unique((v).begin(), (v).end()), v.end());
int p = -inf;
bool b = false, b2 = false;
;
for (int i = 0; i < ((int)(v).size()); i++) {
if (v[i] != p) {
if (b) {
putchar('-');
printf("%d", p - 1);
putchar(',');
} else if (b2)
putchar(',');
printf("%d", v[i]);
b2 = true;
b = false;
} else
b = true;
p = v[i] + 1;
}
if (b) {
putchar('-');
printf("%d", p - 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, m, cnt;
int s[N];
int main() {
int x;
while (cin >> x) {
s[x] = 1;
int b;
char c;
int ma = x;
while (cin >> c >> b) {
s[b] = 1;
ma = max(ma, b);
}
for (int i = 1; i <= ma; i++) {
if (s[i] == 1) s[i] = s[i - 1] + 1;
}
for (int i = 0; i <= ma; i++) {
if (s[i] == 1) {
int t = i;
while (s[i + 1] != 0) {
i++;
}
if (i == ma) {
if (i == t)
cout << i;
else
cout << t << "-" << ma;
} else {
if (i == t)
cout << i << ",";
else
cout << t << "-" << i << ",";
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
int pow1(int n, int r) {
int s = 1, i;
for (i = 1; i <= r; i++) {
s = s * n;
}
return s;
}
int po(char p[], int j) {
int num = 0, i, q = 0;
for (i = j - 1; i >= 0; i--) {
num += (p[i] - 48) * pow1(10, q);
q++;
}
return num;
}
int main(void) {
char s[105000], *p;
scanf("%s", s);
int a[1002] = {0}, i, f = 0, c = 0, l, cnt = 0, j = 0, k;
for (i = 0; i < strlen(s); i++) {
if (s[i] != ',') {
if (j == 0) p = (char *)malloc(5);
p[j] = s[i];
j++;
} else {
k = po(p, j);
a[k]++;
j = 0;
}
}
k = po(p, j);
a[k]++;
for (i = 0; i <= 1001; i++) {
if (a[i] > 0) {
if (c == 0) l = i;
f = 1;
c = 1;
} else {
if (f == 1) {
if (cnt == 0) {
if (l < i - 1)
printf("%d-%d", l, i - 1);
else if (l == i - 1)
printf("%d", l);
cnt = 1;
} else {
if (l < i - 1)
printf(",%d-%d", l, i - 1);
else if (l == i - 1)
printf(",%d", l, i - 1);
}
f = 0;
c = 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
static char s[100000];
scanf("%s", s);
int n = (int)strlen(s);
vector<int> w;
for (int i = 0; i < n;) {
if (s[i] == ',') continue;
int j;
for (j = i + 1; j < n && s[j] != ','; ++j)
;
int a;
s[j] = 0;
sscanf(s + i, "%d", &a);
w.push_back(a);
i = j + 1;
}
sort(w.begin(), w.end());
w.resize(unique(w.begin(), w.end()) - w.begin());
n = (int)w.size();
for (int i = 0; i < n;) {
int j;
for (j = i + 1; j < n && w[j] - w[j - 1] <= 1; ++j)
;
if (i) printf(",");
if (j - i > 1)
printf("%d-%d", w[i], w[j - 1]);
else
printf("%d", w[i]);
i = j;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
s += ',';
int len = s.length(), vis[2000];
memset(vis, 0, sizeof(vis));
for (int i = 0; i < len; i++) {
if (s[i] == ',') continue;
int p = s[i] - '0';
for (int j = i + 1; j < len; j++) {
if (s[j] != ',') {
p *= 10;
p += s[j] - '0';
} else {
i = j;
break;
}
}
vis[p] = 1;
}
stringstream ss;
string ans;
for (int i = 0; i <= 1000; i++) {
if (vis[i] == 1) {
for (int j = i + 1; j <= 1001; j++) {
if (vis[j] == 0 && j - i > 1) {
ss << i << '-' << j - 1 << ',';
i = j;
break;
} else if (vis[j] == 0 && j - i == 1) {
ss << i << ',';
i = j;
break;
}
}
}
}
ss >> ans;
ans.erase(ans.length() - 1);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
char s[100007];
vector<int> v;
int main() {
scanf("%s", s);
int num = 0;
for (int i = 0; s[i]; i++) {
if (s[i] == ',')
v.push_back(num), num = 0;
else
num = num * 10 + s[i] - '0';
}
v.push_back(num);
sort(v.begin(), v.end());
v.resize(unique(v.begin(), v.end()) - v.begin());
int l = 0, r = 0;
bool comma = false;
for (int i = 1; i < v.size(); i++) {
if (v[i] == v[i - 1] + 1)
r = i;
else {
if (comma) printf(",");
comma = true;
if (l == r)
printf("%d", v[l]);
else
printf("%d-%d", v[l], v[r]);
l = r = i;
}
}
if (comma) printf(",");
if (l == r)
printf("%d", v[l]);
else
printf("%d-%d", v[l], v[r]);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int d = 0, cnt = 0;
cin >> s;
int used[10005] = {0};
int a[1005], j = 0;
for (int i = 0; i < s.size(); i += 2) {
int g = i;
while (isdigit(s[g])) {
cnt *= 10;
cnt += s[g] - 48;
g++;
}
i += g - i - 1;
a[j++] = cnt;
cnt = 0;
}
sort(a, a + j);
for (int i = 0; i < j; i++) {
if (a[i] == a[i + 1] && i + 1 <= j - 1) {
continue;
} else if (a[i + 1] - a[i] == 1 && d == 0) {
cout << a[i] << "-";
d = 1;
} else if (a[i + 1] - a[i] != 1 && i + 1 <= j - 1) {
cout << a[i] << ",";
d = 0;
} else if (a[i + 1] - a[i] != 1 && i + 1 > j - 1) {
cout << a[i];
d = 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)2e+9;
const int MAX_N = 2e5 + 7;
string convertInt(int number) {
stringstream ss;
ss << number;
return ss.str();
}
int main() {
int arr[100], arr2[100];
int x, index = 0, index2 = 0;
char c;
while (cin >> x) {
cin >> c;
arr2[index2] = x;
index2++;
}
sort(arr2, arr2 + index2);
for (int i = 0; i < index2; i++)
if (i == 0 || arr2[i] != arr2[i - 1]) {
arr[index] = arr2[i];
index++;
}
string ans = "";
int r = -1;
for (int i = 0; i < index; i++) {
bool front = false, back = false;
if (i > 0 && arr[i] - arr[i - 1] == 1) front = true;
if (i < index - 1 && arr[i + 1] - arr[i] == 1) back = true;
if ((front && back))
continue;
else if (back && r == -1)
r = arr[i];
else if (front) {
ans += convertInt(r) + "-" + convertInt(arr[i]) + ",";
r = -1;
} else
ans += convertInt(arr[i]) + ",";
}
if (ans.length() >= 1 && ans[ans.length() - 1] == ',')
ans = ans.substr(0, ans.length() - 1);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
const int N = 3e5 + 10;
int main() {
string str;
cin >> str;
for (auto &c : str)
if (c == ',') c = ' ';
stringstream sin(str);
int x;
map<int, int> mc;
while (sin >> x) {
mc[x] = 1;
}
vector<pair<int, int>> ans;
for (auto &p : mc) {
if (!ans.empty() && ans.back().second == p.first - 1)
ans.back().second++;
else
ans.push_back({p.first, p.first});
}
for (int i = 0; i < ans.size(); i++) {
if (i) putchar(',');
if (ans[i].first == ans[i].second)
printf("%d", ans[i].first);
else
printf("%d-%d", ans[i].first, ans[i].second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int main() {
string s;
cin >> s;
replace(begin(s), end(s), ',', ' ');
stringstream ss(s);
vi v;
for (int k; ss >> k;) v.push_back(k);
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
int n = v.size();
for (int i = 0; i < n; i++) {
string c = i ? "," : "";
int a = v[i];
for (; i < n - 1 && v[i] + 1 == v[i + 1]; i++) {
}
int b = v[i];
cout << c << a;
if (a != b) cout << "-" << b;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int tong[1009];
int x, n;
int main() {
memset(tong, 0, sizeof(tong));
while (~scanf("%d,", &n)) {
tong[n] = 1;
}
int start, end;
int flag1 = 0, flag2 = 0;
for (int i = 1; i <= 1009; i++) {
if (tong[i]) {
if (!flag1) start = i;
end = i;
flag1 = 1;
} else {
if (flag1) {
if (flag2)
printf(",");
else
flag2 = 1;
if (start - end + 1 != 1)
printf("%d-%d", start, end);
else
printf("%d", start);
flag1 = 0;
}
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int> s;
int init;
cin >> init;
s.insert(init);
while (cin) {
char ch;
cin >> ch;
if (ch != ',') break;
int x;
cin >> x;
s.insert(x);
}
vector<int> v;
while (!s.empty()) {
int x = *s.begin();
v.push_back(x);
s.erase(s.begin());
}
if (v.size() == 1) {
cout << v[0];
return 0;
}
int l = 0;
int r = 0;
vector<pair<int, int> > ans;
for (int i = 1; i < v.size(); i++) {
if (v[i] == v[r] + 1) {
r++;
if (i == v.size() - 1) ans.push_back({l, r});
} else {
ans.push_back({l, r});
l = r = i;
if (i == v.size() - 1) ans.push_back({l, r});
}
}
if (v[ans[0].first] == v[ans[0].second])
cout << v[ans[0].first];
else
cout << v[ans[0].first] << "-" << v[ans[0].second];
for (int i = 1; i < ans.size(); i++) {
if (v[ans[i].first] == v[ans[i].second])
cout << "," << v[ans[i].first];
else
cout << "," << v[ans[i].first] << "-" << v[ans[i].second];
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long x, a[1001], c = 1, b[1001];
char ch;
int main() {
memset(a, 0, sizeof(a));
while (cin >> x) {
cin >> ch;
a[x] = 1;
}
for (long long i = 1; i <= (long long)(1001); i++) {
if (a[i] == 1 && i != 1001) b[c] = i, c++;
}
c--;
for (long long i = 1; i <= (long long)(c); i++) {
long long l = b[i], in = i;
while (1) {
if (b[in] + 1 == b[in + 1])
in++;
else
break;
}
if (in != i)
cout << l << '-' << b[in], i = in;
else
cout << l;
if (i < c) cout << ',';
}
fclose(stdin);
fclose(stdout);
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int ret;
stringstream ss(s);
ss >> ret;
return ret;
}
int main() {
set<int> S;
string line;
cin >> line;
int prev = 0;
for (size_t i = 0; i < line.size(); ++i) {
if (line[i] == ',') {
S.insert(toInt(line.substr(prev, i - prev)));
prev = i + 1;
}
}
S.insert(toInt(line.substr(prev)));
vector<int> v(S.begin(), S.end());
prev = 0;
for (int i = 1; i < (int)v.size(); ++i) {
while (v[i] - v[prev] == i - prev) ++i;
if (v[prev] == v[i - 1])
cout << v[prev];
else
cout << v[prev] << "-" << v[i - 1];
prev = i;
--i;
if (i != (int)v.size() - 1) cout << ",";
}
if (v.size() == 1) cout << v[0];
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
char a[1000 + 2];
int vis[1000 + 2];
void solve() {
memset(vis, 0, sizeof(vis));
int len = strlen(a);
int s = 0;
for (int j = 0; j < len; j++) {
if (a[j] == ',') {
vis[s]++;
s = 0;
} else
s = s * 10 + a[j] - '0';
}
vis[s]++;
int k1 = -1, k2 = -1, flag = 0;
for (int i = 1; i <= 1001; i++) {
if (vis[i]) {
if (k1 == -1) k1 = i;
k2 = i;
} else {
if (k1 != -1) {
if (flag) printf(",");
if (k2 != k1)
printf("%d-%d", k1, k2);
else
printf("%d", k1);
k1 = -1;
k2 = -1;
flag = 1;
}
}
}
printf("\n");
}
int main() {
while (gets(a)) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int> b;
string s;
int a[10001] = {0}, lenn = 0;
getline(cin, s);
int len = s.length();
for (int i = 0; i < len; i++) {
int x = 0;
while (isdigit(s[i])) {
x = x * 10 + s[i] - '0';
i++;
}
b.insert(x);
}
set<int>::iterator it = b.begin();
for (it; it != b.end(); it++) {
a[++lenn] = (*it);
}
int now = 1;
printf("%d", a[1]);
for (int i = 2; i <= lenn; i++) {
if (a[i] != 1 + a[i - 1]) {
if (now == 1) {
printf(",%d", a[i]);
} else {
printf("-%d,%d", a[i - 1], a[i]);
now = 1;
}
} else {
now++;
}
}
if (now != 1) {
printf("-%d", a[lenn]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int f, n, i, m, j, st, end;
n = 0;
string s;
cin >> s;
vector<string> v1;
int a[1001];
memset(a, 0, sizeof(a));
m = 0;
for (i = 0; i < s.length(); i++) {
if (s[i] >= 48 && s[i] <= 57) {
n = n * 10 + s[i] - 48;
} else {
a[n] = 1;
if (m < n) m = n;
n = 0;
}
}
a[n] = 1;
f = 0;
if (m < n) m = n;
for (i = 1; i <= m; i++) {
if (a[i] == 1 && f == 0) {
st = i;
f = 1;
continue;
}
if (a[i] == 1 && f == 1) continue;
if (a[i] == 0 && f == 1) {
end = i - 1;
f = 0;
if (st != end) {
string t = "";
t += to_string(st);
t += "-";
t += to_string(end);
v1.push_back(t);
} else {
v1.push_back(to_string(st));
}
}
}
if (f == 1) {
if (m == st) {
v1.push_back(to_string(st));
} else {
string t = "";
t += to_string(st);
t += "-";
t += to_string(m);
v1.push_back(t);
}
}
cout << v1[0];
for (i = 1; i < v1.size(); i++) {
cout << "," << v1[i];
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
bool bucket[1005] = {0};
char c;
int a = 0;
int maxn = -1;
while (cin >> c) {
if (c == ',')
maxn = max(maxn, a), bucket[a]++, a = 0;
else
a = a * 10 + c - '0';
}
bucket[a]++;
maxn = max(maxn, a);
for (int i = 1; i <= maxn; i++) {
if (!bucket[i]) continue;
int t = i;
while (bucket[i + 1]) i++;
if (t != i)
cout << t << "-" << i;
else
cout << t;
if (i < maxn) cout << ",";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline bool check(int* a, int len) {
if (len == 1) return false;
for (register int i = 2; i <= len; i++) {
if (a[i] - a[i - 1] != 1) return false;
}
return true;
}
string ans;
int a[105];
int main() {
set<int> st;
int x;
while (cin >> x) {
st.insert(x);
scanf(",");
}
set<int>::iterator it_end = st.end();
for (register set<int>::iterator it = st.begin(); it != it_end;) {
memset(a, 0, sizeof(a));
set<int>::iterator it_tmp = it, new_it;
bool flag = false;
++it_tmp;
int cur = 1, begin = *it, end = 0;
a[cur] = *it;
for (register set<int>::iterator it_2 = it_tmp; it_2 != it_end; ++it_2) {
a[++cur] = *it_2;
if (check(a, cur)) {
end = *it_2;
new_it = it_2;
flag = true;
} else
break;
}
if (flag) {
ans += to_string(begin) + "-" + to_string(end) + ",";
} else
ans += to_string(*it) + ",";
if (flag) {
it = new_it;
++it;
} else
++it;
}
ans.pop_back();
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[(int)2e3];
int main() {
string s;
cin >> s;
int num = 0;
int Max = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != ',') {
num *= 10;
num += (s[i] - '0');
} else {
Max = max(num, Max);
A[num]++;
num = 0;
}
}
A[num]++;
Max = max(Max, num);
for (int i = 1; i <= 1000; i++) {
if (A[i] && !A[i - 1]) {
cout << i;
} else if (A[i] && !A[i + 1]) {
cout << '-' << i;
}
if (A[i] && !A[i + 1] && i != Max) cout << ',';
}
return 0;
}
|
#include <bits/stdc++.h>
int d[1000];
void Qsort(int, int);
bool Checked(int, int);
int main(int argc, char** argv) {
char a[10000];
std ::cin >> a;
int id = 0;
int k = 0;
while (a[k] != '\0') {
int num = 0;
while ((a[k] != '\0') && (a[k] != ',')) {
num = (num * 10) + (a[k] - '0');
k++;
}
k++;
if (Checked(num, id) == true) d[id++] = num;
}
bool flag = false;
Qsort(0, id - 1);
int cnt = 0;
int index = 0;
for (int i = 1; i <= id; i++) {
if (d[i - 1] + 1 == d[i]) {
if (cnt == 0) index = i - 1;
cnt++;
} else {
if (cnt != 0) {
if (flag == true) {
std ::cout << ',' << d[index] << '-' << d[index + cnt];
} else {
std ::cout << d[index] << '-' << d[index + cnt];
flag = true;
}
cnt = 0;
} else {
if (flag == true) {
std ::cout << ',' << d[i - 1];
} else {
std ::cout << d[i - 1];
flag = true;
}
cnt = 0;
}
}
}
if (flag == true) {
if (cnt != 0) std ::cout << ',' << d[index] << '-' << d[index + cnt];
} else {
if (cnt != 0) std ::cout << d[index] << '-' << d[index + cnt];
}
return 0;
}
void Qsort(int l, int r) {
if (l > r) return;
int i = l;
int j = r;
int m = d[(l + r) / 2];
while (i <= j) {
while (d[i] < m) i++;
while (d[j] > m) j--;
if (i <= j) {
int temp = d[i];
d[i] = d[j];
d[j] = temp;
i++;
j--;
}
}
Qsort(l, j);
Qsort(i, r);
}
bool Checked(int key, int n) {
for (int i = 0; i < n; i++) {
if (d[i] == key) return false;
}
return true;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int sz = 1e7 + 4;
const signed long long int MIN = numeric_limits<signed long long int>::min();
int a[10000];
int main() {
int n;
for (int i = 0;; i++) {
int tmp = scanf("%d,", &a[i]);
if (tmp != 1) {
n = i;
break;
}
}
sort(a, a + n);
n = unique(a, a + n) - a;
int c = 0;
for (int i = 0; i < n;) {
int j = i;
for (; j < n && (i == j || a[j] == a[j - 1] + 1); j++)
;
if (i == j - 1) {
if (c) {
cout << ",";
}
c = 1;
cout << a[i];
} else {
if (c) {
cout << ",";
}
c = 1;
cout << a[i] << "-" << a[j - 1];
}
i = j;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
bool arr[1001] = {0};
int x = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ',') {
arr[x] = 1;
x = 0;
} else {
x *= 10;
x += (s[i] - '0');
}
}
arr[x] = 1;
int cnt = 0;
bool c = 0;
for (int i = 1; i < 1001; i++) {
if (arr[i] && c == 0) {
c = 1;
x = i;
} else if (arr[i] == 0 && c == 1) {
c = 0;
if (cnt != 0) {
cout << ",";
}
if (x == i - 1) {
cout << x;
} else {
cout << x << "-" << i - 1;
}
cnt++;
}
}
if (c == 1) {
if (cnt != 0) {
cout << ",";
}
if (x == 1000) {
cout << x;
} else {
cout << x << "-" << 1000;
}
cnt++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010], flag[3], i, ans, flag1 = 1;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
if (c != ',') flag[1] = 1;
return x;
}
int main() {
for (i = 1; flag[1] == 0; i++) a[i] = read(), b[a[i]]++;
for (i = 1; i <= 1001; i++) {
if (ans == 0 && b[i]) {
ans = 1;
continue;
}
if (b[i] && b[i - 1]) ans++;
if (b[i] == 0 && b[i - 1]) {
if (flag1) {
flag1 = 0;
if (ans > 1)
printf("%d-%d", i - ans, i - 1);
else
printf("%d", i - 1);
} else {
if (ans > 1)
printf(",%d-%d", i - ans, i - 1);
else
printf(",%d", i - 1);
}
ans = 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l[1000], r[1000];
bool f[1000];
char st[10000];
int main() {
gets(st);
int len = strlen(st), i = 0;
memset(f, false, sizeof(f));
while (i < len) {
int j = 0;
while (i < len && isdigit(st[i])) {
j = j * 10 + st[i] - '0';
++i;
}
++i;
f[j - 1] = true;
}
i = 0;
int tot = 0;
while (i < 1000) {
while (i < 1000 && !f[i]) {
++i;
}
int j = i;
while (i < 1000 && f[i]) {
++i;
}
if (i > j) {
l[tot] = j;
r[tot] = i - 1;
++tot;
}
}
if (l[0] < r[0]) {
printf("%d-%d", l[0] + 1, r[0] + 1);
} else {
printf("%d", l[0] + 1);
}
for (i = 1; i < tot; ++i) {
if (l[i] < r[i]) {
printf(",%d-%d", l[i] + 1, r[i] + 1);
} else {
printf(",%d", l[i] + 1);
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long numb(string str) {
long long i, num = 0, len = (int)str.size();
for (i = 0; i < len; i++) num = (num * 10) + (str[i] - '0');
return num;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string str, tmp = "";
vector<long long> vec;
map<long long, long long> mm;
long long i, len, temp;
cin >> str;
str += ",)";
len = (int)str.size();
for (i = 0; i < len; i++) {
if (str[i] == ')')
break;
else if (str[i] == ',') {
temp = numb(tmp);
mm[temp]++;
tmp = "";
} else
tmp += str[i];
}
for (auto &a : mm) vec.push_back(a.first);
len = (int)vec.size();
for (i = 0; i < len - 1; i++) {
if (vec[i] + 1 != vec[i + 1]) {
cout << vec[i];
if (i != len - 1) cout << ",";
} else if (vec[i] + 1 == vec[i + 1]) {
cout << vec[i] << "-";
while (1) {
i++;
if (vec[i] + 1 == vec[i + 1] && i < len - 1)
continue;
else
break;
}
cout << vec[i];
if (i != len - 1) cout << ",";
}
}
if (vec[len - 1] - 1 != vec[len - 2]) cout << vec[len - 1];
return 0;
}
|
#include <bits/stdc++.h>
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
char seq[600];
int page[110];
int n, j, i;
char *ptr;
int beg, end;
char flag;
i = 0;
gets(seq);
ptr = seq;
j = 0;
while (*ptr) {
sscanf(ptr, "%d", &page[i]);
i++;
while (seq[j] && seq[j] != ',') j++;
if (seq[j] == ',') j++;
ptr = seq + j;
}
n = i;
qsort(page, n, sizeof(int), comp);
beg = end = page[0];
flag = 0;
for (i = 1; i < n; i++) {
if (page[i] == end) continue;
if (page[i] == end + 1)
end++;
else {
if (flag)
printf(",");
else
flag = 1;
if (beg != end) {
printf("%d-%d", beg, end);
} else
printf("%d", beg);
beg = end = page[i];
}
}
if (flag) printf(",");
if (beg != end)
printf("%d-%d\n", beg, end);
else
printf("%d\n", beg);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void FAST_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
template <class F, class S>
ostream& operator<<(ostream& os, pair<F, S>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T, class S>
ostream& operator<<(ostream& os, map<T, S>& v) {
os << "{";
for (auto& i : v) cout << "{" << i.first << "," << i.second << "}";
os << "}";
return os;
}
template <class T>
ostream& operator<<(ostream& os, set<T>& v) {
os << "{";
for (auto& i : v) cout << i << ",";
os << "}";
return os;
}
template <class T>
ostream& operator<<(ostream& os, vector<T>& v) {
os << "[";
if (v.size()) os << v[0];
for (int i = 1; i < v.size(); ++i) os << "," << v[i];
os << "]";
return os;
}
int main() {
int n;
vector<bool> in(1002);
while (cin >> n) {
in[n] = true;
getchar();
}
int first = true;
for (int i = 0; i < in.size(); ++i) {
if (!in[i]) continue;
int begin = i;
while (in[i]) i++;
if (!first) printf(",");
if (i - begin > 1)
printf("%d-%d", begin, i - 1);
else
printf("%d", i - 1);
first = false;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long con(string s) {
long long ans = 0;
for (int i = 0; i < s.size(); i++) {
ans += pow(10, s.size() - 1 - i) * (s[i] - 48);
}
return ans;
}
set<int> st;
vector<int> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
s += ",";
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '1' && s[i] <= '9') {
string cur = "";
cur += s[i];
int j = i + 1;
while (s[j] != ',') {
cur += s[j];
j++;
}
i += cur.size();
st.insert(con(cur));
}
}
for (auto i : st) {
v.push_back(i);
}
v.push_back(2000);
stack<int> t;
int p;
for (int i = 0; i < v.size(); i++) {
if (t.empty()) {
t.push(v[i]);
p = v[i];
} else if (v[i] - t.top() > 1) {
if (t.size() == 1) {
if (i == v.size() - 1) {
cout << t.top();
} else {
cout << t.top() << ",";
}
} else {
if (i == v.size() - 1) {
cout << p << "-" << t.top();
} else {
cout << p << "-" << t.top() << ",";
}
}
while (!t.empty()) {
t.pop();
}
t.push(v[i]);
p = v[i];
} else {
t.push(v[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int main() {
vector<int> pages;
for (;;) {
int v;
if (scanf("%d,", &v) == -1) break;
pages.push_back(v);
}
set<int> pp;
for (int i = 0; i < (int)(pages.size()); ++i) pp.insert(pages[i]);
bool b = 0;
for (set<int>::iterator it = pp.begin(); it != pp.end();) {
int first = *it;
int second = *it;
int prev = *it - 1;
while (it != pp.end() && *it == prev + 1) {
second = *it;
++it;
prev++;
}
if (b) printf(",");
b = 1;
if (first < second)
printf("%d-%d", first, second);
else
printf("%d", first);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string t;
int a[110], m, n, s;
bool d;
int main() {
cin >> t;
for (int i = 0; i < t.size(); i++) {
if (t[i] == ',') d = 1;
}
if (!d)
cout << t << endl;
else {
for (int i = 0; i < t.size(); i++) {
if (t[i] == ',' or i == t.size() - 1) {
a[m] = stoi(t.substr(s, i));
m++;
s = i + 1;
}
}
sort(a, a + m);
for (int i = 1; i < m; i++) {
if (a[i] - a[i - 1] > 1 or i == m - 1) {
if (i - 1 != n and a[i - 1] != a[n]) {
if (a[i] - a[i - 1] > 1 and i == m - 1)
cout << a[n] << "-" << a[i - 1] << "," << a[i];
else if (a[i] - a[i - 1] <= 1 and i == m - 1)
cout << a[n] << "-" << a[i];
else
cout << a[n] << "-" << a[i - 1];
n = i;
if (i != m - 1) cout << ",";
} else {
cout << a[n];
if (i == m - 1 and a[i] != a[i - 1]) cout << "," << a[m - 1];
n = i;
if (i != m - 1) cout << ",";
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, num[1000];
char s[1000];
char *token;
string a;
scanf("%s", s);
token = strtok(s, ",");
i = 0;
while (token != NULL) {
num[i++] = atoi(token);
token = strtok(NULL, ",");
}
sort(num, num + i);
int j, n = 1;
for (j = 1; j < i; j++) {
if (num[j] != num[j - 1]) {
num[n++] = num[j];
}
}
int st = 0, flag = 0;
for (i = 1; i < n; i++) {
if (num[i] != num[i - 1] + 1) {
if (flag) {
printf(",");
}
if (st == i - 1) {
printf("%d", num[i - 1]);
} else {
printf("%d-%d", num[st], num[i - 1]);
}
st = i;
flag = 1;
}
}
if (flag) {
printf(",");
}
if (st == i - 1) {
printf("%d", num[i - 1]);
} else {
printf("%d-%d", num[st], num[i - 1]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ptr;
int len;
string input;
void init() {
ptr = 0;
len = input.length();
}
int get_page_num() {
int res = 0;
while (ptr < len && input[ptr] != ',') {
res = 10 * res + (input[ptr] - '0');
ptr += 1;
}
ptr += 1;
return res;
}
void solve() {
vector<int> nums;
for (int num; num = get_page_num();) {
nums.push_back(num);
}
sort(nums.begin(), nums.end());
int start = nums[0];
int end = nums[0];
for (int i = 1; i < nums.size(); i++) {
if (end == nums[i]) continue;
if (end + 1 == nums[i])
end = nums[i];
else {
if (start == end)
printf("%d,", start);
else
printf("%d-%d,", start, end);
start = end = nums[i];
}
}
if (start == end)
printf("%d\n", start);
else
printf("%d-%d\n", start, end);
}
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(0);
cin >> input;
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
v.resize(10000, 0);
int num;
char coma;
int n = 0;
cin >> num;
cin >> coma;
v[num - 1] = 1;
n++;
while (!cin.eof()) {
cin >> num;
cin >> coma;
v[num - 1] = 1;
n++;
}
int size = 0;
for (int m = 0; m <= 1001; m++) {
if (m + 1 > size && v[m] == 1) size = m + 1;
}
int stop;
for (int i = size; i >= 0; i--) {
if (v[i] == 1) {
stop = i;
break;
}
}
int estado = 0;
for (int i = 0; i <= stop; i++) {
if (v[i] == 0) {
if (estado == 1) {
cout << ",";
estado = 0;
}
estado = 0;
} else {
if (estado == 0) {
cout << i + 1;
estado = 1;
} else if (i + 1 <= stop) {
if (v[i + 1] == 0) {
cout << "-" << i + 1;
}
} else if (i == size - 1) {
cout << "-" << i + 1;
}
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string a;
cin >> a;
vector<string> q;
string w = "";
for (int i = 0; i < a.size(); i++) {
if (a[i] != ',') {
w += a[i];
} else {
q.push_back(w);
w = "";
}
}
if (w.size() != 0) {
q.push_back(w);
}
vector<int> e;
for (int i = 0; i < q.size(); i++) {
vector<int> r;
for (int j = 0; j < q[i].size(); j++) {
r.push_back(q[i][j] - '0');
}
if (r.size() == 1) {
e.push_back(r[0]);
}
if (r.size() == 2) {
e.push_back(r[0] * 10 + r[1]);
}
if (r.size() == 3) {
e.push_back(r[0] * 100 + 10 * r[1] + r[2]);
}
if (r.size() == 4) {
e.push_back(r[0] * 1000 + r[1] * 100 + r[2] * 10 + r[3]);
}
}
if (e.size() == 1) {
cout << e[0];
return 0;
}
sort(e.begin(), e.end());
int t = e[0];
;
int s = e[0];
e.push_back(10000);
for (int i = 1; i < e.size(); i++) {
if (e[i] - 1 == t) {
t = e[i];
continue;
}
if (e[i] - 1 > t) {
if (s == t) {
if (e[i] == 10000) {
cout << s;
} else {
cout << s << ",";
}
s = e[i];
t = e[i];
} else {
if (e[i] == 10000) {
cout << s << "-" << t;
} else {
cout << s << "-" << t << ",";
}
s = e[i];
t = e[i];
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char palabra[10000];
bool check[10000];
scanf("%s", palabra);
vector<int> numeros;
int tmp = 0;
int j = 0;
int numtemp = 0;
for (int i = 0; i <= strlen(palabra); i++) {
if (palabra[i] == ',' || i == strlen(palabra)) {
if (!check[numtemp]) {
numeros.push_back(numtemp);
check[numtemp] = true;
}
numtemp = 0;
} else {
numtemp *= 10;
numtemp += palabra[i] - '0';
}
}
bool set = false;
sort(numeros.begin(), numeros.end());
int inf = numeros[0], sup;
int c = numeros[0];
for (int i = 0; i < numeros.size(); i++) {
if (numeros[i + 1] == c + 1) {
c++;
} else {
sup = numeros[i];
if (inf == sup)
printf("%d", inf);
else
printf("%d-%d", inf, sup);
if (i != numeros.size() - 1) printf(",");
inf = numeros[i + 1];
c = inf;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, st, ans = 0;
int gen_num(string s) {
int k = 0;
for (int p = 0; s[p]; p++) k = (k * 10) + s[p] - '0';
return k;
}
int main() {
vector<int> v;
map<int, int> taken;
string s, t = "";
cin >> s;
int k;
for (i = 0; s[i]; i++) {
if (s[i] == ',') {
k = gen_num(t);
if (!taken[k]) v.push_back(k), taken[k] = 1;
t = "";
} else
t += s[i];
}
k = gen_num(t);
if (!taken[k]) v.push_back(k);
sort(v.begin(), v.end());
for (i = 1, st = 0; i < v.size(); i++) {
if (v[i] - v[i - 1] > 1) {
if (v[st] == v[i - 1])
cout << v[st];
else
cout << v[st] << '-' << v[i - 1];
cout << ',';
st = i;
}
}
if (v[st] == v[v.size() - 1])
cout << v[st];
else
cout << v[st] << '-' << v[v.size() - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void output();
void input_process();
vector<bool> pages;
int main() {
pages = vector<bool>(1010, false);
input_process();
output();
return 0;
}
void input_process() {
string inp;
getline(cin, inp);
istringstream iss(inp);
int p = -1;
iss >> p;
pages[p] = true;
char comma;
while (iss >> comma >> p) {
pages[p] = true;
}
}
void output() {
int i = 0;
string res = "";
bool f = true;
while (i <= 1001) {
if (pages[i]) {
int j = i;
while (pages[j]) {
j++;
}
if (f) {
f = false;
if ((i + 1) == j) {
ostringstream oss;
oss << i;
res += oss.str();
} else {
ostringstream oss;
oss << i;
oss << '-';
oss << (j - 1);
res += oss.str();
}
} else {
if ((i + 1) == j) {
ostringstream oss;
oss << ',';
oss << i;
res += oss.str();
} else {
ostringstream oss;
oss << ',';
oss << i;
oss << '-';
oss << (j - 1);
res += oss.str();
}
}
i = j;
} else
i++;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)(1e9);
const int mod = inf + 7;
const double pi = acos(-1.0);
const double eps = 1e-9;
string second;
vector<int> v;
string get(string second, int l, int r) {
string ans = "";
for (int i = l; i < r; i++) ans += second[i];
return ans;
}
int toInt(string second) {
int ans = 0;
for (int i = 0; i < second.length(); i++) ans = 10 * ans + second[i] - '0';
return ans;
}
string toString(int n) {
string ans = "";
if (n == 0) ans += "0";
while (n != 0) {
ans = (char)(n % 10 + 48) + ans;
n /= 10;
}
return ans;
}
int main() {
getline(cin, second);
int pos = 0;
while (pos < second.length()) {
if (second[pos] == ',')
pos++;
else {
int pos1 = pos;
while (pos1 < second.length() && second[pos1] != ',') pos1++;
v.push_back(toInt(get(second, pos, pos1)));
pos = pos1;
}
}
sort(v.begin(), v.end());
int n = unique(v.begin(), v.end()) - v.begin();
string ans = "";
pos = 0;
while (pos < n) {
int pos1 = pos + 1;
while (pos1 < n && v[pos1] - 1 == v[pos1 - 1]) pos1++;
pos1--;
if (pos == pos1) {
ans += toString(v[pos]) + ",";
} else {
ans += toString(v[pos]);
ans += "-";
ans += toString(v[pos1]);
ans += ",";
}
pos = pos1 + 1;
}
ans.erase(ans.length() - 1);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> num;
string ans;
int main() {
string x;
while (getline(cin, x, ',')) num.push_back(stoi(x));
sort(num.begin(), num.end());
num.erase(unique(num.begin(), num.end()), num.end());
int l = num.front();
int r = num.front();
num.push_back(0x3f3f3f);
for (auto i = num.begin(); i != num.end() - 1; i++) {
if (*i == *(i + 1) - 1) {
r++;
} else {
if (l == r) {
stringstream ss;
ss << l << ',';
ans += ss.str();
ss.clear();
} else {
stringstream ss;
ss << l << '-' << r << ',';
ans += ss.str();
ss.clear();
}
l = r = *(i + 1);
}
}
ans.pop_back();
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INFint = 2147483647;
const long long INF = 9223372036854775807ll;
const long long MOD = 1000000009ll;
const long double EPS = 1e-9;
int a[111];
int main() {
ios_base::sync_with_stdio(0);
int it = 0;
while (scanf("%d,", &a[it]) == 1) it++;
sort(a, a + it);
int l;
int r;
for (int i = 0; i < it;) {
l = a[i];
i++;
while (i < it && (a[i] == a[i - 1] || a[i] == a[i - 1] + 1)) i++;
if (a[i - 1] != l)
printf("%d-%d", l, a[i - 1]);
else
printf("%d", l);
if (i < it) printf(",");
}
fprintf(stderr, "\nTIME = %lf\n", 1.0 * clock() / CLOCKS_PER_SEC);
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const ll N = 1e6 + 1, MAX = 1e18;
vector<long long> v;
vector<pair<long long, long long>> ans;
signed main() {
string s;
cin >> s;
long long c = 0;
for (auto x : s) {
if (x == ',') {
v.push_back(c);
c = 0;
} else {
c = c * 10 + x - '0';
}
}
if (c) v.push_back(c);
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
cout << endl;
long long l = v[0], r = v[0];
v.push_back(INT_MAX);
for (long long i = 1; i < (long long)v.size(); i++) {
if (v[i] == v[i - 1] + 1) {
r = v[i];
} else {
ans.push_back({l, r});
l = r = v[i];
}
}
if (ans[0].first != ans[0].second) {
cout << ans[0].first << '-' << ans[0].second;
} else {
cout << ans[0].first;
}
for (long long i = 1; i < (long long)ans.size(); i++) {
cout << ',';
if (ans[i].first != ans[i].second) {
cout << ans[i].first << '-' << ans[i].second;
} else {
cout << ans[i].first;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> st;
int main() {
char c;
int co = 0, n;
int vis[1005], a[1005];
memset(vis, 0, sizeof vis);
while (scanf("%d%*c", &n) != EOF) {
vis[n] = 1;
}
for (int i = 1, j = 1; i <= 1001; i = ++j) {
if (vis[i]) {
for (j = i; vis[j]; j++)
;
j--;
if (!co)
co = 1;
else
cout << ",";
if (i == j)
cout << i;
else
cout << i << "-" << j;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
bool present[1010];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
while (cin >> n) {
present[n] = true;
char c;
cin >> c;
}
int rMax;
for (long long i = (1009); i >= (0); --i)
if (present[i]) {
rMax = i;
break;
}
int l;
bool flag = true;
for (long long i = 0; i < (1010); ++i)
if (flag) {
if (present[i]) {
l = i;
flag = false;
}
} else {
if (!present[i]) {
if (i - 1 > l)
cout << l << "-" << i - 1;
else
cout << l;
if (i != rMax + 1) cout << ',';
flag = true;
}
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, n, Min, a[10000], temp, p1, p2, ans, m, x;
char ch;
bool f;
int main() {
for (i = 0; i <= 2000; i++) a[i] = 0;
for (i = 0;; i++) {
scanf("%d", &x);
a[x] = 1;
ch = getchar();
if (ch != ',') break;
}
f = false;
for (i = 1; i <= 1000; i++) {
if (a[i] && a[i - 1] == 0) {
if (f) cout << ",";
cout << i;
f = true;
if (a[i + 1] == 1) {
cout << "-";
}
} else if (a[i] && a[i - 1] == 1 && a[i + 1] == 0) {
cout << i;
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const double PI = 3.141592653589793;
set<int> zbior;
set<int>::iterator it;
string s;
char t[1000000];
int last, pocz, i, a;
bool bylo;
int main() {
scanf("%s", &t);
s = t;
i = 0;
zbior.clear();
while (i < s.size()) {
a = 0;
while (i < s.size() && s[i] != ',') {
a = a * 10 + int(s[i]) - 48;
i++;
}
zbior.insert(a);
i++;
}
last = -10;
bylo = false;
for (it = zbior.begin(); it != zbior.end(); it++) {
if (last < 0) {
last = pocz = *it;
} else if (*it != last + 1) {
if (bylo)
printf(",");
else
bylo = true;
if (pocz == last)
printf("%d", pocz);
else
printf("%d-%d", pocz, last);
pocz = *it;
}
last = *it;
}
if (bylo)
printf(",");
else
bylo = true;
if (pocz == last)
printf("%d", pocz);
else
printf("%d-%d", pocz, last);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
vector<string> splitted;
stringstream ss(s);
string item;
while (getline(ss, item, ',')) {
splitted.push_back(item);
}
int MAX = 1001;
vector<bool> a(MAX + 1);
for (const string& page : splitted) {
a[stoi(page)] = true;
}
vector<pair<int, int>> ret;
int p = 0;
while (p <= MAX) {
if (a[p]) {
int from = p;
int to = from;
while (a[to]) {
++to;
}
ret.emplace_back(from, to - 1);
p = to;
} else {
++p;
}
}
for (int i = 0; i < ret.size(); ++i) {
int from = ret[i].first;
int to = ret[i].second;
cout << from;
if (to != from) {
cout << '-' << to;
}
if (i != ret.size() - 1) {
cout << ',';
}
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int i = 1, s(0), e(0);
int arr[1005] = {};
int x = 0;
for (i = 0; i < (int)str.length(); i++) {
if (str[i] != ',') {
x *= 10;
x += str[i] - '0';
} else {
arr[x] = 1;
x = 0;
}
}
arr[x] = 1;
i = 0;
vector<pair<int, int> > v;
while (i < 1002) {
if (arr[i] == 1) {
if (s == 0) {
s = i;
}
} else {
if (s != 0) {
v.push_back(make_pair(s, e));
s = 0;
}
}
e = i;
i++;
}
for (i = 0; i < ((int)(v).size()) - 1; i++) {
if (v[i].first != v[i].second)
cout << v[i].first << "-" << v[i].second << ",";
else
cout << v[i].first << ",";
}
if (v[i].first != v[i].second)
cout << v[i].first << "-" << v[i].second << endl;
else
cout << v[i].first << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> mp;
vector<long long int> v;
int main() {
long long int l = 0, n, i, j = 0, bit = 0;
string s;
cin >> s;
s += ',';
for (i = 0; i < s.length(); i++) {
if (s[i] == ',') {
long long int numb = 0;
for (j = l; j < i; j++) {
numb = numb * 10 + 10 * (s[j] - '0');
}
numb /= 10;
v.push_back(numb);
l = i + 1;
}
}
for (i = 0; i < v.size(); i++) {
mp[v[i]]++;
}
l = -1;
string ans = "";
for (i = 0; i <= 1001; i++) {
if (mp[i] == 0) {
if (mp[i - 1] != 0 && l != i - 1) {
if (bit == 0)
cout << l << "-" << i - 1;
else
cout << "," << l << "-" << i - 1;
bit = 1;
l = -1;
} else if (mp[i - 1] != 0) {
if (bit == 0)
cout << i - 1;
else
cout << "," << i - 1;
bit = 1;
l = -1;
}
} else {
if (l == -1) l = i;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[500];
bool flag[1005];
int main() {
int m, mmax, i, sum, ff;
cin.getline(a, 499);
{
memset(flag, 0, sizeof(flag));
m = strlen(a);
mmax = 0;
for (i = 0; i < m; i++) {
sum = 0;
while (a[i] != ',' && a[i] != '\0') {
sum = sum * 10 + a[i] - '0';
i++;
}
flag[sum] = 1;
if (sum > mmax) mmax = sum;
}
ff = 0;
for (i = 1; i <= 1000; i++) {
if (flag[i]) {
if (ff == 0) {
if (flag[i + 1] == 1) {
printf("%d-", i);
ff = 1;
} else {
if (i == mmax)
printf("%d\n", i);
else
printf("%d,", i);
}
} else {
if (flag[i + 1] == 0) {
if (i == mmax)
printf("%d\n", i);
else
printf("%d,", i);
ff = 0;
}
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[1100], b[1100], i, x;
char c;
int h, t;
for (i = 0; i <= 1000; i++) b[i] = 0;
int n = 0;
for (;;) {
scanf("%d", &x);
if (b[x] == 0) {
b[x] = 1;
a[n] = x;
n++;
}
c = getchar();
if (c == '\n') break;
}
sort(a, a + n);
h = t = a[0];
i = 0;
for (;;) {
while (a[i + 1] - a[i] == 1) {
i++;
}
t = a[i];
if (h == t) {
printf("%d", h);
} else
printf("%d-%d", h, t);
h = a[i + 1];
i++;
if (i != n) printf(",");
if (i > n - 1) break;
;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, -1, 0};
int dy[] = {1, 0, 0, -1};
long double PI = 3.14159265358979323846264338327950;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int a[1005];
memset(a, 0, sizeof a);
for (int i = 0; i < (int)s.size(); i++) {
string tmp;
int num;
while (s[i] != ',' && i < (int)s.size()) {
tmp += s[i];
i++;
}
stringstream ss;
ss << tmp;
ss >> num;
ss.clear();
a[num]++;
}
bool f = 0;
for (int i = 0; i < 1005; i++) {
if (a[i] && a[i + 1]) {
if (f) cout << ',';
f = 1;
cout << i << "-";
while (a[i] && a[i + 1] && i < 1005) {
i++;
}
cout << i;
} else if (a[i]) {
if (f) cout << ',';
f = 1;
cout << i;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool a[1024], l;
string S;
void go() {
int t = 0, pos = 0;
while (pos < S.size()) {
t = 0;
while (pos < S.size() && S[pos] != ',') {
t = t * 10 + S[pos] - '0';
pos++;
}
a[t] = true;
pos++;
}
}
int main() {
memset(a, false, sizeof(a));
cin >> S;
go();
int cnt, ii;
bool pr = false;
for (int i = 1; i < 1024; i++) {
if (a[i]) {
cnt = 0;
while (a[i]) {
cnt++;
i++;
}
if (cnt == 1) {
if (!pr)
printf("%d", i - 1);
else
printf(",%d", i - 1);
pr = true;
} else {
if (!pr)
printf("%d-%d", i - cnt, i - 1);
else
printf(",%d-%d", i - cnt, i - 1);
pr = true;
}
}
}
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
s += ',';
set<int> se;
int k = s.find(',');
while (k != string::npos) {
char s1[100];
for (int i = 0; i < 100; i++) {
s1[i] = 0;
}
for (int i = 0; i < k; i++) {
s1[i] = s[i];
}
int p = atoi(s1);
if (!se.count(p)) {
se.insert(p);
}
s.erase(0, k + 1);
k = s.find(',');
}
set<int>::iterator ite = se.begin();
int beg = *se.begin();
for (set<int>::iterator iter = ++se.begin(); iter != se.end(); iter++) {
if ((*iter) == ((*ite) + 1)) {
ite = iter;
} else {
if (*(ite)-beg > 0) {
cout << beg << '-' << *(ite);
} else {
cout << beg;
}
cout << ',';
beg = (*iter);
ite = iter;
}
}
if (*(ite)-beg > 1) {
cout << beg << '-' << *(ite);
} else {
cout << beg;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool a[1001] = {false};
int main() {
int b = 0;
int c = 0;
string q;
cin >> q;
for (unsigned int j = 0; j < q.length(); j++) {
if (q[j] != ',') {
b *= 10;
b += q[j] - 48;
} else {
a[b] = true;
c++;
b = 0;
}
}
a[b] = true;
b = 0;
bool isit = false;
bool sta = true;
for (int i = 0; i < 1001; i++) {
int y = 0;
if (a[i] == true) {
y = i;
if (a[i + 1] == false) {
if (isit == false)
if (!sta)
cout << "," << y;
else {
cout << y;
sta = false;
}
else
cout << y;
isit = false;
} else {
if (isit == false) {
if (!sta)
cout << "," << y << "-";
else {
cout << y << "-";
sta = false;
}
}
isit = true;
}
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
set<int> myset;
set<int>::iterator it;
string s, tmp;
int start, pos, left;
bool flag;
while (cin >> s) {
myset.clear();
while ((pos = s.find(',')) != string ::npos) {
tmp = s.substr(0, pos);
myset.insert(atoi(tmp.c_str()));
s = s.substr(pos + 1);
}
tmp = s.substr(0, pos);
myset.insert(atoi(tmp.c_str()));
for (flag = false, it = myset.begin(), left = start = *it, ++it;
it != myset.end(); ++it) {
if (*it == start + 1) {
flag = true;
++start;
} else {
if (flag)
cout << left << '-' << start << ",";
else
cout << start << ",";
left = start = *it;
flag = false;
}
}
if (left != start)
cout << left << '-' << start << endl;
else
cout << start << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int Inf = (int)1e10;
int main() {
ios_base::sync_with_stdio(false);
string s;
cin >> s;
s += ",";
vector<int> nums;
int acc = 0;
for (int i = 0; i < s.length(); i++)
if (s[i] == ',') {
nums.push_back(acc);
acc = 0;
} else {
acc = 10 * acc + s[i] - '0';
}
nums.push_back(100000);
sort(nums.begin(), nums.end());
int start = nums[0];
int last = start;
for (int i = 1; i < nums.size(); i++)
if (nums[i] == last)
continue;
else if (nums[i] == last + 1)
last++;
else {
if (start == last)
cout << start;
else
cout << start << '-' << last;
if (i < nums.size() - 1) cout << ',';
start = last = nums[i];
}
}
|
#include <bits/stdc++.h>
bool mark[2000];
using namespace std;
vector<int> numbers;
int toint(string s, int first, int end) {
int ans = 0;
for (int i = first; i < end; i++) {
ans = ans * 10 + (s[i] - '0');
}
return ans;
}
int main() {
string s;
cin >> s;
int index = 0;
int num = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ',' || i == s.size() - 1) {
if (i == s.size() - 1)
num = toint(s, index, i + 1);
else
num = toint(s, index, i);
if (!mark[num]) {
numbers.push_back(num);
mark[num] = 1;
}
index = i + 1;
}
}
sort(numbers.begin(), numbers.end());
int ind[2] = {0, 0};
int size_of_output = 0;
bool f = false;
for (int i = 1; i < numbers.size(); i++) {
if (numbers[i] == numbers[i - 1] + 1) {
ind[1]++;
f = 1;
} else {
f = 0;
if (ind[1] - ind[0] == 0) {
if (size_of_output > 0) {
cout << "," << numbers[ind[0]];
} else
cout << numbers[ind[0]];
} else {
if (size_of_output > 0) {
cout << "," << numbers[ind[0]] << "-" << numbers[ind[1]];
} else
cout << numbers[ind[0]] << "-" << numbers[ind[1]];
}
ind[0] = ind[1] = i;
size_of_output++;
}
}
if (ind[1] - ind[0] == 0) {
if (size_of_output > 0) {
cout << "," << numbers[ind[0]];
} else
cout << numbers[ind[0]];
} else {
if (size_of_output > 0) {
cout << "," << numbers[ind[0]] << "-" << numbers[ind[1]];
} else
cout << numbers[ind[0]] << "-" << numbers[ind[1]];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
bool a[1005];
char ch;
int main() {
while (ch != '\n') {
cin >> n;
ch = getchar();
a[n] = 1;
}
int num = 1;
bool f = 1;
while (num <= 1000) {
if (a[num]) {
if (!f) printf(",");
f = 0;
printf("%d", num);
if (a[num + 1]) {
while (a[num + 1]) num++;
printf("-%d", num);
}
}
num++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> pages;
int string_to_int(string s) {
int ans = 0;
for (int i = 0; i < s.size(); i++) ans = ans * 10 + s[i] - '0';
return ans;
}
void parse_input(string s) {
int n = s.size();
int i = 0;
string curr = "";
while (i < n) {
if (s[i] == ',') {
pages.insert(string_to_int(curr));
curr = "";
} else
curr += s[i];
i++;
}
pages.insert(string_to_int(curr));
}
int main() {
string inp;
cin >> inp;
parse_input(inp);
set<int>::iterator itr;
itr = pages.begin();
string ans = "";
int lft = *itr, rght = *itr;
itr++;
for (; itr != pages.end(); itr++) {
int cpage = (*itr);
if (cpage == rght + 1)
rght = cpage;
else {
if (lft == rght)
ans = ans + to_string(lft) + ',';
else
ans = ans + to_string(lft) + '-' + to_string(rght) + ',';
lft = rght = cpage;
}
}
if (lft == rght)
ans = ans + to_string(lft);
else
ans = ans + to_string(lft) + '-' + to_string(rght);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, i, j, k, l, n, m, x, y;
set<int> s;
string v;
cin >> v;
n = v.size();
x = 1;
y = 0;
for (i = n - 1; i >= 0; i--) {
if (v[i] != ',') {
a = v[i] - '0';
d = x * a;
y += d;
x = x * 10;
} else {
s.insert(y);
y = 0;
x = 1;
}
}
if (y > 0) s.insert(y);
vector<int> h(s.begin(), s.end());
l = 0;
k = 0;
h.push_back(0);
for (i = 0; i < h.size() - 1; i++) {
a = h[i + 1] - h[i];
if (a == 1 && l == 0) {
x = h[i];
l = 1;
} else if (a != 1) {
if (l > 0) {
if (i != h.size() - 2)
cout << x << "-" << h[i] << ",";
else
cout << x << "-" << h[i];
} else {
if (i != h.size() - 2)
cout << h[i] << ",";
else
cout << h[i];
}
l = 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
bool page[1002];
char input[1002];
while (gets(input)) {
int i, digit = 0;
memset(page, false, sizeof(page));
for (i = 0; input[i]; i++) {
if (input[i] == ',') {
page[digit] = true;
digit = 0;
continue;
}
digit = digit * 10 + (input[i] - '0');
}
page[digit] = true;
bool first = true;
for (i = 0; i < 1001; i++) {
if (page[i]) {
if (!first) {
printf(",");
} else
first = false;
if (page[i + 1] == false) {
printf("%d", i);
} else {
printf("%d-", i);
for (i++; i < 1001; i++) {
if (page[i] == false) break;
}
printf("%d", i - 1);
}
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int exi[1005];
string str;
int num;
char c;
void printP(int a, int b) {
if (a == b)
printf("%d", a);
else
printf("%d-%d", a, b);
}
int main() {
fill(exi, exi + 1005, false);
getline(cin, str);
int num = 0;
for (int i = 0; i < str.length(); i++) {
if (str[i] != ',') {
num *= 10;
num += str[i] - '0';
}
if (str[i] == ',' || i == str.length() - 1) {
exi[num] = 1;
num = 0;
}
}
int fst, lst = -1;
for (int i = 1; i < 1005; i++) {
if (exi[i]) {
if (lst == -1) {
lst = fst = i;
continue;
}
if (i == lst + 1) {
lst++;
} else
printP(fst, lst), printf(","), fst = i, lst = i;
}
}
printP(fst, lst);
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int MAX = 2e5 + 5;
const long long MAX2 = 11;
const int MOD = 998244353;
const long long INF = 2e18;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
const double pi = acos(-1);
const double EPS = 1e-9;
int x, y;
string s;
bool vis[10005], st;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s;
s.push_back(',');
for (auto i : s) {
if (i == ',')
vis[x] = 1, x = 0;
else
x = x * 10 + i - '0';
}
x = 0;
for (int i = 1; i <= 1001; i++) {
if (vis[i]) {
if (!x)
x = i;
else
y = i;
} else {
if (!y) {
if (x) {
if (st) cout << ',';
cout << x;
st = 1;
}
} else {
if (st) cout << ',';
cout << x << "-" << y;
st = 1;
}
x = y = 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vb = vector<bool>;
using vi = vector<int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
string s;
cin >> s;
int cur = 0;
set<int> nums;
for (int i = 0; i < (int)s.size(); ++i) {
if (s[i] == ',') {
nums.emplace(cur);
cur = 0;
} else {
cur = cur * 10 + s[i] - '0';
}
}
if (cur) nums.emplace(cur);
bool first = 1;
for (auto it = nums.begin(); it != nums.end(); ++it) {
auto cur = it;
auto nxt = next(it);
while (*nxt - 1 == *cur) {
cur = nxt;
nxt = next(nxt);
}
if (!first) cout << ',';
cout << *it;
if (cur != it) cout << "-" << *cur;
first = 0;
it = cur;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
vector<long long int> prime;
void sieve(long long int n) {
bool bakh[n + 1];
memset(bakh, true, sizeof(bakh));
for (long long int p = 2; p * p <= n; p++) {
if (bakh[p] == true) {
for (long long int i = p * p; i <= n; i += p) bakh[i] = false;
}
}
for (long long int p = 2; p <= n; p++)
if (bakh[p]) prime.push_back(p);
}
long long int eulertotient(long long int z) {
long long int fac = z;
for (long long int i = 0; prime[i] * prime[i] <= z; i++) {
if (z % prime[i] == 0) {
fac -= (fac / prime[i]);
while (z % prime[i] == 0) z /= prime[i];
}
}
if (z > 1) fac -= (fac / z);
return fac;
}
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long int gcd(long long int a, long long int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
long long int g = gcd(a, b);
long long int ans = (a * b) / g;
return ans;
}
long long int modInverse(long long int a, long long int m) {
long long int hvf = gcd(a, m);
if (hvf == 1) return power(a, m - 2, m);
return -1;
}
void multiply(long long int F[2][2], long long int M[2][2]) {
long long int x = F[0][0] * M[0][0] + F[0][1] * M[1][0];
long long int y = F[0][0] * M[0][1] + F[0][1] * M[1][1];
long long int z = F[1][0] * M[0][0] + F[1][1] * M[1][0];
long long int w = F[1][0] * M[0][1] + F[1][1] * M[1][1];
F[0][0] = x;
F[0][1] = y;
F[1][0] = z;
F[1][1] = w;
}
void powermat(long long int F[2][2], long long int n) {
if (n == 0 || n == 1) return;
long long int M[2][2] = {{1, 1}, {1, 0}};
powermat(F, n / 2);
multiply(F, F);
if (n % 2 != 0) multiply(F, M);
}
long long int fib(long long int n) {
long long int F[2][2] = {{1, 1}, {1, 0}};
if (n == 0) return 0;
powermat(F, n - 1);
return F[0][0];
}
long long int fun(string st) {
long long int p = st.length();
long long int ans = 0, r;
for (long long int i = 0; i < p; i++) {
r = st[i] - '0';
ans = ans * 10 + r;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string st;
cin >> st;
st += ',';
long long int p = st.length();
string res = "";
set<long long int> sts;
long long int numb;
for (long long int i = 0; i < p; i++) {
if (st[i] != ',')
res += st[i];
else {
numb = fun(res);
sts.insert(numb);
res = "";
}
}
vector<long long int> vect(sts.begin(), sts.end());
sort(vect.begin(), vect.end());
long long int curr = vect[0];
long long int f = 0;
long long int start = curr;
for (long long int i = 1; i < vect.size(); i++) {
if (vect[i] != (curr + 1)) {
if (start == vect[i - 1]) {
if (f == 0)
cout << start, f = 1;
else
cout << "," << start;
} else {
if (f == 0)
cout << start << "-" << vect[i - 1], f = 1;
else
cout << "," << start << "-" << vect[i - 1];
}
start = vect[i];
}
curr = vect[i];
}
if (start == (vect[vect.size() - 1])) {
if (f == 0)
cout << start, f = 1;
else
cout << "," << start;
} else {
if (f == 0)
cout << start << "-" << vect[vect.size() - 1], f = 1;
else
cout << "," << start << "-" << vect[vect.size() - 1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
string solve(string& s) {
int n = s.length();
auto split = [&](string& s, const string& delimiters = " .,!? :;") {
vector<string> res;
int n = s.length();
for (int i = 0; i < n; ++i) {
auto j = s.find_first_of(delimiters, i);
if (j == string::npos) {
j = n;
}
if (j > i) {
res.emplace_back(s.substr(i, j - i));
}
i = j;
}
return res;
};
auto S = split(s);
vector<int> A;
for (auto& t : S) {
A.push_back(stoi(t));
}
sort(A.begin(), A.end());
A.resize(unique(A.begin(), A.end()) - A.begin());
string res;
int m = A.size();
for (int i = 0; i < m; ++i) {
int l = A[i];
while (i + 1 < n && A[i + 1] == A[i] + 1) {
++i;
}
int r = A[i];
if (!res.empty()) {
res += ',';
}
if (l == r) {
res += to_string(l);
} else {
res += to_string(l);
res += '-';
res += to_string(r);
}
}
return res;
}
};
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
Solution sol;
string s;
cin >> s;
cout << sol.solve(s) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
string s;
bool frq[1002];
int cate;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> s;
int nr = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] >= '0' && s[i] <= '9')
nr = nr * 10 + s[i] - '0';
else {
frq[nr] = 1;
nr = 0;
}
}
frq[nr] = 1;
int st, sf;
int ac = 0;
for (int i = 1; i <= 1000; ++i) {
if (frq[i]) {
if (ac > 0) cout << ",";
st = sf = i;
while (frq[sf + 1]) ++sf;
if (sf > st)
cout << st << "-" << sf;
else
cout << st;
++ac;
i = sf;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1001;
bool h[MaxN + 5];
int main() {
string S;
cin >> S;
S += ',';
int L = S.length();
int cur = 0;
memset(h, 0, sizeof(h));
for (int i = 0; i < L; i++) {
if (S[i] == ',') {
if (h[cur]) {
cur = 0;
continue;
}
h[cur] = 1;
cur = 0;
} else
cur = cur * 10 + S[i] - '0';
}
L = 0;
int R = 0;
bool first = 0;
for (int i = 1; i <= MaxN + 1; i++) {
if (!h[i]) {
if (L != 0 && R != 0) {
if (first) printf(",");
if (L == R) {
printf("%d", L);
} else
printf("%d-%d", L, R);
first = 1;
L = R = 0;
}
} else {
if (L == 0) L = i;
R = i;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int use[maxn];
int s, t, cs = 0;
char str[maxn];
void output() {
if (s == -1) return;
if (cs)
printf(",");
else
cs = 1;
if (s == t)
printf("%d", s);
else
printf("%d-%d", s, t);
s = -1;
}
int main() {
scanf("%s", str);
int len = strlen(str);
for (int i = 0; i < len; ++i) {
int num = 0;
while (i < len && str[i] != ',') {
num = num * 10 + str[i] - '0';
++i;
}
use[num] = 1;
}
s = -1;
for (int i = 1; i <= 1001; ++i) {
if (!use[i])
output();
else if (s == -1)
s = t = i;
else
t++;
}
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool vis[2001];
char c;
int a[200], n;
int main() {
while (scanf("%d", &a[0]) == 1) {
n = 1;
memset(vis, 0, sizeof(vis));
int t;
vis[a[0]] = 1;
c = getchar();
while (c == ',') {
scanf("%d", &t);
if (!vis[t]) {
a[n++] = t;
vis[t] = 1;
}
c = getchar();
}
sort(a, a + n);
int s = 0;
for (int i = 1; i < n; ++i) {
if (a[i] - a[i - 1] > 1) {
if (a[i - 1] == a[s])
printf("%d,", a[i - 1]);
else
printf("%d-%d,", a[s], a[i - 1]);
s = i;
}
}
if (a[n - 1] == a[s])
printf("%d\n", a[n - 1]);
else
printf("%d-%d\n", a[s], a[n - 1]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
string s, str;
getline(cin, s);
str = "";
int i, j;
std::vector<int> v;
for (i = 0; i < s.size(); i++) {
if (s[i] == ',') {
v.push_back(stoi(str));
str = "";
} else
str += s[i];
}
v.push_back(stoi(str));
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
int pre = v[0], c = 0, f = 0;
for (i = 1; i < v.size(); i++) {
if (v[i] == (v[i - 1] + 1))
c++;
else if (c >= 1) {
if (f) cout << ",";
f = 1;
cout << pre << "-" << v[i - 1];
c = 0;
pre = v[i];
} else {
if (f) cout << ",";
f = 1;
cout << v[i - 1];
pre = v[i];
}
}
if (c >= 1) {
if (f) cout << ",";
cout << pre << "-" << v[i - 1];
c = 0;
pre = v[i];
} else {
if (f) cout << ",";
cout << v[i - 1];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long i, j;
vector<long long> v, v1, v2;
string s, s2, s3;
set<long long> st;
cin >> s;
long long n, m, x, z, cnt, ans, mx, t;
for (i = 0; i < s.size(); i++) {
if (s[i] == ',') {
x = stoi(s2);
st.insert(x);
s2.clear();
} else
s2 += s[i];
}
if (!s2.empty()) {
x = stoi(s2);
st.insert(x);
s2.clear();
}
for (auto i : st) v.push_back(i);
z = 0;
for (long long i = 0; i < v.size(); i++) {
if (v[i] + 1 == v[i + 1] and z == 0) {
x = v[i];
z = 1;
}
if (v[i] + 1 != v[i + 1] and z == 0) {
cout << v[i];
if (i != v.size() - 1) cout << ",";
}
if (v[i] + 1 != v[i + 1] and z == 1) {
cout << x;
cout << "-";
cout << v[i];
if (i != v.size() - 1) cout << ",";
z = 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int x;
set<int> s;
map<int, int> mp;
char ch;
vector<int> v;
vector<int> M[1000];
while (scanf("%d%c", &x, &ch)) {
v.push_back(x);
if (ch == '\n') break;
}
sort(v.begin(), v.end());
M[0].push_back(v[0]);
int p = 0;
for (int i = 1; i < v.size(); i++) {
if (v[i] - v[i - 1] == 1) {
M[p].push_back(v[i]);
} else if (v[i] > v[i - 1]) {
p++;
M[p].push_back(v[i]);
}
}
for (int i = 0; i <= p; i++) {
if (M[i].size() > 1) {
cout << M[i][0] << "-" << M[i][M[i].size() - 1];
} else if (M[i].size() == 1) {
cout << M[i][0];
}
if (i < p) cout << ",";
}
cout << endl;
}
int main() {
int t;
solve();
}
|
#include <bits/stdc++.h>
int compare(const void *a, const void *b) {
int ia = *(int *)a;
int ib = *(int *)b;
return ia - ib;
}
int main() {
static char s[499 + 1];
static int aa[100], ll[100], rr[100];
int n, i, j, k, x;
scanf("%s", s);
n = strlen(s);
k = 0;
for (i = 0; i < n;) {
j = i;
while (j < n && s[j] != ',') {
aa[k] = aa[k] * 10 + (s[j] - '0');
j++;
}
i = j + 1;
k++;
}
qsort(aa, k, sizeof *aa, compare);
x = 0;
for (i = 0; i < k;) {
j = i + 1;
while (j < k && aa[j] <= aa[j - 1] + 1) j++;
ll[x] = aa[i];
rr[x] = aa[j - 1];
x++;
i = j;
}
if (ll[0] < rr[0])
printf("%d-%d", ll[0], rr[0]);
else
printf("%d", ll[0]);
for (i = 1; i < x; i++) {
printf(",");
if (ll[i] < rr[i])
printf("%d-%d", ll[i], rr[i]);
else
printf("%d", ll[i]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
s += ',';
set<int> a;
int buf = 0;
for (int i = 0; i < s.size(); i++)
if (s[i] == ',')
a.insert(buf), buf = 0;
else
buf = buf * 10 + (s[i] - '0');
for (int i = 1; i <= 1000; i++)
if (a.count(i) != 0) {
int l = i;
int r = i;
while (a.count(r) != 0) a.erase(r), r++;
r--;
if (l == r)
printf("%d", l);
else
printf("%d-%d", l, r);
if (!a.empty()) printf(",");
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void Weapons19() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
Weapons19();
string s;
cin >> s;
vector<long long> vis(1005, 0);
long long n = s.size();
vector<long long> v;
for (long long i = 0; i < n; i++) {
if (s[i] == ',') v.push_back(i);
}
v.push_back(n);
long long t = 0;
for (long long i = 0; i < v.size(); i++) {
long long k = stoi(s.substr(t, v[i] - t));
vis[k] = 1;
t = v[i] + 1;
}
long long os = 0, fn = 0;
for (long long i = 1; i < 1005; i++) {
if (vis[i] == 1 && os == 0) {
os = 1;
if (fn == 0) {
cout << i;
fn = 1;
} else
cout << "," << i;
} else if (vis[i] == 1 && os > 0) {
os++;
continue;
} else if (vis[i] == 0 && os == 0)
continue;
else if (vis[i] == 0 && os > 0) {
if (os != 1) {
cout << "-" << i - 1;
}
os = 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int vis[10000000];
string tostring(int x) {
stringstream ss;
ss << x;
string s;
ss >> s;
return s;
}
int main() {
string x;
cin >> x;
int val = 0;
for (int i = 0; i <= x.size(); i++) {
if (isdigit(x[i])) {
val += (x[i] - '0');
val *= 10;
} else {
val /= 10;
vis[val] = 1;
val = 0;
}
}
int l = -1, r = -1;
string result = "";
for (int i = 0; i < 1000000; i++) {
if (vis[i] == 1) {
if (vis[i - 1] == 0) {
l = i;
r = i;
} else {
r = r + 1;
}
} else {
if (r != -1) {
if (l == r) {
result += tostring(l) + ',';
r = -1;
} else {
result += tostring(l) + '-' + tostring(r) + ',';
r = -1;
}
}
}
}
result[result.size() - 1] = ' ';
cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int h[1110];
int nh[1100];
int str2int(char str[]) {
int res = 0;
for (int i = 0; str[i] != '\0'; i++) {
res = res * 10 + str[i] - '0';
}
return res;
}
char data[10000];
struct node {
int s, e;
} hh[1110];
int main() {
int n, m, i, j, k, r_n = 0;
char st[10];
gets(data);
i = 0;
m = n = 0;
while (1) {
for (k = 0; data[i] != '\0'; i++, k++) {
if (data[i] == ',') break;
st[k] = data[i];
}
if (data[i] == '\0') break;
st[k] = '\0';
h[n++] = str2int(st);
i++;
}
st[k] = '\0';
h[n++] = str2int(st);
sort(h, h + n);
nh[0] = h[0];
for (i = 1; i < n; i++) {
if (nh[m] != h[i]) nh[++m] = h[i];
}
hh[0].s = nh[0];
hh[0].e = nh[0];
for (i = 1; i <= m; i++) {
if (nh[i] - hh[r_n].e != 1) {
hh[r_n + 1].s = nh[i];
hh[r_n + 1].e = nh[i];
r_n++;
} else {
hh[r_n].e = nh[i];
}
}
if (hh[0].s == hh[0].e)
printf("%d", hh[0].s);
else
printf("%d-%d", hh[0].s, hh[0].e);
for (i = 1; i <= r_n; i++) {
if (hh[i].s == hh[i].e)
printf(",%d", hh[i].s);
else
printf(",%d-%d", hh[i].s, hh[i].e);
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char arr[1000000], *pch;
vector<int> v;
vector<int> v1;
map<int, int> m;
int i, a, s, e, kflag, flag;
while (gets(arr)) {
v.clear();
v1.clear();
m.clear();
kflag = 0;
pch = strtok(arr, ",");
while (pch != NULL) {
a = atoi(pch);
v.push_back(a);
pch = strtok(NULL, ",");
}
sort(v.begin(), v.end());
flag = 0;
for (i = 0; i < v.size(); i++) {
if (m.find(v[i]) == m.end()) {
v1.push_back(v[i]);
m[v[i]] = 1;
}
}
for (i = 0; i < v1.size(); i++) {
if (i + 1 < v1.size() && v1[i + 1] == v1[i] + 1 && flag == 0) {
flag = 1;
s = v1[i];
e = v1[i + 1];
continue;
} else if (i + 1 < v1.size() && v1[i + 1] == v1[i] + 1 && flag == 1) {
e = v1[i + 1];
continue;
} else if (flag == 1) {
flag = 0;
if (kflag++) cout << ",";
cout << s << "-" << e;
} else {
if (kflag++) cout << ",";
cout << v1[i];
}
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
void solve() {
string s;
cin >> s;
map<long long int, long long int> m;
long long int c = 0;
for (long long int(i) = 0; (i) < (s.size()); (i)++) {
if (s[i] == ',') {
if (c != 0) {
m[c]++;
}
c = 0;
} else {
c = c * 10 + (long long int)(s[i] - '0');
}
}
if (c != 0) m[c]++;
c = 0;
long long int p = 0, r = 0;
string s1 = "";
for (long long int(i) = 0; (i) < (1010); (i)++) {
if (m[i] != 0) {
if (c == 0) p = i;
c++;
} else {
if (c > 1) {
if (r == 0) {
cout << p << "-" << i - 1;
r++;
} else {
cout << "," << p << "-" << i - 1;
}
} else if (c != 0) {
if (r == 0) {
cout << p;
r++;
} else {
cout << "," << p;
}
}
c = 0;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
for (long long int _ = 0; _ < t; _++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
int n, a[100000];
int main() {
int n = 0;
while (scanf("%d,", &a[n]) == 1) n++;
std::sort(a, a + n);
int i = 0, l, r;
while (i < n) {
l = a[i];
i++;
while (i < n && (a[i] == a[i - 1] || a[i] == a[i - 1] + 1)) i++;
if (a[i - 1] != l)
printf("%d-%d", l, a[i - 1]);
else
printf("%d", l);
if (i < n) printf(",");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, i, t = 0, g = 0, e = 1;
int ar[100000] = {0};
char c;
while (1) {
scanf("%d%c", &a, &c);
ar[a] = 1;
if (c != ',') break;
}
for (i = 0; i <= 100000; i++) {
if (ar[i] != 0) {
t += 1;
} else if (t >= 2) {
if (e == 0)
cout << "," << i - t << "-" << i - 1;
else {
cout << i - t << "-" << i - 1;
e = 0;
}
t = 0;
} else if (t == 1) {
if (e == 0)
cout << "," << i - 1;
else {
cout << i - 1;
e = 0;
}
t = 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num;
char p;
vector<int> v;
vector<int> n[105];
int x = 0;
cin >> num;
v.push_back(num);
while (scanf("%c,", &p) == 1) {
if (cin >> num)
v.push_back(num);
else
break;
}
sort(v.begin(), v.end());
n[x].push_back(v[0]);
for (int i = 1; i < v.size(); i++) {
if (v[i - 1] == v[i] - 1) {
n[x].push_back(v[i]);
} else if (v[i - 1] < v[i]) {
x++;
n[x].push_back(v[i]);
}
}
for (int i = 0; i <= x; i++) {
if (n[i].size() > 1) {
int t = n[i].size();
cout << n[i][0] << "-" << n[i][t - 1];
}
if (n[i].size() == 1) {
cout << n[i][0];
}
if (i != x) cout << ",";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OO = (int)1e8;
int main() {
int x;
vector<int> v;
while (scanf("%d,", &x) != -1) {
v.push_back(x);
}
sort(v.begin(), v.end());
v.push_back(10000);
vector<pair<int, int> > res;
pair<int, int> p;
bool f = 1;
int prv = -1;
for (int i = 0; i < (int)v.size(); ++i) {
if (f) {
p.first = v[i];
f = 0;
prv = v[i];
continue;
}
if (v[i] == v[i - 1]) continue;
if (v[i] - 1 == prv) {
prv = v[i];
continue;
}
p.second = prv;
res.push_back(p);
i--;
f = 1;
}
for (int i = 0; i < (int)res.size(); ++i) {
if (i) cout << ",";
cout << res[i].first;
if (res[i].second != res[i].first) cout << "-" << res[i].second;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string toStr(int n) {
stringstream ss;
ss << n;
string tmp = ss.str();
return tmp;
}
int main() {
set<int> s;
string str;
cin >> str;
int i = 0;
string cur = "";
while (i < str.size()) {
if (str[i] == ',') {
int tmp = atoi(cur.c_str());
s.insert(tmp);
cur = "";
i++;
continue;
}
cur += str[i];
i++;
}
s.insert(atoi(cur.c_str()));
vector<int> data;
set<int>::iterator it;
for (it = s.begin(); it != s.end(); it++) data.push_back((*it));
i = 0;
vector<string> ans;
while (i < data.size()) {
int j = i + 1;
int tmp = -1;
while (data[j] - data[j - 1] == 1) tmp = data[j++];
string page;
if (tmp == -1)
page = toStr(data[i]);
else {
page = toStr(data[i]);
page += '-';
page += toStr(tmp);
}
ans.push_back(page);
i = j;
}
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << ",\n"[i == ans.size() - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int oo = 0x3f3f3f3f;
const long long ooLL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
set<int> p;
for (int x; scanf("%d%*c", &x) == 1; p.insert(x))
;
int pp = -10;
int pf = -10;
p.insert(10000);
bool f = true;
for (set<int>::const_iterator it = p.begin(); it != p.end(); ++it) {
if (pp < 0) {
pp = pf = *it;
} else if (*it == pp + 1) {
++pp;
} else {
if (!f) printf(",");
f = false;
if (pp == pf)
printf("%d", pp);
else
printf("%d-%d", pf, pp);
pp = pf = *it;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, a[105] = {0}, g = 0, b[105] = {0}, j = 1;
int ch;
while (1) {
ch = getchar();
if (ch == ',')
c++;
else if (ch >= '0' && ch <= '9')
b[c] = b[c] * 10 + ch - 48;
else
break;
}
sort(b, b + c + 1);
a[0] = b[0];
for (int i = 1; i <= c; i++) {
if (b[i] != b[i - 1]) {
a[j] = b[i];
j++;
}
}
for (int i = 0; i < j; i++) {
if (a[i] + 1 != a[i + 1]) cout << a[i];
while (a[i] + 1 == a[i + 1]) {
i++;
g++;
}
if (g > 0) {
cout << a[i - g] << '-' << a[i];
g = 0;
}
if (i != j - 1) cout << ',';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> v1;
unordered_map<int, int> m1;
int rr = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == ',') {
if (m1[rr] == 0 && rr > 0) {
v1.push_back(rr);
m1[rr] += 10;
}
rr = 0;
} else {
rr = rr * 10 + (s[i] - 48);
}
}
if (rr > 0 && m1[rr] == 0) v1.push_back(rr);
sort(v1.begin(), v1.end());
int ctr = 1;
vector<int> v2;
int prev = v1[0];
int n = v1.size();
for (int i = 1; i < n; i++) {
if ((v1[i] - 1) == prev) {
ctr++;
} else {
if (ctr >= 3) {
v2.push_back(v1[i - 1] - ctr + 1);
v2.push_back(0);
v2.push_back(v1[i - 1]);
} else {
if (ctr == 1) {
v2.push_back(v1[i - 1]);
} else if (ctr == 2) {
v2.push_back(v1[i - 2]);
v2.push_back(0);
v2.push_back(v1[i - 1]);
}
}
ctr = 1;
}
prev = v1[i];
}
int i = n;
if (ctr >= 3) {
v2.push_back(v1[i - 1] - ctr + 1);
v2.push_back(0);
v2.push_back(v1[i - 1]);
} else {
if (ctr == 1) {
v2.push_back(v1[i - 1]);
} else if (ctr == 2) {
v2.push_back(v1[i - 2]);
v2.push_back(0);
v2.push_back(v1[i - 1]);
}
}
for (int i = 0; i < v2.size(); i++) {
if (v2[i] == 0)
cout << "-";
else
cout << v2[i];
if (v2[i] != 0 && i != v2.size() - 1) {
if (v2[i + 1] != 0) cout << ",";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int Convert(int f, int e, string s) {
stringstream ss;
string w = "";
int Ans;
for (int i = f; i < e; i++) w += s[i];
ss << w;
ss >> Ans;
return Ans;
}
string Convert(int a) {
stringstream ss;
string Ans;
ss << a;
ss >> Ans;
return Ans;
}
string Convert(int a, int b) {
string Ans = "";
Ans += Convert(a);
Ans += '-';
Ans += Convert(b);
return Ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
string s;
cin >> s;
int f = 0, j, e;
set<int> t;
vector<int> a;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == ',')
t.insert(Convert(f, i, s)), f = i + 1;
else if (i == (int)s.size() - 1)
t.insert(Convert(f, i + 1, s)), f = i + 1;
}
if ((int)t.size() == 1) {
cout << *t.begin();
return 0;
}
set<int>::iterator it;
for (it = t.begin(); it != t.end(); it++) a.push_back(*it);
vector<string> Ans;
for (int i = 0; i < (int)a.size() - 1; i++) {
if (a[i + 1] - a[i] == 1) {
f = a[i], j = i;
while (j < (int)a.size() - 1 and a[j + 1] - a[j] == 1) e = a[j + 1], j++;
Ans.push_back(Convert(f, e));
i = j;
} else if (a[i] - a[i + 1] == 1) {
f = a[i], j = i;
while (j < (int)a.size() - 1 and a[j] - a[j + 1] == 1) e = a[j + 1], j++;
Ans.push_back(Convert(e, f));
i = j;
} else
Ans.push_back(Convert(a[i]));
if (i == (int)a.size() - 2) Ans.push_back(Convert(a[++i]));
}
cout << Ans[0];
for (int i = 1; i < (int)Ans.size(); i++) cout << ',' << Ans[i];
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> nums;
void parse(string s) {
stringstream ss(s);
int num;
char co;
while (ss >> num) {
nums.push_back(num), ss >> co;
}
}
int main() {
int i, a = 0;
string s;
cin >> s;
parse(s);
sort(nums.begin(), nums.end());
bool exit = false;
for (i = 0; i < nums.size(); i++) {
if (i == nums.size() - 1) {
if (exit)
cout << nums[a] << "-" << nums[nums.size() - 1] << endl;
else {
cout << nums[a] << endl;
}
}
if (i + 1 >= nums.size()) break;
if ((nums[i + 1] - '0') - (nums[i] - '0') <= 1) {
if (nums[i + 1] != nums[i]) exit = true;
} else {
if (exit) {
cout << nums[a] << "-" << nums[i] << ",";
} else {
cout << nums[a] << ",";
}
a = i + 1;
exit = false;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1001];
int main() {
int k;
while (cin >> k) {
char c;
cin >> c;
a[k] = 1;
}
bool flag = 0;
for (int i = 0; i < 1001;) {
if (a[i] == 1) {
if (flag) cout << ",";
cout << i;
flag = 1;
i++;
if (a[i]) {
while (a[i]) i++;
cout << "-" << i - 1;
}
} else
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
int a[maxn];
int b[maxn];
int n = 0;
int n2 = 0;
int main() {
int temp;
char alaki;
while (cin) {
cin >> temp;
a[n++] = temp;
cin >> alaki;
}
sort(a, a + n);
n2 = n;
n = 1;
b[0] = a[0];
for (int i = 1; i < n2; i++)
if (a[i] != a[i - 1]) b[n++] = a[i];
bool coma = false;
int c = 1;
int last = b[0];
for (int i = 1; i < n; i++)
if (b[i - 1] + 1 != b[i]) {
if (c > 1)
cout << ((coma) ? "," : "") << last << "-" << last + c - 1;
else
cout << ((coma) ? "," : "") << last;
c = 1;
last = b[i];
coma = true;
} else
c++;
if (c > 1)
cout << ((coma) ? "," : "") << last << "-" << last + c - 1;
else
cout << ((coma) ? "," : "") << last;
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NN = 1005;
int a[NN] = {0};
string s;
void T() {
srand(time(NULL));
ofstream fo("pagenumber.i4");
fo.close();
}
int main() {
ios_base::sync_with_stdio(0);
getline(cin, s);
int n = s.size(), pos, i, j, k, maxk = 0;
string x;
stringstream ss;
i = j = 0;
while (j != string::npos) {
j = s.find_first_of(',', i);
if (j == string::npos)
x = s.substr(i);
else
x = s.substr(i, j - i);
k = atoi(x.c_str());
maxk = max(maxk, k);
if (!a[k]) a[k] = 1;
i = j + 1;
}
for (int i = 0; i <= maxk; i++)
if (a[i]) {
int left = i;
while (a[i]) i++;
i--;
int right = i;
cout << left;
if (right - left > 0) cout << '-' << right;
if (i < maxk) cout << ",";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<int> skup;
set<int>::iterator it, it_prev, it_first;
char ulaz[550];
int main(void) {
int a, first = 1;
scanf("%s", ulaz);
char *p = strtok(ulaz, ",");
while (p) {
sscanf(p, "%d", &a);
skup.insert(a);
p = strtok(NULL, ",");
}
it_first = it_prev = skup.begin();
for (it = skup.begin(); it != skup.end(); it++)
if (it != skup.begin()) {
if (*it != (*it_prev) + 1) {
if (!first)
printf(",");
else
first = 0;
if (*it_first != *it_prev)
printf("%d-%d", *it_first, *it_prev);
else
printf("%d", *it_first);
it_first = it;
}
it_prev = it;
}
if (!first)
printf(",");
else
first = 0;
if (*it_first != *it_prev)
printf("%d-%d", *it_first, *it_prev);
else
printf("%d", *it_first);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int p;
while (cin >> p) {
v.push_back(p);
char tmp;
cin >> tmp;
}
sort(v.begin(), v.end());
int index = 0;
bool flag = false;
while (index < v.size()) {
int index_backup = index;
while (index + 1 < v.size() &&
(v[index] + 1 == v[index + 1] || v[index] == v[index + 1]))
++index;
if (flag)
cout << ',';
else
flag = true;
if (v[index] == v[index_backup])
cout << v[index];
else
cout << v[index_backup] << '-' << v[index];
++index;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:100000000")
int ri() {
int x;
scanf("%d", &x);
return x;
}
bool vis[1111];
int main() {
string s;
cin >> s;
s += ",";
string tmp = "";
for (int i = 0; i < (int)(s).size(); i++) {
if (s[i] == ',') {
int val = 0;
for (int j = 0; j < (int)(tmp).size(); j++)
val *= 10, val += (tmp[j] - '0');
vis[val] = true;
tmp = "";
} else
tmp += s[i];
}
bool pr = false;
for (int i = 0; i < 1111; i++) {
if (vis[i]) {
int l = i;
i++;
while (vis[i]) i++;
int r = i - 1;
if (pr) {
printf(",");
}
pr = true;
if (l == r)
printf("%d", l);
else
printf("%d-%d", l, r);
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.