Accepted
Code
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void solve(int cs) {
string t = "leadinguniversity";
string s;
cin >> s;
sort(t.begin(), t.end());sort(s.begin(), s.end());
cout << (t == s ? "Leading University\n" : "Impossible\n");
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc = 1;
// cin >> tc;
for (int cs = 1; cs <= tc; cs++) {
solve(cs);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1024 Rearrange Character
- Language
- C++20 (G++ 13.2.0)
- Submit At
- 2024-07-11 09:48:45
- Judged At
- 2024-11-11 03:27:41
- Judged By
- Score
- 100
- Total Time
- 1ms
- Peak Memory
- 536.0 KiB