code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,C,K;
cin>>N>>C>>K;
vector<int>T(N);
for(int i=0;i<N;++i)cin>>T[i];
sort(T.begin(),T.end());
int count=0;
for(int i=0;i<N;){
int s=i;
while(T[i]-T[s]<=K && i-s<C && i<N)+... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 | 75,481,694 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string str, ope, p, str_rev;
int q, a, b;
cin >>str >>q;
for(int i=0; i<q; i++){
cin >>ope >>a >>b;
if(ope=="replace"){
cin >>p;
str.replace(a, p.size(), p);
}else if(ope=="reverse"){
str_rev=str.substr(a,... | #include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
#include<vector>
#include<iomanip>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll v[205];
ll x[20000005];
ll a[10000005];
ll b[10000005];
ll dp[10005][10005];
ll ex = 1000000007;
int dx[4] = { 1,-1,0,0 };
int dy[4] =... | 0 | 97,938,619 |
#include <iostream>
using namespace std;
int main(void)
{
int n;
cin >> n;
while (n--){
int y, m, d;
cin >> y >> m >> d;
int cnt = 0;
int x;
while (1){
if (y == 1000 && m == 1 && d == 1){
break;
}
d++;
if (d == 20 && ((y % 3) != 0) && (m % 2) == 0){
m++;
d = 1;
}
else if (d ==... | #include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | 0 | 34,548,025 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
int K; cin >> K;
ll A[K]; rep(i, K) cin >> A[i];
ll ulim = 2, dlim = 2;
for(int i = K-1; i >= 1; i--){
ulim = (ulim - (ulim % A[i]... | 0 | 50,101,336 |
#include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main(void) {
io;
int N; cin >> N;
vector<int> input(N);
long long ans = INT_MAX;
for (int i = 0; i < N; i++) cin >> input[i];
for (int i = -100; i <= 100; i++) {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 97,664,169 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#... | #include <iostream>
#include <string>
using namespace std;
struct Dice{
int num[6];
};
void move(struct Dice *dice, string str){
int store[6];
for(int i=0;i<str.length();i++){
for(int j=0;j<6;j++){
store[j] = (*dice).num[j];
}
switch(str[i]){
case 'N':
(*dice).num[0] = store[1];
(*dice).num[1] = sto... | 0 | 73,695,957 |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<complex>
#include<deque>
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define gcd(a,b)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++... | 0 | 24,747,037 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
char fi[100][100];
int main(){
int a,b; cin >> a >> b;
cout << 100 << " " << 100 << endl;
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
if(i<50)fi[i][j]='#';
else fi[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 21,851,564 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
const int mod = 1e9+7;
int32_t main()
{
int n, m;
cin >> n >> m;
vector<string> in(n);
rep(i, n)
{
cin >> in[i];
}
int dp[n][m];
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
rep(i, n)
{
rep(j... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 98,537,102 |
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.... | 0 | 94,809,246 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef vector... | 0 | 43,527,169 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int lmax = *max_element(L.begin(), L.end());
int rmin = *min_element(R.begin(), R.end());
int d = rmin - lmax + 1;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 63,908,206 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
void b_abc111(void) {
int n;
cin >> n;
int sho = n / 111;
int amari = n % 111;
if(amari!=0){
sho++;
}
cout << 111 * sho << endl;
}
int main()
{
b_abc111();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#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)--)
#defi... | 0 | 21,083,986 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(void) {
int a[3];
int aMax = 0;
for (int i = 0; i < 3; i++) {
scanf("%d", &a[i]);
aMax = max(aMax, a[i]);
}
int diffSum = 0;
for (int i = 0; i < 3; i++) {
diffSum += aMax - a[i];
}
if (diffSum % 2 == 0) printf("%d\n", diffSum / 2);
else... | #include <iostream>
#include <map>
#include <vector>
#include <set>
#include <string>
#include <algorithm>
using namespace std;
string addDigit(string s){
while(s.size() < 6){
s = "0"+s;
}
return s;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
ve... | 0 | 54,444,325 |
#include<iostream>
using namespace std;
int main(){
int n;
int n1,n2,st;
n1=1;
n2=1;
st=1;
cin >>n;
for(int i=1;i<n;i++){
st=n1+n2;
n1=n2;
n2=st;
}
cout <<st<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<ll>>;
using Graph = vector<vector<ll>>;
using VI = vector<int>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VC = vector<char>;
using PI = pair<int, int>;
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#d... | 0 | 75,667,332 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 64,542,794 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x)... | 0 | 27,432,386 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
char c=s[0];
int ans=1;
for(int i=1;i<4;++i){
if(s[i]==c) ++ans;
else{
... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(void){
vector<string> res;
vector<int> rei;
string maxstr;
string inp;
while(cin>>inp){
if(maxstr.size() < inp.size()){
maxstr = inp;
}
bool used = true;
for(int i = 0 ; i < res.size() ; i ++){
if(re... | 0 | 21,480,007 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char s[3];
cin>>s[0]>>s[1]>>s[2];
if(s[0]=='R' && s[1]=='R' &&s[2]=='R')
cout<<"3";
else if(s[0]=='R' && s[1]=='S')
cout<<"1";
else if((s[0]=='S' && s[1]=='R' && s[2]=='R')||(s[0]=='R' && s[1]=='R' && s[2]=='S'))
cout<<"2";
el... | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <list>
#include <ctime>
#include <complex>
#include <bitset>
#include <tuple>
#include <functional... | 0 | 52,714,956 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,s1,s2,s3;
cin>>a>>b>>c>>d;
s1=abs(a-b);
s2=abs(a-c);
s3=abs(b-c);
if(s2<=d){
cout<<"Yes";
}
else{
if(s1<=d && s3<=d){
cout<<"Yes";
}
else{
cout<<"No";
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | 0 | 18,467,766 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<bool> x(pow(10, 5));
int c = 0;
for(int i = 0; i < N; i++) {
int a;
cin >> a;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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 ... | 0 | 6,334,656 |
#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>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main() {... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 0 | 94,693,455 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main() {
int n, u, k, v;
vector< vector< int > > list;
vector< int > dist;
queue< int > que;
cin >> n;
list.resize(n);
dist.resize(n);
for(int i=0;i<n;++i){
cin >> u >> k;
dist[i] = -1;
for(int j=0;j<k;++j){
cin >> v;
li... | 0 | 35,781,562 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N;
cin >> N;
vector<int> cnt(100005, 0)... | #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | 0 | 82,677,392 |
#include <iostream>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int ans = 0;
for (int i = 0; i < 1000; i++) {
int dig[3] = {i/100, i/10%10, i%10};
int flag = 0;
for (int j = 0; j < N; j++) {
if (dig[flag] + '0' == s[j]) flag++;
if... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int num[5]={0},i;
for(i=0;i<5;i++){
cin>>num[i];
}
sort(num,num+5);
for(i=0;i<5;i++){
cout<<num[4-i];
if(i!=4){
cout<<' ';
}
}
cout<<endl;
return 0;
} | 0 | 13,958,675 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-MOD);
b = (b<MOD)?b:(b-MOD);
a += b;
a = (a<MOD)?a:(a... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | 0 | 25,631,953 |
#include <iostream>
#include <list>
#include <stack>
using namespace std;
int main() {
list<int> stat;
for (int i = 0, in; cin >> in; i++, stat.push_back(in));
stack<int> stacK;
for (list<int>::iterator it = stat.begin(); it != stat.end(); it++, it = stat.begin()) {
if (*it == 0) {
cout << stacK.top() << endl;... | #include<iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
while (n != 0 || x != 0) {
if (x < 6 || x > 3 * n - 3) {
cout << 0 << endl;
cin >> n >> x;
continue;
}
int a, b, c;
a = x / 3;
b = (x - a) / 2;
c = x - (a + b);
whi... | 0 | 81,274,068 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
rep(i,m) {
cin >> p[i] >> y[i];
p[i]-... | 0 | 60,837,575 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | #include "iostream"
#include "algorithm"
using namespace std;
int main()
{
int n, *a,l;
cin >> n;
a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
cout << a[n - 1] << ' ';
for (int i = 0; true; i++) {
if (a[n - 1] / 2 < a[i]) {
l = i;
break;
}
}
if (l == n - 1)cout << a... | 0 | 11,867,133 |
#include <cstdio>
#include <cctype>
#include <vector>
#include <iostream>
#include <algorithm>
#define MAXN (100000 + 5)
int n, c, k;
int t[MAXN * 2];
int ans;
int main()
{
scanf("%d%d%d", &n, &c, &k);
for (int i = 0; i < n; ++i)
{
scanf("%d", &t[i]);
}
std::sort(t, t + n);
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
int findLowerBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto low = lower_bound(arr.begin(),
arr.end(), p);
return low - arr.begin();
}
int findUpperBound(
... | 0 | 50,275,534 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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,m;
cin... | #include <bits/stdc++.h>
using namespace std;
long long lcm(long long a,long long b){
return a*b/__gcd(a,b);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
long long n,m;
cin>>n>>m;
vector<long long> v(n);
long long lc=1ll;
for(int i=0;i<n;i++){
long l... | 0 | 3,059,543 |
#include <iostream>
using namespace std;
int main (int argc, char* argv[])
{
int a, b;
cin >> a >> b;
if (a < -1000) return 0;
if (1000 < b) return 0;
if (a < b) cout << "a < b" << endl;
else if (a > b) cout << "a > b" << endl;
else cout << "a == b" << endl;
return 0;
} | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define i_7 1000000007
ll mod(ll a){
ll c=a%i_7;
... | 0 | 54,800,699 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define ll long long
#define coYes cout << "Yes" << endl
#define coYES cout << "YES" << endl
#define coyes cout << "yes" << endl
#define coNo cout << "No" << endl
#define coNO cout ... | #include<iostream>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
ll H, W;
cin >> H >> W;
ll ans=1000000000000, mins, maxs;
ll tmp, tmp1, tmp2, tmp3;
if(H%3==0 || W%3==0){
ans = 0;
}
for(ll i=1; i<H; i++){
tmp=W/2;
tmp... | 0 | 96,320,586 |
#include <iostream>
using namespace std;
int selectionSort(int *a, int n) {
int counter = 0;
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i; j < n; j++) {
if (a[j] < a[minj]) minj = j;
}
if (a[i] > a[minj]) {
swap(a[i], a[minj]);
counter++;
}
}
return counter;
}... | #include <iostream>
#include <vector>
using namespace std;
const int NULLNodeKey = 2000000001;
const int heap_offset = 1;
int get_left(vector<int> binary_heap, int index) {
int left_child_index = 2 * index;
if(left_child_index > binary_heap.size() - heap_offset) {
return NULLNodeKey;
}
return binary_heap[le... | 0 | 10,555,588 |
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int64_t a){if(a<=1)return false;for(int64_t i=2;(int64_t)i*i<=a;i++){if(a%i==0)re... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,... | 0 | 22,906,292 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
inline void io()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.precision(10);
cout << fixed;
}
int main()
{
io();
int n;
cin >> n;
int mx = 0;
int ans = 0;
for (int ... | #pragma GCC optimize("Ofast")
#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 <cstdl... | 0 | 98,212,237 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout... | #include <bits/stdc++.h>
using namespace std;
bool isOK(int ma, int n) {
for (int i = ma; i >= 1; --i) {
if (n >= i) {
n -= i;
}
}
return n == 0;
}
int main() {
int n;
cin >> n;
int left = 0, right = n;
int ma = n;
while (right - left > 1) {
int mid = left + (right - left) / 2;
if ... | 0 | 19,419,417 |
#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() {
int A,P;
cin >> A >> P;
cout << (A*3+P)/2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define inf 1000000005
#define mod 1000000007
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; 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 isin(x,l,r) ((l) <= (x) && ... | 0 | 20,232,678 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
#include <utility>
#include <tuple>
#define INF 1000000000000
const long long MOD = 998244353;
using namespa... | 0 | 28,857,126 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main(){
int N, M;
cin >> N >> M;
vector<int> S(N);
for (int i = 0; i < N; i++){
cin >> S[i];
}
vector<int> T(M);
for (int i = 0; i < M; i++){
cin >> T[i];
}
vector<vector<long long>> dp(N + 1, vector<long long>(M + 1... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | 0 | 87,684,961 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define all(x) begin(x), end(x)
#define x first
#define y second
typedef long long ll;
typedef long double ld;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_s... | #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>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } re... | 0 | 99,110,115 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(int argc, char* argv[])
{
double x1,y1,x2,y2;
double distance;
cin >> x1 >> y1 >> x2 >> y2;
distance = sqrt(pow(x1-x2,2.0)+pow(y1-y2,2.0));
printf("%.8lf\n",distance);
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<functional>
using namespace std;
typedef long long int ll;
int main(){
ll n, a, b;
cin >> n >> a >> b;
if(a+b-1 > n || n > a*b){
cout << -1 << endl;
return 0;
... | 0 | 92,624,199 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define debug(x) cout << #x << ": " << x << endl
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
const ll LINF = 1e16;
int main() {
cin.tie(0);
ios_... | #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int G[110][110];
int n;
int u, k, v;
void print_matrix(int N) {
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) {
printf("%d", G[i][j]);
if (j < N-1) {
printf(" ");
}
}
printf("\n");
}
}
void make_matrix() ... | 0 | 2,330,504 |
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,b) for(ll i=(b)-1, i>=a; --i)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scanv(n,v) v.resize(n); rep(i,n){ cin>>v[i];}
#define MOD 1000000007ll
#define Yes(flag) cout<<((flag)? "Yes":"No")... | #include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
ll n;
int x,m;
cin >> n >> x >> m;
vector<int> check(m+5,0);
vector<ll> suma(m+5,0);
vector<ll> a(m+5);
a.at(1) = x;
suma.at(1) = x;
check.at(x) = 1;
int lo... | 0 | 43,677,487 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
con... | #include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#de... | 0 | 36,840,649 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> s;
vector<int> p(M);
int switch_count = 0;
int light_count = 0;
int result_count = 0;
for(int i = 0; i < M; i++) {
cin >> k[i];
vector<int> tmp(k[i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define DEBUG(val) cout << #val << " :... | 0 | 50,791,359 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll n,ans = 1;
string s;
cin >> n >> s;
char tmp ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a;
cin>>n;
std::deque<int> deq;
deq.emplace_back(0);
int sum=0;
for (int i=0;i<=n;i++) {
if (i!=n) {
cin>>a;
deq.emplace_back(a);
sum+=abs(deq[i]-deq[i+1]);
} else {
... | 0 | 94,330,679 |
#include<iostream>
using namespace std;
int main(){
int N,M,P;
while(cin>>N>>M>>P){
if(N==0)break;
int c=0;
int d[1100]={},cn=0;
for(int i=1;i<=N;i++){
cin>>c;
d[i]=c;
cn+=c;
}
if(d[M]==0){
cout<<0<<endl;
}
else{
cout<<((cn*(100-P))-((cn*(100-P))%d[M]))/d[M]<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
ll n;
cin >> n;
ll b[n-1];
for (ll i=0;i<=n-2;i++)
{
cin >> b[i];
}
ll ans=b[0];
... | 0 | 43,317,277 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k, ans = 0; cin >> n >> k;
vector<ll> num(k, 0);
for (int i = 1; i <= n; i++)
num[i%k]++;
for (ll a = 0; a < k; a++) {
if ((k-a)%k*2%k == 0)
ans += num[a] * num[(k-a)%k] * n... | 0 | 9,046,269 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define setbits(x) __builtin_popcountll(x)
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#d... | #pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
using P = pair<int64, int64>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1<<30;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
temp... | 0 | 59,569,370 |
#include <bits/stdc++.h>
using namespace std;
#define N 300005
int sum[N], cc[N], number[N];
void update(int *pen,int ind,int v) {
while(ind<N) {
pen[ind] += v;
ind += ind&(-ind);
}
}
int query(int *pen,int ind) {
int ret = 0;
while(ind>0) {
ret += pen[ind];
ind = ind&(in... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int n, a, b, c;
vector<int> abc;
vector<int> vec;
ll ans = INF;
... | 0 | 21,964,699 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | 0 | 29,017,464 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<P,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | 0 | 20,248,272 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,flag=0;
cin >> N;
for(int i=0;i<3;i++){
if(N%10==7) flag++;
N/=10;
}
if(flag){
cout<<"Yes";
}else{
cout<<"No";
}
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int n;
int A[200010];
int sta[1000010],dep[1000010];
bool check(int mid)
{
int head=0;
sta[head]=0,dep[head]=0;
for(int i=1;i<=n;i++)
{
if(A[i]>dep[head]){
head++;
dep[head]=A[i];
sta[head]=0;
sta[head-1]++;... | 0 | 20,064,937 |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main(){
ll n;
cin>>n;
vector<ll>a(n);
map<ll,ll>num;
for(ll i=0;i<n;i++){
cin >>a.at(i);
if(num.count(a.at(i))){
num.at(a.at(i))++;
}
else{num[a.at(i)]=1;}
}
ll tmp=0;
ll tmp2;
for(auto num1:num){
tmp2=num1.se... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 94,330,234 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; string S; cin >> N >> K >> S;
vector<int> v;
if(S.at(0) == '1') v.push_back(0);
char c = S.at(0);
for (int i = 0; i < N; i++) {
int cnt = 1;
while(i + 1 < N) {
if(S.at(i + 1) == c) {
i++; cnt++;
}
else break... | #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;
ll sum[2005][2005];
const ll MOD = 1e9+7;
int main(){
int n,m;
cin>>n>>m;
vector<ll>s(n+1,0);
vector<ll>t(m+1,0);
rep(i,n){
... | 0 | 98,845,775 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
char a, b;
cin >> a >> b;
if (a < b) cout << "<\n";
else if (a > b) cout << ">\n";
else cout << "=\n";
return (0);
} | #include<bits/stdc++.h>
#define int long long int
#define endl "\n"
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define loop(i,n) for(int i=0;i<(n);i++)
#define fors(a,b,i) for(int i=(a);i<=(b);i++)
#define ford(a,b,i) for(int i=(a);i>=(b);i--)
#define all(a) a.begin()... | 0 | 55,235,294 |
#include<stdio.h>
int main(void)
{
int a,b,c,d,e,f,g,h,x,y;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
scanf("%d",&d);
scanf("%d",&e);
scanf("%d",&f);
scanf("%d",&g);
scanf("%d",&h);
x=a+b+c+d;
y=e+f+g+h;
if(x>=y){
printf("%d\n",x);
}
else{
printf("%d\n",y);
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
void solve()
{
vector<int> fibo;
fibo.push_back(1);
fibo.push_back(1);
for (int i = 2; i <= 44; ++i)
{
fibo.push_back(fibo[i - 1] + fibo[i - 2]);
}
int n;
cin >> n;
cout << fibo[n] << endl;
}
int main()
{
solve();
return(0);
} | 0 | 3,304,200 |
#include <iostream>
#include <string>
#include <ctype.h>
using namespace std;
int main(int argc, char *argv[])
{
string input;
getline(cin, input);
for (int i = 0; i < input.size(); i++)
{
if (islower(input[i]))
{
input[i] = toupper(input[i]);
}
else
{... | #include <iostream>
using namespace std;
int main()
{
int N,i;
cin>>N>>i;
cout<<N-i+1;
return 0;
} | 0 | 41,307,753 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
vector<string> Bubble(vector<string> s, int n){
for(int i=0; i<n; i++){
for(int j = n-1... | #include <bits/stdc++.h>
using namespace std;
const vector<int> v = {0, -1, 0, 1};
const vector<int> h = {-1, 0, 1, 0};
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H+1, vector<char>(W+1));
queue<vector<int>> que;
vector<vector<int>> dist(H+1, vector<int>(W+1, -1));
for (int i = ... | 0 | 26,298,847 |
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
long i,s=1;
for(i=1;i<=n;i=i+1){
s=s*i;
}
cout<<s<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
rep(i,n){
string a,b;
cin >> a >> b;
int n1 = a.size();
int n2 = b.size();
int dp[n1+1][n2+1];
rep(i,n1+1)rep(j,n2+1)dp[i][j] = 0;
rep(i,n1)... | 0 | 80,872,671 |
#include<iostream>
using namespace std;
int main(){
int n,m;
int counter=0;
int sum = 0;
while(1) {
cin >> n >> m;
if (n == 0 && m ==0) break;
for (int i = 1; i <= n -2; i++) {
for (int j = i+1; j <= n -1;j++) {
for (int k = j+1; k <= n; k++) {
sum = i + j + k;
... | #include<string>
#include<cstring>
#include<iostream>
using namespace std;
int main(){
string S, P, S_twice;
bool y_n = false;
getline(cin,S);
getline(cin,P);
S_twice = S + S;
int lenS, lenP, i;
lenS = S.length();
lenP = P.length();
for(i=0;i<lenS;i++){
if(strncmp(P.c_str(), S_twice.c_str(), lenP) == 0){
... | 0 | 47,732,188 |
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << "[*] " #x ": " << x << endl
#define debug(x) x
#else
#define dump(x)
#define debug(x)
#endif
typedef long long ll;
decltype(1) main() {
string s;
cin >> s;
for (char& c : s) {
cout << (c == '1' ? '9' : '... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | 0 | 17,222,554 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), arr.end()
#define rep(i,... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 280,100 |
#include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c... | 0 | 25,819,939 |
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <iomanip>
#include <map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c;
ci... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 23,913,542 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define strall(v) (v).cbegin(),(v).cend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 0 | 27,263,548 |
#include <cmath>
#include <iostream>
#include <limits>
#include <utility>
#include <vector>
template <class T> void chmin(T &a, const T &b) {
if (b < a)
a = b;
}
int main() {
using i64 = long long;
int n, k;
std::cin >> n >> k;
std::vector<i64> h(n);
for (auto &e : h) {
std::cin >> e;
}
h.insert... | #include<iostream>
using namespace std;
string str1,str2;
int main()
{
cin>>str1>>str2;
int len1 = str1.length();
int len2 = str2.length();
if (len1 < len2)cout<<"LESS"<<endl;
else
if (len1 > len2)cout<<"GREATER"<<endl;
else
{
for (int i = 0 ; i < len1; i++)
{
if (str1[i] > str2[i]) {cout<<"GREATER"<<end... | 0 | 43,199,524 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i)
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for(long long i = (s); i < (t); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(a) (a).rbeg... | #include<iostream>
#include<stdlib.h>
using namespace std;
struct Node{
int key;
Node* next;
Node* prev;
};
struct List{
Node* nil;
void init(){
nil=(Node*)malloc(sizeof(Node));
nil->next=nil;
nil->prev=nil;
nil->key=0;
}
Node* find(int key){
for(Node* i=nil->next;i!=nil;i=i->next){
... | 0 | 7,434,345 |
#include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
vector<int> p(n);
rep(i, m){
cin >> k[i];
s[i].... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
int n;
cin >> n;
vector<pair<int,int>> a;
... | 0 | 74,510,074 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
int n;
cin >> n;
V<string> s(n);
rep(i, n) cin >> s[i];
int ans(0);
rep(i, n) {
int S = s[i].length();
rep(j,... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
#endif
ll n,m;
cin>>n>>m;
vector<ll> a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
a[i]=a[i]/2;
}
ll lcm=a[0];
ll pre... | 0 | 77,013,577 |
#include <iostream>
#include <stdio.h>
#include <cctype>
int main(void)
{
std::string st;
getline(std::cin, st);
for(int i = 0 ; i < st.size();i++ ){
char ch = st[i];
if (std::islower(ch)){
ch = std::toupper(ch);
}
else if (std::isupper(ch)){
ch = std::tolower(ch);
}
else {
}
printf("%c", ch... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,a[200009],m,k,ans=0,fl=0;
string s;
cin>>s;
for(int i=0;i<3;i++)
{
if(s[i]!=s[0])
ans=1;
}
if(ans==1)
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
} | 0 | 56,650,946 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
string S;
cin>>S... | #include <bits/stdc++.h>
#define FOR(i,l,r) for(size_t i=(l);i<(r);++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
const ll INF=1ll<<32;
int main(){
ll v,e;
cin>>v>>e;
ll G[v][v];
rep(i,v){
rep(j,v){
G[i][j]=INF;
if(i==j)G[i][j]=0;
}
}
rep(i,e){
... | 0 | 49,789,729 |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int H,W,d;
int x;
char c[5] = "RYGB";
int main()
{
scanf("%d%d%d",&H,&W,&d);
for(int i = 1;i <= H; ++ i)
{
for(int j = 1;j <= W; ++ j)
{
int x = (W + i + j) / d % 2;
int y = (W + i - j) / d % 2;
printf("%c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:ve... | 0 | 54,159,867 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
ll D;
cin >> D;
ll A;
cin >> A;
vector<P> vec(N);
fo... | 0 | 47,539,531 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, tmp;
long long ans=0;
scanf("%d",&n);
vector<int>a(n+1);
vector<int>b(n);
for(int i=0; i<n+1; i++){
cin >> a[i];
}
for(int i=0; i<n; i++){
cin >> b[i];
}
for(int i=0; i<n; i++){
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, M; cin >> N >> M;
vector<int> A(N);
rep(i, N){
cin >> A[i];
}
vector<int> R(N+1);
R[0] = 0;
rep(i, N){
int r = A[i]... | 0 | 64,976,190 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
#define _GLIBCXX_DEBUG
#define rep(i, a) for(int i = 0; i < a; i++)
#define ALL(v) v.begin(), v.end()
int main(){
int n; cin>>n;
cout<<n/3<<endl;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int x, y, A, B, C;
cin>>x>>y>>A>>B>>C;
vector<ll> a(A), b(B), c(C);
for(int i = 0; i<A; i++) cin>>a[i];
for(int i = 0; i<B; i++) cin>>b[i];
for(int i = 0; i<C; i++) cin>>c[i... | 0 | 47,325,641 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; ... | 0 | 3,968,772 |
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define Tsetso ios_base::sync_with_stdio(0) ; cin.tie(0) ;
using namespace std;
const ll N = 2e5+50, inf = 1e3+5, mod = 1e9+7, NN = 1e5+10;
ll a[N] , b[N];
int main()
{
Tsetso
int n ;
cin >> n;
for ( int i = 0 ; i <= n ; i++)
... | #include<iostream>
#include<vector>
#include<queue>
#include<utility>
using namespace std;
int w,h;
string matrix[20];
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
bool valid(int x,int y)
{
return (x>=0)&&(x<w)&&(y>=0)&&(y<h)&&(matrix[y][x]!='#');
}
int main()
{
while(true)
{
queue<pair<int,int> > q;... | 0 | 95,605,595 |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e2 + 3, mxK = 1e5 + 3, MOD = 1e9 + 7;
int n, k, candies[mxN];
int dp[mxN][mxK], prefix[mxK];
int calc(int i)
{
if (i < 0)
return 0;
return prefix[i];
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> candies[i... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> v(3);
for (int i = 0; i < 3; ++i) cin >> v[i];
sort( v.begin(), v.end() );
for (int i = 0; i < 3; ++i) {
if (i) cout << " ";
cout << v[i];
}
cout << endl;
} | 0 | 27,505,711 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin>>s>>t;
vector<char> s_c(s.size());
vector<char> t_c(t.size());
for(int i=0;i<s.size();i++){
s_c.at(i)=s.at(i);
}
for(int i=0;i<t.size();i++){
t_c.at(i)=t.at(i);
}
sort(s_c.begin(),s_c.end());
sort(t_c.begin(),t_c.end(... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define vc vector;
const int INF = 10000000... | 0 | 49,244,789 |
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n)... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 28,560,369 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<size_t I,class H,class...T>struct TupleReaderWriter{static tuple<H,T...> r(istream&i){H v;i>>v;return tuple_cat(tuple<H>(v),TupleReaderWriter<sizeof...(T)-1,T... | 0 | 55,729,724 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
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() {
string s;
vector<int> used(26, 0);
int cnt = 0;
cin >>... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<iomanip>
#include<iostream>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define MP make_pair
#define F first
#define S second
int main(){
ll n,k;
cin >> n... | 0 | 36,824,213 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(){
double x1, y1, x2, y2, d;
cin >> x1 >> y1 >> x2 >> y2;
d = sqrt(pow((x2-x1), 2)+pow((y2-y1), 2));
cout << fixed << setprecision(12) << d << endl;
return 0;
} | # include<bits/stdc++.h>
using namespace std;
# define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
# define S second
# define F first
# define kill(x) return(cout << x << endl, 0)
# define debug(x) cerr<< #x << " : " << x << endl
# define ddeb... | 0 | 43,012,493 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
int m... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define a... | 0 | 67,521,705 |
#include <iostream>
#include <cmath>
#include <cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c",&ch);
if(isalpha(ch)){
if(islower(ch)){char c=(char)toupper(ch);cout<<c;}
else printf("%c",tolower(ch));
}else printf("%c",ch);
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 1,604,353 |
#include<iostream>
using namespace std;
void counts(int h,int w);
int check[31][31]={0};
char s[31][31];
int dh[4]={-1,0,1,0};
int dw[4]={0,1,0,-1};
int ww,hh;
int counta=0;
main(){
int sw,sh,countx;
while(1){
cin>>ww>>hh;
if(ww==0&&hh==0) break;
for(int i=1;i<=hh;i++){
for(int j=1;j<=ww;j++){
ci... | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | 0 | 46,724,111 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include <ctype.h>
#include <string>
typedef long long ll;
using namespace std;
int main(){
int n;
cin>>n;
vector<ll> vec(n);
rep(i,n){
cin>>vec[i];
}
ll ans=0, zan=0;
rep(i,n-1){
if(vec[i]>=vec[i... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | 0 | 79,303,418 |
#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 <algorithm>
using namespace std;
int main(){
int b[101],a[101],n;
for(int i=0;i<101;i++){
a[i] = 0;
b[i] = a[i];
}
while(cin >> n && n){
a[n] = a[n] + 1;
b[n] = a[n];
}
sort(b,b+101);
for(int i=1;i<101;i++){
if(a[i] == b[100]) cout << i << endl;
}
return 0;
} | 0 | 67,901,095 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 24,429,264 |
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=1007;
char s1[MAXN];
char s2[MAXN];
int dp[MAXN][MAXN];
int main(){
scanf("%s",s1+1);
scanf("%s",s2+1);
for(int i=1;s1[i];i++) dp[0][i]=i;
for(int i=1;s2[i];i++) dp[i][0]=i;
int i=1,j=1;
for(;s2[i];i++){
for(j=1;s... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string S;
cin >> S;
ll K;
cin >> K;
ll siz=S.size();
ll X=0;
ll counter=0;
for(ll i=0;i<siz-1;i++){
if(S.at(i)==S.at(i+1)){counter++;
}
else{
X+=(counter+1)/2;
c... | 0 | 73,334,495 |
#include <bits/stdc++.h>
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)
using namespace std;
using ll = long... | #include <bits/stdc++.h>
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SUM(x) accumulate(rng(x),0)
#define fi first
#define se s... | 0 | 61,533,354 |
#include<stdio.h>
#include<algorithm>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <iostream>
#include <string>
#include <time.h>
#include <functional>
using namespace std;
int dp[1001][1001] = { 0 };
int n, m;
string st1, st2;
int main(void) {
cin >> st1;
cin >> st2;
n... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n... | 0 | 94,879,445 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (... | #include<bits/stdc++.h>
using namespace std;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<lli, lli> pi;
int main()
{
int n, m;
cin >> n >> m;
priority_queue<lli>pq;
vector<pi> v;
for(int i=0; i<n; i++){
lli a, b;
cin >> a >> b;
... | 0 | 84,757,948 |
#include<stdio.h>
int main()
{
int a,n,i,j,s,r;
scanf("%d%d", &n, &a);
if(n<=a)
printf("Yes\n");
else
{
if(n%500<=a)
printf("Yes\n");
else
printf("No\n");
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
vector<LLi> pri={1, 2, 3};
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
void PVL(vector<LLi> pvv) {
rep... | 0 | 78,704,485 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <i... | 0 | 29,516,037 |
#include<iostream>
#include<queue>
using namespace std;
int main(){
priority_queue<int> pq;
string order;
while(true){
cin >> order;
if(order == "insert"){
int key;
cin >> key;
pq.push(key);
}
else if(order == "extract"){
cout<<... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | 0 | 52,791,540 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
cout << N / 3 << endl;
} | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define DBG(...) \
do { \... | 0 | 52,845,151 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << 6/A/B << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int i=0;i<s.size();i++){
char... | 0 | 23,141,055 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.