code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <stdio.h>
#include <cmath>
#include <tgmath.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=s; i<=(long long)(n);i++)
#define repr(i,s,n) for(long long i=s;i>=(long long)(n);i--)
typedef long long ll;
const ll inf = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
ll mod=1e9+7;
bool dx[2][18000],dy[2][18000];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string ss;cin>>ss;
int a,b;cin>>a>>b;
vector<int> d;
int p=0;
rep(i,ss.size()){
... | 0 | 78,752,649 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
bool ff = true;
string s, p;
cin >> s >> p;
int ls = s.size(), lp = p.size();
for (int i = 0; i < ls; i++) {
bool flag = true;
for (int j = 0; j < lp; j++) {
if (s[(i + j) % ls] != p[j]) {
flag = false;
break;
}
}
if (flag) {
ff = ... | #include<bits/stdc++.h>
#include<cstdio>
using namespace std;
#define MOD 1000000007
#define FormulaToConvertMicrosecondsToSeconds(duration) duration / 1e+6
#define _CRT_SECURE_NO_DEPRECATE
#define ll long long
#define nl '\n'
#define upperString(str) ... | 0 | 35,901,626 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100000;
int n,m,v,p,a[N+9];
void into(){
scanf("%d%d%d%d",&n,&m,&v,&p);
for (int i=1;i<=n;++i)
scanf("%d",&a[i]);
}
LL sum[N+9];
int ans;
void Get_ans(){
sort(a+1,a+n+1,greater<int>());
for (int i=1;i<=n;++i){
sum[i]=sum[i-1]+a[i];... | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int a,b,c,d;
cin>>a>>b>>c>>d;
long s=(long)b*d,t=(long)a*c;
if(s<t){
s=t;
}
t=(long)a*d;
if(s<t){
s=t;
}
t=(long)b*c;
if(s<t){
s=t;
}
cout<<s<<endl;
return 0;
} | 0 | 29,829,217 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #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 pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3],n;
using Graph = vector<vector<int>>;
vector<vector<i... | 0 | 8,901,996 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void ans(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
const ll INF=1001001001;
const ll mod=10000000007... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 67,405,792 |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int leftCount = 0;
int rightCount = 0;
int count = 0;
for(int i = 0; i < n; ++i) {
if(count == 0 && s[i] == ')')
leftCount++;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n;
ll A[N];
ll minv;
ll ans;
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)
cin>>A[i];
for(int i=1;i<=n;i++)
{
if(i==1)
minv=A[i];
else
... | 0 | 13,748,946 |
#include<iostream>
int n,a,b;
int main(){
std::cin>>n>>a>>b;
std::cout<<((b-a)%2?"Borys":"Alice");
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 57,034,116 |
#include <iostream>
using namespace std;
int main()
{
int X;
cin >> X;
int ans = 0;
int ang = 0;
for (;;) {
ang = (ang + X) % 360;
ans++;
if (ang == 0) break;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | 0 | 31,341,843 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
ll rep_pow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_pow(a, b/2... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
string N;
int A, B;
cin >> N >> A >> B;
int rec = 0;
int ans = 0;
for (int i = 1; i <= atoi(N.c_str()); i++) {
for (int j = 0; j < to_string(i).length(); j++) {
rec += to_string(i)[j] - '0';
}
if (rec >= A && rec <= B)... | 0 | 10,408,769 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int num;
vector <int> n(4);
vector <char>s(3);
cin >> num;
n[3] = num / 1000; num = num % 1000;
n[2] = num / 100; num = num % 100;
n[1] = num / 10; num = num % 10;
n[0] = num;
int sum = 0;
for(int i = 0; i < 8; ++i){
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> sa(n);
copy(a.begin(), a.end(), sa.begin());
sort(sa.begin(), sa.end(), greater<int>());
for (int i = 0; i < n; i++) {... | 0 | 67,543,312 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n;
scanf("%d",&n);
list<int> lst;
for(int i=0;i<n;i++){
char c[11];
int p;
scanf("%s",&c);
string s=c;
if(s=="deleteFir... | 0 | 98,725,070 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n, ans = 0;
cin >> n;
int l, r;
for(int i = 0; i < n; i++)
{
cin >> l >> r;
ans += r - l + 1;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
sort(S.begin(), S.end());
map<char, int> letters;
for (int i = 0; i < 4; i++) {
letters[S[i]] += 1;
}
for (const auto& letter : letters) {
if (letter.second > 2 || letter.second < 2) {
cout << "No";
return 0;
}
}
cout <... | 0 | 82,861,991 |
#include<iostream>
using namespace std;
int main(void){
int a,b,c,d = 0;
cin >> a >> b >> c >> d;
bool yn = 0;
if(abs(a-c) <= d){
yn = 1;
}else if(abs(a-b)<= d && abs(b-c) <= d){
yn = 1;
}
if(yn){
cout << "Yes";
}else{
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vpl vector<pair<long long,long long>>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (... | 0 | 24,226,227 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
cout<<360/__gcd(360,n)<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sfl(i,a,n) for (int i=a;i<n;i++)
#define ufl(i,a,n) for (int i=n-1;i>=a;i--)
#define SZ(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
ll power(ll a, ll b){
ll res = 1;
for(int i = 0; i<b; i++)
res ... | 0 | 79,526,120 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
ll n, l,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | 0 | 89,777,053 |
#include <bits/stdc++.h>
#define Rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef int64_t intl;
int main(){
int N,K;
cin >> N>>K;
if ( N%K ==0){cout << 0;}
else {cout <<1;}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
ll ... | 0 | 19,171,874 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,K;
cin >> A >> B >> C >> K;
if(A>K){
cout << K <<endl;
return 0;
}
else if(K>=A && B>K-A){
cout << A <<endl;
return 0;
}
else if(K>=A+B && C>K-A-B){
cout << A-(K-A-B) << endl;
return 0;
}
else{
cout << A-C << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | 0 | 32,070,508 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i... | #include <iostream>
#include <string.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i < n+1; i++){
char* num = (char*)calloc(10, sizeof(char));
snprintf(num, 10,"%d", i);
int sum = 0;
while(*num != '\0'){
sum += *num - 48;
num++;
}
if(sum >= a && s... | 0 | 24,966,145 |
#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);
}
sort(a.begin(),a.end());
int sa = a.at(n/2)- a.at(n/2 -1);
cout<< sa <<endl;
} | #include <stdio.h>
#include <string.h>
int main(){
int i, len;
char str[2048];
fgets(str, sizeof(str), stdin);
len = strlen(str);
for (i = 0; i < len ; i++) {
if (str[i] >= 'a' && str[i] <= 'z') {
str[i] = str[i] - 0x20;
} else if (str[i] >= 'A' && str[i] <= 'Z') {
... | 0 | 53,836,853 |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | 0 | 13,813,661 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n; cin >> n;
ll ans = 0;
for(ll i = 2; i * i <= n; ++i){
ll cnt = 0;
ll kanta = 1;
while(n % i == 0){
n = n / i;
cnt++;
if(cnt >= kanta){
cnt = 0;
kanta++;
an... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int a[200005];
char s[200005];
int main()
{
int n;
scanf("%d",&n);
scanf("%s",s+1);
int t=0;
if(s[1]=='W'||s[2*n]=='W')
{
printf("0\n");
return 0;
}
for(int i=1;i<=2*n;i++)
{
... | 0 | 100,429,108 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll=long long;
using ld=long double;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, o... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
#include <stack>
#incl... | 0 | 35,987,643 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
for (int i = 0; i < s.length(); i++) s[i] = 9 - (s[i] - '1') + '0';
cout << s << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include <math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 1L... | 0 | 34,051,659 |
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
using namespace std;
int main(){
string s;
cin >> s;
r(i,4)cout << s.at(i);
cout << " ";
for(int i=4;i<s.length();i++)cout << s.at(i);
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main () {
string s;
cin >> s;
int a = s[0] - '0', b = s[1] - '0', c = s[2] - '0', d = s[3] - '0';
bool con = 1;
for (int i = -1; i < 2; i = i + 2)
for (int j = -1; j < 2; j = j + 2)
for (int k = -1; k < 2; k = k + 2) {
... | 0 | 37,658,888 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include<bits/stdc++.h>
#define BIG 2000000001
using namespace std;
int main(){
long long int a[1000];
for(int i=0;i<1000;i++) a[i]=BIG;
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
cout<<"node "<<i<<": key = "<<a[i]<<", ";
if(i==1){
if(n>1) cout<<"left key =... | 0 | 77,066,034 |
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false); cin.tie(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, a, b) for(int i = a, i##_len = (b); i < i##_len; ++i)
int graph[4][4];
bool visited[4];
bool all_vis(int cur) {
visited[cur] = true;
for(int i = 0; i < 4; ++i) if(graph[cur][i]) {
if(visited[i]) continue;
if(all_vi... | 0 | 44,210,241 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define S... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod ... | 0 | 28,706,003 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <iostream>
using namespace std;
int main(void)
{
int a,b,c=0;
cin >> a;
while(a!=0){
b=1000-a;
c+=b/500;
b=b%500;
c+=b/100;
b=b%100;
c+=b/50;
b=b%50;
c+=b/10;
b=b%10;
c+=b/5;
c+=b%5;
cout << c << endl;
c=0;
cin >> a;
}
return 0;
} | 0 | 74,807,415 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N;cin >> N;
string S;cin >> S;
int height=0,min_h=0;
for(int i=0;i<N;i++){
if(S[i]=='('){
height ++;
}else{
height --;
}
min_h = min(min_h,height);
}
min_h = -min_h;
for(int i=0;i<min_h;i++){
... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
string s;
cin >> s;
string an... | 0 | 40,261,640 |
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for (int i=0; i < (n); ++i)
using ll = long long ;
using namespace std;
const int INF = 1001001001;
int main() {
ll n,k ;
cin >> n >> k ;
vector<ll> vec(100001) ;
for(int i=0;i<n;++i){
ll a,b ;
cin >> a >> b ;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(... | 0 | 71,151,072 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 25,750,077 |
#include <bits/stdc++.h>
int main() {
int X, A, B;
std::cin >> X >> A >> B;
if ((B - A) <= 0) {
std::cout << "delicious\n";
} else if ((B - A) > X) {
std::cout << "dangerous\n";
} else {
std::cout << "safe\n";
}
return 0;
} | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sq... | 0 | 20,593,422 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 54,898,454 |
#include<stdio.h>
#define f(i,m) for(int i=1;i<=m;i++)
int main(){
f(i,9)f(j,9)printf("%dx%d=%d\n",i,j,i*j);
return 0;
} | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define N 100003
using namespace std;
vector<int> adj[N];
int a[N];
int n;
void dfs(int u,int fa){
a[u] = 0;
int v,l = adj[u].size();
for(int i=0;i<l;++i){
v = adj[u][i];
if(v==fa) cont... | 0 | 28,535,688 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
const int INF = 8101919;
const int MAX_H = 1000;
const int MAX_W = 1000;
const int MAX_N = 10;
struct pt {
int x;
int y;
};
int h;
int w;
int n;
pt cheese[MAX_N];
queue<pt> nextsearch;
pt ... | #include <stdio.h>
struct STUDENT {
int mid_res;
int fin_res;
int re_res;
};
int main(void) {
struct STUDENT students[100000];
int m, f, r;
int i, num = 0;
do {
scanf("%d %d %d", &m, &f, &r);
students[num].mid_res = m;
students[num].fin_res = f;
students[num].re_res = r;
num++;
} whi... | 0 | 85,563,532 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
bool f(int x) {
if (x < 100) return false;
if (2000 <= x) return true;
rep(i,1,19) {
int l = 100 * i, r = 105 * i;
if (l <= x && x <= r) return true;
}
return false;
}
int main() {
int X;
cin >> X;
cout << f... | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
using namespace std;
string chengeWord(int n){
string str;
if(n >= 1000){
if(n / 1000... | 0 | 25,628,503 |
#include <iostream>
using namespace std;
string ToMCXI(int v) {
char c[5] = "ixcm";
int k[4] = {1, 10, 100, 1000};
string ret = "";
for (int i = 3; i >= 0; --i) {
int d = v / k[i] % 10;
if (d > 1) ret += (char)(d + '0');
if (d > 0) ret += c[i];
}
return ret;
}
int FromMCXI(string mcxi) {
int ret = 0;
for ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 32,077,443 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s="keyence";
string t;
cin>>t;
int n=t.size();
for(int i=0;i<8;i++){
string a,b;
a=t.substr(0,7-i);
b=t.substr(n-i,i);
if(a==s.substr(0,7-i)&&b==s.substr(7-i,i)){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int (i) = 0; (i) != (... | 0 | 12,172,314 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
ll Xor(ll N){
int m = N % 4;
if(m == 0) return N;
if(m == 1) retu... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#def... | 0 | 78,809,515 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pl;
typedef queue<ll> ql;
typedef set<ll> sl;
typedef vector<ll> vl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, n) for(ll i = 1; i <= ll(n); i++)
#define all(v) v.begin(), v.end()
bool chmin(ll &a, ll &b) {... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
set<int> a;
rep(i,k) {
int d;
cin >> d;
rep(i,d) {
int b;
cin >> b;
a.insert(b);
}
}
int sum = 0;
... | 0 | 100,568,904 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define all(s) s.begin(),s.end()
#define pb push_back
#define uno unordered_map
#define pi 3.1415926536
#define dig(a) fixed<<setprecision(a)
#define foreach(var,i) for(auto i = var.begin();i!=var.end();i++)
#define fast() ios_base::s... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
string s;
cin >> s;
vector<bool> dp(100005, false);
dp[0] = true;
rep(i,s.size()-4){
if(!dp[i]) continue;
if(s[i] == 'd' && s[i+1] == 'r' && s[i+2] == 'e' && s[i+3] == 'a' && s[i+4... | 0 | 16,295,600 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | #include<bits/stdc++.h>
#include<stack>
using namespace std;
int main(void) {
char str[105];
while(1){
cin.getline(str, sizeof(str));
if(str[0] == '.') break;
stack<char> s;
s.push('0');
int flag = 1;
for(int i = 0; str[i] != '\0'; i++){
if(str[i] == '... | 0 | 29,750,729 |
#include "bits/stdc++.h"
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef long long ll;
bool isAbove(pair<double, doub... | #include <iostream>
#include <math.h>
#include <cstdio>
using namespace std;
int main(){
double a,b,c,s,l,h;
cin >> a >> b >> c;
s=0.5*a*b*sin((M_PI*c*1.0)/180);
l=a+b+sqrt(pow(a,2.0)+pow(b,2.0)-2*a*b*cos((M_PI*c*1.0)/180));
h=b*sin((M_PI*c*1.0)/180);
printf("%.8f\n%.8f\n%.8f\n",s,l,h);
} | 0 | 11,360,745 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | #include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rep... | 0 | 25,535,588 |
#include <iostream>
using namespace std;
int main()
{
unsigned long n, ans = 1;
cin >> n;
for (unsigned long i = n; i > 0; i--) {
ans *= i;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s, t;
cin >> s >> t;
queue<char> sq, tq;
for (int i = 0; i < (int)s.size(); i++) {
sq.push(s.at(i));
tq.push(t.at(i));
}
for (int i = 0; i < (int)s.size(); i++) {
sq.push(sq.front());
sq.pop();
... | 0 | 41,045,420 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
int m... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll W, H, N;
cin >> W >> H >> N;
ll min_x = 0, max_x = W;
ll min_y = 0, max_y = H;
for (ll i = 0; i < N; i++)
{
ll x, y, a;
cin ... | 0 | 51,913,728 |
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
ll sum;
string s;
cin >> s;
for(char c : s)
{
sum... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> s[M];
for (int i = 0; i < M; i++) {
int k; cin >> k;
s[i].resize(k);
for (int j = 0; j < k; j++) {
cin >> s[i][j];
s[i][j]--;
}
}
vecto... | 0 | 65,397,080 |
#include <bits/stdc++.h>
using namespace std;
void grid(int A,vector<vector<char>> &color){
for(int i=0;i<49;++i){
for(int j=0;j<49;++j){
if(i==0 || i==48 || j==0 || j==48) color[i][j]='#';
else color[i][j]='.';
}
}
int count=0;
while(count<24 && count<A){
for(int i=0;i<49;++i) col... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
long long n, ans = (long long)1e18;
cin >> n;
vector<long long> a(n + 1);
for(int i = 1; i <= n; i++){
cin >> a[i];
a[i] += a[i - 1];
}
for(int i = 1; i < n; i++){
long long x, y;
x = a[i];
y = a[n] ... | 0 | 24,800,520 |
#include<stdio.h>
int main(){
int matrix[3][3];
char o;
for(int i = 0; i<3 ; i++){
for(int j = 0; j<3 ; j++){
scanf("%d", &matrix[i][j]);
}
}
int N;
scanf("%d", &N);
int input[N];
for(int x = 0; x < N ; x++){
scanf("%d", &input[x]);
for(int i = 0 ; i<3 ; i++){
for(int j = 0 ; j<3 ; j++){
if(in... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> a(N), b(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll cnt = 0;
for (int i = 0; i < N... | 0 | 97,587,989 |
#include <iostream>
using namespace std;
void solve()
{
int a, b, c;
cin >> a >> b >> c;
int ans = 0;
for (int i = a; i <= b; ++i)
{
if (c % i == 0)
{
++ans;
}
}
cout << ans << endl;
}
int main()
{
solve();
return(0);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 51;
int n;
int d[N];
int psum[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> d[i];
sum += d[i];
psum[i] = sum;
... | 0 | 43,227,637 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int n;
int a[1000001];
int inp[200001];
void solve(){
cin >> n;
for (int i = 0; i < 1000001; i++)
{
a[i] = 0;
}
int tmp;
for (int i = 0; i < n; i++)
{
cin >> inp[i];
}
sort(inp, inp+n)... | 0 | 87,949,774 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, M; cin >> A >> B >> M;
vector<int> a(A), b(B), x(M), y(M), c(M);
const int INF = 100005;
int ami... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | 0 | 1,041,389 |
#include <iostream>
using namespace std;
int main(){
long long in;
int count = 0;
cin >> in;
for(int a=1; a <= in; a++){
for(int b = 1;b <= (in/a); b++){
int c = in - a*b;
if(c != 0) count++;
}
}
cout << count << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll calc(ll n){
ll m = n+1;
ll ans = 0;
for(int i=0;i<50;i++){
ll tmp = 0;
ll loop = 1LL<<(i+1);
tmp += m/loop * (loop/2);
tmp += max(0LL,m%loop-loop/2);
if(tmp%2==1) ans += (1LL<<i);
}
return a... | 0 | 4,892,264 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | #include <iostream>
#include <iterator>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <numeric>
#include <iomanip>
#include <limits>
#include <set>
#include <map>
#include <type_traits>
#include <cstdint>
#include <queue>
#define _USE_MATH_DEFINES
#include <math.h... | 0 | 5,374,986 |
#include <iostream>
using namespace std;
int main(void){
int x;
cin >> x;
cout << 10-(x/200) << endl;
return 0;
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
void dfs(vector<int>& perm, int state, int pre, ll sum, ll& ans,
vector<vector<ll>>& adj) {
... | 0 | 38,972,513 |
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int x, n; cin >> x >> n;
vector<int> cnt(102, 0);
int p;
for (int i = 0; i < n; i++)
{
cin >> p;
cnt[p]++;
}
int ans;
for (int i = 0; i < 51; i++)
{
if (cnt[x - i] == 0)
{
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 6,903,380 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
int main() {
std::string s;
std::cin >> s;
std::string ans = "None";
for (int i = 'a'; i <= 'z'; i++) {
bool f = false;
for (int j = 0; j < s.size(); j++)
{
if(i == s[j]) {
f = tr... | #include <iostream>
#include <string>
#include <vector>
#include <numeric>
using namespace std;
int main(int argc, char const *argv[])
{
string S;
cin >> S;
vector<long long> a(S.size() + 1);
vector<long long> b(S.size() + 1);
vector<long long> c(S.size() + 1);
for (int i = 0; i <= S.size() - 1;... | 0 | 28,875,709 |
#include <iostream>
#include <cmath>
using namespace std;
#define INITIAL 100000
#define INTEREST 1.05
#define CEILING 1000
int
dow(int a, float r, int w)
{
if (w == 0)
return a;
float c = a / CEILING;
return dow(ceil(c * r) * CEILING, r, --w);
}
int
main()
{
int w;
cin >> w;
cout << dow(INITIAL, INTEREST, w) <... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 0 | 38,945,199 |
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
for (int i=0; i<3; i++){
string str; cin>>str;
printf("%c", toupper(str[0]));
}
}
int main(){
solve();
Bye;
} | #include <iostream>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
typedef pair<int,int> pint;
const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
string mp[1000];
int visit[1000][1000];
int main(){
int h,w,n,cx,cy,ans=0;
cin>>h>>w>>n;
for(int i=0;i<h;++i){
cin>>mp[i];
... | 0 | 20,772,021 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N, Y;
cin >> N >> Y;
for (ll i = 0; i <= N; ++i)
{
for (ll j = 0; j <= N - i; ++j)
{
ll k = N - i - j;
if (k < 0)
{
break;
}
ll ... | #include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | 0 | 96,019,860 |
#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
using namespace std;
int main(void){
long long int sum;
int max, min, N;
cin >> N;
int temp;
for(int i = 0; i < N; i++){
cin >> temp;
if(i == 0){
sum = temp;
min = temp;
max = temp;
}
else{
if(temp > max) max = temp;
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
ll n;
cin >> n;
ll t = sqrt(n);
for (ll i = t; i >= 0; i--) {
if (n % i == 0) {
cout << i-1+(n/i)-1 << endl;
return 0;
}
}
ret... | 0 | 50,578,077 |
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, x, y;
int main(){
scanf("%d%d", &n, &m);
if(m >= (1<<n)) printf("-1\n");
else if(m == 0){
for(i=0; i<=(1<<n)-1; i++){
printf("%d %d ", i, i);
}
}
else if(n < 2) printf("-1\n");
else{
for(i=0; i<=(1<<n)-1; i=++x){
if((j=i^m) < i) continue... | #include <iostream>
using namespace std;
int main(){
int n,m,p;
while(cin >> n >> m >> p && n){
int x[100];
int a=0,d,ans;
for(int i=0;i<n;i++){
cin >> x[i];
a+=x[i];
}
d=a*100*(100-p)/100;
if(x[m-1]==0)
ans = 0;
else
ans=d/x[m-1];
cout << ans << endl;
}
... | 0 | 22,563,323 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(cons... | #include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
using ll=long long;
int main() {
int N, C=0;
cin >> N;
vector<int> h(N);
for (int i=0; i<N; i++) {
cin >> h[i];
}
while (true) {
int fin=1, m;
for (int i=0; i<N; i++) {
if (h[i]>0) {
fin=0;
m=i;
b... | 0 | 47,522,193 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
#define vit vector<int>::iterator
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fr first
#define sc second
#define skip continue
#define PI 3.14159265
typedef u... | 0 | 9,352,595 |
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
string s[N];
int cnt [N][28];
int main ()
{
int n;
cin >> n;
for (int i = 0 ;i < n ; i++) {
cin >> s[i];
for (int j = 0; j < (int)s[i].size(); j++)
{
cnt[i][s[i][j]-'a']++;
}
}
for (int j = 'a'-'a'; j <= 'z'-'a'; j++) {
int minn = 1e9;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define mod2 998244353
#define pii pair<ll,ll>
#define pb push_back
#define debug(a) { cout << #a << " = " << a << endl;}
void sep() {
cout << "-------------BLOCK-----------------\n";
}
template<typename T>
void debugv(vector<... | 0 | 81,718,799 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s,t;cin >>s>>t;
sort(all(s));
sort(all(t));
reverse(all(t));
if... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define int long long
#define swap(x,y) (x^=y^=x^=y)
#define debug1(a) cerr<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cerr<<#a<<" = ... | 0 | 39,998,974 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n;
cin>>n;
int sum=0;
int c=1;
while(sum<n){
sum+=c;
... | #include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8, pi = acos(-1.0);
bool eq(ld a, ld b){return (abs(b-a)<eps);}
ld dot(Point a, Point b){return real(conj(a)*b... | 0 | 23,268,397 |
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
#define REP(i,a,b) for(in i=(in)(a);i<(in)(b);i++)
const double PI=3.14159265358979323846;
const in MOD = 998244353;
const in INF=1e18+7;
const in inf=1e9+7;
using P=pai... | 0 | 82,942,088 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<int64_t> B(N - 1);
for (int i = 0; i < N - 1; i++) cin >> B.at(i);
int64_t res = B.at(0) + B.back();
for (int i = 0; i + 1 < B.size(); i++) {
res += min(B.at(i), B.at(i + 1));
}
cout << res << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(long long a,long long b) ... | 0 | 92,688,453 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int N[65535];
int i = 0;
while(1){
scanf("%d", &N[i]);
if(N[i] == 0) break;
i++;
}
for (int j = 0; j < i; j++){
cout << "Case " << j+1 << ": " << N[j] << "\n";
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 79,407,400 |
#include<cstdio>
const int max_n = 100;
int main(){
int n;
int u,k,v;
int G[100][100];
for(int i=0;i<100;i++){
for(int j=0;j<100;j++){
G[i][j] = 0;
}
}
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d %d",&u,&k);
for(int j=1;j<=k;j++){
scanf("%d",&v);
G[u-1][v-1] = 1;
}
}
for(int i=0;i<n;i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
vector<ll> A;
bool ok(int m)
{
ll tmp = 0;
for (int i = 0; i <= m; i++)
tmp += A[i];
for (int i = m + 1; i < A.size(); i++)
{
if (tmp * 2 <... | 0 | 34,328,397 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
void solve() {
int n; cin >> n;
map<int,set<int>> mp;
for (int i = 0; i < n; i++) {
int x; cin >> x;
mp[x].insert(i);
}
vector<ll> res(n, 0);
int sz = 0;
int i = n;
for (auto rit = mp.rbegin(); rit != mp.re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a <= b && c <= d) {
cout << a + c << "\n";
} else if (a <= b && c >= d) {
cout << a + d ... | 0 | 99,296,803 |
#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>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T>
void print_vec(vector<T> v) {
for (T i : v) cout << i << " ";
cout << end... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF = -1e18;
const int I=2001;
int input() {int x; cin>>x; return x;}
int main(){
int n,k; cin>>n>>k;
ll a[n]; for(int i=0;i<n;i++) cin>>a[i];
ll ... | 0 | 84,149,225 |
#include<iostream>
using namespace std;
int N;
int K;
int A;
int main(){
cin>>N>>K;
A=N%K;
cout<<A<<endl;
} | #include <stdio.h>
int main(void){
int x;
int y;
int buf;
while(1){
scanf("%d %d",&x,&y);
if(x == 0 && y == 0) break;
if(x > y){
buf = x;
x = y;
y = buf;
}
printf("%d %d\n",x,y);
}
} | 0 | 30,926,487 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y,k;
cin>>X>>Y;
if(X%Y==0){
cout<<-1<<endl;
return 0;
}
for(k=1;k<Y;k++){
if((k*X)%Y!=0){
cout<<k*X<<endl;
return 0;
}
}
cout<<-1<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100000
#define maxn 200002
#define pb pu... | 0 | 10,097,389 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int r,D,x;
cin >> r>>D>>x;
vector<int>Ans(11);
Ans[0] = x;
for (int n = 0; n < 10; ++n) {
Ans[n + 1] = r * Ans[n] - D;
}
for (int n = 0; n < 10; ++n) {
cout << Ans[n+1] <<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) {
string tmp;
cin >> tmp;
... | 0 | 60,812,101 |
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 0; ; i++) {
int x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
break;
} else if (x < y) {
cout << x << ' ' << y << endl;
} else {
cout << y << ' ' << x << endl;
}
}
} | #include <iostream>
#include <string>
#include <list>
using namespace std;
int
main()
{
ios_base::sync_with_stdio(false);
int n;
cin >> n; cin.ignore();
list<int> lst;
for (int i = 0; i < n; i++) {
string cmd;
getline(cin, cmd);
switch (cmd[6]) {
case 'F':
... | 0 | 80,854,135 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mincost(ll arr[],ll n,ll k)
{
if(n==2)
return abs(arr[2]-arr[1]);
else
{
ll dp[n+1];
dp[1]=0;
dp[2]=abs(arr[2]-arr[1]);
for(ll i=3;i<=n;i++)
{
ll mn=INT_MAX;
for(ll j=1;j<=k;j++)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 13,315,394 |
#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 <iostream>
#include <bits/stdc++.h>
#include<string>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
int h[n];
for(int i=0;i<n;i++)
{
cin>>h[i];
}
vector<int> dp(n,INT_MAX);
dp[0]=0;
dp[1]=abs(h[1]-h[0]);
for(int i=2;i<n;i++)
{
int j=1;
... | 0 | 92,257,442 |
#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>
using namespace std;
#define PI acos(-1.0)
#define FOR(I,A,B... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 13,294,266 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
using plli=pair<ll,int>;
using vplli=vector<pair<ll,int>>;
using pllll=... | #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++)
const long long INF = LLONG_MAX;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<cla... | 0 | 55,504,790 |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 0 | 55,193,113 |
#include<bits/stdc++.h>
#define ll long long
#define N 100010
using namespace std;
int n,a[N];
ll s[N],ans,no=1;
int main(){
cin>>n;
for (int i=0;i<=n;i++)cin>>a[i];
for (int i=n;i>=0;i--)s[i]=s[i+1]+a[i];
for (int i=0;i<=n;i++){
ans+=no;
no=no-a[i];
if (no<0){
puts("-1");
return 0;
... | #include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | 0 | 95,090,438 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define _ ios... | 0 | 53,583,275 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
#define EPS 0.001
using namespace std;
using ll = long long;
using vi = vector<int>;
using pl... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{
ll n; cin >> n;
vector<ll> a(n);
... | 0 | 39,193,782 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(i... | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main() {
... | 0 | 92,466,101 |
#include<iostream>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<cmath>
#include<vector>
#include<map>
#include<random>
#include<sstream>
using namespace std;
int main(){
int n;cin >> n ;
int t,h,o;
t = n/100;
h = n%100/10;
o = n%... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int n;
cin >> n;
int a[300000] {0};
for(int i = 0; i < (1 << n); i++) cin >> a[i];
int fir[300000];
int sec[300000];
bool looked[300000];
for(int i = 0; i < (1 << n); i++) fir[i] = i;
fill(sec... | 0 | 92,238,694 |
#include <stdio.h>
#include<math.h>
int main()
{
double n, x, t, ans, r;
scanf("%lf%lf%lf", &n, &x, &t);
ans = (n*t)/x;
r = ceil(ans/t);
printf("%.0lf\n", r*t);
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void input(string &x,string &y){
cin>>x>>y;
}
int lcs(string x,string y){
vector<vector<int>> tb(vector<vector<int>>((int)x.size()+1,vector<int>(y.size()+1,0)));
for(int i=1;i<(int)x.size()+1;i++){
for(int j=1;j<(int)y.size()+1;j++){
i... | 0 | 70,679,678 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
#include <cmath>
#include <string>
using namespace std;
long long max(long long a,long long b) {
if(a > b)
return a;
else
return b;
}
long long min(long long a,long long b) {
if(a < b)
return... | #include <bits/stdc++.h>
#define ll long long
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define lpri(n) printf("%lld ",n)
#define pri(n) printf("%d ",(int)n)
#define prin(n) printf("%d\n",(int)n)
#define lprin(n) printf("%lld\n",n)
#define rep(i,ini,n) for(int i=ini;i<(int)n;i++)
#define pb push_ba... | 0 | 54,872,623 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n; cin >> n;
string s; cin >> s;
string t="";
if(n%2!=0){
cout << "No" << endl;
return 0;
}
re... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
size_t N;
cin >> N;
vector<long> A(N, 0);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<long> base(N, 0);
for (int i = 0; i < N; ++i)
base[i] = A[i] - (i + 1);
sort(base.begin(), ba... | 0 | 56,379,848 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int LOGN=20;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<ll> x(n);
for(int i=0;i<n;i++) cin>>x[i];
ll l; int q;
cin>>l>>q;
vector<vector<int>> dp(LOGN,vector<int>(n,0));
for(int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int k,n;
void solve(){
cin>>n>>k;
int st = 1;
for(int i=1;i<=n;i++){
if(st*2<st+k)st*=2;
else st+=k;
}
cout<<st<<endl;
... | 0 | 87,621,512 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(... | #include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int N, M;
pair<int,int> PD[10010];
pair<int,int> PD2[10010];
int main() {
while (cin >> N >> M && N) {
int d, p;
for (int i=0; i<N; ++i) {
cin >> d >> p;
PD[i] = make_pair(p, d);
}
sort(PD,PD+N);
for (i... | 0 | 2,150,213 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespac... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll t,n,m,i,a,b;
cin>>n;
vector<ll> v(n+1);
for(i=1;i<=n;i++)
{
cin>>v[i];
... | 0 | 83,422,620 |
#include "iostream"
#include "string"
#include "algorithm"
using namespace std;
int main(int argc, char const *argv[])
{
string str;
int q=0;
string sub1,sub4,rev;
int sub2,sub3;
cin >> str;
cin >> q;
for (int i = 0; i < q; ++i)
{
cin >> sub1;
if (sub1 == "print")
{
cin >> sub2 >> sub3;
cout << str... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
void chmin(int &a, int b) { if (a > b) a = b; }
int N, A, B, C;
int L[10];
int rec(int i, int a, int b, int c){
... | 0 | 86,245,124 |
#include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main() {
string S,S1,S2,ans="Yes";
cin >> S;
bool flag=1;
int N=S.size(),n=(N-1)/2;
rep(i,N/2){
if(S[i]!=S[N-1-i]){
flag=0;
}
}
if(flag){
S1=S.substr(0,n);
... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 95,655,426 |
#include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#includ... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
using namespace std;
int main(void) {
int m, f, r;
char grade = '\0';
cin >> m >> f >> r;
while( !(m==-1 && f==-1 && r==-1) ) {
if( m==-1 || f==-1... | 0 | 77,267,504 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
int main() {
int n;
string s, p;
cin >> s;
cin ... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int p[101010],q[101010];
int main()
{
int h,w,st1=1,st2=1;
long long ans=0;
scanf("%d%d",&h,&w);
for(int i=1;i<=h;i++)
{
scanf("%d",&p[i]);
ans+=p[i];
}
for(int i=1;i<=w;i++)
{
scanf("%d",&q[i]... | 0 | 29,569,806 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
int a;
vector<int> l;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a;
if(l.empty()) l.push_back(a);
else{
if(l.back() < a) l.push_back(a);
else{
l[lower_bound(l.begin(),l.end(),a) - l.begin()] = a;
}... | #include <bits/stdc++.h>
int mod_num = 998244353;
int main(){
int N;
std::cin >> N;
std::vector< int > cnt(N, 0);
int max = 0;
int tmp;
std::cin >> tmp;
if(tmp != 0){
std::cout << 0 << std::endl;
return 0;
}
cnt[0]++;
for(int i=1; i<N; i++){
int tmp;
... | 0 | 12,824,342 |
#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> h(n);
rep(i, n) cin >> h[i];
int ans = 0;
int right = 1;
for (int left = 0; left < n; ++left) {
while (right < n && ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
string s; cin >> s;
if ((s[0] == s[1] && s[1] == s[2]) ||
(s[1] == s[2] && s[2] == s[3])) {
cout << "Yes" << endl;
}
... | 0 | 58,709,719 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<ll> mat(n);
ll rsum = 0;
for(int i = 0;i < n; ++i){
cin >> mat[i];
rsum ^= mat[i];
}
for(int i = 0;i < n; ++i){
mat[i] &= (~rsum);
}
ll l = 0; ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#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 < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | 0 | 38,938,835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.