Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma GCC optimize("O3")
- #include <bits/stdc++.h>
- using namespace std;
- #define int long long
- #define double long double
- #define _FastIO ios_base::sync_with_stdio(0); cin.tie(0)
- #define F first
- #define S second
- signed main()
- {
- _FastIO;
- /*
- // A
- int a , b , c;
- cin >> a >> b >> c;
- if(a <= c && c <= b) // a <= c <= b
- cout << "Yes";
- else
- cout << "No";
- */
- /*
- // B
- char a , b;
- cin >> a >> b;
- if(a == b)
- cout << 'H';
- else
- cout << 'D';
- */
- /*
- // C
- int a , b;
- char c;
- cin >> a >> c >> b;
- if(c == '+')
- cout << a + b << '\n';
- else
- cout << a - b << '\n';
- */
- /*
- // D
- string s;
- cin >> s;
- int n = s.size();
- for(int i = 0; i < n; i++)
- cout << 'x';
- */
- /*
- // E
- string s;
- cin >> s;
- for(char i : s){
- if(i == ',')
- cout << ' ';
- else
- cout << i;
- }
- */
- /*
- // F
- string a , b , c;
- cin >> a >> b >> c;
- a[0] = toupper(a[0]);
- b[0] = toupper(b[0]);
- c[0] = toupper(c[0]);
- cout << a[0] << b[0] << c[0];
- */
- /*
- // G
- int n , x , p , cnt = 0;
- cin >> n >> p;
- while(n--){ // n times
- cin >> x;
- cnt += x < p;
- // if(x < p) cnt++;
- }
- cout << cnt << '\n';
- */
- /*
- // H
- int n , x;
- cin >> n;
- int ans = 0;
- while(n--){
- cin >> x;
- //ans += max(0LL, x - 10);
- if(x > 10)
- ans += x - 10;
- }
- cout << ans << '\n';
- */
- /*
- // I
- string s;
- cin >> s;
- for(char& i : s){
- if(i == '6')
- i = '9';
- else if(i == '9')
- i = '6';
- }
- reverse(s.begin() , s.end());
- cout << s;
- */
- /*
- // J
- int t , n , x;
- cin >> t;
- while(t--){
- cin >> n;
- int ans = 0;
- while(n--){
- cin >> x;
- ans += x % 2;
- }
- cout << ans << '\n';
- }
- */
- /*
- // K
- int n;
- cin >> n;
- int a[n + 5];
- for(int i = 0; i < n; i++){
- cin >> a[i];
- }
- sort(a , a + n);
- for(int i = 0; i < n; i++){
- if(a[i] != (i + 1)){
- cout << "No";
- return 0;
- }
- }
- cout << "Yes";
- */
- /*
- // L
- int n , x;
- cin >> n;
- set<int> s;
- while(n--){
- cin >> x;
- s.insert(x);
- }
- cout << s.size();
- */
- /*
- // M
- int n , x;
- cin >> n;
- set<int> s;
- while(n--){
- cin >> x;
- s.insert(x);
- }
- auto it = s.end();
- it--;
- it--;
- cout << it << '\n';
- // 1 2 3 4 .end
- */
- /*
- // N
- int n , k , x;
- cin >> n >> k;
- while(n--){
- cin >> x;
- if(x != k)
- cout << x << " ";
- }
- */
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement