code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int x,y,z,n,m;
char tmp;
pair<int,int> ar[100005];
string s1,s2;
int main() {
cin >> x;
for (int i = 0; i < x; i++) {
cin >> ar[i].first;
ar[i].second = i;
}
stable_sort(ar,ar+x);
for (int i = 0; i < x; i++) {
if (ar[i].second%2 != i%2) {
n++;
}
}
cout <<... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#inclu... | 0 | 20,480,180 |
#define _GIBCXX_DEBUG
#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 namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
int main(void) {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0... | #include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#define _USE_MATH_DEFINES
#include<math.h>
#include<unordered_map>
#define min(a,b) (a)>(b)?(b):(a)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
int main()
{
double a, ... | 0 | 3,828,430 |
#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)... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define Fast_Input ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds... | 0 | 96,536,329 |
#include <stdio.h>
#include <string.h>
int main (){
char A[12],B[12],C[12];
scanf("%s %s %s", A, B ,C);
for(int i = 0; i < strlen(A); i++){
if(A[i] >= 'A' && A[i] <= 'Z'){
return 1;
}
}
for(int i = 0; i < strlen(B); i++){
if(B[i] >= 'A' && B[i] <= 'Z'){
... | #include<bits/stdc++.h>
#define rp(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,k;
cin >> n >> k;
string s;
cin >> s;
deque<int> seq;
int ctr=1;
rp(i,n-1){
if(s.at(i)==s.at(i+1)) ctr++;
else{
seq.pu... | 0 | 41,875,005 |
#include <bits/stdc++.h>
#include <chrono>
#include <algorithm>
#include <signal.h>
#include <thread>
#include <pthread.h>
#include <omp.h>
#define pb push_back
#define fi first
#define se second
#define Vi vector<int>
#define Vb vector<bool>
#define Pi pair<int, int>
#define MP make_pair
#define MT make_tuple
#define ... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 0 | 4,059,472 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, clas... | #include<iostream>
#include<vector>
#include<math.h>
using namespace std;
int main(){
int N,D;
cin>>N>>D;
vector<vector<int>>X(N,vector<int>(D));
for(int i=0;i<=N-1;i++){
for(int j=0;j<=D-1;j++){
cin>>X[i][j];
}
}
int ansint=0;
double ansdouble=0;
int distance=0;
int ans=0;
for(int i=0... | 0 | 90,247,357 |
#include <stdio.h>
int selectionSort(int* A, int N) {
int flag = 1;
int counter = 0;
int i;
for (i=0; i<N; i++) {
int j, minj = i;
for(j=i; j<N; j++) {
if (A[j] < A[minj])
minj = j;
}
if (i != minj) {
int tmp;
tmp = A[i];
A[i] = A[minj];
A[minj] = tmp;
coun... | #include <iostream>
#include <cmath>
using namespace std;
int main(void)
{
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if (((x2-x1)==0) && ((x4-x3)==0))
cout << "YES" << endl;
... | 0 | 94,498,879 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[200010],vis[200010];
vector<int>v;
int main(){
char a,b;
cin>>a>>b;
if(a=='H')
{
if(b=='H')cout<<'H';
if(b=='D')cout<<'D';
}
else
{
if(b=='H')cout<<'D';
if(b=='D')cout<<'H';
}
r... | 0 | 16,150,712 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=2e5;
int n;
ll d, a, ans, c[mxN+1];
ar<int, 2> b[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> d >> a;
for(int i=0; i<n; ++i) {
cin >> b[i][0] >> b[i][1];
}
sort(b, b+n);
for(int i=0, j=0; i<... | 0 | 64,438,464 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n;
cin>>n;
string s[60];
rep(i,n)cin>>s[i];
string ans;
for(char c='a';c<='z';c++){
int small=300;
for(int i=0;i<n;i++){
int cnt=0;
... | 0 | 16,495,242 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int a,b,c;
cin>>a>>b>>c;
if(a==b && b==c)cout<<"Yes";
else cout<<"No";
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int n, s;
int table[50010];
int main() {
cin >> s>>n;
vector<int>v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(),v.end());
table[0] = 0;
for (int i = 1; i <= s; i++)
t... | 0 | 13,957,066 |
#include <iostream>
#include <climits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int w, h, n;
cin >> w >> h >> n;
vector <vector<int>> x_y_a(n);
for(int i = 0; i < n; i ++){
int x, y, a;
cin >> x >> y >> a;
x_y_a[i].push_back(x);
x_y_a[i].push_back(y);
x_y_a[i].push_back(a);
}
v... | 0 | 35,131,002 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
int main() {
ll N;
cin >> N;
ll ans = 1, bCnt = 0;
FOR(i, 2, N + 1) {
ll tmp = i, cnt = 0;
while(tmp % 2 == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
int main(){
int n;
cin>>n;
vector<int> dat(n+1);
rep(i,n){
cin>>dat[i];
}
sort(dat.begin(),dat.end());
reverse(dat.begi... | 0 | 99,456,153 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(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 > b) { a = b... | 0 | 87,309,092 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | #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<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element... | 0 | 74,876,139 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #include<bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull unsigned long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boost ios_bas... | 0 | 58,083,029 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
typedef p... | #include <bits/stdc++.h>
using namespace std;
int count_ab(const string& str) {
int ret = 0;
for(int i=0;i<str.length()-1;i++) {
if(str[i] == 'A' && str[i+1] == 'B') {
ret++;
}
}
return ret;
}
int main() {
int N; cin >> N;
int has_AB = 0;
int has_A = 0;
int h... | 0 | 61,751,581 |
#include <bits/stdc++.h>
#define mp make_pair
#define f1 first
#define f2 second
#define pb push_back
#define pii pair<int ,int>
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int mox=1e5+9;
vector<int> v[mox];
bool ok[mox];
bool ans;
voi... | #include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
int ret_value = 1;
if (s == "RRR")
ret_value = 3;
else if (s == "SSS")
ret_value = 0;
else if (s == "RRS" || s == "SRR")
ret_value = 2;
cout << ret_value;
return 0;
} | 0 | 43,404,618 |
#include <iostream>
#include <string>
using namespace std;
int main () {
string s;
cin >> s;
for (int i = 0; i < (int) s.size(); i++) {
cout << s[i];
if (i == 3) cout << ' ';
}
cout << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 86,274,247 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
ll gcd(ll a , ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll lcm(ll... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | 0 | 19,913,407 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using boost::multiprecision::cpp_int;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll,pair<ll, ll>> lpll;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
#define deg_to_rad(deg) (((de... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,d;
... | 0 | 66,841,457 |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int cnr[2000][2000];
int cnl[2000][2000];
int main() {
int h, w;
cin >> h >> w;
vector<stri... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int n,m; cin>>n>>m;
int mn=1, mx=n;
rep(i,m){
int l,r; cin>>l>>r;
mn=max(mn,l);
mx=min(mx,r);
}
if(mx-mn<0) cout<<0<<endl;
else cout<<mx-mn+1<<endl;
} | 0 | 100,441,451 |
#include<bits/stdc++.h>
using namespace std;
long long dp[103][4][2], mod = 1e9 + 7;
int k, n;
string s;
long long solve(int pos, int occ, bool flag){
if(occ > k){
return 0;
}
if(dp[pos][occ][flag] != -1){
return dp[pos][occ][flag];
}
if(pos == n){
if(occ == k){
d... | #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;
}
ll runrun(ll a) {
queue<ll> Q;
for (ll i = 1; i < 10;i++) {
Q.push(i);
}
ll count = 1;
while (1) {
ll x = Q.front();
Q.pop();
if (a==count) {
return x;
... | 0 | 23,104,803 |
#include<iostream>
using namespace std;
int main(){
int N;
cin>>N;
bool f=false;
int y=0,x=0,t=0;
for(int i=0;i<N;i++){
int ti,xi,yi;
cin>>ti>>xi>>yi;
auto d=abs(y-yi)+abs(x-xi);
auto td=ti-t;
f|=td<d||d-td&1;
t=ti;
y=yi;
x=xi;
}
cout<<(f?"No":"Yes")<<endl;
} | #line 1 "test/atcoder/practive2-a.cpp"
#include <iostream>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
int main() {
int n, q; cin >> n >> q;
dsu d(n);
for (int i = 0; i < q; ++i) {
int t, u, v; cin >> t >> u >> v;
if (t == 0) {
d.merge(u, v);
}
... | 0 | 3,823,931 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int test=1;
while(test--){
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int s=0;
for(int i=0;i<k;i++) s+=a[i];
cout<<s;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N, H;
cin >> N >> H;
vector<pair<int, int>> katana;
int maxA = 0;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
if (a > maxA) {
maxA = a;
... | 0 | 9,646,931 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>
#include <stack>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, std::string S) {
char before = S[0];
ll ans = 1;
for (ll i = 1; i < N; i++) {
if (S[i] != before) {
ans++;
}
before = S[i];
... | 0 | 83,727,090 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int q,a,b;
string str,odr,p,pri;
cin >> str >> q;
for(int i=0; i<q; i++){
cin >> odr;
if( odr == "print"){
cin >> a >> b;
cout << str.substr(a,b-a+1) << endl;
}
else if( odr == "reverse"){
ci... | #include <bits/stdc++.h>
#define spc ' '
#define endl '\n'
using namespace std;
int main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b, c, m;
cin >> a >> b >>c;
m = a;
for(int i=0;i<b;i++){
a%=b;
if(a==c){
cout << "YES";
return 0;
}
a+=m;
}
cout << "NO... | 0 | 64,082,537 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | #include <bits/stdc++.h>
using namespace std;
int i=2;
void R(unsigned long long int a,unsigned long long int b,int n){
if(n < 2){
cout << 1 << endl;
return;
}
else{
unsigned long long int l = b;
unsigned long long int r = a+b;
if(i == n){
cout << r << end... | 0 | 33,696,966 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
map<char, int> M;
for(int i=0; i<s.length(); i++){
M[s[i]]++;
}
bool flag = true;
for(auto i : M){
if(i.second>1){
fla... | #include <iostream>
#include <unordered_set>
using namespace std;
int main()
{
int n;
cin >> n;
string s, t;
unordered_set<string> d;
while (n--) {
cin >> s >> t;
switch(s[0]) {
case 'i':
d.insert(t); break;
case 'f':
cout << (d.find(t) != d.end() ? "yes" : "no") << endl;
}
}
} | 0 | 39,946,846 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a,int b)
{
if(a==0) return b;
return gcd(b%a,a);
}
int32_t main()
{
int t,n,i,j,k,l=0,max1=0;
cin>>n;
int a[n+1];
for(i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+n+1);
k=a[n];
map<int,int> m;
for(i=1;i<=n;i++) m[a[i]]++;
bool h... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 84,659,664 |
#include <bits/stdc++.h>
using namespace std;
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define f first
#define s second
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
typedef long long ll;
typedef long double lld;
type... | #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... | 0 | 79,630,583 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | #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... | 0 | 44,541,022 |
#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(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int w, h... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 64,922,465 |
#include <bits/stdc++.h>
using namespace std;
int64_t f (int64_t x, int64_t i) {
int64_t ans = (int64_t(1) << i) * (x >> (i + 1));
if (x % (int64_t(1) << (i + 1)) >= (int64_t(1) << i))
ans += x % (int64_t(1) << (i + 1)) - (int64_t(1) << i) + 1;
return ans;
}
signed main () {
int64_t a, b;
ci... | #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 mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 0 | 54,447,757 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
int c[N],a[N];
int gcd(int n,int m){
if(m==0)return n;
return gcd(m,n%m);
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
c[a[i]]++;
}
int _gcd=0,f=0;
for(int i=0;i<n;i++){
_gcd=gcd(_gcd,a[i]);
}
for(int i=2;i<N;i++){
in... | #include <stdio.h>
int main(){
int a1, b1, k;
scanf("%d", &k);
scanf("%d %d", &a1, &b1);
int ans=0;
for(int i = a1; i <=b1; i++){
if(i%k==0){
ans++;
}
}if(ans>0){
printf("OK\n");
}else {
printf("NG\n");
}
return 0;
} | 0 | 100,883,736 |
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = (int)1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, s;
cin >> n >> k >> s;
if (s == INF) {
vector<int> ans(n, 1);
for (int i = 0; i < k; i++) {
ans[i] = INF;
}
for (const auto& e : ans) {
cout <... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+9;
int a[maxn];
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
while(k--)
{
int b[maxn];
memset(b,0,sizeof(b));
for(int i=1;i<=n;i++)
{
int l = max(1,i-a[i]);
... | 0 | 51,872,407 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define clr(v) v.clear()
vector<ll>v;
pair<ll,ll>p;
map<ll,ll>mp;
set<ll>st;
deque<ll>dq;
priority_queue<ll>pq;
#define f(i,b) for(i=0;i<b;i++)
#define f1(i,b) for(i=1;i<... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 4,537,809 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<string>
#include<iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
int n, m;
void calc() {
vector<pair<int, int> > v(n);
... | #include<stdio.h>
void sort(int p[],int n);
void sort(int p[],int n)
{
int i,j,temp;
for (i = 0; i < n - 1; i++) {
for (j = n - 1; j > i; j--) {
if (p[j-1] > p[j]) {
temp = p[j];
p[j] = p[j-1];
p[j-1] = temp;
}
}
}
}
in... | 0 | 72,535,764 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout ... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | 0 | 25,835,571 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n, a, b; cin >> n >> a >> b;
wh... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begi... | 0 | 75,439,294 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <string.h>
using namespace std;
queue<int> q;
vector<vector<int> > v(101);
int dp[101];
int n, t = 0;
int main() {
cin >> n;
for (int i = 0; i < n;i++) {
int u, k; cin >> u >> k;
for (int j = 0; j < k;j++) {
int x; cin >> x;
... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
string str1,str2;
vector<int> ans(n);
cin.ignore();
for(int i=0; i<n; i++){
vector<char> a;
vector<char> b;
getline(cin,str1);
for(int j=0; j<(int)str1.size(); j++){
char ch=str1[j];
a.push_back(c... | 0 | 75,209,919 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
int count=1;
if(a==b){
count++;
if(b==c){
count++;
}
}
else if(a==c){
count++;
}
else if(b==c){
count++;
}
cout<<4-count<<endl;
} | #include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
std::cin >> n;
std::vector<std::complex<double>> v;
for (int i = 0; i < n; i++) {
double x, y;
std::cin >> x >> y;
v.emplace_back(x, y);
}
std::sort(v.begin(), v.end(), [](auto lhs, auto rhs) { return std... | 0 | 16,563,091 |
#include <bits/stdc++.h>
using namespace std;
#define LL unsigned long long
#define sigma_size 30
#define max_size (int)(1e6+10)
#define MAX (int)(1e5+7)
int main ()
{
LL s;
scanf ( "%lld",&s );
int a , b , c , d;
a = d = (int)sqrt(s);
b = c = 0;
while ( s > 1ll * a * d ){
if ( a < d ) a++;
else d++;
}
LL k... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans=0;
void Main(){
int whi,hhi,n,wlo=0,hlo=0;
cin>>whi>>hhi>>n;
For(i,0,n){
int x,y,a;
cin>>x>>y>>a;
if(a==2){
whi=min(... | 0 | 79,626,840 |
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <bitset>
#include <cstring>
#include <iostream>
#include <algorithm>
#define maxn 100010
using namespace std;
void write(int x){if(x<0){putchar('-');x=-x;}if(x>9) write(x/10);putchar(x%10+'0');}
int read(){int d... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n+1, 0), b(n, 0);
for (int i = 0; i < n+1; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] == 0) continue;
if (b[i] <= a[i]) {... | 0 | 52,486,962 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,l) for(lli i=s;i<l;i++)
#define DEBUG 0
#define INF (1LL<<50)
#define MOD 1000000007
bool comp(int a, int b){
return (a<b);
}
int main(){
string a, b; cin >> a >> b;
if(a<b){
REP(i,0,stoi(b)) cout << a;
}
... | #include<stdio.h>
int main(){
int a,b,c,d,kazu=0;
scanf("%d %d %d",&a,&b,&c);
for(d = a;d<=b;d++){
if((c%d)==0){
kazu++;
}
}
printf("%d\n",kazu);
return 0;
} | 0 | 72,696,933 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,k,i,ans;
scanf("%d %d %d %d",&a,&b,&c,&k);
if(k<=a)ans=k;
else if(k<=a+b)ans=a;
else ans=2*a+b-k;
printf("%d\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
u... | 0 | 61,586,921 |
#include <iostream>
using namespace std;
#define MAX 10000
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
void print(int H, int A[]) {
for (int i = 1; i <= H; i++) cout << A[i] << " ";
cout << endl;
}
int main()
{
int H, i, A[MAX+1];
cin >> H... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
int gcd(int a, int b){
if(!a) return b;
return gcd(b%a,a);
}
int lcm(int x, int y){
if(x == 0 || y==0) return 0;
return x/gcd(x, y) *y;
}
signed main(){
int N, M... | 0 | 10,480,181 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
int ans = 0, count = 0;
for(int i = 0; i < n; i++){
if(a[i] == a[i + 1]) count++;
else{
ans += (count + 1) / 2;
count = 0;
}
}
cout << (ans + (count... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 9223372036854775807;
ll N, K;
vector<ll > X;
vector<ll > Y;
ll check(ll x1, ll x2, ll y1, ll y2){
ll c... | 0 | 4,283,107 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,M;
cin>>N>>M;
priority_queue<ll> S;
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
S.push(A);
}
for(ll i=0;i<M;i++) {
ll K=S.top()/2;
S.pop();
S.push(K);
}
ll ans=0;
while(!S.empty()) {
... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | 0 | 14,313,433 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
bool exist=false;
int p=N/4;
if(N/4!=0){
p++;
}
rep(x,p+1){
rep(i,p+1){
if(N==4*i+7*(x-i)){
exist=true;
... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vint;
typedef vector<double> vdou ;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<ll,ll> pll ;
typedef vector<pii> vpii ;
typedef vector<p... | 0 | 64,703,667 |
#include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
int main(void) {
while (true) {
int M, F, R;
cin >> M >> F >> R;
if (M + F + R == -3) { break; }
char seiseki = 'A';
int total = M + F;
if (M == -1 || F == -1 || total < 30) {
se... | #include <bits/stdc++.h>
using namespace std;
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; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | 0 | 68,826,109 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define fast ios::sync_with_stdio(false); cin.tie(NULL);
#define loop(n) for(int i=0; i<n; i++)
#define rep(i,start,n) for(int i=start; i<n; i++)
bool check(string s,int n){
int mid = n/2;
int st = 0;
while(st!=n/2){
if(s[st]!=s[... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H, W, i, j;
cin >> H >> W;
vector<vector<char>> a(H, vector<char>(W));
vector<int> wc(H, 0), hc(W, 0);
for(i=0; i<H; i++){
for(j=0; j<W; j++){
cin >> a[i][j];
}
}
for(i=0; i<H; i++){
for(j=0; j<W; j++){
if(a[i][j] == '#')... | 0 | 60,707,560 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #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 | 55,683,952 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> llVEC;
typedef vector<P> PVEC;
typedef priority_queue<P,PVEC,greater<P> > PQ;
typedef priority_queue<ll, llVEC, greater<ll> > llPQ;
#define rep(i,a,n) for(ll i = a;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n) rep(j,... | 0 | 8,603,754 |
#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()
typedef long long ll;
long long permutation(int n, int k){
long long perm = 1;
for(int i = 0; i < k; i++){
perm *= (n - i);
}
return perm;
}
long long combination(int n, i... | #include <bits/stdc++.h>
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8 fixed<<setprecision(8)
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b)... | 0 | 97,628,614 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<double,int> P;
#define repl(i,n... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#defin... | 0 | 9,824,234 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
string s ,t;
cin>>s>>t;
cout<<t<<s<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll... | 0 | 16,094,874 |
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
double a, b, c ,d, ans;
scanf("%lf%lf%lf%lf", &a, &b, &c, &d);
printf("%.15f\n", sqrt((a-c)*(a-c)+(b-d)*(b-d)));
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 | 86,209,010 |
#include <iostream>
using namespace std;
int main() {
long x, y;
cin >> x >> y;
int a;
if (x % y == 0) {
a = -1;
}
else {
a = x;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long prod(long long a, long long b){
return (a*b)%MOD;
}
int main(){
int n, m;
cin >> n >> m;
long long vert[n], hori[m];
for(int one = 0; one < n; one++){
cin >> vert[one];
}
for(int one = 0; one < m; one... | 0 | 70,986,201 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1100;
const int INF=10000000;
typedef pair<int,int> P;
char s[maxn][maxn];
int d[maxn][maxn];
int H,W,n;
P point[maxn];
int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#include<stack>
usi... | 0 | 2,723,051 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int64_t FastPow(int64_t n, int64_t m){
if(m==0) return 1;
if(m==1) return n;
int64_t v=FastPow(n,m/2);
v*=v;... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x3 - (x2 - x1);
y4 = y3 - (y2 - y1);
cout << x3 << ' ' << y3 << ' ' << x4 << ' ' << y4 <<e... | 0 | 33,900,116 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
using ll = long long int;
int main(){
int H,W;cin>>H>>W;
vector<string> S(H);
for(in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(v) v.begin(),v.end()
const int maxn = 1e5 + 100;
const ll inf = 2e18, mo... | 0 | 4,743,372 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
int main() {
ll n, h; cin >> n >> h;
V<ll> a(n), b(n);
for(int i = 0; i < n; i++) cin >> a[i] >> b[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 57,299,579 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main(void){
ll N;
cin >> N;
vector<ll> dp(110000,INF);
dp[0] = 0;
int num;
for(int i = 1; i <= N; i++){
num = 1;
while(num <= i){
dp[i] = min(dp[i], dp[i-num]+1);
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
int n;
int main(){
cin>>n;
ll sum=0;
for(int i=1;i<=n;i++)sum+=i;
cout<<sum;
} | 0 | 36,207 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int k... | 0 | 8,400,098 |
#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) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
... | 0 | 71,247,232 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end(... | 0 | 37,864,577 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
string s, t;
cin >> s >> t;
if (s == t)
cout << "=";
else if (s > t)
cout << ">";
else
cout << "<";
cout << endl;
return ... | #include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
string match = "6255456376";
signed main(){
int n,m; cin >> n >> m;
vector<char> a(m);
for(int i = 0; i < m; i++) cin >> a[i];
vector<string> dp(n+10,"INF");
dp[0] = "";
auto f = [&](str... | 0 | 18,105,785 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<string> vstr;
ty... | 0 | 84,747,748 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string cards;
string buf;
int h,n;
int i;
while(1){
cin >> cards;
if(cards == "-"){
break;
}
cin >> n;
for(i = 0; i < n;i++){
cin >> h;
buf = cards.substr(0,h);
cards += buf;
cards.erase(card... | #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()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD... | 0 | 37,004,395 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>
#define pb push_back
#define eb emplace_back
#d... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b... | 0 | 22,020,961 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,i;
ll P[10],Q[10];
ll ord[10];
bool x;
cin >> N;
ll a,b;
for(i=0;i<=N-1;i++)
cin >> P[i];
for(i=0;i<=N-1;i++)
cin >> Q[i];
for(i=0;i<=N-1;i++)
ord[i] = i+1;
for(a=0;a<=100000000;a++){
x = true;
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\... | 0 | 10,647,355 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int w, h, x, y; cin >> w >> h >> x >> y;
int m = w * h;
cout << fixed << setprecision(6) << m / 2.0 << " ";
if (w % 2 == ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 | 21,865,315 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include<iostream>
#include<bits/stdc++.h>
#include<climits>
#include<math.h>
#define forn(x,n,s) for(int i = x; i < n; i += s )
#define forr(x,n,s) for(int i = x; i>=n; i -= s)
#define PI 3.14159265358979323846264338327950L
using namespace std;
void go(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_... | 0 | 21,235,475 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> a(N + 1, 0);
for (int i = 0; i < N; ++i) {
if (S[i] == '<') a[i+1] = max(a[i+1], a[i] + 1);
}
for (int i = N-1; i >= 0; --i) {
if (S[i] == '>') a[i] = max(a[i], a[i+1]... | #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> pp;
const ll INF = 1e14;
const int MOD = 1000000007;
int main() {
int n,k;
cin >> n >> k;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
ll ans = INF;
rep(i,pow(2,n)){
int cnt = 0;
... | 0 | 74,232,292 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int> Change(vector<int> X, int m, int n){
int x = X[m];
X[m] = X[n];
X[n] = x;
return X;
}
vector<int> SelectionSort_withMark(vector<int> A, int i){
int N = A.size() / 2;
int j_0 = i;
for(int j = i; j < N; j++){
if(A[2*j+1] < A[2*... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | 0 | 92,793,312 |
#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#define rep(i, n) f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for(int i = 0; i < h; i++) cin >> a.at(i);
vector<vector<int>> check(h, vector<int>(w));
int ans = -1;
queue<pair<int, int>> bfs;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(... | 0 | 68,567,566 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
int main() {
int M, K;
cin... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | 0 | 54,258,077 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll a,b,c;
char ch;
cin >> a >> ch >> b;
if(ch=='+')
cout << a+b << endl;
else cout << a-b << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 856,823 |
#include<bits/stdc++.h>
#include<math.h>
#include<set>
#include<string>
using namespace std;
#define jaldichal ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define mk make_pair
#define R return
#define line "\n"
#de... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
typedef vector< vector< vector<ll> > > vvvint;
typedef vector<string> vstring;
typedef vector< vector<string> > vvstring;
typedef vec... | 0 | 97,152,237 |
#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>;
using Graph = vector<vector<int>>;
int main() {
string s;
cin >> s;
int a=s[0] - '0', b=s[1] - '0', c=s[2] - '0', d=s[3] - '0';
int n=3, sum=a;
for(int bit = 0;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 66,635,471 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
int e = 0;
rep(i, s.size()) if (i % 2 == 0 && s[i] == '1' || i % 2 == 1 && s[i] == '0') ++e;
int ans = min(e, (int)s.size() - e);
cout ... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 91,802,849 |
#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 fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin,... | 0 | 86,037,804 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 0 | 19,115,304 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdlib>
#include<cctype>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define PB push_back
#define MP make_pair
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cout << v[i] << ' ';cout << ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define mp make_pair
#define mem(x,i) memset(x,i,sizeof(x))
#define ff... | 0 | 52,730,150 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
int mx=0,g=0;
bool ok=false;
rep(i,n){
cin>>a[i];
mx=max(mx,a[i]);
g=__gcd(g,a[i]);
if(a[i]==k)ok=true;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
int a,b,c,d;
cin>>s;
a=s[0]-'0';
b=s[1]-'0';
c=s[2]-'0';
d=s[3]-'0';
if(a+b+c+d==7)
cout<<a<<'+'<<b<<'+'<<c<<'+'<<d;
else if(a+b+c-d==7)
cout<<a<<'+'<<b<<'+'<<c<<'-'<<d;
else if(a+b-c-d==7)
... | 0 | 11,671,930 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=(int)(n);i++)
#define ll long long
int main(){
int N,count=0;
cin >> N;
for(int i=1;i<=N;i+=2){
int c=0;
rep(j,i){
if((i%j)==0)c++;
}
if(c==8)count++;
}
cout << count << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<numeric>
#include<functional>
#include<sstream>
#include<iomanip>
using namespace std;
#define ll long long
int main() {
int N; cin >> N;
vector<pair<int, int>> a(N), b(N);
for(int i... | 0 | 87,211,862 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int execute(int n, int k){
return n % k == 0? 0 : 1;
}
int main(){
cin >> n >> k;
cout << execute(n, k);
} | #include <bits/stdc++.h>
using namespace std;
template <typename T>
struct Unionfind{
vector<int> parent;
void init(int forestSize){
parent.resize(forestSize);
for(int i=0;i<forestSize;i++){parent.at(i)=i;}
}
int root(int v){
if(parent.at(v)==v){return v;}
else{return par... | 0 | 97,699,376 |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define ff first
#define ss second
#define p pair<int,int>
#define pb push_back
#define endl '\n'
#define w(t) ll test;cin>>test;while(test--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define pi... | 0 | 97,943,067 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long M=0;
cin>>N;
vector<int>vec(N-1);
for(int X=0;X<N;X++){
if(X<N-1){
cin>>vec.at(X);
}
if(X>0 && X<N-1){
M+=min(vec.at(X),vec.at(X-1));
}
else if(X==0){
M+=vec.at(X);
}
else{
M+=vec.at... | #include <bits/stdc++.h>
using namespace std;
signed main () {
int n;
cin >> n;
vector < int > a(n + 1, 0);
for (int i = 1; i <= n; ++i)
cin >> a[i];
sort(a.begin(), a.end());
vector < int > nxt(n + 1, 0);
for (int i = 1; i <= n; ++i)
nxt[i] = int(prev(upper_bound(a.begin(),... | 0 | 58,165,746 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int a, b, c, d, first, second;
cin >> a >> b >> c >> d;
if( a > b )
first = b;
else first = a;
if( c > d )
second = d;
else second = c;
cout << first + second;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
int main(){
ll n,k;
cin >> n >> k;
ll sum = min(n,k);
ll v[n+10];
ll kotae;
ll ans = -1;
for(int i = 0; i < n; i++){
ll temp;
cin >> temp;
v[i] = temp;
}
for(int i = 0; ... | 0 | 31,859,845 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int K;
int S;
cin >> K >> S;
int count = 0;
int m = min(S, K);
for (int i = 0; i <= m; i++) {
for (int j = i; j <= m; j++) {
for (int k = j; k <= m; k++) {
if (i + j + k == S) {
... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k;
cin >> a >> b >> k;
int x = __gcd(a,b);
for(int i=x; i>=1; i--){
if(x%i==0){
k--;
if(k==0){
cout << i << endl;
}
}
}
return 0;
} | 0 | 67,469,478 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(int argc, char** argv) {
if (argc == 2 && atoi(argv[1]) == 123456789)
freopen("d:\\code\\cpp\\stdin", "r", stdin);
int n;
scanf("%d", &n);
int k=1;
while(k*(k-1)/2 < n)
k++;
i... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 13,646,209 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
cin >> N;
vector<int> a(N+1,0);
rep(i,N) cin >> a[i];
ll ans = 0;
rep(i,N){
ans += a[i]/2;
a[i] %= 2;
if(a[i] & (a[i + 1]>0)){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 92,361,503 |
#include<cstdio>
#include<cstring>
int main(){
int num[500];
int i,n,max=0;
memset(num,0,sizeof(num));
while((scanf("%d",&n))!=EOF){
num[n]++;
if(num[n]>max)max=num[n];
}
for(i=0;i<101;i++)if(max == num[i])printf("%d\n",i);
} | #include <bits/stdc++.h>
#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... | 0 | 17,885,699 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
typedef struct Edge {
int to, cost;
} Edge;
struct Node {
ll costK = INT64_MAX;
vector<Edge> e;
};
void dfs(vector<Node>& NO, int cur, ll cost) {
for (auto x : NO[cur].e) {
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#undef tabr
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, l, t;
cin >> n >> l >> t;
vector... | 0 | 30,538,405 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++){
int x;
cin >> x;
A.at(i) = x - i - 1;
}
sort(A.begin(), A.end());
int b = A.at(N / 2);
int64_t ans = 0;
for (int i = 0; i < N; i++){
... | #include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (A * B < N || A + B > N + 1) {
cout << -1 << endl;
return 0;
}
vector<ll> ans;
ll num = 0;
for (ll i = 0; i < B; i++) {
ll tmp_num = min(N - num - (B - i -... | 0 | 94,707,809 |
#include <bits/stdc++.h>
#define int long long
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)a, i##_len=(b); i<i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(box) box.begin(), box.end()
using namespace std;
using P... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> light(N);
for(int i = 0; i < N; i++){
cin >>light.at(i);
}
int NEXT = 1;
int count = 0;
int check = 0;
for(int i = 0; i < N ; i++){
count++;
if(light.at(NEXT - 1) == 2){
check = 1... | 0 | 12,081,723 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = n -1;
for(long long i = 2; i <= sqrt(n); i++) {
if(n % i == 0) {
ans = i + n / i - 2;
}
}
cout << ans;
} | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <valarray>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include ... | 0 | 27,675,055 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0;
cin >> N;
vector<ll>A(N);
vector<ll>B(N);
rep(i,N){
cin >> A[i];
B[i] = A[i];
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
rep(i,N){
if(... | #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 | 57,057,813 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.