#include <iostream> #include <algorithm> #include <vector> using namespace std; int check(int a, int b){ ); ) ; ; } int main(){ int n; cin >> n; vector<int> x(n); ; i < n; ++ i) cin >> x[i]; int i; ; i < n ; ++ i)…
#include <iostream> #include <algorithm> #include <string> using namespace std; int main(){ int n; cin >> n; string words = "<3",tmp; ; i < n ; ++ i){ cin >> tmp; words +=tmp+"<3"; } string messag…
A - Dima and Continuous Line 水题:直接模拟: #include<cstdio> #define maxn 1005 using namespace std; int x[maxn],y[maxn]; int main() { int n,a,b,last; scanf("%d",&n); ; ;i<n;i++) { scanf("%d",&b); a=last; last=b; )continue; i…
A. Sereja and Dima time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Sereja and Dima play a game. The rules of the game are very simple. The players have n cards in a row. Each card contains…
Codeforces Round #366 (Div. 2) A I hate that I love that I hate it水题 #I hate that I love that I hate it n = int(raw_input()) s = "" a = ["I hate that ","I love that ", "I hate it","I love it"] for i in ran…
Codeforces Round #354 (Div. 2) Problems # Name A Nicholas and Permutation standard input/output 1 s, 256 MB x3384 B Pyramid of Glasses standard input/output 1 s, 256 MB x1462 C Vasya and String standard input/output 1 s, 256 MB x1393…
