code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a*500>=b) cout<<"Yes";
else cout<<"No";
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
int64_t N;
cin >... | 0 | 60,781,263 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string alphs;
int m, h;
while(cin >> alphs){
if (alphs == "-") break;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h;
alphs = alphs + (alphs.substr(0, h));
alphs.erase(0, h);
}
... | #include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n... | 0 | 15,022,123 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i... | #include <iostream>
#include<vector>
#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 srep(i,s,t) for (int i = s; i < t; i++)
#define rng(a) a.begin(),a.end()
using ll = long long;
using namespace std;
int main() {
... | 0 | 67,849,441 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 5005;
const ll MAX_K = 5005;
const ll INF = 1LL << 40;
bool dp[MAX_N][MAX_K];
int main() {
int N;
ll K, A;
cin >> N >> K;
vector<ll> a;
for (int i = 0; i < N; i++) {
cin >> A;... | 0 | 100,599,511 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
int n, A[3], ans;
vector<int> l;
char tmp[8];
void check(void)
{
vector<int> cnt(3, -1), sum(3, 0);
int s = 0;
rep(i, n)
{
sum[tmp[i] - 'A'] += l[i];
cnt[tmp[i] - 'A']++;
}
rep(i, 3)
{
if (cnt[i] >= 0)
s += cnt... | #include <iostream>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m,k;
cin >> n >> m>>k;
bool ok = false;
for(int i=0;i<=n;i++) {
for(int j=0;j<=m;j++) {
if (i * (m - j) + j * (n - i) == k) {
... | 0 | 61,089,701 |
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cerrno>
#include<clocale>
#include<cmath>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<limits>
#include<list>
#include<map>
#includ... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
struct node{
int id;
int k;
int depth;
int parent;
vector<int> child;
};
int main()
{
int n, id, k;
cin >> n;
vector<node> tree;
tree.resize(n);
for (int i = 0; i < n; i++)
{
tree[i].parent = -1... | 0 | 12,999,533 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (A > B || (N == 1 && A != B)) {
cout << 0 << endl;
return 0;
}
ll min_s = A + (N-2) * A + B;
ll max_s = A + (N-2) * B + B;
ll ans = max_s - min_s + 1;
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#define MAXV 10000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(MAXV, 0);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
cnt[temp]++;
}
int count = 0;
for (int i = 0; i < cnt.size()... | 0 | 56,443,955 |
#include <bits/stdc++.h>
using namespace std;;
int main(){
string s, t;
int sSize, tSize, ans, count;
cin >> s >> t;
sSize = s.size();
tSize = t.size();
ans = tSize;
for (int i = 0; i <= sSize-tSize; i++){
count = 0;
for (int j = 0; j < tSize; j++){
if (s[i + j] !... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x[3];
for (int i = 0; i < 3; i++) {
cin >> x[i];
}
sort(x, x + 3);
int count = 0;
for (int i = 0; x[0] + 2 <= x[2]; i++) {
x[0] += 2;
count++;
}
for (int i = 0; x[1] + 2 <= x[2]; i++) {
x[1] +=... | 0 | 84,641,288 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int A,B,C;
cin >> A >> B >> C;
set<int> check;
bool ans;
int x = A;
while(true){
x = x%B;
if(x == C){
ans = true;
break;
}e... | #include <iostream>
#include <vector>
#include <utility>
#include <set>
using namespace std;
typedef pair<int, int> P;
int main(){
int N, K;
cin >> N >> K;
int cnt = 0;
if(K > (N - 1) * (N - 2) / 2){
cout << -1 << endl;
return 0;
}
set<P> s;
for(int i = 1; i < N; i++){
... | 0 | 15,400,289 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,x;
cin>>a>>b;
x=__gcd(a,b);
x=(a*b)/x;
cout<<x;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define PB push_back
#define MP make_pair
#define endl '\n'
#define all(a) (a).begin(),(a).end()
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int arr[100000][3];
int n;
int dp[100000][3];
int rec(int ro... | 0 | 80,273,999 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
vector<int> h(10);
for(int i=0;i<10;++i) cin>>h[i];
sort(begin(h),end(h),greater<int>());
for(int i=0;i<3;++i) cout<<h[i]<<endl;
return 0;
} | #include<iostream>
#include<math.h>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> c(s.size(),0);
for(int i=0;i<s.size();i++){
if(s[i]=='a')c[0]++;
if(s[i]=='b')c[1]++;
if(s[i]=='c')c[2]++;
}
if(c[0]==1 && c[1]==1 && c[2]==1)cout << "... | 0 | 8,226,537 |
#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 k = 1;
string s;
cin >> s;
for (int i = 0; i < 4; i++)
{
if (s[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> inli... | 0 | 36,813,185 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include <bits/stdc++.h>
using namespace std;
#define pr(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(v) (v).begin(), (v).end()
#define int unsigned long long
#define sz(v) (int)(v).size()
#define mod 100000... | 0 | 34,625,259 |
#include<iostream>
using namespace std;
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#define int long long int
int function2(int memo[],int turn[],int n,map<int,int> &sticks)
{
if(n<0)
{
return -1000000000;
}
if(n==0)
{
return 0;
}
if(memo[n]!=-1)
{
return memo[n];
}
else
{
map<in... | #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() {
vec<string> S(2);
cin >> S[0] >> S[1];
if (S[0].size() > S[1].size()) {
cout << "GRE... | 0 | 79,457,938 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#define ll long long
#define Size(v) (int)v.size()
using namespace std;
void solve() {
ll x;
cin >> x;
ll lcm = x * 360 ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 1,714,549 |
#include <iostream>
using namespace std;
int s,x,z,a;
int main(){
cin>>x>>a>>z;
s=a+x;
if((a<=500)&&(a>=1)&&(x>=1)&&(x<=500)){
if(s>=z){
cout<<"Yes";
} else {
cout << "No";
}
}
else{
cout<<"you can't buy";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | 0 | 70,649,271 |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cctype>
#include<queue>
#include<vector>
inline int read() {
int x = 0, f = 1; char c = getchar();
for (; !isdigit(c); c = getchar()) f ^= c == '-';
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
return f ? x : -x;
}
using ... | #pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
using P = pair<int64, int64>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1<<30;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
temp... | 0 | 33,688,299 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define RE... | #include <iostream>
using namespace std;
int main() {
int W;
int H;
int x;
int y;
int r;
int f1;
int f2;
int f3;
int f4;
cin>>W>>H>>x>>y>>r;
bool t = false;
if (x-r>=0){
if(t) cout<<"1Yes"<<endl;
f1=1;
}else if (x-r<0){
if(t) cout<<"1No"<<endl;
f1=0;
}
if (y+r<=H){
if(t) cout<<"2Yes"<<endl;
f... | 0 | 54,666,112 |
#include <iostream>
#include <cstring>
#include <cctype>
#define MAX_LEN (1200)
using namespace std;
int main()
{
char* str = new char[MAX_LEN + 1];
int* counter = new int[26];
int lest = MAX_LEN;
for (int i = 0; i < 26; i++) {
counter[i] = 0;
}
while (cin.getline(str, lest)) {
... | # include <bits/stdc++.h>
# define long long long
# define all(vc) vc.begin(),vc.end()
# define allr(vc) vc.rbegin(),vc.rend()
# define pb push_back
# define fi first
# define se second
# define pi pair <long, long>
# define lcm(a, b) (a *... | 0 | 54,295,935 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
cout << c << endl;
return 0;
}
else if (b == c) {
cout << a <... | #include<bits/stdc++.h>
#define ll long long
#define P pair<ll ,ll>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int r,s,p;
cin >> r >> s >> p;
string t;
cin >> t;
ll ans = 0;
vector<char>was(n ,'x');
for(int i=0;i<n;i++){
if(i-k >=0){
if(was[i-k]!='r... | 0 | 19,079,823 |
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 0 | 64,601,252 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k > (n - 1) * (n - 2) / 2) {
cout << -1 << endl;
return 0;
}
cout << n - 1 + (n - 1) * (n - 2) / 2 - k << endl;
for (int i = 2; i <= n; ++i) {
cout << 1 << " " << i << endl;
fo... | 0 | 41,724,449 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
const double PI (acos(-1));
int main()
{
char C;
cin >> C;
C = C + 'b' - 'a';
cout << C;
} | #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 (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class... | 0 | 3,624,624 |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000007
using namespace std;
int n,a[200010],cnt;
pair<int,int> q[200010];
inline bool check(int x)
{
if(x==1){
bool flag=false;
for(int i=1;i<n;i++) if(a[i]>=a[i+1]){
flag=true;
break;
}
if(!flag) return true;
return false;
}
int pre=0;... | #include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int n;
int s;
int ans;
void dfs(int i, int sumCount, int sum)
{
if (sum == s && sumCount == n)
{
++ans;
return;
}
if (i == 10 || sumCount == n)
{
return;
}
dfs(i + 1, sumCount + 1, sum + i);
dfs(i + 1, sumCount, sum);
return;... | 0 | 30,265,439 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,ll>pa;
const int N=2e5+100;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
ll qpow(ll x,ll n)
{
if(x==0&&n==0) return 1;
ll sum=1;
while(n){
if(n&1) {
sum=sum*x%mod;
}
x=x*x%mod;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 0 | 159,358 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,m;
cin>>n>>m;
string s,t;
for(ll i=0;i<n;i++){
s+='0'+m;
}
for(ll i=0;i<m;i++){
t+='0'+n;
}
if(s<t){
cout <<s;
}
else{
cout << t;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll ans = 0;
pair<ll, ll> arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i].first >> arr[i].second... | 0 | 58,887,516 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010, Mod=1e9+7;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar... | #include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
int main()
{
int n, k;
vector<int> h;
cin >> n >> k;
h.resize(n);
for (int i=0; i<n; i++)
{
cin >> h[i];
}
int count = 0;
for (int i=0; i<n; i++)
{
if(h[i] >= k)
{
co... | 0 | 23,150,293 |
#include <iostream>
using namespace std;
int main() {
int m,f,r;
cin >> m >> f >> r;
while(m!=-1 || f != -1 || r!= -1) {
string grade;
int score;
score = m+f;
if(m==-1 || f ==-1)
{
grade = "F";
}
else if(score >= 80)
{
g... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef double db;
#define ls(x) x<<1
#define rs(x) x<<1|1
#define low(x) (x&-x)
#define all(x) x.begin(),x.end()
#define mp make_pair
#define X first
#define Y second
#ifd... | 0 | 42,838,959 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include<bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const long long MOD=(long long)(1e9+7);
const int NAX=1005;
const int MAXN=1000005;
Int N,M,K;
Int W,H;
Int X,Y,Z;
vector<Int> A;
int spf[MAXN];
void sieve()
{
spf[1] = 1;
for (int i=2; i<MAXN; i++)
spf[i] = i;
... | 0 | 39,061,956 |
#include<iostream>
using namespace std;
int main() {
while (1) {
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if (m == 0) break;
int ans = 0;
int tmp;
cin >> tmp;
int maxgap = 0;
for (int i = 1; i < m; ++i) {
int s;
cin >> s;
... | #include <iostream>
#include <bits/stdc++.h>
#include <set>
#define isPowerOfTwo(S) (!(S & (S - 1)))
#define ll long long
#define ull unsigned long long
#define MAXN 1000000007
#define INF 1e12
using namespace std;
typedef pair<int,int> pi;
typedef pair<pi,int> trip;
typedef pair<ll int,ll int> pli;
typedef vector<int>... | 0 | 8,594,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num = N;
int H=0;
while(num){
H += num % 10;
num /= 10;
}
if(N%H==0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x){
if (n == 0) break;
vector <int> reel(n);
for (int i = 0; i < n; i++){
cin >> reel[i];
}
int now = 0, old = x, next = 0;
if (reel[0] == x){
now++;
}
if (n == now){
... | 0 | 11,405,777 |
#include<algorithm>
#include<string>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<utility>
#include<functional>
#include<cassert>
#include<cmath>
#include<math.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<ll> v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int m... | 0 | 37,660,721 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
#define int long long
typedef pair<int,int> P;
typedef pair<int,P> PP;
int dfs(int v,vector<int>& used,const vector<vector<int> >& g,int k){
if(us... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
int total;
int ave;
while (1) {
int tmp;
vector<int> v;
cin >> n;
if (n == 0)break;
for (int i = 0; i<n; i++) {
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
total = 0;
for (int i ... | 0 | 81,703,265 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=1e9+5;
const ll INF=1e18+5;
using P=pair<int,int>;
int dx[4]={1,0,-1,0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 83,139,445 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m, v, p; cin >> n >> m >> v >> p;
vector<int> a(n); cin >> a;
sort(a.rbegin(), a.rend())... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<l... | 0 | 78,341,663 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=3105,INF=1<<30;
char S[MAX][MAX],ans[MAX][MAX];
int main(){
int H,W,D;cin>>H>>W>>D;
string T="RYGB";
for(int i=100;i<=2000;i+=D){
for(int j=100;j<=2000;j+=D){
... | 0 | 71,785,518 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
cin>>n>>k;
int vis[n]={0};
for(i=0;i<k;i++)
{
cin>>j;
for(int x=0;x<j;x++)
{
int p;
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <set>
#include <string>
#include <fstream>
#define F first
#define S second
#define ll long long
#define int ll
#define fast() ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#defi... | 0 | 12,021,972 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
vector<int> dy = {1, 0, -1, 0};
vector<int> dx = {0, 1, 0, -1};
typedef pair<int, int> PII;
int main() {
int h, w;
cin >> h >> w;
vector<string> grah(h);
rep(i, h) cin >> grah.at(i);
queue<PII> q;
vector<vector... | 0 | 66,872,774 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<double,int> P;
#define repl(i,n... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<... | 0 | 47,529,860 |
#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int S;
cin >> S;
map<int, int> list;
list[S]++;
while (true)
{
int tmp;
if (S % 2 == 0)
tmp = S /= 2;
else
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
string s;
cin >> s;
bool x=true;
int i=0;
while(i<s.size()) {
if(s.size()-i<5){
cout << "NO" << endl;
return 0;
}
if(s[i]==... | 0 | 69,871,504 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<pair<string, int>> v(n);
for(auto &x:v) cin >> x.first >> x.second;
string p; cin >> p;
bool found = false; int ans = 0;
for(int i=0;i<n;i++){
if(v[i].first == p){
found = true;
cont... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX=1000000;
ll m[MAX+10];
string multiply(string num1, string num2)
{
int len1 = num1.size();
int len2 = num2.size();
if (len1 == 0 || len2 == 0)
return "0";
vector<int> resul... | 0 | 60,182,936 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (Int i = s; i < (Int)(n); i++)
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
double EPS = 1e-10;
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;
int main() {
Int ... | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace s... | 0 | 11,831,493 |
#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int a, b;
double degree;
cin >> a >> b >> degree;
double rad = M_PI*(degree/180);
double s = a*b*sin(rad)/2;
printf("%.5lf\n", s);
double c = a*a + b*b - 2*a*b*cos(rad);
c = sqrt(c);
printf("%.5lf\n", a+b+c);
p... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | 0 | 31,207,955 |
#include <bits/stdc++.h>
using namespace std;
const int N = 8005;
int n, x, y, vv[2 * N], *v, c, d;
char s[N];
vector<int> xv, yv;
int main(){
v = vv + N;
scanf("%s%d%d", s, &x, &y);
n = strlen(s);
int i = 0;
for(; i < n; i++, x--) if(s[i] == 'T') break;
xv.push_back(0);
yv.push_back(0);
... | #include<iostream>
using namespace std;
int main(){
int coin[]={500,100,50,10,5,1};
int n;
int i;
int result;
cin >> n;
while(n){
n = 1000 - n;
i = 0;
result = 0;
while(n){
if(n - coin[i] >= 0){
n -= coin[i];
result++;
... | 0 | 83,683,173 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int t,b;
t=min(A,B);
b=min(C,D);
int ans=t+b;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
long long N, K;
string S;
long long pow(long long N, long long K) {
long long res = 1;
for (int i = 0; i < K; i++)
{
res *= N;
}
return res;
}
long long com(long long N, long long R) {
if(N < R || R < 0) return 0;
if(R == 1) return N;
... | 0 | 12,550,231 |
#include<bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
cout << N*N << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
c... | 0 | 61,330,519 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x... | #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 = p... | 0 | 42,426,212 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
int main(void) {
string S;
cin >> S;
reverse(S.begin(), S.end());
l... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 23,791,288 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long ,long b){
if (a % b == 0) return b;
return gcd(b, a % b);
}
long long lcm(long long a, long long b){
return (a / gcd(a,b) ) * b;
}
int main(void){
int n;
cin >> n;
vector<long long> t(n);
for (i... | #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
ty... | 0 | 86,755,492 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> A(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) cin >> A[i][j];
}
int cnt = 0;
for (int i; i < N; i++) {
for (int j = i + 1; j < N; j++) {
int total = 0;
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 78,081,457 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, i... | 0 | 66,072,878 |
#include <bits/stdc++.h>
#define fail return (cout << -1 << endl), 0
#define ll long long
using namespace std;
int n;
map<ll, int> f;
ll dis[100010], rdis[100010];
int sz[100010];
struct Edge {
int to, next;
}es[200010];
int first[100010], te = 0;
void addE(int a, int b)
{
te++;
es[te].to = b;
es[te].next = first[a... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | 0 | 77,872,069 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e2+5 , M = 1e5+5 , MOD = 1e9+7;;
int n , k;
ll A[N] , sum[N] , bit[N][M] , dp[N][M];
void add(int x , int y , int val){
for(int i = y ; i < M ; i+=i&-i) bit[x][i] = (bit[x][i]+val)%MOD;
}
ll query(int x , int y){
ll r = 0;
for(int ... | #include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define int long long
typedef pair<int,int>pi;
... | 0 | 55,572,713 |
#include <iostream>
#include <stack>
int main(){
std::stack<int> garage;
int vehicle_num;
while(std::cin >> vehicle_num){
if(vehicle_num != 0) garage.push(vehicle_num);
else{
std::cout << garage.top() << std::endl;
garage.pop();
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
bool ok(ll x){
ll cnt=0;
for(ll i=1;i*i<=x;i++){
if(x%i==0){
cnt+=2;
if(i==x/i) cnt--;
}
}
if(cnt==8){
return true;
}
else {
return false;
}
}
int... | 0 | 84,558,093 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)),t.end())
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
typedef long long ll;
using namespace std;
const ll mod=1000000007,mod9=1000000009;
template <class T>inline T lcm(T a,T b){... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | 0 | 16,465,525 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n,t;
cin>>n>>t;
long long ans=0;
int now=0,pre=0;
cin>>now;
for(int i=0;i<n-1;i++){
pre=now;
cin>>now;
ans+=min(t,now-pre);
}
cout<<ans+t<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n;cin>>n;
for(int i=0;i<n;++i){
double abdx,abdy,cddx,cddy;
double x[4];
double y[4];
for(int j=0;j<4;++j){
cin>>x[j]>>y[j];
}
abdx=x[0]-x[1];
cddx=x[2]-x[3];
abdy=y[0]-y[1];
... | 0 | 23,121,690 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define int long long
int patty[55];
int total[55];
int dfs(int n, int x) {
if(n == 0) {
if(x <= 0) return 0;
else return 1;
}
int res = 0;
if(x <= total[n - 1] + 1LL) {
res += dfs(n - 1,x - 1);
} else ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define f first
#define s second
#define pb push_back
const int N = 3e5 + 5;
const int M = 5e5 + 5;
const int OO = 1e9;
const int mod = 1e9 + 7;
int t,n,a[N],freq[N],cum[N];
void ini... | 0 | 64,796,140 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin >> q[i];
rep(i,... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
int n, m;
while(1) {
cin >> n;
if(n == 0) break;
char ch[26], CH[26];
char num[10];
rep(i,26) {
ch[i] = (cha... | 0 | 24,368,734 |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
const long long LINF=1e18;
#define int long long
template <typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
signed main(){
int N,A,B;cin>>N>>A>>B;
if(A*B<N)fin(-1);
if(A+B>N+1)fin(-1);
std::vector<int> ans(N);
for(in... | #include "bits/stdc++.h"
using namespace std;
typedef long long li;
li n;
vector<vector<li>> g;
li grundy(li pos, li parent) {
li res = 0;
for (li next : g[pos]) {
if (next == parent) {
continue;
}
res ^= grundy(next, pos) + 1;
}
return res;
}
int main() {
cin.tie... | 0 | 99,045,592 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << 1110-n << endl;
return 0;
} | #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()
#define strall(v) (v).cbegin(),(v).cend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class u> ... | 0 | 15,772,629 |
#include<iostream>
#include<algorithm>
#define MAX_X 1000
#define MAX_Y 1000
using namespace std;
int c[MAX_X+1][MAX_Y+1];
int lcs(string& a, string& b) {
a = ' ' + a;
b = ' ' + b;
for(int i=0; i<a.length(); i++) {
c[i][0] = 0;
}
for(int i=0; i<b.length(); i++) {
c[0][i] = 0;
}
for(int i=1; i<a.le... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | 0 | 27,708,433 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | 0 | 56,944,221 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
long long N, M;
long long WC[100005];
bool AC[100005];
int main(){
cin >> N >> M;
long long ac = 0;
long long wc = 0;
rep(i, M) {
long long num;
string res;
cin >> num >> res;
if(res == "WA") {
if(!AC[num]) ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(...) debug_func_mult(split_names(#__VA_ARGS__), __VA_ARGS__)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(...) 0
#define DEBUG_ENDL 0
#defin... | 0 | 47,490,914 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){... | 0 | 80,841,930 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
using namespace std;
int main(){
int A,B,C,D,a,b,c,p,q;
char aa,bb,cc;
cin >> p;
D = p % 10;
p... | #include<bits/stdc++.h>
using namespace std;
int main(){
bool a=false,b=false,c=false,d=false;
for(int i=0;i<4;i++){
int A;
cin >> A;
if(A==1){
a=true;
}
if(A==4){
b=true;
}
if(A==7){
c=true;
}
if(A==9){
d=true;
}
}
if(a && b && c && d){
cout <... | 0 | 87,506,410 |
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
typedef unsigned int uint;
typedef long long llong;
typedef unsigned long long ullong;
typedef long do... | #include <iostream>
#include <cstdlib>
#include <cstring>
using namespace std;
int main(){
char s[200], p[100];
int len;\
cin >> s;
cin >> p;
len = strlen(s);
for(int i = 0; i < len; i++){
s[len+i] = s[i];
}
if(strstr(s, p) != NULL){
cout << "Yes" << endl;
}else {
cout << "No" << endl;
}
return 0;
} | 0 | 14,714,841 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Z,W;
cin>>N>>Z>>W;
int a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
int ans=0;
if(N==1){
ans=abs(a[0]-W);
cout<<ans<<endl;
return 0;
}
int x1,x2,y1,y2;
x1=a[N-2];
y1=a[N-1];
x2=a[N-1];
y2=W;
if(abs(x1-y1)>abs(x2-y2))... | #include<bits/stdc++.h>
using namespace std;
const int N = 505, INF = 1e9 + 7;
const char colors[2][2] = {{'R', 'Y'}, {'G', 'B'}};
int n, m, d;
char cl[N][N];
inline pair < int, int > tr(int x, int y){
return make_pair(x + y, x - y);
}
inline pair < int, int > inv_tr(int x, int y){
if((x + y) % 2 || (x - y) % 2... | 0 | 47,437,075 |
#include <bits/stdc++.h>
using namespace std;
using usize = ::std::size_t;
using u64 = ::std::int_least64_t;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
#define mod 1000000007
u64 modinv(u64 a, u64 m) {
u64 b = m, u = 1, v = 0;
while (b) {
u64 t = a / b;
a -= t * b; swap(a,... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <math.h>
#include <iomanip>
#include <string.h>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"... | 0 | 99,609,442 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define long long long
using namespace std;
int main() {
int n;
long k;
cin >> n >> k;
long a[n];
for (auto &ai:a) cin >> ai;
sort(a, a+n);
int l = -1, r = n;
while (r - l > 1) {
int m =... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h,w,m;
cin>>h>>w>>m;
vector<set<int>> b(h);
vector<int> sums_h(h,0);
vector<int> sums_w(w,0);
int bh,bw;
for(int i=0;i<m;i++){
cin>>bh>>bw;
sums_h.at(bh-1)++;
sums_w.at(bw-1)++;
b.at(bh-1).insert(bw-1);
}
int result=0;
int... | 0 | 18,493,458 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
using namespace std;
typedef unsigned long long ull;
typedef lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 123456;
int n;
ll a[N];
int main() {
ll single = 0;
ll sm = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
single += i + 1;
scanf("%lld", &a[i]);
sm += a[i];
}
if (n == 1) {
puts(... | 0 | 76,981,273 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int t;
string s;
int a[100001]={0};
int countw=0,countr=0;
while(m--)
{
cin>>t;
cin>>s;
if(s=="WA")
{
if(a[t]!=-1)
a[t]++;
}
else
... | #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>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | 0 | 90,075,086 |
#include<stdio.h>
int main(){
int a[3],i,c,f=0;
scanf("%d %d %d",&a[0],&a[1],&a[2]);
for(i=0;i<3;i++){
for(c=0;c<3;c++){
if(a[i]<a[c]){
f=a[i];
a[i]=a[c];
a[c]=f;
}
}
}
printf("%d %d %d\n",a[0],a[1],a[2]);
return(0);
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
string s, t;
cin >> s >>... | 0 | 70,442,661 |
#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;
#define rep(i, a, b) for(int i = a; i < b; i++)
const int MAX_N = 100;
int main(){
int A, B; cin >> A >> B;
cout << MAX_N << " " << MAX_N << endl;
vector<vector<char> > ans(MAX_N, vector<char>(MAX_N));
rep(i, 0, 100){
rep(j, 0, 100){
if(i... | 0 | 84,533,811 |
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s ; i < n ; i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main(){
int n,Y,M,D;
int sum_day;
cin >>n;
rep(i,n){
cin >>Y>>M>>D;
sum_day=0;
while(1){
if(Y==1000 && M==1 && D==1)break;
D++;
sum_day++;
if(Y%3==0){
i... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
ll n,m;
ll dp[6500][6500]={0};
void solve(ll *s, ll *t){
memset(dp, 0,sizeof dp);
for(ll i=1;i<=n;i++){
for(ll j=1;j<=m;j++){
if(s[i-1]==t[j-1])
dp[i][j] = (1 + dp[i-1][j]%mod + dp[i... | 0 | 64,605,685 |
#include <bits/stdc++.h>
using namespace std;
int h, w;
bool check(int i, int j){
if(i >= 0 && i < h && j >= 0 && j < w) return true;
return false;
}
int main(){
cin >> h >> w;
vector<string>a(h);
for(int i = 0; i < h; i++){
cin >> a[i];
}
for(int i = 0; i < h; i++){
for(int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pl... | 0 | 16,502,538 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 5,973,391 |
#include <cstdio>
const int kMaxN = 2000000;
const int kMaxAi = 10000;
void CountingSort (int A[], int B[], int k, int n) {
int i;
int C[k + 1] = {};
for (i = 0; i < n; ++i) { ++C[A[i]]; }
for (i = 1; i < k + 1; ++i) { C[i] += C[i - 1]; }
for (i = n - 1; i > -1; --i) {
B[C[A[i]] - 1] = A[i];
--C[A[i]]... | #include <iostream>
#include <cstring>
using namespace std;
char Right[11] = {'y','u','i','o','p','h','j','k','l','n','m'};
int main(){
string str;
while(cin >> str){
if(str[0] == '#') break;
int ans = 0;
bool position = false;
for(int i = 0; i < 11; i++){
if(Right[i] == str[0]){
position = true;
b... | 0 | 88,880,638 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 200003;
int n;char str[MaxN];
int f[MaxN],dp[MaxN];
map<int,int> mn;
int main() {
scanf("%s",str+1);
n=strlen(str+1);
for (int i=1;i<=n;++i) {
f[i]=f[i-1]^(1<<(str[i]-'a'));
}
for (int i=1;i<=n;++i) mn[f[i]]=0x7f7f7f7f;
mn[0]... | #include <bits/stdc++.h>
using namespace std;
const int maxn=110000;
long long a[maxn];
const int INF=1<<30;
int n;
long long l;
long long q;
int f[maxn][35]={};
inline void init()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",a+i);
scanf("%d%d",&l,&q);
for(int i=1;i<=n;i++)
{
int x=(int)(upper_b... | 0 | 11,494,808 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(0);
int D, T, S;
cin >> D >> T >> S;
cout << (T * S >= D ? "Yes" : "No") << endl;
return 0;
} | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include... | 0 | 98,918,026 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pl;
#define all(a) (a).begin(),(a).end()
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=(a);i<(b);i++)
#define rrep(i,n) for(ll (i)=(n)-1;(i)>=0;i--)
#define SHOW(x) cout << #x << ": " << x << endl... | 0 | 46,332,308 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int N = s.size();
int L = -1;
int R = -1;
for (int i = 0; i < N - 1; i++){
if (s[i] == s[i + 1]){
L = i + 1;
R = i + 2;
}
}
for (int i = 0; i < N - 2; i++){
if (s[i] == s[i + 2]){
L = i + 1;
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(all(a));
int cnt = 1, ans = 0;
for (int i = 1; i ... | 0 | 78,372,836 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int q; cin >> q;
for (int i = 0; i < q; i ++) {
long long a, b; cin >> a >> b;
long long root = sqrt(a*b);
long long ans = root + (a*b-1)/root-1;
if(a!=b)--ans;
cout << ans << endl;
}
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 0 | 27,187,929 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define All(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
bool isPrime(int n){
if(n < 2) return false;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 0 | 15,711,707 |
#include <iostream>
using namespace std;
int main() {
int n;
long res = 1;
cin >> n;
for (int i = 2; i <= n; i++) {
res *= i;
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 0 | 42,892,462 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, c = 0;
cin >> n;
string s[n], si, x;
int t[n], ti;
REP(i, n) cin >> s[i] >> t[i];
cin >> x;
bool f = false;
REP(i, n) {
if (s[i] == x) {... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,h;
cin >> n >> h;
int a[n],b[n];
for(int i=0;i<n;i++)cin >> a[i] >> b[i];
sort(a,a+n);
sort(b,b+n);
int ans=0;
for(int i=n-1;i>=0;i--){
h -= b[i];
ans++;
if(h<=0)break;
if(a[n-1]>b[i-1])break;
... | 0 | 3,397,688 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main(){
string s,t;
cin>>s>>t;
ll ca = 0;
for(ll i=0; i<3; i++){
if(s.at(i)==t.at(i)){
ca++;}}
cout << ca << endl;} | #include <iostream>
#include <string>
using namespace std;
class dice{
public:
int t[7][6];
dice(){
}
void ready(){
t[1][1]=t[5][0], t[1][2]=t[4][0], t[1][3]=t[2][0], t[1][4]=t[3][0], t[1][5]=t[5][0];
t[2][1]=t[1][0], t[2][2]=t[4][0], t[2][3]=t[6][0], t[2][4]=t[3][0], t[2][5]=t[1][0... | 0 | 37,474,932 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
int tmp;
int asum = 0;
int bsum = 0;
for (int i = 0; i < 4; i++) {
cin >> tmp;
asum += tmp;
}
for (int i = 0; i < 4; i++) {
cin >> tmp;
bsum += tmp;
}
if (asum > bsum) {
cout << asum;
}
else cout ... | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-3;
int dx[4]={0,1,0,1};
int dy[4]={0,0,1,1};
vector<int> G[10... | 0 | 96,148,778 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int... | 0 | 57,572,547 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=a;i<b;++i)
int main() {
int A = 0, B = 0, a;
for_(i,0,4) scanf("%d", &a), A += a;
for_(i,0,4) scanf("%d", &a), B += a;
printf("%d\n",max(A,B));
return 0;
} | #include <stdio.h>
int main(void)
{
int i;
int d;
int ans;
while (scanf("%d", &d) != EOF){
ans = 0;
for (i = d; i <= 600 - d; i += d){
ans += (i * i) * d;
}
printf("%d\n", ans);
}
return (0);
} | 0 | 70,935,945 |
#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 <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dh[8] = {... | 0 | 80,381,767 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a,b;
cin>>a>>b;
if(a>=b){
cout<<10<<endl;
return 0;
}
cout<<0<<endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x,y) x = max(x, y)
#define mins(x,y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<int, ... | 0 | 81,094,158 |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double... | #include <bits/stdc++.h>
using namespace std;
const long long INF = (1<<29);
long long calc_digit(long long N){
long long res = 0;
while(N){
res++;
N /= 10;
}
return res;
}
void solve(long long N){
long long ans = INF;
for(long long A = 1; A * A <= N; A++){
if(N % A == 0)... | 0 | 50,867,681 |
#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int n;
cin >> n;
int total = 0;
int ans =... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<vector<vector<int> > > vvvint;
typedef vector<long lon... | 0 | 56,877,555 |
#include<bits/stdc++.h>
using namespace std;
#define l long int
#define ll long long int
vector<int>adj[1000001];
int vis[1000001];
int n=2005;
int dp[2005];
int fact[1000001];
#define mod 1000000007
ll sequence_sum(int a)
{
if(a==0)
return 1ll;
else if(a==1 || a==2)
return 0ll;
else if(a==3... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#define RG register
using namespace std;
const int N=103;
int n,a[N],maxx,num[N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'... | 0 | 21,802,989 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<double> x(n);
vector<string> u(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> u[i];
}
double sum = 0.0;
for (int i = 0; i < n; i++) {
if (u[i].compare("JPY") == 0) {
sum += x[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() {
int H, W, D;
cin >> H >> W >> D;
vector<vector<int>> A(H, vecto... | 0 | 43,873,128 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c; cin>>a>>b>>c;
bool ans=false;
for(int i=1; i<=b; i++){
if(a*i%b==c){
ans=true;
break;
}
}
cout<<(ans?"YES":"NO");
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define watch(x); cout << "\n" << #x << " is: " << x << "\n";
#define ll long long int
#define ff first
#define ss second
#define all(a) ... | 0 | 80,386,520 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 95,113,577 |
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 2e5 + 7;
const double eps = 1e-9;
const long double pi = 3.1415926535897932384626433... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define PER(i, a, b) for(int i = a; i >= b; i--)
#define LL long long
#de... | 0 | 8,857,952 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 300004
#define INF 1e9+7
using name... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#defi... | 0 | 13,560,912 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | #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... | 0 | 25,593,951 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.