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;
long long GCD(long long a, long long b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(GCD(b, a%b));
}
}
int main(){
long long N,X;
cin >> N >> X;
if(N == 1){
long long a;
cin >> a;
cout << abs(a-X) << endl;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using R = __int128;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i... | 0 | 99,754,163 |
#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 pb push_bac... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int mod=1e9+7;
int fac[100005];
int modInverse(int a, int m)
{
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
int q = a / m;
int t = m;
m = a % m, a = t;
t = y;
y ... | 0 | 64,588,776 |
#include<cstdio>
#include<stack>
using namespace std;
int main() {
int n;
stack<int> S;
while(~scanf("%d",&n)) {
if(n)
S.push(n);
else {
printf("%d\n",S.top());
S.pop();
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string a,b;cin>>a>>b;
int x=a.size(),y=b.size();
if(x>y)cout<<"GREATER"<<endl;
else if(x<y)cout<<"LESS"<<endl;
else {
rep(i,x){
if(a[i]<b[i]... | 0 | 80,487,421 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
long step;
cin >> N;
vector<int> h(N);
step = 0;
for (int i = 0; i < N; i++)
{
cin >> h.at(i);
}
for (int i = 0; i < N - 1; i++)
{
if (h.at(i) > h.at(i + 1))
{
step += h.at(i) - ... | #include<cstdlib>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
using namespace std;
const int MAXN = (int) 105;
const int INF = (int) 0x3f3f3f3f;
typedef long long LL;
int m,n;
vector<pair<int,int> > g;
void work(){
while(~scanf("%d%d",&n,&... | 0 | 8,110,104 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
using TI3 = std::tuple<int, int, int>;
us... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 51,377,577 |
#include<bits/stdc++.h>
using namespace std;
int x,y;
int main(){
cin>>x>>y;
if(x<y&&x>1){
cout<<"Bob"<<endl;
}
else if(x>y&&y>1){
cout<<"Alice"<<endl;
}
else if(x<y&&x==1){
cout<<"Alice"<<endl;
}
else if(x>y&&y==1){
cout<<"Bob"<<endl;
}
else if(x=... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,ans=12345678;
cin >> n >> m >> x;
vector<vector<int>> A(n,vector<int>(m));
vector<int> c(n);
for(int i=0;i<n;i++){
cin >> c[i];
for(int j=0;j<m;j++){
cin >> A[i][j];
}
}
for(int mask=0;mask<(1<<n);mask++){
vector<int>... | 0 | 8,463,004 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int ans = 0;
for(int i=1; i<=N; i+=2)
{
int yakusu = 0;
for(int j=1; j*j <= i; j++)
{
if(j*j == i) yakusu++;
... | 0 | 76,863,864 |
#include <bits/stdc++.h>
using namespace std;
bool visited[(int) (1e5 + 2)];
int g[(int) (1e5 + 2)];
int dfs(int curr, int c)
{
if (curr == 2)
{
printf("%d\n", c-1);
return true;
}
if (visited[curr])
{
return false;
}
visited[curr] = true;
return dfs(g[curr], c +... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n=100005;
typedef pair<int,int> P;
#define fi first
#define se second
int n,k;
P p[max_n];
ll solve(vector<P> v,int bit){
if(bit==-1){
ll res=0;
for(auto p:v)res+=p.second;
return res;
}
ll res=0;
ve... | 0 | 30,142,339 |
#include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 89,664,607 |
#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... | #include <iostream>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <utility>
#include <deque>
#include <queue>
using namespace std;
#define ll long long int
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repp(i, n) for(int i = 1... | 0 | 29,472,530 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(a<b){
cout << a*c << endl;
}else{
int n=a-b;
cout << b*c+n*d << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
map<int,int> m;
for(int i=0;i<n;i++)
{
int a;cin>>a;
m[a-1]++;
m[a]++;
m[a+1]++;
}
int ans=0;
for(auto mm:m... | 0 | 62,030,223 |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define modulo ll (1e9 + 7)
typedef long long ll;
typedef pair<int,int> pii;
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
const int N = 2005, M = 26, OO = 0x3f3f3f3f;
const ll llOO = 0x3f3f3f3f3f3f3f3f;
int main(){
init();
... | #include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, d, a;
cin >> n >> d >> a;
vector<pair<long long, long long>> xh(n);
for (int i = 0; i < n; i++) {
cin >> xh[i].first >> xh[i].second;
}
sort(xh.begin(), xh.end());
int cur = 1;
vector<long l... | 0 | 11,250,892 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(),... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) ... | 0 | 55,488,253 |
#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... | #include <ext/rope>
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define read(arr, l, r) for(int i = (l); i < (r); cin >> arr[i++])
#define print(arr, l, r) for(int i = (l); i < (r); cout << arr[i++] << " \n"[i == r])
#define rep(i, l, r) for (i... | 0 | 59,205,893 |
#include <iostream>
void print_rectangle(int& height, int& width);
int main(void)
{
int width, height;
while(true) {
std::cin >> height;
std::cin >> width;
if (height == 0 && width == 0) {
break;
}
print_rectangle(height, width);
}
return 0;
}
void pri... | # include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
... | 0 | 3,974,739 |
#include <iostream>
using namespace std;
int f(int x)
{
return x*x;
}
int main()
{
int d;
while (cin >> d) {
unsigned int ans = 0;
for (int i = d; i < 600; i+=d) {
ans += f(i) * d;
}
cout << ans << endl;
... | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = int(2e5) + 7;
typedef pair<int, int> pii;
int a[N], n, Max;
ll res, sum;
set<int> ... | 0 | 30,877,360 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
string s;
set<char>S;
cin>>s;
for(int i=0;i<3;i++)
{
S.insert(s[i]);
}
if(S.size()==3)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 11,434,599 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
int main() {... | #include<cstdio>
#include<algorithm>
using namespace std;
int yaku[10000];
int array_addr = 0;
void Yakunum(int c){
int i = 1;
while(i != c+1){
if(c % i == 0){
yaku[array_addr] = i;
array_addr++;
}
i++;
}
}
int main(){
int a,b,c,yaku_cout=0;
scanf("%d %d %d",&a,&b,&c);
Yakunum(c);
... | 0 | 77,943,620 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
char X, Y;
cin >> X >> Y;
if(X > Y) {
cout << ">" << endl;
} else if(Y > X) {
cout << "<" << endl;
} else {
cout << "=" << endl;
}
} | #include<iostream>
#include<string>
#include<string.h>
#include<cstring>
#include<math.h>
#include<iomanip>
#include<vector>
#include<cmath>
#include<algorithm>
#include<numeric>
#include<cctype>
#include<utility>
#include<set>
#include<map>
#include<sstream>
#include<iterator>
#include<limits>
#include<map>
#include<d... | 0 | 64,201,459 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if(n < 10) cout << n << endl;
else if(9 < n && n < 100) cout << 9 << endl;
else if(n < 1000) cout << n - 90 << endl;
else if(n < 10000) cout << 909 << endl;
else if(n < 100000) cout << n - 9090 << endl;
else cout << 90909 << end... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | 0 | 5,869,550 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string s;
cin >> s;
string p;
cin >> p;
string s2;
s2 = s + s;
if (s2.find(p)!=-1){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main(){
ll N; cin >> N;
vll A(N);
... | 0 | 59,667,460 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
typedef long long ll;
typedef pair<int,int> pii;
int main(){
int n,k;
cin>>n>>k;
vector<ll> h(n);
ll ans = 1e+15;
rep(i,n){
cin>>h[i];
}
for(int bit=0;bit<(1... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;
#define INF (1 << 30)
priority_queue<int> PQ;
int main() {
string com;
int key;
while( 1 ) {
cin >> com;
if (com == "insert") {
cin >> key;
PQ.push(key);
}
... | 0 | 99,166,043 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int arr[32] = {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, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << arr[K-1] << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <queue>
#include <time.h>
using namespace std;
typedef long long ll;
#define pl pair<ll,ll>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define... | 0 | 100,271,484 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int diff = min(B, D) - max(A, C);
if (diff >=0)
cout << diff << endl;
else
cout << 0 << endl;
} | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
int n;
int main(void){
cin >> n;
vector<lli> r(n+1);
r[0] = 2;
r[1] = 1;
for(int i = 2; i <= n; i++) r[i] = r[i-1]+r[i-2];
cout << r[n] << endl;
return 0;
} | 0 | 42,015,265 |
#include <algorithm>
#include <cstdio>
#define LL long long
using namespace std;
const int N = 1e5 + 5;
int n, m, v, p;
int d[N];
bool cmp(int a, int b) {
return a > b;
}
bool check(int mid) {
if (mid <= p) return 1;
if (d[mid] + m < d[p]) return 0;
if (v < p && d[mid] + m >= d[p]) return 1;
LL ans ... | #include <iostream>
#include <string>
using namespace std;
string reverse_partial(string str, int s, int e) {
string top = s != 0 ? str.substr(0, s - 1) : "";
string head = str.substr(s, e - s + 1);
string tail = str.substr(e + 1, str.size());
string reverse = "";
for (int i=head.size()-1; i >= 0; i... | 0 | 73,893,791 |
#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
using namespace std;
const int N = 1e5 + 5;
i... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<iomanip>
#include<utility>
usi... | 0 | 81,331,623 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(... | 0 | 21,712,724 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <utility>
#include <bitset>
#include <climits>
using namespace std;
typedef long long ll;
constexpr ll INF = ((ll)INT_MAX) << 30;
int main(){
ll V, E, A, B, C;
ll K[128][128];
cin>>V>>E;
for(int i=0;i<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_st... | 0 | 91,398,481 |
#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;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | #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;
using P = pair<int,int>;
using graph = vector<vector<char>>;
const int dx[4]... | 0 | 75,560,585 |
#include <iostream>
using namespace std;
int max(int x,int y){
int z;
(x > y) ? (z = x) : (z = y);
return z;
}
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b || a == c || b == c){
cout << "No" << endl;
return 0;
}
if( c == max(max(a,b),c)){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FOR0(i,n) for(i=0;i<n;i++)
#define FOR(i,j,n) for(i=j;i<n;i++)
#define FORD(i,j,k) for(i=j;i>=k;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define n... | 0 | 3,067,219 |
#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... | #include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <math.h>
#include <algorithm>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll INF = 1000000000000000000LL;
using namespace std;
const int MOD = 1000000007;
string seki[] = {"Vacant", "Male"... | 0 | 35,619,976 |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main(){
int i, j;
char str[21], rev[21];
scanf("%s", str);
i = 0; j = 0;
while(str[i] != '\0') i++;
i--;
while(i >= 0){
rev[j] = str[i];
i--; j++;
}
... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(is... | 0 | 10,040,368 |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
using namespace std;
using LL... | #include <iostream>
#include <cassert>
#include <queue>
#define INF 922337203685477580
typedef long long ll;
using namespace std;
void countingSort(int* A, int* B, int k, int n) {
int C[k + 10];
for (int i = 0; i <= k + 5; i++) {
C[i] = 0;
}
for (int j = 0; j < n; j++) {
C[A[j]]++;
}
for (int i = 1;... | 0 | 80,004,402 |
#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>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
#define DUMP(a) REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2D(b) REP(_j, b.size(... | 0 | 82,700,207 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using Graph ... | #include <iostream>
using namespace std;
void solve()
{
int N;
cin >> N;
int sum = 100000;
for(int i = 0; i < N; ++i)
{
sum *= 1.05;
if(sum % 1000 != 0)
{
sum += 1000 - (sum % 1000);
}
}
cout << sum << endl;
}
int main()
{
solve();
return(0... | 0 | 47,929,856 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repc(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 + ... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | 0 | 90,842,744 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = round(1e9+7);
int main() {
int n; cin >> n;
vi a(n); rep(i,n) cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int a, b, k;
cin >> a >> b >> k;
for (int i = 1; i <= k; ++i) {
if(i % 2 == 0) {
b /= 2;
a += b;
}
else {
a /= 2;
... | 0 | 16,120,402 |
#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 repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int ans = 111;
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 2e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, H;
cin >> N >> H;
vector<int> a(N),b(N);
for (int i=0;i<N;i++) cin >> a[i] >> b[i];
sort(a.rbegin(),a.rend());
sort(b.rbegin(),b.rend());
... | 0 | 83,712,431 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<map>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main(){
int N; ll K, cnt; cin >> N >> K;
vector<pair<int, int> > p(N);
for(int i=0; i<N; i++) cin >> p[i].first >> p[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c)... | 0 | 60,561,811 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(int i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb puah_back
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(){
int ... | 0 | 49,854,736 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<list>
#include<queue>
#include<string.h>
#include<functional>
#include<stack>
#include<deque>
#include<string>
#include<limits.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#define int long long
using name... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define... | 0 | 62,493,178 |
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
typedef long long int ll;
using namespace std;
ll x, y;
ll MOD = 1000000000 + 7;
ll mod = 1000000000 + 7;
ll modpow(ll a, ll n, ll mod)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
{
res = res * a % mod;
... | #include <stdio.h>
int main(int argc, char *argv[])
{
int t;
scanf("%d",&t);
int a[100000];
int count[100005]={0};
for(int i=0;i<t;i++){
scanf("%d",&a[i]);
if(a[i]==0){
count[a[i]]++;
count[a[i]+1]++;
}
else{
count[a[i]]++;
count[a[i]-1]++;
count[a[i]+1]++;
}
}
int max=count[0];
for(int... | 0 | 768,446 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,K;
cin >> N >> K;
vector<long long> A(N);
for(int i=0;i<N;i++){
cin >> A.at(i);
}
long long right=0;
long long all=0;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(A.at(i) > A.at(j)) all++;
}
for(int j=i+1;j<N;j... | #include <iostream>
#include <vector>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <string>
using namespace std;
int main(int argc, const char * argv[]) {
while(1){
string yn = "yes";
string str;
vector<char> st;
getline(cin, str);
if (str == ".") {
... | 0 | 70,678,703 |
#include<iostream>
#include<string>
#include<vector>
#include<numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> s[i] >> t[i];
string x;
cin >> x;
int ans = accumulate(t.begin(), t.end(), 0);
for (int i = 0; i < n; i++)... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i,m,j,l,n,a=0,b,x=10000000000;
vector<long long int>ar;
cin>>n;
for(i=0;i<n;i++){
cin>>j;
ar.push_back(j);
}
long long int sum=0;
for(l=0;l<n;l++){
sum+=ar[l];
}
for(m=0;m<n-1;m++){
a+=... | 0 | 20,215,468 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0;
bool f = true;
while (f) {
f = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i-1]) {
s.erase (i-1, 2);
ans += 2;
i --;
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int coin[10] = {0, 1, 2, 3, 4, 1, 2, 3, 4, 5};
int main(){
int n, ans;
while(true){
cin >> n;
if(n == 0){
break;
}
n = 1000 - n;
ans = 0;
for(int loop = 0; loop < 4; loop++){
ans += coin[n % 10];
n /=... | 0 | 54,112,447 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int n, i, j, k;
int b, f, r, v;
int count[4][3][10] = {0};
scanf("%d", &n);
for(i = 0; i < n; i++){
scanf("%d %d %d %d", &b, &f, &r, &v);
count[b - 1][f - 1][r - 1] += v;
}
for(i = 0; i < 4; i++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,k;
cin >> n >> k;
k=min(k,50LL);
vec a(n);
for(ll i=0;i<n;i++) {
cin >> a[i];
}
priority_queue<ll,vec... | 0 | 29,130,663 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
using namespace std;
int main()
{
int n;
cin >> n;
string taro, hanako;
int tarop = 0, hanakop = 0;
for (int i = 0; ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <queue>
#include <stack>
#include <bitset>
#include <set>
#include <chrono>
#include <string>
#include <assert.h>
using namespace std;
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(0);
cin.tie... | 0 | 18,349,970 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
int A[110];
cin >> N;
for (int i = 0; i < N; ++i){
cin >> A[i];
}
int M = A[0];
int m = A[0];
for (int i = 0; i < N; ++i)
{
if(A[i] > M){
M = A[i];
}
if(A[i] < m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
#define pb push_back
int main(void){
ll h,n;
cin>>h>>n;
vector<pair<ll,ll>>p(n);
rep(0,i,n){
cin>>p[i].first>>p[i].second;
}
ll dp[h+1];
rep(0,i,h+1)dp[i]=(ll)1e9;
dp[0]=0;
... | 0 | 54,635,862 |
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
namespace
{
static std::array<int, 1000001> ng_nums = {};
static std::array<int, 1000001> num_count = {};
}
namespace ABC170
{
class D
{
public:
D() = default;
~D() = default;
void Run()
{
int N;
std::cin >... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | 0 | 47,858,884 |
#include<iostream>
#include<algorithm>
#include<vector>
#include <iomanip>
#include <cmath>
#include <string.h>
#include <stdio.h>
using namespace std;
int main(){
int A,B,K;
cin >> A >> B >> K;
vector<int>n(110);
int C = min(A, B);
for(int i=1; i<=C; i++){
if(A%i==0 && B%i==0)
n.at(i) =i;
}
sort... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int N;
vector<int> G[200005];
vector<int> color;
ve... | 0 | 75,237,609 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
using Graph = vector<vector<int>>;
int main() {
string S,T;
cin >> S >> T;
int s = S.size();
int t = T.size();
if (t-s > 0) {
cout << "UNRESTORABLE" << endl;
return 0;
}
for(int i=... | #include <iostream>
#include <string>
using namespace std;
int h, w, d;
int main() {
cin >> h >> w >> d;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
int a = ((i + j + 1000) / d) % 2;
int b = ((i - j + 1000) / d) % 2;
cout << "RGBY"[a * 2 + b];
}
cout << endl;
}
return 0;
} | 0 | 2,547,084 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<math.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define mod 1000000007
using namespace std;
int main(){
vector<int> num;
int inputNum;
while(true){
cin>>inputNum;
if(inputNum==0){
break;
}
... | 0 | 49,419,523 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> V(N);
for (long long i = 0; i < N; i++)
cin >> V.at(i);
vector<long long> W(N,0);
for (long long j = 0; j < N; j++)
W.at(V.at(j) - 1)++;
vector<long long> X(N);
for (long long k = 0; k < N; k++)
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int a,b,x;
cin >> a >> b >> x;
if(2*x<a*a*b){
double l=0,r=90;
for(int i=0;i<10000;i++){
double m=(l+r)/2;
if(a*b*b*tan((90-m)/180*M_PI)/2<x) r=m;
else l=m;
}
cout << fixed << setprecision(10);
co... | 0 | 47,339,763 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n,m;
cin >> n >> m;
cout << ((n-m) *100 + 1900*m )* (1LL<<m) << endl;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 59,320,191 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
for(int i=0;i<N;i++){
cin >> A[i];
sum += A[i];
}
ll addPerCycle = (N*(N+1))/2;
if(sum%addPerCycle != 0){
cout <<"NO" << endl;
retur... | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define reps(i,s,n) for(int i=s;i<n;i++)
#define rep_bit(n) for (int bit = 0; bit < (1<<n); ++bit)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ll long long
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
using namespace std;
... | 0 | 16,786,981 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef ... | #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 | 83,249,416 |
#include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespac... | 0 | 96,792,011 |
#include <bits/stdc++.h>
#define Maxn 100007
using namespace std;
int n,m,v,p;
int a[Maxn],b[Maxn];
bool check(int id)
{
int tmp=a[id]+m;
int now=0;
for (int i=1;i<=n;i++)
if (i!=id) b[++now]=a[i];
long long res=1LL*p*m;
for (int i=p;i<=now;i++)
{
if (b[i]>tmp) return false;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define per(i,n) for (int i = (n)-1; i >=0; --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
int w,h,n;
cin>>w>>h>>n;
int minx=0, maxx=w, miny=0, maxy=h;
int x,y,a;
rep(i... | 0 | 52,942,061 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template<class T>
using reverse_priority_queue = priority_queue<T, vector<T>, great... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e6;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
int main(){
ll n;
cin>>n;
ll a[n];
for(ll i=0;i<n;++i){
... | 0 | 99,540,550 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,ans=1,k;
cin>>n>>k;
ans=k;
for(int i=2;i<=n;i++)
{
ans*=(k-1);
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#de... | 0 | 11,920,405 |
#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() {
ll N, C, K;
cin >> N ... | #include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cmath>
#include<iterator>
#include<cstdlib>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define test IOS long long t;cin >> t;while(t--)
#define ses "\n"
#define whp " "
#define mxi 200003
#define mp make_pair
#define PII pair... | 0 | 55,285,543 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 16,010,622 |
#include <iostream>
#include <queue>
using namespace std;
int main(){
priority_queue <int> a;
int tmp1;
string tmp2;
while(cin>>tmp2,tmp2!="end"){
if(tmp2[0]=='i'){
cin>>tmp1;
a.push(tmp1);
}
else{
cout<<a.top()<<endl;
a.pop();
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
using namespace std;
int main()
{fast;
ll t =1;
while(t--){
ll h,w,m;
cin>>h>>w>>m;
vector<ll> a[h+1], b[w+1];
map<ll,bool> che[h+1];
ll ma=-1, mi... | 0 | 47,784,796 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c, x, y, yu;
cin>>a>>b>>c;
x=b;
y=c;
yu=a-b;
y=y-yu;
if(y<0)
cout<<0;
else
cout<<y;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#define M 1000000000000000000LL
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) ... | 0 | 61,101,991 |
#include<iostream>
using namespace std;
#define int long long int
int32_t main()
{
int n,k;
cin>>n>>k;
int answer=n-k+1;
cout<<answer<<endl;
} | #include<stdio.h>
main(){
int H,W;
int i,j;
while(1){
scanf("%d %d",&H,&W);
if(H == 0 && W == 0) break;
for(i=1;i<=W;i++){
printf("#");
}
printf("\n");
for(i=2;i<=H-1;i++){
printf("#");
for(j=2;j<=W-1;j++){
printf(".");
}
printf("#\n");
}
for(i=1;i<=W;i++){
printf("#");
}
pr... | 0 | 67,949,864 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int selectionSort(vector<int> &A) {
int swapcount = 0;
for (size_t i = 0; i < A.size() - 1; i++) {
size_t minj = i;
for (size_t j = i + 1; j < A.size(); j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (min... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 20,512,310 |
#include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if(a < b)
std::cout << "a < b";
else if(a > b)
std::cout << "a > b";
else
std::cout << "a == b";
std::cout << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
int main()
{
ios_base::sync_with_stdio(false);
ci... | 0 | 948,145 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#endif
const int MAXN = 100;
const ... | 0 | 81,291,461 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
ll N, K;
int main(int argc, char **argv)
{
cin >> N >> K;
ll ma = (... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
void minimization()
{
int n, k;
cin >> n >> k;
cout << ceil((float)(n - 1) / (float)(k - 1)) << "\n";
}
void linear_approximation()
{
int n;
cin >> n;
vector<int> b(n);
for (int i = 0; i < n; ++i)
{
int ... | 0 | 68,781,925 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N,M;
cin >> N >> M;
if(N == 1){
if(M != 1){
cout << M-2 << endl;
return 0;
}
else{
cout << 1 << endl;
return 0;
}
}
else if(M == 1){
if(N != 1){
cout << N-2 << endl;
return 0;
}
... | #include <iostream>
#include <map>
#include <vector>
#define rep(i,n) for(int (i)=0;(i)<(n);++(i))
using namespace std;
using ll = long long;
int main() {
int n;
ll m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> s(n + 1, 0);
rep(i, n) s[i + 1] = s[i] + a[i];
map<ll,... | 0 | 42,923,805 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
if(s.size()<=n)
{
cout<<s;
}
else{
for(int i=0;i<n;i++)
{
cout<<s[i];
}
cout<<"...";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll h,w;
cin >> h >> w;
string s[h];
vector<vector<char>> t(h, vector<char>(w));
rep(i,h) cin >> ... | 0 | 27,215,292 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s, t;
cin >> s >> t;
string u = s;
rep(i, s.size())
{
if (u.substr(0, s.size()) == t)
{
cout << "Yes" << endl;... | #include<bits/stdc++.h>
using namespace std;
class uf{
int n;
vector<int> rank, parent;
public:
uf();
uf(int _n){
init(_n);
}
void init(int _n){
n = _n;
rank.resize(n);
parent.resize(n);
for (int i = 0; i < n; i++) {
rank[i] = 0;
parent[i] = i;
}
}
int find(int x){
... | 0 | 75,808,967 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b)
{
if ... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#define int long long
#define mod 1000000007
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x) x.begin(),x.end()
using namespace std;
int n, sum;
int... | 0 | 26,041,913 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) ... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
cin>>n;
double m,a[n];
cin>>m;
double sum=0;
for(i=0;i<n;i++)
{
cin>>a[i];
... | 0 | 75,783,175 |
#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 debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
ll n,k;
cin >> n >> k;
string s;
cin >> s;
vector <ll> t;
ll k3=0;
int m;
rep(i,n){
if(k3==0){
if(s[i]=='0'){
... | 0 | 12,964,509 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
vector<int> cost(1000000);
vector<vector<int>> data(1000000);
vector<int> divide(string str){
vector<int> divide(str.length());
f... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 4,443,027 |
#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 ... | #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;... | 0 | 24,501,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+10;
const int mod = 1e9+7;
vector<int> g[N];
ll w[N], b[N];
void dfs(int v, int p) {
w[v] = b[v] = 1;
for(auto i: g[v]) {
if(i==p) continue;
else {
dfs(i, v);
w[v] *= (w[i]+b[i]);
b[v] *= w[i];
w[v] %= mod;
b[v] %... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
int main(){
int n,k,m;
cin>>n>>k;k--;
rep(i,n){
if(m==1) continue;
int a;
cin>>a;
if(a==1){
m=i;
... | 0 | 33,460,289 |
#include <stdio.h>
#define max(a,b) a>b?a:b
#define min(a,b) a>b?b:a
int main(void){
long long n, i, a, s = 0, M = -1000000, m = 1000000;
scanf("%lld",&n);
for(i = 0;i < n;i++){
scanf("%lld",&a);
s += a;
M = max(M,a);
m = min(m,a);
}
printf("%lld %lld %lld\n",m,M,s);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define fr(i,s,e) for(i=s;i<e;i++)
#define rf(i,s,e) for(i=s-1;i>=e;i--)
#define pb push_back
#define eb emblace_back
#defin... | 0 | 24,819,580 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
map<int,int>mp;
for (int n = 0;n<N;++n) {
int num;
cin >> num;
mp[num] = n;
}
set<int>S;
S.insert(-1);
S.insert(N);
long long ans = 0;
for (int n = N; n > 0; --n) {
int num = mp[n];
S.insert(num);
set<int>::iterator it =... | #include<bits/stdc++.h>
using namespace std;
using vl = vector<long long>;
using vpl = vector<pair<long long, long long>>;
using vs = vector<string>;
using pl = pair<long long, long long>;
using ll = long long int;
using vb = vector<bool>;
struct hash_pair {
template <class T1, class T2>
size_t operator()(const p... | 0 | 20,084,759 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str, str1, str2;
int m, h;
while(1){
cin >> str;
if( str[0] == '-') break;
cin >> m;
for( int j = 0; j < m; j++){
cin >> h;
str1 = str.substr(0, h);
str2 = str.substr(h, str.size() - h);
str = str... | #include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
struct edge {
int to, cost;
};
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
... | 0 | 51,826,653 |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
#include <stack>
#incl... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,L;
cin >> N >> L;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
ll l=-1,r=-1;
for(int i=1;i<N;i++){
if(A[i-1]+A[i]>=L){
l = i-1;
r=i;
break;
... | 0 | 71,566,742 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <typename T> inline void print(T val) { cout << val << '\n'; }
template <typename Iterator> inline void print(Iterator begin, Iterator end) {
for (auto it = begin; it != end; it = next(it)) {
cout << *it <... | #include<iostream>
#include<vector>
#include<iomanip>
using namespace std;
vector<int> bignum(1,1);
const int e9=1000000000;
void fact(int n);
void multi(int num);
void output();
int main()
{
int n;
cin>>n;
fact(n);
return 0;
}
void fact(int n)
{
for(int i=1;i<=n;i++)
{
multi(i);
}
output();
}
void multi(int... | 0 | 65,232,720 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << " "; cout << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l, r) for(int i = (l); i <= (r); +... | #include <bits/stdc++.h>
#define ll long long
const int N = 5000001;
using namespace std;
int n,m;
int solve(int row,int column,vector<vector<char> > &v,vector<vector<int> > &dp)
{
int count=0;
if((row>=n)||(column>=m))
return 0;
if((row==n-1)&&(column==m-1))
return 1;
if(v[row][column]=='#'... | 0 | 96,509,568 |
#include <iostream>
#include<vector>
using namespace std;
int N, A, B;
vector<int> V;
int C[300005];
int main(void) {
cin >> N >> A >> B;
if (A + B >= N + 2 || (long long int) A*B < (long long int) N) {
cout << -1 << endl;
}
else {
int num = N;
for (int i = 1; i <= A; i++) { C[i] = 1; num--; }
for (int i = ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 60,558,658 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
int vx[4] = {0,1,0,-1};
int vy[4] = {1,0,-1,0};
int re[1002][1002];
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
using namespace std;
int main(){
int N;
string S;
int ans=0;
cin>>N>>S;
for (int i=0;i<=999;i++){
int c[3]={i/100,(i/10)%10,i%10};
int f=0;
for (int j=0;j<N;j++){
if(S[j]==('0... | 0 | 62,669,273 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define Forn(i, n) for(int i=1; i<=(n); i++)
#define forn(i, n) for(int i=0; i<(n); i++)
#... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define CST(x) cou... | 0 | 22,810,751 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
int N, M;
void func()
{
cin >> N >> M;
vector<vector<int>> land(N + 1, vector<int>(0));
rep(i, 0, M)
{
int a, b;
cin >> a >> b;
land[a].push_... | 0 | 16,245,698 |
#include <bits/stdc++.h>
using namespace std;
int main(){
#define int long long
int answer = 0;
string S, FS = "";
cin >> S;
for(int i = 0; i < (int) S.size(); i++) {
if(S.at(i) != 'x'){
FS += S.at(i);
}
}
for(int i = 0; i < (int) FS.size(); i++) {
if(FS.at(i) != FS.at((int) FS.size() - ... | #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 <tuple>
#include <numeric>
#define... | 0 | 31,299,366 |
#include <bits/stdc++.h>
using namespace std;
int main () {
double w,h,x,y;
cin >> w >> h >> x >> y;
int a=0;
if(x==w/2 && y==h/2) a=1;
cout << w*h/2 << " " << a << endl;
return 0;
} | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
string str;
int ans[100] = {0};
while(getline(cin, str)){
rep(i,str.size()){
if(str[i] >= 'A' && str[i... | 0 | 47,874,289 |
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
int a,b;
char s;
cin>>a>>s>>b;
(s=='+')?cout<<a+b:cout<<a-b;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | 0 | 3,889,214 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=1;i<=n;i++)
signed main(){
int n,m;
int x;
int mod=1e9+7;
cin>>n>>m;
int sx=0,sy=0;
rep(i,n)cin>>x,sx+=(i-1)*x-(n-i)*x,sx%=mod;
rep(i,m)cin>>x,sy+=(i-1)*x-(m-i)*x,sy%=mod;
cout<<(sx*sy)%mod<<endl;
return 0;
} | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 0 | 14,550,759 |
#define _USE_MATH_DEFINES
#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()
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 33,374,745 |
#include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int)n;i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int sum = 0;
for(int i = 1; i <= n; i++){
sum += i;
if(sum >= n){
for(int j = 1; j <= i; j++){
if(j != sum - n) cout << j << endl;
}
return 0;
}
}
... | 0 | 83,475,825 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double real;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
string t = "keyence";
int cnt = 0;
for (int i = 0; i < 7; i++) {
if (S[i] == t[i]) {
cnt++;
}
}
if (cnt == 7) {
cout << "YES" << endl;
return 0;
... | 0 | 20,636,411 |
#include <stdio.h>
#include <math.h>
int main(){
double a,b,t;
scanf("%lf%lf%lf",&a,&b,&t);
printf("%lf\n%lf\n%lf\n",(sin(t*3.14159265359/180)*a*b)/2,a+b+sqrt(a*a+b*b-2*a*b*cos(t*3.14159265359/180)),sin(t*3.14159265359/180)*b);
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 | 47,422,215 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b;
cin>>a>>b;
long long pre=0;
if(a==b)
{
cout<<a<<endl;
return 0;
}
long long c=a;
while((c^(c+1))!=1L && c<b)
{
pre^=c;
c++;
}
if(c!=b)
{
long long d=(b-c)%4;
if(d==0)pre^=b;
else if(d==1)pre^=1;... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 0 | 64,622,854 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
int n,s;
while(cin>>n,n){
cin>>s;
int mins=s,maxs=s,sum=s;
rep(i,n-1){
cin>>s;
mins = min(mins,s);
maxs = max(maxs,s);
sum += s;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> lll;
const ll MOD = 1000000007;
const ll INF = 1e9+5;
const double eps = 1e-7;
cons... | 0 | 44,059,126 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
int max=0;
int second=0;
int maxcount=0;
cin>>N;
vector<int>A(N);
for(int i=0;i<=N-1;i++){
cin>>A[i];
if(A[i]>max){
maxcount=1;
if(max>second)second=max;
max=A[i];
}
else if(A[i]==max){
maxc... | 0 | 29,886,539 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int x,y;
cin>>x>>y;
for (int c = 0; c <=x; ++c)
{
int t = x-c;
if(2*c+4*t==y){
cout<<"Yes";
return 0;
}
}
cout... | #include <iostream>
#include<iomanip>
#include <map>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <queue>
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define NO cout<<"NO"<<endl;
#define YES cout<< "YES"<<endl;
#define No cout<< "No"<<endl;
#define Yes cout<< "Yes"<<en... | 0 | 89,924,939 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.