code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int f[2005],n,mod=1e9+7;
int main()
{
cin>>n;
f[0]=1,f[1]=0,f[2]=0,f[3]=1;
for(int i=4;i<=n;i++) f[i]=(f[i-1]+f[i-3])%mod;
cout<<f[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 0;
bool flag = false;
int pos = 0;
for(int i = 1; i <= n; i++)
{
sum += i;
if(n == sum)
{
flag = true;
pos = i;
break;
}
}
if(!fla... | 0 | 75,821,474 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
typedef pair<int, int> pairII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define long long ll;
#define shig_for(i, a, b) for(int i = (a); i < (b); ++i)
#define shig_rep(i... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
int n,i,array1[N],counter=0;
map<int,int>visited;
scanf("%d",&n)... | 0 | 46,717,978 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
ll a,b,i,j,count=0;
a=360;
cin>>b;
count=gcd(a,b);
j=(a*b)/count;
cout<<j/b;
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
char c[2][3];
for(long long i = 0; i < 2; i++){
for(long long j = 0; j < 3; j++){
cin >> c[i][j];
}
}
char c_re[2][3];
for(long long i = 0; i < 2; i++){
for(long long j = 0; j < 3; j++){
... | 0 | 85,062,433 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, long long L, long long T, std::vector<long long> X, std::vector<long long> W){
ll count = 0;
for (int i=1;i<N;i++){
ll init_pos;
if (W[0] ==1 && W[i] == 2){
init_pos = X[i]-X[0];
... | #include<iostream>
#include<string>
using namespace std;
int main () {
string str;
cin >> str;
int q;
cin >> q;
for (int i = 0; i < q; i++) {
string order;
cin >> order;
int a, b;
cin >> a >> b;
if (order == "print") {
string out;
out =... | 0 | 18,153,140 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pii pair<int,int>
int N;
int A[200010];
int mem[1000010];
int num[1000010];
signed main()
{
cin >> N;
rep(i, N)
{
cin >> A[i];
num[A[i]]++;
}
sort(A, A + N);
int ans... | #include <iostream>
using namespace std;
int main(){
int a, b;
while (cin >> a >> b){
if (a != 0 || b != 0){
if (a > b){
cout << b << " " << a << endl;
}
else {
cout << a << " " << b << endl;
}
}
else {
break;
}
}
return 0;
} | 0 | 79,825,943 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin >> n >> m;
int a[n];
int sum = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
int ans = 0;
for(int i = 0; i < n; i++){
if(a[i] * (4*m) >= sum){
ans++;
}
}
if(ans >= m){
cout << "Yes" << endl... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, const char * argv[]) {
int H,W;
int i,j;
while (true) {
cin >> H >> W;
if(H == 0 && W == 0) break;
else{
for (j=0; j<H; j++) {
if (j==0||j==H-1) {
for (i=0; i... | 0 | 30,498,756 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(vr) vr.begin(),vr.end()
const int N=1e5+10,inf=2e9;
ll a[N],val[N],n,ps[N],ans[N];
ll get(ll x)
{
int tmp=upper_bound(val+1,val+n+1,x)-... | 0 | 21,014,836 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int N, M; cin >> N >> M;
vector<stri... | 0 | 27,643,797 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int x, y;
while(1){
cin >> x >> y;
if (x == 0 && y == 0) break;
if(x < y) printf("%d %d\n", x, y);
else printf("%d %d\n", y, x);
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define s... | 0 | 25,888,356 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long K, A, B;
cin >> K >> A >> B;
if (B - A <= 2) {
cout << K + 1 << endl;
} else {
long long t = max(0LL, (K - (A - 1)) / 2);
cout << A + (B - A) * t + (K - (A - 1)) % 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 0 | 82,271,380 |
#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... | #include <bits/stdc++.h>
using namespace std;
int n,s,t,cnt,ans; string S;
vector<pair<int,int>> trains;
vector<int> unit={36000,3600,0,600,60,0,10,1};
multiset<int> waiting;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
while(cin >> n,n){
trains.clear();
for (int i=0;i<n;++i){
... | 0 | 19,976,472 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
unsigned long a, b;
cin >> a >> b;
cout << a/b << ' ' << a%b << ' ';
cout << fixed << setprecision(5) << a / (double) b << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
int H;
int heap[250];
int main(void) {
cin >> H;
for (int i = 0; i < H; ++i) {
scanf("%d", heap + i);
}
for (int i = 0; i < H; ++i) {
printf("node %d: key = %d, ", i + 1, heap[i]);
if (i != 0) {
... | 0 | 15,845,479 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax... | 0 | 52,650,028 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long LINF = 1LL << 60;
const long long LMINF = 1LL << 63;
const int INF = 1 << 30;
#define REP(i,n) for(int i = 0;i < n;++i)
#define REPS(i,x) for(int i = 1;i <= (int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i >= 0;i--)
#define RREP... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
for (int i = 0; i < n; i++){
for(int j = 0; j < d; j++){
cin >> x[i][j];
}
}
int ans = 0;
for (int i = 0; i < n; i++){
for (int j = i... | 0 | 27,431,431 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
string s,t;
int flg = 0;
cin>>s>>t;
for(int i = 0; i < s.length(); i++)
{
if(s[i] != t[i])
{
flg++;
}
}
cout<<flg;
cout<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define l first
#define r second
#define int long long
int n;
int a[500000];
int kek = 1, ans = 0;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (i... | 0 | 15,330,335 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char C;
cin >> C;
cout << ((C == 'A') ? 'T' : (C == 'T') ? 'A' : (C == 'C') ? 'G' : 'C') << "\n";
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin>>n;
vector<ll> p(n+1), q(n+1);
rep(i,n... | 0 | 2,434,004 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <bitset>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <iomanip>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define F first
#define S second
#define lb lower_bound ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int r,g,b,n;
cin>>r>>g>>b>>n;
int ans = 0;
rep(i,3005){
rep(j,3005){
if(n - r*i - g*j < 0)
continue;
if((n - r*i -g*j) % b == 0)... | 0 | 86,071,349 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a... | 0 | 3,500,576 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
void solve(std::string S){
char op[2] = {'+', '-'};
int ret = S[0]-'0';
for(int i=0; i<2; i++) {
int x = ret;
if(op[i]=='+') ret += (S[1]-'0');
else ret -= (S[1]-'0');
for(int j=0; j<2; j... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,m,d,p;
while (cin>>n>>m) {
if (n==0&&m==0) {
break;
} else {
std::multimap<int, int,greater<int>> map;
for (int i=0;i<n;i++) {
cin>>d>>p;
map.insert(make_pair(p... | 0 | 98,987,328 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,in,t;
cin>>t;
vector<ll>v;
ll sum=0;
for(ll i=0;i<t;i++)
{
cin>>in;
sum+=in;
v.push_back(in);
}
ll s,d=0;
ll... | 0 | 74,785,723 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i, n) FOR(i,0,n)
int main (void){
int N,K;
cin >> N >> K;
vector<int> d;
vector<vector<int>> A;
d.resize(K);
A.resize(K, vector<int>());
REP(i,K){
cin >> d[i];
... | #include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using... | 0 | 97,574,091 |
#define _GLIBCXX_DEBUG
#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... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<ll> A(N+1);
ll sum=0;
for(ll i=0;i<N+1;i++) {
cin>>A[i];
sum+=A[i];
}
vector<ll> B(N);
for(ll i=0;i<N;i++) {
cin>>B[i];
}
for(ll i=0;i<N;i++) {
if(A[i]>=B[i]) {... | 0 | 4,341,006 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
int N, M;
... | #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 >= int(... | 0 | 26,300,564 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
int main() {
int n; cin >> n;
ll ans = 1;
for (int i = 1; i <= n; i++) {
ans *= i;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(){
ll N, M;
cin >> N >> M;
vector<ll> p(M);
vector<string> S(M);
for (int i = 0; i < M; i++) cin >> p[i] >> S[i];
vector<bool> check(N);
for (int i = 0; i < N; i++) check[i] = false... | 0 | 68,560,669 |
#include<stdio.h>
#include<string.h>
int main(){
char m[1000],b[2],g[1000][1000],c[2]="-";
int n,a,i,j,d,f=0;
while(1){
scanf("%s",m);
if(strcmp(m,c)==0){
break;
}
int e=strlen(m);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
for(j=0;j<a;j++){
b[0]=m[0];
d=1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pii;
int main() {
ll N; cin >> N;
vector<ll> A(N); for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end(), greater<ll>());
bool hasNeg = false;
bool hasPos = false;
ll abssum = 0, sum = 0;
for ... | 0 | 45,564,972 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string L;
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<vector>
typedef long long ll;
const int MAX_M = 200000 + 7;
using namespace std;
ll c[MAX_M];
ll d[MAX_M];
int main(){
ios::sync_with_stdio(0);
int m;
cin >> m;
ll digit_sum=0;
ll byte = 0;
for (... | 0 | 2,441,631 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n;
cin>>n;
string s;
cin>>s;
int k;
cin>>k;
k--;
for(int i =0;i<n;i++){
if (s[i]!=s[k]){
cout<<"*";
}
else{
cout<<s[i];
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getChar(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else return 0;
}
long long getKey(char str[]) {
long long sum ... | 0 | 68,873,565 |
#include <bits/stdc++.h>
using namespace std;
int alphabet[('z' - 'a' + 1)];
int main() {
string S;
cin >> S;
if(S.size() < 26) {
for(auto &p : S) ++alphabet[p - 'a'];
for(int i = 0; i < 'z' - 'a' + 1; ++i) {
if(!alphabet[i]) {
cout << (S + (char)(i + 'a')) << end... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
ll x, y;
cin >> x >> y;
ll a = abs(x), b = abs(y);
ll ans = 0;
if(a < b) {
if(x < 0) ans++;
ans += b-a;
... | 0 | 65,249,916 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int_fast32_t i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int_fast32_t i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DI... | #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;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | 0 | 77,862,863 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).b... | #include<bits/stdc++.h>
using namespace std;
int n, A, B, C;
int l[8] = {0};
int cost = 1000000;
int how_many_bamboos = 0;
void dfs(int i, int a, int b, int c){
if(i == n){
if(a*b*c == 0) return ;
cost = min (cost ,10*max(0,how_many_bamboos-3) + abs(a-A) + abs(b-B) + abs(c-C));
}
else{
... | 0 | 38,468,955 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b,k;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<fixed<<se... | 0 | 91,659,448 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n , k ;
cin >> n >> k ;
int ans = 1 ;
int now = k ;
while(now<n){
now += k-1 ;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int N, P;
string S;
int cnt[10010];
int mod_pow(int x, int n, int mod) {
int res = 1;
while (n>0) {
if (n&1) res = res*x%mod;
x = x*x%mod;
n >>= 1;
}
... | 0 | 39,459,758 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | 0 | 100,539,370 |
#include <iostream>
#include <vector>
using namespace std;
struct TMatrixInfo
{
int RowSize;
int ColSize;
TMatrixInfo(int ARowSize, int AColSize)
{
RowSize = ARowSize;
ColSize = AColSize;
}
TMatrixInfo()
{
}
};
vector<vector<int> > TableResize(int n)
{
vector<vector<int> > CostCountTable;
CostCountTable.r... | #include <cstdio>
#include <ctime>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <bitset>
#include <stack>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double... | 0 | 58,717,265 |
#include<iostream>
using namespace std;
int main(){
int m, m1 = 0, m2 = 0, m3 = 0;
for(int i=0;i<10;i++){
cin >> m;
if(m > m1){
m3 = m2;
m2 = m1;
m1 = m;
}else if(m > m2){
m3 = m2;
m2 = m;
}else if(m > m3){
m3 = m;
}
}
cout << m1 << endl;
cout << m2 << e... | #include<bits/stdc++.h>
#define ll long long
#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)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class... | 0 | 92,422,208 |
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define pb push_back
#define PI 3.141592653589793
#de... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long m[4][3];
long long a[1... | 0 | 95,900,260 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,Ncap,forTwait;
cin >> N >> Ncap >> forTwait;
vector<int> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
sort(data.begin(), data.end());
int ans= 0;
int Nwait= 0;
int atTtop= 0;
for(auto atTarrive:data){
if(Nwait==0){ atTt... | 0 | 86,814,783 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = v... | /*http:
#include <iostream>
#include <vector>
#include <algorithm>
#define MAX 999999
using namespace std;
int num_prime[MAX];
bool not_prime_flag[MAX];
int main()
{
int n;
int max_input;
vector<int> input;
while (cin>>n){
input.push_back(n);
}
max_input=*max_element(input.begin(),input.... | 0 | 18,917,136 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int total = 0, freq[105] = {0};
for(int i = 1; i <= n; i++){
int val;
cin >> val;
freq[val]++;
}
for(int i = 1; i <= 100; i++){
total += (i * freq[i]);
}
int ans1 = total / n, res1... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int lim = (n - 1) * (n - 2) / 2;
if (k > lim) {
printf("-1");
return 0;
}
int diff = lim - k;
int m = n - 1 + diff;
vector<pair<int, int>> edges;
for (int i = 1; ... | 0 | 24,238,741 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h,n;
cin>>n>>h;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
if(h>=n)
{
cout<<0;
return 0;
}
unsigned long long int ans=0;
for(int i=0;i<n-h;i++)
{
ans+=a[i];
}
cout<<ans;
} | #include<bits/stdc++.h>
using namespace std;
using Lint=long long;
int main()
{
int N; cin>>N;
vector<int> a(N);
for(int i=0;i<N;i++) cin>>a[i];
Lint ans=a[0]-1;
int mx=1;
for(int i=1;i<N;i++){
if(a[i]==mx+1){
mx++;
}else{
ans+=(a[i]-1)/(mx+1);
}
}
cout<<ans<<... | 0 | 11,641,080 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define PI 3.14159265359
using namespace std;
using ll = long long;
bool kaibun(string s){
string t(s.rbegin(), s.rend());
return s == t;
}
int main(){
string s;
cin >> s;
int n = s.size();
cout << (kaibun(s) && kaibun(s.substr(0,(n-1)/2)) &... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 98,670,616 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
template<class t>
inline bool chmax(t &a, t b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class t>
inline ... | #include <iostream>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
for (int x = 0; x <= N; ++x) {
for (int y = 0; y <= N - x; ++y) {
int z = N - x - y;
int disY = Y - (10000 * x + 5000 * y);
if (disY == 1000*z) {
cout << x << " " << y ... | 0 | 13,022,858 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The Value Of " << #val << " is : " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef ... | #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 | 73,075,056 |
#include<bits/stdc++.h>
using namespace std;
#define O_O ios_base::sync_with_stdio(0); cin.tie(NULL)
#define endl '\n'
#define PI acos(-1.0)
#define CASE(n) cout << "Case " << n << ": "
#define CASE_(n) cout << "Case " << n << endl
#define FIXED(n) cout << fixed << setprecision(n)
#define MOD 1000000007
inline void nor... | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
vector<int> g[101010];
int h[101010];
int main(){
int v, e;
cin >> v >> e;
for (int i = 0; i < e; i++){
int s, t;
cin >> s >> t;
g[s].push_back(t);
h[t]++;
}
stack<int> st;
for (int i = 0;... | 0 | 84,186,856 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
a.push_back(0);
bool low = true;
int ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
typedef long long lint;
const int N=1e5+5;
const int mod=1e9+7;
int n,p1,p2,val[N],fac[N],ifac[N],pos[N];
namespace utils{
template <class T> inline void apn(T &x,const T y){x>y?x=y:0;}
template <class T> inline void apx(T &x,const T y){x<y?x... | 0 | 67,486,009 |
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <regex>
#include <locale>
#include <iomanip>
using namespace std;
using ll = 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=int(b);i<i##_Len;++i)
#define rep... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
int N;
cin>>N;
string s;
cin>>s;
int K;
cin>>K;
K--;
for(int i=0;i<N;i++){
if(s[K]!=s[i]){
s[i] = '*';
}
}
cout<<s<<endl;
return 0;
} | 0 | 20,304,081 |
#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 <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;
string s;
cin >> N >> s;
vector<tuple<char,char,char>> inits;
if (s[0] == 'o') {
inits.push_back(make_tuple('S', 'S', 'S'));
inits.push_back(make_tup... | 0 | 73,859,891 |
#include <bits/stdc++.h>
using namespace std;
int zyuu(int i) {
int z=0;
while (i>0) {
z+=i%10;
i/=10;
}
return z;
}
int main() {
int N, A, B, S=0;
cin >> N >> A >> B;
for (int i=1; i<=N; i++) {
if (zyuu(i)>=A && zyuu(i)<=B) {
S+=i;
}
}
cout << S << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | 0 | 21,134,286 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<pll> vpl;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define... | # 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; ... | 0 | 95,196,681 |
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int h=1, w=1;
while (h != 0 && w != 0) {
cin >> h;
cin >> w;
if (h == 0 && w == 0) continue;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i,s,e) for(int i=(s); i<(e);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n)
#define repe(i,n) for(auto &&i:n)
#define all(v) (v).begin(),(v).end()
#define decimal fixed<<setprecision(20)
#define fastcin() cin.tie(0);ios::sync_with_stdio(false)
using namespace std;
usin... | 0 | 87,912,847 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,K,a,ans = 0;
cin >> N >> K;
map<int64_t,int> mp;
for(int i=0;i<N;i++) {
cin >> a;
mp[a]++;
}
vector<int> ball(mp.size());
a = 0;
for(auto m:mp) {
ball[a] =m.second;
a++;
}
sort(ba... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#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,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | 0 | 49,705,361 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int n, m;
cin >> n >> m;
vector<int> light(... | #include <bits/stdc++.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 repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.... | 0 | 81,916,195 |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll mod = 1000000007;
int main() {
string s,t;
cin >> s >> t;
int ans = 0,len = s.size();... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for(int i = (a); i < (n); i++)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define print(a) cout << a << "\n"
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
int main() {
cin.tie(0);
ios::sync_with_std... | 0 | 15,748,783 |
#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... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long N;
long long K;
long long i;
long long p;
cin >> N >> K;
p=0;
for(i=K;i<=N+1;i++){
p+=(N-i+1)*i+1;
p = p % 1000000007;
}
cout << p << endl;
return 0;
} | 0 | 60,315,840 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <functional>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <complex>
#include <list>
#include <cassert>
#include <deque>
#i... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 62,988,636 |
#include <bits/stdc++.h>
using namespace std;
int a,b;
int main() {
cin>>a>>b;
if(a<=b){
cout<<"unsafe";
}else{
cout<<"safe";
}
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include<set>
#include <map>
using namespace std;
#include <iostream>
using namespace std;
int n,m;
int main()
{
cin >> n >> m ;
int A[m-1];
int sum=0;
for (int i=0; i<m; i++) {
cin >> A[i];
sum += A[i];
}
if (sum > n) {
... | 0 | 27,880,874 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int dp[1010][10010];
int main(){
int h,n;
cin>>h>>n;
vector<int> a(n),b(n);
rep(i,n) cin>>a[i]>>b[i];
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MA... | 0 | 94,459,202 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n ) FOR( i, 1, n + 1 )
#define ALL( a ) (a).begin(), (a).end()... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
list<ll> ans_list;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
ans_list.push_front(a[i]);
} else {
ans_list.push_back(a[i]);
}... | 0 | 10,061,171 |
#include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll... | #include<bits/stdc++.h>
#define mino "frequency"
#define ll long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define matrix vector<vector<ll>>
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define Down(i,a,b) for(int i=a; i>=b; i--)
#define FOR_(i,a,b) for(int i=a; i<b; i++)
#define t... | 0 | 56,408,361 |
#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;
template < typename T > using oset = tree < T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update >;
typedef long long ll;
typedef long double ld;
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 1001001001001001000;
ll modpow(ll A, ll N) {
ll RET = 1;
while (N) {
if (N & ... | 0 | 23,615,656 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (A + B - 1 > N || A * B < N) {
cout << -1 << endl;
return 0;
}
if (A == 1) {
rep(i, B) {
cout << N - i << " ";... | 0 | 55,903,899 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)
#define allof(a) (a).begin(),(a).end()
#define minit(a,b) memset(a,b,sizeof(a))
using lint = long long;
using pii = pair< int, int >;
template< typename T > using Vec = vector< T >... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
map<ll,... | 0 | 19,298,736 |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> a(N);
for(int i=0; i<N; ++i) cin >> a[i];
ll ans=a[0]-1, now=2;
for(int i=1; i<N; ++i){
if(a[i]==now) ++now;
else if(a[i]>now){
ans += a[i]/now-(a[i]%now==0 ? 1 : 0);
}
... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b){
return a*b / gcd(a, b);
}
int main() {
ll n,x; cin >> n >> x;... | 0 | 38,632,818 |
#include<bits/stdc++.h>
using namespace std;
const long long mod=1000000007;
const long long INF=9e15;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<long long,long long>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define re... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).b... | 0 | 96,348,647 |
#include <cstdio>
#include <iostream>
using namespace std;
static int count(int n, int x) {
int s = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
for (int k = j + 1; k <= n; ++k) {
if (i + j + k == x)
s += 1;
}
}
}
return s;
}
int main() {
int n, x;... | #include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int N;
long a[100100];
long count[100100] = {};
cin >> N;
for (int i = 0; i < N; ++i) {
scanf("%d", &a[i]);
count[a[i]]++;
}
int num_unique = 0;
for (int j = 0; j<=100000; j++){
if (count[j] >= 1) {num_unique += 1;}
... | 0 | 78,325,480 |
#include <iostream>
#include <vector>
#include <sstream>
#include <string>
#include <cmath>
using namespace std;
const int EPS=1e-9;
namespace FP {
bool isZero(double x) {
return (abs(x) <= EPS);
}
};
struct Point {
double x, y;
Point(double x=0, double y=0) : x(x), y(y) {}
string to_s() {
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define dcou... | 0 | 32,804,184 |
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define show(x) cerr<<(#x)<<" : "<<x<<endl;
#define ll long long
#define ld long double
#define fill(a,val) memset(a,val,sizeof(a))
#define mp make_p... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
int main(){
priority_queue<ll> Q;
int n, k;
cin >> n >> k;
rep(i, n){
ll x;
cin... | 0 | 55,735,975 |
#include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll, ll> P;
constexpr ll INF = 1e15;
constexpr ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 94,260,352 |
#include<bits/stdc++.h>
#define ll long long
#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)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<list>
using namespace std;
const int maxn = 100000;
const int infly = (1<<29);
vector <int> G[maxn+5];
list <int> out;
bool c[maxn];
int N;
int indge[maxn];
void bfs(int s)
{
queue <int> q;
q.push... | 0 | 50,584,263 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define modd 998244353
#define inf 1e18
#define ff first
#define ss second... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
vector<int> v(3);
rep(i, 3) {
cin >> v[i];
}
sort(v.begin(), v.end());
... | 0 | 43,000,896 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll a,b,c,d,k;
cin >> a >> b >> c >> d;
k = max(a*c,a*d);
k = max(k,b*c);
k = max(k,b*d);
cout << k << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 11,277,357 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
int memo[1000000];
int res(int n) {
if(n == 0) return 0;
if(memo[n] != -1) return memo[n];
int ans = n;
for(int i = 1; i <= n; i *= 6) {
ans = min(ans, res(n - i) + 1);
}
for(int i = 1... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--... | 0 | 85,985,376 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,b;
ll i,j,k;
ll x[100005];
bool solve(){
cin >> n >> a >> b;
if(n + a + b == 0){
return false;
}
for(i=0;i<n;i++){
cin >> x[i];
}
ll num = -100;;
ll ansind = -1;
for(i=a-1;i<b;i++){
ll sa = x[i] - x[i+1];
if(sa >= num){
num = s... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 59,784,904 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long X, Y;
cin >> X >> Y;
int ans = -1;
if(X %Y == 0){
ans = -1;
}
else{
int i=1;
while(X*i < 10000000000000000){
if(X*i %Y != 0){
ans = X*i;
break;
}
i++;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | 0 | 43,244,319 |
#include <iostream>
using namespace std;
main () {
string str;
while(cin >> str) {
int sum = 0;
for (int i=0; i<str.length(); i++) {
sum += str[i] - 48;
}
if (sum == 0) break;
cout << sum << endl;
}
} | 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;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for... | 0 | 92,088,408 |
#include <iostream>
#include <cmath>
using namespace std;
class Triangle{
float m_x[3],m_y[3],m_xp,m_yp;
float m_vx[3],m_vy[3];
float m_nv1,m_nv2, m_rot,m_rot_sum,m_cos_sita;
int m_p1,m_p2;
bool m_pointIsSetted;
public:
Triangle(){m_pointIsSetted=false;m_rot_sum=0;}
void setPoint(float x1, float y1, float x2, fl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int mpow(int base, int exp);
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<ll,ll>> vpll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef unordered_ma... | 0 | 86,940,007 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include ... | #include <cmath>
#include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int n, d;
std::cin >> n >> d;
std::vector<std::vector<int>> x(n, std::vector<int>(d));
for (int j = 0; j < n; ++j)
for (int i = 0; i < d; ++i)
std::cin >> x.at(j).at(i);
int cnt = 0;
for (int i = 0; i < n; ++... | 0 | 18,000,191 |
#include <iostream>
using namespace std;
int main() {
int d, t, v;
cin >> d >> t >> v;
if(t * v >= d){
cout << "Yes";
}else{
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<double>> XY(N);
for(int i=0; i<N; i++){
double x, y;
cin >> x >> y;
XY[i] = {atan2(x, y), x, y};
}
sort(XY.begin(), XY.end());
double ans = 0;
for(int i=0; i<N; i++) for(int n... | 0 | 70,753,339 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll c[55... | #include <stdio.h>
#define N 20
int main(void){
int stk[N], sp=0;
int n;
while (scanf("%d", &n) != EOF){
if (n==0 && sp!=0){
printf("%d\n", stk[--sp]);
} else {
stk[sp++] = n;
}
}
return 0;
} | 0 | 71,481,089 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using vvi=vector<vi>;
int main() {
int N; cin >>N;
vll A(N);
vll B(N+1);
rep(i,0,N) {
cin >>A[i]... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int... | 0 | 82,005,620 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
ll pow_mod(ll a, ll n, ll MOD){
ll m[60]; m[0]=a;
r... | #include<iostream>
using namespace std;
int main() {
int D, T, S;
cin >> D >> T >> S;
int A = S * T;
if (A >= D) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
return 0;
} | 0 | 8,321,412 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz le... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;
long long modpow(long l... | 0 | 28,073,668 |
#include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.141592653... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 75,146,722 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100010;
const int INF = 1001001001;
int dp[MAX_N];
int main()
{
int N;
cin >> N;
for (int i = 0; i < MAX_N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i <= N; i++)
{
for (int j = 1; i + j <= N; j *= 6)
... | 0 | 92,218,898 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int arr[200001];
int main()
{
fast_io;
int n;
cin >> n;
set <int> s;
for(int i =0 ; i < n; i++)
{
int x;
cin >> x;
s.insert(x);
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define INF 1e8
typedef long long int ll;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
int main() {
int a[3][3];
rep(i, 3) {
rep(j, 3) { cin >> a[i][j]; }
}
int n;
ci... | 0 | 78,975,805 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int N;
char s[4002];
int r[4002],g[4002],b[4002];
long long int ans = 0;
int main(){
scanf("%d",&N);
scanf("%s",&s[1]);
for(int i=N-1;i>0;i--){
r[i] = r[i+1];
g[i] = g[i+1];
b[i] = b[i+1];
if(s[i+1] == 'R')r[i] ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 83,873,300 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int remaining = n;
int left = 0, right = n - 1;
while (right -... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
const long long MOD = 1000000007;
const int MAX = 200001;
long long fac[MAX];
long l... | 0 | 83,628,607 |
#include <bits/stdc++.h>
#define INF 114514810
#define FOR(i, r, n) for(int i=(r); i<(n); i++)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
vector<int> v;
int t;
int main(){
REP(i, 10) {
cin >> t;
v.push_back(t);
}
sort(v.begin(), v.end());
cout << v[9] << endl << v[8] << endl << v[7] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N,M;
cin >> N >> M;
if(N == 1){
if(M != 1){
cout << M-2 << endl;
return 0;
}
else{
cout << 1 << endl;
return 0;
}
}
else if(M == 1){
if(N != 1){
cout << N-2 << endl;
return 0;
}
... | 0 | 77,451,845 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
string s,t;
cin >> s >> t;
if(s.size()<t.size()){
cout << "UNRESTORABLE" << endl;
return 0;
}
int fit=-1;
for(int i=0; i<=s.size()-t.size(); i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int,int> PII;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i... | 0 | 56,606,376 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 51;
const int mod = 1000000007;
const double pi = 3.141592653589;
vector<ll> cntP(MAX), height(MAX);
void init() {
cntP[0] = height[... | #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 | 3,013,946 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll s;
cin >> s;
ll a = s;
set<ll> sea... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <random>
#include <ctime>
using namespace std;
int main(){
int n,k ;
string s ;
cin >> n >> s >> k ;
char key = s.at(k-1) ;
for (int i = 0; i < s.size(); i++)
{
if (s.at(i) != key)
... | 0 | 88,524,942 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 66,856,814 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int N;
cin >> N;
int ans = N;
for (int i = 0; i <= N; ++i)
{
int t = i,cnt = 0;
while(t > 0)
{
cnt += t % 6;
t /= 6;
}
t = N-i;
while(t > 0)
{
... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void){
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
}
ll res = 0;
vector<ll> s(n + 1, 0);
for (int i = 0; i < n; i++){
s[i + 1] = s[i] + (... | 0 | 55,169,359 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <cstring>
#include <sstream>
#include <iomanip>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define FOR(i,a,b) for(int i=(int)(a);i<(int... | #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
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
... | 0 | 37,065,689 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define pow2(i) (1<<i)
#define BIT(X,i) ((X>>i)&1)
#define DEBUG(x) cerr<<__LINE__<<": "<<#x<<" = "<<x<<"\n"
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
const int INF = 1e9;
int main() {
... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
static const int N = 1000;
int lcs(string X, string Y){
int c[N+1][N+1];
int m = X.size(), n = Y.size();
int maxl = 0;
X = " " + X;
Y = " " + Y;
for(int i=1; i<=m; i++) c[i][0] = 0;
for(int j=1; j<=n; j++) c[0][j] = 0;
for(i... | 0 | 99,843,170 |
#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 <bits/stdc++.h>
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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int A,B; cin >> A >> B;
int ans... | 0 | 45,751,539 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main()
{
ios::sync_with_stdio(false);
int n;
cin >> n;
LL ans = 1000, num = 0, dq = 1e9;
while (n--)
{
LL ls;
cin >> ls;
if (ls <= dq)
{
num = ans / ls;
dq = ls;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | 0 | 13,900,348 |
#include <iostream>
#include <cstdio>
using namespace std;
const int MAX_N = 1000000;
bool prime[MAX_N + 1];
void sieve()
{
prime[0] = prime[1] = false;
for(int i = 2; i <= MAX_N; ++i)
prime[i] = true;
for(int i = 2; i <= MAX_N; ++i)
if(prime[i])
for(int j = i * 2; j <= MAX_N; j += i)
prime[j] =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 0 | 49,369,832 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll nCr(ll n, ll r) {
ll a = 1;
for (ll i = 1; i <= r; i++) {
a *= n--;
a /= i;
}
return a;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | 0 | 87,088,551 |
/*https:
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s1, s2;
int count = 0, flag = 1;
cin >> s1;
if (s1[0] == '0')
s2 += '0', flag = 0;
else ... | #include <bits/stdc++.h>
#include<cmath>
using namespace std;
int main()
{
char c;
cin>>c;
string str="aiueo";
int b=0;
for(int i=0;i<str.size();i++){
if(c==str.at(i)){
cout<<"vowel";
b=1;
break;
}
}
if(!b){
cout<<"consonant";
}... | 0 | 34,954,553 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.