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 main() {
int N,K;
cin >> N >> K;
vector<int> I(N);
for(int i=0;i<N;i++){
int a;
cin >> a;
I.at(a-1)++;
}
int ans=0;
sort(I.begin(),I.end());
for(int i=0;i<N-K;i++){
ans += I.at(i);
}
cout << ans <<e... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 53,521,334 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<int>moji(N);
for(int i=0;i<N;i++){
cin>>moji.at(i);
}
int sum=0;
for(int i=0;i<N;i++){
sum+=moji.at(i);
}
int count;
for(int i=0;i<N;i++){
if(moji.at(i)*(4*M)>=sum){
count++;
}
}
if(count>=M){
cout<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin>>N>>K;
if(K*2>(N-2)*(N-1)){
cout<<"-1"<<endl;
}
else{
cout<<N*(N-1)/2-K<<endl;
for(int i=1;i<N;i++){
cout<<i<<" "<<N<<endl;
}
int x=(N-1)*(N-2)/2-K;
int a=1,b=1;
for(int i=0;i<x;i++){
b++;
if(... | 0 | 26,893,687 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n, a, b;
cin >> n >> a >> b;
int cnt[3] = {0};
for (int i = 0; i < n; i++)
{
int p;
cin >> p;
if(p <= a){
cnt[0]++;
}
if(a < p && p <= b){
cnt[1]++;
}
if(b < p){
cnt[2]++;
}
}
cout << min(cnt[0], min(cnt[1], cnt[2])) << end... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,x,t;
set<int> s;
cin >> x >> n;
for(int i = 0; i < n; ++i){
cin >> t;
s.insert(t);
}
vector<pair<int,int>> diff;
for(int i = -200; i <= 200; ++i){
if(s.count(i)) continue;
diff.emplace_back(abs(x-... | 0 | 29,911,252 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | 0 | 77,951,320 |
#include<iostream>
#include<vector>
using namespace std;
vector<int> UFtree;
int root(int i) {
if(UFtree[i] == i) return i;
return (UFtree[i] = root(UFtree[i]));
}
bool is_same_set(int i, int j) {
return root(i) == root(j);
}
void unite(int i, int j) {
UFtree[root(i)] = root(j);
}
int main() {
int n, q, op, x... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | 0 | 51,658,793 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int main() {
int n; cin >> n;
int q; cin >> q;
dsu d(n);
while(q--) {
int t, u, v; cin >> t >> u >> v;
if(t == 0) {
d.merge(u, v);
} else {
cout << d.same(u, v) << '\n';
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<string> res;
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
if (str == string(M, '.')) continue;
res.push_back(str);
}
for (int j = 0; j < res[0].size(); ++j) {
bool all = true;
for (int... | 0 | 8,427,518 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
string ans;
if (A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) {
ans = "Possible";
} else {
ans = "Impossible";
}
cout << ans << endl;
return 0;
} | 0 | 22,337,753 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans = 0;
char tmp = s[0];
for(char x : s){
if(x != tmp){
tmp = x;
ans++;
}
}
cout << ans << endl;
} | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 37,377,146 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int a, flag = 1;
string b;
cin>>a>>b;
if(a%2==0)
{
int c= b.length()/2;
for(int i=0; i<c; i++)
if(b.at(i)!=b.at(i+c))
{
flag = 0;
break;
}
... | 0 | 62,686,948 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
int n;
string s, t;
cin >> n >> s >> t;
rep(i, n)
{
cout << s[... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | 0 | 98,872,968 |
#include <iostream>
using namespace std ;
int main()
{
int a , b , c , d , A , B , C , D ;
cin >> a >> b >> c >> d ;
A = min(a,b) ;
B = min(c,d) ;
cout << A + B ;
return 0 ;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 0 | 41,007,707 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;... | #include<iostream>
#include<string>
int main(){
int i,j;
std::string x,y;
int a[1001][1001];
int knum;
for(i=0; i<1001; i++){
for(j=0; j<1001; j++){
if(j==0)a[i][j]=i;
else if(i==0)a[i][j]=j;
else a[i][j]=0;
}
}
std::cin>>x;
std::cin>>y;
int vx,vy,vz;
for(i=1; i<x.size()+1;... | 0 | 43,025,684 |
#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 whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #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 N,M;
cin >> N >> M;
vec... | 0 | 10,320,756 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
complex<int> c1(x1, y1), c2(x2, y2), rot(0, -1), c3 = rot * (c1 - c2) + c2, c4 = rot * (c2 - c3) + c3;
cout << c3.real() << " " << c3.imag() << " " << c4.real() << " " << c4.imag() << endl;
... | #include<bits/stdc++.h>
using namespace std;
const int maxi=1e6;
long long a[maxi],b[maxi];
int size(long long x, long long y)
{
int ans=0,ans1=0;
while(x>0)
{
x/=10;
ans++;
}
while(y>0)
{
y/=10;
ans1++;
}
if (ans!=ans1) return 1; else return 0;
}
int main... | 0 | 19,888,680 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef unsigned long long LL;
LL N;
vector<LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003,INF=1<<30;
int main(){
int N,A,B;cin>>N>>A>>B;
int rep=(N+A-1)/A;
if(rep<=B&&A+B<=N+1){
if(A==1){
for(int i=N;i>=1;i--){
cout<<i<<e... | 0 | 38,886,850 |
#include <iostream>
using namespace std;
int A, B, C;
int main()
{
cin >> A >> B >> C;
if (A != 0 && B != 0 && C != 0)
{
if ((A + B) - C >= 0)
cout << "Yes\n";
else
cout << "No\n";
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int d, hd;
int sum;
while(cin >> d){
sum = 0;
hd = d;
while(hd < 600){
sum += hd*hd*d;
hd += d;
}
cout << sum << endl;
}
return 0;
} | 0 | 36,882,749 |
#include <iostream>
using namespace std;
int main(){
char x,y;
cin >> x >> y;
if(x<y) cout << '<' << "\n";
else if(x==y) cout << '=' << "\n";
else cout << '>' << "\n";
return 0;
} | #include <iostream>
int main() {
using namespace std;
int a[9];
for (int i=0; i<9; i++){
cin >> a[i];
}
int n, b;
cin >> n;
for (int j=0; j<n; j++) {
cin >> b;
for (int i=0; i<9; i++){
if (a[i] == b) {
a[i] = -1;
}
}
... | 0 | 83,310,818 |
#include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define jfor(stt,llim... | #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 | 24,105,013 |
#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>
int main(){
string s; cin >> s;
int n = s.size();
... | #include <cstdio>
#include <string>
#include <vector>
using namespace std;
struct Card {
char suite;
int value;
bool operator==(const Card& rhs) const
{
return suite == rhs.suite && value == rhs.value;
}
};
void bubbleSort(vector<Card>& v)
{
for (size_t i = 0; i < v.size(); ++i) {
... | 0 | 60,142,686 |
#include <iostream>
#include<vector>
#include<algorithm>
#define ll long long
#define INVALID -1
#define mod 1e9+7
#define rep(n) for(int i=0;i<n;++i)
using namespace std;
int main(void){
int n,m;
vector<pair<ll, ll>> vec;
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
cin>>a>>b;
vec.push_back({a,b});
}
sort(vec... | #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 | 46,502,588 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,X,T;
int ans,tmp;
cin >> N >> X >> T;
ans = N / X;
tmp = N % X;
if (tmp != 0){
ans++;
}
cout << ans * T << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int n, a[100004], cnt[100004], comb[100004], lcomb[100004];
int mul(int a, int b){
long long ret = (long long) a*b;
return ret % mod;
}
int power(int a, int p){
if(p==0) return 1;
int ret = power(a,p/2);
ret = mul(ret,ret);
if(p % 2 == 1) r... | 0 | 55,200,473 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int S,W;
scanf("%d %d",&S,&W);
if(S <= W){
printf("unsafe\n");
}else{
printf("safe... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N ,Y ;
cin >> N >> Y ;
int money = Y;
int sum = N;
int cnt = 0;
for(int i = 0;i <= sum; i++){
for(int j = 0; j <= sum-i; j++){
for(int k = 0; k <= sum-i-j ; k++){
if(i * 10000 + j * 5000 + k * 1000 == money && i + j + k == sum)... | 0 | 42,068,259 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#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 per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 0 | 87,263,777 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
bool a,i,u,e,o;
cin >> c;
a = c == 'a';
i = c == 'i';
u = c == 'u';
e = c == 'e';
o = c == 'o';
if ( a || i || u || e || o ){
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
} | #include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <numeri... | 0 | 29,148,341 |
#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, k, s;
cin >> n >> k >> s;
vector<ll> a(n);
rep(i, n) {
if (i < k)
a[i] = s;
else if (s < 1e9)
a[i] = s + 1;
else
a[i] = 1;... | #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(5e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool ... | 0 | 83,266,367 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int len = (int)s.length();
vector<int >a(len,0);
if(s[0]=='B')a[0]=1;
else a[0]=0;
for(int i=1;i<len;i++){
if(s[i]=='B')a[i]=a[i-1]+1;
else a[i]=a[i-1];
}
long long count=0;
for(int i=0;i<l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(void)
{
ll n, m, ans = 0;
cin >> n >> m;
vector<ll> p(0), a(m), b(m);
for(ll i = 0; i < m; i++) {
cin >> a.at(i) >> b.at(i);
}
for(ll i = 1; i <= n; i++) {
p.push_back(i);
}
do {
if(p.at(... | 0 | 88,160,518 |
#include <iostream>
#include <cmath>
using namespace std;
typedef pair<double, double> P;
void solve()
{
P p[4];
int n;
cin >> n;
while(n--)
{
cin >> p[0].first >> p[0].second >> p[1].first >> p[1].second >> p[2].first >> p[2].second >> p[3].first >> p[3].second;
if(p[0].first == p[1].first && p[2].first == p[... | #include<cstdio>
#include<string.h>
#include<stdlib.h>
int main(){
int s[6];
int t[6];
char h[4] = {'N','S','W','E'};
int a,b,n;
for(int i = 0;i < 6;i++){
scanf("%d",&s[i]);
}
scanf("%d",&n);
for(int i = 0;i < n;i++){
scanf("%d %d",&a,&b);
while(1){
in... | 0 | 60,046,756 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, ll> P;
#define MOD (1000000007ll)
int main(void){
int m,l,r,p[222],ans,mx,i;
cin >> m >> l >> r;
while(m || l || r){
mx = 0;
for(i=0; i<m; ++i){
cin >> p[i];
}
for(i=l; i<=r; ++... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 11,392,346 |
#define _GLIBCXX_DEBUG
#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;
const int INF = 1000000007;
int main(){
string S;
cin >> S;
char c = S[0];
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int palindrome(int x) {
string s = to_string(x);
string t = s;
reverse(t.begin(), t.end());
return s == t;
}
int main() {
int a, b;
cin >> a >> b;
int count = 0;
for (int i = a; i <= b; i++) {
if (palindrome(i)) {
count++;... | 0 | 59,228,988 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
char line[36][2],line2[36][2];
int time;
cin >> time;
for (int i = 0; i < time; ++i) {
cin >> line[i][0] >> line[i][1];
line2[i][0] = line[i][0];
line2[i][1] = line[i][1];
}
for (int i = 0; i < time - 1; ++i) {
for (int i2 = time - 1... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 48,905,067 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
int main(){
string s;
cin>>s;
int left=0, right=s.size()-1;
int cnt=0;
while(right-left>0){
if(s[left]=='x' && s[right]=='x'){
left++; right--;
}else i... | #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...... | 0 | 35,233,960 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N, X;
cin >> N >> X;
vector<int> dist(N, 0);
for (int i = 0; i < N; ++i) {
int x;
cin >> x;
dist[i] = abs(X - x);
}
int ans = dist[0];
for (int i = 1; i < N; ++i) {
ans = __gcd(ans, dist[i]);
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | 0 | 100,879,093 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long x,y;
cin>>x>>y;
long long sum=x;
long long count=0;
while(sum<=y){
sum*=2;
count++;
}
cout<<count<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 15,012,873 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N, M;
cin >> N >> M;
vector<ll> S(N+1, 0);
... | 0 | 49,566,163 |
#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) {
string S, T;
cin >> S >> T;
for (int i = 0; i < S.size(); ++i) {
if (S == ... | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | 0 | 64,926,974 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%.5f\n", sqrt(pow(abs(x2-x1), 2) + pow(abs(y2-y1), 2)));
return 0;
} | #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,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
ll gcd(ll a, ll b) {
if (a % b == 0... | 0 | 70,292,753 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
int cnt = 0;
vector<int> A(N);
vector<int> B(200000,0);
for(int i=0;i<N;i++){
cin >> A.at(i);
B.at(A.at(i)) ++;
if(B.at(A.at(i)) == 1){
cnt ++;
}
}
if(cnt <= K){
cout << 0 << "\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
cin >> a.at(i).at(j);
}
}
vector<int> tate(h, 0);
vector<int> yoko(w, 0);
for (int i=0; i<h; i++) {
for (i... | 0 | 49,226,212 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long long int a[1000000],b[1000000];
long long ans=0,t,small = -1,r;
for(int i=0;i<N;i++)
cin >> a[i] >> b[i];
for(int i=0;i<N;i++){
if( a[i] > b[i] ){
if(small > b[i]||small =... | 0 | 65,355,102 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int k;
int n;
vector<int> a;
void solve() {
vector<int> diff;
diff.push_back(k+*a.begin()-a[n-1]);
for (auto i=a.begin();i!=a.end();i++) {
diff.push_back(*(i+1) - *i);
}
sort(diff.begin(), diff.e... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
int lower = 0, upper = n, mid;
while(upper - lower > 1){
mid = (upper + lower) / 2;
bool flag = true;
map<int, int> string_data;... | 0 | 31,087,459 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string str, order;
int n;
cin >> str >> n;
for (int i = 0; i < n; i++)
{
int a, b;
cin >> order >> a >> b;
if (order == "print")
cout << str.substr(a, b - a + 1) << endl;
else if (order == "rever... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 16,014,076 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb em... | 0 | 55,919,983 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
ll num, sum = 0;
map<ll, ll> divisor;
cin >> num;
ll limit = sqrt(num);
for (int i = 2; i <= sqrt(num); i++)
while(num % i == 0){
num /= i;
divisor[i]++;
}
... | #include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, cla... | 0 | 85,765,890 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repc(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 + ... | #include <iostream>
using namespace std;
int main()
{
int value = 0;
int count = 0;
do
{
if (count > 0)
cout << "Case " << count << ": " << value << endl;
++count;
cin >> value;
} while(value != 0);
return 0;
} | 0 | 80,146,759 |
#include <bits/stdc++.h>
#define INF 1000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
string n;
cin >> n;
for (ll i = 0; i < n.size(); ++i)
{
if (n[i] == '1')
{
cout << '9';
}
else if (n[i] == '9')
{
cout << '1';
}
else
{
... | #include <iostream>
using namespace std;
int main(){
int n, ans=1;
cin >> n;
while(ans<=n){
ans *= 2;
if(ans>n){
ans /= 2;
break;
}
}
cout << ans << endl;
return 0;
} | 0 | 18,943,931 |
#include <iostream>
#include <map>
#include <string>
#include <typeinfo>
using namespace std;
int main(){
int n, l, c, s;
string str, ans;
map<int, string> m;
m[1] = ".,!? ";
m[2] = "abc";
m[3] = "def";
m[4] = "ghi";
m[5] = "jkl";
m[6] = "mno";
m[7] = "pqrs";
m[8] = "tuv";
m[9] = "wxyz";
cin >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main(){
int n; cin >> n;
string s; cin >> s;
bool ok = true;
vector<string> t(4);
t[0] = "SS"; t[1] = "SW"; t[2] = "WS"; t[3] = "WW";
for(int i = 0; i < 4; i++){
for(int j = 2; j < n; j++){
if(t[i][j - 1] == 'S'){
if(s[j - 1] =... | 0 | 82,892,228 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 69,395,329 |
#include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
int main(){
int n,cnt;
int num[10000],i=0;
for(int a=0;a<10;a++)
for(int b=0;b<10;b++)
for(int c=0;c<10;c++)
for(int d=0;d<10;d++){
num[i]=a+b+c+d;
i++;
... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#d... | 0 | 18,367,715 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string O, E;
cin >> O;
cin >> E;
for(int i = 0; i < O.size(); i++) {
cout << O[i];
if(i < E.size()) {
cout << E[i];
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
bool is_zero = false;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] == 0) is_zero = true;
}
if (is_zero) {
cout << 0 << '\n';
return 0;
}
long lon... | 0 | 61,262,416 |
#include <iostream>
using namespace std;
int main(){
char* s = (char*)calloc(4, sizeof(char));
cin >> s;
for(int i = 0; i < 3; i++){
for(int j = i+1; j < 3; j++){
if(s[i] != s[j]) {cout << "Yes" << endl; return 0;}
}
}
cout << "No" << endl;
return 0;
} | #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 | 19,838,094 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
cin >> N >> M;
cout << ((N * (N -1)) / 2) + ((M * (M - 1)) / 2);
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 17,641,935 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int A, B, C;
std::cin >> A >> B >> C;
int g = max<int>({ A * 10 + B + C,A + B * 10 + C,A + B + C * 10 });
cout << g << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 51,875,203 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const ll INF=1e18;
const int MOD=1e9+7;
const double pi=acos(-1);
int main(){
ll s;
cin >> s;
ll x1,y1,x2,y2,x3,y3;
ll M=1000000000;
x1=0,y1=0;
x2=M;
y2=1;
x3=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> P;
const long double EPS = 1e-10;
const long long INF = 1e18;
const int MOD = (int)1e9 + 7;
const long double PI = acos(-1.0L... | 0 | 27,982,583 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string o,e;
cin >> o >> e;
if ( o.size() - e.size() == 0 ){
for ( int i = 0; i < o.size(); i++){
cout << o[i] << e[i];
}
cout << endl;
}else{
for ( int i = 0; i < e.size(); i++){
cout << o[i] << e[i];
}
cout << o[o.si... | #include <stdio.h>
int main(){
char s[1300];
gets(s);
for (char *p=s; *p!='\0'; p++){
if (*p >='a' && *p <= 'z'){
printf("%c", *p-'a'+'A');
} else if (*p >='A' && *p <= 'Z'){
printf("%c", *p-'A'+'a');
} else {
printf("%c", *p);
}
}
... | 0 | 46,911,067 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
ll l=1000000007;
string alphabet="abcdefghijklmnopqrstuvwxyz";
using graph = vector<vector<int>>;
double pi=3.14159265358979;
int main() {
int n,m; cin>>n>>m;
graph v(m)... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
ll findGCD(ll a, ll b){
if(b==0)
return a;
return findGCD(b,a%b);
}
int main()
{
int n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
ll lcm=a[0];
for(int i=1;i<n;i++){
ll b;
b ... | 0 | 73,664,354 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string a, b;
cin >> a >> b;
int la = (int) a.size();
int lb = (int) b.size();
if(la > lb) {
cout << "GREATER";
}
else if(la < lb) {
cout << "LESS";
}
else {
for (int i = 0; i < la; i++) {
if(a[i] > b[i]) {
cout << "... | #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 | 79,888,610 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "YES" : "NO")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 3e2 + 10;
const int SIZ = 1e6 + 10;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll k, a, b;
cin >> k >> a >> b;
if(b - a <= 2){
cout << k + 1;
return 0;
}
else if(a - 1 >= k){
cout << k + 1 << endl;
}else{
ll rest = k - (a - 1);
ll ans = a;
ans += (rest / 2) * (b - a);
if(rest % 2 == 1)ans++;
cout... | 0 | 8,134,023 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,d;
cin>>a>>b>>c>>d;
cout<<max(max(a*c,a*d),max(b*c,b*d))<<"\n";
} | #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... | 0 | 5,506,259 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int b = a[0];
for (int i = 1; i < n-1; i++ ) {
if (abs(a[i] * 2 - a[n-1]) < abs(b * 2 - a[n-1])) {
b... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | 0 | 87,085,080 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 25) return cout << "Christmas" << "\n", 0;
if (N == 24) return cout << "Christmas Eve" << "\n", 0;
if (N == 23) return cout << "Christmas Eve Eve" << "\n", 0;
if (N == 22) return cout << "Christmas Eve Eve Eve" << "\n", 0;
... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int year(int n){
int res = 0;
n++;
for(; n<1000; n++){
if(n%3 != 0) res++;
}
return res;
}
int month(int y, int m){
int res = 0;
if(y%3 == 0) return 0;
for(; m<=10 ;m++)
if(m%2 == 0) res++;
r... | 0 | 56,230,768 |
#include <iostream>
#include <cstdlib>
#include <vector>
#include <string>
class Dice {
private:
std::vector<int> number;
std::vector<int> initialize();
std::string order_list;
void decide_order();
void decide_slide();
int times;
int top;
int front;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define P pair<int,int>
#define vp vector<P>
#define PP pair<P,int>
#define vpp vector<PP>
#define fi first
#define se second
#define INF (1<<30)
#define MOD 10... | 0 | 12,516,472 |
#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;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if (a<... | 0 | 9,235,496 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
char s[200005];
int n,cnt[26];
ll ans=0;
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++)cnt[s[i]-'a']++;
ans=1;
for(int i=0;i<26;i++)for(int j=i+1;j<26;j++)ans+=1ll*cnt[i]*cnt[j];
printf("%lld\n",a... | #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 gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long int
#define s(x) cin>>x... | 0 | 83,432,187 |
#include<bits/stdc++.h>
#define endl "\n"
#define M_PI 3.14159265358979323846
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define fix_prec cout.setf( std::ios::fixed, std:: ios::floatfield ); cout.precision(9);
#define vi vector<int>
#define vvi vector<vector<int... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h, w;
while(true){
cin >> h >> w;
if(h == 0 && w == 0)
break;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cout << '#';
}
cout << '\n';
}
... | 0 | 11,353,684 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int N;
cin >> N;
vector<string> S;
vector<int> T;
int total_t = 0;
for (int i = 0; i < N; i++) {
string s;
int t;
cin >> s >> t;
S.push_back(s);
T.push_back(t);
tot... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> dp(n+1);
dp.at(0)=0;
for(int i=1; i<n+1; i++){
dp.at(i) = dp.at(i-1)+1;
int k=6;
while(k<=i){
dp.at(i) = min(dp.at(i),dp.at(i-k)+1);
k*=6;
... | 0 | 26,457,964 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<string>> S(H, vector<string>(W));
for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) cin >> S[i][j];
char ans1 = 'A';
int ans2 = 1;
for (int i = 0; i < H; i++) {
for (i... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 50,380,048 |
#include<bits/stdc++.h>
using namespace std;
signed main() {
int n, k;
string s;
cin >> n >> s >> k;
char c = s[k - 1];
for (int i = 0; i < n; ++i) if (s[i] != c) s[i] = '*';
cout << s << endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 54,089,742 |
#include <bits/stdc++.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repf(i, a, b) for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int > > vii;
typedef vector<ll> vll;
type... | 0 | 91,688,730 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
ll f(... | #include<bits/stdc++.h>
using namespace std;
int a, b, c, x;
int gen(int x){
return (a * x + b) % c;
}
int main(){
int n;
while(cin >> n >> a >> b >> c >> x, n || a || b || c || x){
int cnt = 0;
int y;
bool ok = true;
for(int i = 0; i < n; i++){
cin >> y;
if(i > 0){
x = gen(x);... | 0 | 37,855,289 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <math.h>
using namespace std;
int N,K;
int main(){
cin >> N >> K;
double an=0;
for(int i=1;i<=N;i++){
int count = 0;
int j =i;
while(j<K){
j *= 2;
count++;
}
... | #include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
#define clr(x) memset(x,0,sizeof (x))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define Fod(i,b,a) for (int i=(b);i>=(a);i--)
#define fi first
#define se second
#define kill _z_kill
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define out... | 0 | 86,128,038 |
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define pi 3.141592653589... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 14,049,934 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
int aa, bb;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n ; i++){cin >> aa;x = max(x, aa);}
for (int i = 0; i < m ; i++){cin >> bb;y = min(y, bb);}
if (y <= x){cout << "War" << ... | #include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<... | 0 | 56,198,809 |
#include<iostream>
using namespace std;
int main() {
int N, M; cin >> N >> M;
int A[N];
double sum = 0;
int popular_product = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; i++) {
if (sum / 4 / M <= A[i]) {
popular_prod... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | 0 | 59,329,814 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define REPS(i,n) for (ll i = 1; i<=(ll)(n); i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_bac... | #pragma GCC optimize ("Ofast")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i,j,n) for (int i=(int)(j);i<(n);i++)
#define REP(i,n) for (int ... | 0 | 47,251,054 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int Ans=0;
int h;
for(int i=0;i<N;i++){
cin >> h;
if(h >= K) Ans++;
}
cout << Ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N; cin >> N;
vector<ll> a(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<ll> o;
vector<ll> e;
for (int i = 0; i < N; ++i) {
... | 0 | 37,800,162 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int N; cin >> N;
for (int i = 0; 4 * i <= N; ++i) {
if ((N - 4*i) % 7 == 0) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
vector<vector<ll>> G(n);
rep(i,m){
ll a,b;
cin >> a >> b;
a--;
b--;
G.at(a).push_back(b);
G.at(b).push_back(a);
}
queue<ll> que;
... | 0 | 59,721,822 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>a(N);
for(int i=0; i<N; i++)cin >> a.at(i);
int count = 1;
int ans = 0;
for(int i=0; i<N; i++){
if(a.at(i)==count)count++;
else ans ++;
}
if(ans==N)ans=-1;
cout << ans << endl;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <bitset>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define mod 1000000007
#define i... | 0 | 86,001,234 |
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int n, m, d, p, res, cnt[11];
while (cin >> n >> m, n | m) {
res = 0;
for (int i = 0; i < 11; ++i)
cnt[i] = 0;
for (int i = 0; i < n; ++i) {
cin >> d >> p;
cnt[p] += d;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
vector<pair<ll, ll>> v;
int main(){
ll h,w;
int n;
cin>>h>>w>>n;
for(int i=0;i<n;i++){
ll x,y; cin>>x>>y;
for(int i=-2;i<=0;i++){
for(int j=-2;j<=0;j++){
if(1<=x+i&&x+... | 0 | 17,834,218 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "O3"
#define rep(i,a,n) for(int i=a; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const ll powll = 1LL<<1;
int main(void){
int n; cin >> n;
ll ans = 1;
rep(i,0,n){
ll t; ... | #include<bits/stdc++.h>
#define ll long long int
#define vll vector<pair<ll, ll> >
#define vl vector<ll>
#define vi vector<int>
#define vii vector<pair<int, int> >
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
using namespace std;
ll power_mod(ll x, ll y, ll p)
{
ll ans = 1;
x = x%p;
if(x==0)
return p;
while(y... | 0 | 35,748,053 |
#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;
}
using ll = long long;
#define AL... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[100005];
signed main() {
int N;
cin >> N;
vector<int>D(N);
for(int i = 0; i < N; i++) {
cin >> D[i];
... | 0 | 77,093,357 |
#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | 0 | 35,314,060 |
#include<bits/stdc++.h>
using namespace std;
long long moder = 1000000007;
long long total_zero[61];
long long total_one[61];
long long unit = 1;
long long counter[61];
int main(){
int n;
cin>>n;
vector<long long>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
for(int i=0; i<n; i++){
for(long long j=0; j<=60; j++){... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
vector<long long int> sa(n+1);
for(int i=0; i<n; i++){
sa[i+1] = sa[i] + a[i];
}
map<long long int, long long int> count;
... | 0 | 57,374,646 |
#include <iostream>
#include <stack>
using namespace std;
int main(){
int n;
stack <int> inp;
while(std::cin >> n){
if(n != 0){
inp.push(n);
} else {
std::cout << inp.top() << std::endl;
inp.pop();
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1001002003004005006ll;
ll dp[305][305];
int main() {
int N, K;
cin >> N >> K;
int m ... | 0 | 41,471,397 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main() {
ll K,S; cin>>K>>S;
ll cnt=0;
for(ll i=K; i>=0; i--)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall... | 0 | 24,809,588 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int i, c=1, next, n;
cin >> n;
vector<int> d(n+1);
for (i=1; i<=n; i++) {
cin >> d[i];
}
next = d[1];
while(next != 2) {
next = d[next];
c++;
if (c == n) {
c = -1;
... | 0 | 71,794,149 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < m; i++){
cin >> a[i];
}
int s = 0;
for(int i = 0; i < m;i++)
s += a[i];
if (s > n)
{
cout << "-1" << endl;
}
else... | 0 | 94,251,685 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | #include<bits/stdc++.h>
using ll = long long;
const ll INF = 1000000000000;
#define fir first
#define sec second
class Union_Find{
private:
std::vector<long long> data;
public:
Union_Find(int n){
data.resize(n,-1);
}
int root(int i){
if(data[i] < 0)return i;
else return data[i] ... | 0 | 53,764,504 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int t[++N], x[N], y[N];
t[0] = 0;
x[0] = 0;
y[0] = 0;
for (int i = 1; i < N; i++) {
cin >> t[i] >> x[i] >> y[i];
}
for (int i = 1; i < N; i++) {
if (t[i]-t[i-1] < abs(x[i]-x[i-1])+abs(y[i]-y[i-1]) || (t[i]-t[i-1]-abs(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fac[i-1... | 0 | 33,770,294 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
map<ll,ll>mp;
int main ()
{
ll n;
string a,b="";
cin>>n;
cin>>a;
for(int i=0;i<a.size();i++)
{
if(a[i]!=b[b.size()-1])
b+=a[i];
}
cout<<b.size()<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ms(a, x... | 0 | 14,555,867 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int N; cin >> N;
int P; cin >> P;
vector<int> A(N);
rep(i, N) cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,x); REP(i,sizeof(a)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (... | 0 | 77,514,541 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define rep_start(a,i,n) for(ll i=a;i<=n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define rev1(i,n) for(ll i=n;i>0;i-... | 0 | 57,123,685 |
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define clr(a) memset(a, 0x00, sizeof(a))
#define Error(x) cout << #x << " = " << x << endl
#define iDEBUG freopen("in.txt", "r", stdin)
#define oDEBUG freopen("out.txt","w",stdout)
#define pb push_back
#define pp pop_back
#define x first
#defi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <map>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<int, int>;... | 0 | 71,428,062 |
#include <stdio.h>
int main(){
int n, m;
scanf("%d %d", &n, &m);
int counter = 0;
for(int i = 0; i<n; i++){
for(int j = i+1; j<n; j++){
counter++;
}
}
for(int i = 0; i<m; i++){
for(int j = i+1; j<m; j++){
counter++;
}
}
printf("%d\n", counter);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct point{
double x, y;
};
const double rot = M_PI / 3.0;
void koch(int n, point a, point b){
if(n == 0) return;
point s, t, u;
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0;
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0;
t.x = (1.0 * a.x + 2.0 * b.x) / 3.0;
... | 0 | 7,581,036 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x; cin >> x;
int kosuu = x/100;
int hasuu = x % 100;
if(hasuu > 5 * kosuu)
cout << 0;
else
cout << 1;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
int man(int x1, int x2, int y1, int y2) {
return abs(x1-x2)+abs(y1-y2);
}
void solve() {
int n, m;
cin >> n >> m;
vector<pair<int,int>> a(n), b(m);
for(int i=0; i<n; ++i) cin >... | 0 | 24,479,309 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
string s,ans;
int c,p,n;
c=0;
cin>>s;
n=s.size();
ans="AC";
if(s.at(0)!='A')
ans="WA";
else
{
s.at(0)='a';
for(int i=2;i<n-1;i++)
{
if(s.at(i)=='C')
{
c++;
p=i;
}
}
if(c!=1)
ans="... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#def... | 0 | 69,480,408 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int keta = 0;
int ntmp = N;
while (0 != ntmp) {
++keta;
ntmp /= 10;
}
map<int, int>mp;
mp[1] = 0;
mp[2] = 9;
mp[3] = 9;
mp[4] = 909;
mp[5] = 909;
mp[6] = 90909;
ans += mp[keta];
if (1 == keta%2) {
ans += N - ... | #include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef pair<int,int> P;
const int INF=1000000;
int H,W,N,d[1000][1000],ans=0;
int dx[]={-1,0,0,1};
int dy[]={0,-1,1,0};
char m[1000][1000];
pair<int,int> f[11];
int bfs(int sx,int sy,int gx,int gy){
for(int i=0;i<H;i++)
for(int j=0;j<W;j++)d[j... | 0 | 80,306,069 |
#include <iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << setprecision(5) << sqrt(pow(x1-x2,2)+pow(y1-y2,2)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
ll n;
cin>>n;
vector<ll> p(n);
rep(i,n)cin>>p[i];
rep(i,n)p[i]--;
vector<ll> idx(n);
rep(i,n) idx[p[i]]=i;
ll ans=0;
set<int>s;
... | 0 | 31,069,424 |
#include <bits/stdc++.h>
using namespace std;
int main () {
string str;
int result;
cin >> str;
if (str[0] == 'R') {
result = 1;
} else {
result = 0;
}
if (str[1] == 'R') {
if (str[2] == 'R') {
result += 2;
} else {
result += 1;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
int ans[N][N];
int main() {
int A, B;
scanf("%d %d", &A, &B);
printf("100 100\n");
for (int i = 51; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
ans[i][j] = 1;
}
}
A--;
B--;
for (int i = 1; ... | 0 | 57,443,338 |
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#define req(i,n) for(i=0; i<(n); i++)
using namespace std;
int main()
{
int i,n,m,tmp,max=0;
map<string,int> count;
string str;
cin >> n;
req(i,n){
cin >> str;
count[str]++;
}
cin >> m;
req(i,m){
cin >> str;
count[str]--;
}
for(auto... | #include <stdio.h>
#define MAXLEN 10000
int main()
{
int x[MAXLEN] = {0};
int i = 0;
while(i < MAXLEN)
{
scanf("%d",x+i);
if(x[i] == 0) break;
i++;
}
int length = i;
for(i = 0;i < length; i++)
{
printf("Case %d: %d\n",i+1,x[i]);
}
return 0;
} | 0 | 47,404,459 |
#include<bits/stdc++.h>
using namespace std;
const long P=1000000007;
int main(){
long N;cin>>N;string S;cin>>S;
vector<long>A(26,1);
for(char c:S)A[c-97]++;
long ans=1;
for(long x:A)ans=(ans*x)%P;
cout<<(ans-1+P)%P;
} | #include <cstdio>
int main()
{
int n, m, d, p, r[11];
while(true)
{
scanf("%d", &n);
scanf("%d", &m);
if(n == 0 && m == 0) { break; }
for(int i = 0; i < 11; i++)
{
r[i] = 0;
}
for(int i = 0; i < n; i++)
{
scanf("%d", &d)... | 0 | 90,162,247 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define int long long
#define dip(type,var) type var; cin>>var;
#define dipi(x) int x; cin>>x;
#define w(x) int x; cin>>x; while(x--)
#define mka(... | #include <bits/stdc++.h>
#include <set>
using namespace std;
#define fasterIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define Im int main()
#define ll long long
#define sc scanf
#define pf printf
#define rn0 return 0
#define rn return
#define ... | 0 | 97,385,380 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.