code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 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;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> ti;
ll mod=1E9+7;
#define REP(a,b,c) for(ll a=b;a<(c);a++)
#define PER(a,b,c) for(ll a=b;a>=(c);a--)
ll ii(){ ll x; cin >> x; return x; }
s... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef tuple<int, int, int, int> T;
int H, W;
int a[510][510];
vector<T> ans;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> H >> W;
rep(i, H) rep(j, W) cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | 1 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(void) {
int H, W;
scanf("%d %d", &H, &W);
string s[50];
for (int i = 0; i < H; i++) {
cin >> s[i];
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
bool paintable = false;
if (s[i][j] != '#') continue;
... | 1 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
char c;
bool zf=0;
while(((c=getchar())<'0'||c>'9')&&c!= '-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
int tot[26];
signed... | 0 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int dist[1005][1005];
int dx[4] = {-1,1,0,0};
int dy[4] = {0,0,-1,1};
int main(){
int h,w;cin >> h >> w... | #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>
#include <stdio.h>
#include <... | 0 |
#include <iostream>
#include <string>
using namespace std;
long long solve(long long x){
if(x <= 6){
return 1;
}
if(x <= 11){
return 2;
}
long long res;
res = x % 11;
if(res == 0){
return x / 11 * 2;
}
if(res <= 6){
return x / 11 * 2 + 1;
}
els... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
// freopen("in" , "r", stdin );
// freopen("out", "w", stdout);
#endif
ios::sync_with_stdio(0); cin.tie(0);
strin... | 0 |
#include<bits/stdc++.h>
// DEEP
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fwd(i,a,n) for(int i=a;i<=n;i++)
#define bak(i,a,n) for(int i=a;i>=n;i--)
#define all(v) v.begin(),v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair
typedef... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | 0 |
#include "bits/stdc++.h"
using namespace std;
template<typename Itr>
auto partition2(const Itr first, const Itr last){
auto i=first;
for(auto j=first; j!=last; ++j){
if(*j<=*last){
iter_swap(i, j);
++i;
}
}
iter_swap(i, last);
return i;
}
int32_t main(){
size_t n; cin>>n;
vector<uint32... | #include <iostream>
#include <cassert>
#include <queue>
#define INF 922337203685477580
typedef long long ll;
using namespace std;
int partition(int *A, int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= x) {
i++;
int a = A[i];
A[i] = A[j];
A[j] = ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> v(n);
for(int i = 0;i<n;i++)
{
cin>>v[i];
}
int minsofar = INT_MAX;
int count = 0;
for(int i = 0;i<n;i++)
{
minsofar = min(minsofar,v[i]);
if(v[i] <= minsofar)
... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x.size())
#define FOR(x,y,z) for(int x = y; x <= z; x++)
#define int long long
const int N = 1e5 + 2, inf = 1e18;
int32_t main(){
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, m;
cin >> n >> m;
if(n > m)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
int n;
string s, temp;
vector<int> vec;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
cout << 0 << "\n";
cout.flush();
cin >> s;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
int n;
scanf("%d", &n);
int arr[n + 1];
map<int, int> mp;
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
if (mp[arr[i]] == 0) mp[arr[i]] = 1;
else mp[arr[i]] = 0;
}
l... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int x;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int tmp=0;
int ans=0;
while(tmp<n){
int tmp2=a[tmp];
int cnt=0;
while(tmp<n&&a... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; //10^9
const ll inff = 1000000000000000000; //10^18
int main(){
string s;
cin >> s;
int n = s.s... | #include <iostream>
#include <string>
#include <map>
#include <string.h>
using namespace std;
int main(){
map<char,int> ch;//文字の数字辞書登録
ch['I']=1;
ch['V']=5;
ch['X']=10;
ch['L']=50;
ch['C']=100;
ch['D']=500;
ch['M']=1000;
int ans=0;
int len=0;
char s[1111];
while(cin >> s){
len=strlen(s);
... | 0 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define debug(s, param) std::cerr << s << param << std::endl;
using names... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
const ll mod = 1e9+7;
const ll INF = 1e18;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define Rep(i,a,n) for (ll i = (a); i < (n); ++i)
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
u... | 1 |
#include <stdio.h>
#include <set>
using namespace std;
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int main(){
int n,ans,temp;
set<long long int> s;
scanf("%d%d",&n,&ans);
n--;
while(n--){
scanf("%d",&temp);
ans=gcd(ans,temp);
}
for(long long int i=1;i*i<=ans;i++)if(ans%i... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int N, M;
scanf("%d", &N);
scanf("%d", ... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t n;
cin >> n;
int64_t a[n+1];
for(int i = 0; i < n; i++){
cin >> a[i];
}
a[n] = 100000001;
sort(a,a+n);
int64_t ans = 0,count = 1;
for(int i = 0; i < n; i++){
if(a[i] == a[i+1]){
count++;
}else{
if( (cou... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
int main(){
int m,n;
priority_queue<int> que;
while(cin>>n>>m,m|n){
int sum=0;
for(int i=0;i<n;i++){
int p;
cin>>p;
que.push(p);
}
vector<i... | #include<iostream>
using namespace std;
long long cnt = 0;
void merge(int* arr, int left, int mid, int right) {
int len1 = mid - left + 1;
int len2 = right - mid;
int* tempL = new int[len1];
int* tempR = new int[len2];
for (int i = 0; i < len1; i++)tempL[i] = arr[left + i];
for (int i = 0; i < len2; i++)tempR[i] ... | 0 |
#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int&
#define I inline
#define W while
#define N 300
#define X 998244353
#define Inc(x,y) ((x+=(y))>=X&&(x-=X))
using namespace std;
int n,m,a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
string S;
int K, M;
int memo[400][400][400];
bool visited[400][400][400];
map<int,int> memo_g;
int g(int q) {
if (memo_g.count(q)) return memo_g[q];
int r = 0, qq = q;
while (qq >= 0 && S[qq] == '1') { -- qq; ++ r; }
retu... | 1 |
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int cnt[N],ans[N],a[N];
int n,q,bl;
int res;
struct node
{
int l,r,p;
}e[N];
bool cmp(const node &a,const node &b)
{
return (a.l/bl)==(b.l/bl) ? a.r<b.r :a.l>b.l;
}
void remove(int x)
{
if((--cnt[a[x]]... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,pt... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
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) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
class BVCC{
private:
vector<int> ord,low,used;
vector<vector<int>> g;
vector<vector<P<int,int>>> bc;
... | 0 |
#include<iostream>
using namespace std;
int main(){
int N,a,b,c,d;
int i,j;
int t[101]={0};
int r[101];
for(i=0;i<101;i++){
r[i]=1;
}
cin>>N;
for(i=0;i<N*(N-1)/2;i++){
cin>>a>>b>>c>>d;
if(c>d){
t[a]=t[a]+3;
}
else if(c<d){
t[b]=t[b]+3;
}
else{
t[a]=t[a]+1;
t[b]=t[b]+1;
}
}
for(i=1;... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define INF (1LL << 63)
struct edge{
size_t to;
size_t weight;
};
vector<size_t> dijkstra(vector<vector<edge>>& Graph, int& startPoint, int& vertexNum){
vector<size_t> minimumWeight(vertexNum,INF);
priority_queue<vector<pair<size... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
string S; cin >> S;
int ans = 10000;
rep(s, S.size() - 2) {
string T = S.substr(s, 3);
int x = 0;
rep(i, 3) x = x * 10 + (T[i] - '0');
ans = min(ans, abs(753 - x));
}
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
const int N=2e6;
int gi() {
int w=0;bool q=1;char c=getchar();
while ((c<'0'||c>'9') && c!='-') c=getcha... | 0 |
#include <cstdio>
#define F(i, a, b) for (LL i = a; i <= b; i ++)
#define G(i, a, b) for (LL i = a; i >= b; i --)
#define pf printf
typedef long long LL;
const LL N = 1e7 + 10;
const LL M = 20;
using namespace std;
LL D, L, Ans, Sum, total, w[M];
LL ten[M], v[M], tot[M], TOT[M];
void Dfs(LL k, LL s, LL S) {
if (... | #include <iostream>
#include <vector>
#include <ios>
#include <limits.h>
using namespace std;
#define FOR(i, s, e) for(int i = s; i < e; ++i)
typedef vector<long> vec;
long long c = 0;
void Merge(vec& vA, int l, int m, int r)
{
int n1 = m - l;
int n2 = r - m;
vec vL(n1 + 1, 0);
vec vR(n2 + 1, 0);
FOR(i, 0, n1) vL... | 0 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
//#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000000... | 0 |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
typedef pair<int,int>P;
#define F first
#define S second
int a[100009][20];
int b[100009];
int n,L,test;
signed main(){
cin>>n;
r(i,n) cin>>b[i];
cin>>L;
r(j,20){
if(j==0){
int id=0,sum=0;
r(i,n){
w... | #include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
const int N = 100100;
int n, x[N], L, Q, dp[N][17];
void calc() {
for (int i = 0; i < N; i++)
for (int j = 0; j < 17; j++)
dp[i][j] = inf;
for (int i = 1; i <= n; i++) {
auto it = upper_bound(x + 1, x + 1 + n, x[i] + L);
it--;
dp[i][0] =... | 1 |
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print() { cout << endl; }
template<typename Head,typename... Tail> void print(Head head,Tail... tail){cout<<head;if(sizeof...(Tail)>0)cout<<" ";print(tail...);}
void print0() {}
template... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL <<60;
int main(void){
long long res=0;
long long i,j,k;
long long l,m,h;
string s;
long long n_r=0,n_g=0,n_b=0;
long long n_max=4010;
long long n;
long r[n_max]={},g[n_max]={},b[n_max]={};
cin>>n;
cin>>s;
for(i=0;i<n;i... | 1 |
#include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>
#include<map>
#include<cstring>
#define p pair<int,int>
#define P pair<int,p>
using namespace std;
P a[100000];
int Par[10000], Rank[10000];
int saiki(int b) {
if (Par[b] == b)return b;
retu... | 0 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL <... | 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(... | #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;
int main() {
ios::sync_with_stdio(fal... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m,i,j;
while(cin >> n >> m, n && m){
int ret = 0;
vector<int> data(n+1);
vector<int> all;
for(i=0;i<n;i++)cin >> data[i];
for(i=0;i<n+1;i++)
for(j=i;j<n+1;j++)
all.push_back(data[i]+data[j]);
sort(al... | #include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<fstream>
using namespace std;
typedef pair<int,pair<int, int> > P;
int main() {
while (1) {
int h, w;
vector<P> pos;
cin >> h >> w;
if (h == 0)break;
int X = pow(h, 2) + pow(w, 2);
//cout << X << endl;
for (int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int x, y;
cin >> x >> y;
int total = 0;
if (x <= 3)
total += 4 - x;
if (y <= 3)
total += 4 - y;
if (x == 1 && x == y) {
total += 4;
}
total *= int(1e5);
cout << total;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define mod 1000000007
#define inf 1000000000
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a,ll b){return b ? gcd(b,a%... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define read(n) cin>>n;
#define write(n) cout<<n;
#define loop(x,n) for(int x = 0; x < n; ++x)
#define vector_loop(x,n) for(int i = 0; x < n; i++)
#define vii vector<int> a(n)
typedef pair<int, int> pii;
#define endl "\n"
#define sd(val) scanf("%d", &val)
#define ss(val) sc... | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a,ans;
cin>>a;
ans=a+pow(a,2)+pow(a,3);
cout<<ans<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
auto check = [&](char out0, char out1) {
auto a = out0;
char out2;
auto v = vector<char>();
v.push_back(out0);
v.push_back(out1);
auto f = [](char in1, char out0, ... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI aco... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
string s; cin>>s;
cout<<s.substr(0,s.length()-8)<<'\n';
return 0;
}
| #include <iostream>
#include <numeric>
#include <math.h>
#include <algorithm>
#include <float.h>
#include <limits>
#include <vector>
#include <string.h>
#include <iomanip>
#define rep(i,a,n) for(ll int (i) = (a);(i) < (n);(i)++)
#define urep(i,a,n) for(ll int (i) = (a);(i) > (n);(i)--)
#define MOD 1000000007
#define ... | 1 |
#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
#include<string>
#include<iomanip>
#include <numeric>
#include <limits>
using namespace std;
int main()
{
int n,g=0; cin>>n;
while(n>=3)
{
g++; n-=3;
}
cout<<g;
return 0;
} | #include <iostream>
using namespace std;
int main (){
int N;
cin>>N;
cout<<N/3;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
string s, t;
cin >> s >> t;
cout << t << s << endl;
return 0;
}
| 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<bits/stdc++.h>
using namespace std;
int main(){
int a[6] = {};
while(scanf("%d",&a[0])!=EOF){
for(int i=1;i<5;i++)scanf(",%d", &a[i]);
int cnt=0,flag=true,card[13]={},max = 4;
sort(a,a+5);
for (int i=0;i<4;i++)for(int j=i+1;j<5;j++)
if (a[i]==a[j])cnt++;
int i=0;
if(a[i]==1&&a[i+1]==10){
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if(s[0]=='S' && s[2]=='N')
cout<<7-0;
else if(s[2]=='T')
cout<<7-6;
else if(s[0]=='F')
cout<<7-5;
else if(s[2]=='U')
cout<<7-4;
else if(s[0]=='W')
cout<<7-3;
else if(s[2]=... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
#define itn int
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int ... | 0 |
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF=1e+9;
const int MOD=1e+9+7;
//REPマクロ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
// ... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
vector<int> W(N,0);
for(int i=0;i<N;i++){
if(i==0 && S.at(i)=='W') W.at(i) = 1;
else if(i==0 && S.at(i)=='E') W.at(i) = 0;
else if(S.at(i)=='W') W.at(i) = W.at(i-1) +1;
else W.at(i) = W.at(i-1);
}
in... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>... | 0 |
// https://atcoder.jp/contests/abc152/tasks/abc152_c
#include <bits/stdc++.h>
using namespace std;
int main()
{
long a, b;
cin >> a >> b;
long ans = 0;
for (int x = a; x <= b; x++)
{
string s, t;
s = to_string(x);
t = s;
reverse(t.begin(), t.end());
if (s ==... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
int c;
int sum = 0;
cin >> a >> b;
c = a;
for (int i= 0; i < b-a+1; i++)
{
if (c/10000 == c-(c/10)*10 && c/1000 - (c/10000)*10 == c/10 - (c/100)*10 )
{
sum += 1;
c++;
continue;
}
else
{
c++;
continue;
}
}
cout... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> FordFulkerson_dfs_sub(
const vector<map<int, int>>& graph, // source, (target, capacity)
int source, int target, set<int>& prev)
{
if(source==target) return vector<int>{source};
for(auto v : graph.at(source)){
if(v.second == 0) continue;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> ab(N, vector<int>(2));
for (int i = 0; i < N; i++) {
cin >> ab.at(i).at(1) >> ab.at(i).at(0);
}
vector<vector<int>> cd(N, vector<int>(2));
for (int i = 0; i < N; i++) {
cin >> cd.at(i).at(0) >> cd.at(... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A+B<=16 && A<=8 && B<=8) cout << "Yay!" << endl;
else cout << ":(" << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
int a, b,sum=16;
cin >> a >> b;
int s = max(a, b) - min(a, b);
if (s ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, cnt = 0;
cin >> N;
vector<long long> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
if (vec[i] % 2 != 0) {
cout << cnt << endl;
return 0;
}
}
while (true) {
for (int... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int kai(int a) {
int n = 0;
while (1) {
if (a % 2 == 0) {
a = a / 2;
n++;
}
else break;
}
return n;
}
int main() {
int N;
cin >> N;
vector<int> A(N);
int count = 100000;
for (int i = 0; i < N; i++) {
cin ... | 1 |
#include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &a_rviTarget, vector<int> &a_rviSearch)
{
int iTargetCnt;
cin >> iTargetCnt;
a_rviTarget.resize(iTargetCnt + 1);
for (int i = 0; i < iTargetCnt; i++)
cin >> a_rviTarget[i];
int iSearchCnt;
cin >> iSearchCnt;
a_rvi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N,Q;
cin >> N >> Q;
ll S[N],T[N],X[N];
vector<ll> vect;
vect.push_back(-Mod * 1000LL);
vect.push_back(Mod * 1000LL);
for (int i = 0; i < N; i... | #include <iostream>
#include <vector>
using namespace std;
const int V_MAX = 100000;
struct LowLink
{
const vector<vector<int>> &g;
int V;
vector<vector<int>> dfs_tree;
vector<int> dfs_roots;
int pre_order[V_MAX];
int p_ord = 0;
int lowlink[V_MAX];
bool articulation[V_MAX] = {};
vector<pair<int, int>> bridge;... | 0 |
#include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define db double
#define inf 301
#define INF (... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const ... | 0 |
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof (x))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define Fod(i,b,a) for (int i=(b);i>=(a);i--)
#define fi first
#define se second
#define kill _z_kill
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define outval(x) cerr<<#x" = "<<x<<endl
#define ou... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
string S;
cin >> S;
if(S=="hi"||S=="hihi"||S=="hihihi"||S=="hihihihi"||S=="hihihihihi"){
co... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
while(getline(cin,s)||!cin.eof()){
for(int i=0;i<25;i++){
if(s.find("the")!=-1||s.find("this")!=-1||s.find("that")!=-1)break;
else for(int j=0;j<s.size();j++)if(s[j]>='a'&&s[j]<='... | #include<stdio.h>
#include<string.h>
int main(){
char s[85];
int i;
memset(s,'0',sizeof(s));
while(fgets(s,83,stdin)){
while(1){
for(i=0;i<81;i++){
switch(s[i]){
case '.':
case ' ':
case '0':
case '\0':
case 10:
case 13:
continue;
}
s[i]='a'+(s[i]-'a'+1)%26;
}
i... | 1 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n+1);
for(int i = 1; i < n+1; i++){
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M{};
cin >> N;
vector<int> a(N+1), b(N+1);
for (int i = 1; i <= N; ++i) {
cin >> a[i];
}
for (int i = N; i; --i) {
int s{};
for (int j = 2*i; j <=N; j += i) s += b[j];
if (a[i] != s%2) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=2005;
int T,n,m,a[maxn<<1][maxn<<1],now;
int b[maxn<<1][maxn<<1],c[maxn<<1][maxn<<1],d[maxn<<1][maxn<<1];
bool vis[maxn][maxn];
inline int read(){
int res=0,f_f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f_f=-1;ch=getchar();}
while(ch>=... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | 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;
cin >> n;
int a;
ll ans = 0;
int m = 2e9;
int cnt = 0;
rep(i, n){
cin >> a;
if (a < 0) {
cnt++;
a *= -1;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<... | 1 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
// #include <prettyprint.hpp>
using namespace std... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e8;
int cal(vector<P> A) {
sort(A.begin(), A.end());
int res ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, s, x, p;
deque<pair<int, long long> > d;
long long amx(int a) {
if(s >= d.back().first) {
return s - d.front().first;
} else if(s <= d.front().first) {
return d.back().first - s;
}
int na;
long long D = d.back().first - d.front().first;
if(d.front().secon... | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> a(N, vector<int>(M));
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
cin >> a[i][j]; --a[i][j];
}
}
int ans = -1;
for (int n = 1; n <= N; ++n) {
vector<bool> sports... | 0 |
#include <iostream>
using namespace std;
int main()
{
long long int s=0,r1,r2;
cin>>r1>>r2;
if(r1==1)
s+=300000;
if(r1==2)
s+=200000;
if(r1==3)
s+=100000;
if(r2==1)
s+=300000;
if(r2==2)
s+=200000;
if(r2==3)
s+=100000;
if(r1==1 &&r2==1)
s+=400000;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
using namespace std;
long long mod = 1000000007;
long long pow(long long x, long long k)
{
if (k == 0)
{
return 1LL;
}
long long temp = pow(x, k / 2);
... | 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 <cstdio>
#include <cstring>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, m;
char s[1001];
char t[1001];
int dp[1001][1001];
int main(){
scanf("%s%s", s, t);
n = strlen(s);
m = strlen(t);
rep(i, n + 1){
dp[i][0] = i;
}
rep(i, m + 1){
dp[0][i] = i... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct data_t {
string name;
double eff;
bool operator<(const data_t& right) const {
if (eff == right.eff) {
return (name < right.name);
}
else {
return (eff > right.eff);
}
}
};
int main(void) {
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template<class T> void vin(vector<T>& v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
struct f {
stri... | 1 |
#include<stdio.h>
int main()
{
char S[110];
char T[110];
scanf("%s%s", S, T);
printf("%s%s", T, S);
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | 0 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using Pint = pair<int,int>;
const ll mod = 1e9+7;
int main(){
string s, t;
ci... | #include <stdio.h>
int main(){
int s[100];
int t[100];
scanf ("%s %s",s,t);
printf("%s%s\n",t,s);
return 0;
} | 1 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 2000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline int read()
{
int x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=... | 1 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | #include<iostream>
using namespace std;
struct ST{
int a;
int b;
int c;
int an;
};
int reset(int, int */*[100 + 10]*/);
int main()
{
int ans[1000 + 10];
ST res[1000 + 10];
int an, bn, cn, n;
int ml;
int ln;
int i, j;
int af, bf, cf;
while (cin >> an >> bn >> cn, an != 0 && bn != 0 && cn != 0)
{
... | 1 |
#include <iostream>
using namespace std;
int main(){
int day30[4] = {4,6,9,11};
while(1) {
int m,d;
cin >> m >> d;
if(m == 0 && d == 0) break;
int a = 1,b = 1,count = 0;
while(1) {
if(a == m && b == d) break;
b++;
count++;
if(a == 2 && b == 30) {
a++;
b = 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> hand(5);
char c;
while(cin >> hand[0]>>c>>hand[1]>>c>>hand[2]>>c>>hand[3]>>c>>hand[4]){
vector<int> cnt(15, 0);
for(int i=0; i<5; i++){
cnt[hand[i]]++;
if(hand[i] == 1) cnt[14]++;
}
bool flag = false;
// fou... | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include<bits/stdc++.h>
using namespace std;
int read(){
int x=0; char c=getchar(); int flag=1;
while(!isdigit(c)) { if(c=='-') flag=-1; c=getchar(); }
while(isdigit(c)) { x=((x+(x<<2))<<1)+(c^48); c=getchar(); }
return x*flag;
}
const int mod=1e9+7;
int n,k;
int dp[2005][2005];//i个白球，j种颜色
int fac[4000005],Inv... | 1 |
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
int a, b, sum, c = 1;
cin >> a >> b;
sum = a;
if(b == 1){
cout << 0;
}
else if(b <= a){
cout << 1;
}
else{
while(1){
sum = sum + (a - 1);
c++;
if(sum ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ZERO_IQ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x, y) cerr<<(#x)<<" " <<(#y)<<" is " << (x) <<" "<< (y) << endl
#define debug2(x, y, z) cerr<<(#x)<<" " <<(#y)<<" " <<(#z)<<" is " << (x) <<" "<< (y) <<" "<<(z) << e... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 0 |
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdio>
using namespace std;
int S[100],R[100];
main(){
int N,i=0,a,b,c,d;
vector<pair<int,int> >v;
scanf("%d",&N);
for(;i<N*(N-1)/2;i++){scanf("%d%d%d%d",&a,&b,&c,&d);if(c==d)c=d=1;else if(c>d)c=3,d=0;else c=0,d=3;S[a-1]+=c,S[b-1]+=d;}
for(i=... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
using namespace std;
#... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
int h[6];
int sq(int n){
return n*n;
}
int find( int n , int s = 0 ){
int count = 0, m = -1, mm = 0;
for(int i = s; i < 6; i++){
if( m == h[i] ){
count++;
}else{
if( count == n ){
mm = m;
... | #include <bits/stdc++.h>
using namespace std;
int solve(int N, int P) {
int p = P;
vector<int> have(N, 0);
int turn = 0;
while (1) {
if (p > 0) {
--p;
if (++have[turn] == P) return turn;
}
else {
swap(p, have[turn]);
}
turn = (turn + 1) % N;
}
}
int main() {
int N, P;
while (cin >> N >> P, ... | 0 |
#include <cstdio>
int matrix[12][12];
int n;
int main() {
while(scanf("%d", &n) != EOF, n) {
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
scanf("%d", &matrix[i][j]);
}
}
// output
for (int i=0; i<n; i++) {
int sum = 0;
for (int j=0; j<n; j++) {
sum += matrix[i][j];
... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } ret... | 0 |
// #include<bits/stdc++.h>
// using namespace std;
// int main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// int tc;
// cin >> tc;
// while(tc--){
// string s;
// cin >> s;
// int count_0 = 0, count_1 = 0;
// for(char ch : s)
// count_0 += 1 - ch + '0', count_1 += ch - '0';
// int ... | #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<bits/stdc++.h>
#define FOR(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define FORN(i,b,a)for(int i=(b);_a=(a);i>=_a;i--)
#define REP(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define re return
#define vi vector<int>
#define pb push_back
#define si set<int>
#define in insert
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll & a, ll b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll & a, ll b) { if (b > a) { a = b;... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
int main(){
// 1. 入力情報.
char c[2020];
int w;
scanf("%... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int w;
cin>>w;
for(int i = 0;i<s.size();i++){
if(i%w==0){
cout<<s.at(i);
}
}
}
| 1 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){... | #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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0);... | 1 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vecto... | 0 |
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
constexpr int MOD = 1e9 + 7;
template <typename T>
T mypow(T a, T b)
{
if (b == 0)
return 1;
T tmp = mypow(a, b / 2);
if (b % 2)
return (((tmp * tmp) % MOD) * a) % MOD;
else
return (tmp * tmp) % MOD;
}
int n,... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) pu... | // C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(ll __x = __start; __x < __end; __x++)
int main() {
int n; cin >> n;
vector<int> A(n);
loop(i,0,n) cin >> A[i];
map<int, int> C_ODD, C_EVEN;
loop(i,0,n) {
if (i&1) C_ODD[A[i]]++;
else C_E... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int arr[200001];
int main()
{
fast_io;
int n;
cin >> n;
set <int> s;
for(int i =0 ; i < n; i++)
{
int x;
cin >> x;
s.insert(x);
... | #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())... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;
ll x[301];
int N;
ll dp1[301][100001]; // 3-color
ll dp2[301][100001]; // 2-color
int main() {
cin >> N;
ll S = 0;
ll ans = 1;
for(int i = 0; i < N; i++) {
cin >> x[i];
S += x[i];
a... | #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;
const int MOD=998244353;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
ll ppow(ll a,ll b){
a%=MOD;
ll res=1;
while(b){
if(b&1)res=(res*a)%MOD;
a=(a*a)%MOD;
b>>=1;
... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for(int i = (a); i < (int)(b); i++)
#define pw(x) (1LL<<(x))
static const int fast_io = [](){io... | #pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x... | 0 |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp>
//#include <functional> // for less
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF ... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a;
cin >> a;
int vmax = a;
int g = a;
for (int i = 1; i < n; ++i) {
cin >> a;
g = __gcd(g, a);
vmax = max(a, vmax);
}
cout << (k / g * g == k && k <= vmax ? "POSSIBLE" : "IMPOSSIBLE") ... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define maxn 101
#define Max 10000
using namespace std;
int n,ans=0;
int map[maxn][maxn];
//struct edge
//{
// int u;
// int w;
// edge(int u=0,int w=Max):u(u),w(w){}
// bool operator <???(const node& rhs) const
// {
// return w>rhs.w;
// }
//};
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>v;
int answer=0;
for(int i = 0 ; i< 2*n ;i++){
int k;
cin>>k;
v.push_back(k);
}
sort(v.begin(),v.end());
for(int i = 0 ; i < 2*n ; i+=2){
answer+=min(v.at(i),v.at(i+1));
... | 0 |
#include <iostream>
using namespace std;
int main(void){
// Here your code !
int d;
int s;
while(cin>>d){
s=0;
for(int i=1;i<=(600/d)-1;i++){
s=s+d*(d*i)*(d*i);
}
cout<<s<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int d, s;
int main() {
while (scanf("%d",&d) != EOF) {
s = 0;
for (int i = d; i <= 600-d; i += d) s += i*i*d;
printf("%d\n",s);
}
}
| 1 |
#include<bits/stdc++.h>
#define FOR(i,a,b) for (register int i=(a);i<=(b);i++)
#define For(i,a,b) for (register int i=(a);i>=(b);i--)
#define mem(i,j) memset(i,j,sizeof(i))
#define GO(u) for (register int j=f[u];j!=-1;j=nxt[j])
#define fi first
#define se second
#define pii pair<int,int>
#define MP make_pair
using name... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include <iostream>
#include <bitset>
#include <math.h>
#include <algorithm>
#include <vector>;
using namespace std;
int main() {
int d, s, t;
cin >> d >> s >> t;
int m = d / s;
if (d % s != 0) m++;
if (m <= t) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
return 0;
} | 0 |
#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... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using nam... | 0 |
#include <iostream>
#include <math.h>
#include <cstdlib>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <stdio.h>
#include <cstdio>
#include <vector>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;
pair <int,int> T_z[500100], T_or[500100];
int T_l[500100], T_najb[500100], tree[104... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
// #include <prettyprint.hpp>
using namespace std... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m;
bool f[500][500];
bool ans[500];
int a,b;
for(;;){
cin >> n >> m;
if(!n && !m)break;
for(int i=0;i<n;i++){
ans[i] = false;
for(int j=0;j<n;j++)f[i][j] = false;
}
while(m--){
cin >> a >> b... | #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;
int main()
{... | 0 |
#include<iostream>
using namespace std;
int main(){
int n=1;
int a = 0;
int f = 0;
int quest[10000] = { 1 };
double ans[10000];
int checkc = 0;
int i = 4;
double check[3] = { 1, 2, 4 };
do{
cin >> quest[a];
a++;
} while (quest[a-1] != 0);
while (a > f+1){
switch (quest[f]){
case 1:
ans[f] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (... | 1 |
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
using namespace std;
int main ()
{
long long x;
cin >> x;
long long happiness=0;
long long a,b,c;
a=x/500;
b=x%500;
c=b/5;
cout << a*1000+c*5 << endl;
return 0;
}
| #include<iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
int main(){
double x1,x2,y1,y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)) << endl;
}
| 0 |
#include <bits/stdc++.h>
#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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin>>a>>b;
if (a==b)cout<<a*2;
else cout <<max(a,b)*2-1<<endl;
} | 0 |
#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;
char c[55][55];
bool visited[55][55];
int d[55][55];
int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};
queue<P> Q;
int main()
{
int H,W;
cin >> H >> W;
int cntW = 0;
rep(i,H)
{
rep(... | #include <bits/stdc++.h>
using namespace std;
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) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using graph = vector<vector<int>>;
const int dx[4]... | 0 |
#include<cstdio>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(x) ((int)(x).size())
#define rep(i,l,r) for(int i=(l);i<(r);++i)
typedef long long ll;
typedef pair<int,int> pi... | // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include ... | 1 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll INF=1LL<<60;
const int MOD=998244353;
const int N=2e5+5;
int main(){
int N, u, v; cin >> N >> u >> v;
u--, v--;
vector<... | #include<bits/stdc++.h>
using namespace std;
vector<int>adj[100003],leaf;
int par[100003],depth[100005],sparse[100005][20],root=0,lz=0;
int lca(int p,int q)
{
int a,b,c,d,lp,i,j;
if(depth[p]<depth[q])
{
c=p; p=q; q=c;
}
for(j=19;j>=0;j--)
{
if((depth[p]-(1 << j))>=depth[q])... | 1 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// nam... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(... | 1 |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
typedef long long LL;
#define ld long double
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#d... | #include<stdio.h>
#include<string.h>
#include<iostream>
#include <fstream>
#include<iostream>
#include <sstream>
#include<string>
#include <list>
using namespace std;
const int M = 1003;
const int INIT = (M*M + 1);
int C[M][M];// = { 0 };
int countmatchstring(const char* p1, const char*p2, int length1, int length2,in... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) (V).begin(),(V).end()
#define MOD 1000000007
#define mod 998244353
int rw[100010];
vector<int> W[100010];
int main(){
for (int i = 0;i < 100010;i++)rw[i] = -1;
ll N, L;
cin >> N;
vector<ll> X(N);
for (int i = 0;i < N;i++)
cin >> ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
// #include"Template.cpp"
int n, l, q;
vector<int> arr;
vector<vector<int>> table;
void preprocess() {
int curr = 1;
int i = 1;
while(i <= n) {
if(curr == n+1) {
table[i][0] = curr - 1;
i ++;
... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return tru... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
pair<ll, ll> p[n];
ll ans = 0;
for(int i = 0; i < n; i++){
cin >> p[i].first >> p[i].second;
ans += 0 - p[i].second;
}
ll q[n];
for(int i = 0; i < n; i++){
q[i] = p[... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
long x;
cin >> x;
vector<long> a(n);
for (long &x : a) {
cin >> x;
}
long count = 0;
for ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
using namespace std;
typedef long... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.