code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
int N, M;
cin >> N >> M;
multiset<long long> A;
for(size_t i = 0; i < N; i++) {
long long a;
cin >> a;
A.insert(a);
}
for(int i = 0; i < M; i++) {
auto itr = A.end();
itr--;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
vector<int>v;
int n;
int a;
for (int i = 0; i<9; i++){
cin>>a;
v.push_back(a);
}
cin>>n;
set<int>s;
for (int i = 0; i<n; i++){
cin>>a;
s.insert(a);
}
int b,c;
for (i... | 0 | 15,984,307 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
map<int,int> dic;
for(int i=0;i<N;i++){
int a;
cin>>a;
dic[a]++;
}
int sum=0;
for(auto & x:dic){
if(x.first>x.second){
sum+=x.second;
}
else{
sum+=(x.second-x.first);
}
}
cout<<sum<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
vector<int> a(n);
priority_queue<int> q;
ll extra=0,ans=0;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
int b;
cin>>b;
if(a[i]<b) ans++,extra+=b-a[i];
else q... | 0 | 34,988,048 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int n, m;
char tmp;
string ans = "";
while (true){
cin >> n;
if (n == 0)
break;
vector<char> before(n);
vector<char> after(n);
for (int i = 0; i < n; ++i){
cin >> before[i];
cin >> after[i];
}
cin >> m;
fo... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <bitset>
#include <cstdint>
#include <initializer_list>
using namespace std;
using namespace __gnu_pbds;
#define data_set(type) tree<type,null_type,less<type>,rb_tree_tag,tree_order_... | 0 | 83,595,346 |
#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++)
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
yorn(a <= c && c <= b);
return 0;
} | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod... | 0 | 47,310,347 |
#include "bits/stdc++.h"
using namespace std;
typedef long double ll;
#define REP(i, a, b) for(ll i = ll(a); i <= ll(b); i++)
int main()
{
ll a,b;
cin>>a>>b;
if(a>b)
cout<<"GREATER";
else if(a<b)
cout<<"LESS";
else if(a==b)
cout<<"EQUAL";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 66,394,731 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
const int MAX= 10000100;
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
string s;
vector<char> c;
cin >> s;
rep(i, s.size()) if (s[i] != 'x') c.push_back(s[i]);
bool ok = false;
for (int i = 0; i < c.size() / 2; +... | 0 | 96,623,887 |
#include <stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a*a-b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | 0 | 33,824,216 |
#include <bits/stdc++.h>
#define MOD 1e9+7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main()
{
int n, m;
cin >> n >> m;
int t = 100 * (n - m) + 1900 * m;
cout << t * (1 << m) << endl;
}
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void ... | 0 | 8,921,567 |
#include<bits/stdc++.h>
using namespace std;
long long read()
{
char ch=getchar();long long x=0,ff=1;
while(ch<'0'||ch>'9') {if(ch=='-') ff=-ff;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*ff;
}
void write(long long aa)
{
if(aa<0) putchar('-'),aa=-aa;
if(aa>9) write(aa/10);
putchar... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> X;
vector<string> U;
for (int i = 0; i < N; i++) {
float x;
string u;
cin >> x >> u;
X.push_back(x);
U.push_back(u);
}
float total_yen = 0.0;
for (int i = 0; i < N; i++) {
if (U[i] == "JPY") {
tot... | 0 | 59,663,242 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#define inf 1e9+7
#define pb push_back
#define make... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> v;
for (int i = 0; i ... | 0 | 83,587,586 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
int map[15][15];
void floyd(int n)
{
for(int k=0;k<=n;k++)
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
}
}
}
}
int main()
{
int n,i,j,a,b,t;
wh... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
typedef long long int ll;
using namespace std;
int main()
{
int n;
cin >> n;
vect... | 0 | 3,691,166 |
#include<bits/stdc++.h>
#define ntest 0
using namespace std;
long long x[5], res;
void solve() {
for (int i = 1; i <= 4; ++i) cin >> x[i];
res = LLONG_MIN;
for (int i = 1; i <= 2; ++i)
for (int j = 3; j <= 4; ++j) res = max(res, x[i] * x[j]);
cout << res;
}
int main() {
ios::sync_with_stdio(... | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 0 | 31,960,200 |
#include <iostream>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
using lli = long long int;
using Vint = vector<int>;
using Vlli = vector<lli>;
using Wint = vector<Vint>;
using Wlli = vector<Vlli>;
using pii = pair<int, int... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll cnt_p[52], cnt_all[52];
ll recursion(ll n, ll x) {
if... | 0 | 7,769,100 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(j, m) for (int j = 0; j < (int)(m); j++)
#define rep2(i, l, n) for (int i = l; i < (int)(n); i++)
int main() {
int A,B,C;
cin >> A >> B >> C;
vector<int> V(100);
rep(i,100) {
V[i] = A*(i + 1)%... | #include<bits/stdc++.h>
using namespace std;
int main(){
string in,out;
cin>>in;
int j=0;
for(int i=0;i<in.size();i++){
if(in.at(i)=='0'){
out.push_back(j);
out.at(j)='0';
j++;
}else if(in.at(i)=='1'){
out.push_back(j);
out.at(j... | 0 | 57,614,863 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
const long long INF = 100000000;
long long N, M, R;
cin >> N >> M >> R;
vector<long long>r(R);
for(long long i = 0; i < R; ++i){
cin >> r[i];
--r[i];
}
vector<vector<long long>>adj(N, ve... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
const int mx = 1e5 + 5;
int vis[mx], val[mx];
int n, m;
vector<pii> G[mx];
bool dfs(int x){
vis[x] = 1;
for(pii u : G[x]){
if(vis[u.first]){
if(val[u.first] != val[x] + u.second) return false;
else continue;... | 0 | 83,344,278 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | #include <iostream>
#include <vector>
using namespace std;
const int N=200001;
bool vis[N];
int count=0;
void dfs(vector<vector<int>> &g, int root){
vis[root]=true;
count+=1;
for(int v:g[root]){
if(!vis[v]){
dfs(g,v);
}
}
}
int main(){
int n,m;
cin>>n>>m;
vector<v... | 0 | 32,168,411 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
double S(double a, double b, double c, double d, double e, double f) {
double ans;
ans = abs((a*1000 - e*1000) * (d*1000 - f * 1000) - (b * 1000 - f * 1000) * (c * 1000 - e * 1000));
return ans;
}
int main(){
double x[4], y[4], s[3], SS, SS... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | 0 | 57,741,357 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int dp[N];
int a[N];
int b[N];
void solve(){
memset(dp,0x3f,sizeof dp);
int h,n;
cin>>h>>n;
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
}
dp[0] = 0... | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define Rep(i, n) for(int i = 1; i < n; i++)
#define REP(i, vec) for(auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 1000000007;
c... | 0 | 33,204,127 |
#include <iostream>
using namespace std;
int N, S;
int main() {
while (cin >> N && N > 0) {
int sum = 0;
int largest = 0;
int smallest = 1000;
for (int i = 0; i < N; ++i) {
cin >> S;
if (largest < S) {
largest = S;
} if (smallest > S) {
smallest = S;
}
sum += S;
}
cout << ((sum - lar... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | 0 | 252,553 |
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
string s;
cin >> s;
ll n = s.length();
for (int i = 0; i < n - 1; i++)
... | 0 | 68,523,536 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i=0; i<N; i++) {
cin >> S.at(i);
}
int M;
cin >> M;
vector<string> T(M);
for (int i=0; i<M; i++) {
cin >> T.at(i);
}
int score=0;
for (int i=0; i<N; i++) {
int a=0;
for (int ... | 0 | 74,089,488 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
reverse_iterator<std::string::iterator> r = s.rbegin();
string rev(r, s.rend());
cout << rev << '\n';
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
string s;
priority_queue<ll> q;
vector<ll> ans;
while(cin >> s,s!="end"){
ll x;
if(s=="insert"){
cin >> x;
q.push(x);
}
if(s=="extract"){
ll tmp=q.top();
q.pop();
ans.push_back(tmp);
}
... | 0 | 42,551,011 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T>... | 0 | 92,307,423 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string o, e;
cin >> o >> e;
string ans;
for(int i=0; i<e.size(); i++){
ans+=o.at(i);
ans+=e.at(i);
}
if(o.size()>e.size()){
ans+=o.at(o.size()-1);
}
cout << ans << endl;
} | #include <iostream>
#include <cstdint>
#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 <unorder... | 0 | 50,528,091 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | #include<bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a,... | 0 | 19,554,443 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y);
signed main() {
int n;
long long t[100], g, ans;
cin >> n;
for ( int i = 0; i < n; i++ ) {
cin >> t[i];
}
g = t[0];
for ( int i = 1; i < n; i++ ) {
if ( t[i] % g == 0 ) {
g = t[... | #include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) FOR(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#d... | 0 | 26,639,478 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
const double PI = acos(-1);
ll pow_mod(ll p, ll n, ll ... | #include<iostream>
using namespace std;
#include<string>
int main()
{
string s;
getline(cin, s);
int i;
for(i = 0; s[i]; i++){
if((s[i] >= 'a') && (s[i] <= 'z')){
cout << char(s[i] - 32);
}else if((s[i] >= 'A') && (s[i] <= 'Z')){
cout << char(s[i] + 32);
}... | 0 | 46,347,366 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, M;
vector<pair<int, int>> A;
int m[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string k;
string ans;
int ans_len = -1;
bool dfs(int n) {
if ((int)k.size() < ans_len - 3) return true;
if (n == 0) {
ans_len = max(ans_len, (int)k.size());
string tm... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | 0 | 97,760,866 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
signed main(){
int n, m;
scanf("%d %d", &n, &m);
vector<ll> x(n), y(n), z(n);
for(int i = 0; i < n; i++){
scanf("%lld %lld %lld", &x[i], &y[i], &z[i]);
}
ll ans = 0;
for(int bit = 0; bit < (1 << 3); bit++){
ll ans1 = 0;... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<ll> H(N+1);
for(int i=1; i<=N; i++){
cin >> H[i];
}
vector<vector<ll>> dp1(N+1, vector<ll>(N+1, 1e18));
vector<vector<ll>> dp2(dp1);
dp1[0][0] = 0;
for(int i=0; i<N;... | 0 | 4,019,955 |
#include <iostream>
#include <vector>
#define MAX_VALUE 10001
void counting_sort(std::vector<int>& a) {
std::vector<int> c(MAX_VALUE, 0);
for (int i=0; i<a.size(); i++) {
c[a[i]]++;
}
for (int i=1; i<c.size(); i++) {
c[i] = c[i] + c[i-1];
}
std::vector<int> b(a.size());
for (... | #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;
typedef long long LL;
using Graph = vector<vec... | 0 | 51,273,876 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define MOD 1000000007
#define INF (1<<30)
#define LINF (lint)(1LL<<56... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <com... | 0 | 54,839,454 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string a, b;
cin >> a >> b;
if(a[0] == 'H' && b[0] == 'H')
cout << "H" << endl;
else if(a[0] == 'D' && b[0] == 'D')... | 0 | 48,496,596 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <functional>
#include <map>
#include <set>
#include <cmath>
#include <string>
#define SIZE 200005
#define INF 1000000005LL
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int... | #include <iostream>
int main(){
long double x1,y1,x2,y2,x3,y3,x4,y4;
int a;
std::cin>>a;
for(int s=0;s<a;s++){
std::cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if((y2-y1)/(x2-x1)==(y4-y3)/(x4-x3)){
std::cout<<"YES"<<std::endl;
}else{
std::cout<<"NO"<<std::endl;
... | 0 | 83,004,766 |
#include<stdio.h>
int main()
{
int count=0;
int a,b,c,d,n;
while(scanf("%d",&n)!=EOF)
{
count=0;
for(a=0; a<10; a++)
for(b=0; b<10; b++)
for(c=0; c<10; c++)
for(d=0; d<10; d++)
if(a+b+c+d==n)
... | #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>
#include <cctype>
#in... | 0 | 56,565,144 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD (1000000007)
#define MOD2 (998244353)
#define MOD3 (1000000009)
#define PI acos(... | 0 | 23,449,779 |
#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 n;
cin>>n;
cout<<180... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <functional>
#include <iterator>
#include <numeric>
#include <cstdint>
#include <cmath>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define N_TIMES(i, n) for... | 0 | 92,131,525 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
using namespace std;
int main(){
long long s;
cin >> s;
vector<long long> a(1000001);
a[0] = s;
for(long long i = 1; i <= 1000000; i++){
if(a[i-1] % 2 == 0) a[i] = a[i-1]/2;
else a[i] = 3*a[i-1]+1;
}
set<l... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 0 | 46,469,041 |
#include<iostream>
#include<cmath>
#include<string>
#include<cstdlib>
#include<stdio.h>
#include<cctype>
#include<algorithm>
#include<string.h>
#include<iomanip>
using namespace std;
int main()
{
int k=1000,sum=0,count[1000];
int n[1000],x[1000];
for(int i=0;i<k;i++)
{
sum++;
cin>>n[i]>>x[i];
if(n[i]==0&&x[... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
template <class t, class u>
#define gn... | 0 | 82,363,304 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
int INF=1<<29;
int main(){
ios::sync_with_stdio(false);
double N,tmp=0,sum=0;
cin>>N;
vector<double> t(N),v(N);
for(int i=0;i<N;i++){
cin>>t[i];
sum+=t[i];
t[i]+=tmp;... | #include<bits/stdc++.h>
using namespace std;
int main() {
int x[12];
int y[12];
scanf("%d %d %d",&x[0],&x[1],&x[2]);
scanf("%d %d %d",&x[3],&x[4],&x[5]);
scanf("%d %d %d",&x[6],&x[7],&x[8]);
int n;
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
scanf("%d",&y[i]);
for(int i = 0 ;... | 0 | 32,225,695 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
enum Face
{
TOP = 0,
FRONT = 1,
RIGHT = 2,
LEFT = 3,
BACK = 4,
BOTTOM = 5,
};
void roll(vector<int> &f, string cmd)
{
int tmp;
for (int i = 0; i < cmd.size(); i++)
{
switch (cmd[i])
{
case 'E':
tmp = f[TOP];
f[TOP] = f[LEF... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define fi first
#defin... | 0 | 34,085,276 |
#include<iostream>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
#define _GLIBCXX_DEBUG
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define pii pair<long long,long long>... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<iomanip>
#include<utility>
usi... | 0 | 31,285,827 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
int n; cin >> n;
long long cnt = 0;
long long previous = 0;
for (int i = 1; i <= n; i++){
long long height; cin >> height;
if (height < previous) {
cnt += previous - height;
... | 0 | 36,938,726 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int N, K; cin >> N >> K;
if (N % K == 0) cout << 0 << endl;
else cout << 1 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define pq priority_queue
#define MZ 1000000007
bool ok(long long x,long long a,long long b)
{
long long lt,rt;
if(x%2)
{
lt=x/2+1;
rt=x/2+1;
}
else
{
lt=x/2;
rt=x/2+1;
}
if(a<=lt)
lt++;
if(b<=rt)
... | 0 | 17,652,366 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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() {
ll n,m;
cin ... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
string s; cin >> s;
int K; cin >> K;
i... | 0 | 4,352,895 |
#include <cstdio>
#include <cmath>
#include <limits>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdint>
#include <functional>
#include <sstream>
#define rep(i, s, g) for (i... | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define rep... | 0 | 80,213,923 |
#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 long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
typedef vector<bool> vb;
const ll INF=1LL << 60;
const ll MOD=1e9+7;
int main(){
c... | #include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define mod2 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
long long binpow(long long a, long long b) {
long long res = 1;
... | 0 | 67,276,403 |
#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() {
ll n, k;
cin >> n >> k;
map<ll, ll> mp;
rep(i, n) {
ll a, b;
cin >> a >> b;
mp[a] += b;
}
ll ans, cnt = 0;
for (auto x : mp) {
cnt += x.s... | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define pb push_back
#define csl ios_base::sync_with_stdio(false); cin.tie(NULL)
typedef long long ll;
#define reps(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define rep(i,b) for(ll i=0;i<ll(b);i++)
typedef vector<long long> vll;
typedef vector<pair<int,int>> vi... | 0 | 59,616,011 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
const int MAX_N = 1e5 + 5;
const int MAX_L = 20;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
t... | 0 | 87,078,248 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,an;
cin>>n;
an=((2*n)-4)*90;
cout<<an<<endl;
return 0;
} | #include<iostream>
#include<unordered_map>
using namespace std;
int main(){
long N, K;
cin >> N >> K;
long A[N+1];
long S[N+1];
S[0]=0;
for(long i=1; i<N+1; i++){
cin >> A[i];
S[i]=S[i-1]+A[i];
}
long ans=0;
unordered_map<long, long> mp;
for(long j=1; j<=N; j++ ){... | 0 | 80,582,264 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
long long f(string s) {
int N = s.size();
long long sum = 0;
for (long long i = 0, j = 0; i < N; i = j) {
while (j < N && s[... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
int main(){
string s;
... | 0 | 8,026,260 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int lcs(string X, string Y) {
int n, m;
int c[1001][10... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,int> P;
vector<ll> V[110000],T,S;
ll sumT[110000],sumS[110000];
int main(){
int N,K,t;... | 0 | 13,998,258 |
#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>
#inclu... | #include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
string S;
cin>>S;
map<char, int> chrmap;
for(int i=0;i<S.size();++i){
chrmap[S[i]]++;
}
char ans = 'A';
for(char i='a';i<='z';++i){
if(chrmap[i]==0){
... | 0 | 29,477,872 |
#include <bits/stdc++.h>
#define INF 2000000001
#define MAX 502
using namespace std;
int main()
{
int H;
int heap[MAX];
cin >> H;
for (int i = 0; i < MAX; i++) {
if (i >= 1 && i <= H)
cin >> heap[i];
else
heap[i] = INF;
}
for (int i = 1; i <= H; i++) {
cout << "node " << i << ": ";
cout << "key = " ... | #include<bits/stdc++.h>
using namespace std;
#define INF (1<<20)
typedef pair<int,int> P;
vector<P> edge[10];
int dijkstre(int pos){
int min_cost[10];
fill_n(min_cost,10,INF);
priority_queue<P,vector<P>,greater<P> > que;
que.push(P(0,pos));
while(!que.empty()){
P p = que.top(); que.pop();
int cost = p... | 0 | 30,472,889 |
#include <iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main() {
int n,m;
cin>>n>>m;
vector<int>l(m);
vector<int>r(m);
rep(i,m)cin>>l[i]>>r[i];
sort(l.begin(),l.end());
sort(r.begin(),r.end());
int pass;
if(r[0]<... | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair... | 0 | 43,673,849 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <iostream>
using namespace std;
#define MAX_N (1000000)
bool is_prime[MAX_N];
int sum[MAX_N + 1];
int main()
{
int n;
for (int i = 0; i < MAX_N; i++){
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 4; i < MAX_N; i += 2){
is_prime[i] = false;... | 0 | 45,236,461 |
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.fi... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, p;
cin>>n>>p;
string s;
cin>>s;
if(10%p == 0){
long long ans = 0;
for(int i = 0; i < (int)s.length(); i++ ){
if((s[i]-'0')%p == 0) ans+=(i+1);
}
cout<<ans;
return 0;
}
map<in... | 0 | 54,945,391 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
class ARatedForMe {
public:
void solve(std::istream &in, std::ostream &out) {
int r;
in >> r;
if (r < 1200) {
out << "ABC" << endl;
} else if (r < 2800) {
out << "ARC" << endl;
} else {
out << "... | #include<stdio.h>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>pii;
int main()
{
ll mx, my;
scanf("%lld%lld", &mx, &my);
vector<pii>vec;
for (int i = 0; i < mx; i++)
{
ll z;
scanf("%lld", &z);
vec.push_back(make_pair(z... | 0 | 31,156,103 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b)... | #include <iostream>
#include <algorithm>
#include <map>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
int main(void) {
int n, i;
ll a[200003] = {};
map<ll, ll> m;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = 1; i <= n; i++) {
a[i] += ... | 0 | 51,965,712 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std ;
int main()
{
FASTIO
int r , d , x ;
cin >> r >> d >>... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, l, r) for (int i=(l); i<(r); ++i)
#define RREP(i, r, l) for (int i=(r); i>(l); --i)
#define CASET int _T; cin >> _T; REP(caset, 0, _T)
#define print(x) cout << to_string(x) << '\n'
#define vi vector<int>
#define vb vector<bool>
#define v... | 0 | 20,066,545 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using ll = long long;
using namespace std;
int main(){
int n,m,i;
ll tmp,ans = 0;
cin >> n >> m;
priority_queue<ll> q;
for(i=0;i<n;++i){
cin >> tmp;
q.push(tmp);
}
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <time.h>
using namespace std;
typedef long long ll;
int N, M;
vector<vector<int>> graph;
vector<bool> seen;
int cnt = 0;
void dfs(int v)
{
if (seen[v]) return;
seen[v] = 1;
for (int nv : graph[v]) {
if (seen[nv]) c... | 0 | 70,336,294 |
#include <iostream>
#include <string>
using std::string;
int main()
{
string ring;
string target;
std::cin >> ring >> target;
string ringring = ring.append(ring);
size_t idx = ringring.find(target, 0);
if (idx != string::npos) {
std::cout << "Yes" << std::endl;
} else {
std::... | #include <iostream>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(){
int h = 0, w = 0;
while (1){
cin >> h >> w;
if (h == 0 && w == 0){ break; }
for (int i = 0; i < h;i++){
for (int s = 0; s < w; s++){
printf("#");
}
printf("\n");
}
pr... | 0 | 80,374,236 |
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (31 - __builtin_clz(x))
#define SZ(x) ((int)(x).size())
#define BACK(x) prev((x).end())... | #include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD=1e9+7;
const ll LINF=1e18;
const int INF=0x3f3f3f3f;
const int MAXN=100050;
void solve(int T){
ll s,x1,x2,y1,y2;
scanf("%lld",&s);
if(s<=1e9){
printf("0 0 1 0 0 %lld\n",s... | 0 | 45,284,589 |
#include<iostream>
#include<algorithm>
#include<iomanip>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <new>
#include <cmath>
#include<fstream>
using namespace std;
const long long MAXN = 200, mod = 1000000007, inff = 1000000007;
long long n, m, x1, yy,... | #include <iostream>
#include <string>
using namespace std;
int main(){
string a;
cin >> a;
char x=a[0];
char y=a[1];
char z=a[2];
if (x=='R' && y=='R' && z=='R'){
cout << 3;
}
else if (x=='R' && y=='R' && z!='R'){
cout << 2;
}
else if (x!='R' && y=='R' && z=='R'){
cout << 2;
}
else if (x!='R' && y!='R... | 0 | 13,500,449 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
vector<int> s;
cin>>n;
while(n!=0){
s.resize(n);
for(int i=0;i<n;i++){
cin>>s[i];
}
sort(s.begin(),s.end());
s.erase(s.begin());
s.erase(s.end()-1);
int ans = 0;
for(int i=0;i<n-... | #include <iostream>
using namespace std;
int main()
{
int m, f, r;
char student[300];
int count = 0;
while (true)
{
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
{
break;
}
int total = m + f;
if (m == -1 || f == -1 || total < 30)
{
student[count] = 'F';
}
else if (total >= 80)
{
... | 0 | 4,935,706 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll a,b,x; cin>>a>>b>>x;
if(2*x<=a*a*b) {cout<<fixed<<setprecision(15)<<atan((double)(a*b*b)/(2*x))*180/pi<<endl; re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> r(N + 1), g(N + 1), b(N + 1);
for (int i = 1; i < N + 1; i++) {
r[i] += r[i - 1] + (S[i - 1] == 'R');
g[i] += g[i - 1] + (... | 0 | 96,622,384 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int N;
int main(){
cin>>N;
LL ans = 0;
for (int i=1; i<=N; i++) ans += 1LL*i*(N-i+1);
for (int i=1; i<=N-1; i++){
int u,v; cin>>u>>v;
if (u>v) swap(u,v);
ans -= 1LL*u*(N-v+1);
}
printf("%lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#define MINUS(a) memset(a, 0x... | 0 | 72,200,443 |
#pragma region
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrep... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a,l... | 0 | 91,810,603 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200010;
vector<int> num(p,0);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int ans = 0;
for ... | #include <iostream>
int gcd(int m,int n)
{
if(m<n)
{
int t=m;
m=n;
n=t;
}
for(;;)
{
if(n==0)
return m;
int t=m%n;
m=n;
n=t;
}
}
int main()
{
int A,B,K;
std::cin>>A>>B>>K;
int g=gcd(A,B);
int count=0;
for(int i=g;i!=0;i--)
{
if(g%i==0)
{
count++;
... | 0 | 48,110,321 |
#include <iostream>
#include <vector>
using namespace std;
vector<string> c;
int cntB(int bh, int bw) {
int cnt = 0;
for (int i = 0; i < c.size(); ++i) {
if (bh & (1 << i)) continue;
for (int j = 0; j < c[i].size(); ++j) {
if (bw & (1 << j)) continue;
if (c[i][j] == '#') ... | #include <bits/stdc++.h>
using namespace std;
class mint {
int value;
public:
static const int MOD = 1000 * 1000 * 1000 + 7;
mint(long long x)
: value(x % MOD) {}
mint operator+(mint y) const {
return mint(value + y.value);
}
mint operator+=(mint a) {
return *this = *this + a;
}
mint opera... | 0 | 25,996,337 |
#include <bits/stdc++.h>
#define int long long
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
const unsigned int M = 1e9 + 7;
int32_t main() {
fastio;
int n, k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
int ans = 0;
if(k > n) k = n;
f... | #include<iostream>
using namespace std;
int main()
{
int a,b,i,j,m=0,c[100][100];
cin>>a>>b;
char s[100][100];
for(i=0;i<a;i++){
for(j=0;j<b;j++){
cin>>s[i][j];
}
}
for(i=0;i<a;i++){
for(j=0;j<b;j++){
c[i][j]=0;
}
}
for(i=0;i<a;i++)... | 0 | 88,562,090 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
bool ok = (c >= a);
ok &= (c <= b);
printf("%s\n", ok ? "Yes" : "No");
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
long long calc(vector<long long>& List, int K) {
int N = List.size();
vector<long long> LSum(N);
LSum[0] = List[0];
for (int i = 1; i < N; i++) LSum[i] = LSum[i - 1] + List[i];
int NK = K;
if (K > N) K = N;
long long... | 0 | 38,813,162 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
for(int i=0; i<min(s.size(),t.size()); i++){
if(s[i]>t[i]){
cout << "No" << endl;... | 0 | 41,951,065 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using ll = long long;
const ll mod = 1e9 + 7;
int main(){
ll n, k;
cin >> n >> k;
ll ans = 0;
for(ll i=0; i <= n-k+1; i++){
ll s = (i*(n-i+1)+1)%mod;
ans = (ans + s) %mod;
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
string data[10]={
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main(){
int t;
cin>>t;
while(t>0){
t--;
string str;
cin>>str;
string ans;
int counts=0;
for(int i=0;i<str.size();i++){
if(str[i]=='0'){
... | 0 | 94,497,968 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
string ans = "No";
if (N[0] == N[1] && N[1] == N[2]) {
ans = "Yes";
}
if (N[1] == N[2] && N[2] == N[3]) {
ans = "Yes";
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <s... | 0 | 16,868,245 |
#include <iostream>
#include <cctype>
#include <stdio.h>
#include <string>
int main()
{
char ch;
std::string str;
while (1)
{
scanf("%c", &ch);
if (ch == '\n')
{
break;
}
if (islower(ch))
{
str += (char)toupper(ch);
}
else if (isupper(ch))
{
str += (char)tolower(ch);
}
else
{
str... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | 0 | 83,763,416 |
#include <iostream>
using namespace std;
void replace(string &str, int a, int b, string p) {
for (int i = 0; i <= (b - a); i++) {
str[i + a] = p[i];
}
}
void reverse(string &str, int a, int b) {
string newStr = str;
for (int i = a, j = b; i <= b; i++, j--) {
newStr[i] = str[j];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
int a[n];
rep(i,0,n){
cin>>a[i];
}
int b[n];
if(n%2==0){
rep(i,0,n/2){
b[n/2+i]=a[2*i];
}
rep(i,0,n/2){
... | 0 | 3,283,081 |
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < m; i++) {
int x; cin >> x;
mp[x] = 1;
}
vector<long long> fibo(2);
fibo[0] = 0;
fibo[1] = 1;
long long md = 1e9 + 7;
for (int i = 1; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n),b(n);
rep(i,n) cin >> a.at(i);
rep(i,n) cin>> b.at(i);
vector<int> c;
long long point=0;
int ans=0;
rep(i,n){
if(b.at(i)>a.at(i)){... | 0 | 95,529,553 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
char c = s.at(k-1);
for (int i = 0; i < n; i++) {
if (s.at(i) == c)cout << c;
else cout << "*";
}
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define MAXN 105
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORR(j, i, n) for (int i = j; i < n; i++)
#define FORD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOBIR(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp m... | 0 | 97,155,926 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, a, b) for(int i = (a); i < (b); i++)
typedef long long ll;
int main() {
vector<int> a(3);
rep(i, 3) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
cout << a[0] * 10 + a[1] + a[2] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(... | 0 | 97,464,346 |
#include <iostream>
using namespace std;
int main()
{
int P[1000000] = {};
int c = 0, j, k;
for (k = 2; k < 1000000; ++k){
if (P[k] == 0){
++c;
for (j = 2; j * k < 1000000; ++j)
P[j * k] = -1;
}
P[k] = c;
}
while (cin >> k)
cout << P[k] << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n, m;
char c[256];
char a,b;
while( cin >> n && n ){
for( int i=0;i<256;i++ )
c[i] = '.';
while( n-- ){
cin >> a >> b;
c[(int)a] = b;
}
cin >> m;
while( m-- ){
cin >> a;
if( c[(int)a]!='.' ){
cout << c[(i... | 0 | 34,760,699 |
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int a[n];
int b[n]={};
for (int i=0;i<n;i++)
{
scanf("%d",&a[i]);
if (i)
b[i]=a[i]+b[i-1];
else
... | #include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}... | 0 | 4,899,317 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<pair<ll, ll>> p(n);
for (int i = 0; i < n; ++i) {
ll a, b;
cin >> a >> b;
p[i] = {a, b}... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
vector<int> v(26, 0);
int len = s.size();
sort(s.begin(), s.... | 0 | 18,553,274 |
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int main(void) {
string a, b;
cin >> a >> b;
a += a;
if (a.find(b) != string::npos) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | 0 | 61,626,656 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 1; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
int f(int n){
int sum =0;
while(n>0){
sum +=n%10;
n/=10;
}
return sum;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
int k=0;
rep(i,n+1){
int sum =f(i);
if(a <=sum && sum... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <numeric>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#def... | 0 | 71,335,381 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.rbegin(), a.rend());
int aa = -1, b = -1;
int cnt = 0;
for (int i = 0; i < n-1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long int li;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<ll> a(n,0);
for (int i=0; i<n; i++) cin >> a[i];
vector<ll> s(n+1, 0);
map<ll, ll> nums;
for (int i=0; i<n; i++) s[i+1] =... | 0 | 32,346,429 |
#include <bits/stdc++.h>
#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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ctime>
#define int long long
#define dou... | 0 | 33,191,531 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int num;
int main()
{
int a;
int temp;
vector<int> cost(1e5+1,0);
vector<int> dp(1e5+1,0);
while(cin>>a){
fill(cost.begin(),cost.end(),0);
fill(dp.begin(),dp.end(),0);
for(int i=0;i<a;i++){
... | 0 | 59,971,966 |
#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RRE... | #include <bits/stdc++.h>
#include <fstream>
#include <vector>
#include <bitset>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <math.h>
#include <iomanip>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0);
#define all(v) v.begin(), v.end()
#define F first
#define S second... | 0 | 65,072,443 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include <cmath>
#include <limits>
#include <utility>
#include <map>
#include <iomanip>
#define rep(p,q) for(int i = p;i < q;i++)
#define ll long long
using namespace std;
const int cons = 1e9 + 7;
int n;
vector<double> v;
vector<double> l;
vector... | #include <bits/stdc++.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159... | 0 | 62,510,379 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
map<char, int> dictS, dictT; ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#define rep(i,N) for(int i=0;i<N;i++)
long long INF=1000000000000000000;
long long mod=1000000007;
using namespace std;
int N;
void show_ans(int ans[]){
for(int i=1;i<=N;i++){
if(ans[i]==0){
cout<<'S'... | 0 | 7,341,587 |
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
double N, K;
cin >> N >> K;
double ans = 0.0;
for(int i = 0;i < N;i++){
double score = i + 1;
double prob = 1 / N;
while(score < K){
prob /= 2;
score *= 2;
}
ans += prob;
}
cout << fixed << setprecision(1... | #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(... | 0 | 96,233,343 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0, a = 0;
std::cin >> n >> a;
const int t = n % 500;
if (t <= a)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> vector_plus(vector<int> &arr1,vector<int> &arr2,int &m){
vector<int> result(m+1);
for(int i=0;i<m+1;i++){
result.at(i) = arr1.at(i) + arr2.at(i);
}
return result;
}
bool x_check(vector<int> arr,int x,int m){
bool flag = true;
for(... | 0 | 21,700,241 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
# define ll long long int
const int md = 1e9+7;
ll Parent[200005];
ll sze[200005];
void Build(int n)
{ for(ll i=1;i<=n;i++)
{ Parent[i]=i;
sze[i]=1;
}
}
ll find(ll u)
{
if(Parent[u]==u) return u;
else
{
return Parent[u]=fin... | 0 | 14,831,077 |
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#define INF 200000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using... | 0 | 54,467,786 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
#define MAX 2100000
int main(){
int N,K;
cin>>N>>K;
vector<ll> x(N),y(N);
for(int i=0;i<N;i++){
cin>>x.at(i)>>y.at(i);
}
ll ans=4000000000000000000;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
ll left=x.... | #include <iostream>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
for (int i=0; i<2; i++) {
int nx, ny;
int xd = x2 - x1;
int yd = y2 - y1;
nx = x2 - yd;
ny = y2 + xd;
cout << nx << " " << ny;
if (i == 1) cout << en... | 0 | 77,112,700 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <random>
#include <map>
using namespace std;
int fibArray[50];
void makeFibArray() {
for (int i = 2; i ... | #include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll= long long;
using ld= long double;
using vl= vector<ll>;
using vd= vector<ld>;
using vs= vector<string>;
using vb= vector<bool>;
using vvl= vector<vector<ll>>;
using vvd= vector<vector<ld>>;
using vvs= vector<vector<s... | 0 | 57,878,516 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc111_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | # include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n;
ll m, v, p;
vector<ll> a;
bool bin(int i) {
ll sm = 0;
ll k = a[i] + m;
if (k < a[p - 1]) {
return false;
}
sm += (p - 1) * m + (n - i) * m;
for (int x = p - 1; x < i; x++) {
sm += max(ll(0), k - a[x]);
... | 0 | 68,763,654 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
ll m... | #include <bits/stdc++.h>
#define A_MAX 1000000
#define A_MAX_HALF 500000
using namespace std;
int min_factor[A_MAX + 1];
int q[A_MAX + 1];
int a[A_MAX + 1];
int main() {
vector<int> primes{ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, ... | 0 | 90,297,640 |
#include <bits/stdc++.h>
using namespace std;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
int main ()
{
int x , y ;
int baba ;
cin >> x >> y ;
if (y % 2 ==0)
{
baba = x + (y / 2) ;
cout << baba ;
}
return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
#define INF ((1<<30)-1)
#define LLINF (1LL<<60)
#define EPS (1e-10)
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
rep(i, ... | 0 | 48,726,117 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int a, b;
int main(... | #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... | 0 | 75,019,035 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.