code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
int main() {
int N; cin >> N;
vector<string> S(2 * N);
rep(i, 0, N) {
cin >> S[i];
S[i + N] = S[i];
}
int ans = 0;
rep(d, 0, N) {
bool ok = true;
rep(i, 0, N) rep(j, 0, ... | 0 | 92,488,151 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(void) {
int N,M,X; cin >> N >> M >> X;
int A[15][15] = {};
int C[15] = {};
ll ans = 1e9;
for(int i=0; i<N; i++) {
cin >> C[i];
for(int j=... | #include <bits/stdc++.h>
using namespace std;
bool isValid(vector<int>&v1,vector<int>&v2){
int value = 0;
for(int i = 0; i < v1.size(); i++){
value += pow(v1[i]-v2[i],2);
}
for(int i = 1; i <= (value); i++){
if((i*i)==value){
return true;
}
}
return false;
}
i... | 0 | 88,559,547 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int a[5][5], b[5][5];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
for(int i = 0; i < 3; i++){
for(int j = 0; j < 3; j++){
cin >> a[i][j];
}
}
int x;
... | #include <bits/stdc++.h>
using namespace std;
int n;
void dfs(int level, pair<double, double> pl, pair<double, double> pr){
if(level < n){
pair<double, double> p1, p2, p3;
p1 = make_pair((pl.first * 2 + pr.first) / 3, (pl.second * 2 + pr.second) / 3);
p3 = make_pair((pl.first + pr.first * 2... | 0 | 13,234,815 |
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (long l... | #include "bits/stdc++.h"
using namespace std;
int main() {
string s, ss;
int n, m;
while (true) {
cin >> s;
if(s=="-"){return 0;}
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> m;
s.insert(s.length(), s.substr(0, m));
s.erase(0,m);
}
cout << s << endl;
}
} | 0 | 35,602,779 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MA... | #include<bits/stdc++.h>
using namespace std;
int h,w,m,h1,w1,maxr,maxc,row[300005],col[300005];
vector<int> vr;
vector<int> vc;
set<pair<int,int> > st;
int main(){
cin>>h>>w>>m;
for(int i=1;i<=m;i++){
cin>>h1>>w1;
st.insert(make_pair(h1,w1));
row[h1]++;
if(row[h1]==maxr){
vr.push_back(h1);
}
if(row[h1]... | 0 | 74,899,165 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int x;
int ans;
long long sum=360;
scanf("%d",&x);
if(sum%x==0)ans=sum/x;
else
{
for(int i=1;;i++)
{
sum=i*360;
if(sum%x==0)
{
ans=sum/x;
break;
}
}
}
printf("%d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 4,574,089 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define FOR(i,a,b) for(int i=int(a);i<int(b);++i)
#define RFOR(i,a,b) for(int i=int(b)-1;i>=int(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
int main() {
double x1,x2,y1,y2,x,y;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
typedef long long ll;
ll a,b,k,l,m;
cin>> a>> b>> k;
if((a+b)<k)
{
cout<< "0 0"<< endl;
}
else if(k>=a)
{
l=k-a;
m=b-l;
cout<< "0 "<< m;
}
else
{
l= a-k;
cout<< l<< " "<<... | 0 | 22,793,421 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long n;
int main()
{
cin>>n;
long long p=ceil(sqrt(n*1.0));
for(long long i=p;i>=1;i--)
{
if(n%i==0)
{
cout<<(long long)i+(n/i)-2LL<<endl;
break;
}
}
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,a;
vector <int> v;
while(cin >> n,n){
for(int i = 0;i < n;i++){
cin >> a;
v.push_back(a);
}
sort(v.begin(),v.end());
int sum = 0;
for(int i = 1;i < n-1;i++){
sum += v[i];
}
... | 0 | 93,137,384 |
#pragma GCC optimze("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 1000000007
#define md 998244353
#define trace(...)
#define ll long long int
#define ld long double
#define fi first
#define se ... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T, typename E>
struct SkewHeap{
typedef function<T(T, E)> F;
typedef function<E(E, E)> G;
typedef function<bool(T,T)> C;
F f;
G g;
C c;
E e;
SkewHeap(... | 0 | 19,311,280 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll N, a, ans = 0;
cin >> N;
vector<ll> cnt(100001);
for(ll i = 0; i < N; i++) {
cin >> a;
if(a > 100000) ans++;
else cnt.at(a)++;
}
for(ll i = 1; i <= ... | #include <iostream>
#include <vector>
#include <list>
#include <set>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using pii=pair<int,int>;
using vs=vector<string>;
using vpii=vector<pii>;
using si=set<int>;
#d... | 0 | 64,845,144 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1,... | 0 | 38,528,826 |
#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 <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str;
t... | 0 | 42,709,435 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int a,b; c... | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 0 | 18,395,777 |
#include <stdio.h>
using namespace std;
void output(int H[3][10]){
for(int i = 0; i < 3; i++){
for(int j = 0; j < 10; j++){
printf(" %d",H[i][j]);
}
printf("\n");
}
}
int main(){
int H1[3][10],H2[3][10],H3[3][10],H4[3][10],n,h_num,f_num,r_num,div_num;
for(int i = 0; i... | #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) { ... | 0 | 89,117,758 |
#include<iostream>
#include<cstring>
using namespace std;
const int N=2e5+10;
int n,m;
int p[N];
int Size[N];
int find(int x){
if(x!=p[x]) p[x]=find(p[x]);
return p[x];
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;++i){
p[i]=i;
Size[i]=1;
}
for(int i=0;i<m;++i){
int a,b;
... | #define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const long long INF = 1LL << 60;
ll MOD = 1e9+7;
vector<int> Graph[2*100000+1];
vector<bool> visitGraph(2*100000+1,false);
vector<int> ansGraph(2*100000+1, 0);
void bfs(){
queue<int> q;
q.push(1);
visitGraph[1] = ... | 0 | 87,597,946 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
int n,m,x;
cin >> n >> m >> x;
vector <int> c(n);
vvint a(n,vector <int>(m));
for(int i = 0;i < n;++i){
cin >> c[i];
for(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define itn int
int main(void){
int n,m;
cin >> n >> m;
int a[m];
map<int,int> mp;
for(int i = 0;i < m;i++){
cin >> a[i];
mp[a[i]]++;
}
ll mod = 1e9+7;
vector<ll> dp(n+1,0);
dp[0] = 1;
if(mp[1] != 1... | 0 | 77,526,626 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
vector<int> u(30, -1), v(30, -1);
cin >> s >> t;
for (size_t i = 0; i < s.size(); i++) {
int p = s[i] - 'a', q = t[i] - 'a';
if (u[p] == -1) u[p] = q;
else if (u[p] != q) {
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
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;
}
int main(){
int N, M;cin>>N... | 0 | 4,448,568 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
int main() {
int n; cin >> n;
map<int,int> mp;
rep(i,n){
int a;
cin >> a;
mp[a]++;
}
bool f = true;
for(pair<int,int> p : mp){
if(p.second > 1) f = false;
}
if(f) cout... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<vector<int>> ab(M, vector<int>(2));
vector<vector<int>> ba(M, vector<int>(2));
for (int i=0; i<M; i++)
{
int x, y;
cin >> x >> y;
ab[i][0] = x;
ab[i][1] = y;
ba[i][0]... | 0 | 69,624,893 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
set<int> s;
int n,a;
cin>>n;
for(int i=0; i<n; i++)
{
cin>>a;
s.insert(a);
}
if(n==s.size())
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
} | #include<iostream>
#include<vector>
#include<string>
int main(){
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n);
for(int i = 0; i < n + 1; i++) std::cin >> a[i];
for(int i = 0; i < n; i++) std::cin >> b[i];
long long sum = 0;
for(int i = 0; i < n; i++){
if(a[i] <= b[i]){
... | 0 | 61,038,146 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
#include <chrono>
#include <random>... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int ma... | 0 | 60,408,232 |
#include<bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<int>fl(N + 2);
for (int i = 1; i <= N; i ++) cin >> fl[i];
fl[0] = fl[N+1] = 0;
int ans = 0;
for (int i = 0; i < 100; i ++) {
int kj = 0;
for (int j = 1; j < N + 2; j ++) {
if (fl[j - 1] <= 0 && fl[j] > 0) {
... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth == 0)
{
ret.push_back(s);
... | 0 | 63,466,517 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,D,answer=0,a,b=0,count=0;
cin>>N>>D;
vector<vector<int>> X(N,vector<int>(D));
for (int i=0; i < N; ++i) {
for (int j=0; j < D; ++j) {
cin >> X[i][j];
}
}
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
b=0;
for(int k=... | #include <iostream>
#include <map>
using namespace std;
int main(){
map<int, int> m, r;
int a[6], n, x, y;
int d[6][6]={{0,3,5,2,4,0},{4,0,1,6,0,3},{2,6,0,0,1,5},
{5,1,0,0,6,2},{3,0,6,1,0,4},{0,4,2,5,3,0}};
for(int i = 0;i < 6;i++){cin >> a[i];m[a[i]] = i;r[i] = a[i];}
cin >> n;
for(int i = 0;i < n;i++){
cin ... | 0 | 75,411,065 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int K;cin>>K;
... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
#include <boost/dynamic_bitset.hpp>
using namespace std;
using namespace boost::adaptors;
using ll = int64_t;
using vecint = vector<int>;
using ve... | 0 | 45,201,911 |
#include<iostream>
#include<vector>
#include<algorithm>
#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--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(a) (a).begin(),(a).end()
#define PI 3.141592653589793238
#define INF 1050... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
uint64_t a[100'000], b[100'000];
uint64_t x = 0;
cin >> n;
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n;++i) x ^= a[i];
for(int i=0;i<n;++i) b[i] = a[i] & (~x);
int st = 0;
for(int i=59;i>=0;--i){
for(int j... | 0 | 21,533,353 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int N;
cin >> N;
bool ans = false;
for (int f = 0; f <= 25; f++)
{
for (int s = 0; s <= 15; s++)
{
if (N == f * 4 + s... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | 0 | 53,333,148 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
double a, b;
cin >> a >> b;
cout << a - b + 1 << "\n";
} | #include<iostream>
using namespace std;
#include<set>
#define int long long int
#define mod 1000000007
int power(int a,int b)
{
if(b==0)
return 1;
if(b==1)
return a;
else
{
if(b%2==0)
{
int r=power(a,b/2);
r=r*r;
return r;
}
else
{
int r=power(a,b/2);
r=r*r;
r=r*a;
return r... | 0 | 58,756,932 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b!=0?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
int main(){
ll n,k;
cin>>n>>k;
cout<<(n-1+k-1-1)/(k-1)<<endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | 0 | 17,799,672 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll H,W;
cin>>H>>W;
vector<vector<char>> vec(H,vector<char>(W));
for(ll i=0;i<H;i++) {
for(ll j=0;j<W;j++) {
cin>>vec[i][j];
}
}
set<ll> tate;
set<ll> yoko;
for(ll i=0;i<H;i++) {
... | 0 | 60,020,203 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool c... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main() {
int h,w;
cin>>h>>w;
int ans=0;
vector<string> field(h);
int vec[h][w];
for(int i=0;i<h;i++){
cin>>field[i];
for(int j=0;j<w;j++){
if(field[i][j]... | 0 | 10,172,558 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0; (i)<(n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n,ans=0;cin>>n;
for(ll i=1;i*i<=n;++i) {
if((n-i)%i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 75,812,529 |
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <functional>
#include <complex>
#include <cmath>
#include <vector>
#include <climits>
#include <set>
using namespace std;
int main()
{
int n;
int g[10][10];
while (cin >> n, n) {
set<int> pat;
fill((int *)g, (int *)(g + 10), INT_MAX ... | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
cout << fixed << setprecision(6);
long long a,b,k ; cin >> a >> b >> k;
long long n=a,m=b;
if(a>k) n = a-k;
else if(b > k-a) {
... | 0 | 37,975,345 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | 0 | 94,890,198 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (c >= a && c <= b)
{
cout << "Yes" << "\n";
}
else
{
cout << "No" << "\n";
}
return 0;
} | 0 | 93,917,215 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin >> c;
string vowel = "aeiou";
bool x = false;
for (int i = 0;i < vowel.size(); i++) {
if (c.at(0) == vowel.at(i)) {
x = true;
break;
}
}
if (x) {
cout << "vowel" <<endl;
} else {
cout << "consonant" <<en... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,k;
cin >> n >> k;
vector<ll> a(n);
for(i = 0;i < n;++i){
cin >> a.at(i);
}
if(k >= 50){
for(i = 0;i < n;++i){
... | 0 | 72,718,644 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main(){
string s; cin >> s;
set<char> SET;
for(lint i = 0; i < s.size(); i++) SET.insert(s[i]);
lint N = s.size();
if(N == 26){
if(s == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
else{
... | 0 | 50,831,239 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 0 | 52,150,744 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define booster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PB push_back
#define F first
#define S second
#define forn(i,n) for(int i=0;i<n;i++)
const int mod=1e9+7;
ll xor1_n(ll n){switch(n%4){case 0:return n;case 1:return ... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 61,856,962 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<cmath>
#include<math.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<unordered_map>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rep2(i,n) for(int i = -1; i < (n); i++)
#define PI 3.141592653589793
using namespace std... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define max(a,b) (a>b)?a:b
#define min(a,b) (a<b)?a:b
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define mod 1000000007
int main()
{
fast
#ifndef ONLINE_JUDGE
freopen("inpu... | 0 | 5,301,482 |
#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>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int N, K, R, S, P;
void func()
{
cin >> N >> K;
cin >> R >> S >> P;
string T;
cin >> T;
int ans(0), max(0), v[N];
rep(i, ... | 0 | 92,285,936 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> p;
typedef unsigned long long i... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 9,668,778 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fix cout << fixed; cout << setprecision(0)
void solve() {
string s;
cin >> s;
if(s[2] == s[3] && s[4] == s[5]) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
fix;
solve();
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
ll a, b, c, k;
int main()
{
cin >> a >> b >> c >> k;
ll ans = 0;
if (k >= a)
{
ans += a;
k -= a;
}
else
{
ans += k;
k = 0;
}
if (k >= b... | 0 | 6,503,623 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | 0 | 54,040,821 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
int mo[100005];
const int N=1000000007;
int binpow(int x, int y)
{
int res = 1;
x = x % N;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % N;
y... | 0 | 43,136,797 |
#include<bits/stdc++.h>
#define N 100005
using namespace std;
const int P=1e9+7;
int fac[N],inv[N],F[N];
int n,L,R,x,i,m;
int Pow(int a,int b){
int ret=1;
for (;b;b>>=1,a=1ll*a*a%P)
if (b&1) ret=1ll*ret*a%P;
return ret;
}
int C(int n,int m){
if (n<m) return 0;
return 1ll*fac[n]*inv[m]%P*inv[n-m]%P;
}
int main()... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <class T... | 0 | 31,675,395 |
#include <iostream>
int main() {
int w, h, x, y, r;
std::cin >> w >> h >> x >> y >> r;
if (w >= x + r && h >= y + r && x + r > 0 && y + r > 0) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
return 0;
} | #include<bits/stdc++.h>
#include<numeric>
using namespace std;
const long double PI = 3.141592653589793238;
const double EPS = 1e-6 ;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define dd double
#define vll vector<ll>
#define vs vector<string>
#define fn(i,n) for(ll i = 0; i<n; i... | 0 | 8,404,287 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int A[n], B[n];
for(int i = 0; i < n; i++){
cin >> A[i];
}
B[0] = 0; B[1] = abs(A[1] - A[0]);
for(int i = 2; i < n; i++){
int one = abs(A[i] - A[i-1]), two = abs(A[i] - A[i-2]);
B[i] = min(B[i-1]... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) fo... | 0 | 96,799,771 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin>>N>>M;
vector<int>A(M,200001);
vector<int>B(M,-1);
for(int i=0;i<M;i++){
int a,b; cin>>a>>b;
if(a==1)A[i]=b;
if(b==N)B[i]=a;
}
sort(A.begin(),A.end());
sort(B.begin(),B.end());
for(int i=0;i<M;i++){
if(A[i]==200001)br... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
vector<string> divide = {"dream", "dreamer", "erase", "eraser"};
int main() {
string S;
cin >> S;
reverse(S.begin(), S.end());
rep(i, 4) reverse(divide[i].begin(), divide[i].end());
bool can = true;
... | 0 | 52,129,432 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
ll calc(ll A)
{
if (A <= 0)
return 0;
ll ans = 0;
for (int i = 0; i < 50;... | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 55,483,949 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a;
cin >> b;
if (a.length() > b.length()) {
cout << "GREATER" << endl;
return 0;
}
else if (a.length() < b.length()) {
cout << "LESS" << endl;
return 0;
}
for (int i = 0; i < a.length(); i++) {
if (a.at(i) == b.at(i)) conti... | #include <iostream>
using namespace std;
int main() {
int K;
string S;
cin >> K;
cin >> S;
if (int(S.length()) <= K) {
cout << S << endl;
} else {
for (int i = 0; i < K; i++) {
cout << S[i];
}
cout << "..." << endl;
}
return 0;
} | 0 | 56,168,876 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); retur... | 0 | 49,960,522 |
#include <bits/stdc++.h>
#define mid ((l+r)>>1)
using namespace std;
typedef long long lnt;
template <class T> inline void read(T &x) {
x = 0; int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar()) if (c == 45) f = -1;
for (; isdigit(c); c = getchar()) (x *= 10) += f*(c-'0');
}
int n; lnt a[55], s, tot;
bool c... | #include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)
#def... | 0 | 30,085,599 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s; cin>>s;
int n=s.size();
ll ans=0;
int b=0;
int i=0;
for (int i=0; i<n; i++){
if(s[i]=='B') b++;
if(s[i]=='W') ans+=b;
}
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<cstdio>
using namespace std;
int main(){
int i=0,num=0,x=0,ii;
char number[1000]={};
while(1){
scanf("%c",&number[i]);
if(number[0]=='0'){
break;
}
if(number[i]==0x30){
x=0;
... | 0 | 62,723,672 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a;
cin>>a;
if(a[0]==a[1] && a[1]!=a[2] && a[2]==a[3])cout<<"Yes"<<endl;
else if(a[0]==a[2] && a[2]!=a[1]&& a[1]==a[3])cout<<"Yes"<<endl;
else if(a[0]==a[3] && a[3]!=a[1]&&a[1]==a[2])cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 36,702,058 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int ans = 1000;
int s1 = 0,s2 = 0;
vector<int> w(n);
for(int i = 0; i < n; i++)
cin >> w.at(i);
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(j <= i)
s1 += w.at(j);
else
s2 += w.at(j);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n,k;
vector<int> l;
vector<int> r;
int ans = 1;
void input(){
cin >> n >> k;
}
void solve(){
rep(i,n){
if (ans+k <= ans*2){
ans += k;
} else {
ans *= 2;
}
}
... | 0 | 72,327,200 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c,d,e,i,j,k=0;
vector<long long>v;
cin>>a>>b;
while(1)
{
if(a>b)break;
a=a*2;k++;
}
cout<<k<<endl;
} | #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 | 39,360,598 |
#include <bits/stdc++.h>
using namespace std;
int mcxi_to_int(string s);
string int_to_mcxi(int n);
int main()
{
int n;
scanf("%d", &n);
while (n--){
string a, b;
cin >> a >> b;
int result = mcxi_to_int(a) + mcxi_to_int(b);
cout << int_to_mcxi(result) << endl;
}
return (0);
}
int mcxi_to_int(string s)
{
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
vector<ll> a(n),b(n),c(m),d(m);
rep(i,n){
cin >> a.at(i) >> b.at(i);
}
rep(i,m){
cin >> c.at(i) >> d.at(i);
}
rep(i,n){
ll sum=1e9+7,ans;... | 0 | 38,724,746 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int k;
cin>>k;
string ans="Yes";
while(b<=a)
{
b*=2;
k--;
}
if(k<0)
{
ans="No";
}
else
{
while(c<=b)
{
c*=2;
k--;
}
if(k<0)
{
ans="No";
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int b[(int)1e6+7]={},minfact[(int)1e6+7]={},Isprime[(int) 1e6+7]={},p[(int) 1e6+7]={};
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
int algcd = a[0];
for(int i=0;i<n;i++... | 0 | 93,159,754 |
#include <bits/stdc++.h>
using namespace std;
void solve(char C){
cout << (char)(C + 1) << endl;
}
int main(){
char C;
std::cin >> C;
solve(C);
return 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>
#include <cmath>
#include <bitset>
#... | 0 | 63,498,298 |
#include <bits/stdc++.h>
const int N = 7;
char s[N][N];
int main(){
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; ++ i){
scanf("%s", s[i]);
}
int cnt = 0;
for (int i = 0; i < 1 << n; ++ i){
for (int j = 0; j < 1 << m; ++ j){
int ccnt = 0;
... | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 22,323,853 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double t, x;
cin >> t >> x;
cout << fixed << setprecision(9999999) << t / x << endl;;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> drink(n);
for(int i=0; i<n; i++){
int a,b;
cin >> a >> b;
pair<int, int> p=make_pair(a,b);
drink.at(i) = p;
}
sort(drink.begin(), drink.end... | 0 | 38,144,583 |
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890123456789LL
#defi... | #include<iostream>
int res = 0;
void rec(int n, int s, int least_n){
if(n == 1 && least_n <= s && s < 10){
res++;
}
for(int i=least_n;i<10;i++){
rec(n-1, s-i, i+1);
}
}
int main(){
int n, s;
while(std::cin >> n >> s, n){
res = 0;
rec(n, s, 0);
std::cout << res << std::endl;
}
} | 0 | 96,609,089 |
#include<cstdio>
#include<cstring>
const int N=12,INF=0x3f3f3f3f;
int g[N][N],n;
void minz(int &a,int b) { if(a>b) a=b; }
int main()
{
int i,j,k,x,sum,cn;
scanf("%d",&n);
while(n) {
memset(g,0x3f,sizeof(g));
cn=0;
for(i=0;i<n;i++) {
scanf("%d%d%d",&j,&k,&x);
if(j>cn) cn=j;
if(k>cn) cn=k;
g[j][k]=g[... | #include <bits/stdc++.h>
#define ll long long
int v[10];
int ans = 1490390;
int n,A,B,C;
void dfs(int a,int b,int c,int i,int unite){
if(v[i] == -1){
if(a == 0 || b == 0 || c == 0)return;
std::vector<int>tmp(3);
tmp[0] = a,tmp[1] = b,tmp[2] = c;
sort(tmp.rbegin(),tmp.rend());
a = tmp[0],b = tmp[1]... | 0 | 33,983,887 |
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
#define MSI map<string,int>
#define MIS map<int,string,greater<int> >
using namespace std;
int main()
{
string word;
MSI msi;
MIS mis;
while(cin >> word){
msi[word]++;
mis[word.length()] = word;
}
int arise = 0;
for(MSI::ite... | #include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | 0 | 24,195,182 |
#include <bits/stdc++.h>
#define rep(i, n) ; for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int digit(int n){
int a = n % 10;
return a;
}
int main(){
int last = 10;
int index = 0;
vector<int> vec(5);
rep(i,5){
cin >> vec[i];
}
rep(i, 5){
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 1001001001001001000;
int main() {
int n; cin >> n;
string s; cin >> s;
if (n%2) {... | 0 | 98,253,011 |
#include<iostream>
#include<string>
using namespace std;
int f(int y){
int ans = 1;
for(int i = 0;i < y;i++){
ans *= 10;
}
return ans;
}
long long g(int x,int y){
long long ans = 1;
for(int i = 0;i < y;i++){
ans *= x;
}
return ans;
}
int main(){
string s;
long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin>>s>>t;
int sn=s.size();
int tn=t.size();
map<string,int>mp;
string kotae;
if(sn<tn){
cout<<"UNRESTORABLE"<<endl;
return 0;
}
for(int i=0;i<sn-tn+1;i++){
bool hantei=true;
for(int j=0;j<tn;j++){
if(s[i+j]==... | 0 | 59,460,018 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef pair<int, int> pii;
typedef pair<string, int> P;
typedef ... | #include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define BIT(i,j)... | 0 | 30,757,426 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#inc... | 0 | 37,309,816 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n, m;
cin >> n >> m;
vector<ll> c(n+1,0);
rep(i, 0, m){
ll a, b;
cin >> a >> b;
c[a]++;
c[b]++;
}
rep(i... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
signed main(){
int w,h;cin>>w>>h;
int res=0;
vector<int> p(w);
vector<int> q(h);
rep(i,w){
cin>>... | 0 | 14,291,997 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int i = s; i < e; i++)
#define endl '\n'
int main()
{
int n, x, t;
cin >> n >> x >> t;
int ans = (n +x-1)/x * t;
cout << ans << endl;
} | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int h, w, d;
scanf("%d%d%d", &h, &w, &d);
map<int, pair<int, int>> mp;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
int a;
scanf("%d", &a);
mp[a] = {i, j};
}
}
vector<int> dist(h * w);
for (int i = ... | 0 | 7,552,495 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int64_t GreatestCommonDivisor(const int64_t a, const int64_t b) {
int64_t result = -1LL;
if (a < 0) {
std::cerr << "ERROR: GreatestCommonDivisor(): a is out of range: " << a << std::endl;
throw 1;
} else... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int a[n];
for (int i = 0; i < n; i++) scanf("%d",&a[i]);
int p[n][18]; memset(p,-1,sizeof(p));
int l;
scanf("%d",&l);
int cur = 0;
for (int i = 0; i < n; i++){
while (cur < n && a[cur] - a[i] <= ... | 0 | 14,300,945 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
}
int MIN = 200 * 200 * 100;
for (int i = -100; i <= 100; i++) {
int sum = 0;
rep(j, n) {
s... | #include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<string>
#include<fstream>
#include<set>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define forl(i,a,n) for(int i=a;... | 0 | 93,799,997 |
#include <bits/stdc++.h>
#define INF 100000007
#define rep(i, N) for(ll i = 0; i < N; i++)
#define rep2(i, j, k) for(ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = inx(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) rep(i, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int w,h,n;
cin >> w >> h >> n;
int a,b,c;
int x=0,y=0;
for (int i=0; i<n; i++) {
cin >> a >> b >> c;
switch (c) {
case 1:
if (x < a) {
x = a;
}
break;
case 2:
if (w > a) {
w = ... | 0 | 34,424,841 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define per(i,a,b) for(ll i=a; i>=b; i--)
#define ... | #include<bits/stdc++.h>
#define ll long long int
#define loop(i,a,b) for(i=a;i<b;i++)
#define mod 998244353
#define INF 1000000000000
#define pb push_back
#define lim 200001
using namespace std;
int main()
{
ll h,w,i,j;
cin>>h>>w;
char s[h+1][w+1];
ll dp[h+1][w+1];
loop(i,0,h)
cin>>s[i];
dp[0][0]=0;
... | 0 | 49,353,580 |
#include <iostream>
#include <climits>
using namespace std;
inline int max (int a, int b) {
return a > b ? a : b;
}
int main (void) {
int n, i, j;
while (1) {
cin >> n;
if (n == 0) break;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int sum =... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
#include <cstdlib>
#include <queue>
#include <map>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<lli... | 0 | 8,359,113 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | #include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int a[10],b[10],p[10];
int cnt1,cnt2;
b... | 0 | 55,832,527 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll N;
string s;
int main(){
cin>>N>>s;bool y=false;vector<ll>a(N);
for(ll I=0;I<2;I++){
for(ll J=0;J<2;J++){
a[0]=I;a[1]=J;
for(ll i=1;i<N-1;i++)
if((a[i]==1 && s[i]=='o')||(a[i]==0 && s[i]=='x')){
a[i+1]=1-a[i-1];
}else
... | #include "bits/stdc++.h"
#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=m-1;i>=n;--i)
#define ALL(v) v.begin(),v.end()
#define PB(a) push_back(a)
#define INF 1000000001
#define MOD 1000000007
using namespace std;
int ... | 0 | 28,013,414 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#d... | #include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int n,m,x;
int main()
{
scanf("%d%d",&n,&m);
int ans1=0,ans2=0;
for (int i=1;i<=n;i++) {
scanf("%d",&x);
ans1=(ans1+1LL*(2*i-n-1)*x%mod)%mod;
}
for (int i=1;i<=m;i++) {
scanf("%d",&x);
ans2=(ans2+1LL*(2... | 0 | 44,292,855 |
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(){
int N;
cin >> N;
int pos[3][N+1];
for (int i=1;i<=N;i++){
cin >> pos[0][i] >> pos[1][i] >> pos[2][i];
}
pos[0][0]=0;
pos[1][0]=0;
pos[2][0]=0;
int n,flag=0;
for (int i=1 ;i<=N;i++){
n= (pos[0][i]-pos[0]... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 17,993,864 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
for(int i=0;i<=N;i++) {
for(int j=0;j<=N-i;j++) {
if(10000*i+5000*j+1000*(N-i-j)==Y) {
cout << i << " " << j << " " << N - i - j << endl;
exit(0);
}
}
... | 0 | 95,520,645 |
#include<bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define REPvec(itr, mp) for(auto itr = mp.begin();itr != mp.end(); itr ++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<int > vecint;
typedef vector<double > vecd;
typedef ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP... | 0 | 82,468,196 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 0;
rep... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if (c >= a && c <= b) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 0 | 27,904,008 |
#include <bits/stdc++.h>
using namespace std;
int main () {
char x,y;
cin >> x >> y;
int a=x-55,b=y-55;
if (x<y) cout << "<" << endl;
else if (x>y) cout << ">" << endl;
else cout << "=" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, M;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> M;
ll nsum = 0, nans = 0;
for (int i = 0; i < N; i++)
{
ll x;
cin >> x;
nans += (x * i - nsum);
nans %= MOD;
... | 0 | 49,358,932 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T... | #include <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <algorithm>
#include <stack>
#include <cstdlib>
#include <iomanip>
#include <ctime>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long... | 0 | 88,236,283 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long double eps = 1.0E-14;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<(ll)b;i++)
#d... | 0 | 85,719,815 |
#include<bits/stdc++.h>
using namespace std;
int n,k,a[100003];
int main(){cin>>n>>k;
for(int i=0;i<n;i++)
scanf("%d",a+i);
int mxm=0,j=-1;
for(int i=1;i<n;i++)
if(a[i-1]+a[i]>mxm){
mxm=a[i-1]+a[i];
j=i;
}
if(mxm<k)
cout<<"Impossible";
else{
cout<<"Possible";
for(int i=1;i<j;i++)
cout<<endl<<i... | #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 chmax(x,y) x = max(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> c... | 0 | 94,565,315 |
#include<bits/stdc++.h>
using namespace std;
int i,j,cnt,degit,N;
int main(){
cin >> N;
for(i=0,cnt=0;i<=N;++i){
for(j=i,degit=0;j;){
j/=10;
++degit;
}
if(degit%2){
++cnt;
}
}
cout << cnt;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <complex>
using namespace std;
#define rep(i,n) for (int i=0; i < (n); i++)
typedef double D;
typedef complex<D> P;
typedef pair<P, P> L;
typedef vector<P> VP;
const D EPS = 1e-9;
#define X real()
#define Y imag()
#defin... | 0 | 75,038,535 |
#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;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
template <class... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | 0 | 76,331,692 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int _w;
int n , m , f[N][N][2][2] , flag;
long long ans;
char str[N];
int main( void ) {
_w = scanf("%s%d",str+1,&m);
n = strlen( str + 1 );
if( str[1] != str[n] || m == 1 ) {
for( int i = 1 , r ; i <= n ; i = r + 1 ) {
r = i;
wh... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 9,101,907 |
#include<bits/stdc++.h>
using namespace std;
#define deb(x) cout <<"\n"<< (#x) << " = " << (x) << "\n"
const long long INF = 1e18;
const long long mod=1e9+7 ;
void inputoutput()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, kakikae = 0;
cin >> n >> k;
map<int, int> a;
for (int i = 0; i < n; i++) {
int ai; cin >> ai;
if (a.count(ai)) a[ai]++;
else a[ai] = 1;
}
int syurui = a.size();
if (syurui <= k) goto OUT;
for (int i = 1; i < n; i++) {
... | 0 | 68,095,943 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long int ll;
#define PI (acos(-1))
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define dump(x)... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | 0 | 21,923,999 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
cout << "Christmas";
A -= 25;
while(A<0){
cout << " Eve";
A++;
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin >> n >> k;
vector<int> p(n);
vector<int> c(n);
for(int i = 0; i < n; i++) cin >> p[i];
for(int i = 0; i < n; i++) --p[i];... | 0 | 16,144,479 |
#include<iostream>
using namespace std;
int main(){
bool pn[1000010];
int sum[1000010] = {0};
int n;
for(int i = 0; i <= 1000000; i++) {
pn[i] = true;
}
pn[1] = false;
for(int i = 1; i <= 1000000; i++) {
if(!pn[i]) continue;
for(int j = 2; i*j <= 1000000; j++) {
if(pn[i*j]) pn[i*j] = false;
}
}
for(... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, m, f = 1, b;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
f = f * a / gcd(f, a);
ll cnt = 0;
while(a % 2 == ... | 0 | 67,901,926 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <numeric>
#include <queue>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <map>
#include <functional>
#include <limits>
#include <set>
#include <stack>
#include ... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
while(true){
int n;
cin >> n;
if(n == 0)
break;
vector<int> p(n);
int nmax = -1, nmin = 1001;
int imax, imin;
for(int i=0; i<n; i++){
cin >> p[i];
if(p[i] > nmax){
nmax = p[i];
imax = i;
}
... | 0 | 24,477,987 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<pair<int, int>> P(N);
for(int i = 0; i < N; ++i) {
int a; cin >> a;
P[i] = make_pair(a, i);
}
sort(P.begin(), P.end(), greater<pair<int, int>>());
multiset<int> ms;
ms.insert(-1);
ms.insert... | 0 | 64,475,084 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
double S(double a, double b, double c, double d, double e, double f) {
double ans;
ans = abs((a*1000 - e*1000) * (d*1000 - f * 1000) - (b * 1000 - f * 1000) * (c * 1000 - e * 1000));
return ans;
}
int main(){
double x[4], y[4], s[3], SS, SS... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
using namespace std;
int N;
vector<int> t,v;
vector<int> define_path(){
vector<int> path(accumulate(t.begin(),t.end(),1));
int x = 0;
int T = 0;
for(int i=0;i<N;i++){
path[T] = min(x, v[i]);
for(int j=T+1;j<=T+t[i];... | 0 | 73,491,447 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
string L;
cin >> L;
ll x=1;
ll y=2;
for(int i=1;i<L.size();i++){
if(L[i]=='0'){
x*=3;
x%=mod;
}
else{
x=x*3+y;
x%=mod;
y*=2;
y%=mod;
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a,b,c,x,y;
while (cin>>n>>a>>b>>c>>x) {
if (n==0&&a==0&&b==0&&c==0&&x==0) {
break;
} else {
std::deque<int> deq;
for (int i=0;i<n;i++) {
cin>>y;
deq.emplace_bac... | 0 | 66,042,114 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef complex<double> P;
#define EPS (1e-10)
#defi... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;scanf("%d%d",&n,&m);
int l=n/2,r=l+1;
if(n&1)for(int i=0;i<m;i++)printf("%d %d\n",l--,r++);
else{
l=1,r=m+1;
while(l<r)printf("%d %d\n",l++,r--);
l=m+2,r=2*m+1;
while(l<r)printf("%d %d\n",l++,r--);
}
return 0;
} | 0 | 78,771,528 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.... | 0 | 79,854,164 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using graph = vector<vector<char>>;
int main(){
string s;cin>>s;
ll c=0,ans=0;
rep(i,s.size()){
if(s.at(i)=='B'){c++;}
else{ans+=c;}
... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
string s;
cin >> s;
string t;
vector<int64_t> nx;
int64_t m = 0;
for (auto c : s) {
if (c == 'x') {
... | 0 | 99,413,602 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int H, W, D;
cin >> H >> W >> D;
vector<vector<int>> A(H, vector<int>(W));
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
cin >> A[i][j];
A[i][j]--;
}
}
int N = H * W;
vector<int> y(N), x(N);
for (int i = 0; i < H; i++){... | #include <iostream>
#include <string>
using namespace std;
int main()
{
while (true) {
int h, w;
cin >> h >> w;
if (!h && !w) break;
string s1(w, '#');
string s2(w, '.');
s2[0] = '#';
s2[s2.size() - 1] = '#';
cout << s1 << "\n";
if (h > 2)
... | 0 | 34,033,891 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.