code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int p[n-1];
for(int i=0;i<n-1;i++) p[i]=i+2;
int a[m],b[m];
for(int i=0;i<m;i++) cin>>a[i]>>b[i];
int ans=0;
do{
int count=0;
for(int j=0;j<m;j++){
if(1==a[j]&&p[0]==b[j]) count++;
... | #include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define pr1(a) (#a)<<"="<<(a)
#define pr2(a,b) pr1(a)<<", "<<pr1(b)
#define pr3(a,b,c) pr2(a,b)<<", "<<pr1(c)
#define pr4(a,b,c,d) pr3(a,b,c)<<", "<<pr1(d)
#define pr5(a,b,c,d... | 0 | 99,383,059 |
#include <iostream>
#include <cstdio>
#include <string>
#define MAX 1001
using namespace std;
string a,b;
int lcs_memo[1001][1001];
int lcs(int i,int j){
if(i==0 || j==0) return 0;
if(lcs_memo[i][j]!=-1) return lcs_memo[i][j];
if(a[i]==b[j]){
lcs_memo[i][j] = lcs(i-1,j-1)+1;
}else{
lcs_memo[i][j] = max(... | #include<stdio.h>
int main(void)
{
int i,a,cnt[101],max=-1;
for(i=1;i<=100;i++){
cnt[i]=0;
}
while(scanf("%d",&a)!=EOF){
cnt[a]++;
}
for(i=1;i<=100;i++){
if(max<cnt[i]){
max=cnt[i];
}
}
for(i=1;i<=100;i++){
if(cnt[i]==max){
printf("%d\n",i);
}
}
return 0;
} | 0 | 63,212,383 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << int( (a + b) / 2.0 + 0.5) << endl;
} | #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 | 35,422,858 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) sort(v.begin(), v.end())
typedef long long ll;
using Graph = vector<vector<int>>;
float prob(int i,int k){
int cnt = 0;
while (i < k)
{
i *= 2;
cnt++;
}
return cnt;
}
int main(){
double n, k;... | #include<iostream>
using namespace std;
int main() {
int n, y, m, d;
int totalDays = 999*(5*19+5*20) + 333*5;
cin>>n;
for(int i=0; i<n; i++) {
int ans = totalDays;
cin>>y>>m>>d;
for(int a=1; a<=y; a++) {
if(a != y) {
for(int b=1; b<=10; b++) {
if(a%3==0 || b%2==1) {
ans -= 20;
... | 0 | 14,634,854 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
const i... | #include <algorithm>
#include <climits>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <type_traits>
#inclu... | 0 | 92,072,843 |
#include <bits/stdc++.h>
using namespace std;
int facctorialMethod(int k){
int sum = 1;
for (int i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
void solve(){
int n,m,x,count=0,r[2];
scanf("%d",&n);
int a[2][n];
for (int i = 0; i < n; i++)
{
scanf("%d",&a[0][i]);
}
for (int... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(m) for(int i=0; i<m; i++)
#define frj(m) for(int j=0; j<m; j++)
#define frr(n) for(int i=n; i>=0; i--)
#define pb push_back
#define orr ||
#define nl \n
#define sci(n) scanf("%lld ", &n)
#define pri(n) printf("%d", n)
#define prl(n) printf("%l... | 0 | 64,628,665 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int H,W;
scanf("%d %d",&H,&W);
for (int k=0;k<10000;k++){
if (H==0 && W==0){
break;
}
else{
for (int i=0;i<=H-1;i++){
for (int j=0;j<=W-1;j++){
printf("#");
}
... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
int a, b;
int r;
int d;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (double)a / b;
printf("%d %d %f\n", d, r, f);
return 0;
} | 0 | 45,357,173 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
string s;
int main()
{
_FastIO;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(s[i] == '1')
cout << '9'... | #include <bits/stdc++.h>
using namespace std;
vector<int> finalpos;
long long initpos[100005];
long long finpos[100005];
bool clockwise[100005];
long long finalans[100005];
long long n,l,T;
int main(){
scanf("%lld%lld%lld",&n,&l,&T);
for (int x = 0; x<n; x++){
int t;
scanf("%lld%d",&initpos[x],&... | 0 | 10,704,865 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
constexpr int NINF = std::numeric_limits<int>::min();
using namespace std;
void solve() {
int N; c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
int rp = 0;
ll ans = 0;
ll sum = 0;
ll xsum = 0;
for ( int lp = 0; lp < n... | 0 | 51,969,570 |
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
struct edge { int to, cos... | #include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define j... | 0 | 46,895,728 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a<b&&b<c) printf("Yes\n");
else printf("No\n");
return 0;
} | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 31,357,839 |
#include <iostream>
#include<vector>
using namespace std;
int h[105];
int cnt=0;
int main()
{
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int left = 1;
while (left <= n) {
if (h[left] == 0) {
left++;
continue;
}
... | #include <set>
#include <vector>
#include <iostream>
using namespace std;
#define int long long
const int N = 3e5 + 10;
int c[N];
vector<int> r[N];
set<pair<int, int>> sc;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h, w, m;
cin >> h >> w >> m;
for (int i = 0; i < m; ++i) ... | 0 | 39,566,736 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j); i < (N);i++)
const int maxn = 100;
char G[maxn][maxn];
void print(){
printf("100 100\n");
_for(i,0,maxn){
_for(j,0,maxn){
printf("%c",G[i][j]);
}
printf("\n");
}
}
int main()
{
int A,B;... | 0 | 41,029,209 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <string>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <fstream>
using namespace std;
long long mod=1e9+7;
int main(){
int n;
string ... | #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;
ll f[3000000] = {0};
... | 0 | 51,003,744 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MOD=1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll ans=0;
rep(i,n-1) {
for(int j=i+1; j<n; j++) {
if(a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<ll>> a(n, vector<ll>(3));
for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1] >> a[i][2];
ll res = 0;
for (int i = 0; i <= (1 << 3); i++) {
... | 0 | 12,724,137 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x... | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 1,179,104 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, ex, area, r;
scanf("%d %d", &a, &b);
area = a*b;
ex = a+b-1;
r = area-ex;
printf("%d\n", r);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 49,982,832 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#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 valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | #include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,x,i,j;
cin>>n;
set<ll>st;
for( i=0; i<n; i++)
{
cin>>x;
st.insert(x);
}
if(st.size()==n)
cout<<"YES"<<endl;
... | 0 | 62,193,022 |
#include<bits/stdc++.h>
#include <cstdlib>
using namespace std;
int N,M,i,cnt;
int main(void){
cin >> N >> M;
int a[M];
for(i=0;i<M;i++){
cin >> a[i];
}
int b[N+1];
for(i=0;i<=N;i++){
b[i]=1;
}
for(i=0;i<M;i++){
b[a[i]]=0;
}
int dp[N+1];
for(i=0;i<=N;i++){
dp[i]=0;
}
dp[0]=1;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n);... | 0 | 70,618,179 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
vector<int> S(4);
for(int i=0;i<4;i++){
cin >> S[i];
}
sort(S.begin(),S.end());
if(S.size()==4 && S[0]==1 && S[1]==4 && S[2]==7 && S[3]==9){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 50,331,596 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define sc... | 0 | 24,294,757 |
#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 <stdio.h>
#include <string.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int memo[100000]; for(int i=0;i<m;i++) memo[i]=0;
int ac=0,wa=0;
for(int i=0;i<m;i++)
{
int p;
char s[3];
scanf("%d%s",&p,s);
if(memo[p]!=-1)
if(strcmp(s,"WA")==0)
{
... | 0 | 11,805,907 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#... | #include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
bool cmp(pair<long long int ,long long int > a , pair<long long int ,long long int > b){
return a.x > b.x || ((a.x == b.x )&&(a.y>b.y));
}
int main(){
long long int n,m,v,p;
cin >> n >> m >> v >> p;
long long int a[n];
for(long long ... | 0 | 83,657,155 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <iostream>
#include <vector>
#include <string>
#include <bits/stdc++.h>
#include <ctime>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define TT int test_cases; cin >> test_cases; while(test_cases--)
#define TT1 int test_cases=1; while(test_cases--)
#define pb push_back
#define mp make_pair
#de... | 0 | 51,088,778 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n, m, x, mn = 1e18, c[15], arr[15][15];
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m >> x;
for(int i = 0;i < n;++i)
{
cin >> c[i];
for(int j = 0;j < m;+... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define big 998244353
#define ff first
#define se second
#define pb push_back
#define pii pair<int,int>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define PSET(x,y) fixed<<setprecision(y)<<x
#define mp make... | 0 | 4,819,959 |
#include <cstring>
#include <algorithm>
#include <iostream>
struct Card {
char suit;
unsigned int rank;
};
static void print_cards(const Card cards[], const unsigned int n)
{
const char* sep = "";
for (unsigned int i = 0u; i < n; ++i) {
const Card* const cardp = &cards[i];
std::cout << sep << cardp->sui... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
int N;
cin>>N;
vector<string> S(N);
for (string &s: S)
cin>>s;
int ans = 0;
for (int A=0; A<N; A++)
{
bool ok = true;
for (int i=0; i<N; i++)
for (int j=0; j<N; j++)
... | 0 | 99,551,294 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#includ... | #include<iostream>
#include<complex>
using namespace std;
int main(){
for(;;){
complex<double> p[4];
for(int i=0;i<4;i++){
double x,y;
if(!(cin>>x>>y))return 0;
p[i]=complex<double>(x,y);
}
int s=0;
for(int i=0;i<3;i++){
complex<double> e=p[(i+1)%3]-p[i],c=p[3]-p[i];
... | 0 | 52,967,354 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
int c, d;
if (a%2 == 0) {
c = a/2 * 25;
d = c+12;
} else {
d = (a+1)/2 * 25;
c = d-12;
d--;
}
int e = b * 10;
int f = (b+1)*10;
bool found = false;
for (int i = c; i <= d; i++) {
if (i >= e && i < f) {
cout ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 78,005,015 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | #include <iostream>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
while((H!=0)||(W!=0)){
for(int i=0; i<W; i++) cout << "#";
cout << endl;
for(int i=0; i<H-2; i++){
cout << "#";
for(int j=0; j<W-2; j++){
cout << ".";
}
... | 0 | 7,008,844 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
long long n, m, a, b, ans = 0;
cin >> n >> m;
vector<pair<long long, long long>> e;
for(long long i = 0; i < n; ++... | 0 | 56,813,320 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 65,432,954 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 18;
int sum[MAXN+1][1<<MAXN];
int boro[MAXN+1][1<<MAXN];
int main() {
int n;
cin >> n;
for (int i = 0; i < (1<<n); i++) {
cin >> boro[0][i];
sum[0][i] = -1;
}
for (int p = 1; p <= n; p++) {
for (int msk = 0; msk < ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | 0 | 98,698,554 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 0 | 99,974,070 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge{
ll to, cost;
};
ll gcd(ll a,ll b){
if(b == 0){
return a;
}else{
r... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
int a, b;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
a = i;... | 0 | 59,967,882 |
#include<bits/stdc++.h>
using namespace std;
int T;
long long sum,a,b,Min=1e9,flag;
int main(){
scanf("%d",&T);
while(T--){
scanf("%lld%lld",&a,&b);
sum+=b;
if(b<a&&Min>b)Min=b;
if(b!=a)flag=1;
}
if(flag==1)printf("%lld",sum-Min);
else puts("0");
} | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define FOR(i,l,r) for( li i = l-(l>r); i != r-(l>r); i += 1-2*(l>r) )
int main() {
li m,k; cin>>m>>k;
li u = (1ll<<m)-1;
if( k > u || ( k == 1 && m <= 1 ) ) {
cout<<"-1\n";
return 0;
}
if( k == 0 ) {
FOR(... | 0 | 5,855,361 |
#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<bits/stdc++.h>
using namespace std;
int n,a,b;
bool test(int num)
{
int total=0;
while (num)
{
total = total +num%10;
num = num/10;
}
if(total >=a&&total<=b)
{
return true;
}
else
{
return false;
}
}
int main()
{
cin>>n>>a>>b;
int ... | 0 | 5,312,285 |
#include <iostream>
#include<bits/stdc++.h>
#include <cstring>
using namespace std;
int main()
{
int i, a = 0, b= 0 ;
string s;
cin >> s;
int l= s.size();
for(i = 0; i < l; i+=2)
{
if(s[i]!= '0') a++;
}
for(i = 1; i < l; i+=2)
{
if(s[i]!= '1') b++;
}
int ans = a+b;
if(ans <... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int maN = 1e6+5;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i< n; ++i)
{
cin >> a[i];
}
ll sum = 0;
for(int i = 1; i < n; ++i)
{
if(a[i] < a[i-1] )
{
... | 0 | 80,501,219 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
int main(){
int n,sum=0,tmp;
cin >> n;
vector<vector<int> > vec(n,vector<int>(3));
rep(i,n){
cin >> vec.at(i).at(0);
if(!i){
vec.at(i).at(1)=0;
sum+=abs(vec.at(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (long long i = 0; i < (n); i++)
#define repj(n) for (long long j = 0; j < (n); j++)
#define repk(n) for (long long k = 0; k < (n); k++)
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define it... | 0 | 5,252,933 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
long long N, K;
cin >> N >> K;
vector<pair<long long, long long>> ps(N, make_pair(0, 0));
vector<long long> X(N, 0), Y(N, 0);
for (long long i = 0; i < N; ++i) {
long long x, y;
cin >> x >> y;
ps[i].first = x;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | 0 | 6,210,791 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include<bits/stdc++.h>
#define PI 3.1415926535897932384626
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,a,b) for(i=a;i<b;i++)
#define ll long long
#define pb push_back
#define popb pop_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define ini(a) memset(a,-1,sizeof(a))
#d... | 0 | 60,017,821 |
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n, m;
LL x[N], y[N], z[N];
int main(... | #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()
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int h, w... | 0 | 65,733,316 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n,q ;
cin>>n>>q ;
unordered_map<int,int> mp ;
rep(i,q){
int x ;
cin>>x ;
rep(i,x){
int c ;
cin>>c ;
mp[c]++ ;
}
}
int count=0 ;
for(in... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int plus[n];
for (int i=0; i<n; i++) {
int pi;
cin >> pi;
plus[pi-1] = i;
}
for (int i=0; i<n; i++)
cout << n * i + plus[i] + 1 << (i < n-1 ? ' ' : '\n');
for (i... | 0 | 58,508,187 |
#include<bits/stdc++.h>
using namespace std;
long long N, M;
vector<long long> tree[100005];
struct UnionFind
{
vector<int> par;
vector<int> sizes;
UnionFind(int n) : par(n), sizes(n, 1) {
for(int i = 0; i < n; i++){
par[i] = i;
}
}
int find(int x) {
if (x == par[x]) return x;
return par[x] ... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define testcase int t;cin>>t;while(t--)
#define fast_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define pb push_back
#define P pair<int,int>
int dp[1000000];
int dfs(vector<vector<int>> g,int n)
{
if(g[n].size()==0) return 0;
if(dp[n... | 0 | 1,978,980 |
#include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void wr... | #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>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_eleme... | 0 | 37,189,985 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> lig(n+1);
repe(i,1,n)
{
cin >> lig[i];
}
int lighting... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f)... | 0 | 6,143,265 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(i%2 == 0) cout << s[i];
}
cout << endl;
} | #include<bits/stdc++.h>
typedef long long ll;
const ll mod=1e9+7;
const ll inf=0x3f3f3f3f;
const int N=1e5+5;
using namespace std;
ll l[N],r[N];
ll a[N];
int main()
{
int n;cin>>n;
for(int i=0;i<=n;i++) cin>>a[i];
if(n==0)
{
if(a[0]==1) cout<<1<<endl;
else cout<<-1<<endl;
return ... | 0 | 75,506,764 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int s;
cin >> s;
int a[1000005];
a[1] = s;
int i = 1;
while(1){
if (a[i]%2 == 0) a[i+1] = a[i]/2;
else a[i+1] = 3*a[i] + 1;
rep (j,i) {
if (a[i+1] == a[j]){
cout << i+1 <<... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve() {
int n; cin >> n;
map<int,set<int>> mp;
for (int i = 0; i < n; i++) {
int x; cin >> x;
mp[x].insert(i);
}
vector<ll> res(n, 0);
int sz = 0;
int i = n;
for (auto rit = mp.rbegin(); rit != mp.re... | 0 | 79,464,563 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x... | 0 | 84,794,270 |
#include<iostream>
#include<cstdio>
using namespace std;
char Cb( char a ){
return a - 32;
}
char Cs( char a ){
return a + 32;
}
int main(){
char a[1200];
fgets(a, 1200, stdin);
for(int i = 0; a[i] != '\0'; i++){
if( a[i] >= 'a' && a[i] <= 'z' )
cout << Cb(a[i]) ;
else if( a[i] >= 'A' && a[i] <= 'Z' )
c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ull = long long unsigned;
using P = pair<int,int>;
const int INF=1001001;
const int NMAX=8;
struct pcake{
ll a;
ll b;
ll c;
pcake(ll a1,ll b1,ll c1){
a=a1;b=b1;c=c1;
}
bool operator<(const pc... | 0 | 56,651,715 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
string s;
cin >> s;
if(s.front() != 'A'){
cout << "WA" << endl;
return 0;
}
bool ok1 = false;
bool ok2 = false;
for(int i=2;i<s.size()-1;i++){
if(s[i]=='C'){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
#define MAX_V 210
int d[MAX_V][MAX_V];
int N;
int main(){
int N,M,R;cin>>N>>M>>R;
vector<int> r(R);rep(i,R){cin>>r[i];r[i]--;}
rep(i,N)r... | 0 | 50,511,262 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1000000000000;
int main() {
int v,e,s,t,d;
cin >> v >> e;
long long int table[v][v];
for(int i=0;i<v;i++){
for(int j=0;j<v;j++){
table[i][j] = INF;
}
}
for(int i=0;i<v;i++){
table[i][i] =... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | 0 | 98,333,073 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
if (n <= 1)
return 1;
if (n <= 3)
return 2;
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int n;
cin>>n;
map<string,int> dict;
rep(i,n){
string s;
cin>>s;
dict[s]++;
}
int m;
cin>>m;
rep(i,m){
string t;
cin>>t;
... | 0 | 53,644,745 |
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <cstring>
using namespace std;
long long x[100000];
int next_hotel[30][100000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<long long,int> P;
int main(){
int n;
cin >> n;
vector<pair<int, int>> r(n), b(n);
rep(i, n... | 0 | 13,663,550 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDO... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
scanf("%d", &n);
vector<long> a(n+1);
rep(i, n+1) {
cin >> a[i];
}
vector<long> b(n);
rep(i, n) {
cin >> b[i];
}
long cnt = 0;
rep(i, n) {
if (a... | 0 | 96,335,048 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
long long white_num = 0;
long long count = 0;
for(int i = 0; i < (int)S.size(); i++){
if(S[i] == 'W'){
count += i - white_num;
white_num++;
}
}
... | #include <iostream>
using namespace std;
int main() {
while(true){
int n,m;
float p;
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0)break;
p = (100-p)*0.01;
int x[n+1];
int sum = 0;
for(int i = 1;i <= n;i++){
cin >> x[i];
sum += x[i];
}
int ans = 0;
ans = s... | 0 | 46,762,018 |
#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;
using ll=long long;
int t;
const int mod=1e9+7;
void add_self(int &a, int b){
a+=b;
if(a>=mod)a-=mod;
}
void test_case(){
int h,w;
cin>>h>>w;
vector<vector<char>>grid(h,vector<char>(w));
vector<vector<int>>dp(h,vector<int>(w));
for(int i=0; i<h; i... | 0 | 1,200,682 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
map<string,int> word_map;
map<string,int>::iterator it;
string s,freq_word,long_word;
int freq_count=0;
while (cin >> s) {
it = word_map.find(s);
if(it == word_map.end()){
word_map.inse... | 0 | 33,408,728 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 2147483647;
const ll LINF = 9223372036854775807;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int ma... | #include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a,b;
int cnt=0;
int m[16]={0};
while(scanf("%d%d",&a,&b),a,b){
int ro[32][32]={{0}};
ro[0][1]=1;
int n;
scanf("%d",&n);
int x,y;
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);... | 0 | 94,852,223 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono c... | #include <iostream>
#include <string>
using namespace std;
int main() {
string t; int l; cin >> l >> t;
int ans = 0;
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
for (int k = 0; k <= 9; k++) {
bool flag = false;
int l = 0;
... | 0 | 99,888,863 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int h,w;
cin >> h >> w;
string s;
vector<string> ans;
rep(i,h){
cin >> s;
rep(j,2) ans.push_back(s);
... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | 0 | 26,594,347 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = (long long) 1e9+7;
vector<ll> fac(2000001);
vector<ll> ifac(2000001);
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % M;
x = x*x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a,... | 0 | 85,714,163 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+1-b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
int main(){
int n;
cin >> n;
vector<int> a(n), p(n);
for(int i=0; i<n; ++i){
cin >> a[i];
}
int d = a[0], cnt=1... | 0 | 19,000,854 |
#include<bits/stdc++.h>
#define INF (1e9)
#define N 1005
using namespace std;
int main(){
int n,a[N];
while(1){
cin>>n;
if(!n)break;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int ans=INF;
for(int i=0;i<n-1;i++)
ans=min(ans,a[i+1]-a[i]);
cout<<ans<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define ceil(a, b) a / b + !!(a % b)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int main() {
int a... | 0 | 5,410,584 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 55, M = 110;
int n, m;
int x[N], y[N];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> x[i] >> y[i];
LL res = 1LL << 62;
for (int i = 0; i < n; i ++ )
for... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
using namespace std;
#define repr(i, a, b) for (i... | 0 | 5,723,779 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, dex, A, B, a[N];
int f(int dex) {
return min(abs(a[dex] - A), abs(a[dex] - B));
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
A = a[n - 1] >> 1, B = (a[n - 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
string b;
vector<int> a(n);
rep(i,n) cin >> a[i];
if(n%2==0){
for(int i=0; ... | 0 | 59,608,081 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <functional>
#include <numeric>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <bitset>
#include <queue>
using namespace std;
typedef long long ll;
templ... | 0 | 98,943,869 |
#include<iostream>
using namespace std;
int main(){
int n, y, m, d;
cin>>n;
for(n;n;n--){
cin>>y>>m>>d;
int ans=0;
for(int i=y+1;i<1000;i++){
if(i%3==0) ans+=20*10;
else ans+=(20+19)*5;
}
if(y%3==0) ans+=20*(10-m);
else{
for(int i=m+1;i<=10;i++){
if(i%2) ans+=20;
else a... | #include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
void
dfs(int node, ll count, G &arr, vector<bool> seen, vector<long> &to_K)
{
seen[node] = true;
... | 0 | 16,220,342 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>B(N+1);
B[0] = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];
B[i+1] = B[i]+A[i];
}
int ans = 0;
int cnt = 1;
sort(B.begin(),B.end());
... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<ll> A(N), B(N);
REP(i, 0, N) cin >> A[i];
REP(i, 0, N) cin >> B[i];
ll cnta = 0, c... | 0 | 3,708,945 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#includ... | #include <cstdio>
using namespace std;
int main() {
int n[101]={};
int mode=0;
while (true) {
int a;
if (scanf("%d", &a) == EOF)
break;
++n[a];
if (mode < n[a])
mode = n[a];
}
for (size_t i=1; i<=100; ++i)
if (n[i] == mode)
... | 0 | 7,651,334 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() < 4) cout << "No\n";
else {
if (s[0] == 'Y' && s[1] == 'A' && s[2] == 'K' && s[3] == 'I') cout << "Yes\n";
else cout << "No\n";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
u... | 0 | 35,544,933 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, answer;
answer = 0;
cin >> N >> K;
vector<int> p(N);
for(int i = 0; i < N; i++){
cin >> p[i];
}
sort(p.begin() , p.end() );
for(int i = 0; i < K; i++){
answer += p[i];
}
cout << answer << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)... | 0 | 24,428,079 |
#include <iostream>
#include <vector>
using namespace std;
int n, m;
int mod = 1000000007;
vector<long long> fac, inv, finv;
void combinit()
{
fac.resize(n + m + 1);
inv.resize(n + m + 1);
finv.resize(n + m + 1);
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < n +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | 0 | 6,223,809 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = V<V<V<T>>>;
#define rep2(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N , M;
cin >> N;
int goukei = 0;
int MAX = 0;
vector<string> ao(N);
for (int i = 0; i < N; i++){
cin >> ao.at(i);
}
cin >> M;
vector<string> aka(M);
for (int i = 0; i < M; i++){
cin >> aka.at(i);
}
for (int i = 0; i < N; i++)... | 0 | 89,085,909 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define p_ll pair<ll, ll>
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
int main() {
int a, b; cin >> a >> b;
string result;
if (a+b==15) result = "+";
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 87,972,178 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
bool isTrue = false;
for(int i=0;i<=x;i++)
{
if(i*4+(x-i)*2==y)
{
cout<<"Yes";
return 0;
}
}
cout<<"No";
} | #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
... | 0 | 17,828,618 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
char ntoc[9][6] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
cin >> n;
while(n-- && cin >> s) {
int len = s.size();
int p = -1;
for(int i = 0; i < len; ++i) {
if(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n && n!=0){
string s[n];
bool d=true;
for(int i=0;i<n;i++){
cin>>s[i];
}
int cnt=0;
for(int i=0;i<n-1;){
if(d){
if(s[i][1]=='u' && s[i+1][1]=='u'){
... | 0 | 98,293,489 |
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
const int N = 105;
int n, a[N];
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; ... | #include<bits/stdc++.h>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define... | 0 | 42,616,512 |
#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RRE... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i ++){
int _a;
cin >> _a;
a[i] = _a;
}
sort(a.begin(), a.end());
int now_num = 0;
int now_cnt = 0;
int ans = 0;
for (auto num : a){
... | 0 | 54,759,596 |
#include <iostream>
using namespace std;
int main(void){
int a,b,c;
cin >> a >> b >> c;
cout << max(c-(a-b),0) << endl;
} | #include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <string>
using namespace std; typedef long long ll; const int INF=1e9; typedef pair<int,int> P;
int main() {
string s; cin>>s;
int n=s.size();
if (n<26) {
bool u[26]; fill(u,u+n,false);
for(int i=0;i<n;i++) u[s[i]-'a']=true;... | 0 | 82,871,865 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()
template<typename T> inline void chmax(T& t, T f){if(t < f)t = f;}
vector<string> split(const string& input, char delimite... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = ... | 0 | 30,289,940 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N;
cin >> N;
vector <int> X(N);
rep(i,N) cin >> X[i];
int ans = inf;
for (int i = 1; i... | #include<bits/stdc++.h>
#define ll long long int
#define lb lower_bound
#define fi first
#define ub upper_bound
#define se second
#define mp make_pair
#define vll vector<ll>
#define mod 1000003
#define endl "\n"
#d... | 0 | 6,965,877 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, g;
cin >> r >> g;
cout << 2.0 * g - r << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.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 chmi... | 0 | 93,659,166 |
#include <iostream>
using namespace std;
int main(void)
{
while (true) {
int m, f, r;
cin >> m >> f >> r;
if (m + f + r == -3) break;
else if (m == -1 || f == -1) cout << 'F' << endl;
else if (m + f >= 80) cout << 'A' << endl;
else if (m + f >= 65) cout << 'B' << endl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> students, pos;
for (int i = 0; i < N; i++) {
int... | 0 | 33,097,860 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main()
{
int l;
double d,ans;
cin >> l;
d = (double)l / 3.0;
ans = d * d * d;
std::cout << fixed << setprecision(12) << ans << endl;
} | #include<stdio.h>
int main(){
long long int n,a=10,b=0;
scanf("%lld\n",&n);
if(n%2==0){
while(a<=n){
b=b+n/a;
a=a*5;
}
}
printf("%lld\n",b);
} | 0 | 77,450,572 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
ll n;cin>>n;
vector<ll> t(n+2,0), a(n+2,0);
rep(i,n){cin>>t.at(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | 0 | 44,216,663 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
int main() {
int N; cin >>N;
bool flag=false;
rep_eq(i,0,100/4) {
rep_eq(j,0,100/7) {
if (i*4+j*7==N) {flag=true; break;}
}
if (flag) break;
}
c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define PI 2*acos(0.0)
#... | 0 | 28,413,818 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
int main(){
ll N; cin >> N;
vector<ll> A(N); for(ll i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
vector<ll> D(N); D[0] = A[0];
for(ll i = 1; i < N; i++) D[i] = D[i-1] + A[i];
ll ans = 1;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll n;
cin>>n;
ll a[n];
ll mx = 0;
for(int i=0;i<n;i++){
cin>>a[i];
mx = max(mx,a[i]);
}
ll ans1 = -1;
... | 0 | 34,101,745 |
#include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <stack>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
#include <map>
#include <numeric>
#include <functional>
... | #include<iostream>
#include<algorithm>
using namespace std;
int n,k,a[5000];
int dp[5050][5050]={1};
bool C(int m)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<k;j++)dp[i+1][j]=0;
for(int j=0;j<k;j++)
{
if(dp[i][j]){
dp[i+1][j]=1;
if(i!=m&&j+a[i]<k)dp[i+1][j+a[i]]=1;
}
}
}
for(int i=max(0,k-a[m]);i<... | 0 | 2,227,695 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N;
cin >> N;
int P[N];
rep(i,N) cin >> P[i];
int Q[N];
int minl = P[0];
rep(i,N){
minl = min(minl,P[i]);
Q[i] = minl;
}
int ans = 0;
rep(i,N){
if (Q[i]>=P[i]) ans++;
}
cout... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | 0 | 9,746,944 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unsigned long long i... | #include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
... | 0 | 31,939,298 |
#include <cstdio>
#include <ctype.h>
using namespace std;
int main(){
char str[1200];
gets(str);
int i = 0;
while(str[i] != '\0'){
char uc, lc;
uc = toupper(str[i]);
lc = tolower(str[i]);
if(lc == str[i]) printf("%c", uc);
else printf("%c", lc);
++i;
}... | #include <stdio.h>
#include <string.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int memo[100000]; for(int i=0;i<m;i++) memo[i]=0;
int ac=0,wa=0;
for(int i=0;i<m;i++)
{
int p;
char s[3];
scanf("%d%s",&p,s);
if(memo[p]!=-1)
if(strcmp(s,"WA")==0)
{
... | 0 | 85,905,237 |
#include <iostream>
using namespace std;
int main() {
for(;;){
int m, f, r;
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1) break;
if(m == -1 || f == -1) cout << "F";
else if(m + f >= 80) cout << "A";
else if(m + f >= 65) cout << "B";
else if(m + f >= 50 || r >= 50) cout << "C";
else if(m + f >= ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 0 | 26,091,640 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int x;
cin >> x;
long min, max, sum;
min = max = sum = x;
for (int i = 1; i < n; ++i)
{
cin >> x;
if (x < min) min = x;
if (max < x) max = x;
sum += x;
}
cout << min << ' ' << m... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define all(x) x.begin(),x.end()
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
const int INF=INT_MAX;
const ld PI=ac... | 0 | 68,111,642 |
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define FOR(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N;
cin >> N;
vector<ll> a(N);
for (... | 0 | 6,280,233 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
string s[N];
int a = 0;
int b = 0;
int c = 0;
int ans = 0;
for (int i= 0; i < N; i++) {
cin >> s[i];
}
for (int i = 0; i < N; i++) {
if (s[i][0] ==... | #include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
using namespace std;
const int N = 1e5+5;
int h[N],n,k,ans[N];
main() {
cin >> n;
k = 2;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2;... | 0 | 72,041,125 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
signed ... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define MAXN 200
#define INF 1000000000
void WarshallFloyd(int n, ... | 0 | 22,897,604 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,m;
cin>>a>>b>>m;
vector<int>aprice(a);
vector<int>bprice(b);
vector<vector<int>> data(m, vector<int>(3));
for(int i=0;i<a;i++){
cin>>aprice[i];
}
for(int i=0;i<b;i++){
cin>>bprice[i];
}
for (int j = 0; j < m ; j++) {
fo... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma optimize O3
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T> using ... | 0 | 44,875,877 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | #include <iostream>
using namespace std;
struct Card { char suit; int value;};
void selectionsort(struct Card A[], int N) {
for (int i = 0; i< N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j].value < A[minj].value) minj = j;
}
swap(A[i], A[minj]);
}
}
void bubblesort(struct Card ... | 0 | 56,635,777 |
#include <iostream>
#include <string>
using namespace std;
string check(int num);
int main(){
int n,c = 0,d = 0;
string a,b;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a >> b;
if(a > b){
c += 3;
}
else if(b > a){
d += 3;
}
else{
c++;
d++;
}
}
cout << c << ' ' << d << "\n";
return 0;
} | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | 0 | 73,925,266 |
#include <iostream>
#include <vector>
#include <numeric>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<int> a(n);
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
}
int sum = std::accumulate(a.begin(), a.end(), 0);
int count = 0;
for (int i = 0; i < n; i++)
{
... | #include <iostream>
#include <string>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int i,j;
int check=0;
int ans=-1;
for(i=S.length()-T.length(); i>=0; i--){
for(j=0; j<T.length(); j++){
if(S[i+j]!='?' && S[i+j]!=T[j]) check=1;
}
if(check==0){
... | 0 | 22,262,463 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.