code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#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<int> a(n);
int sum = 0;
for (auto&& e : a) {
cin >> e;
sum += e;
}
sort(a.begin(), a.end(), greater<int>());
bool ok = a[m - 1] >= (sum + ... | #include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) x.begin(),x.... | 1 | 9,884,289 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> flowers(n);
rep(i, n) cin >> flowers[i];
int cnt = 0;
for(int i=1; i<=100; i++){
bool s =... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 200005
#define PI 3.14159265358979323846264338327950
#define ll long long int
vector<pair<ll, ll> > v;
multiset<ll> ms;
multiset<ll>::iterator it;
ll a[MAXX], b[MAXX];
ll mod = 1000000007;
cha... | 1 | 79,644,422 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main()
{
int m,ni,na;
while(cin>>m>>ni>>na,m)
{
vector<int> p(m);
REP(i,m)
{
cin>>p[i];
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int m,nmax,nmin,p[200],n,maxn;
while(1){
cin>> m>>nmin>>nmax;
if(m==0&&nmax==0&&nmin==0)
break;
for(int i=0;i<m;i++)
cin>>p[i];
maxn=0;
for(int i=nmin;i<=nmax;i++)
if(maxn<=p[i-1]-p[i]){
maxn=p[i-1]... | 1 | 28,482,621 |
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <cstring>
#include<cmath>
using namespace std;
int main()
{
long long x = 2, y = 1,z=0,w;
cin >> w;
if (w == 1) {
cout << 1;
}
else {
for (int i = 1; i < w; i++) {
z = (x + y);
x = y;
y = z;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t ans = 3, a = 2, b = 1;
int N;
cin >> N;
if(N == 0) {
ans = 2;
}
if(N == 1) {
ans = 1;
}
if(N > 1) {
for(int i = 2; i < N; i++) {
a = b;
b = ans;
ans = a + b;
}
}
printf("%ld", ans);
} | 1 | 16,830,386 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #include <bits/stdc++.h>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 1 | 100,589,231 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int K, S;
cin >> K >> S;
map<int, int> YpZ;
for (int Y = 0; Y <= K; ++Y) {
for (int Z = 0; Z <= K; ++Z) {
int YZ = Y + Z;
if (YpZ.count(YZ) == 0) {
YpZ.insert(make_pair(YZ, 0));
}
... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
int k,s;
cin>>k>>s;
int cnt=0;
for(int x=0;x<=k;x++){
for(int y=0;y<=k;y++){
if(0<=s-x-y && s-x-y<=k) cnt++;
}
}
cout<<cnt<<end... | 1 | 48,706,244 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int stock = 0, money = 1000, n, a[80];
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n-1; i++){
if(a[i] < a[i+1]){
stock += money / a[i];
money %= a[i];
} else if(a[i] >... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 1 | 85,976,022 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
template<typename T>
struct BIT{
int n;
vector<T> d;
BIT(int n = 0):n(n),d(n+1){}
void add(int i,T x=... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | 1 | 51,435,530 |
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 1000000000000000000;
const ll mod = 1000000007;
ll d[2134][2134];
void warshall_floyd(ll V) {
for (int h = 1; h <= V; h++) {
for (int i = 1; i <= V; i++) {
for (int j = 1; j <= V; j++) {
d[i][j] = min(d[i][j], d[i][h] + d[h][j])... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<pi>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vect... | 1 | 57,383,737 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | #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,D,X; cin >>N >>D >>X;
vector<int> A(N);
rep(i,0,N) cin >>A[i];
int ans=X;
rep(i,0,N) ans+=1+(D-1)/A[i];
cout <<ans <<endl;
} | 1 | 14,478,715 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N), B(N);
rep(i, N) cin >> A[i] >> B[i];
long long ans = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i=0; i<(int64_t)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int N;
cin >> N;
vector<int64_t> A(N), B(N);
rep(i, N) cin >> A[i] >> B[i];
int64_t cnt=0;
rep(i, N){
if((A[N-1-i]+cnt)%B[N-1-i]==0) continue;
cnt += B... | 1 | 82,001,974 |
#include <cmath>
#include <iostream>
using namespace std;
int main(){
double x[4],y[4],dx[3],dy[3],dpx[3],dpy[3];
double th[3], pth[3];
int check = 0;
bool ans = true;
while ( cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3]){
ans = true;
if (x[1] == 0 && y[1] == 0){
swap(x[0], x[1]);
... | #include<iostream>
#include<cmath>
using namespace std;
int main(){
double a[2],b[2],c[2],p[2];
double matrix[2][2],ans[2],reverse[2][2],det,x,y;
while(cin >>a[0]>>a[1]>>b[0]>>b[1]>>c[0]>>c[1]>>p[0]>>p[1]){
b[0] = b[0]-a[0];
b[1] = b[1]-a[1];
c[0] = c[0]-a[0];
c[1] = c[1]-a[1];
p[0] = p[0]-a[0];
p[1] = p... | 1 | 17,264,275 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef ve... | 1 | 80,028,795 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fi first
#define se second
#define pb push_back
using namespace std;
int ans[100],len,l,r,y,cnt,mid,sum;
char ok;
long long x;
int main(){
l=1;r=9;y=11;cnt=0;
x=1;
while (1) {
printf("? %lld\n",x);
fflush(stdout);
cin>>ok;
if (ok=='... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool In(){
char z;
cin>>z;
if(z=='N')return false;
return true;
}
int main(){
long long t=1000000000;
while(true){
cout<<"? "<<t<<"\n"<<flush;
if(In()){
if(t==1000000000){
long long x=500000000;
while(true){
cout<<"? ... | 1 | 85,922,637 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 1 | 68,566,290 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N , K ;
cin >> N >> K ;
vector<int> C(N);
for(int i = 0 ; i < N ; i++){
int A ;
cin >> A ;
A-- ;
C.at(A)++ ;
}
sort(C.begin(),C.end()) ;
reverse(C.begin(),C.end()) ;
int ans = 0 ;
int cnt = 0 ;
for( int p : C ){
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define _GLIBCXX_DEBUG... | 1 | 56,342,586 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void so... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool comp(pair<int,int> a, pair<int, int> b){
if(a.second != b.second){
return a.second > b.second;
}else{
return a.first < b.first;
}
}
int main(){
int N, K; cin >> N >> K;
vector<pair<int, int> > F_set, S_set;
... | 1 | 87,895,608 |
#include <bits/stdc++.h>
using ll = long long;
constexpr ll inf = static_cast<ll>(1e17);
constexpr ll mod = static_cast<ll>(1e9 + 7);
int n, m;
ll x[100005], y[100005];
ll sumX[100005], sumY[100005];
int main() {
std::cin >> n >> m;
for (int i = 0; i < n; i++)
std::cin >> x[i];
for (int i = 0; i < m; i++)
std::c... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ... | 1 | 48,735,158 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _... | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a;
b = 180 * (a - 2);
cout << b << endl;
} | 1 | 31,023,611 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define print(x) cout << x << "\n";
int main()
{
string s, t;
cin >>... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string s,t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(),greater<int>());
if(s < t) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 32,478,508 |
#include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | #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;
} | 1 | 12,187,481 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N,ans=0;
cin>>N;
vector<ll> h(N);
for(ll i=0;i<N;i++){
cin>>h.at(i);
if(i==0){ans=h.at(i);}
else if(h.at(i)>h.at(i-1)){ans+=h.at(i)-h.at(i-1);}
}
cout<<ans<<endl;
} | 1 | 93,743,015 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | 1 | 90,763,972 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define vl vector
using namespace std;
int main()
{
ll t,i,n;
ll a,b,c;
string s1,s2;
cin>>s1>>s2;
cin>>a>>b;
string rem;
cin>>rem;
if(s1==rem) a--;
if(s2==rem) b--;
cout<<a<<" "<<b;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string u, s, t;
int a, b;
cin >> s >> t >> a >> b >> u;
if(s==u)
--a;
else
--b;
cout << a << " " << b;
} | 1 | 55,291,151 |
#include <bits/stdc++.h>
#include <vector>
#define fo(i, t) for(int i = 0; i < t; i++)
#define rfo(i, t) for(int i = n - 1; i > 0; i--)
#define pb push_back
using namespace std;
int main()
{
long long a;
long long result = 0;
cin >> a;
for(int i = 1; i < a; i++)
{
result += (a - 1) / i;
... | #include <iostream>
#include <string>
#include <vector>
int main()
{
int n;
std::cin >> n;
int count = 0;
for (int a = 1; a < n; a++)
{
for (int b = 1; b <= (n - 1 )/ a; b++)
{
count += 1;
}
}
std::cout << count<< std::endl;
} | 1 | 88,746,892 |
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#define ll long long
int main()
{
ll N, M;
std::cin >> N >> M;
std::vector<ll> H(N);
std::vector<ll> A(M), B(M);
for(ll i=0; i < N; i++) {
std::cin >> H[i];
}
for(ll i=0; i < M; i++) {
... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> h(n, 0);
rep(i, 0, n){
cin >> ... | 1 | 19,032,386 |
#define _GLIBCXX_DEBUG
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<string>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define rep2(i,s,n) fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,x,y;
cin >> w >> h >> x >> y;
double s=(double)h*w/2;
char p='0';
if(x*2==w&&y*2==h)
{
p='1';
}
cout << fixed << setprecision(15) << s << ' ' << p << endl;
return 0;
} | 1 | 59,458,914 |
# include <iostream>
# include <deque>
# include <math.h>
# include <algorithm>
using namespace std;
int N;
int H;
int a[100005];
int b[100005];
deque< pair<int, char> > katanas;
long long counter=0;
long long throws=0;
bool sortkatanas(pair <int, char> a, pair <int, char> b)
{
if (a.first>b.first)
{
re... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,h;
cin>>n>>h;
int a[n],b[n];
ll x = 0;int c=0;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
}
sort(a,a+n);
sort(b,b+n,greater<int>());
for(int i=0;i<n;i++)
if(b[i]>a[n-1]){
x += b[i];
c++;
if(x>=h)
{
cout<<c<<"... | 1 | 25,177,440 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int r, g;
cin >> r >> g;
cout << 2 * g - r << "\n";
} | #include <bits/stdc++.h>
int main() {
int currentRating, wantedRating;
std::cin >> currentRating;
std::cin >> wantedRating;
int aimingPerformance = 2 * wantedRating - currentRating;
std::cout << aimingPerformance;
} | 1 | 52,366,679 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | 1 | 87,702,614 |
#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>;
ll gcd(ll a, ll b)
{
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
int main()
{
ll a, b;
cin >> a >> b;
ll ans = lcm(a, b);... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e5 + 5;
#define INF 1000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | 1 | 6,423,688 |
#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<int> a(N);
for ... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 1 | 84,823,390 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
char a,b;
cin>>a>>b;
if(a==b)cout<<"H"<<endl;
else cout<<"D"<<endl;
return 0;
} | 1 | 99,726,851 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define repr(i,n) for(int i=(n);i>=0;--i)
#define cinv(n,vec) VL vec(n);rep(i,n)cin>>vec[i]
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_p... | 1 | 22,444,396 |
#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 n; cin >>n;
int num[100005] = {0};
rep(i,n){
int a; cin >>a;
num[a]++; num[a+1]++;
num[a-1]++;
}
int ans = 0;
rep(i,100005){
ans = max(num[i], ans);
}
cout <... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,ans=0;
cin>>n;
vector<int> a(n);
for(i=0;i<n;i++) cin>>a.at(i);
sort(a.begin(),a.end());
auto it1=a.begin();
while(it1!=a.end()){
auto it2=lower_bound(a.begin(),a.end(),(*it1)+3);
ans=max(ans,(int)distance(it1,it2));
it1=lower_bo... | 1 | 88,817,551 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include<bits/stdc++.h>
using namespace std;
#define GO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
const int maxr = 1e5 + 5;
int arr[maxr];
int32_t main()
{
GO;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int ans = 0;
for (int i = 1; i < n; i++) {
int coun... | 1 | 56,478,254 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define INF 1LL<<62
int main() {
ll n,d;
cin>>n>>d;
ll ch[12][12];
for(ll i=0;i<n;i++){
for(ll j=0;j<d;j++){
cin>>ch[i][j];
}
}
ll ans=0;
for(ll i=0;i<n;i++){
for(ll j=i+1;j<n;j++){
long double cnt=0;
for(l... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main()
{
ll n,d,arr[20][20];
cin>>n>>d;
for(int i=0;i<n;i++)
{
for(int j=0;j<d;j++)
{
... | 1 | 42,385,364 |
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
inline int read()
{
int neg=1,num=0;char c=getchar();
for(;!isdigit(c);c=getchar())if(c=='-')neg=-1;
for(;isdigit(c);c=getchar())num=(num<<1)+(num<<3)+c-'0';
return neg*num;
}
int n,m,d;
string str;
char c... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
type... | 1 | 44,467,341 |
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,a,x;
cin>>x>>a;
i=(x<a)?0:10;
cout<<i<<endl;
return 0;
} | #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... | 1 | 44,787,482 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res = res * x % mod;
return res;
}... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define debug(x) cerr<<#x<<": "<<x<<endl;
#define MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int S,W;
cin>>S>>W... | 1 | 20,326,284 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
ll n, l, t, cnt;
ll x[MAXN], w[MAXN], nx[MAXN];
vector< ll > vec;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> l >> t;
for(int i = 0; i < n; i ++)
cin >> x[i] >> w[i], w[i] --;
for(int i =... | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll N, L, T;
cin >> N >> L >> T;
vector<ll> ans;
pair<ll, ll> a[N];
for(ll i = 0; i < N; i++) cin >> a[i].first >> a[i].second;
ll index = 0;
for(ll i = 1; i < N; i++){
if(a[i].second == a[0].second) continue... | 1 | 67,000,033 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int sz;
sz = s.size();
int st;
st = s[0]-'0';
int cnt=0;
for(int i=0; i<sz; i++){
if(st==0){
if(i%2==0){
if(s[i]!='0') cnt++;
}else{
if(s[i]!='1') ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | 1 | 53,172,089 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i... | #include<bits/stdc++.h>
using namespace std ;
int main() {
int D ;
cin >> D ;
if(D == 25){
cout << "Christmas" << endl ;
}
if(D == 24){
cout << "Christmas Eve" << endl ;
}
if(D == 23){
cout << "Christmas Eve Eve" << endl ;
}
if(D == 22){
cout << "Christmas Eve Eve Eve" << e... | 1 | 64,230,613 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
int main() {
int A, B, K; cin >> A >> B >> K;
vector<int> Ans;
rep( i, 1, min( A, B )+1 ) {
if ( A%i == 0 && B%i == 0 ) Ans.push_back(i);
}
cout << Ans.at( Ans.size()-K ) << endl;
} | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 96,474,027 |
#include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main(){
int h, w;
cin >> h >> w;
char s[h][w];
for(int i=0; i<h; ++i){
for(int j=0; j<w; ++j){
cin >> s[i][j];
}
}
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
int cnt = 0... | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
int n, m;
scanf("%d%d", &n, &m);
char arr[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> arr[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < ... | 1 | 11,347,795 |
#include<bits/stdc++.h>
using namespace std;
#define For(start,end) for(int i = (int)start;i<(int)end;i++)
using Int = long long int;
int main(){
int N,Y;
cin>>N>>Y;
bool finish=false;
int a=0,b=0;
for(;a<=N;a++)
{
for(b=0;b<=N-a;b++)
{
if( 10000*a+5000*b+1000*(N-a-b)... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | 1 | 23,636,078 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define rep2(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<... | 1 | 52,054,527 |
#include <iostream>
#include <cctype>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
char ch;
do{
cin.get(ch);
if(islower(ch)) cout<<(char)toupper(ch);
else if(isupper(ch)) cout<<(char)tolower(ch);
else cout<<ch;
}while(ch!='\n');
retur... | #include<iostream>
#include<stdio.h>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c", &ch);
if ( ch == '\n' ) break;
if(isalpha(ch)){
if(islower(ch)){
printf("%c", toupper(ch));
}
else if... | 1 | 5,663,496 |
#include <cstdio>
#include <iostream>
#include <queue>
#define MAX_VERTEXES 100
#define ZERO 0
#define NIL -1
using namespace std;
int n;
int matrix_graph[MAX_VERTEXES+1+1][MAX_VERTEXES+1+1];
int min_path[MAX_VERTEXES+1+1];
int main(){
scanf("%d",&n);
int v_num;
int k;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)... | #include <iostream>
#include <queue>
#include <vector>
const int Max = 100;
int map[Max + 1][Max + 1];
typedef struct{
bool startflag;
int distance;
}State;
int main()
{
int n, k, l, temp;
std::queue<int> q;
std::vector<State> state;
for (int i = 1; i < Max + 1; i++){
for (int j = 1; j < Max + 1; j++){
map[i... | 1 | 37,035,706 |
#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 k, a, b;
cin >> k >> a >> b;
for (int i = a; i <= b; i++) {
if (i % k == 0) {
cout << "OK" << endl;
return 0;
... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#in... | 1 | 51,515,465 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k,n;
cin>>k>>n;
int A[n];
for(int i=0;i<n;i++)
{
cin>>A[i];
}
int d[n];
for(int i=0;i<n-1;i++)
{
d[i]=A[i+1]-A[i];
}
d[n-1]=k-A[n-1]+A[0];
int m=INT_MIN;
int store=0;
for(int i=0;i<n;i++)
{
m=max(m,d[i]);
if(m==d[i])
{
store=i;
... | #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>
#include <iomanip>
#include <limits>
using namespace... | 1 | 98,358,897 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
string abc = "abc";
if (s == abc) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 5,092,064 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll n,a,b; cin>>n>>a>>b;
cout ... | 1 | 51,153,577 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
long long sum=1;
cin>>a;
for (int i = a; i > 0; --i) {
sum*=i;
}
cout<<sum<<endl;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
long long n,h=1;
cin>>n;
for(int i=n;i>1;i--)
h*=i;
cout<<h<<endl;
return 0;
} | 1 | 96,613,670 |
#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(ll i=(a);i<(n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | 1 | 64,764,857 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef vector<int> vi;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int,int>
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j,k;
ll n,m;
cin >> n >> m;
vector<vector<ll>> graph(n,vector<ll>(n,1e9));
for(i = 0;i < n;++i){
graph.at(i).at(i) = 0;
}
vect... | 1 | 99,700,221 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
vector<int> a(4);
for (int i = 0; i < 4; ++i) cin >> a[i];
sort(a.begin(), a.end());
cout << ... | #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() {
vector<int> ans = {1, 4, 7, 9};
vector<int> N(4);
rep(i, 4) cin >> N[i];
sort(N.begin(), N.end());
if(ans == N){
cout << "YES" << endl;
}
else{
c... | 1 | 99,162,239 |
#include<stdio.h>
int main(void)
{
int a,b,c;
scanf("%d %d",&a,&b);
c=a+b;
if(c%3==0 || a%3==0 || b%3==0){
printf("Possible\n");
}
else{
printf("Impossible\n");
}
return 0;
} | #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... | 1 | 18,569,990 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > PP;
typedef... | #include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
typedef struct _data
{
int node;
int weight;
}Data;
vector<Data> vec[100005];
int N, M, chk[100005], dist[100005], result, Count, resultChk[100005];
void BFS()
{
queue<Data> q;
for(int j = 1;... | 1 | 2,891,379 |
#include <iostream>
#include <vector>
int main() {
std::string s; std::cin >> s;
const std::string k = "keyence";
for (size_t i = 0; i <= k.size(); i++) {
bool f = true;
for (size_t j = 0; j < i; j++) {
if (s[j] != k[j]) {
f = false;
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 1 | 59,222,160 |
#include <iostream>
#include <bitset>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
int main() {
int N, K; cin >> N >> K;
int a[N];
for (int i = 0; i < N; i++) cin >> a[i];
ll ans = INF;
for (int bit = 0; bit < (1<<N); bit++) {
int t = bitset<15>(bit).count();
if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
long long ans = LLONG_MAX;
rep(i, pow(2, n)) {
bitset<32> b(i);
int num = 0;
rep(j, 32) {
if(b.test(j)) num++;
}
... | 1 | 47,079,214 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
ll x;
cin >> x;
if (x % 100 == 0) {
cout ... | 1 | 39,784,463 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
std::vector<int> a(n);
std::vector<int> b(n);
rep(i,n) {
int x;
cin >> x;
a.at(i) = x;
b.at(i) = x;
}
sort(b.begin(), b.end());
rep(i,n) {
... | 1 | 17,606,487 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 998244353
int main(){
stri... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | 1 | 19,085,628 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<lint, lint>;
using vec = vector<lint>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
in... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+23;
long long a[N], b[N];
void solve() {
int n; scanf("%d", &n);
long l... | 1 | 8,364,437 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
char s='A', k;
int h, w;
cin >> h >> w;
string a[h][w];
rep(i,0,h){
rep(j,0,w) cin >> a[i][j];
}
rep(i,0,h){
rep(j,0,w){
if(a[i][j]=="snuke"){
k=s+j;
... | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
char s='A', k;
int h, w, c=0;
cin >> h >> w;
string a[h][w];
rep(i,0,h){
rep(j,0,w) cin >> a[i][j];
}
rep(i,0,h){
rep(j,0,w){
if(a[i][j]=="snuke"){
k=s+... | 1 | 57,336,694 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
set<int> as;
map<int, int> am;
for(int i = 0; i < n; i++) {
std::cin >> a[i];
as.insert(a[i]);
}
sort(a.begin(), a.end());
for(auto itr = as.begin(); itr != as.end(); itr++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, ans = 0;
cin >> n;
vector<ll> a(n);
map<ll, ll> b;
for (ll i = 0; i < n; i++)
{
cin >> a.at(i);
b[a.at(i)]++;
}
for (auto itr = b.begin(); itr != b.end(); itr++)
{
if (itr->first != itr->second)
{
... | 1 | 62,597,205 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double n;
cin>>n;
cout<<ceil(n/2)-1<<endl;
return 0;
} | 1 | 100,499,514 |
#include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
using std::cin;
using std::cout... | 1 | 6,878,872 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include <iostream>
int main() {
int A,B,C;
std::cin >> A >> B >> C;
int base = C % A;
int amari;
int i=1;
bool ok =false;
do{
amari = (B*i + C ) % A;
i++;
if(amari == 0){
ok = true;
}
}
while(amari != 0 && amari != base);
if(ok){
... | 1 | 57,750,321 |
#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>
using namespace std;
using ll = long long;
int main()
{
set<char> t;
char a, b, c;
cin >> a >> b >> c;
t.insert(a), t.insert(b), t.insert(c);
cout << ((int)t.size() == 3 ? "Yes" : "No") << endl;
} | 1 | 85,358,762 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s;
cin >> s;
vector<bool> dp(26,false);
rep(i,int(s.size())){
dp[s[i]-'a']=true;
}
rep(i,26){
if(dp[i]==false){
cout << char('a'+i) << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
stri... | 1 | 31,927,354 |
#include <iostream>
using namespace std;
void swap(int &a, int &b){
int temp;
temp=a;
a=b;
b=temp;
}
int main() {
int a,b,c, counter=0;
std::cin>> a>>b>>c;
for(int i=a; i<=b;i++){
if(c % i==0) counter++;
}
std::cout << counter <<std::endl;
return 0;
} | #include "cstdio"
int main(){
int a,b,c,cnt;
scanf("%d %d %d",&a,&b,&c);
for(a;a<=b;a++){
if(c%a == 0) cnt++;
}
printf("%d\n",cnt);
} | 1 | 59,886,779 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | #include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
using namespace std;
ll cnt[300005];
bool vis[300005];
int main() {
int n;
cin >> n;
vector<ll> nn;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
cnt[a]++;
if (!vis[a]) {
vis[a] = 1;
... | 1 | 9,879,787 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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 cout << "no" << endl
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n , c,k;
cin>>n>>c>>k;
ll t[n];
for(int i=0;i<n;i++)
{
cin>>t[i];
}
sort( t , t+n);
int index =0;
ll ans =0;
while( index < n)
{
ll curr = t[index];
ll cap =1;
w... | 1 | 66,465,069 |
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#define all(c) (c).begin(),(c).end()
using namespace std;
int main(void){
int n;
while(cin >> n,n){
vector<int>a(n);
for(int i=0;i<n;i++)cin >> a[i];
sort(all(a));
int ans = 1<<29;
for(int i=0;i+1<n;i++)
ans = min(ans,... | #include <iostream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
while(1)
{
int n,score=10000000;
vector<int> a;
cin >> n;
if(n == 0) exit(0);
for(int i = 0 ; i < n; i++)
{
int tpn;
... | 1 | 90,590,627 |
#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);
int main(){
string s;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int count =0;
for(int i=0; i<N; i++){
if(S.at(i)=='1'){
count ++;
}
}
cout << min(count, N-count)*2 << endl;
} | 1 | 12,111,434 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<deque>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define reps(i,f,n) for(int i = f; i <= n; ++i)
#define eb emplace_back
#define all(x) x.begin(), x.end()
using namespace std;
using PII=pair<int,int>;
using PPI=pair<int,PII>;
using ll=long long;
const l... | #pragma GCC optimize ("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using db = long double;
const int N = 1e5 + 5, MOD = 1e9 + 7;
ll F[N], iF[N], inv[N];
ll C(int n, int k){
if(n<k||k<0||n<0)return 0;
return F[n] * (iF[n-k]*iF[k]%MOD)%MOD;
}
int head[N], tmp1, tmp2;
int main(){
F... | 1 | 16,766,070 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
const int maxn = 10005;
const int mod = 1e9 + 7;
int main... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;... | 1 | 43,638,415 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
int n,m;
main()
{
while(cin>>n>>m,n)
{
int cnt[11]={};
for(int i=0;i<n;i++)
{
int d,p;cin>>d>>p;
cnt[p]+=d;
}
for(int i=10;i>=0&&m;i--)
{
if(m>cnt[i])
{
m-=cnt[i];cnt[i]=0;
}
else
{
cnt[... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) for(int i=0;i<n;i++)
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
int f(pii a){return (a.first*a.first + a.second*a.second)*200 + a.first;}
int main(void){
int ... | 1 | 42,135,653 |
#include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | #include<bits/stdc++.h>
#define N 2000001
#define M 10001
using namespace std;
int n,A[N],B[N],C[M];
void CountingSort(){
for(int i=1;i<=n;i++)C[A[i]]++;
for(int i=1;i<M;i++)C[i]+=C[i-1];
for(int i=n;i>=1;i--)
B[C[A[i]]]=A[i],C[A[i]]--;
}
int main(){
cin>>n;
for(int i=1;i<=n;i++)cin>>A[i];
CountingSort(... | 1 | 72,196,694 |
#include <iostream>
#include <algorithm>
#include<queue>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int N,A,B;
scanf("%d%d%d",&N,&A,&B);
if(B<A)
printf("0\n");
else if(B==A){
printf("1\n");
}
else{
if(N==1)
printf("0\n");
else{... | #include <iostream>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
long long int ans = (long long int)b*(n-1)+a
- ((long long int)a*(n-1)+b) + 1;
if(ans >= 1) cout << ans << endl;
else cout << 0 << endl;
return 0;
} | 1 | 52,194,013 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
#define INX(x) (cin >> x)
#define OUTX(x) (cout << x << endl)
#define ADD emplace_back
#define MP make_pair
#define VVEC(type) vector<vector<ty... | #include<bits/stdc++.h>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long
#define sz(x) (ll)(x.size())
using namespace std;
const int mod = 1e9+7;
int e... | 1 | 10,478,811 |
#include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 2e5 + 5;
int main()
{
int N; scanf("%d", &N);
static LL a[MAXN]; LL sum = 0;
for (int i = 1; i <= N; i++)
{
scanf("%lld", &a[i]);
sum += a[i];
}
LL pre = a[1], mDif = llabs(sum - 2 * a[1]);
for (int i = 2; i < N; i++)
{
pre += a[i];
mDif = ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[200010];
signed main()
{
ios::sync_with_stdio(0);
int n;cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];a[i]+=a[i-1];
}
int ans=1e18;
for(int i=1;i<n;i++)ans=min(ans,abs(a[i]-a[n]+a[i]));
cout<<ans<<endl;
} | 1 | 18,131,496 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int n = 0;
for(int i = A; i <= B; i++){
int x4, x3, x1, x0;
int i0 = i;
x0 = i0 % 10;
i0 /= 10;
x1 = i0 % 10;
i0 /= 100;
x3 = i0 % 10;
i0 /= 10;
x4 ... | #include <iostream>
using namespace std;
int main(){
int a,b,x[5],num,count=0;
cin>>a>>b;
for(int i=a;i<=b;i++){
num=i;
for(int j=0;j<5;j++){
x[j]=num%10;
num/=10;
}
if(x[0]==x[4]&&x[1]==x[3])
count++;
}
cout<<count<<endl;
} | 1 | 22,454,436 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
string s; cin>>s;
rep(i,0,s.size()){
if(s[i]==',') s[i]=' ';
}
... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i= (a); i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() { string s;
cin >> s;
for(... | 1 | 35,649,671 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<double, double> P;
int n;
P naibun(P p1, P p2, double r) {
P dp = P(p2.first - p1.first, p2.second - p1.second);
return P(p1.first + r * dp.first, p1.second + r * dp.second);
}
P tri(P p1, P p2) {
P dp = P(p2.first - p1.first, p2.second - p1.secon... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define double long double
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j) -> bool {... | 1 | 92,536,183 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
ll x, y;
cin >> x >> y;
for (ll i = 0; i <= 100; i++ ){
for (ll j = 0; j<= 100; j++){
if(i+j != x) continue;
if(i*2 + j*4 == y){
cout << "Yes";
return ;
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
bool t=false;
int x,y; cin>>x>>y;
rep(i,x+1){
if(y==i*2+4*(x-i)) t=true;
}
if(t) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 1 | 64,764,381 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
using n... | #define _GLIBCXX_DEBUG
#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,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 1 | 6,968,893 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int X,Y,Z,K;cin>>X... | #include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ordered_set tree<int, null_type,less<i... | 1 | 2,296,782 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main(){
int n,m;cin>>n>>m;
vector<vector<int>> d(n);
vector<int> list(n);
for(int i=0;i<m;i++){
int a,b;cin>>a>>b;
a--;b--;
d[a].push_back(b);
d[b].push_back(a);
}
int ans=0;
for(int i=0;... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector< vector<int> > data(N);
for (int i = 0; i < M; ++i){
int A, B;
cin >> A >> B;
data[A - 1].push_back(B - 1);
data[B - 1].push_back(A - 1);
}
int flag[N];
for ... | 1 | 96,241,665 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <deque>
#include <string>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <map>
#include <unordered_map>
#include <bitset>
#define _crt_secure_no_warn... | #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL)
#define input(arr,n) for(ll i1=0;i1<n;i1++ )cin>>arr[i1]
#define mod 1000000007
#define F first
#define S second
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_po... | 1 | 72,613,190 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#defi... | #include <iostream>
using namespace std;
char S[3];
int main(){
cin >> S;
if(S[0] == S[1] && S[1] == S[2]){
cout << "No";
}
else{
cout << "Yes";
}
} | 1 | 79,151,238 |
#include<bits/stdc++.h>
using namespace std;
#define OUT(x) cout<<x<<endl
#define debug(x) cout<<#x<<": "<<x
const int BA = 1000;
const int INFTY = (1<<21);
int main(){
int n,ans;
int s[1001];
while(cin>>n&&n){
ans = 0;
for(int i=0;i<n;i++)cin >> s[i];
sort(s,s+n);
for(int i=1;i<n-1;i++)ans+=s[i];... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int m = 1001;
int M = -1;
int sum = 0;
for (int i = 0; i < n; i++) {
int score;
cin >> score;
m = min(m, score);
M = max(M, score);
sum += score;
}
cout << ... | 1 | 64,679,503 |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<int,int> m;
for(int i = 0; i < 3; i++) {
int a,b;
cin >> a >> b;
m[a]++;
m[b]++;
}
bool ok = true;
for(auto c : m) {
if(c.second == 3) {
ok = false;
}
}
if(ok) {
... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#def... | 1 | 94,601,719 |
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(void){
int w,h;
int n;
while(cin>>w,w){
cin>>h>>n;
vector<vector<int> > maze(h+1,vector<int>(w+1,0));
int x,y;
for(int i = 0 ; i < n ; i ++){
cin>>x>>y;
maze[--y][--x] = -1;
}
for(int i = 0 ; i < h ; i ++)
if(maze[i]... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <cstring>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
int w, h, n;
int dp[20][20];
bool memo[20][20];
int main(void){
while(1){
rep(i, 20)rep(j, 20){
dp[i][j] = 0;
memo[i]... | 1 | 12,169,184 |
#include <stdio.h>
int main() {
int t,zero = 0,flag = 0;
scanf("%d",&t);
long long int n,max = 1e18,sum = 1;
for(int i=0;i<t;i++){
scanf("%lld",&n);
n>max ? flag = 1 : flag;
sum *= n;
n==0 ? zero = 1 : max /= n;
}
if(zero ==1){
puts("0");
}
else{
flag==1 ? puts("-1") : printf("%... | #include<stdio.h>
int main()
{
long long n;
long long ctr = 1;
scanf("%lld", &n);
long long num[n];
for(int i = 0; i < n; i++){
scanf("%lld", &num[i]);
}
for(int i = 0; i < n; i++){
if(num[i] == 0){
printf("0\n");
return 0;
}
}
for(int i = 0; i < n; i++){
if(num[i] <= 1000000000000000000/ctr){
... | 1 | 74,667,937 |
#include<bits/stdc++.h>
using namespace std;
#define hackcyborg shresth_walia
#define ll long long
#define ld double
#define pb push_back
#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using n... | #include<iostream>
using namespace std;
typedef long long ll;
int main () {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1ll; i < N; i ++) {
ans += ((N - 1) / i);
}
cout << ans << endl;
} | 1 | 96,713,389 |
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
#include <queue>
#include <iomanip>
#include <string>
#include <algorithm>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep_1 (i,j,n) for(int i=j;i<n;i++)
typedef long long ll;
typedef long l;
const ll ... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<int> A(... | 1 | 97,822,989 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ULL;
int main(){
string A, chars="abcdefghijklmnopqrstuvwxyz"; cin >> A;
ULL l=A.size(), ans=l*(l-1)/2+1; map<char, ULL> freq;
for(ULL i=0; i<l; i++){ freq[A[i]]++; }
for(ULL i=0, q=0; i<26; i++){ q=freq[chars[i]]; ans-=q*(q-1)/2; }
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long N = S.size();
map<char, long> MA;
for (long i = 0; i < N; i++) {
MA[S.at(i)]++;
}
long ans = 0;
for (long i = 0; i < N; i++) {
ans += N - MA[S.at(i)];
}
cout << ans / 2 + 1 << "\n";
} | 1 | 90,032,514 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.