code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define N 610
int a[N][N],n,d1,d2,b;
int main()
{
scanf("%d%d%d",&n,&d1,&d2);
while (d1%4==0)
{
b++;
d1/=4;
}
if (d1&1)
{
for (int i=0; i<2*n; i++)
for (int j=0; j<2*n; j++)
if (((i>>b)+(j>>b))&1)
a[i][j]=1;
}
else
for (int i=0; i<2*n; i++)
fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1000000007LL
#define eps 1e-13
// #define PI 3.141592653589793238L
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+9;
int a[maxn];
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
while(k--)
{
int b[maxn];
memset(b,0,sizeof(b));
for(int i=1;i<=n;i++)
{
int l = max(1,i-a[i]);
... | #include <bits/stdc++.h>
using namespace std;
int n, k;
double kitaichi(vector<int> p, int start, int k){
double ans;
for (int i = 0; i < k; i++){
double sum = 0;
for (int j = 1; j <= p[start+i]; j++){
sum += j;
}
ans += sum/p[start+i];
}
return ans;
}
int main() {
cin >> n >> k;
... | 0 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const* argv[])
{
std::string s;
std::cin >> s;
std::reverse(s.begin(),s.end());
std::cout << s << std::endl;
return 0;
} | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int i,b;
char srt[100];
gets(srt);
b=strlen(srt);
for(i=b-1;i>=0;i--)
{
printf("%c",srt[i]);
}
printf("\n");
} | 1 |
#include<iostream>
using namespace std;
int main(void) {
int N;
int a[200];
int count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
while (true) {
bool odd_flag = false;
//奇数かどうかの判定
for (int j = 0; j < N; j++) {
if (a[j] % 2 != 0) {
odd_flag = true;
}
}
//flagがtrueならwhile文... | #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(){
int n;
cin>>n;
int p[200010];
int ans=0;
int tmp=200010;
rep(i, n){
cin>>p[i];
if(tmp>p[i]) ans++;
tmp=min(tmp,p[i]);
}
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int num(int N){
int a = 0 , b = 1, c;
for(int i = 0 ; i < 9 ; i++){
a += N / b % 10;
b *= 10;
}
c = N % a;
return c;
}
int main(){
int N;
cin >> N;
if(num(N) == 0){
cout << "Yes" <<endl;
}
else if(num(N) != 0){
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c = s.size();
int p = 0;
int q = 0;
for (int i = 0; i < c; i++){
p *= 10;
p += s.at(i) - '0';
q += s.at(i) - '0';
}
if(p%q==0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<list>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<ctime>
using namespace std;
const int NIL = -1;
const int MAX = 2147483647;
clock_t START, END;
struct Node {
int l, r,... | #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
struct node{
int num;
node *parent,*left,*right;
};
node *root,*NIL;
node *treemin(node *x){
while(x->left!=NIL)
x=x->left;
return x;
}
node *nextnode(node *x){
if(x->right!=NIL) return treemin(x->right);
node *... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv) {
string s;
cin >> s;
cout << s.substr(0, s.length() - 8) << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n;
cin>>n;
ll m=n,sum=0;
while(m>0)
{
sum+=m%10;
m=m/10;
}
// cout<<sum<<endl;
if(n%sum==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
vector<ll >v;
vector<ll >vp;
ll i,j,k;
ll a,b;
for(i=0; i<n; i++)
{
cin>>a;
v.push_back(a);
}
for(i=0; i<n; i++)
{
... | #include<bits/stdc++.h>
using namespace std;
int main(){
char S;
int mix=0;
int a=0;
for(int i=0; i<3;i++){
cin >> S;
if (S=='R'){
a++;
mix=max(a,mix);
} else {
a=0;
}
}
cout << mix << endl;
} | 0 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false) ;
cin.tie(NULL);
int a,b;
cin>>a>>b;
cout<<(2*b)-a<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y; cin >> x >> y;
int ans = 0;
if(x>0){
if(y>0){
if(x>y){
ans++; // x -> -x
ans += abs(x-y); // x -> -y
ans++; // x-> y
}else if(x < y){
ans+= y-x; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll h,w,a,b;
cin >> h >> w >> a >> b;
if(h == 1){
for(i = 0;i < a;++i) cout << 0;
for(i = a;i < w;++i) cout << 1;
cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
constexpr ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#... | 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#inc... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define re_ return
ll e[19];
ll DFS(ll n, ll m, char k)
{
// printf("%lld %lld\n", n, m);
n=abs(n);
if(m==-1) re_ !n;
if(!m) re_ n? 0: 10;
int i=n/e[m];
if(i>9) re_ 0;
if((n+i)%10==0)
r... | 0 |
#include<iostream>
#include<string>
using namespace std;
void sort(int card[5])
{
for(int i=0;i<5;i++)
{
int max=i;
for(int j=i+1;j<5;j++)
{
if(card[max]<card[j])
{
max=j;
}
}
int tmp=card[i];
card[i]=card[max];
card[max]=tmp;
}
}
bool fourcard(int card[5])
{
if((card[0]==card[1]&&card... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long do... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b,c) for(ll i=a;i<b;i+=c)
#define r(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define mod 1000000007
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll n; cin >> n;
ll ar[n];
f(i,0,n,1){
cin >> ar[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mn = INT_MAX;
long long res = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n && a[i] < 0) {
a[i + 1] *= -1;
a[i] *= -1;
}
res += abs(a[i]);
mn = min(mn,... | 0 |
#include<iostream>
#include<string.h>
#include<string>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define N
int main()
{
std::ios::sync_with_stdio(false);
long long n,i,j,k;
while(cin>>i>>j>>k)
{
cout<<k<<" "<<i<<" "<<j<<endl;
}
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<string> a;
bool cmp(string s, str... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
int h,w;
cin>>h>>w;
vector<vector<int>> c(h,vector<int>(w));
vector<pair<int,P>> coin;
rep(i,h){
rep(j,w) cin>>c[i][j];
if(i%2==1) reverse(c[i]... | #define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
void insertionSort(int array[], int N, int g, int *cnt){
... | 0 |
#include <iostream>
#include <math.h>
using namespace std;
int fl[10001] = {0};
void isfl(int);
void twlf(int);
int main(void) {
int tag;
while(1){
cin >> tag;
if(tag == 0) break;
isfl(tag);
twlf(tag);
}
return 0;
}
void isfl(int tag){
int i,lim,idx = 2;
fl[0] = 1;
fl[1] = 1;
lim =... | #include <iostream>
#include <iomanip>
using namespace std;
int main(){
int n;
int i , j;
while(cin >> n, n!=0) {
int arr[10][10]={0,0};
int ansW[11]={0};
int ansH[11]={0};
for(i=0 ; i<n ; i++){
for(j=0 ; j <n ; j++){
cin >>arr[i][j];
}
}
for(i=0 ; i<n ; i++){
for(j=0 ; j<n ; j++){
ansH[i]... | 0 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define AB(A) for(A=0;A<100;A++)a[A]=0
int main() {
int n = 0, tmp0 = 0, tmp1 = 0;
int tmp2 = 0, tmp3, out1 = 0, out2 = 0;
int a[100];
scanf("%d", &n);
while (n) {
AB(tmp3);
tmp0 = 0, out2 = 0;
while (tmp0 < n) {
t... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int matrix[11][11] = {0};
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cin >>matrix[i][j];
}
}
int suma = 0;
for(int i=0,sumc,sumr; i<n; i++){
sumc = 0;
sumr = 0;
for(in... | 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 n, l;
cin >> n >> l;
vector<int> d(n);
for (int i = 1; i <= n; i++) {
d[i-1] = l+i-1;
}
int all = 0;
rep(i,n) all += d[i];
... | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... | 0 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define pr... | #include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#inc... | 0 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
template <class T>
using vec = vector<T>;
template <class T>
using vec2 = vector<vec<T>>;
template <clas... | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | 1 |
//Tanzim bin nasir
#include<bits/stdc++.h>
typedef long long ll;
#define ff first
#define ss second
using namespace std;
void fast()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
ll gcd(ll a,ll b)
{
if(b==0)
return a;
else
gcd(b,a%b);
}
ll lcd(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n;
cin >> n;
int m, p;
ll ans = 0;
m = 1e6;
rep(i, n) {
cin >> p;
if (m >= p) {
ans++;
}
m = min(m, p);
}
cout << ans ... | 1 |
#include<bits/stdc++.h>
using namespace std;
bool is_sum (vector<int> s, int n){
if(s.size() == 1) {
if(s.at(0) == n) return true;
else return false;
}
else{
int a = s.at(s.size()-1);
s.pop_back();
if(is_sum(s,n+a) || is_sum(s,n-a)) return true;
else return f... | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <iostream>
#include <bitset>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <list>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array)/sizeof(array[0]))
using namespace s... | 1 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <time.h>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <string.h>
#define sf scanf
#define pf printf
#define lf double
#define ll long... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R;
int G;
//Rは現在のレート,Gは取るべき点数
//R,Gで入力を受け取る
cin>> R;
cin>> G;
cout << (G*2)-R << endl;
}
| 0 |
//include
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
//using
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
usin... | #include <stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN=1000005;
vector <int> adj[MAXN];
int prof[MAXN],low[MAXN],padre[MAXN],cont,N,M,root;
bool usa[MAXN],ap[MAXN];
void articulationPoints(int v){
int child=0;
usa[v]=true;
low[v]=prof[v]=++cont;
for (int i=0; i<(int)... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | #include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 1e5 + 5;
int K, ans;
int par [MAX_N];
vector<int> adj [MAX_N];
int subh [MAX_N];
int del [MAX_N];
void dfs (int u) {
subh[u] = 0;
for (int nxt : adj[u]) {
dfs(nxt);
if (!del[nxt]) {
subh[u] = max(subh[u], 1 + subh[nxt])... | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i,k,n) for(int i = k; i < n; i++)
#define mmax(start, end) *max_element(start, end)
#define mmin(start, end) *min_element(start, end)
#define argmax max_element
#define argmin min_element
#define push push_back
#define pop pop_bac... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define ve vector
#define... | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
template<typename T>
void cout_vec(vector<T> &vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 1 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
void Input(int*,int*);
int Calc(int*,int*);
void Output(int*,int*,int*);
int main(int argc,char* argv[]){
int n,count=0;
int arr[100];
Input(&n,arr);
count=Calc(&n,arr);
Output(&n,&count,arr);
return 0;
}
voi... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typede... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
int ans=1;
... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fill(x,v) memset(x,v,sizeof(x))
#define all(x) (x).begin(), (x).end()
#define trace(x) cerr << #x <<": " << x << endl
#define fasti... | 0 |
#include <iostream>
using namespace std;
int main()
{
int m[50],d[50];
int x = 0;
string Day[7] = {"Thursday", "Friday","Saturday","Sunday","Monday", "Tuesday", "Wednesday"};
int BanyakHari[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
string ThatDayIs[50];
do
{
int DayinBetween =... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
void getDays(int month, int day)
{
int dayNum[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int fst=0; // 1/1 ?????? (month-1)??????????????\?????§?????\??°
for(int i=0; i<month-1; i++)
fst += dayNum[i];
fst +=... | 1 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define sc1(a) scanf("%d",&a)
int main(){
bool f=0;
int n;
long long a,b=0ll,x=2e9;
sc1(n);
rep(i,n){
scanf("%lld",&a);
if (a<0) f=f^1;
b+=abs(a);
x=min(x,abs(a));
}
printf(... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = ... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_nod... | 1 |
#include<stdio.h>
int main(){
int a,b,x,y,kurang;
scanf("%d %d %d %d %d", &a,&b,&x,&y,&kurang);
int temp=((x*60)+y)-((a*60)+b);
printf("%d\n", temp-kurang);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
# define rep(i,n) for(int i=0;i<n;i++)
void solve(){
int n;
cin>>n;
int a[n];
rep(i,n)
cin>>a[i];
lli sum=0;
for(int i=1;i<n;i++){
if(a[i-1]>a[i]){
sum+=(a[i-1]-a[i]);
a[i]=a[i-1];
}
}
c... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read() {
int res=0,fh=1;
char ch=getchar();
while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
if(ch=='-')fh=-1,ch=getchar();
while(ch>='0'&&ch<='9')res=res*10+ch-'0',ch=getchar();
return fh*res;
}
const int maxn=4000010;
const int mod=1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a =... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i=0; i<N; i++) {
cin >> data.at(i);
}
int count = 0;
while (true) {
for (int j=0; j<N; j++) {
if (data.at(j)%2 != 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int n = 1000000000;
for (int i = 0; i < N; i++){
int A;
cin >> A;
int a = 0;
while ( A % 2 == 0){
a++;
A /= 2;
}
if(n > a)
n = a;
}
cout << n << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(... | #include<iostream>
#include<queue>
using namespace std;
int H,W;
char A[1005][1005];
int dist[1005][1005];
bool visited[1005][1005];
int white_cnt=0;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
class Node{
public:
int x,y;
Node(int a, int b):x(a),y(b){}
};
void input(){
cin>>H>>W;
for(int i=0;i<H;+... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, M; cin >> N >> M;
vector<int> A(N);
rep(i, N){
cin >> A[i];
}
vector<int> R(N+1);
R[0] = 0;
rep(i, N){
int r = A[i... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,s=0;
cin>>n;
for(i=1;i<=n;i++)
{
if(i%3==0||i%5==0)
continue;
s+=i;
}
cout<<s<<endl;
}
| // God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,x=0;string A,B,C;
cin>>N>>A>>B>>C;
for(int i=0;i<N;i++){
char a=A.at(i),b=B.at(i),c=C.at(i);
if(a==b){if(a!=c)x++;}
else{
if(a==c||b==c)x++;
else x+=2;
}
}
cout<<x<<endl;
} | 0 |
#include<functional>
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
const int mxn = 1e6 + 5;
int n;
char s[mxn];
int bg[mxn], ln[mxn];
int a[mxn], b[mxn];
int id[mxn];
boo... | 1 |
#include <iostream>
using namespace std;
int partition(int A[],int n,int p,int r){
int i=p-1;
int x=A[r];
for(int j=p;j<r;j++){
if(A[j]<=x){
++i;
int t=A[j];
A[j]=A[i];
A[i]=t;
}
}
A[r]=A[i+1];
A[i+1]=x;
return i+1;
}
int main(){
int n;
cin>>n;
int *A=new int[n];
for(int i=0;i<n;i++)cin>>A... | #include<iostream>
using namespace std;
int main(){
int a[100001],n,count=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
if(a[i]>a[n-1])
count++;
else
swap(a[i],a[i-count]);
for(int i=0;i<n-count-1;i++)
cout<<a[i]<<' ';
cout<<'['<<a[n-count-1]<<']'<<' ';
fo... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0... | #include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FILL0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b... | 0 |
#include <cstdio>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
typedef pair<int, int> P;
P po[100], res[100];
int main() {
int n; scanf("%d",&n);
for (int i=0; i<n; i++) {
po[i].second=i;
po[i].first=0;
}
for (int i=0; i<n*(n-1)/2; i++) {
int a,b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void pv(vector <int> &v) {
for(int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve() {
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector <int> a(n, ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int,int> m;
for(int i=0; i<n; i++){
int a;
cin >> a;
m[a]++;
}
vector<int> use;
for(auto p:m){
if(p.second>=4){
use.push_back(p.first);
... | #include <stdio.h>
int main(void)
{
int n,a[4],t[100],p[100],i,j,k;
scanf("%d",&n);
for(i=0;i!=n;++i)
t[i]=0;
for(i=0;i!=n*(n-1)/2;i++){
for(j=0;j!=4;j++)
scanf("%d",&a[j]);
if(a[2]<a[3])
t[a[1]-1]+=3;
else if(a[2]>a[3])
t[a[0]-1]+=3;
else{
t[a[0]-1]+=1;
t[a[1]-1]+=1;
}
}
for(i=0;i!=n;+... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rr... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<98<<" "<<99<<endl;
a--;
b--;
for(int i=0;i<=48;i++){
for(int j=0;j<=98;j++){
if(i%2==0||j%2==0||a==0)
cout<<'#';
else{
cout<<'.';
a--;
}
}
cout<<endl;
}
for(int i=0;i<... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a <= b*c)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int d, t, s;
cin >> d >> t >> s;
if(d % s == 0 && d / s <= t){
cout << "Yes" << endl;
return 0;
}else if(d % s != 0 && d / s < t){
cout << "Yes" << endl;
return 0;
}else{
cout << "No" << endl;
return 0... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | #include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
int n, m; cin >> n >> m;
vector<ll>x(n), y(m); for (auto&& xx : x)cin >> xx;for (auto&& yy : y)cin >> yy;
sort(x.begin(), x.end());sort(y.begin(), y.end());
ll a = 0, b = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
long long n, m, x[100004], y[100004];
const int mod = 1000000007;
long long mul(long long a, long long b){
long long ret = a * b;
return ret% mod;
}
long long sum(long long a, long long b){
return (a+b)%mod;
}
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NU... | 1 |
//#include <bits/stdc++.h>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <limits>
#include <map>
#include <vector>
#include <queue>
#define LL long long
#define ft first
#define sd second
#define mp(x,y) make_pair(x,y)
//#define int LL
using namespace std;
const int N = 3e5+23... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <class T>
using Vvec = vector<vector<T> >;... | 0 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef lo... | 0 |
#include <bits/stdc++.h>
const int N = 108;
int n;
int a[N], b[N];
int main() {
int i, mid;
scanf("%*d%d", &n);
for (i = 0; i < n; ++i) scanf("%d", a + i);
if (n == 1) return *a == 1 ? puts("1\n1\n1") : printf("%d\n2\n1 %d\n", *a, *a - 1), 0;
mid = std::partition(a, a + n, [] (const int x) -> bool {return x % 2... | #include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=105;
int n,m,a[maxn],b[maxn];
inline char nc(){
static char buf[100000],*p1,*p2;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
int ret=0;bool f=0;char ch=nc();
while(ch>'9'||ch<'0') f^=ch=='-',ch... | 1 |
/********************************************************
**░██████╗██╗░░░░░░█████╗░██╗░░░██╗██╗░█████╗░░██████╗░**
**██╔════╝██║░░░░░██╔══██╗██║░░░██║██║██╔══██╗██╔════╝░**
**╚█████╗░██║░░░░░███████║╚██╗░██╔╝██║██║░░╚═╝██║░░██╗░**
**░╚═══██╗██║░░░░░██╔══██║░╚████╔╝░██║██║░░██╗██║░░╚██╗**
**██████╔╝██████... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = v... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
vector<int> card(5);
vector<int> count(13);
string handName[7] = {"null", "one pair", "two pair", "three card", "straight", "full house", "four card"};
int hand;
int max, pair;
int i;
while (scanf("%d,%d,%d,%d,%d", &card[... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int l[5];
char c;
while (cin >> l[0] >> c >> l[1] >> c >> l[2] >> c >> l[3] >> c >> l[4]) {
sort(l, l + 5);
if (l[0] == l[1] && l[1] == l[2] && l[2] == l[3])
cout << "four card";
else if (l[4] == l[1] && l[1] == l[2] && l[2] == l[3])
... | 1 |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int N, M;
int score[1002001];
int point[1001];
int bin_search(int n){
int h=0, t=(N+1)*(N+1);
int temp;
int status;
while(h<=t){
temp = (t+h)/2;
if(n == score[temp]) return -1;
else if(n > score[tem... | #include<iostream>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<cstdlib>
#include<typeinfo>
#include<sstream>
#include<list>
#include<set>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#de... | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int t = 753;
int d = 1000;
st... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typed... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, i, a, b, x, y, z = 0;
cin >> A >> B;
for (int i = A; i < B + 1; i++){
a = i / 10000;
b = (i / 1000) % 10;
x = i % 10;
y = (i % 100) / 10;
if (a == x && b == y){
z += 1;
}
else
continue;
}
cout << z <<... | #include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
cout << n - k + 1 << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define tcase int _; cin >> _; while(_--)
const int MAX = 1e6;
const int MOD = 1e9+7;
int ans;
int n;
ll v[MAX], sum[MAX];
void solve() {
cin >> n;
for(int i=0; i<n; i++) cin >> v[i];
ans = 0;
for(int i=0; i<61; i++) {
ll c1 = 0;
for(int j=0; ... | #include <bits/stdc++.h>
using namespace std;
int lengths[105];
bool allDifferent(int len1, int len2, int len3)
{
return (len1 != len2) && (len2 != len3) && (len3 != len1);
}
bool canFormTriangle(int len1, int len2, int len3)
{
int maxLen = max(max(len1, len2), len3);
return len1 + len2 + len3 - maxLen > maxLen;
}... | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
for(int64_t i=1;i<n;++i){
if(i*i>n){
cout<<(i-1)*(i-1)<<endl;
return 0;
}
}
cout<<1<<endl;
} | #include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
ll e, m, x, min_;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (cin >> e, e) {
min_ = m = (int)(1e9 + 7);
for (int y = 0; y <= sqrt((double)e); y++) {
for (int z = 0; z <= sqrt((do... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define inf 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(c... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
ll ca[1111111]={};
ll cb[1111111]={};
int main(){
ll n,... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
#define eb emplace_back
using namespace std;
string s;
ll ans=1,cnt=0,n;
const int mod=1e9+7;
int main(){
cin>>n>>s;
for(auto x:s){
if(x=='W'&&(cnt&1)){
cnt++;
}else if(x=='... | #include <bits/stdc++.h>
using std::cerr;using std::cin;using std::cout;using std::abs;using std::min;using std::max;using std::swap;using std::map;using std::unordered_map;using std::unordered_set;using std::bitset;using std::pair;using std::set;using std::string;using std::vector;using std::sort;using ll=long long;us... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n - 8; ++i) {
cout << s[i];
}
puts("");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x... | 1 |
#include<iostream>
using namespace std;
int main(){
int n;
int a;
int count = 1e9;
cin >> n;
for(int i = 0;i<n;i++){
cin >> a;
int key = 0;
while(a%2 == 0){
a /= 2;
key++;
}
if(key<count){
count = key;
}
}
c... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
ll n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0 || i % 5 == 0) continue;
ans += i;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string x;
cin >> x;
for(int i=x.length()-1;i>=0;i--)
cout << x[i];
cout << endl;
return 0;
} | #include<iostream>
#include<string>
#include<iterator>
std::string reverse_str(std::string str);
int main()
{
std::string str;
while (std::cin >> str)
{
str = reverse_str(str);
std::cout << str << std::endl;
}
return 0;
}
std::string reverse_str(std::string str)
{
std::string str_ans;
for (unsigned long i... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define Int register int
#define mod 1000000007
template <typename T> inline void read (T &t){t = 0;char c = getchar();int f = 1;while (c < '0' || c > '9'){if (c == '-') f = -f;c = getchar();}while (c >= '0' && c <= '9'){t = (t << 3) + (t << 1) + c - '0';c = getchar();} t... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 45,mx = 1 << 17 + 5;
int n,x,y,z;
int lim,chk,ans = 0;
int dp[N][mx] = {0};
int fa[N][mx] = {0};
int main(){
scanf("%d%d%d%d",&n,&x,&y,&z);
lim = 1 << (x+y+z);
chk = (1 << (x+y+z-1)) + (1 << (y+z-1)) + (1 << (z-1));
fa[0][0] = 1;
f... | 1 |
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
int i;
double x,sum,v1,v2,a[100];
while(cin >> a[0]){
sum = 0;
for(i=1;i<9;i++) scanf(",%lf",&a[i]);
scanf(",%lf,%lf,%lf",&a[9],&v1,&v2);
for(i=0;i<10;i++) sum += a[i];
x = sum/(v1+v2);
sum = ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int sx,sy,tx,ty;
cin>>sx>>sy>>tx>>ty;
int dx=abs(sx-tx);
int dy=abs(sy-ty);
cout<<string(dx,'R')<<string(dy,'U');
cout<<string(dx,'L')<<string(dy,'D');
cout<<'L'<<string(dy+1,'U')<<string(dx+1,'R')<<'D';
cout<<'R'<<string... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T ... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int MOD = 1000000007;
const int MAXN = 2 * 100005;
LL H, W;
LL A, B;
LL fact[MAXN];
// Exponentiation by squaring
LL expsq(LL x, LL p) {
LL res = 1;
while (p > 0) {
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int M = N;
int i = 0;
int sum = 0;
while (M >= 1) {
sum += (M - (M / 10) * 10);
M = M / 10;
}
if (N % sum == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 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 n, m;
cin >> n >> m;
int lmax = 0, rmin = n;
rep(i,m) {
int l, r;
cin >> l >> r;
lmax = max(lmax, l);
rmin = min(rmin, r);... | #include <cstdio>
#include <cstring>
#include <algorithm>
#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;
int read() {
char ch;
for(ch=getchar();ch<'0'||ch>'9';ch=getchar());
int x=ch-'0';
for(ch=getchar();ch>='0'&&ch<='9';ch=getchar()) x=... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n,0);
REP(i,n) cin >> a[i];
sort(a.begin(), a.end());
bool ok ... | //\\//\\ * * * //\\// ||
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
const int N = 110;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, ... | 0 |
#ifndef TEMPLATE_HPP
#define TEMPLATE_HPP
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
while(1)
{
int sell_num[10] = {};
cin >> n;
if(n == 0)
{
break;
}
for(int i=0; i<n; i++)
{
int id;
cin >> id;
sell_num[id]++... | 0 |
#include<stdio.h>
int d,t,s;
int main()
{
scanf("%d %d %d", &d, &t, &s);
d=d+s-1;
if(t>=(d/s))printf("Yes");
else printf("No");
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string root;
int sx, sy, tx, ty;
int dx, dy;
int i, j;
cin >> sx >> sy >> tx >> ty;
dx = tx - sx;
dy = ty - sy;
//root = NULL;
//root = '\0';
root = 'R';
for (i=1; i<dx; i++){
root = root + 'R';
}
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 100000100LL
int main(){
int A, B, M;
cin >> A >> B >> M;
ll ans = INF, MINa = INF, MINb = INF;
vector<ll> a... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
string s,t; cin >> s >> t;
cout << t+s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
int k;
string ss;
cin>>k>>s;
if(s.length()>k){
for(int i=0; i<k; i++){
ss += s[i];
}
ss+="...";
}
else {
ss =s;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
int n, m;
cin >> n >> m;
int p;
string s;
vector<int>v(n, 0);
int c = 0, w = 0;
rep(i, m) {
cin >> p >> s;
p--;
if (v[p] != -1) {
if ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int IN... | 0 |
/* 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... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str;
int q;
int a,b;
string p;
string query;
cin>>str;
cin>>q;
for(int i=0;i<q;++i){
cin>>query;
cin>>a>>b;
if(query=="print"){
cout<<str.substr(a,b-a+1)<<endl;
}else if(query=="reverse"){
r... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 303;
const int MOD = 998244353;
int n, k;
char s[N];
vector<int> ones;
int dp[N][N][N];
int f(int x, int use, int sum) {
if (use > k) return 0;
if (x < 0) return sum == 0;
if (~dp[x][use][sum]) return dp[x][use][sum];
int ret = f(x-1, use, sum);
... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <numeric>
#include <ostream>
#include <queue>
#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>... | #include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(i=a;i<b;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define hell 1000000007
using namespace std;
const int N=500;
vo... | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <unordered_map>
#define rep(i,n) for(ll i=0;i<n;i++)
#define repn(i,n) for(ll i=1;i<=n;i++)
using namespace std;
typedef long long ll;
const ll ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(... | 1 |
#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... | //-- In The Name of God --
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define fi... | 0 |
#include <iostream>
int main () {
std::string a, b, c;
std::cin >> a >> b >> c;
if(a.substr(a.size()-1, 1) == b.substr(0, 1) && b.substr(b.size()-1, 1) == c.substr(0, 1)) {
std::cout << "YES" << std::endl;
}else {
std::cout << "NO" << std::endl;
}
} | #include <stdio.h>
int main() {
char str[31], ctr = 0;
scanf("%[^\n]", str);
for(int i = 0; str[i] != '\0'; i++) {
if(str[i] == ' ' && str[i-1] == str[i+1]) {
ctr++;
}
}
if(ctr == 2) {
puts("YES");
}
else {
puts("NO");
}
return 0;
} | 1 |
#include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ri register int
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
const int rlen=1<<18|1,inf=0x3f3f3f3f;
const ll Inf=1e18;
char buf[rlen],*ib=buf,*ob=buf;
#d... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
#define all(x) x.begin(),x.end()
const int maxn = 100010;
const int INF = INT_MAX/2;
int n;
vector <pi> v;
int pre[maxn],suf[maxn];
int ... | 1 |
#include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, q, inf=2e9, cnt;
vector<int> par ;
vector<pair<int,pair<int,int> > > v;
map<int,int> id ;
int tree[3000006];
void update(int node, int s, ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 6010;
int MOD;
int dp[N][2*N];
int add(int a, int b){
return (a + b) % MOD;
}
int mul(ll a, int b){
return (a * b) % MOD;
}
void sadd(int &a, int b){
a = add(a, b);
}
int main(){
ios::sync_with_stdio(0), cin.ti... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i=(s);(i)<(int)(e);++(i))
#define REP(i,e) FOR(i,0,e)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define ppb(x) pop_back(x)
#define mp make_pair... | 0 |
#include <cstdio>
#include <cassert>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
using namespace std;
void erase1(multiset<int> &s, int x) {
auto it = s.find(x);
if (it != s.end()) s.erase(it);
}
const int INF = 1<<30;
vector<int> solve(int H, int W, const int *L,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
map<int, int> MA;
multiset<int> MS;
for (int i = 0; i < W; i++) MA[i] = i, MS.insert(0);
for (int h = 1, A, B; cin >> A >> B; h++) {
auto it = MA.lower_bound(--A);
int tmp = -1;
while (it != MA.end() && it -> fi... | 1 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=2005,Mod=1e9+7;
int dp[N][N],fac[N*N],inv[N*N];
inline int C(int n,int m){
return 1ll*fac[n]*inv[m]%Mod*inv[n-m]%Mod;
}
inline int qpow(int a,int b){
int ans=1;
while (b){
if (b&1) ans=1ll*ans*a%Mod;
a=... | #include <iostream>
#include <vector>
#include <string>
#include <climits>
#include <algorithm>
using namespace std;
string a;
int d,n,mod=1e9+7;
int digitSum(int idx,int sum,bool tight,vector<vector<int> > &dp){
if(idx==n)
return sum==0?1:0;
if(!tight&&dp[n-idx-1][sum]!=-1)
return dp[n-idx-1][sum];
int ans =0;... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
vector<int> num(3);
rep(i, 3) cin >> num.at(i);
for(int i = 1; i < 3; i++) {
int tmp = 0;
tmp = num.at(0);
num.at(0) = num.at(i);
... | #include <iostream>
#include <vector>
using namespace std;
void abc_160a();
void abc_161a();
int main()
{
//abc_160a();
abc_161a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else cout << "No\n";
}
void swap(int& a, int& b)
{
int tmp;
tmp = a;
a ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int insertionSort(vector<int> &A, int N, int g, int &cnt){
for(int i = g; i < N; i++){
int v = A.at(i);
int j = i - g;
while(j >= 0 && A.at(j) > v){
A.at(j+g) = A.at(j);
j = j - g;
cnt++;
}
A.at(j+g) = v;
}
}
void shellSort(vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
void insertion_sort(vector<int>& A, int n, int g, int& cnt)
{
for (int i = g; i < n; ++i) {
int key = A[i];
int j = i - g;
while (j >= 0 && A[j] > key) {
A[j + g] = A[j];
j -= g;
++cnt;
}
... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll s;
cin >> s;
int cnt = 0;
ll S = s;
while(S > 0){
S /= 10;
cnt++;
}
const int f = 753;
int ans = 1000;
for(int i = 3; i <= cnt;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
long long n,q;
cin >> n >> q;
long long s[n],t[n],x[n],d[q];
pair<long long, int> p[n];
for(int i=0;i<n;i++){
cin >> s[i] >> t[i] >> x[i];
p[i]=make_pair(x[i], i);
}
sort(p, p+n);
vector<pair<long long, int> > vec;
... | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
... | 0 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#define int long long
#define dotimes(i, n) for (int i : range(n))
using namespace std;
class range {
class iterator {
int i, s;
public:
iterator(int i, int s): i(i), s(s) {}
int& operator*() {
return i;
}
void operator++() {
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#include <iomanip>
#include <assert.... | 1 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 999999999
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define E... | 0 |
#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define per(i, j, k) for (int i = j; i >= k; --i)
#define int long long
using namespace std;
const int N = 1000001;
int a[N], sum[N];
inline int read() {
int x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag... | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const... | 1 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAXN = 15;
struct edg{
int s, e, x;
};
vector<edg> v;
int cyc[1 << MAXN];
int dp[1 << MAXN][MAXN];
int adj[MAXN][MAXN];
int n, m;
int main(){
scanf("%d %d",&n,&m);
for(int i=0; i<MAXN; i++){
for(int j=0; j<MAXN; j++){
adj[i][j] =... | #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=17;
const int P=1000000007;
const db eps=... | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip> //cout << fixed << setprecision(15) << x << endl;
using namespace std;
typedef long long ll;
const ll INF = 1e... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.