code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
/*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) n... | // A - Rated for Me
#include <bits/stdc++.h>
using namespace std;
int main(){
int r; cin>>r;
if(r < 1200) puts("ABC");
else if(2800 <= r) puts("AGC");
else puts("ARC");
}
| 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
const int INF=1001001001;
int main() {
int64_t N;
cin>>N;
int x=N;
string t;
while(x){
int r=x%(-2);
if(r<0){r+=2;}
x-=r;
x/=(-2);
t+=(char)('0'+r);
}
reverse(t.begin(),t.end());
if(t==""){t='0';}
cout<<... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long int n , id , price , num, cnt;
while(cin >> n , n!=0){
vector<long long int> p(4001,0);
vector<int> a;
while(n--){
cin>>id>>price>>num;
if(find(a.begin(),a.end(),id)==a.end()) a.push_back(id);
p[id]... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
using namespace std;
int main(void) {
int n;
while(cin >> n){
if( n == 0 ) break;
vector<int> a(n);
for(int i=0; i<n; i++) cin >> a[i];
vector<int> dp(n+5, 0);
for(int i=... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for(int i = 1; i <= n; i++) {
bool flag = false;
if(i % 3 == 0) {
flag = true;
}
int j = i;
while(1) {
... | #include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void readin(T &x) {
x = 0;
T fh = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') fh = -1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);
x *= fh;
}
inline void d_read(... | 0 |
// Written by newbiechd
#include <cstring>
#include <iostream>
#include <string>
const int maxN = 13;
int n;
char col[maxN][maxN];
bool vis[26];
void dfs(int x, int y, char c) {
if (x > n) {
int val = 0;
memset(vis, 0, sizeof(vis));
for (int j = 1; j <= n; ++j) vis[col[1][j] - 'a'] = 1;
for (char t =... | #include<bits/stdc++.h>
using namespace std;
const int N = 123456;
int n, a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int type = 1;
while (1) {
int even = 0;
for (int i = 1; i <= n; ++i) {
if (!(a[... | 0 |
#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>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 10000000... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#inclu... | 0 |
#include <cstdio>
using namespace std;
typedef long long int LLI;
LLI d;
int main() {
while (1) {
if (scanf("%lld", &d) != 1) break;
LLI ans = 0;
for (LLI i=0; i<600; i+=d) {
ans += i*i*d;
}
printf("%lld\n", ans);
}
} | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int f(int);
int integral(int);
int main(void) {
int a, b;
while(cin >> a >> b) {
cout << integral(a) << endl;
cout << integral(b) << endl;
}
return 0;
}
int integral(int d){
int n = 600 / d;
int sum = 0;
for (int i = 1; i < n; ... | 1 |
#include<stdio.h>
int main(){
int A, B;
int mark =0;
scanf("%d %d", &A, &B);
char in[A+B+1];
scanf("%s", in);
int ctr = 0;
for(int i = 0; i < A+B+1 ; i++){
if(in[i] == '-' && i == A){
mark = 1;
}else if(in[i] >= '0' && in[i] <= '9' ){
++ctr;
}
}
if( mark == 1 && ctr == A+B){
printf("Yes\n");
}el... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1;... | 0 |
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n, m;
int p[1003];
void solve() {
sort(p, p + n);
reverse(p, p+n);
int ans = 0;
rep(i, n) ans += p[i];
for (int i = 0; i + m - 1 < n; i += m) {
ans -= p[i + m - 1];
}
... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fa... | 0 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 1 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<int>> campas(h, vector<int>(w));
for (int i=0; i<h; i++){
string s;
cin >> s;
for (int j=0; j<w; j++){
if (s[j] == '#') campas[i][j] = 1;
else campas[i][j] = 0... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include ... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
using namespace std;
void b_power_socket(void) {
int a, b;
cin >> a >> b;
int sum = 1;
int cnt = 0;
while (sum < b) {
sum += (a - 1);
cnt++;
}
cout << cnt << endl;
}
int main()
{
b_power_sock... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
string m = to_string(n);
int cnt = 0;
rep(i,m.size()){
cnt += m.at(i) - '0';
}
if(n % cnt == 0)cout << "Yes" <<... | #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;
... | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define MAXN 100000
using namespace std;
typedef long long LL;
vector<int> turns[MAXN+5];//用vector来记录每一个循环
LL k;
int n,m,tcnt=0,chs[MAXN+5],id[MAXN+5],id2[MAXN+5];
//id存的是单次操作之后的状态,id2存的是k次操作之后的操作
LL x[MAXN+5],a[MAXN+5];
LL a2[MAXN+5],x2[MAXN+5];
/... | #include<bits/stdc++.h>
//#include<tr1/unordered_map>
//#include"Bignum/bignum.h"
//#define lll bignum
#define ls(x) ( x << 1 )
#define rs(x) ( x << 1 | 1 )
//#define mid ( ( l + r ) >> 1 )
#define lowbit(x) ( x & -x )
#define debug(x) (cout << "#x = " << x << endl)
#define re register
#define For(i, j, k) for(re int i... | 1 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w;
cin >> h >> w;
vector<string> s(h);
int white_cnt = 0;
for (int i = 0; i < h; i++)
{
cin >> s[i];
for (int j = 0; j < w; j++)
{
if(s[i][j] == '.')white_cnt++;
}
}
int dx[] = ... | 0 |
#include<bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main()
{
string s;
cin >> s;
smatch smatch;
if (regex_search(s,smatch,regex("^A[a-z]+C[a-z]+$")))
{
cout << "AC" << endl;
}
else
{
cout << "WA" << endl;
}
} | #include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
string S;
cin >> S;
string ans="AC";
if(S.at(0)!='A') ans="WA";
if('... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#... | #include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 1100000
using namespace std;
char s[N],t[N];
int p[N],head,tail,n,f[N],ans;
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
scanf("%s",t+1);
bool bo=1;
for(int i=1;i<=n;i++) if(s[i]!=t[i]) {bo=0;break;}
if(bo) {printf(... | 0 |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
... | #include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cctype>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%f\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
return 0;
} | 0 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int d, x, y, Y[600];
int i, sum = 0;
for(i = 0;i < 600;i++){
Y[i] = 0;
}
while(cin >> d){
for(i = 1;d*i < 600;i++){
x = d * i;
y = x * x;
Y[i] = y * d;
}
for(i = ... | #include <iostream>
using namespace std;
int main()
{
int d;
while (cin >> d)
{
cout << 72000000 - 180000 * d + 100 * d * d << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long K, x;
string S;
cin >> K >> S;
x = S.size();
if (x > K) S = S.substr(0, K) + "...";
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin>>a>>b>>c>>d;
string ans;
if(a+b>c+d){
ans="Left";
}
else if(a+b<c+d){
ans="Right";
}
else{
ans="Balanced";
}
cout<<ans<<endl;
} | 0 |
#include<stdio.h>
int main(){
char word1[105];
char word2[105];
scanf ("%s %s", &word1, &word2);
printf("%s%s\n",word2,word1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}//MAX
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
//MIN
main() {
string s;
cin >> s;
for(int i=0;i<s.size()-8;i++){
cout << s.at(i);
}
cout << endl;
}
| 0 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i=0; i<N; i++) {
cin >> s;
if (S.count(s)) S.at(s) += 1;
else S[s] = 1;
}
int M;
cin >> M;
for (int i=0; i<M; i++) {
cin >> s;
if (S.count(s)) S.at(s) -= 1;
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | 1 |
//#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
... | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
//PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#defi... | 1 |
/*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB ... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< i... | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<queue>
#include<stack>
#include<complex>
#include<utility>
#include<cmath>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pi acos(-1)
#define all(v) v.beg... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i,a,b) for(ll i=(a);i<ll(b);i++)
#define rep(i,b) loop(i,0,b)
void draw(char g[20][20], int ci, int cj){
g[ci][cj] = '0';
int di[] = {0,0,1,-1};
int dj[] = {1,-1,0,0};
rep(d,4){
int ni = ci + di[d];
int nj ... | 1 |
#include <iostream>
#include <cmath>
using namespace std;
struct Point
{
double x, y;
Point(double x=0, double y=0) : x(x), y(y) {}
double distance (const Point &o) const
{
return sqrt((x - o.x) * (x - o.x) + (y - o.y) * (y - o.y));
}
Point operator+(const Point &o) const
{
... | #include <bits/stdc++.h>
using namespace std;
int main(){
pair<double,double> p1,p2;
cin >> p1.first >> p1.second;
cin >> p2.first >> p2.second;
double dis;
dis=sqrt(pow(p2.first-p1.first,2.0)+pow(p2.second-p1.second,2.0));
printf("%f\n",dis);
return 0;
} | 1 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
constexpr int INF = 1 << 25;
constexpr int MOD = 1000000007;
int main() {
int n, q;
... | #include <iostream>
#include <algorithm>
#include <vector>
typedef std::vector<int> TList;
TList Input()
{
int Count;
std::cin >> Count;
TList List(Count);
for(int i = 0; i < Count; ++i){
std::cin >> List[i];
}
return List;
}
int Count(const TList& S, const TList& T)
{
int Sum = 0;
... | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | #include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
#include <utility>
typedef long long ll;
#define pi 3.14159265358979323... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
struct test{
int Math;
int English;
int Japanese;
};
int n;
double total;
test student;
while(1){
total=0;
cin >> n;
if(n==0)break;
for(int i=0;i<n;i++){
char rank='A';
while(1){
cin >> student.... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; retur... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#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... | 1 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define inf 10000000000... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD... | 1 |
#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;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll i=0; i<N; i++) {
cin >> A[i];
}
string ans = "YES";
sort(A.begin(),A.end());
/*
for (ll i=0; i<N; i++) {
cout << A[i];... | 0 |
//#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 <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
I... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int k;
int numShow = 1;
int minNumber = 9999999;
cin >> n >> k;
for (int i = 0; i < n; i++) {
// 操作Aの処理
for (int a = i; a < n; a++) {
numShow *= 2;
//cout << "a";
// if (numSho... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
int A=1;
cin>>N>>K;
for(int i=0;i<N;i++) {
if (A<K)
A*=2;
else
A+=K;
}
cout<<A<<endl;
} | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#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;
cin >> n;
vector<int> a(n);
... | #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()
{
vector<int> a(5);
rep(i, 5) cin >> a[i];
sort(a.begin(), a.end());
int mx = a[4], mn = a[0];
int k;
cin >> k;
if (abs(mx - mn) <= k)
... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
struct data_t {
string name;
double eff;
bool operator<(const data_t& right) const {
if (eff == right.eff) {
return ( name < right.name ) || ( n... | #include<iostream>
#include<cstdio>
using namespace std;
int u[150][150],p,v[150][150],xg,yg,q,dx[]={1,0,-1,0},dy[]={0,1,0,-1},w,h;
void ret(int x,int y){
int a,b,i;
v[y][x]=1;
if(xg==x&&yg==y)
p++;
else
for(i=0;i<4;i++){
a=x+dx[i];
b=y+dy[i];
if(a<1||a>w||b<1||b>h||v[b][a]==1)
continue;
else if(u[b]... | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
vo... | #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 rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,a,b,i;
cin>>n;
vector<pair<pair<int,int>,int>> pts;
for (i=0;i... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#define MAX 2000200
#define MIN -2000000300
#define INF 1<<30
using namespace std;
int n;
int A[1000][1000];
int d[1000];
bool used[1000];
void Init(int n){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
A[i][j] = INF;
}
}
}
int prime(){
for(int... | #include <algorithm>
#include <iostream>
using namespace std;
int P[10010];
void init(int N){
for (int i=0; i<N; i++) P[i] = i;
}
int root (int a){
if (P[a] == a) return a;
else {
P[a] = root(P[a]);
return P[a];
}
}
bool is_same_set(int a, int b){
return root(a) == root(b);
}
void unite(int a, int b)... | 1 |
#include <iostream>
#include<map>
using namespace std;
const int maxn = 2e6 + 10;
typedef pair<int, int> P;
int fa[maxn], ma[maxn];
void init(int n)
{
for (int i = 0; i <= n; ++i)
{
fa[i] = i;
ma[i] = i;
}
}
int find(int* fa, int x)//找到根节点
{
if (fa[x] == x)
{
return fa[x];
}
return fa[x] = find(fa, fa[x])... | #include <algorithm>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
int main() {
int n;
while (~scanf("%d", &n)) {
if (n == 0) break;
std::vector<unsigned int> v;
std::map<unsigned int, unsigned long long int> m;
unsigned int a;
unsig... | 0 |
#include <cstdio>
typedef long long lint;
int const N=1e5+10;
int n,a[N];
int gcd(int x,int y)
{
if(x==-1 || y==-1) return -x*y;
if(x==0) return y;
else return gcd(y%x,x);
}
int g1[N],g2[N];
int main()
{
scanf("%d",&n);
lint sum=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum+=a[i];
if(n%2==0... | #include <cstdio>
#include <cstring>
#include <algorithm>
inline int read()
{
int data = 0, w = 1;
char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + (ch ^ 48), ch = getchar();
return data * w;
... | 1 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
const LL MOD = 1e9 + 7;
LL dp[10005][105][2], D;
vector<int> arr;
LL solve(int i, int d, int op) {
if (i == -1) return d == 0;
if (~dp[i][d][op]) ... | #include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using usize = std::size_t;
i32 a[200000];
auto main() -> i32 {
i32 n,... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T;
char c = 'W';
for (int i = 0; i < N * 2; i++){
if (S[i] != c){
T += 'L';
c = 'B' + 'W' - c;
} else {
T += 'R';
c = 'B' + 'W' - c;
}... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 0 |
#include <iostream>
using namespace std;
int prime_number(int n){
int i;
if(n<=1) return 0;
for(i=2;i<=n/2;i++) if(n%i==0) return 0;
return 1;
}
int main(){
int i,j,k,n[10000],a=0;
for(j=0;j<10000;j++){
cin >> n[j];
if(n[j]==0) break;
}
for(k=0;k<j;k++){
for(i=n[... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | ////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - imnasim3.1415@gmail.com
#include<bits/stdc++.h>
using namespace std;
#define... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int m... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <n... | 0 |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
string ans = "-1 -1 -1";
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N; ++j) {
int k = N - j - i;
if (k < 0) continue;
if (i * 10000 + j * 5000 + k * 1000 == Y) {
ans = to_string... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
string x,y;
int sum = 0;
for(;a<=b;a++){
y = x = to_string(a);
reverse(y.begin(),y.end());
if(x==y) sum++;
}
cout<<sum;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, LOG = 30;
int A[N], B[N], cnt[N], f[N], w[N], n;
bool a[N], b[N];
void Check() {
int curr = 0;
for (int i = 2; i <= n; i ++) {
while (curr && b[curr] != b[i - 1]) curr = f[curr];
if (b[curr] == b[i - 1]) curr++;
f[i] ... | #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(... | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int wh, bk; cin >> wh >> bk;
int h = 100 / 2, w = 100;
cout << h * 2 << " " << w << endl;
auto func = [&](char c0, char c1, int cnt) {
vector<string> s(h, string(w, c0));
for (int i = 1; i < h -... | 0 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_b... | // This code wrote by chtholly_micromaker(MicroMaker)
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define reg register
using namespace std;
const int MaxN=2050;
const int dir[4][2]={1,0,0,1,-1,0,0,-1};
template <class t> inline void read(t &s)
{
s=0;
reg int f=1;
reg char c=getchar();
while(!isdigit(c))
... | 0 |
#include<iostream>
using namespace std;
int a;
int main() {
while (cin >> a) {
cout << (900 - a)*(900 - a) * 100 - 9000000 << endl;
}
} | #include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int f(int x) {
return x * x;
}
int main() {
int d;
int D = 600;
while (cin >> d) {
int s = 0;
for (int i = 1; i * d < D; i++)
s += f(i * d) * d;... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
int a, b, c, d, e, k;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> a >> b >> c >> d >> e >> k;
bool flg = true;
if(e - a > k) {
flg = false;
... | #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<functional>
//#include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 100... | 1 |
#include <iostream>
#include <regex>
using namespace std;
int main() {
string S;
cin >> S;
cout << (regex_search(S.begin(), S.end(), regex("AC")) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"... | 1 |
#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 <math.h> // sqrt
#include <map> // map
#inc... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f... | 0 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
void fnInput(int &rnMaxSiz, vector<int> &rvnNum)
{
cin >> rnMaxSiz;
rvnNum.resize(rnMaxSiz);
for (int i = 0; i < rnMaxSiz; i++)
cin >> rvnNum[i];
}
void fnPartition(vector<int> &rvnNum, int nStart, int nEnd, int &nCur)
{
for (... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f... | 1 |
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
int main(){
int N,Q,M,Date[101],i,l,k;
while(0<=scanf("%d%d",&N,&Q)){
for(i=0;i<101;i++){
Date[i]=0;
}
if((N==0) && (Q==0)){
break;
}
for(k=0;k<N;k++){
scanf("%d",&M);
if(M==0){
continue;
}else{
for(i=0;i<M;i++){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
char m[50][50];
int dist[100][100];
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2 * 1e5;
ll bpow(ll a, ll b) {
long long res = 1;
while (b > 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R, G;
cin >> R >> G;
if(0 <= R){
if(4500 >= G){
cout << (G - R) * 2 + R << endl;
}else{
cout << "Please input number (goal rating) under 4500." << endl;
}
}else{
cout << "Please input number (rating) over 0." << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
int R,G; cin>>R>>G;
cout<<(G+G-R)<<endl;
return 0;
}
| 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int tmp;
int dp[100];
cin>> tmp;
do{
fill(dp,dp+100,0);
dp[0] = 1;
for (int i = 0; i<tmp;i++)
{
for(int j = 1;j < 4;j++)
dp[i+j] += ... | #include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
signed main() {
int N;
while (cin>>N, N!=0) {
if (N < 3) {
cout << 1 << endl;
continue;
}
int dp[N];
dp[0] = 1;
dp[1] = dp[0]+1;
dp[2] = dp[1]+dp[0]+1;
for (int i... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
#include <tuple>
constexpr long lon... | #include <climits>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
void dfs(int u, vector<vector<int> >& G, int& t, vector<int>& ord, vector<int>& low, int& k, vector<int>& cmp, stack<int>& s) {
ord[u] = low[u] = t++;
s.push(u);
for (int v: G[u]) {
if (ord[v] == -1) {
dfs(v, G, t, o... | 1 |
/*
Motto - try hard to become an expert
*/
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
//define
#define rep(i,n) for(int i=0;i<n;i++)
#define repu... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<vector<char>> G;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
long long bfs(int sx, int sy, vector<vector<bool>> &vis, G &g) {
int h = g.size();
int w = g[0].size();
queue<pair<int, int>> q... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k, dig = 0;
cin >> n >> k;
int d;
for (int i = 0; i < k; i++) {
cin >> d;
dig |= 1 << d;
}
for (int i = n; ; i++) {
string num = to_string(i);
bool bad = false;
for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i = 0;i<((ll)(n));i++)
#define reg(i,a,b) for(ll i = ((ll)(a));i<=((ll)(b));i++)
#define irep(i,n) for(ll i = ((ll)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(ll i = ((ll)(b));i>=((ll)(a));i--)
template<class T = int> using V = vect... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int x[20][20], y[20][20],a[20];
int main() {
int n;
cin >> n;
rep(i,n) {
ci... | #include <cstdio>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#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 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0, before;
cin >> before;
bool HasNoAns = (before > 0);
for (int i = 1; i < N; i++) {
int now;
cin >> now;
if (now == 0) {
before = now;
continue;
}
if (now == before + 1) ans++;
else {
if (now <= before) ... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a+b==c+d)cout<<"B... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
rep(i,h){
bool rev_fl = i<b;
rep(j,w){
if(j<a){
if(rev_fl) cout << 1;
else co... | 0 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define NOT -100000*2100
#define VMAX 100
#define EMAX 9900
int main(void){
int V,E;
int s,t,d;
long long v[VMAX][VMAX];
int cnt;
vector<int> ed[VMAX];
vector<int> edco[VMAX];
queue<int> no;
cin>>V>>E;
for(int i=0;i<V;i++){
for... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n... | 1 |
#include<bits/stdc++.h>
using namespace std;
bool isEven(int x){return x%2==0;}
bool solve(vector<int> a){
int n=a.size();
int oneCnt=count(a.begin(),a.end(),1);
int evenCnt=count_if(a.begin(),a.end(),isEven);
if(oneCnt || evenCnt<n-1){
return !isEven(evenCnt);
}
else{
int g=a[0... | #include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string a;
getline(cin, a);
int len = a.length();
for (int i = len-1; i >=0; i--) {
cout << a[i];
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll MOD=1000000007;
ll ReturnDigit(ll n){
int keta=1;
while(n/10!=0){
n /= 10;
keta++;
}
return keta;
}
int main(){
ll n; cin>>n;
ll ans = 100000000000;
for (ll i=... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
//#define INF 100000000
//#define MOD (int) (1e9+7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
const in... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | 0 |
#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(){
string s;
int ans=INF;
cin >> s;
... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve()
{
ll s;
cin >> s;
ll ans = s;
while(s >= 100)
{
... | 1 |
#include<bits/stdc++.h>
#include<string>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define mod (ll)(1e9+7)
#define nax (ll)(1e5)
#define INFL LLONG_MAX
#define NINFL LLONG_MIN
#define INF INT_MAX
#define disp(a,n,arr) for(int i=a;i<(ll)n;i++) cout << arr[i] << " ";... | #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, m;
cin >> n >> m;
int l = 1, r = n;
rep(i, m) {
int a, b;
cin >> a >> b;
if (l < a) {
l = a;
}
if (b < r) {
r = b;
}
}
if (r < l)... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#defi... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;... | 0 |
#include <bits/stdc++.h>
using namespace std;
//const int MOD=1e9+7;
const int MOD=998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
if(!(n%3)){
vector<string> ans(n,string(n,'.'));
for(int i=0; i<n; i+=3){
ans[i]... | #include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
char three[3][4] = {
"xx.",
"..y",
"..y"
};
char four[4][5] = {
"aacd",
"bbcd",
"cdaa",
"cdbb"
};
char five[5][6] = {
"a... | 1 |
#include <iostream>
using namespace std;
static const int MOD = 1000000007;
int main() {
int N;
cin >> N;
long long sum, A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
sum = (sum + A[i]) % MOD;
}
// sum = A1 + A2 + ... + An
// A1(A2+A3+...+An) + A2(A3+A4+...+An) + ... + ... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define fi first
#define se second
#define pb push_back... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n; ll MOD; cin >> n >> MOD;
vector<vector<ll>> dp(3 * n + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
for (ll i = 0; i < 3 * n; i++) {
for (ll j = 0; j <= n; j++) {
if (i + 1 <= 3 * n) ( dp[i+1][j] += d... | 0 |
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn=100000+10;
int fa[maxn],co[maxn];
bool bz[maxn],pd[maxn];
int i,j,k,l,r,t,n,m,cnt;
ll ans;
int getfa(int x){
if (!fa[x]) return x;
int t=getfa(fa[x]);
co[x]^=co[fa[x]];
retu... | #include <bits/stdc++.h>
#include <algorithm>
#include <time.h>
#define l(x) x<<1
#define r(x) ((x<<1) | 1)
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
const int inf = 2*(1e9) + 10;
const long long MOD =998244353;
const int NMAX = 1000005;
const int dx[] = {-1,... | 1 |
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,a,b) for(int i=int(a);i>int(b);--i)
using namespace std;
using ll = long long;
int p[2][20... | #include<bits/stdc++.h>
using namespace std;
bool check(vector<string> board)
{
for (int i=0;i<8;i++)
{
if (count(board[i].begin(),board[i].end(),'Q')!=1) return false;
int cnt=0,cnt1=0,cnt2=0,cnt3=0,cnt4=0;
for (int j=0;j<8;j++)
{
if (board[i][j]=='Q') cnt++;
}
if (cnt!=1) return false;
for (int j=... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, m;
vector<vector<int> > f;
for (;;) {
scanf("%d %d", &n, &m);
if (!n && !m) break;
f = vector<ve... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int n,m,a[100];
cin >> n >> m;
while ((n!=0)||(m!=0)){
for (int i=0;i<100;i++)
a[i]=0;
for (int i=1;i<=n;i++){
int b,c;
cin >> b;
for (int j=1;j<=b;j++){
c... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int M = 0;
cin >> M;
vector<int> s(M,0);
vector<int> c(M,0);
if(M == 0) {
cout << (int)pow(10, N - 1)*(N != 1) << endl;
return 0;
}
for(int i = 0; i < M; i++) {
... | #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 ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 1 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string... | //#include "stdafx.h"
#include<bits/stdc++.h>
#include<iostream>
#include<queue>
#include<string>
using namespace std;
string s;
int ans[26],f;
int main()
{
cin>>s;
for(int i=0;i<(int)s.size();i++){
ans[s[i]-'a']++;
}
for(int i=0;i<26;i++){
if(ans[i]==0){
cout<<char('a'+i)<<"\n";
f=1;
break;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
string s;
cin >> s;
vector<long long> b;
int ans ... | /*
Creator : bizarre
*/
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define bizarre ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define ll long long
#define ld long double
#define pi acos(-1)
#define point co... | 0 |
#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int... | #include <iostream>
#include <vector>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> ansvec;
for(;;){
int n, p;
cin >> n >> p;
if (n == 0) break;
int bowlp = p;
int turn = 0;
int mayors[50]{0};
for(;;){
if (bowlp == 1 && mayors[turn] == p - 1) break;
... | 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>;
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 5;
int dp[1000005][2];
int main(){
string s;
cin >> s;
reverse(s.begin(), s.end());
s += '0';
int n = s.s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll MOD=1e9+7;
ll f(pair<string,ll>&x ,pair<string,ll>&y)
{
if(x.first == y.first)
{
return x.second>y.second;
}
else
{
return x.first<y.fi... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | 0 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int INF=1e9;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
int n;
cin >> n;
vector<ll> s(n+1);
s[0]=0;
rep(i,n){
ll a;
cin >> a;
s[i... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define ppi pair<pii,int>
#define pip pair<int,pii>
#define pdd pair<double, double>
#define f first
#define s second
#define MOD 1000000007
#define mkp... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | /**
* created: 23.06.2020 23:17:01
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#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++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 10000... | 0 |
//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <deque>
#include <map>
using namespace std;
#define ii pair <int, int>
#define lli long long
#define pb push_back
#define X first
#define Y second
const int Mod = 1E9 + 7;
const int Inf ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,l[52],i,j,sum=0;
cin>>n>>k;
for(i=0;i<n;i++){
cin>>l[i];
}
sort(l,l+n);
for(j=n-1;j>=n-k;j--){
sum+=l[j];
}
cout<<sum;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 1 |
/*
?§???????????????°???????????°
goto ?????????C/C++?¨????????????§???????????¨?????§???????????§????????????????????¨????????¶????????????????????????????????????????£?????????????????????° goto CHECK_NUM; ??¨?????????????????????????????¨???????????°??????????????§ CHECK_NUM: ??¨????????????????????????????§???????... | #include <stdio.h>
#include <string.h>
int main() {
char str1[12], str2[12], str3[12];
scanf("%s%s%s", str1, str2, str3);
int len1 = strlen(str1), len2 = strlen(str2), len3 = strlen(str3);
if (str1[len1 - 1] == str2[0] && str2[len2 - 1] == str3[0]) {
puts("YES");
}
else {
puts("NO");
}
retu... | 0 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <utility>
#include <numeric>
us... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<string>
using namespace std;
int a[5];
string S;
string poker(int p, int q, int r, int s, int t)
{
if (p == q && q == r && r == s)
{
return "four card";
}
if (s == t && q == r && r == s)
{
return "four card";
}
if (p == q &&... | 1 |
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#define INF 1000000
void cWarshall_Floyd();
void tWarshall_Floyd();
int glid_cost[101][101];
int glid_tim[101][101];
int n,m,a,b,tim,cost,qs,p,q,r;
using namespace std;
void cWarshall_Floyd()
{
int i,j,k;
... | #include <iostream>
using namespace std;
int main(){
int n,q;
bool x[50][100];
while(cin >> n >> q,n||q){
for(int i = 0; i < n; i++){
for(int j = 0; j < 100; j++) x[i][j] = false;
}
for(int i = 0; i < n; i++){
int m;
cin >> m;
for(int j = 0; j < m; j++){
int date;
cin >> date;
x[i][dat... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long total = 0;
for (int i = 1; i <= n; i++){
if(i % 5 != 0 && i % 3 != 0){
total = total + i;
}
}
cout << total << endl;
} | #include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
/////////////////////////////////////////////////////
ll N;
ll i, j, k;
char S[1010][1010];
const char mk[10][20][20]={
{},{},{},{},
... | 0 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cst... | #include<iostream>
#include<string>
int main() {
std::string s;
while (std::cin >> s){
int sum = 0;
for (int i = 0; i != s.size(); i++){
if (s[i] == 'I'){
if (s[i + 1] == 'V') {
sum += 4;i++;
}
else if (s[i + 1] == 'X'){
sum += 9; i++;
}
else sum++;
}
else if (s[i] == 'V')su... | 1 |
#include <bits/stdc++.h>
using namespace std;
//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
//container util
#define all(x) (x).begin(),(x).end()
//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
int main() {
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> t;
rep(i, n) {
int l, r, x;
cin >> l >> r >> x;
l -= x;
r -= x;
t.push_back(make... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
c... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Arra... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.