code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
for(int i = 0;i < h;i++){
for(int j = ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
int compute_cost(const std::vector<int> &arr, const int v)
{
int cost = 0;
std::for_each(arr.begin(), arr.end(), [&](const int a) {
cost += (v - a) * (v - a);
});
return cost;
}
int main()
{
int n;... | 0 | 28,969,919 |
#include <iostream>
using namespace std;
int prime[1000010];
bool is_prime[1000010];
void seive(int n){
int p=0;
for(int i=0;i<=n;i++) is_prime[i]=true;
is_prime[0]=is_prime[1]=false;
for(int i=2;i<=n;i++){
if(is_prime[i]){
prime[p++]=i;
for(int j=2*i;j<=n;j+=i)
is_prime[j]=false;
}
}
}
int main() {
... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 91,459,873 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
using ll = long long;
void solve()
{
string s;
cin >> s;
string ans = "";
rep(i, s.size())
{
if (s[i] == '0')
{
ans += "0";
}
else ... | #include<bits/stdc++.h>
using namespace std;
int parent(int i){return i / 2;};
int left(int i){return 2 * i;};
int right(int i){return 2 * i + 1;};
int upper = 2000000;
int n = 0;
vector<int> a(upper + 1);
void maxHeap(vector<int> &a, int i){
int l = left(i);
int r = right(i);
int largest;
if(l <= n && ... | 0 | 66,755,604 |
#include <iostream>
using namespace std;
int main()
{
int y;
long long int x = 1;
cin >> y;
while(y != 1)
{
x = x*y;
y--;
}
cout << x << endl;
} | #include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace ... | 0 | 25,168,078 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b;
cin>>n>>a>>b;
if(a%2==0 && b%2==0 || a%2==1 && b%2==1)
cout<<"Alice";
else if(a%2==1 && b%2==0 || a%2==0 && b%2==1)
cout<<"Borys";
else
... | #include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define ... | 0 | 19,043,576 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
using ll = long long;
#define INF 1000000000000000000
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,m;cin>>n>>m;
vector<pair<int,int>> a(n),b(m);
for(int i=0;i<n;i++)
{
int ia,ib;cin>>ia>>ib;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int R, G, B, n; cin >> R >> G >> B >> n;int cnt = 0;
for(int i = 0; i <= 3500; i++) {
for(int j = 0; j <= 3500; j++) {
if(n - (i * R + j * G) < 0 || (n - (i * R + j * G)) % B)continue;
cnt++;
... | 0 | 11,715,654 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> G(n,-1);
vector<vector<int>> vs(n);
int u,k,v;
for(int loop=0;loop<n;loop++){
cin >> u >> k;
for(int loop2=0;loop2<k;loop2++){
cin >> v;
vs[u-1].push_back(v-1);
}
}
queue<pair<int,int>> Q;
Q.push(make_pair(0,0));
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const ll LINF = 1LL<<60;
#define int long long
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m, X; cin >> n >> m >> X;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i ... | 0 | 697,945 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main(){
int s; cin >> s;
int cnt = 0;
vector<int> a;
a.push_back(s);
while(true){
cnt++;
if(s % ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, R;
cin>>n>>m>>R;
int r[R];
for (int i=0; i<R; i++) {
cin>>r[i];
--r[i];
}
int d[n][n];
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
if (i != j) {
d[i][j] = 1e9;
} else {
d[i][j] = 0;
}... | 0 | 12,917,217 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 0 | 37,619,962 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
signed main(){
int n,m,x1,y1;
cin>>n>>m>>x1;
int ans1=0,ans2=0;
for(int i=0;i<n-1;i++){
int x2;
cin>>x2;
ans1=(ans1+(x2-x1)*(i+1)%mod*(n-1-i)%mod)%mod;
x1=x2;
}
cin>>y1;
for(int i=0;i<m-1;i++){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, C, K;
cin >> A >> B >> C >> K;
if (abs(A - B) >= pow(10, 18)) {
cout << "Unfair" << endl;
} else {
if (K % 2 == 1) {
printf("%lld\n", -(A - B));
} else {
printf("%lld\n", A - B);
... | 0 | 96,871,165 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
string s="";
cin>>n;
cin>>s;
cin>>k;
char ch = s[k-1];
for(int i=0;i<n;i++)
{
if(s[i]==ch)
cout<<s[i];
else if(s[i]!=ch)
cout<<"*";
}
cout<<endl;
return 0;
} | #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 | 64,373,080 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ll n,y; cin >>n >>y;
rep(i,n+1){
rep(j,n-i+1){
int k = n-i-j;
if(10000*i+5000*j+1000*k==y){
cout << i << " " << j << " " << k << endl;
return 0;
}
... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int dfs(vector<vector<int>> &A, vector<bool> &U, vector<int> &R, int c)
{
if (U[c])
return -1;
if (R[c])
return R[c];
U[c] = true;
int m = 0;
for (auto... | 0 | 24,485,916 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
long double res = 0;
for (int i=0; i < n; i++) {
long double x; cin >> x;
x = 1/x;
res += x;
}
long double nres = 1/res;
cout << nres;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... | 0 | 80,555,076 |
#include "bits/stdc++.h"
using namespace std;
#define long int64_t
int main() {
ios_base::sync_with_stdio( false );
int N, K;
cin >> N >> K;
cout << N-K+1 << endl;
return 0;
} | #define scanf_s scanf
#include <string>
#include <stdio.h>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX 450
int main(void)
{
int H, xk;
long long int Heaps[MAX + 1];
scanf_s("%d", &H);
f... | 0 | 89,921,871 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#define ss ... | #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <map>
#include <stack>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415... | 0 | 38,198,012 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | #include <iostream>
#include <set>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
template <typename Container, class T>
bool contains(const Container& c, T v)
{
return std::find(c.begin(), c.end(), v) != c.end();
}
template <typename C>
void print_container(const C &c, const std::string &n... | 0 | 78,828,891 |
#include<bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
ll tot=0;
for(int i=0;i<n-1;i++)
{
for(i... | #include <stdio.h>
int main() {
int Zx, count = 0;
int count1, count2;
char Yz[104] = {};
scanf("%d %s", &Zx, &Yz);
if (Zx % 2 != 0) {
printf("No");
return 0;
}
int haafu = Zx / 2;
for (int u = 0; u < haafu; u++) {
if (Yz[u] == Yz[u + haafu]) {
count++;
}
}
count == haafu ? printf("Yes") : printf("... | 0 | 16,251,169 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long int lld;
#define sq(x) x*x
#define fr(i,m,n) for(i=m;i<n;i++)
#define vec vector<int>
#define sint set<int>
#define qint queue<int>
#define mip map<int,int>
#define pint priority_queue<int>
#define pb push_back
#define pp pop_bac... | #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>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | 0 | 52,682,519 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <iostream>
#include <string>
using namespace std;
int main(){
string S;
cin >> S;
if (S.size() < 5){
printf("NO\n");
}else{
int p = S.size() - 1;
while (p >= 4){
if (S.substr(p - 4, 5) == "dream" || S.substr(p - 4, 5) == "erase"){
p -= 5;
}else if (S.substr(p - 5, 6) == ... | 0 | 58,655,052 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> done(n, 0);
for (int i=0; i<n; i++) {
cin >> a[i];
}
int acount = 0;
int now = 1;
while(true) {
if (done[now-1] == 1) {
cout << -1 << endl;
return 0;
}
don... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <lim... | 0 | 11,104,445 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = ve... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, l;
cin >> n >> l;
deque <ll> d;
rep(i, n) {
ll a;
cin >> a;
d.push_back(a);
}
ll res = 0;
rep(i, l+1) {
... | 0 | 1,811,748 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | 0 | 94,522,561 |
#include <bits/stdc++.h>
#define st first
#define nd second
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ii pair<int ,int >
#define S second
#define F first
#define PI 3.1415926535897932384626
#define SPEED std::ios_base::sync_with_stdio(false);
int main(){
SPEED
string s;
cin>>s;
int n = s.size();
for(int ... | 0 | 33,211,152 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
#include <time.h>
#include <chrono>
#ifdef _MSC_VER
#... | #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)
void chmax(ll& a, ll b) { a = max(a, b)... | 0 | 52,434,519 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef struct Point{
double x;
double y;
}P;
void koch(P p1, P p2, int i, int n){
if(n == 0){
printf("%.8f %.8f\n", p1.x, p1.y);
return;
}
P s, u, t;
double th = M_PI * 60.0 / 180.0;
s.x = (2 * p1.x + 1 ... | 0 | 8,568,327 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bits... | #include <bits/stdc++.h>
#include<math.h>
#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
int main () {
int n ;
cin >> n ;
vector<string> s (n) ;
rep(i, n){
cin ... | 0 | 4,877,025 |
#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, k;
cin >> n >> k;
int v[n];
rep(i, n) cin >> v[i];
int ans = 0;
for (int a = 0; a <= min(n, k); ++a) {
for (int b = 0; b <= min(n, k) - a; ++b) {
vector<int>... | #include <iostream>
using namespace std;
#define INPUT_MIN 0
#define INPUT_MAX 100
int main()
{
int a = 0, b = 0, c = 0;
cin >> a;
cin >> b;
cin >> c;
if( (INPUT_MIN > a) || (INPUT_MAX < a) )
{
return 1;
}
if( (INPUT_MIN > b) || (INPUT_MAX < b) )
{
return 1;
}
if( (INPUT_MIN > c) || (INPUT_MAX < c) )
{
... | 0 | 69,999,912 |
#include<iostream>
using namespace std;
int main(void)
{
int n,b,f,r,v,A[4][3][10],i;
cin >> n;
for(b=0;b<4;b++){
for(f=0;f<3;f++){
for(r=0;r<10;r++){
A[b][f][r]=0;
}
}
}
for(i=1;i<=n;i++){
cin >> b >> f >> r >> v;
A[b-=1][f-=1][r-=1]+=v;
}
for(b=0;b<4;b++){
for(f=0;f<3;f++){
for(r=0;r<10;... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | 0 | 68,107,502 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
#define int ll
int n, q, k;
vector<vector<pll>> G;
int dis[100010];
void dfs(int v, int p, int d){
dis[v] = d;
for(auto nv : G[v]){
if(nv.first == p) continue;
... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,... | 0 | 6,207,374 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 4;
int n;
pair<int, int> a[MAXN];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(int i = 0;i < n;i ++)
cin >> a[i].first, a[i].second = i;
sort(a, a + n);
int ans = 0;
for( int i = 0; i < n;... | 0 | 98,781,038 |
#include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A > 8 || B > 8) {
cout << ":(\n";
}
else {
cout << "Yay!\n";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
vector<bool> s(200100);
vector<bool> t(200100);
bool ok=false;
int n,m;
cin >> n >> m;
rep(i,m){
int a,b;
cin >> a >> b;
if(a==1) s[b] = t... | 0 | 29,837,921 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using vin=vector<int>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
int main() {
vin a(... | #include<bits/stdc++.h>
#define loop(i, a, b) for(int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
const int MOD = 1000000007;
const int inf = 1e8;
using vi = vector <int>;
using vvi = vector <vi>;
using vc = vector <char>;
using vvc = vector <vc>;
using vs = vector <string>;
using vvs = vec... | 0 | 64,863,308 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n;
vector<int>a(n);
if(n%2==0){
for(int i=0;i<n;i++){
cin>>m;
if(i%2==1)a[n/2-i/2-1]=m;
if(i%2==0)a[n/2+i/2]=m;
}
}else{
for(int i=0;i<n;i++){
ci... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
string s; ll k;
cin >> s >> k;
ll n = s.size();
ll ans = 0;
int cnt = 1;
rep(i... | 0 | 29,132,099 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
map < int , int > me;
#define mod 1000000007
#define N 100005
#define MOD 1000000007
int fact[N], invfact[N];
int pow(int a, int b, int m)
{
int ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%m;
b/=2;
a=(a*a)%m;
... | 0 | 1,567,298 |
#include<iostream>
using namespace std;
int main(){
int x, y;
int i = 1;
while(i <= 3000){
cin >> x >> y;
if((x == 0) && (y == 0)) break;
else if(x <= y) cout << x << " " << y << endl;
else cout << y << " " << x << endl;
i += 1;
}
return 0;
} | #include <stdio.h>
#include <string.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int memo[100000]; for(int i=0;i<m;i++) memo[i]=0;
int ac=0,wa=0;
for(int i=0;i<m;i++)
{
int p;
char s[3];
scanf("%d%s",&p,s);
if(memo[p]!=-1)
if(strcmp(s,"WA")==0)
{
... | 0 | 43,950,338 |
#include <iostream>
#include <cstdio>
#include <set>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace... | #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <de... | 0 | 86,860,364 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
#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(int i = 1;i <= n; i... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 32,810,592 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define endl "\n"
using ll=long long;
using ld=long double;
using namespace std;
const ll mod= 1e9+7;
const ll INF = 1LL<<40;
ll GCD(... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define Rep(i, n) for(ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.... | 0 | 98,674,029 |
#include <bits/stdc++.h>
using namespace std;
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 0 | 32,112,481 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
int w;
cin >> S >> w;
for (int i = 0; i < S.size(); i+=w) {
cout << S.at(i);
}
cout << endl;
} | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 87,031,846 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
int x = N%500;
if ( x > A) {
cout << "No" << endl;
}
if ( x <= A) {
cout << "Yes" << endl;
}
} | #include <iostream>
using namespace std;
#include <string>
#include <vector>
#include <algorithm>
int main(){
int n;
string str;
cin >> n >> str;
vector<char> cs{str.at(0)};
int count=1;
for(int i=1; i<n; i++) {
if(cs.at(count-1)!=str.at(i)){
cs.push_back(str.at(i));
... | 0 | 53,134,202 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, need=0;
cin >> N;
for (int i=0; i<N ;i++){
need+=i+1;
}
cout << need << endl;
} | # include <iostream>
# include <queue>
# include <climits>
using namespace std;
int H;
int W;
char A[1005][1005];
int counter=0;
int shortestpath[1005][1005];
bool visited[1005][1005];
int maximum=INT_MIN;
int dr[4]={1, -1, 0, 0};
int dc[4]={0, 0, -1, 1};
queue< pair<int, int> > starting;
bool inside (int row, int colu... | 0 | 42,786,413 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <math.h>
#include <queue>
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
v... | #include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
#define p(x) cout << "(" << x.first << "," << x.second << ")" << endl;
using namespace std;
const int MAX_H = 1005;
const int MAX_W = 1005;
char D[MAX_H][MAX_W];
bool visited[MAX_H][MAX_W];
int H, W, N;
int dx[] = { -1, 0, 1,... | 0 | 48,008,402 |
#include <iostream>
#include <cstdlib>
#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
int main(){
int i,j,len,lenr,lenp;
string s,m,m2,n,m3,n2;
cin >> s;
len=s.size();
lenr=(len-1)/2;
m=s;
m2=s.substr(0,lenr);
n=m2;
m3=s.substr((len+3)/2-1,lenr);
n2=m3;
rev... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | 0 | 78,837,354 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n,r,l;
cin >> n;
int ans=0;
r... | #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 main() {
int a, p;
cin >> a >> p;
a *= 3;
a = a + p;
cout << a / 2;
return 0;
} | 0 | 64,727,899 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200010;
vector<int> num(p,0);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int ans = 0;
for ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
ll mod = 1000000007;
ll ans = 1<<29;
int main() {
ll n,k;
cin>> n >> k;
vector<pair<ll,ll>> P (n);
rep(i,n){
... | 0 | 97,271,883 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int M, L;
M = N / 10;
L = N % 1000;
if (N % 1111 == 0) {cout << "Yes" << endl;}
else if (M % 111 == 0) {cout << "Yes" << endl;}
else if (L % 111 == 0) {cout << "Yes" << endl;}
else {cout << "No" << endl;}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
map<string,int>mp;
int n,m,ans=0;
str... | 0 | 56,973,530 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int D;
cin >> D;
cout << "Christmas";
for (int i = D; i < 25; i++)
cout << " Eve";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
ll A,B,K;
cin >> A >> B >> K;
if(A < K){
K-=A;
A=0;
if(B<K) B = 0;
else B-=K;
}
else A-... | 0 | 48,039,917 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
deque<int> b;
for(int i = 0; i < n; i++){
if(i % 2){
b.push_front(a[i]);
} else {
b.pu... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 64,987,850 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
long long dp[100010];
long long h[100010];
template<class T> void chmin(T &a, T b) {
if (a>b) {
a = b;
}
}
template<class T> inline void chmax(T &a, T b) {
if (a<b) {
a = b;
}
}
int main() {
int n; cin >> n;
int m; cin >... | 0 | 96,590,744 |
#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>;
ll choose2(ll n){
return n*(n-1)/2;
}
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) a[i]--;
vector<int> cnt(n);
rep(i,n) cnt[a[i]]++;
ll to... | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <math.h>
using namespace std;
int main()
{
int n,d,a[20][20],i,j,k,sum,integer=0;
double sq;
cin>>n>>d;
for(i=0;i<n;i++)
{
for(j=0;j<d;j++)
{
cin>>a[i][j];
}
}
for(i=0;i<n;i++)
{
... | 0 | 54,201,172 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n; cin >> n;
int ans = 0, inf = 1, sup = 10;
while(n >= sup){
ans += (sup - inf);
inf = inf * 100;
sup = sup * 100;
}
if(n >= inf) ans += (n - inf) + 1;
cout... | #include<iostream>
using namespace std;
#include<vector>
#include<map>
#include<algorithm>
#define int long long int
#define inf 10000000000000000
#define mod 1000000007
void dfs(int src,vector<int> adj[],int p,int value,int dp[],int answer[])
{
value+=dp[src];
answer[src]=value;
for(int x:adj[src])
{
if(x!=p)
... | 0 | 10,693,573 |
#include<iostream>
#include<math.h>
using namespace std;
int main(){
int N;
cin >> N;
int a[N], i, j, sum=0, avg, min;
double b[3], cost[3];
for (i=0; i<N; i++){
cin >> a[i];
sum += a[i];
}
for (j=0; j<3; j++){
cost[j] = 0;
}
avg = sum / N;
for (i=0; i<N; ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; ++i)
typedef long long ll;
int num(int a){
switch(a){
case 1:
return 2;
case 2:
return 5;
case 3:
return 5;
case 4:
return 4;
case 5:
... | 0 | 42,876,972 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <it... | 0 | 42,551,624 |
#include <bits/stdc++.h>
using namespace std;
int numDigits(long long num) {
if (num == 0) {
return 1;
}
int r = 0;
do {
r++;
num /= 10;
} while (num != 0);
return r;
}
int helper(long long n) {
int r = numDigits(n);
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
r = mi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define ll long long
int main(){
string s,t; cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
map<char,int> smp,tmp;
map<int,int> sint,tint;
rep(i,s.size()) smp[s[i]]++;
rep(i,t.size()) tmp[t[... | 0 | 92,482,870 |
#include <iostream>
#include <cmath>
#include <vector>
#include <utility>
using namespace std;
int main()
{
long long n;
cin >> n;
int res = 0;
for (int p = 2; p <= sqrt(n) + 1; p++)
{
if (n % p != 0)
continue;
int count = 0;
while (n % p == 0)
{
n /= p;
count++;
}
int i = 0;
int sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
struct TopologicalSort {
TopologicalSort () {}
TopologicalSort (int n) : n(n), G(n), used(n, 0) {}
int n;
vector<vector<int>> G;
vector<int> order, used;
void add_edge(int u, int v) {
G[u].push_back(v);
}
void dfs(int v) {
if (used[v]) return;
us... | 0 | 59,232,183 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> prime;
int main() {
ll N;
cin >> N;
vector<ll> cnt;
for (ll i=1; i*i<=N; i++) {
if (N%i==0) {
cnt.push_back(i+N/i-2);
}
}
sort(cnt.begin(),cnt.end());
cout << cnt[0] << endl;
... | 0 | 30,042,497 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
ll n, m; cin >> n >> m;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<ll> sum(n+1);
for(int i = 0; i < n; i++) sum[i+1] = sum[i] + a[i];
unordered_map<ll, ll> mp;
for... | #include <cassert>
#include "limits.h"
#include <limits>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | 0 | 20,646,714 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(i*4+j*7==n){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,m;
cin >>n>>m;
int c[m];
for(int i=0;i<m;i++){
cin>>c[i];
}
int l[n+1][m];
for(int i=0;i<=n;i++){
for(int j=0;j<m;j++){
if(i==0){
l[i][j]=0;
}else if(j==0){
if(c[0]>i){
l[i][j]=i;
}else{
l[i][j]=l[i-... | 0 | 34,701,452 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define n1 "\n"
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | 0 | 53,690,159 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> x(n);
for(int i=0; i<n; i++){
cin >> x.at(i);
}
sort(x.begin(), x.end());
int sum=0;
for(int i=0; i<k; i++)
sum += x.at(i);
cout << sum << endl;
} | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 55,915,308 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 85,095,680 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<pair<int, ll>>>;
const int INF = 1001001001;
ll h, w;
ll solve1(ll a){
ll res = h - a;
ll b = res/2, c = res - b;
return max(abs(a-b), max(abs(a-c), abs(b-c))) * w;
}
ll solve2(ll a){
ll res = h - a;
ll b... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 | 33,321,649 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
for (int i = 0;i < h*w;++i) {
string s;
cin >> s;
if (s == "snuke") {
char a = 'A';
a += i%w;
cout << a << i/w+1 << "\n";
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int k;
int main()
{
_FastIO;
string s;
cin >> s;
int n = s.size();
int sum = 0;
for(int i = 0; i < n; i++){
... | 0 | 78,497,068 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main()
{
int W, H; cin >> W >> H;
vector<pair<int, int>> A;
for (int i = 0; i < W; i++) {
int p; cin >> p;
A.emplace_back(p, 0);
}
for (int i = 0; i < H; i++) {
int q; cin >> q;
A.emplace_back(q,... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <iomanip>
#include <math.h>
#include <algorithm>
#define hmm "\n"
#define test() int t; cin>>t; while(t--)
#define ll long long int
#define ull unsigned long long
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
vo... | 0 | 56,451,049 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | #include <iostream>
#include <vector>
using namespace std;
vector<string> myhash(10000000);
void set(string& a){
int x = 0;
for(int i=0; i<a.size(); i++){
x *= 11;
x += a[i];
x %= 10000000;
}
while(true){
if(myhash[x].empty()){
myhash[x] = a;
break;
}
else if(myhash[x].compar... | 0 | 75,181,080 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int solve() {
}
int main() {
double x1,x2,y1,y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%.8lf\n",sqrt((x2-x1)*(x2-x1)+ (y2-y1)*(y2-y1)));
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 53,164,050 |
#include<iostream>
int main(){
int N, A;
std::cin >> N >> A;
std::cout << N*N - A;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | 0 | 73,606,630 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
#include<vector>
#include<queue>
#include<bitset>
using namespace std;
#define LL long long
#define DB double
#define MOD 998244353
#define Pr pair<DB,int>
#define X first
#define Y second
#define MAXN 50
#define I... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 45,717,942 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, a, b;
ll c;
cin >> n >> m;
vector<bool> vrow(n+1,0);
vector<vector<bool>> visited(n+1,vrow);
vector<vector<pair<int,ll>>> paths(n+1);
for (int i=0; i<m; i++) {
cin >> a >> b >> c;
paths... | 0 | 90,490,058 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <bitset>
#include <map>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
string result = "";
bool loopdfs(vector<int> & nums, int N, i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
vector<int> g[100001];
int par[100001],dep[100001];
bool nroot[100001];
void dfs(int v,int p,int d){
par[v]=p,dep[v]=d;
... | 0 | 56,307,425 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define REAP(i,a,n) for(int i=(a);i<(n);i++)
#define YES cout<<"Yes"<<endl
#define NO cout<<"No"<<endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(),v.end()
typedef long long ll;
int table[101][101];... | 0 | 11,362,148 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz le... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 0 | 70,960,958 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
string S, S_; ll K; cin >> S >> K;
S_ = S;
ll ans = 0;
if((S.size() * K)%2 == 1){
bool flag = true;
for(int i = 1; i < S.size(); i++) if(S[i-1] != S[i])... | 0 | 45,974,898 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m; cin >>n >>m;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >>a[i] >>b[i];
}
vector<int> c(m), d(m);
for (int j = 0; j < m; j++) {
cin >>c[j] >>d[j];
}
for (int i = 0; i < n; i++) {
in... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | 0 | 32,928,041 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a-b+1;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define mp make_pa... | 0 | 76,091,942 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | 0 | 67,936,709 |
#include<stdio.h>
#include<math.h>
int main(void)
{
int a,b,c;
double s=0,l=0,h=0,ra,pi=3.141592653589;
scanf("%d%d%d",&a,&b,&c);
ra=c*pi/180;
s=0.5*a*b*sin(ra);
l=sqrt(a*a+b*b-2*a*b*cos(ra))+a+b;
h=s*2/a;
printf("%8lf\n%8lf\n%8lf\n",s,l,h);
return 0;
} | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 77,261,858 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
void solve();
clock_t start_time;
double get_current_time() {
return (double)(clock() - start_time) / CLOCKS_PER_SEC;
}
int main() {
ios_base::sync_with_stdio(false);
solve();
}
#define fi first
#define re return
#define s... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(a) (a).size()
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define forn(i, n) for (int i = 1; i <= n; i++)
#define ford(i, n) for (int i = n; i >= 0; i--)
#define REP(i... | 0 | 64,803,116 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000009
const long long INF = 1LL<<60;
ll d[210][210];
int main() {
int N,M,R;
cin>>N>>M>>R;
vector<int> r(R);
rep(i,R){
cin>>r[i];
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
int main()
{
ll i,j,x,y,z,count=100000000000,sum=0,n,ans=0;
cin>>n;
ll a[n];
rep(i,n)
{
cin>>a[i];
}
sort(a... | 0 | 17,089,963 |
#include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<type... | #include<iostream>
#include<vector>
#include<map>
using namespace std;
int main(){
int N,M;cin>>N>>M;
vector<long long>A(N);
for(int i=0;i<N;i++)cin>>A[i];
map<long long,long long>nums;
long long sum=0;
nums[sum]++;
for(int i=0;i<N;i++){
sum+=A[i];
nums[sum%M]++;
}
lo... | 0 | 69,094,431 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <math.h>
#include <functional>
#include <algorithm>
#include <utility>
typedef long long Int;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
#define REPS(a,i,n) for(int i = a ; i < n ; ++i)
us... | 0 | 75,498,323 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int N;
string s;
cin >> N >> s;
bool is = true;
rep(i, N-1) if(s[i] != s[i+1]) is = false;
if(is){
cout << 1 << endl;
return 0;
}
int ans = 0;
... | #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
using namespace std;
int gcd(int x,int y){
... | 0 | 38,687,866 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
int N=min(A,B);
int M=max(A,B);
int ans;
for(int i=1; i<N+1; i++){
if(M%(N-i+1)==0 && N%(N-i+1)==0) K--;
if(K==0){
ans=N-i+1;
break;
}
}
cout << ans <... | 0 | 74,062,441 |
#include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll... | #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 | 80,305,321 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n+1);
rep(i, n) {
cin >> a[i+1];
}
vector<bool> memo(n+1);
memo[1]=true;
int now = 1;
int ans = 0;
do {
int next = a[n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r * R <= N; ++r) {
for (int g = 0; g * G <= N; ++g) {
int re... | 0 | 41,799,169 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | #include <bits/stdc++.h>
#define fi first
#define se second
#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()
#define maxs(x,y) (x = max(x,y))
#d... | 0 | 65,991,115 |
#include <iostream>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int f(string s){
int n=s.size();
int ret = 0;
int t=1;
for(int i=0;i<n;i++){
if(s[i]>='0' && s[i]<='9'){
t = s[i]-'0';
}
if(s[i]=='m'){
ret += t*1000;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin>>S>>T;
int N=S.size(),a=0;
for(int i=0;i<N;i++){
string A,B;
for(int j=0;j<i;j++){
A.push_back(S.at(j));
}
for(int j=i;j<N;j++){
B.push_back(S.at(j));
}
string C=B+A;
if(C==T){
a=1;
brea... | 0 | 90,594,167 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, x, y;
cin >> N >> A;
x = N % 500;
if(x <= A){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int main()
{
string L; cin >> L;
int len = L.size();
vector<int> x3(len);
x3[0] = 1;
for (int i = 1; i < x3.size(); i++) {
x3[i] = (ll)x3[i-1] * 3 % MOD;
}
ll ans_eq = 1, ans_lt = 0;
for (i... | 0 | 4,665,681 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c)
using namespace std;
int main() {
int n, r, ans;
scan2Int(n, r); ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define MOD 1000000007
#define deb(x) cout << #x << "=" << x << endl
int main() {
ll t;
t=1;
while(t--)
{
ll n,m;
cin>>n>>m;
char M[n][m];
for(ll i=0;i<n;i++)
{
for(ll j=0;j<m;j++)
{... | 0 | 34,938,986 |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
string s;
vector<int> v;
ll calc(ll x, ll y) {
if(x < y) swap(x,y);
return x*(x+1)/2 + y*(y-1)/2;
}
int main() {
cin>>s;
int N = s.size();
int cnt = 0;
if(s[0] != '<') {
v.pb(0);
}
for(int i=0;i<N;++i) {
++cn... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#def... | 0 | 6,183,862 |
#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.at(i);
}
int i = 0;
int ai = a.at(i);
for (i = 0; i < N - 1; i++) {
if (ai == 2) {
break;
}
ai = a.at(ai - 1);
}
if (i < N - 1) {
cout << i +... | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-l... | 0 | 57,370,190 |
#include <bits/stdc++.h>
#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>;
static const double PI = acos(-1);
int main(){
string s;
cin >> s;
REP(i, s.size()){
if(s[i] == '1') s[i] = '9';
else if(s[i] == '9')... | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
#define revrep(i,n,g) for (int i = n; i >= g; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int m,k;
cin >> m >> k;
if (m <= 1) {
if (m == 0 && k == 0) {
cout << "0 0" << endl;
} else if... | 0 | 37,955,353 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#include <ccty... | 0 | 63,377,370 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll X;
cin >> X;
ll n = X/100;
ll m = X - 100*n;
if(m <= 5*n)cout << 1 << endl;
else cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | 0 | 80,344,545 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
int ans = 0;
cin >> N >> D;
vector<vector<int>> vec(N,vector<int> (D));
for(int i=0;i<N;++i){
for(int j=0;j<D;++j){
cin >> vec.at(i).at(j);
}
}
for(int i=0;i<N-1;++i){
for(int j=i+1;j<N;++j){
... | 0 | 87,150,308 |
#include<bits/stdc++.h>
#include<chrono>
using namespace std;
using namespace std::chrono;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se second
#define int long long
#define pb push_back
#define emp emplace_ba... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prll(a,sz) cout<<a[0];for(... | 0 | 25,871,919 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string A;
cin>>A;
cout<<(A.at(0)==A.at(1)&&A.at(1)==A.at(2)? "No":"Yes")<<endl;
} | #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>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n)... | 0 | 78,835,798 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define ISEQ(c) (c).begin(), (c).end()
typedef long long ll;
int main() {
stack<... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define sz(x) int((x).size())
#define all... | 0 | 42,918,765 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
int N,i;
cin >> N >> i;
cout << N + 1 - i << endl;
return 0;
} | #include<cstdio>
#include<iostream>
int a[5];
int swa;
int change(int n){
swa=a[n],a[n]=a[n-1],a[n-1]=swa;
}
int main(){
for(int i=0;i<5;i++)
scanf("%d",&a[i]);
for(int i=4;i>=0;i--){
for(int j=4;j>0;j--){
if(a[j-1]<a[j])
change(j);
}
}
for(int i=0... | 0 | 18,164,254 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.