Sponsors

Tag: C

Codeforces Round #411 (Div....

#include<iostream> main(){int n;std::cin>>n;std::cout<<(n-1)/2;}

Codeforces Round #411 (Div....

#include <cstdio> int n; int main (){ scanf("%d", &n); for (int i =...

Codeforces Round #411 (Div....

#include <iostream> int l,r; int main() { std::cin>>l>>r; std::cout<<(l==r ? l:2); return 0; }

Codeforces Round #410 (Div....

#pragma warning(disable:4996) #include <stdio.h> #include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <string.h> #include <stdlib.h> #include...

Codeforces Round #410 (Div....

#include<bits/stdc++.h> using namespace std; const int maxn=100000+10; int b,n,flag=1,dp; struct node { int id,x; }a; int cmp(node...

Codeforces Round #410 (Div....

#include <bits/stdc++.h> using namespace std; string s; int main() { int n, t, ans; ans...

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,...

#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' &&...

Advertisement

spot_img