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,d=0,mi=0,i;
string s;
cin>>n>>s;
for(i=0;i<n;i++){
if(s.at(i)=='(') d++;
else if(s.at(i)==')'){
d--;
mi=min(mi,d);
}
}
if(mi<0){
for(i=0;i<-mi;i++) s='('+s;
d-=mi;
}
if(d>0) for(i=0;i<d;i++) s+=')';
cout<<s<... | #include<bits/stdc++.h>
#define endl "\n"
#define ll long long
#define PI acos(-1.0)
#define test cout<<"\n****\n"
#define precise fixed(cout);cout<<setprecision(12)
#define fast ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
int main(){
string str;
cin>>str;
if(st... | 0 | 85,974,349 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int year, month, day;
cin >> year >> month >> day;
int ans = 0;
if (year % 3 == 0 || month % 2 == 1) {
ans += 20 - day;
} else {
ans += 19... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | 0 | 81,119,107 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll dp[2003][2003];
int main()
{
int n, m;
cin >> n >> m;
int s[2003], t[2003];
for(int i = 0; i < n; i++) cin >> s[i];
for(int i = 0; i < m; i++) cin >> t[i];
dp[0][0] = 1;
for(int i = 0; i <= n; i++){
... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main () {
int k, s ;
int ans = 0 ;
c... | 0 | 82,544,710 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template... | 0 | 72,226,858 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
if(a%2==0 || b%2==0){
cout<<"Even"<<"\n";
}
else{
cout<<"Odd"<<"\n";
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int p[101010],q[101010];
int main()
{
int h,w,st1=1,st2=1;
long long ans=0;
scanf("%d%d",&h,&w);
for(int i=1;i<=h;i++)
{
scanf("%d",&p[i]);
ans+=p[i];
}
for(int i=1;i<=w;i++)
{
scanf("%d",&q[i]... | 0 | 22,313,519 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#define gcd(a,b) __gcd(a,b)
#define all(x) x.begin(),x.... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<long> a(n);
for(auto &e: a) cin >> e;
if(n==1) {
cout << "YES" << endl;
return 0;
}
long sum = 0;
for(auto &e: a) sum += e;
long cnt = sum / (n * (n+1) /2);
if(cnt * (n*(n+1)/2)... | 0 | 91,580,967 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll MOD = 998244353;
ll ans = 1;
ll M = 0;
map<int,int> dist;
bool b = false;
for (ll i = 0; i < N; i++) {
ll e;
cin >> e;
M = max(M,e);
if (i == 0 && e != 0) b = !b;
dist[e] += 1;
}
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define tr(a, x) for (auto &a : x)
#define all(c) c.begin(), c.end()
#define lld long long
#define pb push_back
#define mp make_pair
#define ... | 0 | 91,673,915 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
signed main(){
ll ans=0;
ll w,h;
vector<ll> p,q;
p.push_back(0);
q.push_back(0);
cin>>w>>h;
for(int i=0;i<w;i++){
ll x;
cin>>x;
p.push_back(x);
ans+=x;
}
for(int i=0;i<h;i++){
ll y;
cin>>y;
q.... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,string>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=99999999999999999;
int main(){
ll ans=-INF;
ll N;
cin >> N;
ll M;
cin >> M;
vector<ll> A(N+1,0);
vector<ll> ... | 0 | 82,590,616 |
#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,z,w;
cin>>n>>z>>w;
int a[n];
rep(i,0,n) cin>>a[i];
if(n>1) cout<<max(abs(a[n-1]-w),abs(a[n-1]-a[n-2]));
else cout<<abs(a[0]-w)<<endl;
} | #include <cstdio>
int main(){
char str[1500];
for (int i = 0; i < 1500; i++){
str[i] = '\0';
}
fgets(str, sizeof(str), stdin);
for (int i = 0; str[i] != '\0'; i++){
if (str[i] >= 'A' && str[i] <= 'Z'){
str[i] += 'a' - 'A';
}
else if (str[i] >= 'a' && str[i... | 0 | 21,493,072 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#pragma comment(linker, "/STACK:16777216")
ll mxm() {return LLONG_MIN;}
template<typename... Args>
ll mxm(ll a, Args... args) { return max(a,mxm(args...)); }
ll mnm() {return LLONG_MAX;}... | #include <iostream>
using namespace std;
int a, b, c, i, j, s, n, mi, d[10][10], cost[10];
void dic(int ans[]) {
for(s = 0; s < 10; s++) {
for(i = 0; i < 10;i++) cost[i] = 100000000;
int sum = 0, f[10] = {};
cost[s] = 0;
mi = s;
for(i = 0; i < 10; i++) {
f[mi] = 1;
for(j = 0; j < 10; ... | 0 | 39,959,966 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 | 60,943,708 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define fir first
#define sec second
#define mod 998244353
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(is... | #include <bits/stdc++.h>
#define INF 1e9 + 5
using namespace std;
const int maxn = 15;
const int maxm = 50;
int mp[maxn][maxn];
int a[maxm],b[maxm],c[maxm];
int n,m;
void init()
{
for(int i = 0;i <= n;i++)
for(int j = 0;j <= n;j++)
if(i == j) mp[i][j] = 0;
else mp[i][j] = INF;
}
void floyd()
{
for(int k = 0;... | 0 | 20,671,104 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | #include <cstdio>
using ll = long long;
const ll mod = 1e9+7;
ll N, M;
ll x[100001], y[100001], yy;
ll ans = 0;
int main () {
scanf("%lld %lld", &N, &M);
for(int n = 0; n < N; n++)
scanf("%lld", x + n);
for(int m = 0; m < M; m++)
scanf("%lld", y + m);
N--, M--;
for(int m = 0; m < M; ... | 0 | 71,818,850 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include<bits/stdc++.h>
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli n;
cin>>n;
int a[n],i;
for(i=0;i<n;i++)
cin>>a[i];
int l=a[0]; int r=a[0];
for(i=0;i<n;i++)
{
l=min(l,a[i]);
... | 0 | 65,765,394 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, b) for (int i = 0; i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=acos(-1);
bool comp(P p1, P p2){
if (p1.first != p2.first) {
return p1.first < p2.first;... | 0 | 70,373,796 |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | 0 | 56,516,070 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
#include<map>
using namespace std;
using namespace std;
class UF {
public:
vector<int> rank;
vector<int> p;
UF() {}
UF(int size)... | 0 | 9,937,790 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(a,b,c) for(int i=a;i<b;i+=c)
typedef pair<ll , pair<ll, ll> > pi;
int pow(int x,int y){
int res=1;
while(y){
if(y&1) res*=x;
... | 0 | 31,601,577 |
#include <iostream>
#include <ios>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int n = 0;
int m = 0;
cin >> n >> m;
vector<int> dp(n + 1, n + 1);
dp[0] = 0;
vector<int> ds(m, 0);
for (auto & di : ds) cin >> di;
for (auto di : ... | #include <bits/stdc++.h>
typedef long long ll;
const ll oo = 0x3f3f3f3f;
int const N = 1e6+5;
int const mod = 1e9+7;
using namespace std;
int fact[1000005];
bool f=false;
void gcd(int x){
if(f==true)
return;
for(int i=1;i*i<=x;i++){
if(x%i==0){
int a=i;
... | 0 | 10,427,321 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
long long n; cin>>n;
long long res=0;
if((n&1)==0){
long long five=5,i;
while(i=n/five/2) res+=i,five*=5;
}
cout<<res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | 0 | 79,124,212 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
vector<int> score;
vector<int> memo;
int value;
void... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 998244353;
signed main(){
cout << std::fixed << std::setprecision(15);
string a,b;
cin>>a>>b;
if(a.size()>b.size()){
cout<<"GREATER"<<endl;
return 0;
}
if(a.size()... | 0 | 7,555,467 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
double d, t, s;
cin >> d >> t >> s;
if(d/s <= t) cout << "Yes\n";
else cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 | 15,611,887 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s, t, u;
int a, b;
cin >> s >> t;
cin >> a >> b;
cin >> u;
if (s == u) a--;
if (t == u) b--;
cout << a << ' ' << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef vector< long long > vi;
typedef long long ll;
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define endl "\n"
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define fr(n) for(ll i=0;i<n;i++)
#define tr(a) for(auto it=a.begin();it!=a... | 0 | 10,596,997 |
#include <bits/stdc++.h>
using namespace std;
int K;
vector<int> n(100000,100000);
deque<int> deq;
int BFS(){
while(!deq.empty()){
int f=deq.front();
deq.pop_front();
if(f==0)return n[0];
if(n[f]<n[(f*10)%K]){
n[(f*10)%K]=n[f];
deq.push_front((f*10)%K);
}
if(n[f]+1<n[(f+1)%K]){
n[(f+1)%K]=n[f]+1;
... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | 0 | 48,768,551 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, m; cin >> n >> m;
V<int> b(n + 1);
for(int i = 0; i < m; i++){
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 68,972,370 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
static const int MAX_INT = std::numeric_limits<int>::max();
static const lo... | #include <stdio.h>
int main(void){
int i, score, sum, max, min;
double ave;
int n=1;
scanf("%d", &n);
while(n!=0){
ave=0; max=0; min=1000;
for(i=0;i<n;i++){
scanf("%d", &score);
ave = (ave*i + score)/(i+1);
if(score>max){
max=score;... | 0 | 60,092,057 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int s ;
cin >> s ;
map<int , int > M ;
M[s]++ ;
int cnt = 0 ;
while(M[s] != 2){
if( s%2 == 0 ) {
s = s/2 ;
}
else if( s%2 != 0 ) {
s = 3*s + 1 ;
}
M[s]++ ;
cnt++ ;
}
cnt++ ;
cout << cnt << endl ;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long a[n];
int i,j;
for(i=0;i<n;i++){
cin >> a[i];
}
long s[n];
s[0] = a[0];
for(i=1;i<n;i++){
s[i]=s[i-1]+a[i];
}
long bit[n];
bit[0]=a[0];
for(i=1;i<n;i++){
bit[i]=bit[i-1]^a[i];
}
int left,right;
lef... | 0 | 89,030,054 |
#include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
int i,j,k,sum,counter=0;
scanf("%d %d",&k,&sum);
for(i=0;i<=k;++... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
unordered_set<char> US;
string ans = "a";
for(int i = 0; i < S.size(); ++i) US.insert(S[i]);
for(int i = 0; i < 26; ++i){
if(US.find('a'+i) != US.end()){
if('a'+i == 'z') ans = "None";
el... | 0 | 51,897,185 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int n=s.size();
vector<int>a(n+1,0);
for(int i=0;i<n;i++){
if(s[i]=='<'){
a[i+1]=a[i]+1;
}
}
for(int i=n-1;i>=0;i--){
if(s[i]=='>'){
a[i]=max(a[i],a[i+1]+1);
}
}
long long sum=0;
for(int i=0;i<n+... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
reverse(S.begin(),S.end());
for(int i = 0 ; i < S.size() ; ){
if(S.substr(i,7) == "remaerd"){
i+=7;
}
else if(S.substr(i,6) == "resare"){
i+=6;
}
else if(S.su... | 0 | 55,289,682 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i... | #include <iostream>
#define INF 100001
using namespace std;
int main(){
int n;
cin >> n;
int dp[n+1][n+1],p[n+1];
cin >> p[0] >> p[1];
for(int i=2;i<=n;i++){
int t; cin >> t;
cin >> p[i];
}
for(int i=1;i<=n;i++) dp[i][i]=0;
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
int j=i+l-1;... | 0 | 56,358,200 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int h,w,n,i=0,j,l[1000]={2,1};
cin >> n;
if(n==1)
{
cout << "1" << endl;
return 0;
}
for(i=2;i<=n;i++)
{
l[i]=l[i-1]+l[i-2];
}
cout << l[n] << endl;
return 0;
} | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
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 vld = vector<l... | 0 | 31,082,570 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using pq = priority_queue<int... | #include <bits/stdc++.h>
using namespace std;
#define popcnt(a) __builtin_popcount(a)
#define FastIO() ios::sync_with_stdio(false), cin.tie(0);
#define IO() freopen("palindrome.in","rw",stdin)
#define error(args...) \
{ \
cerr<<"LINE "<<__LINE__; ... | 0 | 5,434,191 |
#include<iostream>
#include<string>
int main() {
std::string s;
std::cin >> s;
if (s == "RRR") std::cout << 3 << std::endl;
if (s == "RRS") std::cout << 2 << std::endl;
if (s == "RSR") std::cout << 1 << std::endl;
if (s == "SRR") std::cout << 2 << std::endl;
if (s == "RSS") std::cout << 1 << std::endl;
if (s ==... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 1001001001001001000;
int main() {
int n; cin >> n;
ll a[n]; rep(i,n) cin >> a[i];
... | 0 | 53,793,439 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abc... | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <cctype>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define maxn 5005
#define mo... | 0 | 32,955,719 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>
#include <string>
#include <sstream>
#include <iomanip>
#define int long long
#define double long double
#define Rap(n,i) for(int (i)=0;(i)<(n);(i)++)
#define Pr(n) cout<<n<<endl;
#define PairV vector<pair<in... | #include<iostream>
using namespace std;
void print(int A[], int n) {
int i, x;
for (i = 0; i < n; i++) {
x = i + 1;
cout << "node " << x << ": ";
cout << "key = " << A[i] << ", ";
if (i != 0) {
cout << "parent key = " << A[x / 2 - 1] << ", ";
}
if (x * 2 <= n) {
cout << "left key... | 0 | 48,725,467 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class Dice {
public:
int label1;
int label2;
int label3;
int label4;
int label5;
int label6;
Dice() {
label1 = 0;
label2 = 0;
label3 = 0;
label4 = 0;
label5 = 0;
label... | #include <stdio.h>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, a[6000];
int main() {
for (;;) {
scanf("%d", &n);
if (n == 0) return 0;
rep (i, n) scanf("%d", a+i);
int m = 0, s = 0, ans = a[0];
rep (i, n) {
... | 0 | 69,478,087 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main(){
while(1){
int n;
cin >> n;
if(n == 0) break;
for(int i=0; i<n; i++){
int tmp;
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
int ans = 99999999;
for(int i=0; i<n-1; i++){
ans = min(ans, abs(v[i] - v[i+1]));
}
cout << ... | #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 LCS[1010][1010] = {};
int LCSLength(string strX,string str... | 0 | 26,811,982 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
vector<ll> city(n+1);
vector<ll> hero(n);
ll num = 0;
rep(i, n+1){
cin >> city.at(i);
num += city.at(i);
}
rep(i, n) cin >> hero.at(i);
ll ans = 0;
rep(i, n){
... | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
const int N = 1 << 18 | 1;
const int inf = int(1e9);
pii f[N];
int n, k, a[N], g[N];
void maximize(p... | 0 | 58,336,656 |
#include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<... | 0 | 74,729,409 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
if (a.at(0) == b.at(2) && ... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <functional>
#include <map>
#include <queue>
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
int main(int argc, const char * argv[]) {
... | 0 | 23,204,642 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
int N;
cin >> N;
vector<int> C(N-1), S(N-1), F(N-1);
for(int i=0; i<N-1; i++) cin >> C[i] >> S[i] >> F[i];
for(int i=0; i<N; i++) {
ll t = 0;
for(int ... | 0 | 28,879,725 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,d,x,t=0;
cin>>n>>d>>x;
vector<int> v(n,0);
for (int i = 0; i < n; ++i)
{
cin>>v[i];
}
for (int i = 0; i < n; ++i)
{
t = t + (1+ (d-1)/v[i]);
}
cout<<t+x<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <math.h>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ull unsigned long long
#define ... | 0 | 608,270 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a[200010];
cin >> a;
int n=strlen(a);
int sum=0;
for(int i=0;i<n;++i){
sum+=a[i]-'0';
}
if(sum%9==0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#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++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int I... | 0 | 19,226,775 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) ... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
vector<int> to[100005];
int64_t dp[100005][2];
int64_t dfs(int v, int from, bool black)
{
if (dp[v][black] != -1)
{
return dp[v][black];
}
if (to[v].size() == 1 && from != -1)
{
return dp[v][black] = 1;
}
int64_t ret = ... | 0 | 36,975,170 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> B(N);
vector<Pair> C(N);
for (int64_t i = 0; i < N; ++i) {
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> par;
vector<int> rankk;
void init(int n) {
par.resize(n);
rankk.resize(n);
for (int i = 0; i < n; i++) {
par[i] = i;
rankk[i] = 0;
}
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(... | 0 | 81,119,249 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define all(x) (x).begin(), (x).end()
const int MOD = 998244353;
int mpow(int a,int b,int p=MOD){a=a%p;int res=1;while(b>0){if(b&1)res=(res*a)%p;a... | #include <iostream>
#include <queue>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
struct Cell {
int x;
int y;
int cost;
};
bool operator<(const Cell &lhs, const Cell &rhs) { return lhs.cost < rhs.cost; }
bool operator>(const Cell &lhs, const Cell &rhs) { return lhs.cost >... | 0 | 86,601,479 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N, Y;
cin >> N >> Y;
bool f = false;
for (int i = 0; i <= Y / 10000; i++) {
for (int j = 0; j <= Y / 5000; j++) {
if (i + j > N) break;
int k = N - i - j... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int W, H, N;
cin >> W >> H >> N;
int x1 = 0, x2 = W + 1, y1 = 0, y2= H + 1;
int x , y , a;
for (int i = 1; i <= N; i++) {
cin >> x >> y >> a;
if(a == 1) {
x1 = max(x1, x);
}
else if (a == 2) {
x2 = min(x2, x);
}
... | 0 | 93,209,045 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int A[100005];
int B[100005];
long long prefixSum[100005];
long long sum(int a, int b){
return prefixSum[b]-prefixSum[a-1];
}
int main(){
int N, M, V, P;
scanf("%d%d%d%d", &N, &M, &V, &P);
for(int i = 1; i <= N; i ++){
scan... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#inclu... | 0 | 35,222,938 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<cstdio>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(... | 0 | 81,855,454 |
#include <iostream>
using namespace std;
int main()
{
int n[50],i = 0, inp = 0, out[50]={0}, a = 0, b = 0, c = 0, d = 0;
while( cin >> inp){
if(inp >= 1 && inp <= 50){
n[i] = inp;
i++;
}
}
for(int j = 0;j < i;j++){
for(a = 0;a <= 9;a++){
if(n[j] == (a + b +c +d) && (b <= 9 || c <= 9 || d <= 9)){
... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) ar... | 0 | 24,495,086 |
#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
typedef long long ll;
const int MAXN=2e5+7;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
ll fac[MAXN];
ll quick(ll x,ll n)
{
ll res=1;
while(n)
{
if(n&1... | #include <iostream>
#include <cstdio>
using namespace std;
int n, k;
int main() {
int i;
cin >> n >> k;
if(k >= 1<<n) return puts("-1")*0;
if(n==1) {
if(k==0) return puts("0 0 1 1")*0;
else return puts("-1")*0;
}
printf("%d ", k);
for(i=0; i<1<<n; i++) if(i!=k) printf("%d ", i);
printf("%d ", k);
for(i=(1<... | 0 | 38,216,591 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define INF 1073741824
#define ll long long
#define PI (2*acos(0.0))
using namespace std;
char gap = 32;
template<typename T>
ostream& operator<<(ostream &os, const vector<T> &v) {
os << '{';
for (const auto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll lcm(ll a,ll b){
ll big,small;
if(a > b){
big = a;
small = b;
}else{
big = b;
small = a;
}
ll tmp_small;
while(true){
tmp_small = small;
small = big % small;
if(small == 0) ... | 0 | 38,038,699 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int H,W,K,i,j,k,l;
cin>>H>>W>>K;
vector<string> C(H);
for (i=0;i<H;i++) cin>>C[i];
int black_num,ans=0;
for (i=0;i<(1<<H);i++) {
for (j=0;j<(1<<W);j++) {
black_num=0;
for (k=0;k<H && black_num<=K;k++) {
for (l=0;l<... | #include <iostream>
#include <string>
#include <vector>
int main(){
std::string s;
std::cin >> s;
std::vector<char> st;
for (int i=0; i<s.size(); i++){
if (s.at(i) != 'B'){
st.push_back(s.at(i));
} else{
if (!st.empty()){
st.pop_back();
}
}
}
fo... | 0 | 20,620,092 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
int sum=0;
int prev=0;
for(int i=0;i<n;i++)
{
if(prev<v[i]){
sum+=v[i]-prev;
}
prev=v[i];
}
... | 0 | 8,874,505 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#define N 1000005
using namespace std;
using ll = long long;
int p[N];
void sieve(int n) {
p[1] = 1;
p[0] = 1;
for (ll i = 2; i <= n; ++i) {
if (p[i] == 0) {
p[i] = i;
for (ll j = i * i; j <= n; j += i) {
p[j] = ... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | 0 | 43,192,763 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string str;
while(1){
getline(cin, str);
bool flg = true;
if(str == ".") break;
stack<char> q;
for(int p=0; p < str.length(); p++){
if(str[p] == '('){
q.push('(');
}
if(str[p] == '['){
q.push('[');
}
if(str[p] == ')'){
... | #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 < typename T > using oset = tree < T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update >;
typedef long long ll;
typedef long double ld;
#de... | 0 | 98,207,554 |
#include <iostream>
using namespace std;
int main(){
int N,A,B,C,X,Y[100],yi,fc;
while(1){
cin >> N >> A >> B >> C >> X;
if (N==0&&A==0&&B==0&&C==0&&X==0)break;
for (int i=0;i<N;i++){
cin >> Y[i];
}
fc=0;
yi=0;
while (1){
if (fc>10000){
cout << -1 << endl;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n;
cin >> n;
vector<long> a(n);
for (long i = 0; i < n; i++)
{
cin >> a[i];
}
vector<long> b(n);
for (long i = 0; i < n; i++)
{
b[i] = a[i];
}
sort(b.begin(), b.end(), greater<long>());
long ... | 0 | 42,822,030 |
#include<stdio.h>
int main(){
int i,j,k,n,x,count;
while(1){
count=0;
scanf("%d %d",&n,&x);
if( n==0 && x==0) break;
for(i=1;i<=n-2;i++){
for(j=i+1;j<=n-1;j++){
for(k=j+1;k<=n;k++){
if( (i+j+k) == x) count++;
}
}
}
printf("%d\n",count);
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
struct Graph
{
int n;
vector<vector<int>> g;
Graph(int n) : n(n){
g.resize(n);
}
void init(int n_){
n = n_;
g.resize(n_);
}
void add_edge(int fro... | 0 | 88,785,558 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
long long n, r, l;
r = 0; l = 0;
n = S.size();
vector<long long> right(n+1), left(n+1);
left[0] = 0;
for(int i=0; i<n; i++){
if(S[i] == '<') l++;
else l=0;
left[i+1] = l;
}
right[n] = 0;
for(int i=n-1; i>=0; ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int h, n;
cin >> h >> n;
vector<int> v;
for(int i = 0; i < n; i++) {
int input;
cin >> input;
v.push_back(input);
}
int s = accumulate... | 0 | 54,120,858 |
#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 inf = 1000000000;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
const ll mod = 1e9+7;
int main(){
ll n;
cin >> n;
if(n%2 == 0){
ll t = 0;
ll f = 0;
... | #include <stdio.h>
int main(void)
{
int number, x, y, z;
scanf("%d", &number);
for (int i = 0; i < number; i++) {
scanf("%d %d %d", &x, &y, &z);
if (x * x == y * y + z * z || y * y == x * x + z * z || z * z == x * x + y * y) {
printf("YES\n");
}else {
printf("NO\n");
}
}
return 0;
} | 0 | 22,904,990 |
#include<bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout<<n<<"\n"
#define rep(i,n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
typedef pair<string, int> Psi;
vector<int> X[200010];
bool dfs(int from, int pre, int cnt,int goal){
if(from == goal ... | #include <iostream>
using namespace std;
#define ll long long
#define forn(i, s, n) for (int i = s; i < n; i++)
#define whilen(val, n) while(n-- && cin >> val)
#define r_1(v) cin >> v
#define r_2(v1, v2) cin >> v1 >> v2
int main() {
int n, x, ns[101];
r_1(n);
int sum = 0;
forn(i, 0, n) {
r_1(x);... | 0 | 99,930,618 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
int main() {
int N,count=2;
cin>>N;
vector<char> S(N);
rep(i,N) cin>>S.at(i);
sort(S.begin(),S.end());
vector<int> num;
if(N==1) cout<<1;
else{
S.push_back(10);
for(int i=1;... | 0 | 10,402,697 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
const ll INF = 2e18;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
deque<int> b;
for(int i = 0; i < n; i++){
if(i % 2){
b.push_front(a[i]);
} else {
b.pu... | 0 | 54,971,436 |
#include <iostream>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
int n;
int ary[100];
while (cin >> n, n)
{
for (int i = 0; i < n; i++) cin >> ary[i];
int Max = *max_element(ary, ary + n);
int Min = *min_element(ary, ary + n);
int Sum = accumulate(ary, ary + n, 0);
cout << (Su... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n,m; cin>>n>>m;
int mn=1, mx=n;
rep(i,m){
int l,r; cin>>l>>r;
mn=max(mn,l);
mx=min(mx,r);
}
if(mx-mn<0) cout<<0<<endl;
else cout<<mx-mn+1<<endl;
} | 0 | 93,756,127 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<map>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long ;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;... | 0 | 42,044,496 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | 0 | 50,566,027 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
#define pi 3.141592653589
#define repeat(i,n) for(int i=0;i<n;i++)
int main()
{
int n;
int tp = 0, hp = 0;
string taro, hanako;
cin >> n;
repeat... | #include<iostream>
#include<string.h>
using namespace std;
int D[6];
void spin(char c)
{
if(c=='E'){
swap(D[0],D[3]);swap(D[3],D[5]);swap(D[5],D[2]);
}
else if(c=='W'){
swap(D[0],D[2]);swap(D[2],D[5]);swap(D[5],D[3]);
}
else if(c=='S'){
swap(D[0],D[1]);swap(D[0],D[4]);swap(D[4],D[5]);
}
else ... | 0 | 100,352,106 |
#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 INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define s... | 0 | 18,629,408 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <deque>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | #include<bits/stdc++.h>
#define ll long long
#define xll __int128
#define fo(i,n) for(int i=0;i<n;i++)
#define rfo(i,n) for(int i=n-1;i>=0;i--)
#define Fo(i,q,n) for(int i=q;i<n;i++)
#define rFo(i,q,n) for(int i=n-1;i>=q;i--)
#define fO(i,n,k) for(int i=0;i<n;i+=k)
#define FO(i,q,n,k) for(int i=q;i<n;i+=k)
#define zero... | 0 | 76,923,752 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
int H[N];
int hei = 0;
int ans = 0;
for(int i=0; i<N; i++){
int h;
cin>>h;
if(h >= hei){
ans++;
hei = h;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
i... | 0 | 529,427 |
#include <iostream>
using namespace std;
int main(){
int n,y,m,d,i,sum;
cin >> n;
for(i=0;i<n;i++){
sum = 0;
cin >> y >> m >> d;
if(y%3==0 || m%2!=0)sum+=20-d;
else sum+=19-d;
if(y%3==0)sum+=(10-m)*20;
else if(m%2==0)sum+=(10-m)/2*39;
else sum+=19+(10-m-1)/2*39;
if(y%3==0)sum+=(100... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num){
fact[0] = fact[1] = 1;
for(int i=2; i<=num; i++) fact[i] ... | 0 | 8,212,697 |
#include <iostream>
int main()
{
int A, B, C;
std::cin >> A >> B >> C;
bool can = (C <= A + B);
std::cout << (can ? "Yes" : "No") << std::endl;
return 0;
} | #include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXN 100000
long x, y;
int input() {
if (scanf("%ld %ld", &x, &y) < 0) return 0;
return 1;
}
void init() {
}
long solve() {
return abs(x-y)>1;
}
void output(long ans) {
printf("%... | 0 | 9,152,335 |
#include<iostream>
#include<string>
using namespace std;
int main(void){
int m, n, h;
string s;
cin>>s;
while(s!="-"){
n=s.length();
cin>>m;
while(m--){
cin>>h;
s=s.substr(h, n-h)+s.substr(0, h);
}
cout<<s<<"\n";
cin>>s;
}
return(0);
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a,long long b) {
if (a < b) swap(a,b);
if ... | 0 | 14,708,262 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
int main() {
int n, m;
std::cin >> n >> m;
std::vector< std::pair<long long, long long> > drinks;
for (int i = 0; i < n; i++) {
long long a, b;
std::cin >> a >> b;
drinks.push_back(std::make_pair(a, b));
}
std::sort(drinks... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string s;
int br0=0,br1=0;
cin >> s;
for (int i=0;i<s.size();i++)
{
if(s[i]=='0')
br0++;
else
br1++;
}
cout << 2*min(br0,br1);
} | 0 | 12,406,712 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
string a,b;
cin >> a >> b;
int lena = a.size();
int lenb = b.size();
if(lena > lenb){
cout << "GREATER" << endl;
return 0;
}
else if(lena < lenb){
cout << ... | 0 | 77,644,925 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main() {
in... | 0 | 35,661,574 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define ff first
#define ss second
typedef pair<int,int> pii;
int32_t main()
{
int x , y ;
cin >> x >> y ;
if(y & 1)return cout <<"No" , 0 ;
y /= 2 ;
int a = 2 * x - y , b = y - x ;
if(a >= 0 && b >= 0)
cout << "Yes";
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a;
int b;
int c;
cin >> a >> b >> c;
for (int i = 1; i < 10001; i++){
if ((a*i)%b == c){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
} | 0 | 64,988,693 |
#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <sstream>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define repp(i,k,n) for... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | 0 | 49,433,147 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, z;
cin >> N;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
z += y - x + 1;
}
cout << z;
} | #include <algorithm>
#include <boost/optional.hpp>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | 0 | 97,235,932 |
#include <iostream>
#include <string>
using namespace std;
int main(){
while(true){
int n;
string str;
int l=0, r=0;
int before=0;
int cnt=0;
cin >> n;
if(!n) break;
for(int i=0;i<n;++i){
cin >> str;
if(str == "lu") l = 1;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s;
int X,Y; cin>>X>>Y;
vector<int> x(4001,0);
vector<int> y(4001,0);
int turn=0,cntx=0,cnty=0;
for(int i=0;i<s.size();i++){
if(turn%2==0){
if(s[i]=='F') x[cntx]++;
else{
turn++;
cntx++;
}
}... | 0 | 96,619,780 |
#include <iostream>
#include <cstdio>
using namespace std;
#define NIL -1
const int maxn = 100010;
struct Node{int p,l,r;};
Node T[maxn];
int n,D[maxn];
int depth(int u,int d){
D[u] = d;
if(T[u].l!=NIL) depth(T[u].l,d+1);
if(T[u].r!=NIL) depth(T[u].r,d);
}
int main() {
int id,k,m,c,i,left,start=0;
scanf("%d",&n... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;++i)
const int N = 1000;
int main() {
int q, lmax;
int c[N + 1][N + 1] = {0};
string X, Y;
cin >> q;
REP(i, q) {
cin >> X >> Y;
X = ' ' + X;
Y = ' ' + Y;
lmax = 0;
REP(i, X.length()) REP(j, Y.length()) {
i... | 0 | 49,362,899 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
int main(){
int N;
scanf("%d", &N);
std::vector<int > a(N), b(N);
long long asum=0, bsum=0;
f... | 0 | 10,328,824 |
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,e) (s+(e-s)/2)
#define clz(n) __builtin_clzll(n)
using namespace... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 69,724,286 |
#include <iostream>
#include <string>
using namespace std;
int parse(string str) {
int rtn = 0;
int tmp = 1;
for (int i=0; i<str.size(); i++) {
if (str[i] >= '2' && str[i] <= '9') {
tmp = (int) str[i] - (int) '0';
} else {
switch (str[i]) {
case 'm':
rtn += tmp * 1000;
break;
case 'c':
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | 0 | 92,325,212 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int calc(int A, int B, int C, int X){
return (A*X + B) % C;
}
int main(void){
vector<int> ans;
while(true){
int res = 0;
int N, A, B, C, X; cin >> N >> A >> ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <iostream>
#include <string.h>
#include <map>
#include <set>
#include <functional>
using namespace std;
const int INF = (1<<30) - 1;
int main(){
int n = 1000000;
vector<bool> is_prime(n, true);... | 0 | 84,533,924 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
using namespace std;
#defin... | #include <iostream>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
constexpr size_t MAXN = 1e5;
constexpr size_t MAXM = 1e5;
constexpr int MOD = 1e9 + 7;
void solve() {
int H, W;
std::cin >> H >> W;
std::vector<std::vector<int>> grid;
grid.reserve(H);
for (int y = 0; y < H; ++y) {
... | 0 | 1,165,259 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int table[26];
char buf[30];
int main(){
for(int i = 0; i < 26; i++){
table[i] = 0;
}
scanf("%s",... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).... | 0 | 19,544,700 |
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
int main()
{
int n,a[101],i,j,d[100001],k=0;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
int diff=abs(a[i]-a[j]);
d[k++]=diff;
}
}
sort(d,d+k);
cout<<... | #include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int h,i;
int ln;
char c[256];
string s;
for(;;){
fgets(c,256,stdin);
s=c;
ln=s.length();
if(ln==2)
... | 0 | 15,541,337 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+50;
const int oo = 22;
int n, d, q;
int a[N];
map<int,int > M;
int P[N][oo];
signed main(){
cin >> n;
for(int i=1;i<=n;i++) cin >> a[i];
cin >> d;
for(int i=1;i<=n;i++){
int v = a[i] + d;
int k = lower_bound(a+1,a+n+1,v) - a;
if(a[k]>v||k==n+1) k-... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <climits>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> arr(26);
for (int i = 0; i < s.size(); i++) {
int num = s[i] - 'a';
arr[num]++... | 0 | 27,694,847 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int start1;
int start2;
if(N%2==0){
start1 = 1;
start2 = N-1;
bool flag = 0;
for(int i=1;i<=M;i++){
if(flag==0 && start2-start1<=N/2){
start1++;
flag = 1;
}
cout << start1 << " " ... | 0 | 35,591,477 |
#include<iostream>
#define LL long long
LL K;
LL A[50];
int main(){
std::cin>>K;
std::cout<<50<<std::endl;
for(int i=0;i<50;i++){
A[i]=49+(K/50);
}
for(int i=0;i<K%50;i++){
A[i]+=50;
A[i]-=K%50-1;
}
for(int i=K%50;i<50;i++){
A[i]-=K%50;
}
for(int i=0;i... | #include <iostream>
using namespace std;
int h, w, ans;
char field[25][25];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
void dfs(int x, int y) {
if(field[y][x] == '.' && 0 <= x && x < w && 0 <= y && y < h) {
field[y][x] = '#';
ans++;
for(int i = 0; i < 4; i++) {
int nx = x+dx[i], ny = y+dy... | 0 | 55,404,786 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n - 1);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int t = 1; t < n; t++){
int sum1 = 0, sum2 = 0;
for(int j = 0; j < n; j++){
if(j + 1 <= t) sum1 += a[j];
else sum2 += a... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1100;
const int INF=10000000;
typedef pair<int,int> P;
char s[maxn][maxn];
int d[maxn][maxn];
int H,W,n;
P point[maxn];
int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int ... | 0 | 22,776,343 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int> b;
map<int,bool> f;
int m=0;
for(int _=0;_<n;_++){
int a;
cin>>a;
b[a]++;
f[a]=1;
m=max(a,m);
}
for(auto a:b){
if(a.second>1)
f[a.first]=0;
for(int i=2;a.first*i<=m;i++)
if(b.coun... | 0 | 2,212,204 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v(4,0);
int main(){
for(auto &p: v)cin >> p;
sort(v.begin(),v.end());
if(v[0] == 1 && v[1] == 4 && v[2] == 7 && v[3] == 9)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
using namespace std;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#de... | 0 | 97,346,376 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
typedef... | #include <iostream>
#include <string>
using namespace std;
int main () {
char ch;
int arr[1200] = {0};
while (cin >> ch) {
arr[tolower(ch) - 'a'] += 1;
}
string alphabet = "abcdefghijklmnopqrstuvwxyz";
for (int i=0; i<26; i++) {
cout
<< alphabet[i]
<< " : ... | 0 | 16,553,662 |
#include<iostream>
using namespace std;
int main() {
int n, m, x;
int a[20][20], c[20];
cin >> n >> m >> x;
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++) cin >> a[i][j];
}
int ans = 1<<30;
int all = 1<<n;
for (int mask = 0; mask < all; mask++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INFLL (1ll<<60)
static const int MAX=200000;
int N;
ll a[MAX],sum;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cin>>N;
cin>>a[0];
for(int i=1;i<N;i++){
cin>>a[i];
a[i]+=a[i-1];
}
ll min_d=INFLL;... | 0 | 89,957,910 |
#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... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int n,max,p,q;
max=0;
cin>>n;
vector<int> a(n);
vector<int> aa(n);
for(int i=0;i<n;i++)
{
cin>>a.at(i);
if(max<a.at(i))
{
max=a.at(i);
p=i;
}
}
for(int i=0;i<n;i++)
{
aa.at(i)=a.at(i);
}
sort(aa.begin(),aa... | 0 | 13,101,023 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0);
string s; cin >> s;
map<char,int> m {};
for (char c : s)
m[c]++;
if (m.size() != 2)
cout << "No";
else
cout << "Yes";
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
using namespace std;
void func()
{
int a1, a2, a3;
cin>> a1 >> a2 >> a3;
vector<uint16_t> costs(3);
costs[0] = abs(a1 - a2);
costs[1] = abs(a1 - a3);
costs[2] = abs(a2 - a3);
sort(costs.begin(), costs.e... | 0 | 5,752,757 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long A; long long B; long long C;
cin>>A>>B>>C;
long long N; cin>>N;
if(abs(A-B)>1000000000000000000)
cout<<"Unfair"<<endl;
else if(N%2==0)
cout<<A-B<<endl;
else cout<<B-A<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
vector<int> factor(int n){
vector<int> res;
for (int i = 2; i*i <= n; ++i) {
while(n % i == 0... | 0 | 28,373,053 |
#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() {
string s;
cin >> s;
string res;
for (auto ss : s) {
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
const double pi = 3.141592653589793238462643383279;
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<str... | 0 | 30,507,351 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.