code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N;
vector<int> A;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.push_back(a);
}
sort(A.begin(),A.end());
vector<bool> divisible(A[N-1] + 1,true);
... | 0 | 30,622,821 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<ll> A(N);
vector< bitset<100010> > B(60, bitset<100010>(0));
ll all_a = 0;
REP(i, N) {
ll ain;
cin >> A[i];
all_a ^= A[i];
}
REP(i,N)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
string s;
cin>>s;
int n=s.size();
if(s=="zyxwvutsrqponmlkjihgfedcba"){
cout<<-1<<endl;
... | 0 | 35,329,874 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b, c;
cin >> a >> b >> c;
if (a == b && b == c) cout << "... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout<<"\n";
long long prime[1000000];
void sieve()... | 0 | 58,619,584 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <bits/stdc++.h>
using namespace std;
vector<int> parent(vector<vector<int>> &E, int r){
int N = E.size();
vector<int> p(N, -1);
queue<int> Q;
Q.push(r);
while (!Q.empty()){
int v = Q.front();
Q.pop();
for (int w : E[v]){
if (p[w] == -1){
p[w] = v;
Q.push(w);
}
}
}
return p;
}
vecto... | 0 | 22,605,666 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int n;
cin >> n;
vector<int> b(n-1);
for(int i=0;i<n-1;i++){
cin >> b.at(i);
}
vector<int> a(n);
a.at(0)=b.at(0);
a.at(n-1)=b.at(n-2);
for(int i=1;i<n-1;i++){
a.at(i)=min(b.at(i),b.at(i-1));
}
ll sum=0;
for(in... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
const ll inf = 1000000001;
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F fi... | 0 | 27,821,384 |
#include<stdio.h>
int main(){
int x=0,y=0,i,j;
for(i=0; i<9; i++){
y=0;
++x;
for(j=0; j<9; j++){
++y;
printf("%dx%d=%d\n",x,y,x*y);
};
};
} | #include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);co... | 0 | 95,182,944 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | #include<bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int a[106];
int main(){
map<int,int> mp;
int a , b , c;
cin >> a >> b >> c ;
if(a==b){
cout << c << endl;
}
else ... | 0 | 20,891,203 |
#include <iostream>
using namespace std;
int main(void){
string card_t, card_h;
int n, point_t, point_h;
point_t = 0;
point_h = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> card_t >> card_h;
if (card_t > card_h) {
point_t += 3;
} else if (card_t < card_h)... | # include <iostream>
# include <stdio.h>
# include <cmath>
# include <iomanip>
# include <cstring>
# include <string>
# include <cctype>
# include <algorithm>
using namespace std;
class dice{
public:
int label[6];
void roll(char);
};
void dice::roll(char direction){
int temp;
if(direction == 'E'){
temp = l... | 0 | 96,395,144 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int a, b, k;
cin >> a >> ... | #include <cstdio>
#include <iostream>
using namespace std;
void swap(int &x,int &y){
int temp;
temp = x;
x = y;
y = temp;
}
main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a > b)swap(a,b);
if(a > c)swap(a,c);
if(b > c)swap(b,c);
printf("%d %d %d\n",a,... | 0 | 17,897,091 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
char s[30005];
int pre[30005][11]={0};
int suf[30005][11]={0};
int vis[1005]={0};
void solve(int dd,int num){
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
if(pre[dd-1][i]&&suf[dd+1][j]){
vis[i*100+nu... | #include<stdio.h>
#include<string>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<bitset>
#include<map>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<ctime>
#include<complex>
#include<list>
#include<limits.... | 0 | 67,648,461 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define ITR(v,c) for(auto v=begin(c);v!=end(c);v++)
#define FOR(v,a,n) for(int v=a;v<(int)(n);v++)
#define FORE(x,arr) for(auto &x:arr)
#define REP(v,n) FOR(v,0,n)
#define RREP(v,n) for(int v=(int)(n);v>=0;v--)
#define ALL(c)... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<in... | 0 | 30,685,962 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+20;
int n,a[N],mn=INT_MAX,x;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]<mn) x++;
mn=min(mn,a[i]);
}
cout<<x;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long n,k;
cin >> n >> k;
int a[n];
int i,j;
for(i=0;i<n;i++)cin>>a[i];
long ans = 0;
long const mod = 1e9+7;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(a[i]>a[j]){
if(i>j){
ans += k*(k-1)/2;
}else if(i<j){
... | 0 | 91,165,311 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
long long tmp=2e18;
int ans;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=-100;i<=100;i++){
long long sum=0;
for(int j=0;j<n;j++){
sum+=(... | 0 | 89,010,531 |
#include<bits/stdc++.h>
#define YY "YES\n"
#define NN "NO\n"
#define f first
#define s second
#define LL long long
using namespace std;
LL n,tar,ans;
int main(){
cin>>n>>tar;
for (int i=0;i<=n;i++){
for (int j=0;j<=n;j++){
if (tar-(i+j)<=n && tar-(i+j)>=0) ans++;
}
}
cout<<ans<<"\n";
} | #include <cassert>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long ... | 0 | 89,534,736 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
int n;
while (cin >> n){
if (n == 0)break;
vector<pair<char, char> >l;
string s;
for (int i = 0; i < n; i++){
pair<char, char>c;
cin >> c.first >> c.second;
l.push_back(c);
}
cin >> n;
for (int i = 0; i < n; ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
using namespace std;
long long x, y;
int main()
{
cin >> x >> y;
if (x % y == 0)
{
cout <<... | 0 | 66,063,409 |
#include<bits/stdc++.h>
using namespace std;
int prime[1000000];
int main(){
fill_n(prime,1000000,1);
prime[0]=prime[1]=0;
for(int i=2;i<1000000;i++){
prime[i]+=prime[i-1];
if(prime[i]==prime[i-1])continue;
for(int j=i+i;j<1000000;j+=i)prime[j]=0;
}
int n;
while(scanf("%d... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define... | 0 | 98,151,156 |
#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 <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
t... | 0 | 37,930,450 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
string s;
cin>>s;
int n=s.size();
deque<char> dq;
rep(i,n){
if(s[i]=='0') dq.push_b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N,M;
cin >> N >> M;
if (N == 1 && M == 1){
cout << 1 << endl;
}
else if ... | 0 | 18,222,161 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,j,k,l,m,a,c1,c2,s;
s=0;
cin>>n;
long long arr[n+10];
for(i=0;i<n;i++)
{
cin>>arr[i];
s+=arr[i];
}
c1=0;
c2=s;
l=1000000000000000;
for(i=0;i<n-1;i++)
{
c1+=arr[i];
s-=ar... | #include<bits/stdc++.h>
#define mp make_pair
#define ll long long
#define endl "\n"
using namespace std;
int main() {
ll h,w;
cin>>h>>w;
string s[h];
ll dp[h][w];
for(ll i=0;i<h;i++){
cin>>s[i];
}
dp[0][0]=1LL;
for(ll i=1;i<w;i++){
if(dp[0][i-1]==1&&s[0][i]=='.'){
dp[0][i]=1LL;
}
else{
dp[0][i]=0L... | 0 | 11,377,208 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int ,int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int a[MAXX];
int main()
{
_FastIO;
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a , a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for (i = a; i < b; i++)
#define REP_ITER(it, v) for (it = v.begin(); it != v.end(); it++)
#define FASTIO \
ios::sync_with_stdio(false); \
cin.tie(0)
#define TEST(test) \
int test; \
cin >> tes... | 0 | 61,849,107 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
int mx = max(A,max(B,max(C,D)));
int mn = min(A,min(B,min(C,D)));
cout << max((B-A)+(D-C)-(mx - mn),0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int main() {
int n, coin[6] = {500, 100, 50, 10, 5, 1};
while (cin >> n, n) {
int nn = 1000 - n, ans = 0;
for_(i,0,6) {
int d = nn / coin[i];
ans += d;
nn -= d * coin[i];
}
cout << ans << endl;
}
} | 0 | 36,595,076 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define range(a) a.begin(),a.end()
int main(){
const long mod=1e9+7;
int N,M;cin>>N>>M;
int S[N],T[M];
rep(i,0,N) cin>>S[i];
rep(i,0,M) cin>>T[i];
long dp[N][M]={};long sum[N][M]={};long temp=0;
rep(i,0,M){
if(S[0]==T[i]){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int k, n;
string s;
cin>>k>>s;
n = s.size();
if(n>k)
{
for(int i=0;i<k;i++)
{
cout<<s[i];
}
cout<<"...";
}
else
{
cout<<s;
}
cout<<endl;
return 0;
} | 0 | 74,568,941 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
boo... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main( void )
{
const int coins[6] = { 500, 100, 50, 10, 5, 1 };
int n;
while ( cin >> n && n )
{
vector <int> dp( (1000-n)+1, 0 );
for ( int i = 0; i < 6; i++ ) dp[coins[i]] = 1;
for ( int i = 0; i < (1000-n)+1; i++ )
{
i... | 0 | 11,145,322 |
#ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#endif
using namespace std;
void printHead(vector<int>& heap) {
for (size_t i = 0; i < heap.size(); ++i) {
auto h_index = i + 1;
cout << "node " << h_index << "... | #include <stdio.h>
int main(){
int n,a,b;
int sum =0;
scanf("%d %d %d",&n,&a,&b);
for(int i=1;i<=n;i++){
int x = 0;
int idx = i;
do{
x += (idx%10);
idx = idx / 10;
}
while(idx != 0);
if(x >= a && x <= b){
sum += i;
}
}
printf("%d",sum);
return 0;
} | 0 | 51,729,126 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
using namespace std;
typedef long long ll;
inline void open(const char *s)
{
#ifndef ONLINE_JUDGE
char str[20];
sp... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cctype>
#include <cmath>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <sstream>
#include <iomanip>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#... | 0 | 84,948,373 |
#include <iostream>
using namespace std;
class dice{
private:
int top;
int front;
int right;
int left;
int back;
int bottom;
public:
dice();
dice(int top,int front,int right,int left,int back,int bottom);
void roll(char ch);
int gettop();
int getfront();
int getright();
int getleft();
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int L = -1;
int sl = s.length();
int tl = t.length();
for (int i = 0; i < sl-tl+1; i++) {
for (int j = 0; j < tl; j++) {
if (s[i+j] != t[j] && s[i+j] != '?') break;
else if (j == tl-1) L = i;
}
}
... | 0 | 48,518,274 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
vector<ll> v(N + 1);
if (N == 0){
cout << 2 << endl;
return 0;
}
if (N == 1){
cout << 1 << endl;
return 0;
}
v[... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
int flag;
char ans[(int)(s.length())];
for(int j=0;j<(int)s.length();j++)ans[j]=s[j];
if((int)s.length()-(int)t.length()>0){
for(int i=0;i<(int)s.length()-(int)t.length();i++){
flag=0;
for(int... | 0 | 65,454,268 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
while(cin >> N){
vector<int> x(N);
for(auto& t : x) cin >> t;
int L; cin >> L;
vector<int> next(N, 0);
int dst = 0;
for(int i=0;i<N;i++){
while(dst != N-1 && x[i] + L >= x[ds... | 0 | 87,523,472 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int k,a,b; cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cout << "OK\n";
return 0;
}
}
cout << "NG\n";
} | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> T(N);
rep(i, N) { cin >> T[i]; }
vector<int> A(N);
rep(i, N) { cin >> A[i]; }
int Tpeak;
int prev = 0;
vector<bool> Lo... | 0 | 42,003,090 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
for( int i=0; i<n; ++i ) {
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
cout << ( ( ( y2 - y1 ) * ( x4 - x3 ) == ( y4 - y3 ) * ( x2 - x1 ) ) ? "YES" : "NO" ) << endl;... | #include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | 0 | 78,806,192 |
#include<stdio.h>
main(){int i=0,j;while(j=0|i++<9)while(10-j)printf("%dx%d=%d\n",i,j++,i*j);} | #include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.e... | 0 | 70,299,610 |
#include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=2e18;
c... | #include <bits/stdc++.h>
#define fori(a,b) for(int i=a;i<b;i++)
#define forj(a,b) for(int j=a;j<b;j++)
#define fork(a,b) for(int k=a;k<b;k++)
#define ford(i,a,b) for(int i=a;i>=b;i--)
#define seto(x,i) memset(x,i,sizeof x)
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define pf first
#define ps second
using na... | 0 | 59,082,631 |
#include<iostream>
using namespace std;
#include<stdio.h>
int main()
{
int *A;
int i, H;
scanf("%d", &H);
A = new int[H + 1];
for(i = 1; i <= H; i++) scanf("%d", &A[i]);
for(i = 1; i <= H; i++){
printf("node %d: key = %d, ", i, A[i]);
if(i / 2 > 0){ printf("parent key = %d, ", A[... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn], s[maxn];
int n, top;
bool check(int k)
{
top = 0;
for(int i = 2; i <= n; ++i)
{
if(a[i - 1] < a[i]) continue;
while(top && s[top] > a[i]) --top;
s[++top] = a[i];
while(top >= k && s[top - k + 1] == s[top])
{
int val = ... | 0 | 6,325,656 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<x<<endl
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
using P = pair<int,int>;
using Mat = vector<vector<int>>;
const ll inf = 1e18;
const int N = 2e5+10;
int main(){
int ... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 95,751,883 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;cin>>N;
string s,t;cin>>s>>t;
string ans="";
... | #include<stdio.h>
int main(){
int a[7],b,x,y,z,c[7];
for(int i=0;i<6;i++){
scanf("%d",&a[i]);
c[i]=a[i];
}
scanf("%d",&b);
for(int i=0;i<b;i++){
for(int i=0;i<6;i++){
a[i]=c[i];
}
scanf("%d %d",&x,&y);
for(int i=0;x!=a[0];i++){
if(i==4) break;
z=a[0];
a[0]=a[4];
a[4]=a[5];
a[5]=a[1];
... | 0 | 18,005,783 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[3];
cin>>a[0]>>a[1]>>a[2];
if(a[0]>a[1])swap(a[0],a[1]);
if(a[1]>a[2])swap(a[1],a[2]);
if(a[0]>a[1])swap(a[0],a[1]);
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
int n; scanf("%d", &n);
ll a[n + 5];
for (int i = 0; i <= n; i++) scanf("%lld", &a[i]);
ll c[n + 5];
c[n] = a[n];
for (int i = n - 1; i >= 0; i--) {
c[i] = a[i] + c[i + 1];
}
if (n == 0) {
if... | 0 | 86,810,018 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const double PI=acos(-1);
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i,a,b) for (int i=(a);i<=(b);i++)
#define per(i,a,b) for (int i=(a);i>=(b);i--)
#define Rep(i,a,b) for (int i=(a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
int main() {
int m,n_min,n_max;
while (true) {
cin >> m >> n_min >> n_max;
if (m == 0 && n_min == 0 && n_max == 0) {
break;
}
... | 0 | 56,319,604 |
#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 FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
usi... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int dataset, i, j, k, alen, blen;
string a, b;
cin >> dataset;
for (i = 0; i < dataset; ++i){
cin >> a >> b;
alen = a.length();
blen = b.length();
int lcs[alen+1][blen+1];
for (j = 0; j <= alen; ++j){... | 0 | 54,764,097 |
#include <assert.h>
#include <ctype.h>
#include <float.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <algorithm>
#include <complex>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
... | #include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
int main(){
long long n, K;
cin >> n >> K;
string s;
cin >> s;
vector<long long> nums;
if(s[0] == '0'){
nums.push_back(0);
}
for (long long i = 0; i < s.size();) {
long long j ... | 0 | 65,640,847 |
#include <bits/stdc++.h>
using namespace std;
template<typename S, typename T>
ostream& operator<<(ostream& out, const pair<S, T> p) {
out << "(" << p.first << "," << p.second << ")";
return out;
}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
for (auto a: v)
out << a ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 0 | 5,469,053 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=1;i<=n;i++)
int a[100002];
int s[100002];
int main(){
while(1){
int n,k;
cin>>n>>k;
if(n==0)return 0;
loop(i,n)cin>>a[i];
s[1]=0;
loop(j,k){
s[1]+=a[j];
}
int m=s[1];
loop(i,n-k+1){
if(i==1)contin... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
const ld pi = 3.14159265358979323846;
int main() {
... | 0 | 58,805,005 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
const unsigned int M = 1000000007;
int main(){
int n,k;
cin >> n >> k;
vector<int> d(n);
rep(i,k){
int m;
cin >> m;
rep(j,m){
int a;
cin >> a;
d[a-1] = 1;
}
}
int ans = 0;
rep(... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = LONG_LONG_MAX / 10;
const ll MINF = LONG_LONG_MIN;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
bool contain(set<P> &s, P a) { ... | 0 | 28,293,223 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N - 1);
for(int i = 0; i < N - 1; i++) {
cin >> B[i];
}
ll sum = 0;
for(int i = 0; i < N; i++) {
if(i == 0) {
A[i] = B[i];
}
else if(i == N - 1) {
... | #include<bits/stdc++.h>
using namespace std;
int fa(int a){
if(a%2==0){
return a/2;
}
else{
return 3*a+1;
}
}
int main(){
int s;
cin>>s;
set<int> S;
int sum=0;
while(!S.count(s)){
S.insert(s);
s=fa(s);
sum++;
}
cout<<sum+1<<endl;
} | 0 | 78,443,675 |
#include <stdio.h>
int main(void){
int a,b;
scanf("%d%d",&a,&b);
printf("%d %d %.12lf\n",a/b,a%b,(double)a/b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,INF=mod*mod*3;
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define pb push_back
ll N,K;
ll A[200005];
const ll max_n=1<<18;
ll dat1[2*max_n-1],dat2[2*max_n-1];
void add(ll... | 0 | 75,600,972 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> z;
cout << z * 2 - x << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a='a', A='A', sa=a-A;
string S;
int f=0;
while(cin>>S){
if(f++){cout<<" ";}
for(int i=0; i<S.length(); i++){
if(S[i]>=A && S[i]<=A+25){
S[i]+=sa;
}else if(S[i]>=a && S[i]<=... | 0 | 94,732,186 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int N; cin>>N;
ll level[N + 1], patties[N + 1];
level[0] = patties[0] = 1;
for(int i = 1; i ... | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void)
{
int N, x;
cin >> N >> x;
int ans;
if (N == 1)
{
ans = 1;
}
else if (N == 2)
{
if (x == 1)
ans = 2;
else
ans = 1;
}
else
... | 0 | 25,017,702 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long
#define For(i,a,b) for(int (i)=(a);(i) < (b); ++(i))
const int N =100;
bool isprime(int n)
{
if (n <= 1)
return false;
for (int i = 2; i*i<=n; i++)
if (n % i == 0)
return false;
return true;
}
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll x[1010],y[1010],z[1010];
int main(){
ll n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i]>>z[i];
}
ll ans=0;
for(int i=0;i<7;i++){
ll num[3]={1,1,1};
for(int j=0;j<3;j++){
if(i&(1<<j)){
num[j]*=-1;
}
... | 0 | 3,543,864 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,i... | #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;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | 0 | 68,766,219 |
#include<iostream>
#include<cmath>
#include<map>
#include<vector>
using namespace std;
int main(){
long long N, K, n;
long long min, max;
long long ans = 0;
std::cin >> N >> K;
for(long long i = 0; i < N+2-K ; i ++){
n = K + i;
min = (0 + n-1) * n /2;
max = (N- n + 1 + N) * ... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,a[1000000];
vector<pair<int,int>>v;
bool check(int d)
{
v.clear();
v.push_back(make_pair(0,0));
for(int i=1;i<=n;i++)
if(a[i]<=a[i-1])
{
while(v.back().first>a[i])
v.pop_back();
for(int j=a[i];;--j)
{
if(j<1)
... | 0 | 25,758,969 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
const ll ATCODER_AMARI = 1000000007;
const ll INF = 10000000000000;
ll factorial(ll k){
ll sum = 1;
for(int i = 1 ; i < k + 1; i++) {
sum *= i;
}
return sum;
}
in... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long c, long long d){
if(c%d==0){
return d;
}else{
return gcd(d, c%d);
}
}
long long lcm(long long c, long long d){
return c*d/gcd(c, d);
}
int main(void){
long long a,b,c,d;
cin>>a>>b>>c>>d;
long long asum, bsu... | 0 | 53,508,312 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset ((a), 0 , sizeof(a))
#define set1(a) memset((a),-1,sizeof (a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(i, n) for (int i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define RFOR(i, start, end) for (int i = start - 1;... | 0 | 76,135,403 |
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0)
#ifdef LOCAL
#include "debugger.h"
#else
#define db(...)
#endif
#define ll long long
#define v32 vector<int>
#define v64 vector<ll>
#define s32 set<int>
#define s64 set<ll>
#define p32 pa... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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);... | 0 | 5,695,862 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
int MOD = 1e9 + 7;
ll extgcd(ll a, ll b, ll& x, ll& y) {
ll g = a; x = 1; y = 0;
if(b != 0) {
g... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_bac... | 0 | 38,002,769 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2005
ll N,M;
ll S[SIZE],T[SIZE];
ll dp[SIZE][SIZE];
vector<int> G[SIZE];
int main(){
sca... | 0 | 19,340,762 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(c>=a && c<=a+b){
printf("YES");
}
else{
printf("NO");
}
} | #include <iostream>
using namespace std;
int main(void)
{
int N, K, i, j, k, count;
count = 0;
int d[100] = {0};
int A[100] = {0};
cin >> N;
cin >> K;
for (j = 0; j < K; j++)
{
cin >> d[j];
for (i = 0; i < d[j]; i++)
{
cin >> k;
A[k - 1]++;... | 0 | 96,655,355 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
string s;
cin>>s;
int x=0;
int y=753;
int ans=100000000;
int n=s.size();
for(int i=0;i<n-2;i++){
int z=100;
x=0;
for(int j=i;j<i+3;j++){
x+=(int(s[j])-48)*z;
z/=10;
}
if(abs(y-x)<ans){
ans=abs(y-x);
}
}
cout<<ans<<'\... | #include <iostream>
#include <vector>
using namespace std;
int n;
vector<string> s;
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> n;
s.resize(n);
for(int i = 0; i < n; ++i) {
cin >> s[i];
s[i] = s[i] + s[i];
}
for(int i = 0; i < n; ++i) s.push_back(s[i]);
int ans = 0;
for(int... | 0 | 43,606,205 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define per(i,n) for (int i = (n)-1; i >=0; --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
string a,b;
cin>>a>>b;
int ans = 0;
if(a.size()>b.size()){
ans = 1;
}... | #include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <queue>
#include <map>
#include <cmath>
#include <numeric>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
int main() {
... | 0 | 88,235,907 |
#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 f(int a){
int ret = 0;
while(a){
ret += a%10;
a /= 10;
}
return ret;
}
int main(){
int n,a,b;
cin >> n >> a >> b;
int sum = 0;
for(int i = 1;i <= n;i++){
if(f(i) ... | #pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<fstream>
#include<bitset>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define INF 0X3F3F3F3F3F3F3F3F
#define N 2000... | 0 | 45,503,157 |
#include <iostream>
int main() {
for( int i = 1 ; i <= 9 ; i++ ) {
for( int ii = 1 ; ii <= 9 ; ii++ ) {
std::cout << i << "x" << ii << "=" << i * ii << std::endl ;
}
}
} | #include <cstdio>
#include <vector>
#include <string>
using namespace std;
#define null -1
struct node{
int parent, left, right;
};
node T[100005];
int Depth[100005];
void setDepth( int u, int p ){
Depth[u] = p;
if( T[u].right != null ){
setDepth( T[u].right, p );
}
if( T[u].left != null ){
... | 0 | 36,976,131 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
int main(){
int n;
scanf("%d",&n);
string s;
cin>>s;
int cnt=0;
bool flag=1;
ll ans=1;
for(int i=0;i<s.size();i++){
if(cnt&1){
if(s[i]=='W'){
cnt++;
}
... | 0 | 100,828,083 |
#include <iostream>
#include <limits>
#include <algorithm>
using namespace std;
int main()
{
for (int n; cin >> n && n;) {
vector<int> sequence(n);
int sum = 0;
int max_val = numeric_limits<int>::min();
for (int x, i = 0; i < n && cin >> x; i++) {
if (sum < 0)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int M = 1e6+5;
int p[M];
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
rep(i, n) {
bool ok... | 0 | 69,423,493 |
#include <iostream>
using namespace std;
int main() {
int x; cin >> x;
if (x < 1200) printf("%s\n", "ABC");
else printf("%s\n", "ARC");
} | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int e[105][105];
int main()
{
int n;
int k,m,p;
memset(e,0,sizeof(e));
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&k);
scanf("%d",&m);
for(int j=1;j<=m;j++)
{
scanf("... | 0 | 72,021,822 |
#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<iostream>
using namespace std;
const int INF = 1000000;
int main(){
int n;
while(1){
cin >> n;
if(n==0){
break;
}
int table[10][10];
bool realtowntable[10];
for(int i=0;i<10;i++){
realtowntable[i] = false;
}
for(int i=0;i<10;i++){
... | 0 | 38,533,428 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main (){
ll n ;
cin >> n ;
ll tot = ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 30,191,261 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = ... | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | 0 | 7,602,022 |
#include<iostream>
using namespace std;
int Consecutive_Integers(int n,int k){
return n-k+1;
}
int main(){
int N,K;
cin >> N >> K;
cout << Consecutive_Integers(N,K) << endl;
return 0;
} | #include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#include<queue>
#define ii pair<int,int>
#include <sstream>
#def... | 0 | 40,001,852 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> llVEC;
typedef vector<P> PVEC;
typedef priority_queue<P,PVEC,greater<P> > PPQ;
typedef priority_queue<ll, llVEC, greater<ll> > llPQ;
#define rep(i,a,n) for(ll i = a... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 17,569,924 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
using namespace std;
using ll... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int cnt[100002] = {};
int a;
while (cin >> a) {
cnt[a-1]++;
cnt[a]++;
cnt[a+1]++;
}
int maxCnt = 0;
for (int i=1; i<100001; i++) {
maxCnt = max(maxCnt, cnt[i]);
}
cout << maxCnt... | 0 | 91,624,457 |
#include <iostream>
#include <algorithm>
#include <vector>
using std::cout; using std::endl;
using std::cin; using std::sort;
using std::vector;
int main(void)
{
int num;
int counters[101] = {0};
int max_count = 1;
vector<int> numbers;
while (cin >> num) {
counters[num]++;
}
for (int i = 1; i <= 100; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 0 | 77,325,383 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
queue<int> d;
for(int i = min(a, b); i >= 1; i--) {
if(a % i == 0 && b % i == 0) {
d.push(i);
... | #include <iostream>
using namespace std;
int SelectionSort(int a[], int n){
int count = 0;
for(int i=0; i<n; i++){
int minj=i;
for(int j=i; j<n; j++){
if(a[j]<a[minj]) minj = j;
}
if(i!=minj){
swap(a[i], a[minj]);
count++;
}
}
return count;
}
int main(void){
int n;
... | 0 | 69,263,633 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <deque>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include... | 0 | 31,825,112 |
#include <stdio.h>
long long sqrt(long long x)
{
long long l = 0, r = 1000000001;
while (l + 1 < r){
long long m = (l + r) / 2;
if (m * m <= x) l = m;
else r = m;
}
return l;
}
int main()
{
int Q; scanf ("%d",&Q); while (Q--){
long long a,b; scanf ("%lld %lld",&a,&b);
long long s = a * b - 1, q = sqrt(s)... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i < (int)(n);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
int main(){
int n;
cin >> n;
int a[n],b[n];
rep(i,n)cin >> a[i];
rep(i,n)cin >> b[i];
vector<ll>sa(n);
rep(i,n)sa[i] = a[i] - b[i];
so... | 0 | 53,952,178 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,n;
cin>>a>>n;;
if(a+n==15)
{
cout<<"+"<<endl;
return 0;
}
if(a*n==15)
{
cout<<"*"<<endl;
return 0;
}
cout<<"x"<<endl;
return 0;
} | #include<iostream>
using namespace std;
#define MAX 100000
struct Node{
int parent,left,right;
};
Node T[MAX];
int D[MAX],s;
int get_depth(int u, int p){
D[u]=p;
if(T[u].right != -1){
get_depth(T[u].right,p);
}
if(T[u].left != -1){
get_depth(T[u].left,p+1);
}
}
void array_init(No... | 0 | 53,537,823 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int m, n, i, cnt = 0, sum = 0;
float x;
cin>>n>>m;
int a[n];
for(i = 0; i<n; i++)
{
cin>>a[i];
}
for(i = 0; i<n; i++)
{
sum += a[i];
}
x = (1.0/(4.0*m))*sum;
for(i = 0; i<n; i++)
{
if(a[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
int main() {
int n,m,x;
cin >> n >> m >> x;
std::vector<int> c(n);
Graph a(n, std::vecto... | 0 | 68,284,125 |
#include<iostream>
#include<algorithm>
using namespace std;
struct Mat {
int row;
int col;
};
long mcm(Mat* M, int n) {
long dp[101][101];
for(int i=2; i<=n; i++) {
for(int j=0; j<=n-i; j++) {
dp[i][j] = 99999999999L;
for(int k=1; k<i; k++) {
dp[i][j] = min(dp[k][j]+dp[i-k][j+k]+M[j].row*M[j+k].row*M[j+... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | 0 | 78,421,324 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repm(i, a, n) for (ll i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define mod (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pl... | #include <iostream>
#include <string>
#define MAX_N 1000
#define MAX_M 1000
int n, m;
std::string s, t;
int dp[MAX_N+1][MAX_M+1];
void solve() {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (s[i] == t[j]) {
dp[i+1][j+1] = dp[i][j] + 1;
}
else {
dp[i+1][j+1] = st... | 0 | 71,781,561 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int m, h;
cin >> s;
while(s != "-") {
cin >> m;
for(int i = 0;i < m;i++) {
cin >> h;
s = s.substr(h, s.size() - h) + s.substr(0, h);
}
cout << s << endl;
cin >> s;
}
return 0;
} | #include <bits/stdc++.h>
#define pp pair<int, int>
using namespace std;
int main(){
int n, m;
while(cin >> n >> m, n){
vector<pp> v;
int d, p;
for(int i = 0; i < n; i++){
cin >> d >> p;
v.push_back(pp(p, d));
}
sort(v.begin(), v.end(), greater<pp>(... | 0 | 46,307,491 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
map<char,int> memo;
memo[ s[0] ]++;
memo[ s[1] ]++;
memo[ s[2] ]++;
if(memo['a'] && memo['b'] && memo['c']){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14... | 0 | 74,339,820 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int memo = 1;
for (int i = 0; i < N - 1; i++) {
if (A.at(i) == A.at(i + 1)) {
memo++;
}
else {
... | 0 | 36,617,459 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int a, b;
cin >> a >> b;
if (a <= 8 && b <= 8) {
cout << "Yay!" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main(){
ll n,m;cin >>n>>m;
vector<P>p(n);
for (int i = 0; i < n; ++i) {
ll a,b;cin >>a>>b;
p[i]... | 0 | 89,702,533 |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
int M, N; scanf("%d%d", &M, &N);
int X[100000][2]; rep(i, N) rep(j, 2) scanf("%d", &X[i][j]);
int P[100000]; rep(i, N) P[i] = i;
auto cmpX = [&X](int ... | #include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
int N;
cin >> N;
int64_t sum = 0;
int64_t a;
cin >> a;
for (int i = 1; i < N; ++i)
{
int64_t tmp;
cin >> tmp;
if (tmp < a)
... | 0 | 36,279,834 |
#pragma optimise GCC(-O2)
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll int
#define ld long double
#define pii pair<ll,ll>
#define ve(x) vector<x>
#define f(a,b,c) for(ll a=b;a<c;a++)
#define foto(x,v) for(auto x:v)
#define read(t) ll t; cin>>t;
#define reads(t) string t; cin>>t;
#define... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int dx[4] = {-1, 1, ... | 0 | 32,762,196 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 93,950,799 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll n, k;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m, v, p, x = 1LL, v2, cnt;
ll l, r, mid;
cin >> n >> m >> v >> p;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
l = 0LL;
r = 1000000000... | 0 | 14,659,465 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a,b;
while(cin>>a>>b)
{
if(a+b==15)
{
cout<<'+'<<endl;
}
else if(a*b==15)
{
cout<<'*'<<endl;
}
else
... | #include<iostream>
#include<vector>
#include<unordered_set>
using namespace std;
int main(){
int n;
cin>>n;
vector<string>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
string prev=v[0];
bool no=false;
unordered_set<string>us;
for(int i=0;i<n;i++){
if(i!=0){
... | 0 | 67,827,841 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
using... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
int main() {
int N... | 0 | 39,110,321 |
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
int64_t f(int64_t n){
return n*(n-1)/2;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int64_t> a(n);
rep(i,n)cin>>a[i], a[i]--;... | 0 | 59,866,479 |
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class ... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#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... | 0 | 52,395,226 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
#define y1 def1
#define X first
#define Y second
#define endl '\n'
#define all(o) o.begin(), o.end()
#define IOS ios::sync_with_stdio(0), cin.tie(0)
map<in... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i > 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()
... | 0 | 63,107,746 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
using namespace std;
void func()
{
string S, T;
cin >> S;
cin >> T;
if (1 > S.length() || S.length() > 10)
{
cout << "No\n";
return;
}
if(S.length() + 1 != T.length())
{
cout << "No\n";
return;... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
#include <queue>
#include <map>
#include <set>
using namespace std;
using Int = int64_t;
using P = pair<Int, Int>;
const Int INF... | 0 | 92,838,643 |
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<ll>
#define all(x) x.begin() , x.end()
#define mod(x,m) ((x%m + m )%m)
using namespace std;
void OJ();
#define ld long double
void solve(){
int n ,k; cin >> n >> k;
cout << (bool)(n%k);
}
int ma... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int cnt[100002] = {};
int a;
while (cin >> a) {
cnt[a-1]++;
cnt[a]++;
cnt[a+1]++;
}
int maxCnt = 0;
for (int i=1; i<100001; i++) {
maxCnt = max(maxCnt, cnt[i]);
}
cout << maxCnt... | 0 | 48,568,693 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fix cout << fixed; cout << setprecision(0)
void solve() {
int a, b;
cin >> a >> b;
cout << 6 - (a + b) << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
fix;
solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define int long long
using namespace std;
const int MOD=1e9+7;
const int INF=1e10;
signed main(){
int n;
while(cin>>n,n){
int left=0,right=0;
int ans=0;
str... | 0 | 59,271,310 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
int n;
cin >> n;
set<int> f;
... | #include <bits/stdc++.h>
#define INF 1000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll mod = 1000000007;
ll N;
cin >> N;
vector<ll> T(N);
vector<ll> A(N);
for (ll i = 0; i < N; ++i)
{
cin >> T.at(i);
}
for (ll i = 0; i < N; ++i)
{
cin >> A.at(i);
... | 0 | 19,955,506 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll k;
cin >> k;
cout << "50\n";
vector<ll> a(50, k / 50 + 49);
for (int i = 0; i < 50; i++) {
... | #include<iostream>
#include<string>
using namespace std;
#define MAX 100000
#define NIL -1
struct Node {
int parent;
int left;
int right;
};
Node T[MAX];
int n, D[MAX];
void setDepth(int u, int p) {
D[u] = p;
if (T[u].right != NIL) {
setDepth(T[u].right, p);
}
if (T[u].left != NIL) {
setDepth(T[u]... | 0 | 61,447,549 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
int start, end, cnt;
bool find = false;
for (int i = 0; i < 26; ++i) {
start = -1;
end = -1;
cnt = 0;
for (int j = 0; j < s.length(); ++j) {
... | #include<iostream>
#include<cstdio>
#include<map>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int N;
map<string, bool> T;
cin >> N;
for (int i = 0; i < N; i++) {
char s[16],t[16];
scanf("%s %s",s,t);
if (s[0] == 'i') {
T[t] = true;
}e... | 0 | 10,294,164 |
#include <iostream>
using namespace std;
int main()
{
int W,H,x,y,r;
cin >>W >>H >>x >>y >>r;
if(-100<=x && x<=100
&& -100<=y && y<=100
&& 0<W && W <=100
&& 0<H && H <=100
&& 0<r && r <=100){
if ((x+r)>W || (x-r)<0 ||(y+r)>H || (y-r)<0) {
cout <<"No" <<endl;
}
else {
cout << "Yes" <<endl;
}
... | #include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll, ll> P;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b;... | 0 | 69,016,605 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int s , n , k;
int main()
{
_FastIO;
cin >> n >> k;
int x , y;
for(int i = 1; i <= n; i++){
cin >> x;
}
... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T &b) {
if(a >= b) return false;
a = b;
return true;
}
template <class T> inline ... | 0 | 74,215,814 |
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s;
long long ans=0,c=0;
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='W'){
ans+=i-c;
c++;
}
}
cout<<ans<<endl;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
int w[N],a[N];
for(int i=0;i<N;++i) cin>>w[i];
for(int i=0;i<N;++i) {
int ans1=0;
int ans2=0;
int ans=0;
for(int j=0;j<=i;++j) {
ans1+=w[j];
}
for(int k=i+1;k<N;++k) {
ans2+=w[k];
... | 0 | 14,856,559 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int q; cin >> q;
for(;q--;){
ll a, b;
cin >> a >> b;
ll kake = a * b - 1;
ll root = max(0ll, ll(sqrt(kake))-2);
while((root+1)*(root+1) <= kake) ++root;
ll ans = root * 2 - 1;
if(root * (root+1) > kake) --ans;
if(a == b) ++ans;
c... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const int MOD = 1000000007;
const int MAX = 100000;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T> in... | 0 | 96,707,316 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) s... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#define ll long long
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
vector<ll> x(n);
for(int i=0;i<n;i++){
cin>>x[i];
}
ll ans=(n-1)/(k-1);
if(0==(n-1)%(k-1)){
cout<<ans<<endl;
... | 0 | 36,265,857 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.