code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include<map>
#include<cstring>
#include<iomanip>
#include <string>
#include <vector>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long unsigned llu;
typedef long double ld;
#define ll long long
#define PI 3.... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
void print(string word,vector<string>& output)
{
int a,b;
cin >> a >> b;
output.push_back(word.substr(a,b-a+1));
}
void reverse(string& word)
{
int a,b;
cin >> a >> b;
string temp = word.substr(a,b-a+1);
rever... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int n;
cin >> n;
for(int i = 0; i < n; i++){
string op;
int b, e;
cin >> op;
cin >> b >> e;
if(op == "print"){
cout << s.substr(b, e-b+1) << endl;
}else{
... | 1 |
#include <iostream>
#include <cctype>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <complex>
#include <cstring>
#include <set>
using namespace std;
#define loop(i,a,b) for(int i=a; i<b; i++)
#define rep(i,a) loop(i,0,a)
int input[1111][3];
int res[1111];
int main(){
int a,b,... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
while(1){
int A,B,C,N;
cin>>A>>B>>C;
if(A==0&&B==0&&C==0)break;
cin>>N;
int lis[1000][4];
for(int i=0;i<N;i++)cin>>lis[i][0]>>lis[i][1]>>lis[i][2]>>lis[i][3];
... | 1 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#define pb push_back
#define mp make_pair
#define ub(v,val) upper_bound(v.begin(),v.end(),val)-v.begin()
#define lb(v,val) lower_bound(v.begin(),v.end(),val)-v.begin()
#define sortv(vec) sort(vec.begin()... | #include <bits/stdc++.h>
using namespace std;
int x[200005], y[200005], d[200005];
vector<int> U[200005], D[200005], R[200005], L[200005];
vector<int> UL1[400005], UL2[400005];
vector<int> UR1[400005], UR2[400005];
vector<int> DL1[400005], DL2[400005];
vector<int> DR1[400005], DR2[400005];
int main(){
int n;
sc... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b,c,k;
cin >> a >> b >> c >> k;
int mn = max(a,max(b,c));
int ans = a + b + c - mn + pow(2,k) * mn;
cout << ans << endl;
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
int ans = 0;
cin >> a >> b;
string s;
string r_s = "";
for (int num = a; num < b + 1; num ++){
r_s = "";
s = to_string(num);
for (int i = 0; i < s.size(); i ++){
r_s += s[s.size() - 1 - i];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
static long Gcd(long m, long n)
{
long temp;
while (m % n != 0)
{
temp = n;
n = m % n;... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=1001000;
int n;
char s[N],t[N];
deque<int> deq;
int main(){
cin>>n;
scanf("%s%s",s+1,t+1);
int he=0,ta=1,l=n+1,tag=0,ans=0;
deq.push_back(n+1);
for(int i=n;i;--i){
int tmp=l;
while(l&&(l>i||s[l]!=t[i])) --l;
if(!l) return puts("-1")&0;
if(tmp==l){
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#define CLR(x) memset((x), false, sizeof(x))
const int MAXD = 12801;
const int MAXN = 81;
int A[2][MAXN][MAXN];
bool dp[MAXN][MAXN][MAXD];
int H, W;
int solve() {
CLR(dp);
dp[0][0][0] = true;
dp[0][1][0] = true;
dp[1][0][0] = true;
for (int i = 1; i ... | 0 |
#include <bits/stdc++.h>
#define rep(i , n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main (){
ll N, L[2]{};
cin >> N;
set <int> S;
while (cin >> N) {
if (!S.insert(N).second) {
S.erase(N);
if (N > L[0]){
L[1] = L[0],... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const str... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, min_count;
cin >> n;
min_count = 200;
for (int i=0; i<n; i++) {
int a, count = 0;
cin >> a;
if (a % 2 == 1) {
min_count = 0;
break;
}
while (a % 2 == 0) {
a /= 2;
count += 1;
}
if ... | 1 |
#include <iostream>
#include <algorithm>
#include<string>
#include<vector>
int main() {
int ining;
std::cin >> ining;
std::string s;
for (int i = 0; i < ining; ++i) {
int co = 0;
int ch = 0;
int c = 0;
while (std::cin >> s) {
if (s == "OUT") {
++co;
}
if (co == 3) {
break;
}
if (s == ... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(... | 0 |
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a;
cin>>b;
cin>>c;
cin>>d;
if(a<=b){
if(c<=d){
cout<<a+c;
}
else{
cout<<a+d;
}
}
else{
if(c<=d){
cout<<b+c;
}
else{
cout<<b+d;
}
}
}
| #include <bits/stdc++.h>
#include <ctime>
#define rep(i,a,b) for(int i =a;i<b;i++)
using namespace std;
typedef unsigned long long ll;
inline int cine() {int a; return scanf("%d", &a) ? a : 1e9;}
void solve() {
int train, bus, mine = 1e9, sum = 0 ;
rep(i, 0, 2) {
cin >> train;
mine = min(mine,... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) co... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main () {
long long N;
cin >> N;
long long M = 1;
for (long long i = 2; i <= sqrt(N); i++) {
if (N % i == 0){
M = i;
}
}
long long L = max(M,N/M);
int count = 0;
for (int i = 0; i < 11; i++) {
count++;
if (L / 10 == 0){
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | 1 |
#include <stdio.h>
#include <stdbool.h>
int main(void)
{
bool flag = true;
int cnt = 0;
int n;
scanf("%d", &n);
int x[n];
for(int i = 0; i < n; i++){
scanf("%d", &x[i]);
}
while(flag){
flag = false;
for(int i = n - 1; i >= 0; i--){
if(x[i] < x[i - 1]){
int temp = x[i];
x[i] = x[i - 1];
x[i... | #include <bits/stdc++.h>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
const int INF = 1<<29;
using namespace std;
using ll = long long;
int n, sum, y, a[105];
double g, t = 1e9;
int main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
g = 1.0 * sum / n;
for(int i = 0; i < n; i++) ... | 0 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int N, M, X, Y;
cin >> N >> M >> X >> Y;
int maxx = -101;
... | #include <iostream>
#include <vector>
void printArray(std::vector<int> a) {
int n = (int)a.size();
for (int i = 0; i < n; i++) {
std::cout << a[i] <<std::endl;
}
}
int insertionSort(std::vector<int> &a, int g) {
int cnt = 0, n = (int)a.size();
for (int i = g; i < n; i++) {
int v = a[i];
int j =... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
vector<ll> rows(n + 5), cols(n + 5);
for (int i = 0; i < n; ++i) {
fscanf(stdin, "%lld %lld", &rows[i + 1], &cols[i + 1]);
}
vector<vector<ll> > dp(n + 5, vector<... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int M=18,mod=1000000007;
int add(int a,int b,int p=mod){return a+b>=p?a+b-p:a+b;}
int sub(int a,int b,int p=mod){return a-b<0?a-b+p:a-b;}
int mul(int a,int b,int p=mod){return (LL)a*b%p;}
void sadd(int &a,int b,int p=mod){a=add(a,b,p);}
void ss... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100010,mod=998244353;
const char str[2][10]={"First","Second"};
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline int read... | #include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<cstdio>
typedef unsigned long long ull;
#define rep(i,a) for(int i=0;i<a;i++)
#define loop(i,a,b) for(int i=a;i<b;i++)
using namespace std;
const double eps = 1e-10;
const double pi = acos(-1);
const double inf = (int)1e8;
int main(void){
... | 0 |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 1e9+7;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).b... | #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#end... | 0 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
type... | #include<bits/stdc++.h>
#define pf(x) x*x
using namespace std;
int n, d[2], col[2][360007];
vector<pair<int, int> >e[2];
int id(int a, int b) { return a * 2 * n + b; }
int check(int pos) { return pos >= 0 && pos < 2 * n; }
int dfs(int p, int a, int b)
{
for (int i = 0, lim = e[p].size(); i < lim; i++)
{
int c = a +... | 0 |
#include<cstdio>
#include<algorithm>
#include<functional>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
for(int n,m;scanf("%d%d",&n,&m),n;){
int p[1000];
rep(i,n) scanf("%d",p+i);
sort(p,p+n,greater<int>());
int total=0;
rep(i,n) if((i+1)%m!=0) total+=p[i];
printf("%d\n",total... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), ... | 1 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int main(){
while(1){
int n, m, k;
int t[2][101][101];
scanf(" %d %d", &n, &m);
if(n==0) break;
memset(t, -1, sizeof(t));
for(int i=0; i<n; ++i){
int a, b, time, cost;
scanf(" %d %d %d %d", &a, &b, &... | #include<iostream>
#include<stdio.h>
using namespace std ;
int n , m ;
int data[101][101][2] ;
void f(){
for( int k=1 ; k<=m ; k++ ){
for( int i=1 ; i<=m ; i++ ){
for( int j=1 ; j<=m ; j++ ){
if( data[i][j][0] > data[i][k][0] + data[k][j][0] ){
data[i][j][0] = data[i][k][0] + data[k][j][0] ;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int A, B, C;
cin >> A >> B >> C;
vector<int> ac(A);
vector<int> bc(B);
int minA = 1<<30, minB = 1<<30;
rep(i, A) {
cin >> ac.at(i);
minA = min(minA, ac.at(i));
}
rep(j, B) {
cin >> bc.at(j);
minB =... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int A, B, M;
cin >> A >> B >> M;
int a[A], b[B], c[M];
for (int i = 0; i < A; i++){
cin >> a[i];
}
for (int i = 0; i < B; i++){
cin >> b[i];
}
for (int i = 0; i < M; i++){
int x, y;
cin >> x >> y >> c[i];
c... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define REVALL(vec) (vec).rbegin(), (vec).rend()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main()
{
ll n;cin >>n;
V a(n),b(n);rep(i,n... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define loop(k) rep(author_is_masa,k)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<in... | #include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int A, B; cin >> A >> B;
if (A == B) cout << 2 * A << endl;
else if (A > B) cout << 2 * A - 1 << endl;
else cout << 2 * B - 1 << endl;
}
| 1 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
int sx,sy,tx,ty,i,x,y;
scanf("%d %d %d %d",&sx,&sy,&tx,&ty);
x=t... | #include"bits/stdc++.h"
#include<iostream>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define rep(i, c) for(int i = 0; i < (int)c; i++)
const ll inf = 1000000007;
int main() {
int a, b,c;
cin >> a >> b >> c;
if (a != b) {
if (a==c || b==c) {
cout << "Yes" << endl;
return 0;
}
}
e... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <stdio.h>
int
main(void)
{
char line[80];
int x;
if (gets(line)) {
if (sscanf(line, "%d", &x) == 1) {
printf("%d\n", x*x*x);
}
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | #include <cstdio>
#include <cmath>
#define N 100010
#define ll long long
#define mem(x, a) memset(x, a, sizeof x)
#define mpy(x, y) memcpy(x, y, sizeof y)
#define fo(x, a, b) for (int x = (a); x <= (b); x++)
#define fd(x, a, b) for (int x = (a); x >= (b); x--)
using namespace std;
int n, st, coo[N], go_[N], tot = 0;
ll... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
vector<int> x(3);
rep(i, 3) cin >> x.at(i);
int cnt = 0;
rep(i, 3) rep(j, 3) {
if(i == j) continue;
else if(x.at(i) == x.at(j)) cnt++;
}
if(cnt == 2) cout << "Yes" << endl... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
//#define DEBUG
#ifdef DEBUG
#define DEBUG_PRINT(fm, ...) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout << "DEBUG PRINT ";std::printf(fm, __VA_ARGS__);}while(0)
#define DEBUG_VAL(a, b) do{std::printf("%s:%d(%s)", __FILE__, __LI... | 0 |
/*
????????°??§???????????¨????????????
*/
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <limits.h>
#include <float.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <vector>
#include <map>
#includ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1001001001001001;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n=1):n(n), f(n+1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i... | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | 1 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | // Integral
#include <iostream>
using namespace std;
int main() {
int d;
while(cin >> d) {
int x = 0;
long long S = 0;
for(int i = 1; i < 600/d; i++) {
x += d;
S += d * (x * x);
}
cout << S << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n,m;
int p[10000];
int sum=0;
cin>>n>>m;
if(n==0 && m==0) break;
for(int i=0;i<n;i++){
cin>>p[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++){
if(p[j]<p[j+1]) swap(p[j],p[j+1]);
}
}
for(int i=0;i<n;i++)... | #include<bits/stdc++.h>
using namespace std;
/*
int dx[]={-1,1,0,0};
int dy[]={0,0,-1,1};
vector<long long int> adj[200001];
bool vis[200001];
*/
#define ull unsigned long long int
#define ll long long int
#define MAX 1000000007
//1e9+7
#define pll pair<ll,ll>
#define pii pair<int,int>
#define IO ios_base::sync_with_s... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int>L(m);
vector<int>R(m);
for(int i=0;i<m;i++){
cin>>L.at(i)>>R.at(i);
}
int l=0,r=999999;
for(int i=0;i<m;i++){
l=max(l,L.at(i));
r=min(r,R.at(i));
}
int ans=0;
for(int i=0;i<=n;i++){
if(i>=l&&i<=... | /*input
*/
#include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define debug(x) cerr << (x) << '\n';
#define bits(x,i) ((x >> i) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int N = 500005;
int bit[N],n,q, c[N]... | 0 |
//Author - Rahil Malhotra
#include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#def... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,b,m;
vector<vector<int> > vec;
vector<int> dp;
int solve(int mask)
{
if(dp[mask]!=LLONG_MIN)
return dp[mask];
// if all the rabbits in mask are
// in the same group
int res=0;
for(int i=0; i<n; i++)
{
for(int j=i+1; j<n; j++)
{
if((ma... | 0 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long int a;
map<long long int,int> mp;
for(int i=0;i<n;i++){
cin >> a;
a *= (-1);
mp[a]++;
}
long long int tmp=0;
for(auto u:mp){
if(u.second>=4){
if(tmp<0){
... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const ll MAX_N=1e5,MAX_X=1e5;
ll N,X,psm[MAX_N+2],inx[MAX_N+1];
typedef tuple<ll,ll,ll> TUP;
TUP blu[MAX_N+1];
ll tsm(ll i){
return get<1>(blu[i])*get<0>(... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
int main() {
double n;
cin >> n;
n = 2 * n * acos(-1);
cout << n << endl;
return 0;
}
| #include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, g;
cin >> r >> g;
cout << (2 * g) - r << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD=1000000007;
const long double PI=3.14159265358979;
const ll MAX=0;
int main() {
ll a,b;
cin>>a>>b;
cout<<b+b-a;
}
| 1 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<iomanip>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#de... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inli... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N, D1, D2, M;
int A1[610][610], A2[610][610];
vector<pair<int, int>> v1, v2;
vector<pair<int, int>> V[4];
void dfs1(int x, int y, int c){
A1[x][y] = c;
for(auto p : v1){
int nx = x + p.first; int ny = y + p.second;
if(nx < 0 || nx > M || ny < 0 || ny > M) cont... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
lli employees[4001];
bool checked[4001];
signed main()
{
lli n;
while (cin >> n, n) {
for (lli i = 1; i <= 4000; ++i) employees[i] = checked[i] = false;
vector<lli> ans;
for (lli i = 0; i < n; ++i) {
lli num, a, b; cin >> num >> a... | 0 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a... | //
#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int fun(int x){
return x*x;
}
int main(){
int d;
while(cin >> d){
int n = 600/d;
int sum = 0;
for(int i=0; i<n; i++){
sum += fun(d*i)*d;
}
cout << su... | 0 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#d... | 1 |
#include<iostream>
using namespace std;
int main(){
char str[20];
cin>>str;
for(int i=20;i>0;i--)
cout<<str[i-1];
cout<<endl;
return 0;
} | #include <iostream>
using namespace std;
using lint = long long;
lint K;
lint N = 50;
const int MAX_N = 55;
lint a[MAX_N];
int main(){
ios::sync_with_stdio(false);
cin>>K;
for(int i=0;i<N;i++){
a[i] = (K+N-1)/N+(N-1);
}
int t = N-K%N;
if(t==N)t=0;
for(int i=0;i<t;i++){
a[i]-=K%N+1;
}
cout << N << endl... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, K ;
cin >> N >> K;
int array[N];
for(int i = 0;i < N ; i++){
cin >> array[i];
}
for(int i = 0;i < N ; i++){
int max = i;
for(int j = i+1;j < N;j++){
if(array[max] < array[j]){
max = j;
}
}
swap(arr... | #pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
ce... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, ll>P;
#define PI 3.14159265359
#define MOD 1000000007
const int MAX = 510000;
ll gcd(ll a, ll b){
if (a % b == 0)
{ return(b);}
else{return(gcd(b, ... | #include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 1000000007;
unsigned long N;
cin >> N;
vector<pair<pair<unsigned long, unsigned long>, unsigned long>> tapi(1048576, {{1, 0}, 0});
unsigned long ans{0}, t{500000004}, a{0}, z{0}, A;
while(cin >> A)if(a ^=... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<utility>
#include<cstdio>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include <bitset>
using namespace std;
const int mod=1e9+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,x,n) for (int i= x;i<n;... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cc... | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 12;
const int S = 1e5+5501;
int dp[N][S];
int p[N], c[N];
int rek(int pos,... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int d;
ll g;
cin >> d >> g;
vector<int> ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int, int>> odd(100100, make_pair(0, 0)), even(100100, make_pair(0, 0));
rep (i, n)
{
int v;
cin >> v;
if (i % 2)
{
odd... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
map<ll,ll> m, p;
rep(i,n/2) {
ll a, b;
cin >> a >> b;
m[a]++, p[b]++;
}
vect... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
int main() {
ios::sync_with_stdio(0); cin.tie(0);
string s,t;
cin >> s >> t;
cout << (t+s) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, l;
cin >> n >> l;
int ans = 0;
if (l + n - 1 < 0) {
for (int i = 0; i < n-1; i++) ans += l + i;
} else if (l < 0) {
for (int i = 0; i < n; i++) ans += l + i;
} else {
for (int ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define INF (1ll<<60)
#define mod 1000000007
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } r... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string a;
while(getline(cin,a)){
int k=0;
int check=0;
while(true){
if(k>52)
break;
for(int j=0;j<a.size();j++){
if(isalpha(a[j])!=0)
if(a[j]=='z')
a[j]='a';
else
a[j]++;
}
for(int i=0;i<a.size()-2;i++){
if... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=102;
int gi() {
int x=0,o=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
}
int n,m,x,y,ans=0,sx[N][N],sy[N][N];
short f[N][N][N... |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#inc... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char ch[3];
cin>>ch;
if(ch[0]=='S')
{
if(ch[1]=='U')cout<<"7"<<endl;
else cout<<"1"<<endl;
}
else if(ch[0]=='T')
{
if(ch[1]=='U')cout<<"5"<<endl;
else cout<<"3"<<endl;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
string s[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
string x;
cin >> x;
int ans = 0;
for(int i = 0; i < 7; i++... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | #pragma GCC optimize("O2,unroll-loops")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
int main() {
cin.tie(0)->sync_with_stdio(0);
string s, t;
cin >> s;
for(auto i : s) {
if(i == 'S') t.pb(i);
else if(t.size() && t.back() == 'S') t.... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin()... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string s; cin >> s;
int w = 0, e = 0;
for(int i=0; i<n; ++i){
if(s[i]=='W'){w++;}
}
e = n-w;
int nw = 0, ne = e;
int mi = INT32_MAX; int c;
for(int i=0; i<n; ++i){
if(s[i]=='W' && i>0){nw++;}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
string x = "";
for(int bit = 0; bit < (1 << 3); bit++){
int seven = s[0] - '0';
x += s[0];
for(int i = 1; i < 4; i++){
if(bit & (1 << (i-1))){
seven += s[i] - '0';
x += '+';
x += s[i];
... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#defi... | 1 |
#include <iostream>
#include <vector>
using namespace std;
typedef vector <int> VI;
typedef vector <VI> VVI;
const int dx[5] = { 0, 0, 0, 1, -1 };
const int dy[5] = { 0, 1, -1, 0, 0 };
int w, h;
int sx, sy, gx, gy;
VVI M;
int answer;
//==================================================
// Tõ
//==================... | #include <iostream>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define DEBUG(x) cerr << #x << " = " << x << endl
int F[20][20];
const int INF = (int)1e9;
const int dy[4] = { 0, -1, 0, 1 };
const int dx[4] = { 1, 0, -1, 0 };
int W, H;
int ans;
void solve(const int y... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e10;
const long long MOD = 1e9+7;
using Graph = vector<vector<ll>... |
/* Great things never come from comfort zones,
"whatever the mind of a man can conceive and believe,it can achieve." */
#include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) p... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string S;
cin >> S;
S.at(3) = '8';
cout << S;
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
t... | //Relive your past life.
//Face your demons.
//The past is never dead,it is not even past.
//The memories are not only the key to the past but...also to the future.
//coded in Rusty Lake
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<c... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" <<... | /*ॐ नमो भगवते वासुदेवाय नमः*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define allrev(x) (x).rbegin(), (x).rend()
#define pb push_back
#define pf push_front
#define fori(i, a, n) for(int i = a; i < n; ++i)
#define MAX(x) (... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
int ans=1;
for(int i=0;;i+... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if((b-1)%(a-1)==0)
cout<<(b-1)/(a-1)<<endl;
else
cout<<(b-1)/(a-1)+1<<endl;
}
| 1 |
#include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)... | 1 |
/*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(fa... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
policy_set;
#define trav(a, x... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl
using namespace std;
typedef long lon... | #include "bits/stdc++.h"
using namespace std;
//int N,M,K,L,R,H,W;
long long int N,M,K,L,R,H,W;
constexpr long long int MOD=1000000007;
//constexpr int MOD=1000000007;
//constexpr int MOD=998244353;
//constexpr long long int MOD=998244353;
constexpr long double EPS=1e-8;
int main(){
ios::sync_with_stdio(false);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
cout<<fixed<<setprecision(12);
int N,K;cin>>N>>K;
vector<double> A(N);
for(int i=0;i<N;i++) cin>>A.at(i);
//vector<double> ans(N-K+1);
priority_queue<double> ans;
double X=0;
for(int i=0;i<K;i++) X+=(A.at(i)+1.0)/2;
ans.push(X);
for(int i=1;... | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | 1 |
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#defin... | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<cctype>
using namespace std;
void _2();
void _3();
int main(){
int n;
scanf("%d",&n);
(n == 2) ? _2() : _3();
return 0;
}
void _2(){
int a,b;
scanf("%d%d",&a,&b);
int mi = min(a,b);
for(int i = 1; i <= mi; i++){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
while( cin >> n >> p, n || p ) {
vector<int>data( n );
int now = 0, P = p;
while( 1 ) {
for( size_t i = 0; i < n; i++ ) {
data[i] += p / n;
}
p %= n;
for( size_t i = 0; i < p; i++ ) {
now++;
now %= n;
data[now]+... | #include<bits//stdc++.h>
using namespace std;
int main(){
int n,p;
while(cin>>n>>p&&n!=0&&p!=0){
int a[50];
fill(a,a+n,0);
int m=0,p2=p;
while(true){
if(p==0){
p+=a[m];
a[m]=0;
}
else{
p--;
a[m]++;
}
if(p==0&&a[m]==p2) break;
m++;
if(m==n) m=0;
}
cout<<m<<endl;
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int K,N;
cin>>N>>K;
double p[N];
vector<double>t(N+1,0);
for(int i=0;i<N;i++){
cin>>p[i];
t[i+1]=t[i]+p[i]*(0.5)+0.5;
//cout<<i<<" "<<t[i]<<endl;
}
double maxp=0;
for(int i=0;i<N-K+1;i++){
maxp=max(maxp,t[i+K]-t[i]);
}
cout<<... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/********************************************************************/
#define M1 1000000007
#define M2 998244353
const double pi = 3.14159265;
#define ll long long
#... | 1 |
// Template
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <cmath>
#define rep(i, x) for (int i = 0; i < (x); ++i)
#define rng(i, x, y) for (int ... | #include<stdio.h>
int h,w;
int map[20][20];
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
int ans;
int out(int y,int x){
return y<0||h<=y||x<0||w<=x;
}
void search(int depth,int y,int x){
int i,ny,nx;
if(ans <= depth)return;
for(i=0;i<4;i++){
ny = y+dy[i];
nx = x+dx[i];
if(out(ny,nx) || map[ny][nx]==1)continue;... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
t... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
string solve... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long M, std::vector<long long> p, std::vector<std::string> S){
vector<long long> ac(N+1, 0);
vector<long long> wa(N+1, 0);
for(int i = 0; i < M; ++i){
if(ac[p[i]] == 0){
if(S[i] == "AC") ac[p[i]] = 1;
... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const double PI = 3.14159265358979323846;
int main() {
int n, m, a[1001], b[1001];
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < m; ++i) {
cin >> b[i];
}
int r... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 100000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
//setp... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
int a[n];
rep(i,0,n) cin>>a[i];
ll dp[n+1][3];
rep(i,0,3) dp[0][i]=0;
dp[1][0]=a[0];
dp[1][1]=0;
dp[1][2]=0;
rep(i,1,n){
... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <map>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main()
{
int x,y,z;
cin >> x >> y >> z;
swap(x,y);
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b,c;
int x,y;
cin>>a>>b>>c;
x=a.size();
y=b.size();
if(a[x-1]==b[0] && b[y-1]==c[0])
cout<<"YES";
else
cout<<"NO";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
int a,b;
cin >> a >> b;
if(a == b) cout << a + b << endl;
else if(a > b) cout << a*2-1 << endl;
else cout <<... | #include<iostream>
using namespace std;
int main ()
{
int a,b;
int m,n,j,k;
cin>>a>>b;
m=a+(a-1);
n=b+(b-1);
k=a+b;
if( m>n && m>k)
cout<<m<<endl;
else if (n>m &&n>k)
cout<<n<<endl;
else
cout<<k<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i) = 0; (i) < (n);(i)++)
using namespace std;
const int limit = 100010;
vector<int> graph[2][limit];
void add_edge(int from, int to) {
graph[0][from].push_back(to);
graph[1][to].push_back(from);
}
auto scc(int n) {
vector<int> order(n);
iota(begin(order), end(o... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const double PI = 3.14159265358979;
struct Edge{ ll... | 0 |
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
long int inf=100000*100000+100;
int main()
{
int v,e,r;
int s[500000];
int t[500000];
int d[500000];
long int dis[100000];
cin>>v>>e>>r;
for(int i=0;i<e;i++)
{
cin>>s[i]>>t[i]>>d[i];
}
for(int... | #include <iostream>
#define N 21
using namespace std;
int main(){
int n,m,x,y,rx,ry,l,cnt,d[N][N];
char c;
while(1){
for(int i=0;i<N;i++)
for(int j=0;j<N;j++) d[i][j]=0;
cin>>n;
if(!n) break;
for(int i=0;i<n;i++) cin>>x>>y,d[N-y-1][x]=1;
cin>>m;
rx=ry=10;
cnt=0;
while(m--){
... | 0 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b=180;
cin>>a;
cout<<b*(a-2)<<"\n";
} | /* ＵＴＦ－８ */
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <array>
#include <queue>
#include <stack>
#include <algorithm>
#include <tuple>
#include <numeric>
#include <type_traits>
#include... | 1 |
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <stack>
#include <list>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,b,n) for(int i=b;i<n;i++)
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) so... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll sum[1000000+5];
void Get(ll l,ll r,ll &first,ll &second)
{
ll res =INT_MAX;
ll left = l;
ll right = r-1;
while(left<=right)
{
ll mid = (left+right)>>1;
ll a = sum[mid]-sum[l-1];
ll b = sum[r]-sum[mid];
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
ll N;
cin >> N;
vector <ll> A(N);
vector <ll> B(N);
vector <ll> C(N);
for (int ii = 0; ii < N; ++ii) cin >> A[ii];
for (int ii = 0; ii < N; ++ii) cin >> B[ii];
for (in... | 0 |
// Alapan
// IIITH
#include<bits/stdc++.h>
using namespace std;
// data types
#define ll long long int
#define ld long double
//funtion macros
// stl
#define lp(var,start,end) for (ll var = start; var <=end ; ++var)
#define ilp(var,start,end) for(ll var = start; var>=end ; var--)
#define pb push_back
#define mp ma... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int x, y, z;
cin >> x >> y >> z;
cout << z << " " << x << " " << y << endl;
return 0;
}
| #include <iostream>
#include <string>
int main()
{
int A, B, C;
std::cin >> A; std::cin >> B; std::cin >> C;
std::cout << std::to_string(C) + " " + std::to_string(A) + " " + std::to_string(B) << std::endl;
} | 1 |
#include <iostream>
#include <vector>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <regex>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pl4 = pair<ll,ll>;
using vi = vector<int>;
using v... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define rep(i,s,n) for(int i = s;i<n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))... | 1 |
#include <cstdio>
//#include <iostream>
//#include <string>
using namespace std;
// cl /EHsc xxx.cpp
int main(int argc, char *argv[])
{
int n;
scanf("%d", &n);
int *ary = new int[n];
int v;
int t = n;
while (t)
{
scanf("%d", &v);
ary[--t] = v;
}
for (int j = 0; j < n; j++)
{
printf((j == n-1) ? ... | #include <iostream>
int main(int argc, char** argv)
{
int n;
std::cin >> n;
int a[100];
for (int i = 0; i < n; ++i)
{
std::cin >> a[i];
}
for (int i = n - 1; i > 0; --i)
{
std::cout << a[i] << " ";
}
std::cout << a[0] << std::endl;
}
| 1 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <list>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <fstream>
#include <sstream>
#include <unordered_map>
#include <ctime>
using namespace std;
const unsigned long long BASE = (unsigned long long)(1e9 +... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;cin>>n>>k;
int ans = 0; if (n%k > 0) ans++;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001; // const 書き換え禁止
const double PI = 3.14159265358979323846; //M_PI はライブラリ
int main(void){
int n,k;
cin >> n >> k;
if(n%k == 0){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[1001][1001], prm[2003];
int vis[100005], cnt;
void euler() {
vis[1] = 1;
for (int i = 2; i <= 10000; ++i) {
if (!vis[i]) prm[++cnt] = i;
for (int j = 1; j <= cnt && i * prm[j] <= 10000; ++j) {
vis[i * prm[j]] = 1;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define uint unsigned
#define PI pair<int,int>
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)... | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (long long i=0;i<(n);i++)
#define FOR(i,a,b) for (long long i=(a);i<(b);i++)
#define RREP(i,n) for(long long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i])... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
string s,t;
cin >> s>> t;
cout << t << s << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
int a[1000]={};
int b[1000]={};
int max =0;
int t;
int cnt[1000]={};
cin >> n >> m;
for(int i=0;i<n;i++)
{
cin >> a[i];
}
for(int j=0;j<m;j++)
{
cin >> b[j];
}
for(int j=0;j<m;j++)
{
for(int ... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(true){
int n,m;
cin >> n ;
if(cin.eof()) break;
cin >> m;
vector<int> a(1000);
vector<int> b(1000);
vector<int> c(1000);
vector<bool> u(1000);
vector<int> ans(1000);
fill... | 1 |
#include <stdio.h>
int main(){
int n,m,i,j,x[20],y[20],z[30],p[31],q[31],a[20],b[20],c[20],s;
char d[i];
while(1) {
scanf("%d",&n);
if (n==0) break;
for (i=0;i<n;i++) {
scanf("%d %d",&x[i],&y[i]);
}
scanf("%d",&m);
for (i=0;i<m;i++) {
... | #include <string.h>
#include <iostream>
#include <queue>
#include <complex>
#include <functional>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
#define E... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,x;
cin >> n >> x;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
}
ll cnt=0;
if(a.at(0)>x){
cnt+=a.at(0)-x;
a.at(0)=x;
}
for(int i=1; i<n; i++){
ll k=a.at(... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
int n,x,a;
while(~scanf("%d%d%d",&n,&x,&a)){
ll ans=0;
if(a>x)
ans+=a-x,a=x;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int sum = 1;
for (int i =0;i < n;i++){
if ( (sum * 2) >= (sum + k) ) {
sum += k;
}
else sum *= 2;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
in... | 0 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
typedef double db;
int get(){
char ch;
while(ch=getchar(... | #include<bits/stdc++.h>
using namespace std;
int N,M;
int G[15][15];
int dp[15][(1<<15)];
int INF=2e9;
int calc(int bit,int nbit){
int sum=0;
for(int i=0;i<N;i++)
if(nbit>>i&1)
for(int j=0;j<N;j++)
if(~bit>>j&1)
if(~nbit>>j&1)
sum+=G[i][j];
return sum;
}
int rec(int p... | 1 |
// F.
#include <iostream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
const int INF = 1 << 30;
int solve(vector<int> x, vector<int> y, vector<string> dir) {
int ans = INF;
int n = (int)x.size();
map<int, set<int>> a, b, v, h;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1e8;
// URDL = 0123
int f(vector<P> a) {
sort(a.begin(), a.end());
int res = INF;
for (int i = 1; i < a.size(); ++i) {
if (a[i-1].second == 0 && a[i].s... | 1 |
#include<string>
#include<iostream>
using namespace std;
int main()
{
int n; cin>>n;
string s;
int runner=0,out=0,score=0;
while(cin>>s){
if(s=="HIT"){
runner<<=1;
if(runner&8)runner&=~8,score++;
runner|=1;
}
else if(s=="HOMERUN"){
for(int i=0;i<3;i++){
runner<<=1;
if(runner&8)runner&=~8... | #include <iostream>
#include <string>
using namespace std;
string A[] = { "Thursday", "Friday", "Saturday", "Sunday", "Monday", "Tuesday",
"Wednesday" };
int D[] = { 0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
int main()
{
int m, d, B[13];
B[0] = 1;
for (int i = 1; i <= 12; ++i) B[i] = B[i-1] + D[i... | 0 |
#include <iostream>
#include <cstring>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
void solve(int n) {
int place[21][21];
memset(place, 0, sizeof(place));
rep(i,n) {
int x,y; cin>>x>>y;
place[y][x] = 1;
}
int m; cin >> m;
... | // aribon4-3_a
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (in... | 0 |
#include<cstdio>
typedef long long LL;
const int N=2003;
const int O=2*N;
int n,m,ans;
int dp[3*N][5*N];
inline LL Pow(LL x,int p) {
if(p==0) return 1;
if(!(p&1)) return Pow(x*x%m,p>>1);
return x*Pow(x*x%m,p>>1)%m;
}
inline void Add(int &x,int y) {
x+=y; if(x>=m) x-=m;
}
int main() {
scanf("%d %d",&n,&m); n*=3;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n,m,a[1000010],b[1000010],s;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;++i)scanf("%d",a+i),s+=a[i]&1;
if(s>2)return puts("Impossible"),0;
sort(a+1,a+m+1,[](int x,int y)->bool{return (x&1)>(y&1);});
if(m==1)if(a[1]==1)return puts("1\n1\n1"),0;else return pr... | /*input
5 1
5
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_... | 1 |
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
using ll=long long;
using P=pair<int,int>;
const ll INF=1LL<<30;
const ll LINF=1LL<<61;
const double eps=1e-9;
const ll MOD=1000000007LL;
vector<ll> f,fi;
ll mpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1){
r... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<list>
#include <cstring>
#include <functional>
//#include<unordered_map>
//#include<unordered_set>
using name... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.