code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=918... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define revp(i,b,a) for(int i=b;i>=a;i--)
int n;
long double temp,sum=0;
string s;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
rep(i,1,n)
{
cin>>temp>>s;
if(s=="BTC")
... | 0 | 24,007,636 |
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1231231234;
struct pt
{
int x, y;
pt(){}
pt(int a, int b) : x(a), y(b) {}
};
pt toChebyshev(pt p)
{
return {p.x + p.y, p.x - p.y};
}
char getColor(pt p, int minx, int miny, int d)
{
int xPartition = (p.x - minx) / d, yPartiti... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int (i) = 0; (i) < (N); ++(i))
#define READALL(c) for (auto &e : c) { cin >> e; }
#define PRINTALL(c) for (const auto &e : c) { cout << e << "\t"; } cout << "\n";
template <typename T>
using V = vector<T>;
typedef long double ld;
int N;
string S;
int ... | 0 | 22,969,756 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n, m, AC=0, WA=0;
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1e9+7;
const int INF=1e9;
const ll LINF=(ll)1e18;
int main(){
int n;
cin>>n;
vector<int> a(1<<n);
for(int i=0;i<1<<n;i++){
cin>>a[i];
}
vector<pair<int,int>> dp1(1<<n);
for(int i=0;i<1<<n;i++){
dp1[... | 0 | 3,372,545 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int n;
cin >> n;
cout << n / 3 << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
int main(){
int n;
cin>>n;
int cnt[n]={};
for(int i=0;i<n;i++){
int a;
cin>>a;
cnt[a-1]++;
}
ll sum1[n+1]={};
ll sum2[n+2]={};
for(int i=0;i<n;i++){
... | 0 | 97,751,551 |
#include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n);i>=(j);i--)
using ll=long long;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | 0 | 58,527,786 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pv(val) cerr << #val << '=' << (val) << endl
const int INF = 1e9;
int main(void){
ll Q, H, S, D; cin >> Q >> H >> S >> D;
ll ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#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; i < (int)(n); i++)... | 0 | 81,231,539 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int r;
int r2;
cin >> r;
r2 = r * r;
cout << r2 << endl;
return 0;
} | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_ba... | 0 | 534,083 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t n;
cin >> n;
vector<int64_t> A(n+1);
vector<int64_t> B(n);
rep(i,n+1){
cin >> A.at(i);
}
rep(i,n){
cin >> B.at(i);
}
int64_t prev,ans;
ans = 0;
... | 0 | 92,643,538 |
#include<bits/stdc++.h>
using namespace std;
#define IL inline
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define repd(i,j,k) for(int i=j;i>=k;--i)
#define pb push_back
#define db double
#define mp make_pair
#define mp3(a,b,c) mp(mp(a,b),c)
#define pii pair<int,int>
#define piii pair<pii,int>
#define fr first
#define se ... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | 0 | 81,703,035 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
int int_len(int n) {
int s=0;
while(n!=0) s++, n/=10;
return s;
}
int int_sum(int n) {
int m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(int i=s-1;i>=0;i--) m+=n/((int)pow(10,i))-(n/((int)pow(10,i+1)))*10;
return m;
}
i... | #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;
cin >> n;
int a[n], b[n];
rep(i, n) {
cin >> a[i];
}
rep(i, n) cin >> b[i];
ll diff[n];
rep(i, n) diff[i] = a[i] - b[i];
sort(diff, diff + n... | 0 | 5,408,565 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ans=0;
for(int i=1; i<n; ++i){
int a,b;
a=i;
b=(n-1)/a;
ans+=b;
}
cout<<ans<<"\n";
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include <ctype.h>
#include <string>
typedef long long ll;
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector <pair<int, int >> pair(n);
rep(i,n){
cin>>pair[i].first>>pair[i].second;
}
sort(pair.be... | 0 | 96,343,100 |
#include <iostream>
#include <stdio.h>
#include <cctype>
int main(){
char ch,a,b;
while(1){
scanf("%c",&ch);
if(isupper(ch)){
a = tolower(ch);
std::cout <<a;
}else
if(islower(ch)){
b = toupper(ch);
std::cout << b;
}else{
... | #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 | 46,660,321 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int a, b;
cin >> a >> b;
int ans = 10 * b;
while (ans < 1010)
{
if (int(ans * 0.08) == a && int(ans * 0.1) == b)
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define P pair<ll,ll>
#define fs first
#define sc second
#define _GLIBCXX_DEBUG
template<class ... | 0 | 82,839,003 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<int> b = a;
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
rep(i,n){
if(a[i] == b[0]) co... | #include <iostream>
#include <vector>
#include <string>
struct TCard;
void InputCards(int& Count,std::vector<TCard>& Cards);
void OutputCards(const std::vector<TCard>& Cards);
int BubbleSortCards(std::vector<TCard>& Cards);
int SelectionSortCards(std::vector<TCard>& Cards);
struct TCard
{
char Suit;
int Value;
bool ... | 0 | 72,129,551 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int A,B;
cin>>A>... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
for(int i=1;i<100000;i++)
{
if(i*x%360==0)
{
cout<<i<<endl;
break;
}
}
} | 0 | 43,584,687 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <array>
#include <l... | #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 | 61,209,498 |
#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 argc, char const *argv[])
{
int n; cin >> n;
printf("%d\n", (n - 2) * 180);
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 11
#define INF 9999999
int n,r[MAX][MAX],v[MAX],mini,mn,maxnum,minnum;
bool visit[MAX];
int dijkstra(int s){
for(int i = 0 ; i < MAX ; i++){
v[i] = INF;
visit[i] = false;
}
v[s] = 0;
while(true){
mini = INF... | 0 | 13,759,082 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int M,N,a,b,value;
cin>>N>>M;
--N;
--M;
a=(N*(N+1))/2;
b=(M*(M+1))/2;
value=a+b;
cout<<value;
} | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return... | 0 | 39,714,521 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k; cin >> n >> k;
double ans = 0;
for (ll i = 1; i <= n; i++) {
ll tmp = i;
ll cnt = 0;
while (tmp < k) {
tmp *= 2;
cnt++;
}
ll q = n;
while (cnt--) {
q *= 2;
}
ans += (double)1 / q;
}
cout << fixed << s... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>... | 0 | 12,487,401 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
string ans = "NO";
for( int i = 1; i < 100000; i++ ) {
if( A * i % B == C ) {
ans = "YES";
break;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <iterator>
#include <map>
#includ... | 0 | 95,892,627 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x = (1900 * m) + (100 * (n - m));
double p = 1 / pow(2, m);
int ans = x / p;
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | 0 | 9,466,079 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<numeric>
#include<queue>
#include<string>
#include<vector>
#include <stdio.h>
#define ll long long
#include<cstring>
#define rep(i,n) for(int i=0;i<n;i++)
ll mod = 1000000007;
using namespace std;
priority_queue<ll int>QUE;
int length(... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | 0 | 69,497,895 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,l,n) for(int i=(l);i<(n);i++)
template<class T>
using vt = vector<T>;
template<class T>
using vvt = vector<vector<T>>;
int edges[50][50];
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> x(n);
int minimum = 1e9, maximum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
x.at(a)++;
minimum = min(minimum, a);
maximum = max(maximum, a);
}
b... | 0 | 9,284,546 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N, A;
int Residue;
cin >> N;
cin >> A;
Residue = N % 500;
if (A >= Residue) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#define ll long long
#define lson (rt<< 1)
#define rson (rt<< 1 | 1)
#define gmid ((l+r)>> 1 )
using namespace std;
const int maxn=20000050;
char s[maxn];
int cnt[maxn],n,p;
int main()
{
cin>>n>>p;
ll ans=0;
scanf("%s",s);
if(p==2||p==5)
{
... | 0 | 35,028,567 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
int main(void){
string ... | #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 ... | 0 | 2,252,692 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <iterator>
static int createListOfInputData(std::vector<int>& vec);
static int switchingRailroadCars(std::vector<int>& vec, std::vector<int>& data);
static void showData(std::vector<int>& vec);
int main()
{
std::vector<int> v;
... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define INF 1010000000000000017LL
#define MOD 1000000007LL
#define EPS 1e-12
#define PI 3.14159265... | 0 | 58,504,732 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> sunuke;
for (int i=0 ; i<N ; i++)
sunuke.push_back(i+1);
vector<int> d(K);
for (int i=0 ; i<K ; i++){
cin >> d.at(i);
vector<int> A(d.at(i));
for (int j=0 ; j<d.at(i) ; j++){
cin >> A.at(j);
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,i,j,k,l,a,b,c,d,s;
cin>>n;
vector<ll>u,v;
v.push_back(0);
for(i=0;i<n;i++)
{
cin>>k;
v.push_back(k);
}
v.push_back(0);
s=0;
for(i=1;i<=n+1;i++)
{
s+=abs(v[i]-v[i-1]);
... | 0 | 79,022,314 |
#include <iostream>
using namespace std;
int main() {
int x, i;
while ( true ) {
i++;
cin >> x;
if (x == 0)
break;
cout << "Case " << i << ": " << x << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[1000];
int min, max;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i == 0)
{
min = a[i];
max = a[i];
}
else
{
if (max < a[i])
max = a[i];
if (min > a[i])
min = a... | 0 | 81,982,885 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,... | #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;
cin >> n;
char op[] = {'+', '-'};
int n4 = n % 10;
n /= 10;
int n3 = n % 10;
n /= 10;
int n2 = n % 10;
n /= 10;
int n1 = n % 10;
n /= 10;
... | 0 | 59,355,926 |
#include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int n;
int sm;
while(cin>>n&&n){
n=1000-n;
sm=0;
while(n>=500){
n-=500;
sm++;
}
while(n>=100... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n; cin >> n;
ll T[n], A[n];
for(int i=0;i<n;i++) cin >> T[i];
for(int i=0;i<n;i++) cin >> A[i];
vector<pair<ll, bool> > vp;
for(int... | 0 | 91,233,246 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = INF;
rep(bit, (1 << n)) {
vector<int> s;
rep(i, n) {
if (bit & (1 << i)) {
... | 0 | 23,456,347 |
#if defined(__GNUC__)
#include <bits/stdc++.h>
#define __int32 __int32_t
#else
#include "bits/stdc++.h"
#endif
using namespace std;
#define int long long
#define itn __int32
#define REP(i, n) for(itn (i) = 0; (i) < (n); ++(i))
#define REP2(i, x, n) for(itn (i) = x; (i) < (n); ++(i))
#define ALL(x) (x).begin(), (x).end(... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | 0 | 43,292,734 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
vector<int> v(n);
for(int i = 1;i <= n;i++) {
cin >> a;
v[a-1] = i;
}
for(auto x : v) cout << x << " ";
} | #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 | 14,065,770 |
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define rep(i,n) for(int i=0; i<(n); ++i)
#define per(i,n) for(int i=n-1;i>=0;++i)
#define rep1(i,n) for(int i=1; i<=n; ++i)
#define per1(i,n) for(int i=n; i>=1; ++i)
#define debug cout << "line : "... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
#include<complex>
using namespace std;
int howManyWays(int n, int x){
int S = 0;
for (int i=1;i<=n;i++){
for (int j=i+1;j<=n;j++){... | 0 | 3,164,216 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int i,str_length,flag,j;
string s;
flag = 0;
cin >> s;
str_length = s.size();
for(i=0; i<str_length - 1; i++){
for(j=i+1; j<str_length; j++){
if(s.at(i) == s.at(j)){
flag = 1;
break;... | #include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(void)
{
bool seven = false;
bool one = false;
bool nine = false;
bool four = false;
int nums[4];
for (int i = 0; i < 4; i++)
{
cin >> nums[i];
}
for (int i = 0; i < 4; i++)
{
if (nums[i] == 1)
one = t... | 0 | 55,974,426 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int ma... | #include <stdio.h>
#include <string.h>
int main(){
char str[11];
scanf("%s", str);
int len = strlen(str);
char stro[11];
int k = 0;
for(int i = 0; i<len; i++){
if(str[i] == 'B'){
if(i < len-1){
if(k>0){
k--;
}
}
else{
... | 0 | 43,815,003 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S,L="qwertasdfgzxcvb";
while(cin>>S,S[0]!='#') {
vector<bool> v;
for(int i=0;i<S.size();i++) {
bool b=0;
for(int j=0;j<L.size();j++) {
if(S[i]==L[j]) b=1;
}
v.push_back(b);
}
int sum=0;
for(int i... | #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 | 68,527,717 |
#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;
int main()
{
char str[2000];
scanf("%s",str);
int n;
scanf("%d",&n);
int l = strlen(str);
for(int i=0; i<l; i++)
{
if(i==0)
{
printf("%c",str[i]);
continue;
}
if(i%n==0)
{
printf... | 0 | 62,869,402 |
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, h, ans, r;
cin >> n;
for ( int i = 0; i < n; i++ ) {
cin >> h;
if ( i == 0 ) {
ans = 1;
r = h;
} else {
if ( r <= h ) {
r = h;
ans++;
}... | 0 | 48,319,391 |
#include<iostream>
const int MAX_N = 1 << 17, INF = 1 << 24;
class BIT{
public:
BIT(int _n)
:n(_n){
std::fill(bit, bit+n, 0);
}
int sum(int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
int add(int i, int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
private:
... | #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 | 57,907,164 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 2010101;
ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i=2; i<MAX; i++) {
fac[i] = fac[i - 1] * i... | #include"bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int main(){
int N;
string S[300];
cin >> N;
for(int i=0; i<N; i++) cin >> S[i];
int ans = 0;
for(int i=0; i<N; i++){
bool flg = true;
for(int j=0; j<N; j++){
for(int k=0; k<N; k++){
if(S[j][k] !=... | 0 | 78,660,655 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 998244353;
const int maxn = 1e6 + 5;
ll pw(ll x, ll y) {
ll res=1;
while (y) {
if (y%2) res=res*x%mod;
x=... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 92,369,222 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> A(H, vector<char>(W));
vector<int> B(H), C(W);
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> A.at(i).at(j);
if(A.at(i).at(j) == '#'){
B.at(i) = 1;
C.at(j) =... | #include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#defin... | 0 | 37,601,452 |
#include<iostream>
#include<string>
using namespace std;
string replaceAll(string &replacedStr, string from, string to){
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if(from.empty()){
return replacedStr;
}
while((replacedStr.find(from,pos)) != string::npos){
po... | #define TRUE true
#define FALSE false
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template <class T>
using vec = ... | 0 | 57,360,075 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
vi dy = { 0,0,1,-1 };
v... | 0 | 48,048,868 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string S, Ans;
cin >> S;
int N = S.size();
for (int i = 0; i < N; i++){
if (S[i] == 'B'){
if (i != 0){
for (int j = i; j >= 0; j--){
if (S[j] != 'B' && ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define vi vector<int>
#define inf (int)(1e9+7)
#define mod (ll)(1e9+7)
#define eps 1e-10
#define eb emplace_back
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define all(v) v.begin(), v.end()
#define ios c... | 0 | 44,730,266 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
bool f;
string s;
while(getline(cin, s)){
if(s == ".") break;
stack<char> st;
f = true;
string::const_iterator it = s.begin();
for(;it != s.end();++it){
if(*it == '(' || *it == '['){
st.push(*it);
}
else if... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline voi... | 0 | 78,415,446 |
#include <stdio.h>
int main () {
int pell, cess;
scanf("%d %d", &pell, &cess);
int aaa = pell*3;
int ccc = aaa + cess;
printf("%d\n", ccc/2);
return 0;
} | #include<iostream>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int max = 0;
for(int i = 0; i <= (int)S.size() - (int)T.size(); i++) {
int cnt = 0;
for (int j = 0; j < (int) T.size(); j++) {
if (S[i + j] == T[j]) cnt++;
}
if (max < cnt) max = ... | 0 | 59,584,803 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define RFOR(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#... | #include <bits/stdc++.h>
using namespace std;
template<class T>
struct Edge{
int from,to;
T cost;
Edge(int to,T cost) : to(to),cost(cost){}
Edge(int from,int to,T cost) : from(from),to(to),cost(cost){}
};
template<class T>
using WeightedGraph = vector<vector<Edge<T>>>;
using Graph = vector<vector<int>>;
template<cl... | 0 | 52,922,666 |
#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> B(N-1);
for(int i=0; i<N-1; i++){
cin>>B.at(i);
}
int a=0,sum=B.at(N-2);
if(N==2){
cout<<B.at(0)*2<<endl;
return 0;
}
else{
for(int i=N-3; i>=0; i--){
a=min(B.at(i),B.at(i+1));
sum+=a;
... | 0 | 80,351,837 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int R,G,B,N;
cin>>R>>G>>B>>N;
int i=0;
for(int r=0;r*R<=N;r++){
int N2=N-r*R;
for(int g=0;g*G<=N2;g++){
if((N2-g*G)%B!=0)
continue;
i++;
}
}
cout<<i<<endl;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define rw freopen("input.txt","r",stdin),freopen("output.txt","w",stdout);
#define pb push_back
#define F first
#define S second
#define pf push_front
#define lp(i,a,b) for (int i=a;i<=(int)b;++i... | 0 | 28,011,248 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector <ll int> v[100001];
ll int vis[100001];
ll int dist[100001];
void bfs(ll int src){
queue<int>q;
q.push(src);
vis[src] = 1;
dist[src] = 0;
while(!q.empty()){
int curr = q.front();
q.pop();
for(ll int child: v[curr]){
q.push(child);
... | #include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
voi... | 0 | 5,383,178 |
#include <iostream>
#include<vector>
using namespace std;
int main()
{
int N;
cin >> N;
vector<string> S;
vector<int> T;
for (int i = 0; i < N; i++) {
string s;
int t;
cin >> s >> t;
S.push_back(s);
T.push_back(t);
}
string X;
cin >> X;
bool flag = false;
int total = 0;
for (int i = 0; i < N; i++) ... | #include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#d... | 0 | 97,679,365 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, a, x, y, z;
x = 0;
y = 0;
z = 0;
cin >> N;
vector<int> btn(N);
for (int i = 0; i < N; i++) {
cin >> a;
btn.at(i) = a;
}
for (int j = 0; j < N;) {
if (btn.at(j) == 2) {
x++;
cout << x << endl;
break;
}
e... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF (1 << 29)
typedef long long ll;
int main(){
int n;
ll cost[11][11], town[11];
int from, to, t;
while(cin >> n, n){
for(int i = 0 ; i < 11 ; i++){
town[i] = 0;
for(int j = 0 ; j < 11 ; j... | 0 | 36,035,039 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;... | 0 | 68,362,703 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
int main(){
string s; cin >> s;
bool ok = true;
for(int i=0; i<6; ++i){
if(s[2]!=s[3]){ok = false; break;}
if(s[4]!=s[5]){ok = false; break;}
}
if(ok){cout << "... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
ll dx[4]={0,1,-1,0};
ll dy[4]={1,0,0,-1};
signed main(){
ios::sync... | 0 | 15,416,329 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int count = 0;
vector<pair<int, int>> v(5);
for(int i=0; i<5; i++) {
int a;
cin >> a;
sum += a;
if(a%10 == 0) count++;
v[i] = make_pair(a%10, a);
}
sort(v.rbegin(), v.rend());
for(int i=0; i<4-count; i++) {
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
int M;
cin >> M;
vector<P> work(N);
for (int i = 0; i < N; i++) cin >> work[i].first >> work[i].second;
sort(work.begin(),work.end());
priority_queue<int, vect... | 0 | 86,166,727 |
#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... | #include <iostream>
#include <array>
#include <algorithm>
#include <iterator>
#include <cstdint>
int main()
{
std::array<std::int32_t, 5> numbers;
for (std::int32_t& num : numbers) {
std::cin >> num;
}
std::sort(numbers.begin(), numbers.end(),
std::greater<std::int32_t>());
std::copy(numbers.begin(), numbers.... | 0 | 62,820,165 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string t = "keyence";
if(s == t){
cout << "YES" << endl;
return 0;
}
int l = s.size();
bool ok = false;
for(int i = 0; i < l; i++){
for(int j = i; j < l; j++){
string ans = "";
for(int k = 0; k < l; k++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<ll> Vector;
typedef vector<Vector> DVector;
#define fi first
#define se second
#define pb push_back
#define INF INT_MAX
#define bcnt __built... | 0 | 34,669,068 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <set>
#include <string.h>
using namespace std;
int main()
{
int n = 0;
int k = 0;
long long base = 1e9+7;
scanf("%d %d", &n, &k);
if(k == 0){
printf("1\n");
return 0;
}
vector<int> a(n, 0);
for(int i=0; i<n; i++){
scanf("%d", ... | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int func(int X,int A,int B,int C){return (A*X+B)%C;}
int main(){
int n,a,b,c,x;
while(1){
cin>>n>>a>>b>>c>>x;
if(!n && !a && !b && !c && !x)break;
int lucky[n];
rep(i,n)cin>>lucky[i];
int cnt=0,plac... | 0 | 47,796,132 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
templ... | #include <bits/stdc++.h>
using namespace std;
#if DEBUG && !ONLINE_JUDGE
#include "header.h"
#else
#define debug(args...)
#endif
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef long long lli;
typedef long double ld;
#define pb push_back
#define all(x) x.begin(),x.end()
#define SZ(x) (int)(x).size()
#defin... | 0 | 47,830,856 |
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
inline int in(){int x;scanf("%lld",&x);return x;}
int32_t main()
{
int n=in();int m=in();
int l=-1,r=INT_MAX;
int x,y;
for(int i=0;i<m;i++)
{
x=in();y=in();
l=max(l... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | 0 | 46,636,695 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 1e9;
const ll LLMAX = 1e18;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#d... | 0 | 40,278,395 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<string>;
using P =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
string s;
cin>>s;
... | #include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
using namespace std;
#define rep(i, j) for(int i = 0; i < j; i++)
#define f(i, k, j) for(int i = k; i... | 0 | 80,687,313 |
#include <iostream>
using namespace std;
void trace(int a[], int n) {
for (int i = 0; i < n; ++i) {
if (i) cout << ' ';
cout << a[i];
}
cout << endl;
}
int selectionSort(int a[], int n) {
int cnt = 0;
for (int i = 0; i < n; ++i) {
int minj = i;
bool flag = false;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 10000000000;
... | 0 | 46,162,384 |
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 6... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main(){
int N;
string s;
cin >> N >> s;
string check = string();
for(int i = 0 ; i < N; i++) check += '0';
int i = 0;
for(int k = 0; k < N; k++){
if(check[i] == '1') ... | 0 | 48,474,323 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
char s[11];
cin >> s;
int k;
cin >> k;
char key = s[k-1];
for(int i = 0; i < n; i++){
if(s[i] == key) continue;
s[i] = '*';
}
cout<< s <<endl;
return 0;
} | #include <iostream>
#include <cstring>
using namespace std;
int dp[1001][1001];
int main(){
int q,xl,yl;
char X[1001],Y[1001];
cin >> q;
for (int i=0;i<q;i++){
cin >> X >> Y;
xl=strlen(X);
yl=strlen(Y);
for (int i=1;i<=xl;i++)dp[0][i]=0;
for (int i=1;i<=yl;i++)dp[i][0]=0;
for (int i=0;i<... | 0 | 1,752,502 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int counta = 0;
int countb = 0;
vector<char> C(S.size());
for (int i = 0; i < S.size(); i++) {
C.at(i) = S.at(i);
if (i % 2 == 0 && C.at(i) == '1'){
counta++;
}
else if (i % 2 == 1 && C.at(i) == '0'){
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 0 | 97,456,012 |
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int main() {
int n, k, a;
map<int, int> mp;
pair<int, int> p[200010];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a;
mp[a]++;
}
int num = 0;
for(auto u:mp) {
p[num] = make_pair(u.sec... | #include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define deci(x,y) fixed<<setprecision(y)<<x
#define PI 3.141592653589793238
... | 0 | 37,211,512 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int a,b,c,d;
cin>>a>>b>>c>>... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | 0 | 25,444,371 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair < int , int >
const int N=1;
int main()
{
ll a,b,k;
cin>>a>>b>>k;
ll tmp=min(a,k);
k-=tmp;
a-=tmp;
if(k!=0){
b=max(b-k,0LL);
}
cout<<a<<" "<<b;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll ... | 0 | 20,244,103 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, y;
cin >> n >> y;
for (int i = 0; i <= n; ++i) {
for (int j = 0; i + j <= n; ++j) {
int k = n - i - j;
if (10000 * i + 5000 * j + 1000 * k... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
typedef pair<int, int> p;
int main(){
string s;
cin >> s;
vector<string>ans(9);
ans[0]=s[0];
for(int bit=0;bit<(1<<3);bit++){
int sum=s[0]-'0';
for(int i =0; i<3;i++){
if(bit&(1<<... | 0 | 33,707,282 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
constexpr int di[] = { 0, 1, 0, -1 }, dj[] = { 1, 0, -1, 0 };
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v)... | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_c... | 0 | 5,246,860 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
map<string,int> mp;
ll ans = 0;
for(int i = 0; i < n; i++){
string s; cin >> s;
sort(s.begin(), s.end());
mp[s]++;
if(mp[s]>=2)ans += mp[s]-1;
}
cout << ans << endl;
return 0 ;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <string>
#include <cmath>
#include <list>
#include <set>
#include <cstdlib>
using namespace std;
int in() {int x; cin >> x; return x;}
template <typename T> class SegTree
{
public:
int n;
T T_max;
vector<T> dat;
SegTree(int n_, T... | 0 | 72,185,284 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int X;
cin >> X;
long ans = 1;
while((X * ans) % 360 != 0){
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 39,738,040 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | #include <bits/stdc++.h>
using namespace std;
int H[305];
int sortedH[305];
long long memo[305][305];
long long dp(int i, int j){
if(i == 0){
return 0;
}else if(i == 1){
return H[1];
}else if(memo[i][j] != -1){
return memo[i][j];
}else{
long long ans = max(H[i]-H[i-1], 0)... | 0 | 5,317,899 |
#include <iostream>
#include <string>
using namespace std;
const int max_size = 1001;
int main() {
int n_input;
cin >> n_input;
for (int i = 0; i < n_input; i++) {
string seq1, seq2;
cin >> seq1 >> seq2;
int seq1_len = seq1.length(), seq2_len = seq2.length();
int grid[max_size][max_size] = {{0}};... | #include <cstddef>
#include <iostream>
#include <vector>
#include <set>
#include <signal.h>
#define BOOST_STACKTRACE_USE_ADDR2LINE
#ifdef DEBUG
#include <boost/stacktrace.hpp>
#endif
#define rep(i, n) for (size_t i = 0; i < n; ++i)
#define rev(i, n) for (size_t i = n - 1; i < n; --i)
#define as static_cast
typedef long... | 0 | 31,752,865 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int diff;
vector<int> abc(3);
cin >> abc[0] >> abc[1] >> abc[2];
sort(abc.begin(), abc.end());
diff = abc[2]-abc[1] + abc[2] - abc[0];
if(diff%2) {
cout << 1+(diff+1)/2 << endl;
} else {
cout << diff/2 << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define pb push_back
#define ull unsigned long long
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return v... | 0 | 7,263,880 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>
#define INF 2147483647
using namespace std;
int main()
{
do... | #include<bits/stdc++.h>
using namespace std;
#define Boost() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
t... | 0 | 76,081,867 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, ans;
cin >> n;
if (n < 10)
ans = n;
else if (n < 100)
ans = 9;
else if (n < 1000)
ans = 9 + n - 99;
else if (n < 10000)
ans = 909;
else if (n == 100000)
ans = 90909;
else
ans = 909 + n - 9999;
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 18,804,338 |
#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
typedef std::pair<LL, LL> P;
struct edge { LL to, cost; };
int H, W, N;
std::string field[1123];
int Sx, Sy, x[11], y[11], ans;
int d[1123][112... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 15,443,609 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
string S;
cin>>S;
for(ll i=0;i<19;i++) {
if(i==5||i==13) {
cout<<" ";
}
else {
cout<<S[i];
}
}
cout<<endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argv,char* argc[])
{
vector<pair<string,int> >ar;
int n;
cin>>n;
string s; int t;
for(int i=0;i<n;++i)
{
cin>>s>>t;
ar.push_back(make_pair(s,t));
}
string x;
cin>>x;
... | 0 | 30,772,081 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
ll n,h; cin>>n>>h;
vector<ll>a(n);
vector<ll>b(n);
rep(i,n){
... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
struct nodS
{
long long dpb, dpw;
vector<int> v;
};
int n,i,x,y;
nodS nod[100005];
void dfs(int p, int par)
{
nod[p].dpw=nod[p].dpb=1;
for(int it : nod[p].v)
{
if(it==par)
continue;
dfs(it, p);
n... | 0 | 10,213,458 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
int main(){
int k; cin >> k;
... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 45,366,349 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int a[1000], b[1000], i,s[1000];
i = 1;
while (1) {
cin >> a[i] >> b[i];
if (a[i] == 0 && b[i] == 0) { break; }
s[i] = 0;
i++;
}
for (int n = 1;n <= i - 1;n++) {
for (int j = 1;j <= a[n] - 2;j++) {
for (int k = j+1;k <= a[n] - 1;k+... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef lon... | 0 | 79,539,123 |
#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) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main( ) {
ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
int main()
{
long long h, w;
cin >> h >> w;
long long s[3], smin1, smin2, tmp, ans = INT_MAX;
for(int i = 1; i <= h; i++){
s[0] = i * w;
s[1] = ((h - i) / 2) * w;
if((h-i)%2==0){
... | 0 | 88,754,702 |
#include<iostream>
#include<queue>
#include<string>
using namespace std;
deque<int> dll;
void printList( )
{
deque<int>::iterator itr = dll.begin( );
deque<int>::iterator itrE = dll.end( );
for( ; itr!=itrE; itr++ ) {
cout<<*itr;
if( itr != itrE-1 ) cout<<' ';
}
cout<<endl;
}
int main()
{
int n;
ios::sync_wi... | #ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vecto... | 0 | 18,543,939 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; 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 sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | #include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | 0 | 52,282,044 |
#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 h,w,k;
cin >> h >> w >> k;
vector<string> s;
rep(i,h)rep(j,w){
string t;
cin >> t;
s.push_back(t);
}
int ans = 0;
for(int i=0; i<(1<<h); i++){
... | #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 getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... | 0 | 98,047,058 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int wa[105000];
bool ac[105000];
int main() {
cin >> n >> m;
int wac = 0;
int acc = 0;
for (int i = 0; i < n; i++) {
wa[i] = ac[i] = 0;
}
while (m--) {
int p;
string s;
cin >> p >> s;
if (ac[p]) continue;
if (s == "AC") {
ac[p] = 1;
acc++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> Chr(27,0);
string alph = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < S.size(); i++){
for (int j = 0; j < 26 ; j++){
if (S.at(i) == alph.at(j)) Chr.at(j)++;
}
}
string ans... | 0 | 68,696,505 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
constexpr ll INF = 1e16;
constexpr ll INM = 114514;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-12;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, ... | #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<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | 0 | 31,863,008 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<(r);i++)
#define pb push_back
#define fi first
#define se second
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,c;
int minn;
int *b;
while(true){
cin >> n;
if(n == 0) break;
b = new int[n];
for(int i=0;i<n;++i){
cin >>b[i];
}
minn = abs(b[0] - b[1]);
for(int i=0;i<n-1;++i){
for(int k=i+1;k<n;++k){
minn = min(minn,ab... | 0 | 31,094,407 |
#include <stdio.h>
int main(){
int data[101],n,i,max=0;
for(i=0;i<101;i++) data[i]=0;
while(scanf("%d",&n)!=EOF){
data[n]++;
if(data[n]>max) max = data[n];
}
for(i=0;i<101;i++){
if(data[i]==max) printf("%d\n",i);
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | 0 | 32,164,265 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define F first
#define S second
int n, m;
void solve(){
cin >> n >> m;
int f = m, s = m-1;
int loc = 0;
for(int i = f; i > 0; i-=2){
cout << loc+1 << " " << loc+i+1 << '\n';
++loc;
}
loc = f+1;
for(int i = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | 0 | 85,905,517 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long X,Y;
cin>>X>>Y;
if(X%Y==0){
cout<<-1<<endl;
return 0;
}
cout<<X*(Y-1)<<endl;
} | #include <bits/stdc++.h>
#define Int long long
#define pb push_back
using namespace std;
Int N,M,K;
Int X,Y,Z,D;
const int MAXN=105;
Int B,C;
struct DisJointSet{
vector<int> SZ;
vector<int> ID;
int n;
DisJointSet(int n){
SZ.resize(n);
ID.resize(n);
this->n=n;
for(int i=0;... | 0 | 51,122,162 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int p;
int n;
cin >> n >> p;
vector <int> v(n);
int even = 0;
int odd = 0;
for(int i = 0; i < n; i++) {
cin >> v[i];
v[i] %= 2;
even += v[i] == 0;
odd += v[i] == 1;
}
if(odd == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 0 | 3,998,072 |
#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(){
string a,b,c;
cin >> a >> b >> c;
cout << (char)(a[0] - 'a' + 'A') << (char)(b[0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; 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 | 1,513,840 |
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int x, y, c = 0;
cin >> x >> y;
int a[x];
for (int i = 0; i < x; i++)
{
cin >> a[i];
}
sort(a, a + x);
for (int i = 0; i < y; i++)
{
c = c + a[i];
}
cout << c;
retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#de... | 0 | 21,586,715 |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int h, w, d;
scanf("%d%d%d", &h, &w, &d);
int res[h][w];
forn(i, h) {
forn(j, w) {
res[i][j] = ((i + j) / d % 2) * 2 + ((i - j + w) / d % 2);
putchar("RYGB"[res[i][j]]);
}
puts("");
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
typedef map<string,ll> mapstl;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define one 1.0
#d... | 0 | 74,386,826 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
in... | 0 | 86,667,645 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.