code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include "bits/stdc++.h"
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef pair<int, int> pii;
typedef vector<int>... | #include <iostream>
using namespace std;
int main(){
while(1){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if(m==0) break;
int cur,prev;
cin >> prev;
int pmax=0,gmax=0;
for(int i=1; i<m; i++){
cin >> cur;
if(nmin<=i && i<=nmax){
... | 0 | 7,331,289 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
int m... | #include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <climits>
#include <stack>
#include <queue>
#include <set>
#include <cctype>
#include <bitset>
#include <type_traits>
#include <list>
using namespace std;
#define REP(i, n) for (long ... | 0 | 31,157,351 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
struct edge {int to; ll cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n, k;
cin >> n >> k;
set<int> st;
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
... | #include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N
#define bit(x,y) ((x>>y)&1LL)
#define loop(x) for(int xv=1; xv<=x; xv++)
#define what_is(x) cerr << #x << " is " << x << endl;
#define error(args...) { s... | 0 | 48,187,245 |
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < m; i++) {
int x; cin >> x;
mp[x] = 1;
}
vector<long long> fibo(2);
fibo[0] = 0;
fibo[1] = 1;
long long md = 1e9 + 7;
for (int i = 1; ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>bool chmax(T &a, const... | 0 | 19,987,375 |
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <list>
using namespace std;
#define FOR( i, k, n ) for ( int i = ( k ); i < ( int )( n ); ++i )
#define REP( i, n ) FO... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 8,241,890 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string a, b;
cin >> a >> b;
if (a.size() > b.size()) cout << "GREATER" << endl;
else if (a.size() < b.size()) cout << "LESS" << endl;
else {
REP(i,a.size()) {
if (a[i] > b[i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <functional>
#include <cctype>
#include <locale>
#define ll long long
#define rep(i,n) for(int i=... | 0 | 59,910,911 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
int main() {
string s; cin >> s ;
int w ; cin >> w ;
rep(i,(s.size()+w-1)/w){
cout<<s[i*w];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> data(n);
for (int i=0;i<n;i++){
int tmp;
cin>>tmp;
data.at(i)=tmp;
}
vector<int> count(200001,0);
for (int i=0;i<n;i++){
count.at(data.at(i))++;
}
sort(count.begin(),count.end());
int plusindex;... | 0 | 19,304,626 |
#include <bits/stdc++.h>
#define trace1(a) cout<<#a<<": "<<a<<endl
#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)
#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)
#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)
#define t... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 0 | 42,260,437 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const double EPS = 1e-10;
const ll INF = 100000000;
const ll MOD = 1000000007;
int n;
ll a[200000];
bool solve(int m) {
vector<P> v;
for (int i = 1; i < n; i++) {
if (a[... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
vector<string> ans;
int main(){
while(1){
string str;
getline(cin,str);
if(str == ".")break;
vector<int> hmk;
vector<int> hkk;
bool balance = true;
for(int i = 0;i < str.size();i++){
if(!balance) break;
if(str[i] == '(') hmk... | 0 | 89,373,540 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,n,k;
cin>>x>>n;
set<int> s;
for(int i=0;i<n;i++){
cin>>k;
s.insert(k);
}
int index;
int mm=INT_MAX;
for(int i=x;i>=-1000;i--){
if(s.count(i)==0){
if(mm>abs(x-i)){
mm=abs(x-i);
index=i;
break;
}... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100010;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0... | 0 | 40,155,191 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using ... | #include <bits/stdc++.h>
using namespace std;
using 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)
int main() {
ll x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c... | 0 | 22,833,030 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
using matrix = vector<vector<uint>>;
template <typename T>
us... | #include <bits/stdc++.h>
#define ull uint64_t
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mx5 100005
#define mx6 1000005
#define mod 1000000007
#define nfs ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main() {
nfs
... | 0 | 63,105,066 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main() {
in... | /*http:
#include <iostream>
#include <vector>
#include <algorithm>
#define MAX 999999
using namespace std;
int num_prime[MAX];
bool not_prime_flag[MAX];
int main()
{
int n;
int max_input;
vector<int> input;
while (cin>>n){
input.push_back(n);
}
max_input=*max_element(input.begin(),input.... | 0 | 11,334,193 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N;
vector<int> a;
bool judge(){
sort(a.begin(),a.end());
int diam=a[N-1];
int mia=0;
if(d... | #include <vector>
#include <math.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <deque>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<long, long>;
template <cla... | 0 | 99,464,060 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i,idx,k,j,n,a[100000],mx=0;
map<long long int,long long int>m;
vector<long long int>v;
cin>>n;
idx=0;
for(i=0;i<n;i++){cin>>a[i];}
sort(a,a+n,greater<int>());
for(i=0;i<n;i++){m[a[i]]++;}
for(j=0;j<n;j++){
if(m[a... | 0 | 72,559,464 |
#include<iostream>
using namespace std;
int doro[20][20];
int ans = 0, a, b;
int jud(int x, int y)
{
if (x>a||y>b)return 0;
if (doro[x][y] == 1)return 0;
if (x == a&&y == b)return 1;
if (a>x)ans += jud(x + 1, y);
if (b>y)ans += jud(x, y + 1);
return 0;
}
int main()
{
int num, x, y;
while (1)
{
ans = 0;
for... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int>P;
int main() {
ll a,b,c;
cin>>a>>b>>c;
for(int i=0;i<b;i++){
cout<<c<<" ";
}
for(int j=0;j<a-b;j++){
if(j==(a-b-1)){
if(c>2){
cout<<c-1<<endl;
}
else{
cout<<c+1<<endl;
}
}
else {... | 0 | 28,050,718 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
void swap(int a,int b) {
int tmp = a;
a = b;
b = tmp;
}
int main(void) {
string s;
cin >>s;
int a = s.size();
for (int i = 0; i < (a - 1) / 2; i++) {
if (s[i] != s[a-i-1]) {
cout << "No" << endl;
return 0;
}
}
... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
string s;
long long k,c=0,ans=0;
cin>>s>>k;
f(i,0,s.size()){
if(s[i]=='1'){
c++;
}
else{
ans=i;
break;
... | 0 | 98,066,738 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, sum = 0;
cin >> a >> b;
sum = a + b;
if (sum % 3 == 0)
cout << "Possible"<<endl;
else if (sum == 0)
cout << "Impossible"<<endl;
else if (b % 3 == 0 || a % 3 == 0)
cout << "Possible"<< endl;
else
cout << "Impossible"<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random... | 0 | 77,536,567 |
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
int n, m, res;
int h[N], e[M], ne[M], id... | #include<iostream>
#include<vector>
int main(void){
int n;
std::cin >> n;
std::vector<int> w(n);
for(int i = 0; i < n; i++){
std::cin >> w[i];
}
int sum = 0;
for(int i = 0; i < n; i++){
sum += w[i];
}
int sum1 = 0;
int sum2;
int ans = 1e9;
for(int i = 0; i... | 0 | 15,376,106 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll n, k; cin >> n >> k;
ll mx = 0;
vector<ll> a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
mx = max(mx, a[i]);
}
if (mx < k) {
... | #include<iostream>
#include<cstdio>
using namespace std;
class Dice {
public:
int face[6];
Dice(int face1, int face2, int face3, int face4, int face5, int face6) {
face[0] = face1;
face[1] = face2;
face[2] = face3;
face[3] = face4;
face[4] = face5;
face[5] = face... | 0 | 100,261,558 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #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 ... | 0 | 61,104,730 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int m;
int s=100000;
cin>>m;
for(int i=0;i<m;i++){
s = s*1.05;
if(s%1000!=0)
s = ((s/1000)+1)*1000;
}
cout<<s<<endl;
return 0;
} | #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 | 38,909,432 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define CFOR(i, str) for(int i = 0; (str)[i]!='\0'; (i)++)
#define FOR(i, s, r) for(int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegi... | 0 | 6,089,514 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <iostream>
#define N 1000000
using namespace std;
char grade_char(int);
int main()
{
int m,f,r,j;
char C[N];
while(1)
{
cin >> m >> f >> r;
if(m==-1&&f==-1&&r==-1) break;
else if(m==-1||f==-1) C[j]=grade_char(0);
else if((m+f>=30&&m+f<50)&&r>=50) C[j]=grade_char(50);
el... | 0 | 73,208,260 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #include <iostream>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <numeric>
#define rep(i, n) for(int i=0; i<(int)(n);i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
t... | 0 | 3,106,271 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,k,s,d=1e9;
cin >> n >> k >> s;
if(s==d) d = 1;
rep(i,k) cout << s << ' ';
rep(i,n-k) cout << d << ' ';
cout << endl;
} | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | 0 | 60,092,293 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int ans = 0;
for(int i=0;i<N;i++){
int X;
int A,B;
cin>>A>>B;
X = B-A+1;
ans+=X;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
#define mp make_pair
#define pb push_back
#define f first
#define s second
int x;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> x;
cout << 360/__gcd(360, x) << endl;
cout.flush();
return 0;
} | 0 | 100,306,747 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string s, t;
cin >> s >> t;
for... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n,h;cin>>n>>h;
int a[n],b[n];rep(i,n)cin>>a[i]>>b[i];
sort(a,a+n,greater<int>());
sort(b,b+n,greater<int>());
int ans = 0;
int i=0;
while(b[i]>a[0]){
h-... | 0 | 7,022,209 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinf... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 0 | 34,383,521 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
const int INF = 2147483647;
const ll MOD =... | 0 | 79,774,908 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
while(!(b>a))
{
b*=2;
k--;
}
while(!(c>b))
{
c*=2;
k--;
}
if(k>=0)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
return 0;
} | #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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 88,951,348 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 1e5 + 5;
int dp[maxn][21] , a[maxn] , n , L;
void solve ()
{
for (int i = 1 ; i <= n ; i++) {
int l = 1 , r = n , mid;
while (l <= r){
mi... | 0 | 47,058,185 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define Time (doub... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main()
{
int n;
cin >> n;
vector<ll> t(n),a(n),b(n);
for(int i = 0;i<n;i++)cin >> t[i];
for(int i = 0;i<n;i++)cin >> a[i];
vector<bool> is(n,true);
is.front() = false;
is.back() = false;
if(n==1)
{
... | 0 | 85,431,634 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define txt \
freopen("ip.txt", "r", stdin); \
freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define ... | 0 | 91,647,318 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <math.h>
#define PREP(i, m, n) for(int i = m; i < n; i++)
#define MREP(i, m, n) for(int i = m - 1; i >= n; i--)
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
ll k, a, b, sol;
bool sameAll(string x) {
for(ll i = 1; i < x.size(); i++) {
if(x[i] != x[i - 1]) return false;
}
return true;
}
ll ganti(string x) {
ll ans = 0;
for(ll i = 0; i < x.size() - 1; i++) {
if(x[... | 0 | 22,398,132 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n;
vector<vector<int>> mat;
for(int i = 0; i<n; i++){
vector<int> arr(3);
for(int i = 0l; i < 3; i++){
cin>>arr[i];
}
mat.push_back(arr);
}
vector<vector<int>> dp(n, vector<int>(3,0));
dp[0][0] = mat[0][0];
dp... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 19,843,451 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
int main(){
ll w,h,n;cin >> w >> h >> n;
vector<string> field(h);
rep(i,h) field.at(i).resize(w);
rep(i,h) rep(j,w) field.at(i).at(j) = 'o';
rep(i,n){
ll x,y,a;cin >> x >> y >... | 0 | 2,780,909 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const string EMP = " ";
const ll INF = 1LL<<60;
const ll MOD = 1000000007;
int m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nax = 1e7+7;
const int MOD = 1e9+7;
int main(){
int n, k; cin>>n>>k;
double ans = 0;
for(int i=1; i<=n; i++){
double tmp = k;
double curr = 1;
while(tmp>i){
tmp/=2;
curr/=2;
}... | 0 | 14,156,902 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define endl "\n"
int main()
{
i64 N;
cin >> N;
i64 ans = 0;
for (i64 i = 1; i <= N; i++)
ans += (N - 1) / i;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(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))
#define VECCIN... | 0 | 25,513,035 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
const int N = 1000000;
int main(){
int x; cin >> x;
if(x < 1200)print("ABC");
else print("ARC");
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, H, maxA = 0;
cin >> N >> H;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
maxA = max(A.at(i), maxA);
}
sort(B.begin(),B.end());
reverse(B.begin(),B.end());
... | 0 | 99,196,712 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x;
cin >> x;
cout << 10 - (x / 200);
return 0;
} | #include <iostream>
int main()
{
int a,hanako = 0,tosiki = 0;
std::cin >> a;
std::string str1,str2;
for(int b = 0; b < a;b++){
std::cin >> str1;
std::cin >> str2;
if(str1 < str2){
tosiki = tosiki + 3;
}
if(str1 > str2){
hanako = hanako + 3;... | 0 | 64,355,631 |
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
queue<int> Q;
int n,u,k,vv,cur,dst;
cin >> n;
vector<int> D(n,-1),check(n,0);
vector< vector<int> > v(n);
for(int i = 0;i < n;++i){
cin >> u >> k;
for(int j = 0;j < k;++j){
cin >> vv;
... | #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 pqueue(x) priority_queue<x,v... | 0 | 2,800,221 |
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> > v[1<<18];
int a[1<<18],tmp;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int m=(1<<n);
for(int i=0;i<m;i++)
cin>>a[i];
for(int i=0;i<m;i++){
v[i].push_back(make_pair(0,-1));
v[i].push_back(make_pair(a[i],i));
if(i... | #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 srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P... | 0 | 58,543,669 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<long long,int> P;
int main(){
string s, ans = "";
cin >> s;
int w;
cin >> w;
for (int ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <climits>
int main()
{
long N,M;
std::cin >> N >> M;
std::vector<std::vector<long> > ship(200000+1);
for(long i=0; i<M; i++){
long a,b;
std::cin >> a >> b;
ship[a].push_back(b);... | 0 | 65,262,497 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD=998244353;
int64_t modpow(int64_t a,int64_t n){
int64_t res=1;
if(n==0) return res;
while(n>0){
if(n&1) res=(res*a)%MOD;
a=(a*a)%MOD;
n >>= 1;
}
return res;
}
int main(){
int N;
cin>>N;
vector<int64_t> D(N);
for(int i=0;i<N;++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int> > vvint;
typedef vector<pair<int, int> > vpii;
typedef vector<p... | 0 | 61,130,970 |
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long int modpow(int b, int p){
long long int num = 1, power = b;
for(int i=0; i<=30; i++){
if((p>>i) & 1) num *= power;
num %= MOD;
power *= power;
power %= MOD;
}
return num;
}
int main... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
int main() {
int N;
long long ans =1, l_1 = 1, l_2 = 2;
cin >> N;
if (N == 1) {
cout << 1 << endl;
return 0;
}
rep(i, N) {
ans = 0;
ans = l_1 + l_2;
l_2 = l_... | 0 | 3,212,466 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
#include <unordered_map>
using namespace std;
int main(){
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> AB(N);
int a, b;
for(int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main()
{
string A;
cin >> A;
for (int bit = 0; bit < (1 << 3); bit++)
{
bitset<3> s(bit);
float sum = A.at(0) - '0';
rep(i, 3)
{
if (s.test(i))
{
sum += A.a... | 0 | 30,104,117 |
#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... | #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<deque>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll LLINF = 1001001001001001001;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main()
{
... | 0 | 46,181,993 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int r,l;
int rmax = 0, lmin = n;
vector<int> c(n+1);
for(int i = 0; i < m; ++i){
cin >> r >> l;
rmax = max({rmax,r});
lmin = min({lmin,l});
}
int res = max({lmin-rmax+1,0});
cout << res << endl;
} | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace s... | 0 | 10,178,093 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int y,m,d;
char a,b;
cin>>y>>a>>m>>b>>d;
if(m <= 04){
cout<<"Heisei";
}
else{
cout<<"TBD";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef long long ll;
typedef ... | 0 | 29,575,350 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 5e2 + 2;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
int sum = 0;
for (int i = 0, x; i < m;... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>... | 0 | 80,474,683 |
#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... | #include<bits/stdc++.h>
#define ll long long
#define FI freopen("input.txt","r",stdin)
#define FO freopen("output.txt","w",stdout)
#define PrintCase(i) printf("Case %d: ",i)
#define sc(a) scanf("%d",&a)
#define scl(a) ... | 0 | 30,483,360 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int n,a;
cin>>n>>a;
n*=n;
n-=a;
cout<<n<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
int main(int argc, char **argv)
{
ll N, K, S; cin >> N >> K >> S;
vector<ll> res;
for (ll i = 0; i < K; ++i)
res.push_back(S);
ll t;
if (S == 1000000000)
t = 1000000000-1;
else
t = ... | 0 | 42,054,642 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
string s; cin >> s;
for(int i = 0; i <4; i++){
if((i == 0 && s[i] != 'Y' ) || (i == 1 && s[i] != 'A')
|| (i == 2 && s[i] != 'K') || (i == 3 && s[i] != 'I' )){
cout << "No" << endl;
... | #include <iostream>
using namespace std;
struct Heap {
int *heapTable;
int length;
int curr;
Heap () {
this->heapTable = new int[20000001];
this->length = 0;
this->curr = 1;
}
void add (int valor) {
this->heapTable[this->curr] = valor;
this->curr++;
... | 0 | 29,862,156 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout<<x<<"\n";
#define deB(x,y) cout<<x<<" "<<y<<"\n";
#define Deb(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n";
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";... | 0 | 88,656,393 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
cin>>n>>m;
k=n*m;
if(k%2==0)
cout<<"Even"<<endl;
else
cout<<"Odd"<<endl;
return 0;
} | #include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | 0 | 66,751,157 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll ans[2001];
int main() {
int s;
cin >> s;
for(int i = 3; i < 2001; ++i) {
ans[i] = 1;
}
for(int i = 3; i <= s; ++i) {
for(int j = 3; j <= i; ++j) {
ans[i] = (ans[i] + ans[i-j]) % m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
int main() {
int n; cin >> n;
int adj[n][n] = {};
for (int i = 0; i < n; i++) {
int u, k; cin >> u >> k;
for (int j = 0; j < k; j++) {
int v; cin >> v;
adj[u-1][v-1] = 1;
}
}
int d[n];
fill(... | 0 | 47,705,955 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | #include <iostream>
#include <utility>
#include <string>
using namespace std;
struct Card{char suit; int value;};
void bubbleSort(struct Card C[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(C[j].value<C[j-1].value) swap(C[j],C[j-1]);
}
}
}
void selectionSort(struct Card C[],int n){
for(... | 0 | 14,459,510 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tup... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP0(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)
#define RREP0(i,n) for(int i=n-1; i>=0; --i)
#define RREP1(i,n) for(int i=n; i>=1; --i)
#define SORT(c) sort(... | 0 | 54,182,115 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> vs;
for (int i = 0... | 0 | 4,027,820 |
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define ll long long
using namespace std;
int main() {
string s, t, r;
cin >> s >> t >> r;
char ss = s[0] - 0x20, tt = t[0] - 0x20, rr = r[0] - 0x20;
cout << ss << tt << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
#define rep1(i,n) for(int i=1;i<=int(n);++i)
int main(void){
int n;
cin >> n;
vector<ll> a(n+1), p(n+1), s(n+1);
rep(i,n+1) {
cin >> a[i];
}
... | 0 | 9,838,575 |
#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 FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<P>>;
int main() {
int N;
cin >> N;
Graph G(N);
rep(i, N-1) {
int a, b, c;
cin >> a >> b... | 0 | 25,260,673 |
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
double n, m, d;
cin >> n >> m >> d;
cout << setprecision(12) << fixed << (d == 0 ? 1 : 2) * (m - 1) * (n - d) / (n * n) << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
while( true ) {
long long int n;
cin >> n;
if ( n == 0 ) break;
long long int ans = 0;
long long int k = 0;
long long int l = 0;
long long int r = 0;
for ( long long int i = 0; i < n; i++ ) {
string in;
... | 0 | 85,797,546 |
#include <iostream>
int main()
{
int i = 1;
while (1)
{
int a;
std::cin >> a;
if (std::cin.eof()) {
break;
}
if (a != 0) {
std::cout << "Case " << i << ": " << a << std::endl;
i += 1;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int i,m,nmin,nmax,a[200],gap,n;
while(1){
cin >> m >> nmin >> nmax;
if(m==0 && nmin == 0 && nmax == 0) break;
for(i=1;i<m+1;i++){
cin >> a[i];
}
gap = a[nmin] - a[nmin+1];
n = nmin;
for(i... | 0 | 86,378,247 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI=acos(-1.0);
ll a,b,c,k;
void input()
{
cin>>a>>b>>c>>k;
}
void solve()
{
if(k<=a) cout<<k<<endl;
else if(k<=a+b) cout<<a<<endl;
... | #include<bits/stdc++.h>
using namespace std ;
int main(){
string S ;
cin >> S ;
int N ;
N = S.size() ;
int cnt = 0 ;
for(int i = 1 ; i < N ; i++){
if((N-i)%2 == 0){
for(int j = 0 ; j < (N-i)/2 ; j++){
if(S.at(j) != S.at((N-i)/2 + j)){
cnt++ ;
}
}
if(cnt ... | 0 | 48,055,551 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) f... | #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int sum_of_digits(int n){
int sum = 0;
while(n>0){
sum += n%10;
n/=10;
}
return sum;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
... | 0 | 76,419,645 |
#include <iostream>
#include <algorithm>
using namespace std;
void nextRand(int *x,int a,int b,int c){
*x = (a * (*x) + b) % c;
}
int main(){
while(true){
int n;
int a,b,c;
int x;
cin >> n >> a >> b >> c >> x;
if(n==0){
break;
}
int *reels = new int[n];
for(int i=0;i<n;i++){
cin >> reels[i];
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#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);(i... | 0 | 98,934,916 |
#include <bits/stdc++.h>
using namespace std;
int conv(char c){
for (int i = 50; i<=57; i++){
if (c == i){
return i-48;
}
}
}
int main(){
string s;
cin >> s;
int64_t k;
cin >> k;
int answer = 1;
for (int64_t i = 0; i<k; i++){
if (s.at(i) != '1'){
... | #include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
void print(std::string s, int shuffle_num);
int main(void) {
std::string s;
int m;
std::cin >> s >> m;
while(s != "-") {
int shuffle_num = 0;
for (int i = 0; i < m; i++) {
int temp;
std::ci... | 0 | 15,129,772 |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(is... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int,int> cnt;
for(int i=0; i<n; i++){
int a;
cin >> a;
cnt[a]++;
}
ll ans=0;
for(auto p: cnt){
int x,num;
x = p.first;
num= p.second;
if... | 0 | 31,114,486 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-1; (i) >= (int) (b... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = ... | 0 | 80,642,243 |
#include <cstdio>
#include <algorithm>
#include <climits>
typedef long long ll;
const int max_t = 20;
ll dist[max_t][max_t];
int main() {
while (1) {
int n, t = 0;
scanf("%d", &n);
if (n == 0) break;
for (int i = 0; i < max_t; i++) {
std::fill(dist[i], dist[i] + max_t, INT_MAX);
}
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
int blank = 16 - (A + B);
int flag = 0;
if(A<B){
swap(A,B);
}
for(int i=0; i <= blank; i++){
int C = A - i;
if(abs(C - B) == 1 || abs(C - B) == 0){
flag = 1;
}
... | 0 | 63,824,959 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 5005;
const int MAX_K = 5005;
int N, K;
vector<int> a;
bool dp[MAX_N][MAX_K];
bool solve(int x){
memset(dp, false, sizeof(dp));
dp[... | #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 | 19,842,889 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n ;
cin >> n ;
vector<ll> ans(n);
vector<ll> a(n);
rep(i, n){
cin >> a[i];
}
map<ll,pair<ll,ll>> m;
rep(i,n){
m[a[i]].first++;
if(m[a[i]].first==1)m[a[i]].second=i+1;
}
ll num=0,c... | 0 | 45,891,803 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 2e5 + 5;
const int mod = 1e9 + 7;
int add(int x, int y) {
return ((x + y) % mod + mod) % mod;
}
int mul(int x, int y) {
return (1LL * x * y) % mod;
}
int fp (int x, int y) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
constexpr int ms = 1001;
constexpr ll mod = 1e9+7;
void solve() {
int h, w;
cin >> h >> w;
ll dp[ms][ms];
memset(dp, -1, sizeof(dp));
vector<string> vs(h);
for (int i = 0; i < h; ++i) {
cin >> vs[i];
}
function<ll... | 0 | 13,147,144 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef pair<int, int> P;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
int N; cin >> N;
int A[N];
rep(i, N) cin >> A[i];
vector<P> l;
rep(i, N) l.pb(P(A[... | 0 | 58,835,322 |
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
vector<vector<char>> c(52, vector<char>(52));
int H, W, cnt;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> c[i][j];
}
for (int ... | 0 | 69,465,760 |
#include <bits/stdc++.h>
using namespace std;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int H, W;
cin >> H >> W;
string s[60];
for (int i = 0; i < H; i++) cin >> s[i];
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (s[i][j] == '.') continu... | #include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define RS resize
#define CLR clear
#define PB push_back
#define ALL(x) ... | 0 | 77,750,637 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long i,j,k,a,b,c=0,d=0,n,m,t;
cin>>a>>b>>c>>d;
n=min(a,b);
m=min(c,d);
cout<<n+m;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
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... | 0 | 42,545,164 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n,p;
cin>>n>>p;
cout<<(n+1)-p<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,a,b;
cin >> n >> a >> b;
if (a <= b){
if (n == 1){
if (a == b){
cout << 1 << endl;
}
else{
cout <<... | 0 | 44,906,885 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int bfrv[4][3][10] = {0};
int n;
cin >> n;
int t = n;
int b, f, r, v;
while (t)
{
cin >> b >> f >> r >> v;
bfrv[b-1][f-1][r-1] += v;
t--;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for... | 0 | 4,452,255 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 7,946,046 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | 0 | 31,085,129 |
#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 <vector>
#include <utility>
#include <string>
#include <map>
#include <algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int>a(n);
rep(i,n){
cin >> a[i];
}
sort(a.rbegi... | 0 | 66,789,363 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n, m;
cin >> n >> m;
int x[n+1], y[m+1];
cin >> x[0] >> y[0];
for(int i=0; i<n; i++) cin >> x[i+1];
for(int i=0; i<m; i++) cin >> y[i+1];
sort(... | #include <iostream>
#include<string>
using namespace std;
int main()
{
int n;
int b;
int f;
int r;
int v;
int count[4][3][10]={0};
int i;
int j;
int k;
cin >> n;
for(i=0;i<n;i++)
{
cin >> b >> f >> r >>v;
count[b-1][f-1][r-1]+=v;
}
for(i=0;i<4;i++)
{
for(j=0;j<3;j++)
{
... | 0 | 23,585,296 |
#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i <= (ll)(n); ++i)
#define MAX 500000001000000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N,M;
cin >> N >> M;
ans... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n,m;
cin >> n >> m;
vector<vector<ll>>s(m);
for(ll i=0;i<m;i++){
ll k;
cin >> k;
for(ll j=0;j<k;j++){
ll x;
cin >> x;
s[i].push_back(x-1);... | 0 | 60,405,948 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define nl cout<<"\n"
#define dbg(x) cout<<x<<" ";
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define UM unordered_map<int,int>
#define ULL unordered_map<ll,int>
void fun(){
int n,m,x,y; cin>>... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
ll stock=0;
ll yen=1000;
int i=0;
while(i<n)
{
while(i+1<n&&a[i]>=a[i+1])
{
i++;
}
... | 0 | 77,910,283 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
ll mod=1e9+7;
vector<ll> tfact(1e7+1);
void fact(ll n) {
for(ll i=0;i<=n;i++) {
if(i==0) {
tfact[i]=1;
}
else {
tfact[i]=tfact[i-1]*i%mod;
}
}
}
int main() {
ll n;
string s;
cin >> n >> s;
... | 0 | 12,090,742 |
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 0 | 76,309,199 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = ... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 97,222,674 |
#include<bits/stdc++.h>
int main(){
int N,K;
std::cin>>N>>K;
std::vector<long long> A(N),S(N+1),black(N+1);
for(int i=0;i<N;++i){
std::cin>>A[i];
S[i+1]=S[i]+A[i];
black[i+1]=black[i]+((A[i]>0)?A[i]:0);
}
long long ans=-1e18,tmp;
for(int i=0;i<=N-K;++i){
tmp =... | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#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--... | 0 | 77,063,604 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
ll n;
ll add(ll x, ll y){
if(y < 0){
return (x + y + n) % n;
}else{
return (x + y) % n;
}
}
int main(){
cin.tie(0);
ios_b... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
ll n;
ll a;
ll b;
ll x = 0;
ll y = 0;
ll ans = 0;
cin >> n >> a >> b;
x = n % (a+b);
y = n / (a+b);
if (x ... | 0 | 35,971,215 |
#include <iostream>
int main(){
int a, b, c, count=0;
std::cin >> a >> b >> c;
for(; a <= b; a++) if(c%a==0) count++;
std::cout << count << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
const int mod = (int) 1e9 + 7;
int mul(int a, int b) {
return (long long) a * b % mod;
}
int main() {
int n;
string s;
cin >> n >> s;
vector<int> color;
for (auto c : s) {
color.push_back(c == 'B');
}
int res = 1, choices = 0;
for (auto c : color) {
... | 0 | 2,067,306 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#defin... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | 0 | 44,894,426 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
int main()
{
int n, p;
cin >> n >> p;
string s;
cin >> s;
if(10 % p == 0 ){
ll ans = 0;
rep(r,n){
if((s[r] - '0') % p == 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, o, p;
int n, a, b;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> o >> a >> b;
p = s.substr(a, b - a + 1);
if (o == "print") {
cout << p << '\n';
continue;
} else if (o == "reverse") {
reverse(p.begin(), ... | 0 | 26,048,506 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<vector<int>> W(M);
for (int i = 0; i < N; i++){
int A, B;
cin >> A >> B;
if (M - A >= 0){
W[M - A].push_back(B);
}
}
int ans = 0;
priority_queue<int> pq;
for (int i = M - 1; i >= 0; i--){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 55;
ll n, x, ans;
ll dp[50], len[50];
void sim(int layer) {
if (!x) return;
if (layer == 0) {
x--;
ans++;
} else {
x--;
if (!x) return;
if (x >= len[layer - 1]) {
x -= len[la... | 0 | 93,951,016 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | #include <iostream>
#include<time.h>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include... | 0 | 80,795,828 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(long long int i = 1;i <= n; i++)
#def... | 0 | 51,378,539 |
#include<iostream>
#include<vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= end; --i)
#define arep(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main () {
ll r, l ;
cin >> l >> r ;
... | 0 | 20,661,056 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int INF=1e9;
int main(){
ll n,k;
ll a[100100];
whil... | 0 | 90,609,212 |
#include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define db double
#define inf 200001
#define IN... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define INF 10000000000000000
#define rep(i,n) for(int i=0;i<n;i++)
int n,a,b;
signed main(){
cin>>n>>a>>b;
if(a+b-1>n||a*b<n){
puts("-1");
return 0;
}
int x=n-a;
for(int i=n-a+1;i<=n;i++)cout<<i<<" ";
for(int i=2;i<=b;i... | 0 | 6,153,096 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.