1
n = int(input())
2
s = input()
3
if s.count('o') == n:
4
    print()
5
else:
6
    idx = 0
7
    for i in range(n):
8
        if s[i] != 'o':
9
            idx = i
10
            break
11
    print(s[idx:])

1
t,x = map(int,input().split())
2
a = list(map(int,input().split()))
3
ans = []
4
for i in range(t+1):
5
    if i == 0:
6
        ans.append((i,a[i]))
7
    elif abs(a[i] - ans[-1][1]) >= x:
8
        ans.append((i,a[i]))
9
for i in range(len(ans)):
10
    print(f"{ans[i][0]} {ans[i][1]}")

1
import sys
2
input = sys.stdin.readline
3
n = int(input())
4
a = list(map(int,input().split()))
5
ans = 0
6
def dfs(step,sum,cur):
7
    global ans
8
    if sum + n - step <= ans:
9
        return
10
    if step == n:
11
        ans = max(ans,sum)
12
        return
13
    dfs(step + 1,sum + (cur > 0 and cur - a[step] < 0),cur - a[step])
14
    dfs(step + 1,sum + (cur < 0 and cur + a[step] > 0),cur + a[step])
15
dfs(0,0,0.5)
16
print(ans)

1
#include<bits/stdc++.h>
2
using namespace std;
3
#define int long long
4
#define ld long double
5
#define debug(x) cerr << #x << ": " << x << '\n';
6
const int INF = 0x3f3f3f3f3f3f3f3f;
7
int dx[] = {0,1,0,-1};
8
int dy[] = {-1,0,1,0};
9
char dc[] = {'L','D','R','U'};
10
struct node{
11
    int r,c,d;
12
};
13
//udlr
14
bool vis[1005][1005][4];
15
node pre[1005][1005][4];
16
void solve(){
17
    int h,w;cin>>h>>w;
18
    pair<int,int> b,e;
19
    vector<vector<char>> pos(h+1,vector<char>(w+1));
20
    for(int i = 1;i <= h; ++i){
21
        string s;cin>>s;
22
        for(int j = 1;j <= w; ++j){
23
            pos[i][j] = s[j-1];
24
            if(pos[i][j] == 'S') b.first = i,b.second = j;
25
            if(pos[i][j] == 'G') e.first = i,e.second = j;
26
        }
27
    }
28
    queue<node> q;
29
    q.push({b.first,b.second,-1});
30
    int end = -1;
31
    while(q.size()){
32
        auto [x,y,d] = q.front();q.pop();
33
        if(x == e.first && y == e.second){
34
            end = d;
35
            break;
36
        }
37
        for(int i = 0;i < 4; ++i){
38
            int nx = x + dx[i],ny = y + dy[i];
39
            if(nx < 1 || ny < 1 || nx > h || ny > w || vis[nx][ny][i] || pos[nx][ny] == '#') continue;
40
            if(d != -1){
41
                if(pos[x][y] == 'x' && i == d) continue;
42
                if(pos[x][y] == 'o' && i != d) continue;
43
            }
44
            pre[nx][ny][i] = {x,y,d};
45
            vis[nx][ny][i] = 1;
46
            q.push({nx,ny,i});
47
        }
48
    }
49
    if(end == -1){
50
        cout<<"No";
51
    }
52
    else{
53
        cout<<"Yes\n";
54
        string ans;
55
        node cur = {e.first,e.second,end};
56
        while(cur.d != -1){
57
            ans += dc[cur.d];
58
            cur = pre[cur.r][cur.c][cur.d];
59
        }
60
        reverse(ans.begin(),ans.end());
61
        for(auto i : ans) cout<<i;
62
    }
63
}
64
signed main(){
65
    std::ios_base::sync_with_stdio(false);
66
    std::cin.tie(nullptr);
67
    int t = 1;
68
    // cin>>t;
69
    while(t--){
70
        solve();
71
    }return 0;
72
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
#define int long long
4
const int INF = 0x3f3f3f3f3f3f3f3f;
5
const int mod = 998244353;
6
const int mx = 1e6+1000;
7
int fac[mx+1],invfac[mx+1];
8
int fastpow(int x,int p){
9
    int ans = 1;
10
    while(p){
11
        if(p & 1) ans = ans * x % mod;
12
        x = x * x % mod;
13
        p >>= 1;
14
    }
15
    return ans % mod;
16
}
17
int inv(int x){
18
    return fastpow(x,mod - 2);
19
}
20
int c(int a,int b){
21
    if (b < 0 || b > a) return 0;
22
    return fac[a] * invfac[b] % mod * invfac[a-b] % mod;
23
}
24
void init(){
25
    fac[0] = 1;
26
    for(int i = 1;i <= mx; i++) fac[i] = fac[i-1] * i % mod;
27
    invfac[mx] = fastpow(fac[mx], mod - 2);
28
    for (int i = mx - 1; i >= 0; i--) invfac[i] = invfac[i + 1] * (i + 1) % mod;
29
}
30
//n-r,n-l
31
void solve(){
32
    int n;cin>>n;
33
    vector<int> diffa(n+5),diffb(n+5),diffboth(n+5);
34
    for(int i = 1;i <= n; ++i){
35
        int l,r;cin>>l>>r;
36
        diffa[l]++;
37
        diffa[r+1]--;
38
        diffb[n-r]++;
39
        diffb[n-l+1]--;
40
        int mn = min(n - l ,r);
41
        int mx = max(l,n-r);
42
        if(mn < mx) continue;
43
        diffboth[mn+1]--;
44
        diffboth[mx]++;
45
    }
46
    int cura = 0,curb = 0,curboth = 0,ans = 0;
47
    for(int i = 1;i <= n - 1; ++i){
48
        cura += diffa[i];
49
        curb += diffb[i];
50
        curboth += diffboth[i];
51
        if(cura + curb - curboth == n){
52
            int ma = n - curb;
53
            int ned = i - ma;
54
            ans = (ans + c(curboth,ned)) % mod;
55
        }
56
    }
57
    cout<<ans<<"\n";
58
}
59
signed main(){
60
    std::ios_base::sync_with_stdio(false);
61
    std::cin.tie(nullptr);
62
    int t = 1;
63
    init();
64
    // cin>>t;
65
    while(t--){
66
        solve();
67
    }return 0;
68
}