code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#define ll long long
#define repeat(i, x) for(register ll i = 0; i < x; i++)
using namespace std;
int main()
{
string S; cin >> S;
if(S[0] == 'R' || S[1] == 'R' || S[2] == 'R') {
if(S[0] == 'R' && S[1] == 'R' && S[2] == 'R') {
cout << 3 << endl;
}else if(S[1] != '... | #include <iostream>
#include <algorithm>
using namespace std;
long long N, X, p, l, c;
long long A[100100];
int main() {
cin>>N;
for(int i=1; i<=N; i++) {
cin>>A[i];
}
sort(A+1,A+N+1);
for(int i=N; i>=1; i--) {
if(A[i]==A[i-1]) {
p=A[i];
c=i-2;
bre... | 0 | 19,155,530 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
typedef std::pair<float,float> point;
typedef std::vector<point> segments;
void print_array(segments list)
{
for(int i = 0; i < list.size(); ++i){
std::cout << list[i].first<<" "<<list[i].second<< std::endl;
}
}
void print_point(point p... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> graph(10, vector<int>(10, 0));
rep(i, m) {
int x, y;
cin >> x >> y;
graph[x... | 0 | 45,509,793 |
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,k;
std::cin >> n>>k;
vector<ll> a(n);
vector<ll> psum(n+1);
vector<ll> sum( n+1);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
sum[i+1] = s... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,cnt=0,... | 0 | 20,727,736 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
ll sqrt(ll in){
ll ok = 0;
ll ng = 1e9 + 1;
while(ng - ok > 1){
ll mid = (ok + ng) / 2;
if(mid * mid < in){
ok = mid;
} else {
ng = m... | #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 | 41,849,504 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string s, ans;
cin >> s;
for (int i = 0; i < s.size();... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 82,107,661 |
#include <iostream>
int main()
{
int A, B, C;
std::cin >> A >> B >> C;
if(A + B >= C){
std::cout << "Yes";
}else{
std::cout << "No";
}
return 0;
} | #include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<complex>
#include<stack>
#include<cmath>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#ifdef __BORLANDC__
typedef __int64 ll;... | 0 | 9,281,458 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
int s;
cin >> s;
bool exist[1000001] = {};
int ai = s, ans = 1;
while (exist[ai] == false) {
exist[ai]... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
v... | 0 | 58,383,449 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, l;
cin >> n >> l;
vector<string> vs;
for(int i = 0; i < n; i++){
string s; cin >> s;
vs.push_back(s);
}
sort(vs.begin(), vs.end());
for(string s : vs)
cout << s;
}
int main(){
ios_base::sync_with_s... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,j) for(int i=0;i<j;i++)
int main(){
while(1){
int m = 0, f = 0, r = 0;
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1){
break;
}
if(m == -1 || f == -1)... | 0 | 26,131,719 |
#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 ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
int n,i;
cin >> n >> i;
cout << n-i+1 ... | #ifdef LOCAL
#include "libs/debug/print_list.hpp"
#define debug(x) (cout << # x ": " << x << endl)
#define dev(v, m, n) for(int i=0;i<n;++i){for(int j=0;j<m;++j){cout<<"|"<<v[j][i];}cout<<"|"<<endl;}
#endif
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
... | 0 | 62,635,055 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rad_to_deg(rad) (((rad)/2/M_PI)*360)
using ll = long long;
using namespace std;
int gcd(int a, int b) {
if(b == 0) return a;
return gcd(b, a % b);
}
int main(){
ll a,b;
cin>>a>>b;
ll ans=a*b/gcd(a,b);
cout<<ans<<end... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n, m;
bool used[10000];
vector<int> vs;
vector<int> ans;
vector<int> es[10000];
vector<int> res[10000];
void add_edge(int u, int v) {
es[u].push_back(v);
res[v].push_back(u);
}
void dfs1(int v) {
used[v] = true;
for (int i... | 0 | 30,514,735 |
#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 n;
cin >> n;
vector<vector<bool>> G(n, vector<bool>(n));
rep(i, n)
{
int u, k;
cin >> u >> k;
rep(j, k)
{
... | #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 n;
vector<int> G[200020];
vector<ll> P(200020),A(200020);
vector<ll> par(200020,-1);
void dfs(int u){
A[u]=P[u]+A[par[u]];
for(auto x:G[u]){
if(par[x]!=-... | 0 | 86,296,362 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
typedef long long ll;
const long long inf = 1e9+7;
const long long mod = 1e9+7;
int main(){
... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
std::string S;
std::cin >> S;
std::array<int, 26> a;
for (int i = 0; i < 26; i++) {
a.at(i) = 0;
}
for (int i = 0; i < S.size(); i+... | 0 | 67,854,663 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin >> n >> d;
double dist=0;
int count=0;
vector<vector<double>> x(n, vector<double>(d));
for(int i=0; i<n; i++){
for(int j=0; j<d; j++){
cin >> x.at(i).at(j);
}
}
for(int i=0; i<n-1; i++){
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 33,593,066 |
#include<bits/stdc++.h>
using namespace std;
bool y(int n){
int ans = 0;
for(int i = 1; i <= n; i++){
if(n % i == 0) ans++;
}
return ans == 8;
}
int main(){
int n;
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
if(y(i) && i % 2 == 1) ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int q;
scanf("%d", &q);
for(int o = 1, x, y; o <= q; ++o) {
scanf("%d%d", &x, &y);
if(x == y) {
printf("%d\n", 2 * (x - 1));
} else {
if(x > y) swap(x, y);
ll pos = 1ll * x * y, gg = sqrtl(pos - 1);
... | 0 | 98,437,489 |
#include <bits/stdc++.h>
using namespace std;
#define start_routine cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); int begtime = clock();
#define end_routine int endtime = clock(); cerr << endl << "Time elapsed: " << (endtime - begtime)*1000/CLOCKS_PER_SEC << " ms"; return 0
#define contests_de_diya_kar 0
#... | # include <bits/stdc++.h>
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define rep2(x,y,w,h) rep (x, w) rep (y, h)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define reps2(x,y,w,h) reps (x, w) reps (y, h)
# define rrep(i,n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i,n) for(i... | 0 | 90,666,230 |
#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;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v... | #include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int INF = 100000000;
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};
typedef pair< int, int > point;
int h,w,n;
char map[1002][1002];
int x[10],y[10];
int ans = 0;
int main(){
scanf("%d %d %d",&h,&w,&n);
for(int i=0;i<=h+1;i++){
for(i... | 0 | 2,194,119 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 2000000000
#define MAX 100001
#define ll long long
#define ld long double
#define vi vector<int>
#define pa pair<int, int>
#define pb push_back
#define mp make_pair
#define INIT ios::sync_with_stdio(false);cin.tie(0);
#define VAR(type, ...... | #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()
const string YES = "Yes";
const string NO = "No";
int main(){
ll n;
cin >> ... | 0 | 20,933,238 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
using namespace std;
int n, ct = 0;
bool p[1000001];
int main(){
for (int i = 0; i < 1000001; i++) p[i] = 1;
for (int i = 2; i < 1000; i++){
if (p[i] == 1){
for (int j = 0; i*(j + 2) < 1000000; j++){... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;
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... | 0 | 2,930,407 |
#include<iostream>
#include<bits/stdc++.h>
#include<climits>
#define forn(x,n,s) for(int i = x; i < n; i += s )
#define forr(x,n,s) for(int i = x; i>=n; i -= s)
using namespace std;
void go(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("out... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a;
int b;
cin >> a;
cin >> b;
if ( a > b ) {
cout << "a > b"<< endl;
} else if ( a < b ) {
cout << "a < b"<< endl;
} else if ( a == b ) {
cout << "a == b" << endl;
}
return 0;
} | 0 | 4,616,615 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define ll long long int
#define db double
#define SORTA(v) sort(v.begin(),v.end())
#define SORTD(v) sort(v.begin(),v.end(),greater<>())
#define... | 0 | 19,054,255 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int A[10];
int i;
for(i=0; i<10; i++){
cin >> A[i];
}
sort(A, A+10);
cout << A[9] << endl;
cout << A[8] << endl;
cout << A[7] << endl;
} | #include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
#define ll long long
#define ar array
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
cout << (N*800)-(N/15*200) << endl;
return 0;
} | 0 | 87,528,953 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | 0 | 22,519,700 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int N = 200005;
const ll mod = 2000000011;
#define ld long double
#define PI 3.14159265358979323846
const int INF = 10000000;
void flash()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.setf... | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAX_W (100000L)
#define MAX_H (100000L)
#define INF (1000000000L)
using namespace std;
int main(int argc, char *argv[]) {
long W, H, ps[MAX_W + 1], qs[MAX_H + 1];
scanf("%ld %ld", &W, &H);
for (int i = 0; i < W; i++) {
scanf("%ld", &ps[i]);
... | 0 | 88,512,593 |
#include <stdio.h>
int main(void) {
long long a, b;
scanf("%lld%lld", &a, &b);
if(a >= b - 1 && a <= b + 1) printf("Brown");
else printf("Alice");
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | 0 | 12,730,166 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >>a>>b>>c;
if(a+b < c || a>c) cout <<"NO"<<endl;
else cout <<"YES"<<endl;
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 0 | 32,569,702 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
string s[n];
int min_size = 50;
int index;
for(int i = 0; i < n; i++){
cin >> s[i];
}
string ans = "";
for(char i = 'a'; i <= 'z'; i++){
int min_count_char = 5... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 0 | 23,864,697 |
#include <stdio.h>
int main() {
char str[21];
scanf("%s", &str);
for (int i = 0; i < 19; i++) {
if (i != 5 && i != 13) {
printf("%c", str[i]);
}
else if (i == 5 || i == 13) {
printf(" ");
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> V(H, vector<char>(W));
for (int i=0; i<H; i++) {
for (int j=0; j<W; j++) {
cin >> V[i][j];
}
}
set<int> h, w;
for (int i=0; i<H; i++) {
h.insert(i);
}
for (int i=0; i<W; i++) {
... | 0 | 30,827,207 |
#include <bits/stdc++.h>
#define io ios_base::sync_with_stdio(0);cin.tie(0);
#define mod 1000000009
#define pi 2*acos(0)
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
using namespace std;
int main()
{
io;
int a, b; cin >> a >> b;
int arr[4] = { 0 };
arr[a] = 1;
arr[b] = 1;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#def... | 0 | 74,503,883 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
string s;
cin >> s;
int n = s.size();
int zeroCount = 0;
int oneCount = 0;
for (int i = 0; i <= n - 1; i++) {
if (s[i] == '0') zeroCount++;
else oneCount++;
}
cout << min(oneCount, zeroCou... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int dp[105][4][3];
int main(void){
string s; cin >> s;
int KK; cin >> KK;
int n = s.size();
dp[0][0][0] = 1;
for(int i=0; i<n; i++){
for(int j=0; j<=KK; j++){
for(int k=0; k<2; k++){
... | 0 | 52,208,144 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 6,410,773 |
/*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long a, b, c, d, e, f, k;
cin >> a >> b >> c >> k;
if (a == b && a == c)
{
cout << "0";
r... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 21,467,031 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,N) for(int i=0; i<N; i++) ;
int main() {
ll L,R;
cin>>L>>R;
if(R-L>=2019){
cout<<0<<endl;
}
else{
if(L%2019>R%2019){
L=L%2019;
R=R%2019+2019;
}
else
{
L=L%2019;
R=R... | #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <array>
#include <cmath>
#include <queue>
#include <stack>
#include <numeric>
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string strans = "";
cin>>a>>b;
if(a <= b){
string stra;
stra... | 0 | 37,356,357 |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define F first
#define S second
#define pb push_back
#define ll long lo... | #include <bits/stdc++.h>
using namespace std;
const int x[10] = {-1,2,5,5,4,5,6,3,7,6};
void chmax(int &a, const int &b) { if (a < b) a = b; return; }
int main(){
int n, m; cin >> n >> m;
vector<int> data(m);
for (int i = 0; i < m; i++) cin >> data[i];
sort(data.begin(),data.end(),greater<int>());
v... | 0 | 49,932,768 |
#include <iostream>
#include <algorithm>
#include <vector>
#include<string>
#include <set>
#include <map>
#include <queue>
#include <limits.h>
#include <bitset>
#include <cmath>
using namespace std;
#define rip(i, n, s) for (int i = (s);i < ( int )( n ); i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define IO freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout)
#define FIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define rep(i,... | 0 | 87,714,842 |
#include<bits/stdc++.h>
#define int long long int
#define mod 998244353
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output1.txt","w", stdout);
#endif
IOS;
int d,t,s;
cin>>d>... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<string>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
bool used[27];
int main(){
string s;
cin... | 0 | 13,322,405 |
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<map>
#include<cstdlib>
using namespace std;
int n,k,R,S,P;
int arr[100001];
int rock = 1,scissor = 2, paper = 3;
int ans=0;
string s;
int main(){
cin >> n >> k;
cin >> R >> S >> P ;
cin >> s;
... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 68,217,561 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int in[4];
st... | #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()
#define sz(x) (int)x.size()
const int maxn = 10000001;
int main(){
ios_bas... | 0 | 11,958,709 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
lli k;
string s;
int main(void){
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef pair<ll,Pll> Pl... | 0 | 25,092,707 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
using namespace std;
int main(void) {
int n,X; cin >> n >> X;
vector<int> x(n);
vector<int> tmp(n);
int i = 0;
int min = pow(10,9);
while (i < n) {
cin >> tmp[i];
x[i] = abs(tmp[i] - X);
if (x[i]... | #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... | 0 | 18,924,876 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll s = 0;
rep(i, ... | #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) ... | 0 | 14,305,298 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,m;
cin>>n>>m;
char fi1[n][n];
char fi2[m][m];
rep(i,n){
rep(j,n){
... | #include<bits/stdc++.h>
using namespace std;
int frog1(int N, int a[])
{
int dp[N+1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2]-a[1]) , abs(a[2]-a[0]));
for( int i = 3; i < N; i++)
{
dp[i+1] = min(dp[i] + abs(a[i]-a[i-1]), dp[i-1] + abs(a[i]-a[i-... | 0 | 59,754,666 |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i,a,b) for(int i =a;i<b;i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const in... | #include <bits/stdc++.h>
#define For(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int N,K;
cin >> N >> K;
long long x[N],y[N],xx[N],yy[N];
long long mnX,mnY,mxX,mxY;
long long size;
For(i,N){
cin >> x[i] >> y[i];
xx[i] = x[i],yy[i] = y[i];
}
sort(x,x+N);
sort(y,y+N);
size = (... | 0 | 94,901,364 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a%b==0)cout<<a/b*c<<endl;
else cout<<a/b*c+c<<endl;
} | #include<iostream>
#include<string>
using namespace std;
int alignment(string s,string t){
int a[1001][1001];
int n=s.size();
int m=t.size();
a[0][0]=0;
for(int i=0;i<n;i++){
a[i+1][0]=a[i][0]+1;
}
for(int i=0;i<m;i++){
a[0][i+1]=a[0][i]+1;
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(s[i]==t[j]){... | 0 | 35,269,558 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#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 n;
cin >> n;
ll topNum = 0;
ll linNum = 0;
ll ans = 0;
vector<vector<int>> line(n-1, vector<int>(2));... | #include <numeric>
#include <iostream>
#include <array>
#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... | 0 | 40,465,414 |
#include<bits/stdc++.h>
using namespace std;
vector<string> ss;
int n;
bool works(int a, int b) {
bool ans = true;
for(int i=0;i<n;i++) {
for(int j=i;j<n;j++) {
int x1 = (i + a) % n;
int y1 = (j + b) % n;
int x2 = (j + a) % n;
int y2 = (i + b) % n;
ans = ans && (ss[x1][y1] == ss[x2... | #include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
int a[100],b[100];
int main() {
int n,i,j,k=0;
while(cin >> n) {
for (i=0;i<k;i++) if (a[i]==n) b[i]++;
if (i==k) { a[k]=n; b[k]=1; k++; }
}
for (i=0;i<k;i++) for (j=0;j<i;j++) if (b[j]<b[j+1]) {swap(b[j],b[j+1]); swap(a[j... | 0 | 54,445,466 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
signed main() {
int n,m,x;
cin>>n>>m>>x;
int c[n];
vector<vector<int>> v(n,vector<int>(m));
for(int i=0;i<n;i++)
{
cin>>c[i];
for(int j=0;j<m;j++)
{
cin>>v[i][j];
}
}
int ans=IN... | #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 ... | 0 | 38,524,314 |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
const int N = (int) 8080;
const double PI = acos(-1);
const double E = 1e-5;
void solve() {
int d; cin >> d;
double dt = d * PI / 180... | #include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define ... | 0 | 56,653,823 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()... | 0 | 88,422,690 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,a,b,c,d;
cin >> N;
a=N/1000;
b=N/100-10*a;
c=N/10-100*a-10*b;
d=N-1000*a-100*b-10*c;
if(a==b && b==c){
cout <<"Yes"<<endl;
}
else if(b==c && c==d){
cout <<"Yes"<<endl;
}
else {
cout <<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> a, p;
ll func(ll n, ll x) {
if (n == 0) {
return 1;
}
if (x == 1) {
return 0;
}
else if (x < 2 + a[n - 1]) {
return func(n - 1, x - 1);
}
else if (x == 2 + a[n - 1]) {
return p[n - ... | 0 | 93,306,911 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 200000000007;
signed main(){
int n;
cin>>n;
int a[n];
cin>>a[0];
for(int i=1;i<n;i++){
cin>>a[i];
a[i]+=a[i-1];
}
int ans=abs(a[n-1]-2*a[0]);
for(int i=1;i<n-1;i++)ans=min(abs(a[n-1]-2... | #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... | 0 | 77,716,799 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int> cntlist(3);
for (int i = 0; i < 3; i++) {
cin >> cntlist[i];
}
int k;
cin >> k;
vector<vector<ll> > vlist(3);
for (int i = 0; i < 3; i++) {
vlist[i].resize(cntlist[i]);
for (int j = 0; j < cntlist[i]; ... | 0 | 26,275,582 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int H,W;
cin >> H >> W;
if(H == 1 || W == 1) {
cout << 1 << endl;
return 0;
}
cout << (... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | 0 | 43,227,546 |
#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2... | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
ll h,w;
cin>>h>>w;
ll ans = 1e18;
for(int i = 1; i<=h; i++)
{
ll area1 = w*i, area2 = (h-i)/2 * w, area3 = h*w-area1-area2;... | 0 | 54,261,684 |
#include <iostream>
using namespace std;
int main(void){
string card_t, card_h;
int n, point_t, point_h;
point_t = 0;
point_h = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> card_t >> card_h;
if (card_t > card_h) {
point_t += 3;
} else if (card_t < card_h)... | #include <bits/stdc++.h>
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(string x){cerr<<x;return ... | 0 | 76,042,278 |
#include <stdio.h>
using namespace std;
int main(void){
int a,b;
scanf("%d %d",&a,&b);
if(a<b){
printf("a < b\n");
}else if(a>b){
printf("a > b\n");
}else{
printf("a == b\n");
}
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, val;
map<int, int> cnt;
cin >> n;
for(int i = 0; i < n; i++) {
... | 0 | 85,929,793 |
#include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
typedef pair<ll,ll> pll;
const int N = 1e2+2;
const int INF = 1e9;
int n, m;
int dr[2] = {0,1};
int dc[2] = {1,0};
int dp[N... | 0 | 87,699,964 |
#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 <iostream>
#include <fstream>
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <list>
#include <map>
#incl... | 0 | 81,811,558 |
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int row,col,dp[2][10005];
char grid[10005][10005];
void addSelf(int &x,int y)
{
x += y;
if(x >= mod)
x -= mod;
}
void FuN()
{
for(int i=1 ; i<=row ; i++){
for(int j=1 ; j<=col ; j++)
dp[i & 1][j] = 0;
for... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <functional>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace st... | 0 | 30,149,829 |
#include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define out1(a) cout<<#a<<" "<<a<<endl
#define out2(a,b) cout<<#a<<" "<... | 0 | 83,590,655 |
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
v... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n;
cin >> n;
int h;
ll ans = 0;
cin >> h;
for(int i=0;i<n-1;i++){
int nh;
cin >> nh;
if(nh>=h) h = nh;
else ans += (h-nh);
}
cout << ans << endl;
return 0;
} | 0 | 62,243,449 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
if (a==b) ans++;
if (b==c) ans++;
if (a==c) ans++;
if (ans==3) cout << 1 << endl;
if (ans==1) cout << 2 << endl;
if (ans==0) cout << 3 << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
while (true)
{
int n; cin >> n;
if(n == 0) break;
vector<int> train(86410, 0);
for (int i = 0; i < n; i++)
{
string ss, se; cin >> ss >> se;
int sh = (ss[0] - '0') * 10 + ss[1] - '0';
... | 0 | 38,594,247 |
#include <bits/stdc++.h>
using namespace std;
#define rep3(i, s, n ,a) for (int i = (s); i < (int)(n); i+=a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
int main(){
int n;
cin >> n;
vector<int> a;
vector<long> sum;
rep(i, n){
int num;
cin >> num;
a.... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<list>
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
int main(){
int n;
ll k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++) ... | 0 | 68,039,047 |
#include <iostream>
using namespace std;
using ll = long long;
int main(){
ll w,h,x,y,jud=0;
cin >> w >> h >> x >> y;
if(x==w/2.0&&y==h/2.0) jud = 1;
cout << (w*h)/2.0 << " " << jud << endl;
return 0;
} | #include<bits/stdc++.h>
#define lli long long int
#define endl "\n"
using namespace std;
typedef long long int LLI;
typedef double DB;
void fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
}
bool comparator(pair<lli,lli> a,pair<lli,lli> b)
{
if(a.first>b.first)
return true;
... | 0 | 74,315,446 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n)
{
cin >> a[i];
}
bool flag = true;
ll ans = 0;
while (flag)
{
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define allrev(x) (x).rbegin(), (x).end()
#define pb push_back
#define pf push_front
#define fori(i, a, n) for(int i = a; i < n; ++i)
#define MAX(x) (*max_element(all(x)))
#define ... | 0 | 46,228,992 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n;
int main()
{
cin >> n;
int cnt = 0;
int l = 0, r = 0, lr = 0;
rep(i, n)
{
string s;
cin >> s;
rep(i, s.size() - 1)
... | 0 | 77,606,592 |
#include <bits/stdc++.h>
using namespace std;
int n, cnt;
char p = '!', c;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n; cnt = n;
while (n--) {
cin >> c;
if (c == p) cnt--;
p = c;
}
cout << cnt << '\n';
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
using ll = long long;
int main(){
ll H, W; std::cin >> H >> W;
std::string temp(W+2,'.');
std::vector<std::string> s(H+2, temp);
for(int i=0; i<H; i++){
... | 0 | 27,444,156 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
priority_queue<long long> p;
for(int i=0; i<N; i++){
long long a;
cin >> a;
p.push(a);
}
for(int i=0; i<M; i++){
long long b;
b = p.top();
p.pop();
b /= 2;
p.push(b);
}
long long ans=0;
for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c, d;
vector<ll> ans;
int main() {
cin >> a >> b >> c >> d;
ans.emplace_back(a * c);
ans.emplace_back(a * d);
ans.emplace_back(b * c);
ans.emplace_back(b * d);
if (a * b <= 0 || c * d <= 0)
ans.emplace_back(0);
sort(ans.rbegin(), ans.... | 0 | 51,211,258 |
#include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a[3];
for (int i = 0; i < 3; ++i)
{
cin>>a[i];
}
sort(a,a+3);
if (a[0]==a[2])
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
return 0;
} | 0 | 5,139,265 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main () {
int n;
cin >> n;
int sum =0;
rep(i,n) {
sum += i+1;
}
co... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int x, n, y;
cin >> x >> n;
set<int> p;
for (int i = 0; i < n; ++i)
{
cin >> y;
p.insert(y);
}
for (int i = 0; i < x + 1; ++i)
{
for (auto dir : {-1, +1})
{
y = x + dir * i;
... | 0 | 21,788,074 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N, a, b, c, d;
cin >> N;
a = N / 1000;
b = N % 1000 / 100;
c = N % 1000 % 100 / 10;
d = N % 1000 % 100 % 10;
if ((a == b) && (b == c) || (b == c) && (c == d))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int x;
cin>>x;
for(int j=1;j<=8;j++){
if(x>=2000-200*j && x<2000-200*(j-1)){
cout<<j;
}
}
retu... | 0 | 16,403,888 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a... | 0 | 31,582,123 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
string S;
cin >> N >> S;
enum RGBtype : int64_t { kR = 0L, kG, kB, kNumber };
vector<int64_t> A(N);
vector<int64_t> counts(3, 0);
for ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = int;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll IN... | 0 | 13,432,864 |
#include<stdio.h>
#define N 10000
int A[2000001],C[N],B[2000001];
int main()
{
int i,n;
scanf("%d",&n);
for(i=1;i<n+1;i++){
scanf("%d",&A[i]);
}
for(i=0;i<N;i++){
C[i]=0;
}
for(i=1;i<n+1;i++){
C[A[i]]+=1;
}
for(i=0;i<N;i++){
C[i]+=C[i-1];
}
for(i=n+1;i>0;i--){
B[C[A[i]]]=A[i];
... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ss(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define per(i, l, r) for (int i = r; l <= i; --i)
using ll = long long;
using namespace std... | 0 | 20,570,860 |
#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=5e15;
int main() {
ll n;
cin >> n;
vec t(n+1),v(n+1,0);
for(ll i=0;i<n;i++) cin >> t[i],t[i]*=2;
for(ll i=0;i<n;i++) cin >> v[i],v[i]*=2... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> ... | 0 | 93,424,343 |
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define ll long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define D1(x) {cerr<<" [" <<#x<<": "<<x<<"]";cout << endl;}
#define D2(x) {cerr<<" [" <<#x<<": ";f... | #include <cstdio>
#include <cmath>
long Parent(long i) {
return (long)floor((double)i / 2.0);
}
long Left(long i) {
return 2 * i;
}
long Right(long i) {
return (2 * i + 1);
}
int main() {
int H;
scanf("%d", &H);
long A[H];
for (int i=0; i<H; i++) scanf("%ld", &A[i]);
for (int i=0; i<H; i... | 0 | 100,176,717 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3+5, maxs = 2e4+5, inf = 1e9;
int n, h, a[maxn], b[maxn], dp[maxs];
int main(){
scanf("%d %d", &h, &n);
for(int i = 1; i<=n; i++) scanf("%d %d", &a[i], &b[i]);
fill(dp+1, dp+maxs, inf);
for(int i = 1; i<=n; i++){
for(int s = a[i]; s<maxs; s++) dp[s]... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#include <iostream>
#define fastinput ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
fastinput;
LL n,i,j,k,t,temp;
cin>>n>>k;
LL ans=0;
map<LL,LL> freq;
freq[0]++;
LL sum=0;
for(i=0;i<n;i... | 0 | 13,692,613 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long>A(X);
vector<long long>B(Y);
vector<long long>C(Z);
for (int n = 0;n<X;++n) {
cin >> A[n];
}
for (int n = 0; n < Y; ++n) {
cin >> B[n];
}
for (int n = 0; n < Z; ++n) {
cin >> C[n];
}
so... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<pair<int,int>> zahyo(n);
vector<pair<int,int>> checkpoint(m);
vector<pair<int,int>> distance(m);
for (int i = 0; i < n; i++){
cin >> zahyo.at(i).first >> zahyo.at(i).second;
}
for (int i = 0... | 0 | 28,989,980 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long double x,y;
cin >> x >> y;
cout << x/y;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int main(void){
int a,b,x;
cin >> a >> b >> x;
if(a>x){
cout << "NO" << endl;
... | 0 | 94,028,088 |
#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>
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
#define ii for(int i=1;i<=n;++i)
#define ji for(int j=1;j<=n;++j)
#define jj for(int j=1;j<=m;++j)
#define ij for(int i=1;i<=m;++i)
#define sz(x) ((ll)x.si... | 0 | 36,963,723 |
#include<iostream>
#include<queue>
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main(){
int H, W;
char field[1000][1000];
int dist[1000][1000];
int max_dist = 0;
cin >> H >> W;
queue<P> que;
for(int i=0; i... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000000+7;
int main(){
int n;
cin >> n;
vector<ll> a(n);
for(int i=0;i<n;i++) cin >> a[i];
ll sum = 0;
ll place = 1;
for(int bit=0;bit<62;bit++){
int one=0,zero=0;
for(int i=0;i<n;i++){
if(a[i]... | 0 | 60,578,844 |
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std; typedef long long ll;
const int MAXN = 10 + 1e5;
const ll oo = 1 + 1e18, mod = 7 + 1e9;
int n, a[MAXN][5], f[MAXN][5];
int main(){
#define TASK "ABC"
#ifndef ONLINE_JUDGE
freopen(TASK".inp","r",stdin),freopen(TASK".out","w",stdout);
... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
int n[4];
rep(i, 4)... | 0 | 20,092,342 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S, T;
cin >> N >> S >> T;
for(int i = 0; i < N; i++){
cout << S[i] << T[i];
if(i == N-1){
cout << endl;
}
}
} | #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; ... | 0 | 27,601,862 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
#define FORCLS(i,a,b) for(int i = (a); i <= (b); i++)
#define REPCLS(i,n) FORCLS(i,1,n)
const int NMAX = 10000005;
int isOKsMemo[NMAX];
const in... | 0 | 32,781,127 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
string ans="AC";
if(S.at(0)!='A'){
ans="WA";
}
int test=0;
for(int i=1;i<S.size();i++){
if(isupper(S.at(i))){
if(i==1||i==S.size()-1||S.at(i)!='C'){
ans="WA";
}
test++;
}
}
if(t... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 60,162,175 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int inf = 1200005;
int main(){
int n, m, x;
cin >> n >> m >> x;
int c[n], a[n][m];
for(int i = 0; i < n; i++){
cin >> c[i];
for(int j = 0; j < m; j++)
cin >> a[i][j];
}
int ans = inf;
for(int ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define PP pair<P,P>
using namespace std;
ll dp[2005][2005];
ll sum[2005][2005];
int main(){
int n,m; cin >> n >> m;
int s[... | 0 | 51,065,365 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair < ll, ll > PLL;
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<ll> a(n);
vector<ll> cnt(2, 0);
rep(i, n) cin >> a[i];
rep(i, n) {
... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
ll n;
string s;
std::cin >> n>>s;
ll rc = 0;
string c = "L";
for (int i = 1; i < n*2; i++) {
if(s[i]!=s[i-1]){
if(c[i-1]=='R'){
... | 0 | 9,915,507 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s;cin>>s;
map<char,int>m;
rep(i,s.size()){
... | #include <stdio.h>
int main() {
int n, equal = 0;
scanf("%d",&n);
char str[n+1];
scanf("%s",&str);
for (int i = 0, j = n/2; i < n/2; i++,j++)
{
if (str[i] == str[j])
{
equal++;
}
}
if (n % 2 == 1)
{
puts("No\n");
return 0;
}
equal == n/2 ? puts("Yes\n") : puts("No\n");
return 0;
} | 0 | 91,280,959 |
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#include<bits/stdc++.h>
#define ll long long
#define d double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k,x;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | 0 | 79,619,459 |
#include<bits/stdc++.h>
#include<algorithm>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast_io
ll t,i,j,n,kth,ans,cnt=0,x,kopi;
cin>>n>>kth;
vector<pair<ll,ll>>v(n);
for(i=0; i<n; i++)
{
cin>>v[i].... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
bool Bl[100][100];
int main(){
int A, B;
cin >> A >> B;
int H,W;
H = W = 100;
printf("%d %d\n", H, W);
for(int i = 0; i < H/2; i++){
REP(j,W){
... | 0 | 94,473,846 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#include<cmath>
#include<bitset>
#include<queue>
#define ll long long
#define itn int
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) ... | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int a,b,c;
for(;;){
scanf("%d %d %d",&a,&b,&c);
if(a+b+c==-3){
break;
}else if(a+b>=80){
printf("A\n");
}else if(a+b>=65){
... | 0 | 71,199,490 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int x, y;
while (true) {
fscanf(stdin, "%d %d", &x, &y);
if (x == 0 && y == 0) { break; }
if (x > y) { swap(x, y); }
fprintf(stdout, "%d %d\n", x, y);
}
return 0;
} | #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 perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 0 | 15,693,460 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
n=2,m=3;
vector<vector<char>>v(n,vector<char>(m));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>v[i][j];
}
}
bool no=false;
for(int i=0;i<m;i++)
{
if(v[... | 0 | 10,625,996 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000000000010
bool check(vector<long long> &a,long long mid){
long long cnt = 0;
long long N = a.size();
for(int i=0;i<a.size();i++){
long long t = a[i] + mid - (N-1);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = LLONG_MAX;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
ll N, K; cin >> N >> K;
vector<ll> A(N+1);
for(int i = 0; i < N; i++) cin >> A[i];
while(K--){
vector<ll> A_... | 0 | 9,515,311 |
#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,m;
cin >>n >>m;
vector<pair<ll, ll>> p(n);
rep(i,n){
cin >>p[i].first >>p[i].second;
}
sort(p.begin(), p.end());
ll ans = 0;
for(int i = 0; m>=0; i++){
if(p[i].sec... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#include <map>
#define rep(i, n) for (int i=0; i<n; ++i)
#define FOR(i, a, b) for (int i=a; i<b; ++i)
#define pb(x) push_back(x)
#define ll long long
#define ul unsigned long long
#define d... | 0 | 80,881,529 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string in;
string sarch;
int flag;
getline(cin, in);
getline(cin, sarch);
in += in;
if (in.find(sarch) != std::string::npos)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1... | 0 | 54,722,337 |
#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <bitset>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end... | 0 | 96,506,265 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n, y;
cin >> n >> y;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
int m = n - i - j;
if (m < 0) continue;
int money = 10000 * i + 5000 * j + 1000 * m;
if (money == y) {
cout << i << " " << j <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
vector<ll>A(5);
ll ans=0;
ll m=10;
rep(i,5){
cin>>A[i];
ll d=A[i];
d%=10;
if(d==0){
d+=10;
}
if(... | 0 | 50,641,612 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a , b ;
double x , y ;
cin >> a >> b ;
1 <= a , b <= 10*10*10*10*10*10*10*10*10;
x = a ;
y = b ;
printf("%d %d %.8lf \n", a / b , a % b , x / y );
} | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define FOR(i,l,r) for( li i = l-(l>r); i != r-(l>r); i += 1-2*(l>r) )
int main() {
li m,k; cin>>m>>k;
li u = (1ll<<m)-1;
if( k > u || ( k == 1 && m <= 1 ) ) {
cout<<"-1\n";
return 0;
}
if( k == 0 ) {
FOR(... | 0 | 89,613,832 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
int main() {
ll N;
cin >> N;
priority_queue<ll, vector<ll>, greater<ll>> v;
REP(i, N) {
ll tmp;
cin >> tmp;
v.push(... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 0 | 44,242,865 |
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
using namespace std;
const long long maxn=1e4+10;
const long long inf=1e15;
void in(long ... | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
long long a,b,c,d;
scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
long long x1=a*c;
long long x2=a*d;
long long x3=b*c;
long long x4=b*d;
printf("%lld",max(x1,max(x2,max(x3,x4))));
return 0;
} | 0 | 78,650,144 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.