code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
vector<bool>dp(n+1, false);
dp[0] = true;
for(int i = 100; i <= 105; i++)
{
for(int j = 0; j + i <= n; j++)
{
if(dp[j]) dp[j+i] = true;
}
}
if(dp[n]) cout << ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(a) (a).size()
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define forn(i, n) for (int i = 1; i <= n; i++)
#define ford(i, n) for (int i = n; i >= 0; i--)
#define REP(i... | 0 | 60,492,322 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#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 SORT(s) sort((s).begin(),(s).... | #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 | 85,172,905 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, x4, y4;
int n;
cin >> n;
for(int p=0; p < n; p++){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
x1 -= x2; y1 -= y2; x3 -= x4; y3 -= y4;
cout << (abs(x1*y3-y1*x3) < 1e-10?"... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LC... | 0 | 16,427,647 |
#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>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 23,779,497 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,v;
string z,w="Yes";
cin>>x>>y>>z;
for(v=0;v<x+y+1;v++){
if(v==x&&z.at(v)!='-'){w="No";break;}
else if(v!=x&&z.at(v)=='-'){w="No";break;}
}
cout<<w<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main(){
ll n,m;cin >>n>>m;
vector<ll>co(n,0);
for (int i = 0; i < m; ++i) {
l... | 0 | 22,493,812 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using gt... | #include<bits/stdc++.h>
using namespace std;
int maps[17][17];
int cnt(int x,int y);
int main(){
while(1){
int a,b,n,x,y;
cin >> a >> b;
if(a == 0 && b== 0)break;
for(int i=0;i<17;i++){
for(int j=0;j<17;j++){
maps[i][j] = 0;
}
}
cin >> n;
for(int i=0;i<n;i++){
cin >> x >... | 0 | 30,365,940 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using ll=long long;
const int MOD=998244353;
int main(){
ll n,m;
cin>>n>>m;
cout<<abs((n-2)*(m-2))<<endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#define MAX 5000000
#define INFTY (1<<30)
int n, H[MAX];
void maxHeapify(int i) {
int l, r, largest;
l = 2 * i;
r = 2 * i + 1;
if ( l <= n && H[l] > H[i]) largest = l;
else largest = i;
if ( r <= n && H[r] > H[largest]... | 0 | 86,646,821 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ar array
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+100;
vector<int>ve[N];
int ans[N];
int vis[N];
queue<int>q;
void bfs()
{
q.push(1);
vis[1]=1;
while(q.size()){
int k=q.front();q.pop();
for(auto v:ve[k]){
if(!vis[v]){
ans[v]+=ans[k... | 0 | 64,258,549 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x1,x2,y1,y2;cin>>x1>>y1>>x2>>y2;
int tmp_x,tmp_y;
tmp_x=x2-x1;
tmp_y=y2-y1;
cout <<x2-tmp_y<<' '<<y2+tmp_x<<' ';
cout <<x1-tmp_y<<' '<<y1+tmp_x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 1;
int i;
while (cin >> i,i)
{
cout << "Case " << n << ": " << i<< "\n";
n++;
}
return 0;
} | 0 | 51,659,549 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
stack<char> St;
int frontnum = 0;
for(int i = 0; i < n; i++){
if(s[i] == '('){
St.push(s[i]);
}else if(!St.empty()){
St.pop();
... | #include<iostream>
using namespace std;
long long extGCD(long long a, long long b, long long *px, long long *py){
if(b == 0){
*px = 1;
*py = 0;
return a;
}
long long d = extGCD(b, a%b, py, px);
*py -= a/b * (*px);
return d;
}
int main(){
long long N;
cin >> N;
lon... | 0 | 11,147,397 |
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(... | #include<string>
#include<iostream>
#include<vector>
using namespace std;
int main() {
int most_views = 0,views=0,most_long=0,len=0;
char tmp_sentence[1000];
string sentence,mo_ma_word,longest_word,word="";
vector<string> words;
cin.getline(tmp_sentence, sizeof(tmp_sentence));
sentence = tmp_sentence;
for (int i... | 0 | 15,413,660 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
int main(){
int n,d;
cin>>n>>d;
vector<vector<i... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 85,821,624 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long int ll;
struct edge{ int to,cost; };
#define M (1e12+1)
int main(void){
ll v,e;
cin>>v>>e;
vector<vector<edge> > g(v);
vector<vector<ll> > ans(v,vector<ll>(v,M));
for(int i=0;i<v;i++){
ans[i][i]=0;
}
ll s,t... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | 0 | 3,477,481 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
#define REP(i, a,b) for(i=a;i<b;i++)
#define output(x) cout<<x<<endl;
typedef long long int ll;
int main()
{
ll i, j, k, l, m, sum, flag,ans,W,H,N;
sum = 0;
flag = 0;
cin >> N;
vector<ll>A(N);
REP(i, ... | #include <cstdio>
#define swap(a,b) {a^=b;b^=a;a^=b;}
int main() {
int a1,a2,a3;
while(~scanf("%d%d%d", &a1, &a2, &a3)) {
if (a1 > a2) {
swap(a1,a2);
}
if (a1 > a3) {
swap(a1,a3);
}
if (a2 > a3) {
swap(a2,a3)
}
printf("%... | 0 | 39,319,409 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, x, y, z, ans=0;
cin>>N;
if(N%2==1) {
cout<<ans<<endl;
}
else {
x=N/2;
vector<int> n(N);
for(int i=0; i<N; i++){
cin>>n.at(i);
}
sort(n.begin(), n.end());
y = n.at(x-1);
z = n.at(x);
if(y==z) cout<<ans<<endl;
else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
int x = 0, y = 1;
vector<vector<int>> v(h, vector<int>(w));
for (int i = 0; i < h; ++i) {
if (i == b)
swap(x, y);
for (int j = 0; j < w; ++j) {
if (j < a)
v[i][j] = x;
else
... | 0 | 92,626,965 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | #include<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
int main()
{
std::string str;
char alph[26]={0};
int x;
while (std::getline(cin, str))
{
for (int i = 0; i < str.size(); i++)
{
if (isalpha(str[i]))
{
if (isupper(str[i])... | 0 | 98,850,761 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main() {
int n;
string s;
int k;
cin >> n >> s >> k;
char k_s = s[k-1];
rep(i,s.size()){
if(s[i]!=k_s)
s[i] = '*';
}
cout << s << endl;
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 0 | 62,200,902 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int , int > P;
P data[101];
int in;
int main(void)
{
for(int i = 0; i <= 100; i++)
data[i].second = i;
while(cin >> in, !cin.eof()){
data[in].first++;
}
sort(data,data+101);
int def = data[100].first;
for(int i = 0; i <= 100; i++)
if... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cmath>
#include<string>
#include<stdlib.h>
using namespace std;
#define ll long long int
#define ld long double
#define reps(i,f,n) for(int i=f;i<n;i++)
#define rep(i,n) reps(i,0,n)
#define m1 cout<<"move1"<<endl
#define m2 cout<<"move2"<... | 0 | 9,966,198 |
#include <iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main() {
double a,b,c,pi=3.1415926535897932;
cin>>a>>b>>c;
cout<<fixed<<setprecision(5)<<a*b*sin(c*pi/180.0)/2<<endl<<a+b+sqrt(a*a+b*b-2.0*a*b*cos(c*pi/180.0))<<endl<<b*sin(c*pi/180.0)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin >> N >> M;
string A[N];
string B[M];
for(int i = 0; i < N;i++)cin >> A[i];
for(int i = 0; i < M;i++)cin >> B[i];
bool flag;
for(int i = 0; i <= N - M;i++){
for(int j = 0; j <= N - M;j++){
flag ... | 0 | 17,735,242 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
vector<string> vstr;
string str;
vector<int> vint;
vector<vector<int> > vvint;
int i, j, m, h, n = 0;
while(1) {
cin >> str;
if(str == "-") break;
++n;
vstr.push_back(str);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... | 0 | 67,701,027 |
/*http:
#include <list>
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int n;
list<int> data;
string command;
int value;
list<int>::iterator it;
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
for(int i=0;i<n;i++){
cin>>command;
if(command=... | #include <stdio.h>
int main (void){
int x1=0, x2 = 0, x3 = 0, input, s;
for(s=0; s<10; s++){
scanf("%d\n" ,&input);
if(x1 < input){
x3 = x2;
x2 = x1;
x1 = input;
}else{
if(x2 < input){
x3 = x2;
x2 = input;
... | 0 | 89,008,694 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <set>
#include <deque>
using namespace std;
typedef long long LL;
const int inf = 1 << 30;
const LL INF = 1LL << 60;
const int MaxN = 100000;
int n;
int ans[505][505];
int main()
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, k;
cin >> n >> k;
vector<int> pref(n+1);
for (int i = 1; i <= n; i++) {
pref[i] = pref[i-1] + i;
pref[i] %= MOD;
}
long long ans = ... | 0 | 30,461,994 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll h, w, d; cin >> h >> w >> d;
vector <pair <ll, ll>> v(h*w, pair <ll, ll> ());
rep(i, h) {
rep(j, w) {
ll a; cin >> a;
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <queue>
#include <iomanip>
#include <iterator>
#define MOD 1000000007
#define INF 1000000001
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
... | 0 | 51,903,810 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int c(int x)
{
int m = 0, t = 0, ret = 0;
while(m <= x)
{
ret++;
t++;
m+=t;
}
return ret-1;
}
void solve()
{
ll n;
cin >> n;
ll ogn = n;
ll cnt = 0, twos = 0;
while(n%2==0)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 0 | 47,160,424 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll n;
cin>>n;
map<ll,ll> m;
for(int i=0;i<n;i++){
ll a;
cin>>a;
m[a]++;
}
ll ans=0;
for(... | #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 | 49,168,339 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
int N;
long long L, T;
while(cin >> N >> L >> T){
L *= 2;
T *= 2;
vector<pair<long long, int>> X(N);
for(auto& p : X){
cin >> p.first >> p.second;
p.first *=... | #include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define moca(a, s, b) a=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<cla... | 0 | 53,465,786 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REV(c) reverse((c).begin(),(c).end())
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
return b != 0 ? gcd(b, a % b) : a;
}
int64_t lcm(int64_t a, int64_t ... | 0 | 63,155,118 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
}
int a=1;
int b=vec.at(0);
while(a<N){
if(b==2) break;
else{
b=vec.at(b-1);
a++;
}
}
if(a==N) cout << -1;
else cout << a;
} | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;cin>>s;
int so = 0;
if(s == 4||s==2||s==1){
cout<<"4";
return 0;
}
for(int i = 1;;i++){
if(s%2 == 0) s=s/2;
else ... | 0 | 68,092,147 |
#include<stdio.h>
#include<string.h>
int main(){
int k, l;
char str[105];
scanf("%d%s", &k, str);
l = strlen(str);
for (int i=0 ; i<k ; i++){
if (str[i]=='\0'){
break;
}
printf("%c", str[i]);
}
if (l>k){
printf("...");
}
puts("");
retur... | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
set<ll> ans;
ll max_v = 3234566667;
int rec(vector<ll> &n) {
int ei = -1;
rep(i,0,10) {
if (n[i] == -1) {ei = i; break;}
}
ll k = 1;
ll l = 0;
rep(i,0,10) {
i... | 0 | 39,641,376 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string S, Ans;
cin >> S;
int N = S.size();
for (int i = 0; i < N; i++){
if (S[i] == 'B'){
if (i != 0){
for (int j = i; j >= 0; j--){
if (S[j] != 'B' && ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | 0 | 94,231,087 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define all(obj) (obj).begin(),(obj).end()
#define dump(x) cout << #x << " = " << (x) << endl;
typedef long long lint;
using namespace std;
int main(){
float t,x;
cin>... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 0 | 6,383,605 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define all(s) s.begin(),s.end()
#define pb push_back
#define uno unordered_map
#define pi 3.1415926536
#define dig(a) fixed<<setprecision(a)
#define foreach(var,i) for(auto i = var.begin();i!=var.end();i++)
#define fast() ios_base::s... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct WordCount{
string word;
int count;
};
void PushWordCount(const vector<string>, vector<WordCount>&);
vector<string> split(string);
bool space(char);
bool not_space(char);
int main(){
int max=0, longest=0;
string ... | 0 | 69,905,804 |
#include <iostream>
using namespace std;
int main() {
int n;
while(cin >> n, n) {
int count = 0;
for(int i = 0; i < n / 2; ++i) {
string op1, op2;
cin >> op1 >> op2;
if((op1 == "lu" && op2 == "ru") || (op1 == "ru" && op2 == "lu") || (op1 == "ld" && op2 == "rd") || (op1 == "rd" && op2 == "l... | #include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define MSET(x,y) memset(x,y,sizeof(x))
#define M 100005
#define MOD 1000000007
using namespace std;
int n,k,a[105],dp[105][M];
int pre[M];
int mod(int x) { x %= MOD; if (x<0) x += MOD; return x; }
int main()
{
scanf("%d %d", &n, &k);
REP(i,1,n) s... | 0 | 1,364,270 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main()
{
string s1,s2,tmp,ans;
int n,m;
while(1){
s1.clear();s2.clear();ans.clear();
cin>>n; if(n==0) return 0;
for(int i=0;i<n;i++){
cin>>tmp; s1+=tmp;
cin>>tmp... | #include <iostream>
using namespace std;
int main(void){
int A, B, C;
cin >> A >> B >> C;
for(int x=0; x<=B; x++){
for(int y=0; y<=A; y++){
if(A*x == B*y+C){
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | 0 | 61,630,329 |
#include<iostream>
#define ll long long
#define endl "\n"
using namespace std;
bool check(int n)
{
int r;
while(n>0)
{
r=n%10;
if(r==7)
{
return true;
}
n=n/10;
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).size(... | 0 | 2,988,613 |
#include <iostream>
#include <cstdlib>
#include <algorithm>
int main() {
long long int a, b, c, d;
long long int m1, m2, m3, m4;
std::cin >> a >> b >> c >> d;
m1 = a*c;
m2 = a*d;
m3 = b*c;
m4 = b*d;
std::cout << std::max({m1, m2, m3, m4}) << "\n";
return 0;
} | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) ... | 0 | 4,580,755 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LIM = 1e9;
ll s;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> s;
string ss = to_string(s);
int n = ss.length();
if (n == 19) {
cout << "0 0 1000000000 1 0 1000000000";
return 0;
}
ll si =... | #include<bits/stdc++.h>
#include<atcoder/all>
#define prArr(Arr,n) for(int _=0;_<n;_++) cout<<(Arr)[_]<<" ";
using namespace std;
using namespace atcoder;
const int INF=(int)0x3f3f3f3f;
const int MOD=(int)1e9+7;
const double eps=1e-9;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ... | 0 | 63,051,806 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
... | 0 | 5,717,242 |
#include <iostream>
using namespace std;
int main()
{
int R;
cin >> R;
if (R < 1200)
{
printf("ABC");
}
else if (R >= 1200 && R < 2800)
{
printf("ARC");
}
else
{
printf("AGC");
}
} | #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;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#define int long long
typedef long long ll;
typedef long double ld;
typedef pa... | 0 | 90,013,268 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | #include <vector>
#include <iostream>
#include <functional>
using namespace std;
struct edge {
int to, cost;
};
int main() {
int N, M;
cin >> N >> M;
vector<vector<edge> > G(N);
for (int i = 0; i < M; ++i) {
int L, R, D;
cin >> L >> R >> D; --L, --R;
G[L].push_back(edge{ R, D });
G[R].push_back(edge{ L, -D... | 0 | 4,246,607 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n; cin >> n;
int node[n+1];
for(int i=1; i<=n; ++i){
cin >> node[i];
}
for(int i=1; i<=n; ++i){
cout << "node " << i << ": key = " << node[i] << ", ";
int x = floor(i/2);
if (i != 1) cout << "pa... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
const ll mod = 1000000007;
const ll INF = 9223372036854775807;
#define Sort(a) sort(a.begin(), a.end())
#define Bsort(a) sort(a.begin(), a.end(), greater<ll>())
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync... | 0 | 29,463,031 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 8,039,105 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | 0 | 53,840,131 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int c[20];
int lp[50005] = {};
int solve(int x){
if(lp[x] != 0)
return lp[x];
int t = INT_MAX;
for(int i = 0; i < m; i++)
if(x > c[i])
t = min(t, solve(x - c[i]) + 1);
lp[x] = t;
return t;
}
int main(){
cin >> n >> m;
for(int i = 0; i <... | #include <iostream>
#include <bits/stdc++.h>
#define mod 1000000007
#define point complex<long long>
#define pi acos(-1)
#define pb push_back
typedef long long ll;
using namespace std;
void Fastio(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long adotb(point a, point b){
return (conj(a)*b... | 0 | 97,928,768 |
#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 a,b,c;
cin >> a >> b >>c;
bool can = false;
for(int i=1;i<=b;++i){
if((i*a)%b==c){
can = true;
}
}
if(can) cout<<"YE... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 10,667,630 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define PB push_back
#define PII pair <long long , long long>
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int MAXN = 2e5 + 10 , INF = 1e9;
int main() {
int n;
cin >> n;
int l = 1 , ... | 0 | 55,416,654 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
double x, ff = 0;
for (int i = 1; i <= N; i++) {
x = 1.0;
for (int v = i; v < K; v *= 2) {
x /= double(2.0);
}
ff +=... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int dp[1001][1001];
int ma... | 0 | 37,859,295 |
#include <iostream>
#include <algorithm>
using namespace std;
#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))
int n;
int a[100001];
int main(){
cin.tie(0);
cin>>n;
rep(i, n)cin>>a[i];
sort(a, a+n);
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | 0 | 53,841,960 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=998244353;
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
int main(void){
string s,t,u;
int a,b;
cin>>s>>t>>a>>b>>u;
if(s==u) a--;
el... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ff first
#define ss second
#define MP make_pair
#define mset(x,a) memset(x,a,sizeof(x))
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define sqr(a) (a)*(a)
#define all(x) (x).begin(), (x).e... | 0 | 58,815,439 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
char buf[1024] = { '\0' };
while (fgets(buf, sizeof(buf), stdin) != NULL) {
if (buf[0] == '0') { break; }
int sum = 0;
for (char* p = buf; isdigit(*p); ++p) {
sum += (*p - '0');
}
fprintf(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | 0 | 945,114 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans=max(a*c,max(a*d,max(b*c... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | 0 | 80,332,957 |
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>
using namespace std;
int main(int argc, const char* argv[])
{
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; ++i)
{
cin >> a[i];
}
uint64_t minCost = numeric_limits<uint64_t>::max();
fo... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 500000000
#define IOS ios_base::sync_with_stdio(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) cout<<a[0];for... | 0 | 17,364,532 |
#include <stdio.h>
#include <string.h>
int main(){
int n;
scanf("%d", &n);
char c[n+1];
int flag=1;
scanf("%s", c);
if(n%2==1){
puts("No");
return 0;
}else{
for(int i=0; i<n/2;i++){
if(c[i] != c[i+n/2]){
flag=0;
}
}
}
if(flag){
puts("Yes");
}else{
puts("No");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>prime(1000005,0);
bool mark[1000005];
int nprime;
void sieve(int n)
{
int limit=sqrt(n*1.0)+1,s=0;nprime=0;
mark[1]=true;
mark[2]=false;
prime[nprime++]=2;
for(int i=3;i<=n;i+=2){
if(!mark[i]){prime[nprime++]=i;
... | 0 | 94,538,908 |
#include<bits/stdc++.h>
using namespace std;
vector<int>g[100005];
int n;
inline int dfs(int x, int fa)
{
int l1=g[x].size();
int res=0;
for(int i=0;i<l1;i++)
{
int v=g[x][i];
if(v!=fa)
res+=dfs(v,x);
}
if(res>=2)
{
printf("First\n");
exit(0);
}
... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
queue<char> que;
que.push(s[0]);
int res = 0;
for (int i = 1; i < s.size(); i++)
{
if(que.empty()) que.push(s[i]);
else if(s[i] == que.back()) que.push(s[i]);
else {
res += 2;
que.pop();
}
}
cout << res << endl;
return ... | 0 | 46,587,615 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
type... | #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 | 16,868,519 |
#include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cc... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 0 | 42,908,441 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ll N, x;
cin >> N;
set<ll>s;
for (int i = 0; i < N; i++) {
cin >> x;
s.insert(x);
}
if (s.size() % 2 == 0) {
cout << s.size() - 1 << endl;
} else {
cout... | 0 | 23,006,562 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include<bits/stdc++.h>
using namespace std;
const int MAX = 100005;
const int WHITE = 0;
const int BLACK = 1;
vector<pair<int, int>> V[MAX];
int color[MAX], d[MAX], N;
void dfs_visit(int u, bool& flg) {
color[u] = BLACK;
for (int i = 0; i < V[u].size(); i++) {
int v, w;
v = V[u][i].first;
... | 0 | 44,373,931 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n;
vector<int> vec[100005];
int visited[100005];
long long int ans[100005][2];
void dfs(int u){
visited[u] = 1;
long long int pro1 = 1, pro2 = 1;
for(int v:vec[u]){
if(!visited[v]){
dfs(v);
... | 0 | 24,606,294 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 100,270,400 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
long ansiter = -1, ans = 0;
void solve(int depth, long pre, long k, long *flag, int flag0){
if(depth==10){
if(ansiter<k)ansiter++;
if(ansiter==k){
rep(i,10){
ans += flag[9-i]*pow(10,i);
... | 0 | 47,100,755 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define PI 3.14159265358979323846264338327950288
using namespace std ;
using bigint = long long int ;
using v... | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
using namespace std;
const long long INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
typedef long long ll;
vector<long long> divisor(long long n) {
vector<long lon... | 0 | 91,097,733 |
#include <iostream>
using namespace std;
int main()
{
char x,y;
cin >> x >> y;
if((int)x < (int)y){
cout << " < ";
} else if((int)x > (int)y){
cout << " > ";
} else {
cout << " = ";
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
t... | 0 | 30,177,528 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a,b,c,d;
cin>>a>>b>>c>>d;
int first=max(a*c,a*d);
int second=max(b*c,b*d);
int res=max(first,second);
cout<<res;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
ll m... | 0 | 19,681,911 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include... | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<cassert>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<bitset>
#include<unordered_map>
using namespace std;
typedef long long l... | 0 | 49,547,414 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define x first
#define y second
#define pi pair <int, int>
#define vi vector <int>
#define L nod<<1
#define R ((nod<<1)|1)
#define int ... | #include <bits/stdc++.h>
using namespace std;
multiset<int> ms;
bool del(int x){
auto it = ms.find(x);
if (it == ms.end()) return false;
else ms.erase(it);
return true;
}
int main(){
int n;
scanf("%d",&n);
int a[n];
int k = 0;
for (int i = 0; i < n; i++){
scanf("%d",&a[i]);
... | 0 | 53,558,635 |
#include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
struct edge{ll to,cost;};
const int inf = 1<<28;
const ll INF = 1LL<<53;
const int COMBMAX = 500005;
const ll MOD = 1e9+7;
#define _... | 0 | 21,467,670 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n,k;
cin>>n>>k;
vector<long long> tower(n);
vector<long long> tallest(n,-1);
for(long long i=0;i<n;i++){
cin>>tower.at(i);
tallest.at(i)=max(tallest.at(max((long long)0,i-1)),tower.at(i));
}
long l... | 0 | 67,665,122 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M=1e9+7;
ll dp[100005][2];
vector<vector<ll>> adj;
void prepare(vector<pair<ll,ll>>&e){
for(auto i:e){
adj[i.first].push_back(i.second);
adj[i.second].push_back(i.first);
}
}
ll ways(ll start,ll parent=-1,ll c=0){
if(dp[start][c]==-1){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rem(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<... | 0 | 81,449,117 |
#include<bits/stdc++.h>
using namespace std;
#define ll long
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s;
int a, b;
cin >> a >> s >> b;
if (s == "+") {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, ... | 0 | 32,051,297 |
#include<iostream>
#include<cmath>
using namespace std;
const long long size=2e5+1;
long long a[size],x[size];
long long n,s;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
x[i]=x[i-1]+a[i];
s+=a[i];
}
long long min=2e10+5,result;
for(int i=1;i<n;i++)
{
result=abs(2*x[i]-s);
if(min>res... | #include <iostream>
#include <vector>
int main(){
int n = 0;
std::cin >> n;
std::vector<unsigned long long int> a(n);
for (int i = 0; i < n; i++)
{
std::cin >> a[i];
if (a[i] == 0)
{
std::cout << 0 << std::endl;
return 0;
}
}
unsigned l... | 0 | 98,728,276 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int W ,H , N;
cin >> W >> H >> N;
vector <tuple <int , int , int >> A(N);
for ( int i=0 ; i<N ; i++){
int a,b,c;
cin >> a >> b >> c;
A.at(i)=make_tuple(c,a,b);
}
int x_max=W ,x_min=0 , y_max=H , y_min=0;
for ( int i=0 ; i< N ; i++){
... | #include <iostream>
#include <set>
#include <vector>
#include <string>
using namespace std;
void fnDictionary(set<string>& rsesKey, vector<string>& rvsFnd)
{
int nCmdCnt;
cin >> nCmdCnt;
for (int i = 0; i < nCmdCnt; i++)
{
string sCmd;
string sKey;
cin >> sCmd >> sKey;
if (sCmd[0] == 'i')
... | 0 | 21,295,400 |
#include<bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vl = vector<ll>;
int main() {
ll n;
cin >> n;
vl h(n);
rep(i,n) cin >> h[i];
ll ans = 0, cnt = 0;
rep(i,n-1) {
if (h[i] >= h[i+1]) cnt++;
else cnt = 0;
ans = max(ans, cnt);
}
co... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 56,571,520 |
#include <iostream>
#include <vector>
using namespace std;
class Rand
{
public:
Rand(int a, int b, int c, int x);
public:
void rand(int y);
int Num();
private:
int rand();
private:
int m_a, m_b, m_c;
int prev_x;
int m_num;
bool flag;
};
Rand::Rand(int a, int b, int c, int x)
{
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
vector< vector < vector <int> > > a(4,vector< vector <int> >(3,vector<int>(10)));
int n;
cin >> n;
while(n--)
{
int b,f,r,v;
cin >> b >> f >> r >> v;
a[b-1][f-1][r-1] +=v;
}
for(int i = 0; i < 4; i++)
{
... | 0 | 77,811,475 |
#include<cstdio>
#include<vector>
using namespace std;
int n;
int a,b;
vector<int>g[100001];
bool f[100001];
bool dfs(int x,int fa)
{
f[x]=1;
int cnt=0;
for(int i=0;i<g[x].size();i++)
{
if(g[x][i]==fa)continue;
if(dfs(g[x][i],x))return 1;
if(f[g[x][i]])
{
cnt++;
f[x]=0;
if(cnt==2)return 1;
}
}
... | #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>... | 0 | 3,004,200 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int M, K; cin >> M >> K;
if (M == 0) {
cout << (K == 0 ? "0 0" : "-1") << "\n";
return 0;
}
if (M == 1) {
cout << (K == 0 ? "0 0 1 1" : "-1") << "\n";
return 0;
}
... | 0 | 93,725,395 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
ll c=0,ans=0;
for(int i=0;i<n-1;i++)
{
if(a[i+1]>a[i])
{
ans= ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> ... | 0 | 81,871,409 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using ... | #include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);
#define time_taken_start int begtime = clock();
#define time_taken_end int endtime = clock(); \
cerr << "\n\n" << "Time elapsed: " << \
(endtime - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n"; \
return 0;
#define ll l... | 0 | 14,458,460 |
#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>
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; } r... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 0 | 24,284,732 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0; i<(ll)n; i++)
#define REPR(i, n) for(ll i=(ll)n-1; i>=0; i--)
#define FOR(i, m, n) for(ll i=(ll)m; i<(ll)n; i++)
#define FORR(i, m, n) for(ll i=(ll)m-1; i>=(ll)n; i--)
#define ALL(x) (x).begin(), (x).end()
#define ASC(v) s... | #include <iostream>
using namespace std;
int main(){
long long n, cnt=0;
cin >> n;
for(long long i=1; i*i<=n; i++){
if(n % i != 0){
continue;
}
long long a = i, m = n / i - 1;
if(m > a) cnt += m;
}
cout << cnt << endl;
return 0;
} | 0 | 27,607,581 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#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))
#defi... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 9,415,552 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll>pll;
const int N = 105;
int n, m, r[N], c[N];
char arr[N][N];
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 0;i < n;++i)
{
for(int ... | 0 | 32,360,170 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define minva... | # include <algorithm>
# include <cassert>
# include <cctype>
# include <cstdio>
# include <cstdlib>
# include <cstring>
# include <cmath>
# include <iostream>
# include <map>
# include <queue>
# include <set>
# include <sstream>
# include <stack>
# include <string>
# include <vector>
# include <iomanip>
# define rep(i,... | 0 | 7,828,943 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> beg, end;
for (int i = 0, a; i < n; i++) {
cin >> a;
if (i % 2 == 0) {
beg.emplace_back(a);
... | 0 | 48,200,003 |
#include<iostream>
using namespace std;
#include<iomanip>
int main()
{
int a, b, r, d;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (a * 1.0) / b;
cout << d << " " << r << " " << fixed << setprecision(10) << f << endl;
return 0;
} | #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>
#include <cctype>
#in... | 0 | 92,367,277 |
#include <stdio.h>
int main(){
int a,b,c,tmp;
scanf("%d %d %d",&a,&b,&c);
if(a>b){
tmp=a;
a=b;
b=tmp;
}
if(a>c){
tmp=a;
a=c;
c=tmp;
}
if(b>c){
tmp=b;
b=c;
c=tmp;
}
printf("%d %d %d\n",a,b,c);
return 0;
} | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 105
struct Info{
double limit,t;
};
struct Data{
void set(int arg_left,int arg_right,int a... | 0 | 85,903,194 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
using namespac... | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | 0 | 7,724,542 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int a=0;
int b=0;
int ba=0;
int ans = 0;
for(int i = 0; i < N; i++){
string S;
cin >> S;
if(S[0] != 'B' && S[S.size()-1] == 'A') a++;
if(S[0] == 'B' && S[S.size()-1] != 'A') b++;
if(S[0] == 'B' && S[S.size()-1] =... | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
... | 0 | 5,151,731 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int i=0,max=0,maxNumber=-1,maxN=0,maxNNumber=0;
string str[1000];
while(cin>>str[i]){
i++;
}
int wordCount[i+1];
for(int j=0;j<i+1;j++){
wordCount[j]=0;
}
bool kaburi[i+1];
for(int j=0;j<i+1;j++){
... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
#define MAXN 0x3f3f3f3f
ll a[1005];
ll s[500501];
ll ss[41];
ll kkk[41];
int n,k;
vector<ll> K,S;
int pp=40;
void solve(int pos)
{
for(int... | 0 | 20,610,540 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main() {
int n,a,b;
cin>>n>>a>>b;
if(n<a+b-1||n>a*b){
cout<<-1;
return 0;
}
if(b==1){
for(int i=1;i<=n;i++)cout<<i<<' ';
return 0;
}
if(a==1){
for(int i=1;i<=n;i++)cout<<n+1-i<<' ';
return 0;... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
vector<int64_t> vec(N);
int64_t sum = 0;
for(int i=0; i<N; i++){
cin >> vec[i];
sum += vec[i];
}
vector<int64_t> d(N);
for(int i=0; i<N-1; i++){
d[i] = vec[i+1] - vec[i];
}
d[N-1] = vec[0] - vec[N-1];
bool fl... | 0 | 64,873,559 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int a[5],i;
while(cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4]){
sort(a,a+5,greater<int>());
i=0;
for(int i=0;i<5;i++){
cout << a[i];
if(i!=4)cout << " ";
else cout << endl;
}
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
int main() {
string S; cin >> ... | 0 | 1,862,705 |
#include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #include <bits/stdc++.h>
#define int long long int
#define gif(a,b) (a/b +(a%b?1:0))
#define pi 3.14159265358
#define watch(x) cout<<(#x)<<" is "<<(x)<<"\n";
#define float long double
using namespace std;
int32_t main()
{
cin.tie(NULL);
std::ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s... | 0 | 71,990,704 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); 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 FORA(i, n... | 0 | 91,347,439 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vecto... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
int prime[10... | 0 | 82,880,702 |
#include <iostream>
int memo[7][7] = {-1};
int x[3][5] = {{1,2,6,5,1}, {1,3,6,4,1}, {2,3,5,4,2}};
int sides[3][2] = {{4, 3}, {2, 5}, {6, 1}};
int detect_right_side_index(int *dice, int top, int front) {
int top_index, front_index;
bool top_flag = false, front_flag = false;
for (int i = 1; i <= 6; i ++) {
if (... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL <<60;
int count(int c[6][6]){
long res=0;
long long i,j;
for(i=0;i<6;i++){
for(j=0;j<6;j++){
res+=c[i][j];
}
}
return res;
}
int main(void){
long long h,w,k;
long long i,j,l,m;
string tmp;
long long res=0;
int tmp2... | 0 | 72,643,994 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
int main() {
int n;cin>>n;
string a[n];
int b[n];
vector<string>c;
string tmp;
rep(i,n){
cin>>a[i];
c.push_back(a[i]);
b[i]=a[i].size();
... | #include <iostream>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <vector>
using namespace std;
void solver() {
int my=0,n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
my+=arr[i];
}
int var,var1;
var=my/n;
var1=var+1;
in... | 0 | 60,960,994 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 83,719,283 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main() {
int n;
int ans = 0;
cin >> n;
vector<int> button(n + 1, 0);
vector<int> check(n + 1, -1);
rep(i, n) cin >> button[i + 1];
int next = 1;
while(check[next] == -1 &&... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return... | 0 | 33,043,283 |
#include <iostream>
int main() {
int a,b,c,res;
std::cin >> a >> b >> c;
if (a == b && b == c) {
res = 1;
} else if ( a == b || b == c || c == a) {
res = 2;
} else {
res = 3;
}
std::cout << res << std::endl;
} | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | 0 | 91,004,968 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
using ll = long long;
int main() {
string S;
cin >> S;
rep(i, 0, 7){
string S2 = S.substr(0, i) + S.substr(S.size()-7+i... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i,n) for(i = 0; i < n; i++)
#define f1(i,n) for(i = 1; i <= n; i++)
#define all(a) a.begin(),a.end()
#define upp(v,val) upper_bound(v.begin(), v.end(), val)
#define lower(v,val... | 0 | 43,612,683 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.