code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a;
cin >> n >> a;
int all = n * n;
int b = all - a;
cout << b << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--... | 0 | 41,377,984 |
#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <numeric>
#include <vector>
#include <iterator>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <cmath>
#include <stack>
#include <cctype>
#include <bitset>
#define d... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long>;
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
lon... | 0 | 62,186,308 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
string S;
int main() {
cin >> S;
ll sum = 0;
for (int i = 0; i < S.length(); i++) {
sum += S[i] - '0';
}
cout << ((sum % 9 == 0) ? "Yes" : "No") << endl;
return 0;
} | #include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define en '\n'
#define rep(i,n) for(ll i=0; i<n; i++)
#define rep1(i,a,b) for(ll i=a; i<=b... | 0 | 86,560,662 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include<stdio.h>
#include <cstdint>
#inclu... | #include <bits/stdc++.h>
int main() {
char str[1024];
char ope[256];
char obj[1024];
int q;
int a, b;
char temp;
scanf("%s", str);
scanf("%d", &q);
for(int i = 0; i < q; ++i) {
scanf("%s", ope);
if( strcmp("replace", ope) == 0 ) {
scanf("%d %d", &a, &b);
scanf("%s", obj);
for... | 0 | 43,533,214 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <utility>
#include <iomanip>
#include <queue>
#include <set>
#include <numeric>
#include <unordered_set>
#define rep(i,n) for(int i=0;i< (n);++i)
typedef long long ll;
using namespace std;
ll gcd(ll a,ll b){
while(true){
b=b%a... | 0 | 88,769,294 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | #include<iostream>
#include<vector>
#include<algorithm>
#include <bitset>
using namespace std;
bool ok(vector<int> &v,int g){
bitset<32000> cur;
cur[16000] = 1;
for(int i=0;i<v.size();++i){
cur = ((cur << v[i]) | (cur >> v[i]));
}
return cur[16000+g];
}
int main(){
string s;
int gx,gy;
cin >> s;
cin >> gx >>... | 0 | 35,191,253 |
#include<bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) { }
bool unionSet(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
bo... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
using namespace std;
int main() {
string S;
cin >> S;
long long ans = 0;
long long index = 0;
rep(j, 0, S.size()){
if(S[j]=='B') {
index++;
... | 0 | 69,360,824 |
#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 mod=1000000007;
const int INF=1001001001;... | #include<string>
#include<iostream>
using namespace std;
int main(){
int a[3]={};
int acheck[3]={};
int b[3]={};
int bcheck[3]={};
int c[3]={};
int ccheck[3]={};
int i;
int j;
int bingoflag=0;
cin>>a[0]>>a[1]>>a[2]>>b[0]>>b[1]>>b[2]>>c[0]>>c[1]>>c[2];
int check[10];
for(i=0;i<=9;i++){
cin>>che... | 0 | 93,428,547 |
#include <cstdio>
#include <string>
#include <map>
using namespace std;
int main()
{
char text[32];
string str[1001];
map<string, int> test;
int i = 0, len = 0, max = 0, now;
while(scanf("%s", text) != EOF){
str[i] = text;
test[str[i]]++;
now = str[i].size();
if(max < now){
len = i;
max = str[len].si... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 69,625,255 |
#include <iostream>
#include <cmath>
using namespace std;
bool plusInteger(double a)
{
if (floor(a) == ceil(a))
{
if (floor(a) >= 0)
{
return 1;
}else
{
return 0;
}
}else
{
return 0;
}
}
int main(int argc, char const *argv[])
{
... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define ... | 0 | 3,490,303 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int idx[27], pre[27];
int main() {
string s;
cin>>s;
int n =s.size();
vector<int> ans={-1, -1};
for (int i = 0; i < 26; ++i) {
int minv1 = 0;
int minv2 = 1000000000;
int idx1= 0;
... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 0 | 4,177,770 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
int main(){
uint N, M;cin>>N>>M;
vector<int64> X(N),Y(N),Z(N);
for(uint i=0;i<N;++i){cin>>X[i]>>Y[i]>>Z[i];}
int64 m=0;
vector<int64> v(N);
for(uint i=0; i<8; ++i){
int x=(i&0b001)?1:-1;
int y=(i&0b010)?1:-1;
... | 0 | 39,494,084 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vllv vector<vector<ll>>
#define vpii vector<pair<ll,ll>>
#define pll pair<ll,ll>
#define sz size()
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.... | 0 | 36,117,213 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<int,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... | #include<iostream>
#include<vector>
#define rep(i,n) for(int i=0; i<(n); ++i)
int main(){
int n,m; std::cin >> n >> m;
std::vector<bool> ac(n+1,false);
std::vector<int> wa_cnt(n+1,0);
rep(i,m){
int p;
std::string s;
std::cin >> p >> s;
if(ac[p]) continue;
if(s == ... | 0 | 2,673,793 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef complex <double> cp;
#define debug(a) cout<<#a<<":"<<a<<endl;
#define fr freopen("in.txt","r",stdin);
#define Fill(x,a) memset(x,a,sizeof(x))
#define cpy(a,b) memcpy(a,b,sizeof(a))
const double PI = acos(-1);
const int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vv vector<ll>
#define MAX 105000
#define fr(i,x) for(int i=0;i<x;i++)
int dx[4] = {-1,0,0,1};
int dy[4] = {0,-1,1,0};
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
if(a.first ==... | 0 | 96,807,881 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE\n"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(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; return 1; } return 0; }
int main() {
... | 0 | 100,434,314 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
#define MAX 100005
#define NIL -1
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool Check(string s,int W){
int count = 0;
for(int i=0;i<W;i++){
if(s[i] == '.') count++;
}
if(count == W) return false;
else return true;
}
int main(){
int H,W;
cin >> H >> W;
vector<string> S;
string key;
... | 0 | 24,033,057 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll N, K;
cin >>... | 0 | 25,493,608 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N,D,A,ans=0;
cin >> N >> D >> A;
vector<pair<int64_t,int64_t>> X(N);
queue<pair<int64_t,int64_t>> P;
for(int64_t i=0;i<N;i++){
cin >> X.at(i).first >> X.at(i).second;
}
sort(X.begin(),X.end());
int64_t a=0;
for(int64_t i=0;i<N;i++){... | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n,h[30];
cin >> n;
for(int i = 0; i < n; i++)
cin >> h[i];
int sum = 1;
bool flag;
for(int i = 1; i < n; i++) {
for(int j = 0; j <= i-1; j++) {
if(h[i] >= ... | 0 | 61,172,237 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
string S;
cin >> S;
int res = 1;
for (int i = 1; i < N; i++)
{
if (S.at(i) != S.at(i - 1))
res++;
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
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(){
ll n,h;
cin >> n >> h;
v... | 0 | 95,535,850 |
#include"bits/stdc++.h"
#define sz(a) (int)a.size()
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin>>n; vector<int>a(n),v1(n),v2(n); for(int i=0;i<=n-1;i++){ cin>>a[i]; }
v1[0]=a[0]; v2[n-1]=a[n-1]; for(int i=1;i<=n-1;i++) v1[i]=max(a[i],v1[i-1]); for(int i=n-2;i>=0;i--... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 53,351,919 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
using p = pair<int,int>;
bool vectorcheck(vector<int>& x,vector<int>& y,int size){
for (int i = 0; i < size; i++)
{
if(x[... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#... | 0 | 62,572,307 |
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i = s;i<n;i++)
#define repe(i,s,n)for(ll ... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
int main()
{
int a,b,c,d,e,k=0,s,a1,b1,c1,d1,e1,z[5];
cin>>a>>b>>c>>d>>e;
if (a%10==0)
k=k+a;
else
{
... | 0 | 21,685,717 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define int long long
#define puts(x) cout<<x<<endl
#define inf 243000000000000001
#define minf -243000000000000001
signed main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
vector<int>ans(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | 0 | 87,280,785 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | 0 | 53,687,872 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string w;
int a, c, b;
while (cin >> w >> a) {
if (w == "-") break;
for (int i = 0; i < a; i++) {
cin >> b;
w = w.substr(b) + w.substr(0, b);
}
cout << w << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int mod=1000000007;
int n,m;
char s[30005];
int d[10][2];
set<int> ans;
for (int i=0;i<10;i++) {
d[i][0]=30005;
d[i][1]=-1;
}
scanf("%d",&n);
scanf("%s",s);
for (int i=0;i<n;i++) {
int p=s[i]-'0';
... | 0 | 32,824,720 |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int n, l, i, a[100003], mt;
scanf("%d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
long long ans = 0;
for (int i = n-1; i >= 0; i--) {
a[i] += ans;
if (a[i] % b[i] != 0) {
... | 0 | 74,436,004 |
#include<cstdio>
#include<cstring>
int main(void){
int s, n;
int i, j;
int flag = 0;
char txt[101];
char pat[101];
scanf("%s", txt);
scanf("%s", pat);
n = strlen(txt);
s = strlen(pat);
for(i = 0; i < n; i++){
int p = i;
while(j < s){
if(p == n) p = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 95,449,508 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int m... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 | 70,240,079 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
ll gcd(ll a,ll b) {
return b? gcd(b,a%b): a;
}
ll lcm(ll a,ll b... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
if (N % 2 == 1) {
... | 0 | 52,294,274 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N,ans = 0;
cin >> N;
string s[N];
rep(i,N)cin >> s[i];
for(int k=0;k<N;k++){
bool ok = 1;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if((i+k)%N==j)contin... | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
vector<char> alphabet{'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i'... | 0 | 52,306,764 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int num[4];
num[0]=n/1000;
num[1]=(n-num[0]*1000)/100;
num[2]=(n-num[0]*1000 -num[1]*100)/10;
num[3]=(n-num[0]*1000 -num[1]*100 -num[2]*10);
if(num[1]==num[2] && (num[0] == num[1] || num[1] == num[3])){
cout << "Yes" << endl;... | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
char a, b;
std::cin >> a >> b;
if (a == 'H')
std::cout << b << std::endl;
else
if (b == 'H')
std::cout << 'D' << std::endl;
else
std::co... | 0 | 80,021,517 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll ans = 0;
vector<ll> o(5);
rep(i,5) {
cin >> o[i];
}
ll min = 10;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll Q,H,S,D;
cin >> Q >> H >> S >> D;
ll N;
cin >> N;
N *= 4;
ll ans = 0;
ll... | 0 | 56,215,101 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
int main() {
int n;
cin >> n;
vector<int> b(n-1);
rep(i,n-1) cin >> b[i];
int ans = b[0]+b[n-2];
rep(i,n-2){
ans += min(b[i],b[i+1]);
}
cout << ans << endl;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 33,593,401 |
#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;
vector<int> a(n);
vector<int> b(n);
rep(i, n) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod... | 0 | 62,606,584 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
strin... | 0 | 46,932,651 |
#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;
typedef long long int ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector <string> vs;
typedef vector<vector<int>> vvi;
typedef pair<int,int> pi;
#define forl(i,a,b) for (int i = a; i < b; i++)
#define r... | 0 | 100,251,529 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long resx = 0;
for(int i=0; i<n; ++i) {
long long tmp;
cin >> tmp;
resx -= (n - (2 * i) - 1) * tmp;
resx %= MOD;
}
long long resy = 0;
for(int i=0; ... | 0 | 8,050,584 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int t = s.size();
int f = ( t - 1 ) / 2;
int l = ( t + 3 ) / 2;
string fs;
string ls;
for ( int i = 0; i < f; ++i ) {
fs += s[i];
}
for ( int i = l-1; i < t; ++i ) {
ls += s[i];
}
... | #include<stdio.h>
int main(){
const int MAX_V = 1000000;
int prime[MAX_V+1];
int i, k, v;
int ans;
for(i = 2; i <= MAX_V; i++){
prime[i] = 1;
}
for(i = 2; i*i <= MAX_V; i++){
if(prime[i]){
for(k = 2 * i; k <= MAX_V; k += i){
prime[k] = 0;
}
}
}
while(scanf("%d", &v) != ... | 0 | 13,342,925 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<double> v(n);
rep(i,n) {
cin >> v[i];
}
sort(v.begin(),v.end());
double ans = v[0];
for(int i = 1; i < ... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<int> to[200005];
int main()
{
int n;
cin >> n;
vector<string> w(n);
rep(i, 0, n) cin >> w[i];
map<string, int> mp;
rep(i, 0, n){
if(mp[w[i]... | 0 | 4,332,957 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[301];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, avail; cin >> n >> avail;
fill(dp + 1, dp + n + 1, 1e9 * 305);
vector<ll> block(n + 1);
for (int i = 1; i <= n; ++i)
cin >> block... | #include<iostream>
#include<stdio.h>
#include<cctype>
using namespace std;
int main(){
char c;
while(1){
scanf("%c",&c);
if(isupper(c)){
c=tolower(c);
}else{
c=toupper(c);
}
cout<<c;
if(c=='\n'){break;}
}
return 0;
} | 0 | 35,452,527 |
#include <iostream>
using namespace std;
int main() {
string s;
cin>>s;
for(int i=0;i<s.length();i=i+1){
if(s[i]=='1')
cout<<9;
if(s[i]=='9')
cout<<1;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string num;
int ans, digit;
ans = 0;
while(1){
cin >> num;
if(num == "0") break;
for (int i = 0; i < num.length(); ++i)
{
digit = num[i] -'0';
ans += digit;
}
... | 0 | 76,842,952 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<ll,ll> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.... | 0 | 60,013,143 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1000000007;
const ll INF = 9223372036854775807;
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Pi acos(-1)
int mai... | #include <iostream>
#include <vector>
int main()
{
long long N;
std::cin >> N;
long long n_r = 0, n_g = 0, n_b = 0;
std::vector<char> S(N);
for (long long i = 0; i < N; i++)
{
char c;
std::cin >> c;
S[i] = c;
if (c == 'R')
{
n_r++;
}
... | 0 | 29,545,486 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define long long long
const long MOD = 1e9+7, LINF = 1e18 + 1e16;
const int INF = 1e9+1;
const double EPS = 1e-10;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
class TaskD {
long k, n, a[51];
public:
void solve(istream &cin, ostream &cout) {
cin >> k;
n = ... | 0 | 25,341,222 |
#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 = 1001001001;
int main(){
int a;
cin >> a;
if (a >= 1200) cout << "ARC" << endl;
else cout << "ABC" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int i=0;i<s.size();i++){
char... | 0 | 98,518,504 |
#include<iostream>
using namespace std;
int main(void) {
while(1) {
int m, f, r;
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
int result = 0;
if (m != -1)
result += m;
if (f != -1)
result += f;
char grade;
if (r... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll k;
cin>>k;
... | 0 | 30,598,559 |
#include <bits/stdc++.h>
#define maxn 100001
#define maxa 2000005
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
#define ll long long
#define pii pair<ll, ll>
#define piii pair<pii, ll>
#define ft first
#define sd second
#define pb push_back
#define rep(i, a, n) for(ll i = a; i < n; i++)
#d... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s, t;
cin >> s; cin >> t;
bool flg = false;
if(s == t) flg = true;
else{
for(int i=1; i<s.length(); i++){
s = s.at(s.length()-1) + s.substr(0, s.length()-1);
if(s == t){
flg = true; break;... | 0 | 69,771,106 |
#include <iostream>
using namespace std;
int fib(int n){
int dp[50];
dp[0] = 1;
dp[1] = 1;
for(int i = 2; i < 45; ++i){
dp[i] = dp[i-1] + dp[i-2];
}
return dp[n];
}
int main(){
int n;
cin >> n;
cout << fib(n) << endl;
} | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1 << 30;
int main(void){
int n;
cin >> n;
vector<int> A(n);
vector<int> dp(n);
for(int i=0;i<n;i++){
cin >> A[i];
dp[i] = MAX;
}
for(int i=0;i<n;i++){
vector<int>::iterator it = lower_bound(dp.begin(... | 0 | 66,930,742 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
bool g[10][10];
int main() {
int n,m;
cin >> n >> m;
rep(i,m) {
int a,b;
cin >> a >> b;
a--; b--;
g[a][b] = true;
g[b][a] = true;
}
std::vector<int> v(n);
rep(i,n) v[i] = i;... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+10;
const double PI=acos(-1);
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
... | 0 | 33,058,146 |
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << int(a/b) << " " << (a % b) << " " << fixed << (double)a / (double)b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 56,224,579 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <functional>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
const int inf = 3000;
int main(){
string s;
string t;
cin >> s >> t;
vector<vector... | #include <iostream>
using namespace std;
int main(){
int n; cin >> n;
int a[n];
int minj;
int tmp;
int cnt = 0;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
minj = i;
for(int j=i;j<n;j++){
if(a[j]<a[minj]){
minj = j;
... | 0 | 40,827,168 |
#include "bits/stdc++.h"
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;++i)
#define END(x) (*(x.end()-1))
using namespace std;
typedef long long ll;
template<typename T>
T gcd(T a, T b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
template<typename T>
T lcm(T... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define emplace_back push_back
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ... | 0 | 45,782,244 |
#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(... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<=n;++i)
const int sup=101;
char map[sup][sup];
int main(){
int a,b;
cin>>a>>b;
int tmp_a=a;
int tmp_b=b;
if(a>b){
a=tmp_b;... | 0 | 18,840,085 |
#include <bits/stdc++.h>
#include <stdlib.h>
#include <fstream>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(... | #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; cin >> n;
map<ll, ll> mp;
rep(i, n) {
ll a; cin >> a;
mp[a]++;
}
vector<ll> vc;
for (auto it=mp.begin();it!=mp.end();it++... | 0 | 49,515,363 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
priority_queue <pair<int,int> > h;
while(a--)
{
int w;
cin>>w;
h.push(make_pair(w,1));
}
while(b--)
{
int w;
cin>>w;
h.push(make_pair(w,2));
}
while(c--)
{
int w;
cin>>w;
h... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n;cin>>n;
vector<int>v[n+1];
int dst[n+1];bool vstd[n+1];
for(int i=1;i<=n;i++){
int a;cin>>a;
v[i].push_back(a);
}
memset(vstd,0,sizeof vstd);
memset(dst,0,sizeof dst);
queue... | 0 | 11,658,099 |
#include <stdio.h>
#include <string.h>
char *reverse(char *s)
{
int i;
char tmp;
for(i=0; i<strlen(s)/2; i++){
tmp = s[i];
s[i] = s[strlen(s)-1-i];
s[strlen(s)-1-i] = tmp;
}
return s;
}
int main()
{
char str[21];
scanf("%s", str);
printf("%s\n", reverse(str));
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a.begin(), a.end());
int maxDiff = -1;
int ans = -1... | 0 | 81,725,108 |
#include<string>
#include<vector>
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<functional>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define ... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 5,788,733 |
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(int i = s;i<n;i++)
#define repe(i,s,n)for(ll... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int... | 0 | 51,032,698 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define all(x) (x).begin(), (x).end()
#define rall(x) r... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever while (true)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template<ty... | 0 | 24,328,453 |
#include<bits/stdc++.h>
using namespace std;
unordered_map<int,vector<int>> graph;
vector<int> visited(200005);
int dfs(int i) {
int conn = 1;
for(int j = 0; j < graph[i].size(); j++) {
if(!visited[graph[i][j]]) {
visited[graph[i][j]] = 1;
conn += dfs(graph[i][j]);
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
map< int, int > mp;
int n;
cin >> n;
int cnt=0;
int arr[n+1];
for(int i=1; i<=n; i++){
cin >> arr[i];
mp[i] = arr[i];
}
for(int i=1; i<=n; i++) {
if(mp[arr[i]]==i) cnt++;
}
cout << cnt/2 << endl;
return 0;
} | 0 | 28,356,393 |
#include<bits/stdc++.h>
#define fi 2*acos(0.0)
#define ee 2.71828
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define valid(n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<double, double> P;
typedef pair<double, P> DP;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (... | 0 | 29,173,086 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<string>S(H);
for (int i = 0; i < H; i++) {
cin >> S.at(i);
}
int count = 0;
vector<vector<int>> yoko(H, vector<int>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (S.at(i).at(j)... | #include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cs... | 0 | 56,834,472 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
int N;
string S;
cin>>N>>S;
long long int cou[3]={0,0,0};
for(int i=0;i<N;i++){
if(S[i]=='R')cou[0]++;
if(S[i]=='G')cou[1]++;
if(S[i]=='B')cou[2]++;
}
... | 0 | 5,324,171 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
int ... | #include<bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define mp make_pair
#define endl "\n"
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define lb lower_bound
#define forn(i,n) for(ll i=0 ; i<n ; i++)
#define arr(a,n) for(ll i=0;i<n;i++){ cin>>a[i]; }
#define ub upper_bound... | 0 | 64,139,608 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<29);
vector<int> G[MAX];
list<int> out;
bool V[MAX];
int N;
int indeg[MAX];
void dfs(int u) {
V[u] = true;
for (int i = 0; i < G[u].size(); i++)... | #include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int n=s.length(),zero=0,one=0;
for(int i=0;i<n;i++){
if(s[i]=='0'){
zero++;
}
else one++;
}
cout<<n-abs(zero-one);
return 0;
} | 0 | 83,877,265 |
#include<iostream>
using namespace std;
int a[5];
int main()
{
long long n,m,b; cin >> n;
b = n / 15;
m = n * 800;
cout << (m - (b * 200));
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
int main(){
ll N, K; cin >> N >> K;
vector<ll> A(N+1); for(int i = 1; i < N+1; i++) cin >> A[i];
for(int i = 0; i < N; i++) A[i+1] = A[i]+A[i+1];
vector<bitset<41>> B;
for(int i = 0; i < N; i++){
... | 0 | 16,663,120 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, D; cin >> N >> D;
vector<vector<int>> x(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> x.at(i).at(j);
}
}
map<int, bool> key;
for (int i = 1; i < 127; i++) {
... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll INF = 1LL << 50;
int main(){
int N, K;
cin >> N >> K;
ll a[N... | 0 | 98,083,411 |
#include <bits/stdc++.h>
#define FOR(i, n) for(ll i = 0; i < n; i++)
#define FORR(i, n) for(ll i = n; i >= 0; i--)
#define FORS(i, m, n) for(int i = m;i < n;i++)
#define ALL(v) accumulate(v.begin(),v.end(),0)
#define SORT(v) sort(v.begin(),v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#define IN... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define dbv(v) ... | 0 | 29,815,173 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cassert>
#include<vector>
#include<queue>
#include<set>
using namespace std;
const int INF = 100000;
const int MAX_N = 50000;
const int MAX_M = 20;
int C[MAX_N + 1];
int T[MAX_M + 1][MAX_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
c=0;
cin>>a>>b;
for(int64_t i=0;i<=a;i++){if(b==2*i+4*(a-i)){cout<<"Yes"<<endl;
c=1;
break;}}
if(c==0){cout<<"No"<<endl;}
} | 0 | 32,521,462 |
using namespace std;
#include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll long long int
#define pb push_back
#define mp make_pair
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
ll n,K;
cin >> n >> K;
vec x(n),y(n);
for(ll i=0;i<n;i++) {
cin >> x[i] >> y[i];
}
ll ans=inf;
for(ll i=0;i<n... | 0 | 38,010,751 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<tuple>
#include<bitset>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
vector<ll>G[200005];
ll ans[200005];
int main() {
ll n, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
#define MAX 20
signed main() {
int n;
cin >> n;
int x[n ... | 0 | 74,981,838 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A,B;
int ans = 0;
cin >>N>>A>>B;
for (int i=0;N >= 1000*i && i<10;i++){
for (int j=0;N >= 1000*i+100*j && j<10;j++){
for (int k=0;N >= 1000*i+100*j+10*k && k<10;k++){
for (int l=0;N >= 1000*i+100*j+10*k+l && l<10;l++){
... | 0 | 27,024,381 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll T[100010], A[100010];
int main()
{
int N; cin >> N;
l... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using namespace std;
int main() {
... | 0 | 39,521,991 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define int ll
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for ... | #include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
#define pvec(vec) {for (auto v: vec) cout << v << ' '; cout << endl;}
#define pivec(vec) {rep(i, 0, vec.size()) cout << i << ':' << vec[i] << ' '; cout << endl;}
using namespace std;
using ll ... | 0 | 85,123,062 |
#include <algorithm>
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <cctype>
using namespace std;
int main(void) {
char cards[201];
int N;
while (true) {
cin >> cards;
if (cards[0] == '-') { break; }
cin >> N;
int total = 0;
for (i... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,num;
long long tmpMax;
long long tmpA,tmpB;
long long kekka;
cin >> a >> b >> c >> num;
if(a == b && b == c){
cout << 0;
}else if(num == 1){
tmpA = b + c;
tmpB = a + c;
kekka = tmpA - tmpB;
if(kekka > 100000000000... | 0 | 69,071,407 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
int main() {
int N, M;
... | #include <algorithm>
#include <iostream>
#include <cmath>
#include <set>
#include <vector>
template <typename Container, class T>
bool contains(const Container& c, T v)
{
return std::find(c.begin(), c.end(), v) != c.end();
}
int main()
{
int M, K;
std::cin >> M >> K;
if(std::pow(2, M) <= K) {
std::cout << -... | 0 | 21,510,654 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int n;
long long m;
cin>>n>>m;
vector<long long> a(n);
for(int i=0;i<n;i++) cin>>a[i];
long long ans=0;
map<long long,int> mp;
mp[0]=1;
long long tmp=0;
for(int i=0;i<n;i++){
tmp+=a[i];
... | 0 | 90,042,453 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, L;
cin >> n >> L;
vector <int> a(n);
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
bool good... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 | 34,332,864 |
#include <bits/stdc++.h>
using namespace std;
#define lint long long
typedef pair<lint, lint> P;
int main() {
int W, H;
cin >> W >> H;
vector<lint> p(W);
vector<lint> q(H);
priority_queue<P,vector<P>, greater<P>> que;
for(int i = 0; i < W ; ++i){
cin >> p[i];
que.push(make_pair(p... | #pragma region header
#include <bits/stdc++.h>
#define int long long
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++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 14,739,918 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
#define acc... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#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 per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 721,095 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mk make_pair
#define v_sort(x) sort(x.begin(),x.end())
#define v_gsort(x) sort(x.begin(),x.end(),greater<int>())
#define PI 3.14159265
#define MOD 998244353
using namespace std;
void Solve(){
int n,m,k;
cin>>n... | #include <iostream>
#include<string>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
int next(int x) {
for (int i = 2; i*i <= x; i++) {
if (x % i == 0) {
return x / i;
}
}
return 1;
}
int gcd(int a, int b) {
if (b == 0)return a;
return gcd(b, a % b);
}... | 0 | 48,387,431 |
#include <iostream>
using namespace std;
int dp1[5009][5009], dp2[5009][5009], n, k, a[5009], p1[5009], p2[5009];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
dp1[0][0] = 1;
for (int i = 0; i <= n - 1; i++) {
for (int j = 0; j <= k; j++) {
if (dp1[i][j] == 0) continue;
dp1[i + 1][j]... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll t,n,f,i,tog;
cin>>n;
string s,a,b;
cin>>s;
if(n%2==1)
cout<<"No";
else
{
a=s.substr(0,n/2);
b=s.substr(n/2,n/2);
if(a==b)
cout<<"Yes";
else
cout... | 0 | 36,788,486 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using namespace std;
using ll = long long;
using d = double;
int main(){
int n;
cin >>n;
set<int> a;
rep(i,n){
int z;
cin >> z;
a.insert(z);
}
if(n==(int)a.size()) cout << "YES" << endl;
else cout<< "NO" << end... | #include <iostream>
#include <string>
#define rep(i, n) for(int i = 0; i < (int)n ; i++)
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int count = 0;
for(int i=A; i <= B ; i++){
int number = i;
int number_1 = number % 10;
number /= 10;
int number_10 = number %... | 0 | 81,933,965 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
t... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | 0 | 82,460,134 |
#include <iostream>
#include <algorithm>
using namespace std;
using ll = long long;
ll n, k;
ll a[5005];
ll dp[5005][5005];
ll ans = 0;
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
ll valid = 0, invalid = n + 1;
while (invalid - valid >... | #include <iostream>
#include <vector>
using namespace std;
struct Tree {
int node;
int parent;
int leftChild;
int rightBrother;
int depth;
string kind;
vector<int> children;
};
#define tree struct Tree
int n;
tree t[100000];
void calculateDepth();
void decideKind();
void calculate(int id);
v... | 0 | 53,836,049 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
class Stream{
public:
Stre... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("-ffloat-store")
#define int long long
#define rep(i,begin,end) for(__typeof(end)i=(begin)-((begin)>(end));i!=(end)-((begin)>(end));i+=1-2*((begin)>(end)))
#defi... | 0 | 2,534,197 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl;
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
int c = 0;
... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
const int maxn=1e5+10;
const int mod=1e9+7;
ll x[maxn],y[maxn];
ll n,m;
int main()
{
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",&x[i]);
for(int i=1;i<=m;i++)
s... | 0 | 92,492,736 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
vector<int> a;
int sum=0;
a.push_ba... | #include <bits/stdc++.h>
using namespace std;
long countLunlun(int l, int h, map<pair<int, int>, long> cache) {
pair<int, int> key = make_pair(l, h);
if (cache.count(key))
return cache[key];
long sum = 0;
if (l == 1) {
sum = 1;
} else {
if (h > 0)
sum += countLunlun(l - 1, h - 1, cache);
... | 0 | 90,200,332 |
#include<bits/stdc++.h>
using namespace std;
bool check(string s){
if(s.size() < 4){
return false;
}
return s.substr(0, 4) == "YAKI";
}
int main(){
string s;
cin >> s;
if(check(s)){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | 0 | 66,989,192 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
int max,count;
max=0;
count=0;
for(int i=0; i<s.length();i++){
if(s[i]=='R'){
count++;
if(max<count){
max=count;
}
}
else
count=0;
}
cout<<max;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
vector<string> BubbleSort(vector<string> vs, int n)
{
int i, j, flag;
for(i=1; i<n; i++)
{
flag = 0;
for(j=0; j<n-i; j++)
{
if(vs[j][1] > vs[j+1][1])
{
swap(vs[j], vs[j+1]);
flag =... | 0 | 14,112,096 |
#include <iostream>
using namespace std;
#define MAX 100000
int Parent(int i) {
return i / 2;
}
int Left(int i) {
return 2 * i;
}
int Right(int i) {
return 2*i + 1;
}
int main() {
int h, A[MAX+1];
cin >> h;
for ( int i = 1; i <= h; i++ ) cin >> A[i];
for ( int i = 1; i <= h; i++ ) {
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | 0 | 63,967,461 |
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
int n,m;
int x[100001],y[100001];
const ll MOD=(ll)1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;
#ifdef LOCAL_DEFINE
freopen("in", "r", stdin);
freopen("out... | #include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <cmath>
#include <climits>
#include <cstdint>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1>::type>; };
te... | 0 | 73,018,128 |
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | #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... | 0 | 45,792,780 |
#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 all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF =... | #pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie... | 0 | 99,698,219 |
#include <iostream>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main()
{
int h,w;
while(cin >> h >> w)
{
if(h == 0 && w == 0) break;
rep(i,h)
{
rep(j,w)
{
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define bug(x) cerr<<#x<<" "<<x<<endl;
#define T int time; scanf("%d", &time); while(time--)
vector<ll>ar;
bool check(ll i,ll n){
if(abs(i-n)<=1)return true;
for(ll ii=n-1; ii>i; i... | 0 | 93,433,307 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | #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 | 50,316,382 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 50,698,113 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int a,b;
bool B = true;
bool B2 = true;
int cnt = 0;
vector<int> x(n); vector<int> y(n);
for(int i=0;i<n;i++)cin >> x[i];
for(int i=0;i<n;i++)cin >> y[i];
vector<int> v(n);
for(int i=0;i<n;i++)v[i] = i+1;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll n,m;
cin>>n>>m;
vector<vector<int> > g(n+1);
for(ll i=0;i<m;i++){
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
vector<ll> d(n+1,LONG_MAX);
d[1]=0;
vector<ll> p(n+1,0);
queue<ll> q;
q.push(1);
while(!q.... | 0 | 44,647,749 |
#include <bits/stdc++.h>
using namespace std;
signed main()
{
int n;
int score[2] = {0};
string str[2];
cin >> n;
while (n > 0){
cin >> str[0] >> str[1];
if (str[0] > str[1]){
score[0] += 3;
}
else if (str[0] < str[1]){
score[1] += 3;
}
else {
score[0]++;
score[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for(l... | 0 | 2,209,742 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.