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;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | 0 | 33,250,302 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int A,B,i=1;
cin >> A >> B;
while(1){
if((int)(i * 0.08) == A && (int)(i * 0.1) == B) break;
if((int)(i * 0.08) > A) {i = -1; break;}
i++;
}
cout << i << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define sigma_size 30
#define max_size (int)(1e5+10)
#define MAX (int)(1e5+7)
int qread()
{
char c; int s=0,t=1; while ((c=getchar())<'0' || c>'9') (c=='-' && (t=-1));
do s=s*10+c-'0'; while ((c=getchar())>='0' && c<='9'); return s*t;
}
int main ()
{
... | 0 | 58,470,585 |
#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>
#include <vector>
using namespace std;
int main(void){
long int n,h,w,ans=0,i,ab[1000][2];
cin>>n>>h>>w;
for(i=0;i<n;i++){
for(int j=0;j<2;j++){
cin>>ab[i][j];
}
}
for(i=0;i<n;i++){
if(ab[i][0] >= h && ab[i][1] >= w)
ans++;
}
... | 0 | 80,776,991 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long comb = 1;
for (int i = 0; i < N; i++)
{
if (i == 0)
{
comb *= K;
}
else
{
comb *= K - 1;
}
}
cout << comb << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int gcd(int a,int b){
if(b==0){
return a;
}
else{
return gcd(b,a%b);
}
}
int main(){
int i,j,n;
cin >> n;
int a[1000010],b[1000010];
for(i=0;i<n;i++){
cin >> a[i];
b[i]=a[i];
}
vector<int> x(1... | 0 | 45,980,528 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,m;
cin>>n>>m;
if (n<m) {
if (n==1) {
cout<<n*m-2<<endl;
} else if (n==2) {
cout<<0<<endl;
} else {
cout<<(n-2)*(m-2)<<endl;
}
} else if (n>m) {
if (m=... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | 0 | 35,520,332 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 102, K = 4;
ll dp[N][K][2];
char s[N];
int k, n;
ll rec(int x, int cnt, int f) {
if (x == n) {
return cnt == k;
}
if (cnt > k) return 0;
ll &ret = dp[x][cnt][... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define sz(x) (ll) x.size()
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
ll Pow(ll a, ll b, ll md, ll ... | 0 | 72,623,527 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vld vector<ld>
#define vvi vector<vecto... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n... | 0 | 10,822,416 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
int len = s.leng... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod... | 0 | 6,964,078 |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=100+10;
const int inf=1<<30;
int a[maxn];
int main()
{
int n;
scanf("%d",&n);
int sum=0;
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),sum+=a[i];
int ans1=0,ans=inf;
for(int j=-100;j<... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <utility>
#include <queue>
#include <deque>
#include <stack>
#include <time.h>
#include <stdlib.h>
#include <algorithm>
#include <chrono>
#define INF 1e9
#... | 0 | 70,618,974 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int> pq;
long long int res = 0;... | #include<bits/stdc++.h>
using namespace std;
#define INF (1LL<<60)
long long Solve(long long H, long long W){
long long ans=INF;
for(long long h=1; h<H; h++){
long long w=W/2, Sa,Sb,Sc,M,m;
Sa=h*W;
Sb=(H-h)*w;
Sc=(H-h)*(W-w);
M=max(Sa, max(Sb,Sc)); m=min(Sa, min(Sb,Sc));
ans=min(ans,M-m);
long long tmp=... | 0 | 43,502,189 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int a1=0,b1=0;
for(int i=1;i<=b;i++){
a1+=a*pow(10,(i-1));
}
for(int i=1;i<=a;i++){
b1+=b*pow(10,(i-1));
}
if(a1>b1)cout<<a1<<endl;
else cout<<b1<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n, x, m, r, p;
cin >> n >> x >> m;
p = x;
r = x;
ll ans = 0, cnt = 0;
set<ll> s, t;
while(true){
if(s.find(x) != s.end())
break;
s.insert(x);
x = x * x % m;
}
while(r ... | 0 | 46,635 |
#include <iostream>
using namespace std;
int main () {
int W,H,x,y,r;
cin >> W >> H >> x >> y >>r;
if ((x - r) < 0 || (x + r) > W || (y - r) < 0 || (y + r) > H) cout << "No\n";
else cout << "Yes\n";
} | #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 | 86,383,400 |
#include<bits/stdc++.h>
#define INFTY 10000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=1000000007;
const int di[4] = {-1,0,1,0};
const int dj[4] = {0,-1,0,1};
const int INF = 1e9;
const int A = 1000005;
int main(){
string s,t={};cin>>s;
int ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... | 0 | 65,354,953 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
#define all(a) (a).begin(), (a).end()
int A, B;
const int w = 100, h = 100;
int grids[w][h];
int main () {
cin >> A >> B;
int nw = 1, nb = 1;
for(int i = 50; i < w; i++) {
rep(j,h) grids[i][j... | 0 | 31,816,179 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
void Say(bool say, string a = "Yes", string b = "No"){cout << (say ? a : b) << endl;};
int main(){
string s;
ll n;
cin >> s;
cin >> n;
for(ll i = 0; i < s.size(); i += n)cout << s[i];
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<map<int, int>> m(n);
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
for (int j = 0; j < str.length(); ++j) {
m[i][str[j]-'a']+... | 0 | 30,201,795 |
#include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
int N, A = 0, B = 0, AB = 0, ans = 0;
scanf("%d", &N);
rep(i, N... | #include <stdio.h>
#include <stdlib.h>
#define N 1000000
typedef struct node{
int p;
int right;
int left;
}Node;
int main(){
int n,i,j,l,c,k,id,P,depth,r;
Node a[N],tmp;
scanf("%d",&n);
for(i=0;i<n;i++){
a[i].p = -1;
a[i].right = -1;
a[i].left = -1;
}
for(i=0;i<n;i++){
scanf("%d%d",&id... | 0 | 66,517,510 |
#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;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int... | 0 | 42,181,345 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N;
ll A[200000];
int main(){
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
for(int i=1;i<N;i++) A[i] += A[i-1];
unordered_map<ll,ll> um;
um[0]++;
for(int i=0;i<N;i++) um[A[i]]++;
ll ans = 0;
for(a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n, i, j;
string s;
bool checker = true;
cin >> n >> s;
if(n % 2) {
cout << "No" << '\n';
return 0;
}
for(i = 0, j = n / 2; i < n / 2; i++, j++) {
if(s[i] != s[j]) {
... | 0 | 48,236,016 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
const int INF = 1e9;
int n;
int heights[100000];
int memo[100000];
int dp(int i)
{
if (i < 0)
return INF;
if (i == 0)
return 0;
if (memo[i] > -1)
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 96,824,287 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n;
while(cin>>n,n){
vector<vector<int> > road(15,vector<int>(15,1<<22));
int maxn = 0;
for(int i = 0 ; i < 15 ; i ++)road[i][i] = 0;
for(int i = 0 ; i < n ; i ++){
int a,b,c;
cin>>a>>b>>c;
road[a][b] = c... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int l1=s.size(),l2=t.size();
int mi_cnt=l2;
for(int i=0;i+l2-1<l1;i++)
{
int cnt=0;
for(int j=0;j<l2;j++)
{
if(t[j] != s[i+j])
cnt++;
}
mi_cnt=min(mi_cnt,cnt... | 0 | 100,512,508 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,M;
string A[50];
string B[50];
int main(){
cin >> N >> M;
for(int i=0;i<N;i++) cin >> A[i];
for(int i=0;i<M;i++) cin >> B[i];
for(int i=0;i+M-1<N;i++){
for(int j=0;j+M-1<N;j++){
bool f = t... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
using namespace std;
const int N=1e6+1... | 0 | 2,227,682 |
#include<bits/stdc++.h>
using namespace std;
long long n, m, ans;
int main(){
cin >> n >> m;
if(n <= m/2){
ans += n;
m -= n * 2;
n = 0;
}else{
ans += m/2;
m = 0;
n -= m/2;
}
ans += m/4;
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#de... | 0 | 81,553,555 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char c = S.at(K-1);
for (int i=0; i<N; i++) {
if (S.at(i)==c) {
cout << c;
} else {
cout << '*';
}
}
cout << endl;
} | #include <iostream>
using namespace std;
int main() {
int X,Y;
cin >> X >> Y;
if (Y%2==1) {
cout << "No" << endl;
}
else {
if (X*4<Y||X*2>Y)
cout << "No" << endl;
else {
cout << "Yes" << endl;
}
}
} | 0 | 100,068,725 |
#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 A[N], B[N];
rep(i,N) cin >> A[i] >> B[i];
ll ans = 0;
for (int i = N-1; i >= 0; i--) {
int p = (ans+A[i]+B[i])%B[i];
if (p != 0) p = B[i] - p;
ans += p;
}
cout... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 72,417,548 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
us... | #include<iostream>
using std::cout;
using std::endl;
using std::cin;
void output(int h, int w) {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cout << "#";
}
cout << endl;
}
cout << endl;
return;
}
int main(void) {
int h;
int w;
cin >> h >>... | 0 | 78,969,443 |
#include<stdio.h>
int main(void)
{
int a,s,z,x,h,d,f,g,i,j;
scanf("%d",&a);
for(i=1;i<=a;i++){
scanf("%d %d %d",&s,&z,&x);
d=x*x;
h=s*s+z*z;
if(s<x&&x<z||x<s&&s<z){
d=z*z;
h=s*s+x*x;
}
if(z<x&&x<s||x<z&&z<s){
d=s*s;
h=z*z+x*x;
}
if(d==h){
printf("YES\n");
}
if(d!=h){
printf("NO\... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,k,border,ans;
border = pow(10,18);
cin >> a >> b >> c >> k;
if(k == 0){
ans=a-b;
}else{
if(k%2==0)k=2;
if(k%2==1)k=1;
for(int i = 0; i < k; i++){
long long tmpA,tmpB,tmpC;
... | 0 | 99,883,043 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<iostream>
#include<numeric>
#include<cctype>
using namespace std;
void swapp(int *a, int *b) {
if (*a > *b) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define fast() ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define lp(i, n) for(int i = 0; i < n; i++)
#define rlp(i, n) for(int i = n-1; i >= 0; i--)
#define loop(i, a, b) for(int i = a; i <= b; i++)
#define rloop(i, a, b) for(int i = a; i >= b; i--)
#define m... | 0 | 40,574,546 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long Int;
int main() {
string S;
cin >> S;
Int K, N;
cin >> K;
N = S.size();
set<char> X;
rep(i,N) X.insert(S[i]);
if (X.... | 0 | 75,801,196 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | #include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<vector>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=4e18;
c... | 0 | 39,379,388 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | 0 | 86,916,345 |
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<sstream>
using namespace std;
#define sf scanf
#define pf printf
#define pfn printf("\n");
#define pfk print... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 85,797,896 |
#include <bits/stdc++.h>
#include <algorithm>
#include <atcoder/all>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = ... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 34,119,669 |
#include <bits/stdc++.h>
using namespace std;
int func(int x){
if(x%2==0){
return x/2;
}
return 3*x+1;
}
int main(){
int S;
cin>>S;
vector<int> a(1,S);
bool b=false;
int count=0,i=0;
while(b==false){
i=func(a.at(count));
for(int x:a){
if(x==i){
cout<<a.size()+1<<endl;
b=true;
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF 1000000000000000
#define MOD 1000000007
int main(){
ll N;
cin>>N;
vector<ll> a(N);
for(ll i=0;i<N;i++){
cin>>a.at(i);
}
bool flag=true;
for(ll i=0;i<N;i++){
if(a.at(i)>=N){
flag=false;
}
}
if(flag){
cou... | 0 | 61,356,734 |
#include <bits/stdc++.h>
using namespace std;
void __start__() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MY
freopen("/home/ainur/CLionProjects/wow/input.txt", "r", stdin);
freopen("/home/ainur/CLionProjects/wow/output.txt", "w", stdout);
#else
#endif
}
#define sz(x) (int)x.size()
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int... | 0 | 60,802,600 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n][3];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin>>arr[i][j];
}
}
int dp[n][3];
dp[0][0]=arr[0][0];
dp[0][1]=arr[0][1];
dp[0][2]=arr[0][2];
for(int i=1;i<n;i++){
dp[i][0]=max(dp[i-1][1],d... | 0 | 54,005,160 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int num , k , a[100005];
int dp[100005];
const int oo=1e9+7;
int Min(int a , int b)
{
if(a>b)return b;
else return a;
}
main()
{
cin >> num >> k;
for( int i=1 ; i <= num ; ++i )
{
cin >> a[i];
dp[i]=oo;
}
dp[1]=a[1];
dp[2]=abs(a[1]-a[2]);
... | 0 | 88,825,810 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str;
t... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
#define FOR(t,i,n) for(t i=(t)0;(i)<(n);(i)++)
template<class T>void printarray(T a,int n){
FOR(int,i,n) cout << a[i] << " " ;
cout << endl;
}
main(){
ios_base::sync_with_stdio(false) ;
map<int,bool> num;
... | 0 | 74,022,643 |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> mp;
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
mp[s]++;
}
int m;
cin >> m;
for (int i = 0; i < m; ++i) {
string t;
cin >> t;
mp[t]--;
}
int ans = 0;
for (auto i = mp.begin();... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(string s){
int c1 = 0,c2 = 0;
char num1 = '0' ,num2 = '1';
for(int i=0;i<s.size();i++){
if(s.at(i) != num1) c1++;
if(num1 == '0'){
num1 = '1';
}else{
num1 = '0';
}
}
... | 0 | 34,597,684 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)998244353;
const ll INF=(ll)1e18+10;
const double PI=acos(-1);
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0... | #include<bits/stdc++.h>
using namespace std;
#define Pi acos(-1)
#define _terminated return 0
#define endl "\n"
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define booster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef vecto... | 0 | 27,083,177 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <map>
#include <utility>
#define _GLIBCXX_DEBUG
using namespace std;
int main()
{
int n,k;
cin >> n >> k;
map<int, int> p;
for (int i = 0; i < k; ... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define FILL(a, n, x) memset((a), (x), sizeof ((a)[0]) * (n))
#define COPY(a, n, b) memcpy((b), (a), sizeof ((a)[0]) * (n))
using namespace std;
typedef long long li;
const int maxn = 1000;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1... | 0 | 53,032,084 |
#include<bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b){
if(b==0) return a;
return gcd(b,a%b);
}
long long lcm(long long a,long long b){
return(a/gcd(a,b)*b);
}
int main(){
int n;
cin>>n;
long long z[n];
cin>>z[0];
for(int i=1;i<n;i++){
cin>>z[i];
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#... | 0 | 3,354,287 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main() {
int N,T; cin>>N>>T;
vi time(N);
rep... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
vector<string> G(x);
vector<vector<int>> flip(x,vector<int>(y));
for (auto &s : G) cin >> s;
if (G[0][0] == '.') flip[0][0] = 0;
else flip[0][0] = 1;
for (int i = 1; i < y; i++) {
flip[0][i] = flip[0][i-1];
if (G... | 0 | 3,197,375 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
long long gcd(long long x, long long y){
if(y == 0){
return x;
}
return gcd(y, x%y);
}
int main(){
long long n, x;
cin >> n >> x;
long long g = 0;
long long xx[n];
for(long long i = 0; i < n; i++){
... | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
set<int> p, q;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (a == 1)p.insert(b);
if (b == n)q.insert(a);
}
bool ret = ... | 0 | 74,062,895 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
ll n,t;
int i;
ll a[200006];
ll ans = 0;
scanf("%lld %lld", &n, &t);
for(i = 0;i < n;i++){
scanf("%lld", &a[i]);
}
for(i = 1;i < n;i++){
if((a[i... | #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 x,n,ans=-1;
cin >> x >> n;
int aa;
vector<bool> a(102,true);
rep(i,n){
cin >> aa;
a[aa]=false;
}
for(int i=0;i<=101;i++){
if(a[i]){
... | 0 | 10,758,721 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
usi... | #include <bits/stdc++.h>
using namespace std;
#define maxn 100002
#define FOR(i, l, r) for (int i=l; i<=r; ++i)
#define FORD(i, r, l) for (int i=r; i>=l; --i)
#define REP(i, r) for (int i=0; i<(int)r; ++i)
#define REPD(i, r) for (int i=(int)r-1; i>=0; --i)
#define fi first
#define se second
#define mk make_pair
#define... | 0 | 4,498,811 |
#include<bits/stdc++.h>
using namespace std;
int f(int n){
if(n % 2 == 0) return n/2;
else return 3*n + 1;
}
int main(){
int s, a, ans = 1;
set<int> S;
cin >> s;
a = s;
S.insert(a);
while(true){
++ans;
a = f(a);
if(S.find(a) != S.end()) break;
else S.inse... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
sort(all(a));
int sum=0;
rep(i... | 0 | 73,596,949 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
typedef long long ll;
const ll inf = 1e9+7;
const ll mod = 1e9+7;
int ma... | #include <iostream>
using namespace std;
int main(void){
int x,y;
for(;;){
cin>>x>>y;
if(x==0&&y==0){
break;
}
for(int i=1;i<=x;i++){
for(int o=1;o<=y;o++){
cout<<'#';
}
cout<<endl;
}
cout<<endl;
... | 0 | 99,358,705 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int k=n/111;
if(n%111==0)
cout<<n;
else
cout<<(k+1)*111;
} | #include <iostream>
#include <vector>
typedef long long LL;
using namespace std;
#define MAX 100100
vector<vector<int>> ab(MAX);
vector<vector<LL>> c(MAX);
vector<LL> d(MAX);
vector<bool> is_visit(MAX, false);
void dfs(int s){
if(ab[s].size()==0){
return;
}
for(int i=0; i<ab[s].size(); i++){
... | 0 | 69,483,351 |
#include<iostream>
#include<string>
#include<vector>
#include<cctype>
int main(void) {
std::vector<int> CountingCharactor('z' - 'a' + 1, 0);
std::string Input;
while (1) {
std::getline(std::cin, Input);
if (!(Input[0])) { break; }
for (unsigned int i = 0; i < Input.size(); i++) {
Input[i] = std::tolower(Inp... | #include<iostream>
#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
using namespace std;
#define mod 1000000000000000007
#define pi 3.1415926535897932384626433832795
#define ll long long
#define pb push_back
#define pii pair < int... | 0 | 81,631,795 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = (ll)(1e9 + 7);
int main()
{
ll n;
ll k;
cin >> n >> k;
vector<ll> a(n);
ll sum = 0, sum2 = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < n; i++)
{
for (int... | #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
int a[15];
int main()
{
_FastIO;
int ans = 0;
int m = 10;
for(int i = 0; i < 5; i++){
cin >> a[i];
ans +... | 0 | 53,566,678 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int h, w;
cin >> h >> w;
vector<string> field(h);
rep(i, h) cin >> field[i];
vector<vector<int>> yoko(h, vector<int>(w, 0));
vector<vector<int... | 0 | 72,363,992 |
#include <iostream>
using namespace std;
int main()
{
int n; cin >> n;
int a[200000]; for (int i = 0; i < n; ++i) cin >> a[i];
int l = 0, r = 0, sum = 0;
long long ans = 0;
while (r < n)
if (sum + a[r] == (sum ^ a[r]))
sum += a[r++];
else {
ans += r-l;
sum -= a[l++];
}
ans += (... | #include <iostream>
using namespace std;
int main()
{
while(1)
{
long long n;
cin>>n;if(!n)return 0;
char t[100000][2];
for(int i=0;i<n;++i){
char a,b;
cin>>a>>b;
t[i][0]=a;
t[i][1]=b;
}
long long m;
cin>>m;
... | 0 | 39,406,555 |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i <= N; i++)
{
if (i % 2 == 1)
{
long long count = 0;
for (long long j = 1; j < pow(i, 0.5); j++)
{
if (j ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 100100;
int main()
{
int n;
cin >> n;
vector<int> dp(n + 1, INF);
dp[0] = 0;
for (int i = 1; i <= n; i++)
{
for (int pow = 6; pow <= i; pow *= 6)
... | 0 | 100,488,346 |
#include<bits/stdc++.h>
#define INF 9999999
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int dp[n][3];
vector<int>a(n),b(n),c(n);
for(int i=0; i<n; i++)
cin>>a[i]>>b[i]>>c[i];
dp[0][0]=a[0];
... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
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()
{
int K, S;
cin >>... | 0 | 44,104,167 |
#include<iostream>
using namespace std;
#include<cstdio>
int main(){
double x,y;
for(;;){
cin>>x>>y;
if(x<y){
cout<<x<<" "<<y<<endl;
}
else if(x>y){
cout<<y<<" "<<x<<endl;
}
else if(x==y && x!=0){
cout<<x<<" "<<y<<endl;
}
else if( x== 0 && y == 0){
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for(int i=0; i<N; i++) cin >> A[i];
sort(A.begin(),A.end());
if(K >= N) {
cout << 0 << endl;
return 0;
}
for(int i=0; i<K; i++) {
A.pop_back()... | 0 | 573,030 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string input;
cin >> input;
if(input.at(2)==input.at(3) && input.at(4)==input.at(5)) cout << "Yes" << endl;
else cout << "No" << endl;
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 | 47,082,092 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
ll n, m;
cin >> n >> m;
if(n >= m/2)
cout << m/2 << endl;
else
cout << n+(m-2*n)/4 << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... | 0 | 1,258,865 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
ll INF = LLONG_MAX;
using vc = vector<char>;
using vi =... | #include<bits/stdc++.h>
using namespace std;
#define ikarus_101 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typed... | 0 | 100,633,868 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
int main() {
ll n,m,d;cin>>n>>m>>d;
double half;
if (d==0) half = n;
else half = 2 * (n - d);
double ans = (double)(half) * (double)(m -1) / (double)(n * n);
cout <<... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 93,683,063 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n>>m;
vector<int> height(n);
vector<int> max_height(n,0);
for(int i=0; i< n; i++){
int h;
cin >> h;
height.at(i) = h;
}
for(int i=0; i<m; i++){
int a,b;
cin >> a >> b;
max... | 0 | 96,441,345 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int i,j,k,a,b;
cin>>a>>b;
k=max((100*a)/8,(100*b)/10);
for(i=1;i<=1009;i++)
{
if((i*8)/100==a && (i/10)==b)
{
cout<<i;
return 0;
}
else
{
j=1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 66,806,004 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | 0 | 23,989,670 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
using na... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main()
{
ll n,h,w;
cin >> n >> h >> w;
ll ans = 0;
for(ll i = 0;i < n;i++)
{
ll a,b;
cin >> a >> b;
if(a >= h && b >= w)
{
ans++;
... | 0 | 9,307,272 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const ll INF = 1e16;
void solver(ll K, ll A, ll B, ll &ans){
ll ans_buf;
ll plus_dif = B - A;
if(plus_dif <= 1) ans_buf = 1 + K;
else{
ll num_buf;
num_buf = K - (... | 0 | 50,678,706 |
#include <array>
#include <vector>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iterator>
#include <tuple>
#include <utility>
#include <limits>
#include <iostream>
#include <cstd... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=LLONG_MAX;
const int inf=INT_MAX;
const int nmax=1e5+5;... | 0 | 29,698,019 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 60,020,808 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,tmp;
cin >> N;
int sum = 0;
tmp = N;
while(N){
sum += N % 10;
N = N / 10;
}
if (tmp % sum == 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<iostream>
#include<cstdio>
#include<cmath>
#include <string>
using namespace std;
int c,g;
int hcount(int n,int sum,int bf){
if(n==0){
if(sum==g){
c++;
}
}
else{
for(int i=bf+1;i<10;i++){
hcount(n-1,sum+i,i);
}
}
return 0;
}
int main(){
int n;
while( scanf("%d %d",&n,&g)!=EOF){
if(n==0&... | 0 | 46,665,607 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,a,b,i,x=0;
cin >> N ;
for(i=1;i<=N;i++){
cin >>a >>b;
x+=b-a+1;
}
cout <<x;
} | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
vector<int>E[100000];
int d[100000], pr[100000];
void rec(int v, int p) {
d[v] = p;
for (int u : E[v])rec(u, p + 1);
}
int main() {
int n; scanf("%d", &n);
memset(pr, -1, sizeof(pr));
rep(i, n) {
int id, k; scanf("%d%d", &id, &k);
... | 0 | 31,551,298 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
string s; cin >> s;
int len = s.length();
int c = 0;
for(int i = 0; i < len; i++){
if(s[i] == 'o') c++;
}
if(c+(15-len) >= 8) cout << "YES" << endl;
else cout << "NO" << endl;
re... | #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 < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
int main(){
int w,b;
cin >> w >> b;
w--;
b--;
cout << 100... | 0 | 81,595,607 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
int V;
const int maxv=17;
const int INF=2e9+7;
int cost[maxv][maxv];
int d[maxv];
bool used[maxv];
void bjs(int s)
{
fill(d,d+V,INF);
d[s]=0;
memset(used,0,sizeof(used));
while(true)
{
int v=-1... | 0 | 78,800,977 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;cin>>S;
for(int X=0;X<3;X++){
if(S[X]=='1')
S[X]='9';
else
S[X]='1';
}
cout<<S<<endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
ret... | 0 | 41,318,165 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 +... | #include<cstdio>
int pa[10000];
int find(int x){
if(pa[x]!=x) pa[x] = find(pa[x]);
return pa[x];
}
void Init(int n){
for(int i=0;i<n;i++) pa[i] = i;
return ;
}
int Query(int a,int b){
if(find(a)!=find(b)) return 0;
return 1;
}
void Union(int a,int b){
int x = find(a);
int y = find(b);
... | 0 | 18,428,084 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <queue>
#include <math.h>
#define SIZE 1002
#define REP(i, n) for (int i = 0; i < (n); i++)
#define X first
#define Y second
using namespace std;
typedef pair<double, double> V;
typedef long long ll;
int n;
bool less_theta(V& i, V& j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define debug(x) cerr << "L" << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugvec(v) rep(i, v.size()) cerr << "L" << __LINE__ << ": " << #v << "[" << i << "] = " << v[i] << endl;
#define debugvec2(v) ce... | 0 | 135,565 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
map<int, int> B;
for (int i = 0; i < N; i++)
{
B[A.at(i)]++;
}
int ans = 0;
int b = 0;
for (int i = 0; i < N; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,x;
cin >> n >> x;
vector<ll> s(n);
for (ll i = 0;i < n;i++){
cin >> s[i];
}
vector<ll> d(n);
for (ll i = 0;i < n;i++){
d[i] = abs(s[i]-x);
... | 0 | 28,441,211 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mxn = 1005;
int dp[mxn][mxn];
char grid[mxn][mxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> grid[i][j];
dp[1][1] = 1;
for (int i = 1; i <... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 50,718,764 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define INFL (1LL << 62)
#define MOD7 1000000007
#define MOD9 1000000009
#define EPS 1e-10
using ll = long long;
using ull = unsigned long long;
int main() {
int a[] = { 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | 0 | 98,790,648 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
#define NIL -1
int main(){
LL n;
LL m;
cin >> n >> m;
vector<LL> x(n);
vector<LL> y(n);
vector<LL> z(n);
for(LL i=0; i<n; i++){
cin >> x[i] >> y[i] >> z[i];
}
LL ans=0;
f... | 0 | 24,952,952 |
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
void BFS(vector<vector<int> >& V, vector<int>& time) {
int i,k;
int cnt=1;
queue<pair<int,int> > qv;
qv.push({1,0});
time[1]=0;
while(!qv.empty()) {
k=qv.front().first;
cnt=qv.front().second+1;
qv.pop();
for(i=0; i<(int)V[k].size();... | #include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<pair<int, int>> red;
vector<pair<int, int>> blue;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
red.push_back(make_pair(x, y));
... | 0 | 24,249,305 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int n=s.size()/2;
int m=n/2;
int count=0;
for(int i=0;i<m;i++){
if(s.at(i)!=s.at(n-i-1)) count++;
else if(s.at(n+1+i)!=s.at(s.size()-i-1)) count++;
}
for(int i=0;i<m;i++){
if(s.at(i)!=s.at... | #include<iostream>
int main(){
int i,n,m;
for(i=0;i<3000;i++){
std::cin>> n>> m;
if(n==0&&m==0) break;
if(n>=m){
std::cout<< m<< " "<< n<< std::endl;
}else{
std::cout<< n<< " "<< m<< std::endl;
}
}
return 0;
} | 0 | 19,256,589 |
#include<stdio.h>
int main()
{
int m,f,r;
for(int i=1;;i++)
{
scanf("%d %d %d",&m,&f,&r);
if(m==-1&&f==-1&&r==-1) break;
else if(m==-1||f==-1) printf("F\n");
else if(m+f>=80) printf("A\n");
else if(m+f<80&&m+f>=65) printf("B\n");
else if((m+f<65&&m+f>=50)||(m+f<50&&m+f>=30&&r>=50) ) printf("C\n");
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int arr[5][5];
for(int i = 1; i <= 3; i++){
for(int j = 1; j <= 3; j++){
cin >> arr[i][j];
}
}
int n;
cin >> n;
for(int i = 1; i <= n; i++){
int val;
cin >> val;
for(int j = 1; j <= 3; ... | 0 | 27,774,046 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,diff;
cin >> a >> b >> c >> diff;
string ans= (abs(c-a) <= diff || (abs(b-a) <= diff && abs(c-b) <= diff)) ? "Yes" : "No";
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
vector<int>to[200005];
int main() {
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
a--; b--;
to[a].push_back(b);
to... | 0 | 84,775,331 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, k; cin >> a >> b >> c >> k;
int ans;
if (k <= a) ans = k;
else if (k <= a + b) ans = a;
else ans = a - (k - a - b);
cout << ans << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define rep(i,n) for(int i=0... | 0 | 52,500,825 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int a, b, c;
string str, command, s;
cin >> str >> c;
for (int i = 0; i < c;i++){
cin >> command;
if (command == "print"){
cin >> a >> b;
while (a <= b){
cout << str[a];
a++;
}
cout << endl;
}
else if (command == "repla... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | 0 | 59,944,969 |
#include <iostream>
using namespace std;
int main()
{
string S;
cin>>S;
if(S.length()==4){
if(S[0]==S[1]&&S[1]==S[2]&&S[2]==S[3]){
cout<<"No";
}
else if((S[0]==S[1]||S[0]==S[2]||S[0]==S[3]) && (S[1]==S[0]||S[1]==S[2]||S[1]==S[3]) && (S[2]==S[0]||S[2]==S[1]||S[2]==S[3]) && (S[3]==S[0]||S[3]==S[1... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define append push... | 0 | 87,736,698 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include<stdio.h>
int main()
{
int height[15],i,j,temp;
for(i=0;i<10;i++)
scanf("%d",& height[i]);
for(i=0;i<10;i++)
{
for(j=i+1;j<10;j++)
{
if(height[i]>height[j]){
temp=height[j];
height[j]=height[i];
height[i]=temp;... | 0 | 47,272,568 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define mp make_pair
#define pb push_back
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define pi 3.14159265358979323846
#define mod 1000000007
#define reus ios_base::sync_with_stdio(false);cin.tie(NULL);cou... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <deque>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
using namespace std;
const int MAX = 1e5;
const int INF = 1e8;
int K;
int d[MAX];
int bfs() {
deque<int> deq;
rep(i, K) d[i] = INF... | 0 | 62,917,981 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define REP2(i, n) for (LL i = 1; i <= (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) ... | #include<iostream>
using namespace std;
main(){
int N;
int x[110000];
int y[110000];
int t[110000];
cin >> N;
x[0] = 0;
y[0] = 0;
t[0] = 0;
for (int i = 1; i <= N;i++) cin >> t[i] >> x[i] >> y[i];
bool arrive = true;
int dist = 0;
int dt = 0;
for (int j = 1; j <= N; j... | 0 | 90,022,228 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int,int>;
void Yes() {
cout << "Yes" << endl;
}
void No() {
cout << "No" << endl;
}
int main(void) {
int n, m, a, b, c, d;
string s, t;
cin >> a >> b >> c >> d;
bool ok = fa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep_lr(i,l,r) for(int i=(l);i<(r);i++)
#define rep_sn(i,s,n) for(int i=(s);i<(s)+(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int>... | 0 | 4,536,781 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
if(n == 1){
cout << "Yes" << endl;
return 0;
}
vector<int> alpha_s(26, -1);
vector<int> alpha_t(2... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 | 33,140,886 |
#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
int main(){
ll N;
cin >> N;
ll a[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define mod 1000000007
#define string_mod 2549536629329_base_255
#define pb push_back
#define F first
#define S second
#define ff first
#defin... | 0 | 33,588,398 |
#include <iostream>
using namespace std;
class PriorityQueue
{
int max_nelem, end;
int* array;
public:
PriorityQueue(int n) : max_nelem(n), end(0){
array = new int[max_nelem];
}
void insert(int key)
{
int index = end;
array[end++] = key;
while(index > 0)
{... | #include <iostream>
#include <vector>
#include <array>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int h, w, d;
cin >> h >> w >> d;
int a;
vector<array<int, 2>> xy(h * w + 1);
rep(i, h) {
rep(j, w) {
cin >> a;
xy[a] = {i, j};
... | 0 | 45,054,103 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int d[10];
for(int i = 1; i<=4; i++) d[i]=0;
for(int i = 0; i<6; i++){
int z;
cin >>z;
d[z]++;
}
if(d[1]<=2 && d[2]<=2 && d[3]<=2 && d[4]<=2) cout << "YES" << endl;
else... | #include <bits/stdc++.h>
using namespace std;
template<typename T1, typename T2>
inline bool cmn (T1& a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<typename T>
struct floyd_warshall {
const int n;
const T inf;
vector<vector<T>> dst;
void cal () {
for (int k = 0; k < n;... | 0 | 20,103,544 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define int long long
#define N 100002
using namespace std;
const int mod=1000000007;
const int inf=1<<30;
int n,m,i,x[N],y[N],sum;
int read()
{
char c=getchar();
int w=0,f=1;
while(c<'0'||c>'9'){
if(c=='-') f=-1;
c=getchar();
}
while(c<='9'&&c>='0'){
... | #include<stdio.h>
int main()
{
int n,r[100],c[100][100];
int i,j,k,l,m;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d",&r[i],&j);
}
r[n]=j;
for(i=1;i<=n;i++){
c[i][i]=0;
}
for(l=2;l<=n;l++){
for(i=1;i<=n-l+1;i++){
j =i+l-1;
c[i][j]=1000000;
for(k=i;k<=j-1;k++){
m=c[i]... | 0 | 89,157,308 |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
int main(){
int H, W; std::cin >> H >> W;
std::vector<std::vector<char>> C(H, std::vector<char>(W));
for (int i = 0; i < H; ++i)
for (int j = 0; j < W; ++j)
std::cin >> C[i][j];
fo... | 0 | 44,191,410 |
#include <bits/stdc++.h>
using namespace std;
long long n ,k , x , y ,ans;
int main()
{
cin >> n >> k >> x >> y;
if (n > k)
ans = x * k + y * (n - k);
else
ans = x * n;
cout <<ans << endl;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 0 | 59,380,405 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin>>h>>w;
vector<vector<char>> tab(h,vector<char>(w));
vector<int> r;
vector<int> c;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>tab.at(i).at(j);
}
}
int cnt=0;
for(int i=0;i<h;i++){
cnt=0;
for(int j=0;j<w;... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 61,510,925 |
#include <iostream>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int a = N*(N-1)/2;
int b = M*(M-1)/2;
cout << a+b << endl;
} | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int mod = 1000000007;
int s;
cin >> s;
vector<int> dp(s+1, 0);
dp[0] = 1;
for(int i = 3; i <= s; ++i) {
for(int j = 0; j <= i-3; ++j) {
... | 0 | 15,792,036 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
ll n,a,b;
cin >> n >> a >> b;
int p1=0,p2=0,p3=0;
rep(i,n){
int tmp = 0; cin >> tmp;
if(tmp<=a) p1++;
else if(a<tmp && tmp<=b) p2++;
else p3... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 85,076,565 |
#include <stdio.h>
int main(){
int hi[10];
int n,count=0;
while(scanf("%d",&n) != EOF){
if(n == 0){
printf("%d\n",hi[count-1]);
hi[count-1]=0;
count--;
}
else{
hi[count]=n;
count++;
}
}
return 0;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 0 | 46,885,078 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(std::vector<long long> A) {
ll a = abs(A[0] - A[1]);
ll b = abs(A[1] - A[2]);
ll c = abs(A[2] - A[0]);
cout << a + b + c - max(max(a, b), c) << endl;
}
int main() {
std:... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
signed main() {
... | 0 | 8,436,797 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.