code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <sstream>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int N;
int data[251];
cin>>N;
for(in... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long
#define endl "\n"
#define all(x) (x).begin(),(x).end()
const int MOD = 1e9+7;
const int mxN = 2e5+3;
void solve(... | 0 | 63,094,003 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
double a,b,c,d=0,e=0;
cin>>a>>b;
a*=500;
if(a>=b){cout<<"Yes"; return 0;}
if(a<b){cout<<"No"; return 0;}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> kane(N+1);
for(int i = 0; i < N+1; i++){
kane[i] = i;
}
for(int i = 9 ; i < N+1; i = i*9){
for (int j = 0; j < N + 1; j++){
if (j+i < N+1){
kane[j+i] = min(kane[j+i]... | 0 | 884,223 |
#include<bits/stdc++.h>
#define ll long long
#define mod (long long)(1e9+7)
#define endl "\n"
using namespace std;
void solve(){
string s;
cin>>s;
ll n=s.length();
ll ans=0;
for(ll i=0;i<n;i++){
ans=(ans+(s[i]-'0'))%9;
}
if(ans==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
int main(){
ll t=1;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
int main() {
int n;
cin >> n;
vector<ll> a(n), b... | 0 | 75,063,378 |
#pragma region
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, a... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
typedef long long int ll;
typedef vector< pair<int, int> > vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef pair<int, int> pii;
const ll INF = 1e18;
c... | 0 | 98,616,227 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define pi 3.141592653
#define oo 1000000007
#define loo 10000000000000007
#defi... | 0 | 48,966,546 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll dp[1005][1005];
int main() {
string S, T;
c... | 0 | 14,675,852 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (ll i = 0; i < (o);i++)
#define rep_s(i, o) for (int i = 1; i <= (o);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i... | #include <iostream>
#include <vector>
#include <math.h>
using namespace std;
vector<pair<long long, long long> > prime_factorize(long long N)
{
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a)
{
if (N % a != 0) continue;
long long ex = 0;
while (N % ... | 0 | 45,763,166 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
int main(){
int n; cin>>n;
string s; cin>... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 96,145,379 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e5 + 5;
int n, m;
ii a[N];
priority_queue<int, vector<int>, greater<int>> que;
ll res;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; ++i) {
... | 0 | 15,663,095 |
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 33,257,419 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(),in.end()
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
int findLowerBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto low = lower_bound(arr.begin(),
arr.end(), p);
return low - arr.begin();
}
int findUpperBound(
... | 0 | 13,049,978 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
const int INF = 1e9;
co... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("... | 0 | 44,247,640 |
#include<bits/stdc++.h>
#define MAX 1000000007
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
char s[105];
bool cput(LL x) {
printf("? %lld\n",x);
fflush(stdout);
scanf("%s",s);
return s[0] == 'Y';
}
int main() {
int i,l = 0,r;
bool vis = 1;
for(i = 1000000000; i > 0; i ... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
vector<vector<ll>> dp(11);
for(ll i=1;i<10;i++)dp[1].push_back(i);
... | 0 | 51,464,389 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<functional>
#include<iomanip>
#define closeSync ios::sync_with_stdio(0);ci... | #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 << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, H;
cin >> N >> H;
vector<pii> vp(N);... | 0 | 50,631,222 |
#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>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF =... | 0 | 29,758,581 |
#include <stdio.h>
#pragma warning (disable:4996)
#define LANE 12
int main() {
char S[LANE], T[LANE];
(void)scanf("%s", S);
(void)scanf("%s", T);
bool ans = true;
int i = 0;
while (S[i] != '\0') {
if (S[i] != T[i]) {
ans = false;
}
i++;
}
if (T[i + 1] != '\0')ans = false;
if (ans)printf("Yes"); else p... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FOR(i, m, n) for (int i = m; i < ... | 0 | 34,709,126 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++ i)
const int N = 1e5 + 5 ;
using namespace std ;
int n, e, lnk[N], nxt[N << 1], ter[N << 1] ;
void add(int x, int y) {
ter[++ e] = y, nxt[e] = lnk[x], ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int n,dp[111][111],p[111];
int rec(int i,int j){
int Min=2*1e9;
for(int k=0;k<i-1;k++){
Min=min(Min,dp[j+1][j+k+1]+dp[j+k+2][j+i]+p[j]*p[j+k+1]*p[j+i]);
}
return Min;
}
signed main(){
cin>>n;
cin>>p[0]>>p[1];
for(int i=2;i<=n;i++){
... | 0 | 24,938,626 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
string s;
map<string, int> mapn;
rep(i, n){
cin >> s;
++mapn[s];
}
int m;
cin >> m;
string t;
rep(i, m){
cin >> t;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s;
cin>>s;
switch(s){
case 25:
cout<<"Christmas ";
break;
case 24:
cout<<"Christmas E... | 0 | 90,740,172 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h, w, a, b; cin >> h >> w >> a >> b;
vector<vector<bool>> m(h, vector<bool>(w, false));
for (auto i = 0; i < b; i++) for (auto j = 0; j < a; j++) m[i][j] = true;
for (auto i = b; i < h; i++) for (auto j = a; j < w; j++) m[i][j] = true;
fo... | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i != static_... | 0 | 12,911,106 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >>n>>k;
int num[n]={0};
for (int i=0;i<k;i++){
int a;
cin >>a;
for (int j=0;j<a;j++){
int b=0;
cin >>b;
for(int m=0;m<n;m++){
if(b==m+1) ++num[m];
}
}
}
int p=0;
for(int i=0;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
bool bw[w]={0};
bool bh[h]={0};
vector<vector<char>> data(h, vector<char>(w));
for (int i = 0; i < h; i++) {
int cnt_w=0;
for (int j = 0; j < w; j++) {
cin >> data.at(i).at(j);
if (data.at(i).at(j)=='#') {... | 0 | 73,843,666 |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<bitset>
#include<complex>
#include<cmath>
using namespace std;
template<typename __T>
inline void read(__T &x)
{
x=0;
int f=1;char c=getchar();
while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
while(isdigi... | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define MOD (int)1e9+7;
using ll = long long;
using namespace std;
int main() {
int N;
cin >> N;
int cnt[(int)1e5+3] = {0};
int ans = 0;
rep(i, N) {
int a;
cin >> a;
... | 0 | 97,344,998 |
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
for (int n = 0;n<=1000;++n) {
if (A==n*8/100&&B==n*10/100) {
cout <<n<<endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | 0 | 52,491,935 |
#include <bits/stdc++.h>
#define maxn 100005
using namespace std;
typedef long long ll;
ll a[maxn],dig[63];
int vis[63];
void add(ll x){
for(int i=61;i>=0;i--){
if(!vis[i]) continue;
if(x&(1ll<<i)){
if(dig[i]) x^=dig[i];
else{
dig[i]=x;
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[... | 0 | 65,017,422 |
#pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i != static_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long MAX = 10000000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < MAX; i++) {
fac[i] =... | 0 | 14,545,543 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ino freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout);
#define fr(i,n) for(i=0;i<n;i++)
#define frs(i,a,n) for(i=a;i<n;i++)
#define frv(i,n) for(i=n-1;i>=... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | 0 | 78,584,315 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
ll N, ans=0, tmp=0;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
i... | #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,x,n) for(int i=x; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; ret... | 0 | 51,387,604 |
#include <iostream>
int main() {
long long x, y;
std::cin >> x >> y;
long long cnt = 0;
while (x <= y) {
x *= 2;
cnt++;
}
std::cout << cnt << "\n";
return 0;
} | #include<iostream>
using namespace std;
int main() {
int a, b, c, t;
cin >> a >> b >> c;
if (a > b) {
t = a;
a = b;
b = t;
}
if (b > c) {
t = b;
b = c;
c = t;
}
if (a > b) {
t = a;
a = b;
b = t;
}
cout << a << ' ... | 0 | 61,797,416 |
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 0 | 13,814,557 |
#include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl
#define dd(x) cout<<#x<<"="<<x<<" "
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp(u,v) ma... | #include <stdio.h>
#include <stack>
int main(void){
char c;
bool ok;
while(1){
char s[101] = {0};
ok = true;
std::stack<char> st;
for(int i=0; i<101; i++){
scanf("%c", &c);
if(c == '\n'){
s[i] = '\0';
break;
}else{
s[i] = c;
}
}
if(s[0] == '.'){
break;
... | 0 | 60,837,045 |
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrepa(i,a,n) for(int i=n-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
#define cmax(a,b) a=... | #include<stdio.h>
int main(void){
int w,h,x,y,r;
scanf("%d %d %d %d %d",&w,&h,&x,&y,&r);
if(w<x+r || h<y+r || 0>x-r ||0>y-r){
printf("No\n");
}
else {
printf("Yes\n");
}
return 0;
} | 0 | 57,948,453 |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp make_pair
#define all(v) v.begin(),v.end()
#define int long long
#define ll long long
#define M 1000000007
#define mii map<ll ,ll >
#define msi map<string,ll >
#define mis map<ll in... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 100... | 0 | 30,815,433 |
#include <bits/stdc++.h>
#include <tuple>
using namespace std;
#ifdef LOCAL
string to_string(char a) { return string(1,a); }
string to_string(bool a) { return a ? "1" : "0"; }
string to_string(const char* a) { return (string)a; }
string to_string(string a) { return a; }
string to_string(vector<bool> v) {
string s = "... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define trep(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
#define H 1001
#define W 1001
int h, w;
int sx, sy;
int gx, gy;
char c[... | 0 | 18,478,620 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 77,368,075 |
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int a[10];
int go(int i,int n)
{
int s=0;
for(;i<=n;i++)
{
s+=a[i];
}
return s;
}
int main()
{
ft
int i,j,k,n,l,x,y,z;
cin>>n>>x>>y>>z;
for(i=0;i<n;i++)
{
... | #include<bits/stdc++.h>
using namespace std;
vector<vector<int>> G(8);
int cntPath = 0;
int N, M;
void bfs(int cnt, int pos, vector<int> checked){
if(cnt == N - 1){
for(int j = 0; j < N; j++){
if(checked.at(j) == 0) return;
}
cntPath++;
return;
}
cnt++;
for(int i = 0; i < G.at(pos).size();... | 0 | 55,102,962 |
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<long, long>;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define rep(i, n) for(ll i = 0; i<n; i++)
#define rep_s(i... | #include <iostream>
#include <set>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[m];
set<int> st;
for (int i=0; i<m; i++) {
int a;
cin >> a;
st.insert(a);
}
long long p[n+1];
p[0] = 1;
if (*st.begin() == 1) {
p[1] = 0;
st.er... | 0 | 91,507,444 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; ++i)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#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 vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pi... | 0 | 44,268,823 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
V<int> v(3);
for(int i = 0; i < 3; i++) cin >> v[i];
sort(all(v));
int x = v[2] - v[0];
int y = v[2] -... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
#include <stack>
#include <ioman... | 0 | 41,694,533 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using mat = vector<vector<ll>>;
const ll MOD = 1000000007;
const ll ... | 0 | 72,103,132 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_se... | 0 | 100,581,026 |
#include <bits/stdc++.h>
using namespace std;
#define BE(x) x.begin(), x.end()
int main() {
long long l, r;
cin >> l >> r;
long long ans = 2019;
int icnt = 0;
for (long long i = l; i < r; i++) {
int jcnt = 0;
for (long long j = i+1; j <= r; j++) {
ans = min(ans, i*j%2019)... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>
using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for(int i=m; i<n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main(){
int N, K;
cin >> N >> K;
... | 0 | 33,128,819 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (int) n; i++)
#define rall(v) v.rbegin(), v.rend()
#define all(v) v.begin(), v.end()
#define PB push_back
#define F first
#define S second
typedef unsigned long long llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> v... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 42,110,438 |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
void solve() {
long n, k;
stri... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
using ll = long long;
#define rep(i,n) for(int i=0; i<(n); i++)
#define fast_io(); std::ios_bas... | 0 | 18,682,186 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | #include <bits/stdc++.h>
constexpr int INF = 1e9;
using namespace std;
using YX = pair<int, int>;
istream &operator>>(istream &is, YX &p) {
is >> p.first >> p.second;
return is;
}
int dist[1003][1003];
int bfs(vector<string> maize, int r, int c, deque<YX> que) {
const vector<YX> MOVES = {
make_pair(... | 0 | 41,567,977 |
#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;
const int mod=1e9+7;
int6... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int m, n_min, n_max;
while(1) {
cin >> m >> n_min >> n_max;
if(m + n_min + n_max == 0) break;
vector<int> P(m);
for(int i = 0; i < m; i++) {
cin >> P[i];
}
int... | 0 | 35,713,300 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
vector<int> l(n);
for (int i = 0; i < n; i++)
{
cin >> l[i];
}
sort(l.begin(), l.end());
reverse(l.begin(), l.end());
int total = 0;
for (int i = 0; i < k; i++)
{
total += l[i]... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef vector<int> pi;
typedef pair<int,int> vi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(vi c, vi d){
return c.S < d.S;
}
int main() {
ll T, N, H... | 0 | 39,062,792 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int n,m;
vector<int> a;
bool isOK(int index, int x){
if(a[index] <= x) return 1;
else return 0;
}
int binarysearch(int x){
int ok = -1, ng=n-1;
while(ng-ok>1){
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 95,638,218 |
#include<iostream>
using namespace std;
void moveE(int dice[6])
{
int tmp = dice[0];
dice[0] = dice[3];
dice[3] = dice[5];
dice[5] = dice[2];
dice[2] = tmp;
}
void moveN(int dice[6])
{
int tmp = dice[0];
dice[0] = dice[1];
dice[1] = dice[5];
dice[5] = dice[4];
dice[4] = tmp;
}
void moveS(int dice[6])
{
int t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 42,096,273 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
#include <set>
using namespace std;
using vi = vector<int>;
using vsi = vector<set<int>>;
int main(void){
int n, m;
cin >> n >> m;
vi H(n);
for(int &h : H) cin >> h;
vsi O(n);
for(int i=0; i<m; i++){
int a, b;
cin >> a ... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int N; cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
long long res = 0;
for (int k = 0; k < 1e6; ++k) {
for (int i = 0; i < N; ++i) {
if (A[i] < N) continue;
long long cnt = A[i] / N;
A[i]... | 0 | 57,834,492 |
#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... | #include <bits/stdc++.h>
using namespace std;
int dp[2000][2000];
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
while(n--){
string sa, sb; cin >> sa >> sb;
memset(dp, 0, sizeof(dp));
for(int i = 1; i <= sa.size(); i++){
for(int j = 1; j <= sb.size(); j++){
i... | 0 | 60,495,218 |
#include<stdio.h>
#include<cmath>
int main(){
int a,b,deg;
scanf("%d %d %d",&a,&b,°);
double PI = acos(-1);
double rad = deg * PI / 180;
double S = a * b * sin(rad) * 0.5;
double c = sqrt(a*a + b*b - 2*a*b*cos(rad));
double h = b *sin(rad);
printf("%lf\n%lf\n%lf\n",S,a+b+c,h);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 40,933,738 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int x=n;
int f=0;
while(x>0){
f+=x%10;
x/=10;
}
if(n%f==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a,b,c,d,e;
int x,y,w,h,r;
cin >> c >> d >> a >> b >> e;
if(-100 <= a && a <= 100){
x = a;
}
if(-100 <= b && b <= 100){
y = b;
}
if(0 <= c && c <= 100){
w = c;
}
if(0 <= d && d <= 100){
h = d;
}
if(0 <= e && e <= 100){
r = e;
}
if(r <= x &&... | 0 | 66,270,181 |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int main(){
ios::sync_with_stdio(false);
int n;string s;
cin>>n>>s;
int num=0;
long long ans=1;
for(int i=1;i<=n;++i) ans=ans*i%mod;
for(int i=0;i<2*n;++i){
if((s[i]=='W')^num&1) ans=ans*num%mod,num--;
else num++;
}
printf("%lld\n",num?0:ans... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> p(N);
REP(... | 0 | 69,855,507 |
#include <iostream>
#include <string>
int main() {
std::string str;
std::cin >> str;
int n;
std::cin >> n;
std::string command;
int a, b;
for(int i = 0; i < n; ++i) {
std::cin >> command >> a >> b;
if(command == "replace") {
std::string rep;
std::cin >> rep;
str.replace(a, b - a ... | #include<bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin(),a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a,b) memset(a,b,sizeof(a))
using namespa... | 0 | 31,920,892 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(void) {
string s;
while (1) {
bool flag = false;
getline(cin, s);
if (s == ".") break;
stack<char> sc;
char tmp;
for (auto i : s) {
switch (i) {
case '(':
... | #include <bits/stdc++.h>
#include <boost/math/tools/minima.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#define fmin brent_find_minima
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(... | 0 | 27,360,858 |
#include<iostream>
int main(){int N;std::cin>>N,std::cout<<N/3<<std::endl;} | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | 0 | 72,885,723 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.in" , "r" , stdin);
#endif
int n;
cin >> n;
long long ans = 0;
for (int div = 1 ; div <= n ; div++)
for (int mul = div ; mul <= n ; mul += div)... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n)... | 0 | 44,622,138 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> v;
rep(i,n) {
double a;
cin >> a;
v.push(a);
}
... | #include <bits/stdc++.h>
#include<numeric>
#include<cstdlib>
#include <iostream>
#define ll long long int
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define v vector<long long int>
#define vv vector< int>
#define gcd(m,n) __gcd(m,n)
#define vp vector<... | 0 | 39,575,314 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<sstream>
#include<stack>
#include<map>
using namespace std;
#define pd pair<double,double>
int main(){
int d;
while(cin>>d){
int ans=0;
for(int i=1;i<600/d;i++){
ans=ans+d*pow(d*i,2);
}
cout<<ans<<endl;
}
... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string.h>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int m... | 0 | 57,872,050 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> blue(n);
set<string> bcard;
for (int i = 0; i < n; i++) {
cin >> blue[i];
bcard.insert(blue[i]);
}
int m;
cin >> m;
vector<string> red(m);
for (int i = 0; i < m; i++) {
... | 0 | 84,810,796 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long ans = k;
if (k != 1){
for (int i = 1; i < n; i++){
ans *= (k - 1);
}
}
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<stack>
using namespace std;
int main(){
string str,z,x;
while(1){
stack < string > a;
int count = -1,d;
z = "0";
a.push("0");
d = a.size();
getline(cin,str);
if(str == ".") break;
for(int i=0;i<str.size();i++){
if... | 0 | 21,677,515 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI acos(-1)
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), ... | #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | 0 | 82,366,505 |
#include<stdio.h>
#include<string.h>
int main(void)
{
char str[20];
int len,i;
scanf("%s",str);
len=strlen(str);
for(i=len-1;i>=0;i--){
printf("%c",str[i]);
}
printf("\n");
return 0;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 0 | 36,060,982 |
#include <cstdio>
#include <cctype>
int main(){
int i=0, a[26]={0};
char ch;
while( scanf("%c", &ch) != EOF ){
if( isupper(ch) )
ch = tolower(ch);
if('a'<=ch && ch<='z')
++a[ ch-'a' ];
++i;
}
for(int x=0; x<26; ++x)
printf("%c : %d\n", 'a'+x, a[x]);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 5,944,467 |
#include <iostream>
int main()
{
int N, Y, result_10000 = -1, result_5000 = -1, result_1000 = -1;
std::cin >> N >> Y;
for(int i = 0; i <= N; i++)
{
for(int j = 0; j <= N - i; j++)
{
int k = N - i - j;
if(Y == (10000*i + 5000*j + 1000*k))
{
result_10000 = i;
result_5000 ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long INF = (1LL<<62);
typedef long long L... | 0 | 27,436,652 |
#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 <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <cstdio>
#include <string.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < n; i++)
#define bit(i) static_cast<bitset<8> >(i)
typedef long long ll;
typedef unsigned long long... | 0 | 14,181,960 |
#include <iostream>
using namespace std;
int s,t,a;
int main(){
for(int i = 0; i < 4; i++){
cin >> a;
s += a;
}
for(int i = 0; i < 4; i++){
cin >> a;
t += a;
}
cout << max(s,t) << endl;
} | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mx 100000000
#define pb push_back
#define mp make_pair
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";
#define No cout<<"No\n";
#define all(v) (v).begin(),(v).end()
ll md=1e9+7;
ll __gcd(ll a,... | 0 | 95,145,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
ll k, a[55] = {};
cin >> k;
for (int i = 0; i < 50; i++) a[i] = k / 50 + 50 - 1;
for (int i = 0; i < k % 50; i++) {
for (int j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef unsigned long long ll;
int main(){
int N; cin >> N;
vector<int> a(N);
for(int i = 1; i <= N;i++) cin >> a[i];
int count = 0;
for(int i = 1; i <= N; i++){
if(a[a[i]] == i){
count++;
}
}
cout << count / 2<< endl... | 0 | 18,579,657 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
string S;
cin >> S;
long long n = S.size();
vector<long long> num(26);
for(int i = 0;i < n;i++) {
char ch = S.at(i);
num.at(ch-'a')++;
}
long long ans = n*(n-1)/2;
for(int i = 0;i < 26;i++) {
long long N = num.a... | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define typeof(x) __typeof__(x)
#define int long long int
#define mo... | 0 | 53,334,502 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, d, a;
cin >> n >> d >> a;
vector<P> v;
rep(i, n) {
int x, h;
cin >> x >> h;
v.push_back({x, h});
}
sort(v.begin(), v.end());
ll... | 0 | 18,558,524 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
if (N == 1) {
} else {
vector<int> carr(N - 1, 0);
vector<int> sarr(N - 1, 0);
vector<int> farr(N - 1, 0);
for (int i = 0; i < N - 1; i++) {
int c, s, f;
... | 0 | 82,528,141 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,m,sum1,sum2,sum3,val1,val2,val3,val4,mn=1e18;
cin>>n>>m;
for(long long i=1;i<n;i++)
{
vector<long long> v;
sum1=m*i;
if(m%2==0)
{
... | #include <iostream>
int main() {
int N, K;
std::cin >> N >> K;
int M = N * (N - 1) / 2 - K;
if (M < N - 1) {
std::cout << "-1\n";
return 0;
}
std::cout << M << "\n";
for (int i = 2; i <= N; i++)
std::cout << 1 << " " << i << "\n";
int count = N - 1;
for (int i... | 0 | 5,236,927 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int count = 0;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
count += a[i];
}
int count2 = 0;
int ans = 1e9;
for (int i = 0; i < n; i++) {
count2 += a[i];
count -= a[i];
ans =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[105];
signed main() {
int N;
cin >> N;
for(int i = 1; i <= N; i++) {
int X = i;
for(int j = 2; j*j <= i... | 0 | 18,420,833 |
#include <stdio.h>
int main(void){
int n, a, b, c, x, y, count, i, j;
while(1){
scanf("%d%d%d%d%d",&n,&a,&b,&c,&x);
if(n == 0 && a == 0 && b == 0 && c == 0 && x == 0)
break;
count = 0;
for(i = 0;i < n;i++){
scanf("%d",&y);
while(x != y && count <= 10000){
x = (a * x + b) % c;
count++;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007; ... | 0 | 20,413,856 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll l, r;
cin >> l >> r;
if(r - l >= 2019){
cout << 0;
}
else{
ll ans = 2018;
for(long long i = l; i <= r - 1; i++){
for(long long j =... | 0 | 65,689,804 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
string res1 = "YES";
string res2 = "NO";
cin >> a;
cin >> b;
cin >> x;
if (x>a+b || x<a) {
cout << res2 << endl;
}
else if(x>=a && x<=a+b) {
cout << res1 << endl;
}
return 0;
... | #include <bits/stdc++.h>
using namespace std;
static const int M = 1000;
static const int C = 100;
static const int X = 10;
static const int I = 1;
int main(){
int n;
cin>>n;
for(int i=0; i<n; i++){
string s1,s2;
cin>>s1>>s2;
stack<int> dat1;
stack<int> dat2;
int sum1... | 0 | 78,921,036 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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;}
vect... | #include "iostream"
#include "math.h"
int main()
{
double x1, x2, y1, y2, result;
std::cin >> x1 >> y1 >> x2 >> y2;
x1 *= 1.0000000;
x2 *= 1.0000000;
y1 *= 1.0000000;
y2 *= 1.0000000;
x1 = x1 - x2;
y1 = y1 - y2;
result = hypot(x1, y1);
std::cout << std::fixed << result << std::endl;
return 0;
} | 0 | 34,338,825 |
#include<stdio.h>
int main(void)
{
double x1,y1,x2,y2,x3,y3,xp,yp,p,q;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) !=EOF)
{
if(x1==0&&y1==0)
{
}
else
{
x2-=x1;
x3-=x1;
xp-=x1;
y2-=y1;
y3-=y1;
yp-=y1;
x1=0;
y1=0;
}
p=(y2*xp-x2*yp)/(x3*y2-x2*y3);... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | 0 | 88,654,547 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pa... | 0 | 22,068,206 |
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll m,k;
cin >> m >> k;
if(m==0){
if(k==0){
cout << "0 0" << endl;
}else{
cout << -1 << endl;
}
return 0;
}
if(m==1){
if(k==0){
cout << "1 0 0 1" << endl;
}else{
cout << -1 << endl;
... | 0 | 41,982,805 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl... | #include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using names... | 0 | 19,041,608 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#define rep(i,n) Rep(i,0,n)
#define Rep(i,k,n) for(int i=k ; i<n ; i++)
#define vi vector<int>
#define Sort(v) sort(v.begin(),v.end())
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int ans = 0;
Rep(i,a,b+1){
... | #include <iostream>
#include <complex>
#include <cmath>
using namespace std;
typedef complex<double> xy_t;
const xy_t i( 0.0, 1.0 );
int N;
xy_t A(0.0, 0.0), B(100.0, 0);
void show_vertex(xy_t p){
printf("%.8f %.8f\n",p.real(), p.imag());
}
void koch(xy_t p1, xy_t p2, int n){
if(n == 0) show_vertex(p1);
els... | 0 | 54,500,195 |
#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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#define rep(i,j) for(i=0;i<j;i++)
using namespace std;
typedef int Natural;
class UnionFindTree
{
public:
Natural Node_num;
Natural *parents;
Natural *ranks;
UnionFindTree(Natural n):Node_num(n+1)
{
n++;
parents=new Natural[n];
ranks=new Natura... | 0 | 67,782,338 |
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = { -1, 0, ... | #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 bitcount(x) __builtin_popcount(x)
#define bitcountll(x) __builtin_popcountll(x)
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
... | 0 | 59,126,163 |
#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--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <cstdio>
#include <algorithm>
#include <bitset>
#define MAXN 5005
#define MAXBS 5005
using namespace std;
bitset<MAXBS> bs;
int a[MAXN];
int main(void){
int n,k;
int ll,rr;
scanf("%d%d",&n,&k);
for (int i=0;i<n;i++){
scanf("%d",a+i);
}
sort(a,a+n);
n=lower_bound(a,a+n,k)-a;
... | 0 | 60,955,899 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int d, t, s;
cin >... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <list>
#include <string>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
typedef long l... | 0 | 16,692,954 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int N;cin>>N;
vector<int> a(N);
REP(i, N) c... | 0 | 79,833,741 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
int a,b;
cin>>a>>b;
string aa,bb;
for(int i=0;i<b;++i)
{
bb+=(a+'0');
}
for(int i=0;i<a;++i)
{
aa+=(b+'0');
}
cout<<min(aa,bb)<<"\n";
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
inline char dif(char sp) {
if (sp == 'S') {
return 'W';
} else {
return 'S';
}
}
inline char next(char prevsp, char prevsay, char nowsp, char nowsay) {
char res;
if (nowsp == 'S') {
if (nowsay == 'o') {
res = prevsp... | 0 | 85,653,601 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s; cin >> s;
ll n = s.length();
ll left[n + 24] = {0};
ll right[n + 24] = {0};
for(ll i = 0; i < n; ++i){
if(s[i] == '<'){
left[i + 1] = left[i] + 1;
}else left[i + 1] = 0;
}
f... | 0 | 1,937,339 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);
using namespace std;
int main(){
int n;
cin >> n;
map<int,int> mp1,mp2;
f... | #include<iostream>
using namespace std;
int main(){
int h,w,i,j;
for(;;){
cin>>h>>w;
if(h==0)exit(0);
for(i=0;i<h;i++){
for(j=0;j<w;j++){
if(i==0||i==h-1){cout<<"#";}
else if(j==0||j==w-1){cout<<"#";}
else{cout<<".";}
}
cout<<endl;
}
... | 0 | 17,173,898 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<queue>
#include<functional>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<stack>
#include<math.h>
#include<stdlib.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<double, double>... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define integer int32_t
#define mod 1000000007
#define vint vector<int>
#define pint pair<int, int>
#define umint unordered_map<int, int>
#defi... | 0 | 47,887,520 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n, t;
cin >> n >> t;
long long int a, b;
long long int total = 0;
cin >> b;
for (int i = 1; i < n; i++) {
cin >> a;
total += min(t, (a - b));
b = a;
}
cout << total + t;
}
int main() {
ios::sync_with_stdio(false);
... | #include <iostream>
using namespace std;
int main() {
int n,y;
cin >> n >> y;
int a= -1, b = -1, c = -1;
for (int i = 0; i < n + 1; i++) {
if (y < i * 10000) break;
for (int j = 0; j < n - i + 1; j++) {
int n_d = n - i - j;
int total = 10000 * i + 5000 * j + 1000 ... | 0 | 58,659,302 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int LorR[26] = { 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 };
string s;
while (cin >> s, s != "#")
{
int ans = 0;
for (int i = 1; i < s.size(); i++)
{
int now = s[i] - 'a';
int before = s[i - 1] - ... | #include<iostream>
using namespace std;
int main()
{
long long n,i,s=0;
cin>>n;
long long a[n+1];
long long b[n];
for(i=0;i<n+1;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
cin>>b[i];
}
for(i=0;i<n;i++)
{
if(b[i]<a[i])
{
s=s+b[i];
... | 0 | 15,749,570 |
#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 =... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) ret... | 0 | 40,021,282 |
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,Q;
cin >> n >> Q;
atcoder::dsu d(n);
while(... | #include <bits/stdc++.h>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
const ll mod = 1000000007;
const ll N = 300005;
const ll inf = 10000000000000000;
... | 0 | 6,829,836 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
const int M = 1e9+7;
using namespace std;
main()
{
fast;
ll n,m;
cin>>n>>m;
if (n==m/2)
cout<<n<<endl;... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define cerr cout
#define int long long
#define all(x) (x).begin(), (x).end()
const int maxn = 20;
int C[maxn], U[maxn];
int A[maxn][maxn];
signed main() {
ios::sync_with_stdio(0);
cin.sync_wi... | 0 | 82,038,121 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<int> X(N);
int sum=0;
for(int i=0; i<N; i++){
cin >> X.at(i);
sum=sum+X.at(i);
}
int P=sum/N;
int ans1=0;
for(int i=0; i<N; i++){
ans1=ans1+(X.at(i)-P)*(X.at(i)-P);
}
int ans... | #include <iostream>
#include <algorithm>
int main () {
int n, k, x=0;
std::cin >> n >> k;
int a, check[200000] ={0};
for(int i = 0; i < n; i++){
std::cin >> a;
check[a] += 1;
}
for(int i = 0; i < 200000; ++i){
if(check[i] != 0) ++x;
}
std::sort(check, check + 2000... | 0 | 56,678,694 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin >> n;
long long int a[n];
long long int sum=0;
for(long long int i=0;i<n;i++){
cin >> a[i];
a[i] -= (i+1);
sum += a[i];
}
sort(a,a+n);
long long int tmp=0;
long long int ans=1e18;
... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
for (int i = 0; i < a; i++)
{
ci... | 0 | 54,454,415 |
#include <iostream>
using namespace std;
int main()
{
int input_01[255];
int input_02[255];
int input_id = 0;
while(1) {
cin >> input_01[input_id] >> input_02[input_id];
if(input_01[input_id] == 0 && input_02[input_id] == 0) break;
input_id++;
}
int draw_id = 0;
while... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | 0 | 31,090,279 |
#define _CRT_SECURE_NO_DEPRECATE
#pragma warning(disable:4996)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <functional>
#include <iterator>
#include <iomanip>
#include <iostream>
#include <l... | #include <bits/stdc++.h>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; re... | 0 | 58,628,295 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#defin... | 0 | 19,243,159 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.