#include<cstdio> #include<cstring> #include<algorithm> #include<cctype> #include<ctime> #include<cstdlib> #include<string> #include<queue> #include<cmath> #include<set> #include<map> #include<bitset> #include<vector> #define rep(x,a,b) for (int x=int(a);x<=(int)(b);x++) #define drp(x,a,b)..

#include <bits/stdc++.h> #define MAXN (1000000) #define MAXM (6) #define mod (1000000007) #define ll long long int n; int a[MAXN], b[MAXN],..

import java.util.ArrayList; import java.util.Scanner; /* 4 10 2 4 6 8 4 10 2 9 1 0 */ public class..

#include<cstdio> #include<cstdlib> #include<cmath> #include<algorithm> #include<cstring> using namespace std; #define maxn 1005 int x[maxn],y[maxn]; int n; long long area(int i) {..

#include <bits/stdc++.h> using namespace std; struct Time { int i; double v; }; const int MAXN = 1e5; int a[MAXN],..

#include<bits/stdc++.h> using namespace std; int main() { string a,b; cin>>a>>b; int l=a.length(); for(int i=0;i<l;i++) { if(a[i]<b[i]) { cout<<"-1"; return 0;..

#include <stdio.h> int ans,l,i; int main() { char ch[110]; scanf(“%s”,ch); for( ; ch[i+1]; i++) { l++; if(ch[i]==’V’ && ch[i+1]==’K’) ans++,ch[i]=’#’,ch[i+1]=’#’,i++;..