Tag: Codeforces Round #409 (rated
Codeforces Round #409 (rated,...
#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) for (int x=int(a);x>=(int)(b);x--)
#define...
Codeforces Round #409 (rated,...
#include <bits/stdc++.h>
#define MAXN (1000000)
#define MAXM (6)
#define mod (1000000007)
#define ll...
Codeforces Round #409 (rated,...
import java.util.ArrayList;
import java.util.Scanner;
/*
4 10
2 4 6 8
4 10
2 9...
Codeforces Round #409 (rated,...
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
#define maxn 1005
int x,y;
int n;
long long area(int...
Codeforces Round #409 (rated,...
#include <bits/stdc++.h>
using namespace std;
struct Time {
int i;
double v;
};
const int...
Codeforces Round #409 (rated,...
#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++)
{
...
Codeforces Round #409 (rated,...
#include <stdio.h>
int ans,l,i;
int main()
{
char ch;
scanf("%s",ch);
for( ; ch; i++)
{
l++;
if(ch=='V' &&...