code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#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... | #include<bits/stdc++.h>
using namespace std;
const int S=(1<<20)+5;
char buf[S],*H,*T;
inline char Get()
{
if(H==T) T=(H=buf)+fread(buf,1,S,stdin);
if(H==T) return -1;return *H++;
}
inline int read()
{
int x=0;char c=Get();
while(!isdigit(c)) c=Get();
while(isdigit(c)) x=x*10+c-'0',c=Get();
retu... | 1 | 9,869,339 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main( void )
{
int n, k;
while ( cin >> n >> k && n > 0 && k > 0 )
{
vector <int> a( n+1, 0 );
vector <int> dp( n+1, 0 );
for ( int i = 1; i < n+1; i++ )
{
cin >> a[i];
}
for ( int i = 1; i < n+1; i++ )
dp[i] = dp[i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
while (cin >> N >> K) {
if(N == 0) br... | 1 | 9,569,672 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
int main()
{
ll n ;
cin >> n ;
vector<ll> a(n);
ll su=0;
rep(i, n){
cin >> a[i];
su^=a[i];
}
rep(i,60){
if(su>>i & 1LL){
ans+=1LL<<i;
}
}
rep(i,n){
a[i]=(a[i]|ans)^ans;
}
ll s... | #include <cstdio>
using LL = long long;
const int MAXN = (int)1e5;
LL a[MAXN];
struct LinearBasis {
static const int MAXL = 64;
LL a[MAXL];
LinearBasis() {
for (int i = 0; i < MAXL; ++i) a[i] = 0;
}
void Add(LL vec) {
for (int j = MAXL - 1; j >= 0 && vec > 0; --j) {
if (((vec >> j) & 1) == 0) co... | 1 | 90,253,283 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define FORW(a, b, c) for(int a = b; a >= c; --a)
#define int long long
int n, len, powe[20];
string ans;
bool check(int x) {
cout << "? " << x << '\n'; cout.flush();
string tmp; cin >> tmp;
return (tmp == "Y");
... | #include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 200200;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % mod;
return ans;
}
... | 1 | 43,308,749 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long inf = numeric_limits<long long>::max();
int main()
{
... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl;
using namespace std;
int main()
{
string n;
cin >> n;
rep(i, n.size()) {
... | 1 | 51,245,673 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
int A,B;
cin >> A >> B;
int ans;
REP(i,3){
if(i!=A-1 && i != B-1) ans = i;
}
ans++;
cout << ans << endl... | #include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int s = 6;
int n;
cin >> n;
s -= n;
cin >> n;
s -= n;
cout << s << '\n';
return 0;
} | 1 | 16,584,973 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
for(int i = 0; i < 4; i++) {
cout << s[i];
}
cout << " ";
for(int i = 4; i < 12; i++) {
cout << s[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s; cin >> s;
for(int i=0; i<s.size(); i++){
if(i == 4) cout << " ";
cout << s[i];
}
cout << endl;
} | 1 | 54,429,384 |
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
#define PI acos(-1)
typedef l... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mii map<int,int>
#define... | 1 | 50,194,995 |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YE... | #include <iostream>
using namespace std;
const int MOD = 1000000007;
int main(){
int n;
string en;
cin>>n>>en;
long long res = 1;
long long op = 0;
for(int i=0;i<2*n;i++){
if(en[i]=='B'){
if(op%2){
res = (res*op)%MOD;
op--;
}
else{
op++;
}
}
else{
if(op%2){
op++;
}
else{... | 1 | 83,594,180 |
#include<cstdio>
int main(void){
int a=0,b=0,change=0;
while(true){
scanf("%d %d",&a,&b);
if((a==0)&&(b==0)){
break;
}
if(b<a){
change=a;
a=b;
b=change;
}
printf("%d %d\n",a,b);
}
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int x, y;
while (cin >> x >> y, !(x == 0 && y == 0)) {
if (x <= y)cout << x << " " << y << endl;
else cout << y << " " << x << endl;
}
return 0;
} | 1 | 61,120,248 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K; cin >> N >> K;
vector<ll> a(N); for (int i = 0; i < N; i++) cin >> a[i];
vector<ll> cum(N); cum[0] = a[0];
for (int i = 1; i < N; i++) cum[i] = cum[i-1] + a[i];
map<ll, int> pr;
for (int i = 0; i < N; i++)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se... | 1 | 48,490,174 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
void solve() {
int n; cin >> n;
int prv = 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
int v; cin >> v;
if (prv <= v) {
prv = v; continue;
}
ans += prv - v;
}
cout << ans;
}
int ma... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
ll ans = 0;
for (int i = 1; i < n; ++i) {
if (v[i] < v[i - 1]) {
ans +=... | 1 | 17,022,635 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #include<bits/stdc++.h>
long long a[10000],b[10000];
using namespace std;
int main()
{
long long n,i=0,j=0,k,ba=0;
cin>>n;
for(int t=0;t<n;t++)
{
cin>>a[t];
i=i+a[t];
}
for(int t=0;t<n;t++)
{
cin>>b[t];
j=j+b[t];
}
if(i<=j)
{
k=j-i;
for(int t=0;t<n;t++)
{
if(a[t]<b[t])
{
ba=ba+(b[t]-a[... | 1 | 31,330,439 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
char op;
cin >> a >> op >> b;
if(op == '+') a += b;
else a -= b;
cout << a << endl;
} | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
std::istringstream iss(s);
int a = 0, b = 0;
char o = ' ';
iss >> a >> o >> b;
if (o == '+')
std::cout << a + b << std::en... | 1 | 43,189,760 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
lli k;
lli calc(string x){
lli ret = 0;
lli n = x.size();
for(int i = 0, j = 0; i < n; i = j){
while(j < n && x[i] == x[j]) j++;
ret += (j-i)/2;
}
return ret;
}
int main(void){
cin >> s >> k;
l... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b... | 1 | 7,778,173 |
#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 lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define CST(x) cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
int n,m,R;
cin>>n>>m>>R;
vector<int> v;
for(int i=0;i<R;i++){
int r;
cin>>r;
v.push_back(r);
}
ll d[201][201]={};
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i... | 1 | 21,745,268 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define double long double
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x, c) for (auto&& x : (c))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((... | #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 INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T>
void print_vec(vector<T> v) {
for (T i : v) cout << i << " ";
cout << end... | 1 | 69,056,719 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
double a, b, C;
cin >> a >> b >> C;
C = C * M_PI / 180;
double L = a + b + sqrt(a * a + b * b - 2 * a * b * cos(C));
double S = a * b * sin(C) / 2;
double h = b * sin(C);
printf("%.6f\n%.6f\n%.6f\n", S,... | #include<stdio.h>
#include<math.h>
int main(){
double a,b,x,S,L,h;
scanf("%lf %lf %lf",&a,&b,&x);
S=0.5*a*b*sin(x*M_PI/180);
L=a+b+sqrt(a*a+b*b-2*a*b*cos(x*M_PI/180));
h=b*sin(x*M_PI/180);
printf("%lf\n%lf\n%lf\n",S,L,h);
return 0;
} | 1 | 93,161,512 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define ll long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statist... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll a,b,c; cin>>a>>b>>c;
if(... | 1 | 67,552,859 |
#ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var) \
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#endif
using namespace std;
struct Dict {
Dict() : buf_(init... | #include<stdio.h>
#include<string.h>
#define M 1046527
#define L 14
char H[M][L];
int getChar(char ch){
if ( ch == 'A') return 1;
else if ( ch == 'C') return 2;
else if ( ch == 'G') return 3;
else if ( ch == 'T') return 4;
else return 0;
}
long long getKey(char str[]){
long long sum = 0, p = 1, i;
for ( i... | 1 | 66,844,334 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int heap_size;
void maxHeapify(int *heap, int i){
int l,r, largest;
l=i*2;
r=i*2+1;
if(l <= heap_size && heap[l] > heap[i]) largest = l;
else largest = i;
if(r <= heap_size && heap[r] > heap[largest... | #include <iostream>
#include <queue>
#include <string>
#include <stdio.h>
using namespace std;
int main()
{
char cmd[2];
int digit;
priority_queue<int> Q;
while (true) {
scanf(" %s", cmd);
if (cmd[0] == 'i') {
scanf(" %d", &digit);
Q.push(digit);
} else {
if (cmd[1] == 'n') break... | 1 | 62,438,104 |
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {return b ? gcd(b, a%b) : a;}
vector<pair<ll,int>> factorize(ll n) {
vector<p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
char a, b;
cin >> a >> b;
if (a == b){
cout << "=\n";
} else if (a > b) {
cout << ">\n";
} else {
cout << "<\n";
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1, i = 1;
while(t--) {
solve();
}
return 0;... | 1 | 43,484,156 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#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++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
int main() {
char a,b ;
cin >> a >> b ;
if(a<b)
cout << '<' ;
else if(a>b)
cout << '>' ;
else
cout << '=' ;
cout << end... | 1 | 69,652,389 |
#include <stdio.h>
int main()
{
int a, b;
scanf("%d %d\n", &a, &b);
printf("%d %d %f\n", a/b, a%b, (double)a/(double)b);
} | #include <stdio.h>
using namespace std;
int main(void){
int a,b;
double a_d,b_d;
scanf("%d %d",&a,&b);
a_d=static_cast<double>(a);
b_d=static_cast<double>(b);
printf("%d %d %.8f\n",a/b,a%b,a_d/b_d);
return 0;
} | 1 | 48,525,955 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
int answer;
vector<int> PQR(3);
cin >> PQR.at(0) >> PQR.at(1) >> PQR.at(2);
sort(PQR.begin(), PQR.end());
answer = PQR.at(0) + PQR.at(1);
cout << answer << endl;
} | 1 | 65,885,822 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n,temp;
cin>>n;
if(n%2==0)
temp=(n/2)*(n+1);
else
temp =( (n+1) / 2) * (n);
cout<<temp-n<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int keta(ll n){int ans=0;while(n>0){n /= 10; ans++;}return ans;}
ll _pow(ll a,ll b){ll ans ... | 1 | 79,652,983 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e3+4;
int32_t main(){
cin.tie(0)->sync_with_stdio(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<max({b*d,a*c,a*d,b*c});
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
#define per(i,s,n) for(int i=n-1;i>=s;i--)
#define fi first
#define se second
#define all(c) c.begin(),c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
voi... | 1 | 80,833,890 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
int n, d;
cin >> n >> d;
int x[20][20];
int i, j;
for (i = 0; i < n; i++)
{
for (j = 0; j < d; j++)
{
cin >> x[i][j];
}
}
int cnt=0;
int k,l;
int sum;
for (i = 0; i < n... | 1 | 43,558,474 |
#include <iostream>
using namespace std;
int n,k;
int main(){
cin>>n>>k;
if(k==1)cout<<0;
else cout<<n-k;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(int argc, char const *argv[])
{
int n, k; cin >> n >> k;
if (k == 1) {
printf("0\n");
return 0;
}
int r = n - k;
cout << r << endl;
return 0;
} | 1 | 46,782,118 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=1e6+5;
vector<ll> V;
int pre[maxn];
int main() {
ll n;cin>>n;
cout<<n*(n+1)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const int MOD =... | 1 | 25,539,092 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n; cin >> n;
vector<ll> a(n), b(n);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 1 | 62,939,078 |
#include <bits/stdc++.h>
using namespace std;
vector<int> edge[1000010];
int n,poi[1000010],u,v;
void dfs(int u,int fa)
{
poi[u]=0;
for(auto v : edge[u])
{
if(v==fa) continue;
dfs(v,u);
poi[u]^=poi[v]+1;
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n-1;++i)
{
... | #include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100005;
struct Edge
{
int to, nxt;
} e[maxn << 1];
int first[maxn];
inline void add_edge(int from, int to)
{
static int cnt = 0;
e[++cnt].nxt = first[from];
first[from] = cnt;
e[cnt].to = to;
e[++cnt].nxt = first[to];
first[to] = cnt;
... | 1 | 22,734,562 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
ll P[100005];
const ll mod = 998244353;
ll pow(ll x, ll y) {
if (y == 0L... | #include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char my... | 1 | 45,433,507 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define deb(x) cout << #x << " " << x << endl;
#define debarr(x) for (auto i : x) cout << i << " "; cout << endl;
#define debtwo(x,y) cout << #x << " " << x << ", " << #y << " " << y << endl;
#define mod 1000000007
int main() {
ios_base::sync_with... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int n;
cin >> n;
int ans = 0;
for (int ... | 1 | 100,511,609 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | #include<iostream>
#include<vector>
#include<string>
#include<map>
using namespace std;
int main() {
int a, b, c;
while (cin >> a >> b >> c, a | b | c) {
map<int, int>d;
int s = 0;
for (int e = 0; e < a; e++) {
int f;
cin >> f;
s += f;
d[e + 1] = f;
}
int g = (100-c)*s;
if(d[b])cout << g / d[b... | 1 | 20,883,445 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
string abc = "";
abc = abc + a.at(0) + b.at(0) + c.at(0);
transform(abc.begin(), abc.end(), abc.begin(), ::toupper);
cout << abc << endl;
} | #include <iostream>
using namespace std;
int main() {
string s, t, u;
cin >> s >> t >> u;
int d = 'a' - 'A';
cout << (char)(s[0] - d);
cout << (char)(t[0] - d);
cout << (char)(u[0] - d) << endl;
return 0;
} | 1 | 91,125,281 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
int n;
cin>>n;
vector<int> p(n);
rep(i,n)cin>>p[i];
rep(i,n)p[i]--;
vector<int>idx(n);
rep(i,n)idx[p[i]]=i;
set <int>s;
ll ans=0;
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
const int maxN=1e5+7;
int N;
int p[maxN];
int pos[maxN];
int leftFirstMaxPos[maxN];
int rightFirstMaxPos[maxN];
ll ans=0;
int main(){
cin>>N;
for(int i=1;i<=N;i++){
cin>>p[i];
po... | 1 | 39,137,280 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
vector<int> b(n);
b = a;
sort... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i,n) cin >> a[i];
rep(i,n) {
b[i] = a[i];
}
sort(b.begin(), b.end());
rep(i,n) {
... | 1 | 15,559,344 |
#include <iostream>
#include <string>
using namespace std;
int main(){
while(true){
int n;
string str;
int l=0, r=0;
int before=0;
int cnt=0;
cin >> n;
if(!n) break;
for(int i=0;i<n;++i){
cin >> str;
if(str == "lu") l = 1;
... | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
int main()
{
int i,j;
int n;
int ans;
char a[3],b[3];
while(1)
{
scanf("%d",&n);
if(n==0){break;}
else
{
ans=0;
for(i=0;i<(n/2);i++)
{
scanf("%s %s",a,b);
if((a[0]!=b[0])&&(a[1]==b[1]))
{
... | 1 | 17,270,536 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
map<int,int> m;
for(int i=0;i<n;i++)
{
int a;cin>>a;
m[a-1]++;
m[a]++;
m[a+1]++;
}
int ans=0;
for(auto mm:m... | 1 | 14,239,346 |
#include <iostream>
using namespace std;
int main()
{
char X, Y;
cin >> X >> Y;
if (X < Y) {
cout << "<" << endl;
} else if (X > Y) {
cout << ">" << endl;
} else {
cout << "=" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 1 | 21,040,394 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
int sum=0;
if(a=='D')
sum++;
if(b=='D')
sum++;
if(sum==1)
cout<<'D'<<endl;
else
cout<<'H'<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main( )
{
char a, b;
cin >> a >> b;
if (a == 'H') {
cout << b << '\n';
}
else {
if (b == 'H') {
cout << "D\n";
}
else {
cout << "H\n";
}
}
return... | 1 | 93,205,195 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, t; cin >> s >> t;
const int p = 26;
vector<int> s_num(p), t_num(p);
for (int i = 0; i < s.size(); i++) {
s_num[s[i] - 'a']++;
t_num[t[i] - 'a']++;
}
sort(s_num.begin(), s_num.end());
sort(t_num.begin(), t_num.end());
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
string s,t;
cin >> s >> t;
ll n=s.size();
map<ll,ll> cs,ct;
for(ll i=0;i<n;i++) {
if(cs[s[i]]) {
if(cs[s[i]... | 1 | 59,006,234 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef vector<pii> vii;
typedef vector<pll> v... | #include <algorithm>
#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()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false)... | 1 | 68,167,388 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <cstdio>
using namespace std;
int main() {
float t,x;
scanf("%f %f",&t,&x);
printf("%f",t/x);
} | 1 | 28,452,059 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #include <iostream>
#include <string.h>
#include <bits/stdc++.h>
using namespace std;
int main()
{ int a,b,c;
cin>>a>>b>>c;
if (a!=b &&a!=c && b!=c){
cout<<"3"<<endl;
}
else if (a!=b || a!=c || b!=c){
cout<<"2"<<endl;
}
else {
cout<<"1"<<endl;
}
return 0;
} | 1 | 55,125,160 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
int N, K; cin >> N >> K;
if(K == 1){
cout << 0 << endl;
} else {
cout << N - K << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int mx = N - K + 1;
int mn = (K > 1) ? 1 : (N - K + 1);
cout << mx - mn << endl;
return 0;
} | 1 | 56,190,385 |
#include <iostream>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
vector<int> par(100000);
int root(int x) {
if (par[x] == x) return x;
par[x] = root(par[x]);
return par[x];
}
void unite(int x, int y) {
int ... | #include<bits/stdc++.h>
using namespace std;
#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 erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 1 | 56,515,207 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
a[i] = 4*m * a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= sum)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n, m, total = 0, ok = 0;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) total += a[i];
for(int i = 0; i < n; i++){
if(4*a[i]*m >= total) ok++;
... | 1 | 3,225,449 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
vector<long long> fact, fact_inv, inv;
template< typename T >
void init_combi(size_t size, const T mod) {
size += 1;
fact.resize(size);
fact_inv.resize(size);
inv.resize(size);
fact[0] = fact[1] = 1;
... | #include<iostream>
static const long long MOD = 1e9+7;
long long inv(long x, long n){
if(n == 1) return x;
long long cur = inv(x, n / 2);
cur = cur * cur % MOD;
if(n % 2 == 0){
return cur;
}else{
return cur * x % MOD;
}
}
long long combination(long long n, long long k){
long ... | 1 | 20,517,900 |
#include <bits/stdc++.h>
#define ll long long
#define read(x) scanf("%d",&x)
using namespace std;
const int maxn = 1e5 + 10;
int n;
ll a[maxn];
int zero[64], tot;
ll p[64];
void insert(ll x){
for(int i=0;i<tot;i++){
if((x>>zero[i])&1){
if(!p[i]){
p[i] = x;
break;
}else{
x^=p[i];
}
}
}
}
int... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | 1 | 49,848,862 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <iostream>
#include <cmath>
#include <string>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <vector>
using namespace std;
#define INF 1000000007
#define ll long long
#define rep(i_, __start, __end) for(ll i_=(ll)__start; i_<(ll)__end; i_++)
#define print(_a) cout << _a <<... | 1 | 66,371,871 |
#include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,a[N],to[N*2],nxt[N*2],fst[N],l,ans;
void link(int x,int y)
{
to[++l]=y;nxt[l]=fst[x];fst[x]=l;
to[++l]=x;nxt[l]=fst[y];fst[y]=l;
}
void dfs(int x,int f)
{
for (int i=fst[x];i;i=nxt[i])
if (to[i]!=f)
{
dfs(to[i],x);
if (!a[to[i]])
ans|=... | #include<bits/stdc++.h>
#define nxt(x) bian[x].nxt
#define ed(x) bian[x].ed
using namespace std;
const int maxn=1e6;
struct edge{
int nxt,ed;
}bian[maxn];
int n;
int t[maxn],cnt=2;
int w[maxn];
bool bl[maxn];
void lj(int x,int y) {
ed(cnt)=y;
nxt(cnt)=t[x];
t[x]=cnt++;
w[x]++;
}
queue<int> q;
void bfs() {
while(!... | 1 | 35,209,813 |
#include<bits/stdc++.h>
using namespace std;
int freq[10004];
char str[200005];
int main()
{
int n, p;
scanf("%d %d %s", &n, &p, str);
long long res= 0;
if(p==2)
{
for(int i=n-1; i>=0; i--)
{
if(!((str[i]-'0')&1))freq[0]++;
res+= freq[0];
}
}
e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n); i > 0; i--)
#define all(n) n.begin(), n.end()
#define print(n) cout << n << endl
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n,p;
string s... | 1 | 93,683,362 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | 1 | 27,287,970 |
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int c[101]={};
int n, max=0;
while(cin>>n){
++c[n];
if(max<c[n]) max=c[n];
}
for(int i=1; i<=100; i++){
if(c[i]==max) cout<<i<<'\n';
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n... | 1 | 78,508,608 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
string S;
cin >> S;
if(S[3-1] == S[4-1] && S[5-1] == S[6-1]) cout << "Yes\n";
else cout << "No\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin >> c;
if(c[2]==c[3] && c[4]==c[5]){
cout << "Yes";
}else{
cout << "No";
}
return 0;
} | 1 | 40,191,992 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main()
{
Hello
int k, n;
cin >> k >> n;
int arr[n + 5];
for(int i = 0; i < n; i++)
cin >> arr[i];
int mx = k - arr[n - 1] + arr[0];
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
int total = k;
int mn = total;
for(int i=1; i<n; i++){
mn = min(mn,total-(arr[i]-arr[i-1]));
}
mn = min(mn,total-(k-arr[n-1])-arr[0]);
cout<<mn;
} | 1 | 62,338,911 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
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<b;i++)
#define bFor(i,a,b) for(i=a;i>=b;i--)
#d... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <sstream>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for(int i=0;i<n;++i)
#defin... | 1 | 53,954,168 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
int n, m;
cin >> n >> m;
pair<int, int> arr[m];
map<int, int> mp;
for (int i = 0; i < m; i++) {
cin >> arr[i].first >> arr[i].second;
}
sort(arr, arr + m);
for (int i = 0; i <... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
int main(){
int N, M;
cin >> N >> M;
vector<bool> A(N, false), B(N, ... | 1 | 55,024,988 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 1 | 11,213,895 |
#include <cstdio>
using namespace std;
typedef long long llong;
#define MAX
const llong mod = 1000000000 + 7;
int main()
{
char S[3];
scanf("%s", S);
if (S[0] == 'A' && S[1] == 'A' && S[2] == 'A')
printf("No\n");
else if (S[0] == 'B' && S[1] == 'B' && S[2] == 'B')
printf("No\n");
else
printf("Yes"... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
cin >> s;
if(s == "AAA" || s == "BBB")
cout << "No";
else
cout << "Yes";
cout << "\n";
return 0;
} | 1 | 12,509,714 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
using namespace std;
int main() {
long long n, m;
cin >> n >> m... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 1 | 99,909,188 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
template <class T>
inline bool chmin(T &a, T b)
{
... | 1 | 78,161,646 |
#include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
int main(){
int N,M,R;cin >> N >> M >> R;
vector<int> vis;
vector<vector<int> >dist(N);
for(int i = 0 ; i < R ; i++){
int r;cin >> r;r--;
vis.push_back(r);
}
for(int i = 0 ; i < N ; i++){
dist[i].resize(N... | #include <iostream>
#include <cmath>
#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>
#inclu... | 1 | 83,212,619 |
#include <bits/stdc++.h>
#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 repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 1 | 36,538,082 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod=1e9+7;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
ll n,k;
cin>>n>>k;
ll x[n],dp[k+1]={};
dp[0]=1;
for(ll &i:x) cin>>i;
for(ll i=0;i<n;i++){
ll pre[k+2]={};
for(ll j=0;j<=k;j++) pre[j+1]=pre[j]+dp[... | 1 | 95,993,597 |
#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;
long double pi = acos(-1);
const int INF = 1001001001;
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,... | #include <bits/stdc++.h>
#include <string>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <numeric>
using namespace std;
int abs(int num){
if (num > 0)
return num;
else
return -num;
}
int main(){
int N;
cin >> N;
cout << N / 3 << endl;
} | 1 | 10,964,160 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s, c = "01";
int cont0 = 0, cont1 = 0;
cin >> s;
for(auto i : s){
if (i==c[0]) cont0++;
else cont1++;
}
printf("%d\n", 2*min(cont0,cont1));
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x... | 1 | 13,671,128 |
#include <iostream>
#include <string>
#include <algorithm>
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 q;
int main() {
int a,b;
string str,q_str,m_str;
cin >> str;
... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
string str;
cin >> str;
int n ;
cin >> n;
for(int i = 0; i < n; ++i){
string com;
int a, b;
cin >> com; cin >> a; cin >> b;
if(com == "replace"){
string p;
cin >> p;
str = str.substr(0, a) + p + str.substr(b + 1);
}
if(... | 1 | 43,823,362 |
#include<bits/stdc++.h>
using namespace std;
#define NL "\n"
#define _SAD() ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x,y) sort(x,x+y)
#define REV(a,b) reverse(a,a+b)
#define VSRT(x) sort(x.begin(),x.end())
#define VREV(x) reverse... | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define fix(n) cout<<fixed<<setprecision(n)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
using namespace std;
typedef long long ll;
const ll mod=1000000007;
double pi=3.1415926535;
int main(){
int a,b;
cin>>a>>b;
if(a+b==15) co('... | 1 | 68,700,494 |
#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>;
vector<int> rt[11];
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v[i];
int ans = 0;
for (int l = 0; l <= k; l++) {
for (int... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
vector<int> v(n);
rep(i,n){
cin >> v.at(i);
}
vector<int> fr(n+1),fl(n+1);
fl.at(0) = 0;
fr.at(0) = 0;
rep(i,n){
... | 1 | 19,264,447 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
class cSort
{
public:
void sort( int* arr, int len )
{
int mi, mx, z = 0; fi... | #include<iostream>
#include <algorithm>
#include <vector>
using namespace std;
void Printf(std::vector<int> & a) {
for(int i=0;i<(int)a.size();++i) {
if (i>0){
cout << " ";
}
cout << a.at(i);
}
cout << std::endl;
}
void InputSet(std::vector<int> & a) {
int n;
cin >> n;
a.resize(n,0);
for(int i=0;i<n;+... | 1 | 87,314,445 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,k;
cin >> n>> k;
vector<int>a(n);
vector<int>b(n);
int ri = 0;
int rcount = 0;
int count=0;
int rc=0;
rep(i,n) cin >> a.at(i);
rep(i,n) b.at( a.at(i) - 1 )++;
rep(i,n) if(b.at(i)!=... | 1 | 40,233,492 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#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>
#includ... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
map<long long, int> prime_factorize(long long n) {
map<long long, int> res;
for (long long p = 2; p * p <= n; ++p) {
while (n % p == 0) { ++res[p]; n /= p; }
}
if (n != 1) res[n] = 1;
return res;
}... | 1 | 61,780,839 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 1;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
ll x,y;
cin >> x >> y;
if(x % y == 0){
puts("-1");
return 0;
}
rep(i,100000){
if(x*i % y != 0){
cout << x*i << endl;
return 0;
}
}
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if (X % Y == 0) return cout << "-1" << "\n", 0;
cout << X << "\n";
} | 1 | 46,611,804 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<list>
#define N 10002
using namespace std;
vector<int> G[N+1];
list<int> ans;
bool visited[N+1];
int indeg[N+1];
int n;
void dfs(int node){
visited[node]=true;
for(int i=0;i<G[node].size();i++){
int v=G[node][i];
if(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a)... | 1 | 40,484,084 |
#include <bits/stdc++.h>
using namespace std;
const int MAX { 100 };
vector<string> solve(int A, int B)
{
vector<string> ans(MAX, string(MAX, '.'));
int x = 0, y = 0;
if (A > 1)
B--;
while (--A)
{
if (y + 1 >= MAX)
{
y = 0;
x += 3;
}
fo... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | 1 | 75,002,467 |
#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() {
string s,t;
cin >> s >> t;
int n = s.length();
int m = t.length();
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
if(s<t){
cout << "Yes" << end... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int gcd(int a, int b) {
if (b==0) return a;
else return gcd(b, a%b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main()
{
string s[2];
c... | 1 | 93,687,394 |
#include <stdio.h>
#include <string.h>
void deleteFirst(int**);
void deleteLast(int**);
void insertOne(int**, int**, int, int);
bool deleteOne(int**, int**, int);
int main(void){
int xs[2000001] = {};
int* default_ptr = xs + 2000000;
int* fp = default_ptr;
int* lp = default_ptr;
int len = 0;
int... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string.h>
using namespace std;
struct Node{
int key;
Node *next,*prev;
};
Node *nil;
Node* listSearch(int key)
{
Node* cur=nil->next;
while(cur!=nil&&cur->key!=key)
{
cur=cur->next;
}
return cur;
}
void init()
{
nil=(No... | 1 | 40,975,082 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k, s; cin >> n >> k >> s;
for (int i = 0; i < n; i++) {
if (i < k) cout << s << endl;
else {
if (s == 1000000000) cout << 1 << endl;
else cout << s + 1 << endl;
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int N, K, S;
cin >> N >> K >> S;
int ans[N];
rep(i, K)
ans[i] = S;
int insert;
if(S == 1000000000)
insert = 1;
else
insert = S+1;
for(int i=K; i... | 1 | 79,069,395 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int fibo[n + 1] = { 1, 1 };
for (int i = 2; i <= n; i++) {
fibo[i] = fibo[i - 1] + fibo[i - 2];
}
cout << fibo[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define SORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
using ll = long long;
using namespace std;
ll dp[50];
ll fib(ll k){
if(dp[k] != -1){
return dp[k];
}else if(k =... | 1 | 9,282,837 |
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
char a[101],b[101],c[201];
cin >> a >> b;
strcpy(c,a);
strcat(c,a);
if(strstr(c,b))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
char s[110], p[110];
scanf("%s", s);
scanf("%s", p);
int n = 0;
while(s[n] != '\0') ++n;
int m = 0;
while(p[m] != '\... | 1 | 29,034,093 |
#include <iostream>
#include <string>
#include <vector>
#include "limits.h"
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functional>
#
#define mod 1000000000+7;
typedef long long ll;
using namespace std;
int main() {
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) {
return (a * b) / gcd(a, b);
}
int main(void)
{
ll A, B;
cin >> A ... | 1 | 13,685,289 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define in4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c... | #include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#includ... | 1 | 85,304,766 |
#include <stdio.h>
int main(){
int n,i,counter,l,r;
char s[3];
while(1){
l=2;
r=2;
counter=0;
scanf("%d",&n);
if(n==0)break;
for(i=0;i<n;i++){
scanf("%s",s);
if(s[1]=='u'){
if(l==0||r==0){
l=2;
r=2;
}
if(s[0]=='l')l=1;
else if(s[0]=='r')r=1;
if(l==1&&r==1){
counter++;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i,n) for(int i=0;i<n;i... | 1 | 91,208,149 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,k,x;
cin>>n>>k;
map<int,int>mp;
for(int i=0; i<n; i++)
{
int x;
cin>>x;
mp[x]++;
}
if(mp.size()<=k)
cout<<0<<endl;
else
{
int m=mp.size();
vector<int>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int n,k;
cin >> n >> k;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
vector<int>cnt(n,1);
int x=0;
for(int i=1;i<n;i++){
if(a[i-1]=... | 1 | 74,473,674 |
#include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define prints(x, y) cout<<(x)<<" "<<(y)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#defi... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,k;
cin>>n>>k;
ll ans=1;
ans*=k;
for(ll i=1;i<n;i++){
ans*=(k-1);
}
cout<<ans<<endl;
} | 1 | 32,206,083 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(begin, i, end) for (int i = begin; i < (int)(end); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
ll exp(ll a, ll b)
{
if (b == 0)
{
return 1;
}
return a * exp(a, b - 1);... | 1 | 25,275,646 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
unordered_map<string, int64_t> m;
for (int64_t i = 0; i < N; ++i) {
string s;
cin >> s;
sort(s.be... | #include<iostream>
#include<vector>
#include<map>
int main(void){
std::vector<long long > a(26);
long long n;
std::cin >> n;
std::map<std::vector<long long >, long long> mp;
for(int i = 0; i < n; i++){
std::string s;
std::cin >> s;
for(int j = 0; j < 10; j++){
lon... | 1 | 59,752,495 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, n;
while (cin >> a >> b, a || b){
cin >> n;
int Map[17][17] = {0}, x, y;
bool No[16][16] = {false};
for (int i = 0; i < n; i++){
cin >> x >> y;
No[y - 1][x - 1] = true;
}
Map[0][0] = 1;
for (int i = 0; i < a... | #include <stdio.h>
int main(void)
{
int a[100][100];
int x, y;
int i, j, k;
int num;
int ni[40], nj[40];
while (1){
for (i = 0; i < 100; i++){
for (j = 0; j < 100; j++){
a[i][j] = 0;
}
}
scanf("%d %d", &x, &y);
if (x == 0 && y == 0){
break;
}
scanf("%d", &num);
for (k = 0; k < num; k++)... | 1 | 27,355,508 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void)
{
int n, k;... | 1 | 30,448,565 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n, d;
cin >> n >> d;
vector<vector<ll>> x... | #include <cmath>
#include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n, d;
std::cin >> n >> d;
std::vector<std::vector<int>> x(n, std::vector<int>(d));
for (int j = 0; j < n; ++j)
for (int i = 0; i < d; ++i)
std::cin >> x.at(j).at(i);
int cnt = 0;
for (int i = 0; i < n; ++... | 1 | 68,490,187 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#def... | 1 | 82,428,859 |
#include <cstdio>
int main()
{
int n;
int i = 1;
while (scanf("%d", &n) == 1 && n != 0) {
printf("Case %d: %d\n", i, n);
i++;
}
} | #include<stdio.h>
int main()
{
int i = -1;
int num = 1;
while (1)
{
scanf("%d", &i);
if (i == 0)
{
break;
}
printf("Case %d: %d\n", num, i);
num++;
}
return 0;
} | 1 | 35,917,612 |
#include<stdio.h>
int main(void)
{
int a,b,i,j,s,ss;
s=0;
for(i=0;i<4;i++){
scanf("%d",&a);
s+=a;
}
ss=0;
for(j=0;j<4;j++){
scanf("%d",&b);
ss+=b;
}
if(s>=ss){
printf("%d\n",s);
}
else if(s<ss){
printf("%d\n",ss);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int s[2][4];
for (int i = 0; i < 2; i++){
for (int j = 0; j < 4; j++){
cin >> s[i][j];
if (j != 0) s[i][j] += s[i][j - 1];
}
}
cout << max(s[0][3], s[1][3]) << endl;
return 0;
} | 1 | 99,261,597 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
templ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | 1 | 31,364,057 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N, M, K;
cin >> N >> M >> K;
for (ll i = 0; i <= N; ++i) {
for (ll j = 0; j <= M; ++j) {
ll temp = i * j + (N - i) * (M - j);
if (temp == K) {
cout <<... | 1 | 85,823,489 |
#include <bits/stdc++.h>
#include<vector>
#define ll long long
using namespace std;
int main()
{
int i,j,n,m;
cin>>n;
vector<ll>ara(n);
ll X=0,x=0,ans=INT_MAX;
for(i=0;i<n;i++)
{
cin>>ara[i];
X+=ara[i];
}
for(i=0;i<n;i++)
{
x+=ara[i];
if(i+1<n)ans=min(ans,abs(X-2*x));... | #include<cstdio>
#include<cmath>
#include<string>
#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<map>
#include<set>
#include<limits>
#include<bitset>
using namespace std;
int n,a[300000];
long long int b,sm=0,sa,r=0;
int main(){
cin>>n;
for(int i=0;i<n;i++){
scanf("%d... | 1 | 32,530,827 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 1 | 11,591,434 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.