Sponsors

Tag: Div. 2

Codeforces Round #412 (rated,...

import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.io.PrintWriter; import java.util.StringTokenizer; public class...

Codeforces Round #412 (rated,...

#include<bits/stdc++.h> using namespace std; int n; long long a; int check(int x){ int i,j,res,ress,t,sum; long...

Codeforces Round #412 (rated,...

#include<bits/stdc++.h> using namespace std; int a; int cnt; int n; int getsc(int id, bool...

Codeforces Round #412 (rated,...

#include <bits/stdc++.h> using namespace std; int p,x,y,i; int luc(int s){ s = (s/50)%475; for...

Codeforces Round #412 (rated,...

#include <iostream> using namespace std; int n,i,a,a1,b,f; string s={"maybe","unrated","rated"}; int main(){ cin>>n; for(;i<n;i++){ cin>>a>>b; if(a!=b){f=2;break;} if(i>0&&a>a1)f=1; a1=a; } cout<<s; }

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

Advertisement

spot_img